| /external/rust/crates/criterion/src/stats/ |
| D | mod.rs | 63 pub fn p_value(&self, t: A, tails: &Tails) -> A { in p_value()
70 Tails::One => 1, in p_value()
71 Tails::Two => 2, in p_value()
89 pub enum Tails { enum
|
| /external/llvm/lib/Transforms/Vectorize/ |
| D | LoadStoreVectorizer.cpp | 597 SmallSetVector<int, 16> Heads, Tails; in vectorizeInstructions() local
616 Tails.insert(j); in vectorizeInstructions()
630 for (unsigned TIt = 0; TIt < Tails.size(); TIt++) in vectorizeInstructions()
631 if (Head == Tails[TIt] && in vectorizeInstructions()
643 while (I != -1 && (Tails.count(I) || Heads.count(I))) { in vectorizeInstructions()
|
| D | SLPVectorizer.cpp | 3632 SetVector<StoreInst *> Heads, Tails; in vectorizeStores() local
3657 Tails.insert(Stores[k]); in vectorizeStores()
3668 if (Tails.count(*it)) in vectorizeStores()
3676 while (Tails.count(I) || Heads.count(I)) { in vectorizeStores()
|
| /external/rust/crates/criterion/src/analysis/ |
| D | mod.rs | 7 use crate::stats::{Distribution, Tails};
200 let p_value = t_distribution.p_value(t_value, &Tails::Two); in common()
|
| /external/swiftshader/third_party/llvm-10.0/llvm/lib/Transforms/Vectorize/ |
| D | LoadStoreVectorizer.cpp | 873 SmallVector<int, 16> Heads, Tails; in vectorizeInstructions() local
892 Tails.push_back(j); in vectorizeInstructions()
906 for (unsigned TIt = 0; TIt < Tails.size(); TIt++) in vectorizeInstructions()
907 if (Head == Tails[TIt] && in vectorizeInstructions()
919 while (I != -1 && (is_contained(Tails, I) || is_contained(Heads, I))) { in vectorizeInstructions()
|
| D | SLPVectorizer.cpp | 5738 SmallBitVector Tails(E, false); in vectorizeStores() local
5742 auto &&FindConsecutiveAccess = [this, &Stores, &Tails, &IterCnt, MaxIter, in vectorizeStores()
5750 Tails.set(Idx); in vectorizeStores()
5772 if (ConsecutiveChain[I] == E + 1 || Tails.test(I)) in vectorizeStores()
|
| /external/llvm-project/llvm/lib/Transforms/Vectorize/ |
| D | LoadStoreVectorizer.cpp | 915 SmallVector<int, 16> Heads, Tails; in vectorizeInstructions() local
934 Tails.push_back(j); in vectorizeInstructions()
948 for (unsigned TIt = 0; TIt < Tails.size(); TIt++) in vectorizeInstructions()
949 if (Head == Tails[TIt] && in vectorizeInstructions()
961 while (I != -1 && (is_contained(Tails, I) || is_contained(Heads, I))) { in vectorizeInstructions()
|
| D | SLPVectorizer.cpp | 6025 SmallBitVector Tails(E, false); in vectorizeStores() local
6029 auto &&FindConsecutiveAccess = [this, &Stores, &Tails, &IterCnt, MaxIter, in vectorizeStores()
6037 Tails.set(Idx); in vectorizeStores()
6059 if (ConsecutiveChain[I] == E + 1 || Tails.test(I)) in vectorizeStores()
|
| /external/llvm/lib/Transforms/Scalar/ |
| D | LoopIdiomRecognize.cpp | 511 SetVector<StoreInst *> Heads, Tails; in processLoopStores() local
585 Tails.insert(SL[k]); in processLoopStores()
601 if (Tails.count(*it)) in processLoopStores()
613 while (Tails.count(I) || Heads.count(I)) { in processLoopStores()
|
| /external/llvm-project/llvm/lib/Transforms/Scalar/ |
| D | LoopIdiomRecognize.cpp | 647 SetVector<StoreInst *> Heads, Tails; in processLoopStores() local
725 Tails.insert(SL[k]); in processLoopStores()
741 if (Tails.count(*it)) in processLoopStores()
753 while (Tails.count(I) || Heads.count(I)) { in processLoopStores()
|
| /external/swiftshader/third_party/llvm-10.0/llvm/lib/Transforms/Scalar/ |
| D | LoopIdiomRecognize.cpp | 606 SetVector<StoreInst *> Heads, Tails; in processLoopStores() local
684 Tails.insert(SL[k]); in processLoopStores()
700 if (Tails.count(*it)) in processLoopStores()
712 while (Tails.count(I) || Heads.count(I)) { in processLoopStores()
|