| /external/llvm-project/llvm/unittests/ADT/ |
| D | SparseBitVectorTest.cpp | 153 EXPECT_EQ(1, Vec.find_first()); in TEST()
157 EXPECT_EQ(1, Vec.find_first()); in TEST()
162 EXPECT_EQ(0, Vec.find_first()); in TEST()
168 EXPECT_EQ(2, Vec.find_first()); in TEST()
178 EXPECT_EQ(500, Vec.find_first()); in TEST()
184 EXPECT_EQ(2000, Vec.find_first()); in TEST()
|
| D | BitVectorTest.cpp | 74 for (unsigned i = Vec.find_first(); i != -1u; i = Vec.find_next(i)) { in TYPED_TEST()
93 EXPECT_TRUE(Vec.find_first() == 3); in TYPED_TEST()
104 for (unsigned i = Vec.find_first(); i != -1u; i = Vec.find_next(i)) { in TYPED_TEST()
210 EXPECT_EQ(12, A.find_first()); in TYPED_TEST()
232 EXPECT_EQ(0, A.find_first()); in TYPED_TEST()
240 EXPECT_EQ(-1, A.find_first()); in TYPED_TEST()
258 EXPECT_EQ(12, A.find_first()); in TYPED_TEST()
294 EXPECT_EQ(-1, A.find_first()); in TYPED_TEST()
301 EXPECT_EQ(-1, A.find_first()); in TYPED_TEST()
317 EXPECT_EQ(3, A.find_first()); in TYPED_TEST()
[all …]
|
| /external/rust/crates/rayon/tests/ |
| D | octillion.rs | 42 let x = octillion().find_first(|_| true); in find_first_octillion()
49 let x = octillion_inclusive().find_first(|_| true); in find_first_octillion_inclusive()
56 let x = octillion_flat().find_first(|_| true); in find_first_octillion_flat()
|
| /external/llvm/unittests/ADT/ |
| D | BitVectorTest.cpp | 77 for (unsigned i = Vec.find_first(); i != -1u; i = Vec.find_next(i)) { in TYPED_TEST()
96 EXPECT_TRUE(Vec.find_first() == 3); in TYPED_TEST()
107 for (unsigned i = Vec.find_first(); i != -1u; i = Vec.find_next(i)) { in TYPED_TEST()
398 EXPECT_EQ(50, C.find_first()); in TYPED_TEST()
|
| /external/swiftshader/third_party/llvm-10.0/llvm/lib/Target/Hexagon/ |
| D | RDFRegisters.cpp | 320 int U = Units.find_first(); in makeRegRef()
351 int F = Regs.find_first(); in makeRegRef()
366 for (int U = Units.find_first(); U >= 0; U = Units.find_next(U)) in print()
374 for (int U = RG.Units.find_first(); U >= 0; U = RG.Units.find_next(U)) { in rr_iterator()
|
| D | HexagonGenInsert.cpp | 103 unsigned find_first() const { in find_first() function
104 int First = BitVector::find_first(); in find_first()
193 for (unsigned R = P.RS.find_first(); R; R = P.RS.find_next(R)) in operator <<()
958 for (unsigned VR = InsDefs.find_first(); VR; VR = InsDefs.find_next(VR)) { in collectInBlock()
979 for (unsigned VR = InsDefs.find_first(); VR; VR = InsDefs.find_next(VR)) in collectInBlock()
989 for (unsigned VR = BlockDefs.find_first(); VR; VR = BlockDefs.find_next(VR)) in collectInBlock()
1008 for (unsigned R = Regs[S].find_first(); R; R = Regs[S].find_next(R)) { in findRemovableRegisters()
1272 for (unsigned R = Rs.find_first(); R; R = Rs.find_next(R)) { in stats()
1299 for (unsigned R = TT.find_first(); R; R = TT.find_next(R)) in selectCandidates()
1304 for (unsigned R = AllRMs.find_first(); R; R = AllRMs.find_next(R)) { in selectCandidates()
[all …]
|
| /external/llvm-project/llvm/lib/CodeGen/ |
| D | RDFRegisters.cpp | 325 int U = Units.find_first(); in makeRegRef()
347 int F = Regs.find_first(); in makeRegRef()
362 for (int U = Units.find_first(); U >= 0; U = Units.find_next(U)) in print()
370 for (int U = RG.Units.find_first(); U >= 0; U = RG.Units.find_next(U)) { in rr_iterator()
|
| /external/swiftshader/third_party/subzero/src/ |
| D | IceBitVector.h | 99 int find_first() const { return find_first<0>(); } in find_first() function
195 typename std::enable_if<Pos == BitsElements, int>::type find_first() const { in find_first() function
201 Pos<BitsElements, int>::type find_first() const {
205 return find_first<Pos + 1>();
388 int find_first() const { in find_first() function
|
| /external/llvm-project/llvm/lib/Target/Hexagon/ |
| D | HexagonGenInsert.cpp | 103 unsigned find_first() const { in find_first() function
104 int First = BitVector::find_first(); in find_first()
193 for (unsigned R = P.RS.find_first(); R; R = P.RS.find_next(R)) in operator <<()
958 for (unsigned VR = InsDefs.find_first(); VR; VR = InsDefs.find_next(VR)) { in collectInBlock()
979 for (unsigned VR = InsDefs.find_first(); VR; VR = InsDefs.find_next(VR)) in collectInBlock()
989 for (unsigned VR = BlockDefs.find_first(); VR; VR = BlockDefs.find_next(VR)) in collectInBlock()
1008 for (unsigned R = Regs[S].find_first(); R; R = Regs[S].find_next(R)) { in findRemovableRegisters()
1272 for (unsigned R = Rs.find_first(); R; R = Rs.find_next(R)) { in stats()
1299 for (unsigned R = TT.find_first(); R; R = TT.find_next(R)) in selectCandidates()
1304 for (unsigned R = AllRMs.find_first(); R; R = AllRMs.find_next(R)) { in selectCandidates()
[all …]
|
| /external/llvm/lib/Target/Hexagon/ |
| D | HexagonGenInsert.cpp | 83 unsigned find_first() const { in find_first() function
84 int First = BitVector::find_first(); in find_first()
170 for (unsigned R = P.RS.find_first(); R; R = P.RS.find_next(R)) in operator <<()
917 for (unsigned VR = InsDefs.find_first(); VR; VR = InsDefs.find_next(VR)) { in collectInBlock()
935 for (unsigned VR = InsDefs.find_first(); VR; VR = InsDefs.find_next(VR)) in collectInBlock()
948 for (unsigned VR = BlockDefs.find_first(); VR; VR = BlockDefs.find_next(VR)) in collectInBlock()
968 for (unsigned R = Regs[S].find_first(); R; R = Regs[S].find_next(R)) { in findRemovableRegisters()
1234 for (unsigned R = Rs.find_first(); R; R = Rs.find_next(R)) { in stats()
1262 for (unsigned R = TT.find_first(); R; R = TT.find_next(R)) in selectCandidates()
1267 for (unsigned R = AllRMs.find_first(); R; R = AllRMs.find_next(R)) { in selectCandidates()
[all …]
|
| /external/swiftshader/third_party/llvm-10.0/llvm/include/llvm/ADT/ |
| D | SparseBitVector.h | 127 int find_first() const { in find_first() function
346 unsigned BitPos = Iter->find_first(); in AdvanceToFirstNonZero()
378 NextSetBitNumber = Iter->find_first(); in AdvanceToNextNonZero()
779 int find_first() const { in find_first() function
783 return (First.index() * ElementSize) + First.find_first(); in find_first()
|
| /external/llvm-project/llvm/include/llvm/ADT/ |
| D | SparseBitVector.h | 127 int find_first() const { in find_first() function
346 unsigned BitPos = Iter->find_first(); in AdvanceToFirstNonZero()
378 NextSetBitNumber = Iter->find_first(); in AdvanceToNextNonZero()
779 int find_first() const { in find_first() function
783 return (First.index() * ElementSize) + First.find_first(); in find_first()
|
| /external/swiftshader/third_party/llvm-10.0/llvm/lib/Target/Mips/ |
| D | Mips16InstrInfo.cpp | 387 Reg = Available.find_first(); in loadImmediate()
390 Reg = Candidates.find_first(); in loadImmediate()
403 SpReg = Available.find_first(); in loadImmediate()
405 SpReg = Candidates.find_first(); in loadImmediate()
|
| /external/llvm-project/llvm/lib/Target/Mips/ |
| D | Mips16InstrInfo.cpp | 387 Reg = Available.find_first(); in loadImmediate()
390 Reg = Candidates.find_first(); in loadImmediate()
403 SpReg = Available.find_first(); in loadImmediate()
405 SpReg = Candidates.find_first(); in loadImmediate()
|
| /external/llvm/include/llvm/ADT/ |
| D | SparseBitVector.h | 131 int find_first() const {
337 unsigned BitPos = Iter->find_first();
369 NextSetBitNumber = Iter->find_first();
801 int find_first() const {
805 return (First.index() * ElementSize) + First.find_first();
|
| /external/llvm/lib/CodeGen/ |
| D | RegisterScavenging.cpp | 59 for (int I = PR.find_first(); I>0; I = PR.find_next(I)) in initRegState()
280 int Survivor = Candidates.find_first(); in findSurvivorReg()
328 Survivor = Candidates.find_first(); in findSurvivorReg()
|
| D | SpillPlacement.cpp | 313 for (int n = ActiveNodes->find_first(); n>=0; n = ActiveNodes->find_next(n)) { in scanActiveBundles()
368 for (int n = ActiveNodes->find_first(); n>=0; n = ActiveNodes->find_next(n)) in finish()
|
| D | SafeStackColoring.h | 127 int idx = V.find_first();
|
| D | StackSlotColoring.cpp | 215 NextColor = AllColors.find_first(); in InitializeSlots()
238 Color = UsedColors.find_first(); in ColorSlot()
|
| /external/llvm/lib/Target/Mips/ |
| D | Mips16InstrInfo.cpp | 372 Reg = Available.find_first(); in loadImmediate()
375 Reg = Candidates.find_first(); in loadImmediate()
388 SpReg = Available.find_first(); in loadImmediate()
390 SpReg = Candidates.find_first(); in loadImmediate()
|
| /external/rust/crates/rayon/src/iter/ |
| D | mod.rs | 1682 fn find_first<P>(self, predicate: P) -> Option<Self::Item> in find_first() method
1686 find_first_last::find_first(self, predicate) in find_first()
1783 self.filter_map(predicate).find_first(yes) in find_map_first()
2379 .find_first(inequal) in cmp()
2419 .find_first(inequal) in partial_cmp()
2640 let (i, _) = self.map(predicate).enumerate().find_first(check)?; in position_first()
|
| /external/swiftshader/third_party/llvm-10.0/llvm/lib/CodeGen/ |
| D | SafeStackColoring.h | 142 int idx = V.find_first();
|
| /external/llvm-project/llvm/include/llvm/Analysis/ |
| D | StackLifetime.h | 171 int Idx = V.find_first();
|
| /external/llvm/lib/Analysis/ |
| D | DependenceAnalysis.cpp | 2986 for (int LI = Loops.find_first(); LI >= 0; LI = Loops.find_next(LI)) { in propagate()
3268 for (int VI = BV.find_first(); VI >= 0; VI = BV.find_next(VI)) { in dumpSmallBitVector()
3508 for (int SI = Separable.find_first(); SI >= 0; SI = Separable.find_next(SI)) { in depends()
3547 for (int SI = Coupled.find_first(); SI >= 0; SI = Coupled.find_next(SI)) { in depends()
3554 for (int SJ = Group.find_first(); SJ >= 0; SJ = Group.find_next(SJ)) { in depends()
3566 for (int SJ = Sivs.find_first(); SJ >= 0; SJ = Sivs.find_next(SJ)) { in depends()
3590 for (int SJ = Mivs.find_first(); SJ >= 0; SJ = Mivs.find_next(SJ)) { in depends()
3624 for (int SJ = Mivs.find_first(); SJ >= 0; SJ = Mivs.find_next(SJ)) { in depends()
3637 for (int SJ = Mivs.find_first(); SJ >= 0; SJ = Mivs.find_next(SJ)) { in depends()
3649 for (int SJ = ConstrainedLevels.find_first(); SJ >= 0; in depends()
[all …]
|
| /external/llvm/lib/Target/WebAssembly/ |
| D | WebAssemblyRegColoring.cpp | 143 for (int C(UsedColors.find_first()); C != -1; in runOnMachineFunction()
|