/external/rust/crates/grpcio-sys/grpc/third_party/abseil-cpp/absl/random/internal/ |
D | nanobenchmark.cc | 374 const size_t idx_begin, const size_t half_count) { in MinRange() argument 378 for (size_t idx = idx_begin; idx < idx_begin + half_count; ++idx) { in MinRange() 399 size_t idx_begin = 0; in ModeOfSorted() local 402 idx_begin = MinRange(sorted, idx_begin, half_count); in ModeOfSorted() 406 const T x = sorted[idx_begin + 0]; in ModeOfSorted() 411 const T average = (x + sorted[idx_begin + 1] + 1) / 2; in ModeOfSorted()
|
/external/angle/third_party/abseil-cpp/absl/random/internal/ |
D | nanobenchmark.cc | 374 const size_t idx_begin, const size_t half_count) { in MinRange() argument 378 for (size_t idx = idx_begin; idx < idx_begin + half_count; ++idx) { in MinRange() 399 size_t idx_begin = 0; in ModeOfSorted() local 402 idx_begin = MinRange(sorted, idx_begin, half_count); in ModeOfSorted() 406 const T x = sorted[idx_begin + 0]; in ModeOfSorted() 411 const T average = (x + sorted[idx_begin + 1] + 1) / 2; in ModeOfSorted()
|
/external/libtextclassifier/abseil-cpp/absl/random/internal/ |
D | nanobenchmark.cc | 374 const size_t idx_begin, const size_t half_count) { in MinRange() argument 378 for (size_t idx = idx_begin; idx < idx_begin + half_count; ++idx) { in MinRange() 399 size_t idx_begin = 0; in ModeOfSorted() local 402 idx_begin = MinRange(sorted, idx_begin, half_count); in ModeOfSorted() 406 const T x = sorted[idx_begin + 0]; in ModeOfSorted() 411 const T average = (x + sorted[idx_begin + 1] + 1) / 2; in ModeOfSorted()
|
/external/webrtc/third_party/abseil-cpp/absl/random/internal/ |
D | nanobenchmark.cc | 374 const size_t idx_begin, const size_t half_count) { in MinRange() argument 378 for (size_t idx = idx_begin; idx < idx_begin + half_count; ++idx) { in MinRange() 399 size_t idx_begin = 0; in ModeOfSorted() local 402 idx_begin = MinRange(sorted, idx_begin, half_count); in ModeOfSorted() 406 const T x = sorted[idx_begin + 0]; in ModeOfSorted() 411 const T average = (x + sorted[idx_begin + 1] + 1) / 2; in ModeOfSorted()
|
/external/openscreen/third_party/abseil/src/absl/random/internal/ |
D | nanobenchmark.cc | 374 const size_t idx_begin, const size_t half_count) { in MinRange() argument 378 for (size_t idx = idx_begin; idx < idx_begin + half_count; ++idx) { in MinRange() 399 size_t idx_begin = 0; in ModeOfSorted() local 402 idx_begin = MinRange(sorted, idx_begin, half_count); in ModeOfSorted() 406 const T x = sorted[idx_begin + 0]; in ModeOfSorted() 411 const T average = (x + sorted[idx_begin + 1] + 1) / 2; in ModeOfSorted()
|
/external/abseil-cpp/absl/random/internal/ |
D | nanobenchmark.cc | 374 const size_t idx_begin, const size_t half_count) { in MinRange() argument 378 for (size_t idx = idx_begin; idx < idx_begin + half_count; ++idx) { in MinRange() 399 size_t idx_begin = 0; in ModeOfSorted() local 402 idx_begin = MinRange(sorted, idx_begin, half_count); in ModeOfSorted() 406 const T x = sorted[idx_begin + 0]; in ModeOfSorted() 411 const T average = (x + sorted[idx_begin + 1] + 1) / 2; in ModeOfSorted()
|
/external/llvm-project/llvm/include/llvm/IR/ |
D | Operator.h | 482 inline op_iterator idx_begin() { return op_begin()+1; } in idx_begin() function 483 inline const_op_iterator idx_begin() const { return op_begin()+1; } in idx_begin() function 522 for (const_op_iterator I = idx_begin(), E = idx_end(); I != E; ++I) { in hasAllZeroIndices() 535 for (const_op_iterator I = idx_begin(), E = idx_end(); I != E; ++I) { in hasAllConstantIndices() 543 return count_if(make_range(idx_begin(), idx_end()), [](const Use& use) { in countNonConstantIndices()
|
/external/swiftshader/third_party/llvm-10.0/llvm/include/llvm/IR/ |
D | Operator.h | 482 inline op_iterator idx_begin() { return op_begin()+1; } in idx_begin() function 483 inline const_op_iterator idx_begin() const { return op_begin()+1; } in idx_begin() function 522 for (const_op_iterator I = idx_begin(), E = idx_end(); I != E; ++I) { in hasAllZeroIndices() 535 for (const_op_iterator I = idx_begin(), E = idx_end(); I != E; ++I) { in hasAllConstantIndices() 543 return count_if(make_range(idx_begin(), idx_end()), [](const Use& use) { in countNonConstantIndices()
|
/external/llvm/include/llvm/IR/ |
D | Operator.h | 383 inline op_iterator idx_begin() { return op_begin()+1; } in idx_begin() function 384 inline const_op_iterator idx_begin() const { return op_begin()+1; } in idx_begin() function 423 for (const_op_iterator I = idx_begin(), E = idx_end(); I != E; ++I) { in hasAllZeroIndices() 436 for (const_op_iterator I = idx_begin(), E = idx_end(); I != E; ++I) { in hasAllConstantIndices()
|
/external/swiftshader/third_party/llvm-10.0/llvm/lib/CodeGen/ |
D | DwarfEHPrepare.cpp | 112 if (SelIVI->getNumIndices() == 1 && *SelIVI->idx_begin() == 1) { in GetExceptionObject() 115 ExcIVI->getNumIndices() == 1 && *ExcIVI->idx_begin() == 0) { in GetExceptionObject()
|
D | SjLjEHPrepare.cpp | 146 if (*EVI->idx_begin() == 0) in substituteLPadValues() 148 else if (*EVI->idx_begin() == 1) in substituteLPadValues()
|
/external/llvm/lib/CodeGen/ |
D | DwarfEHPrepare.cpp | 109 if (SelIVI->getNumIndices() == 1 && *SelIVI->idx_begin() == 1) { in GetExceptionObject() 112 ExcIVI->getNumIndices() == 1 && *ExcIVI->idx_begin() == 0) { in GetExceptionObject()
|
D | SjLjEHPrepare.cpp | 143 if (*EVI->idx_begin() == 0) in substituteLPadValues() 145 else if (*EVI->idx_begin() == 1) in substituteLPadValues()
|
/external/llvm-project/llvm/lib/CodeGen/ |
D | DwarfEHPrepare.cpp | 117 if (SelIVI->getNumIndices() == 1 && *SelIVI->idx_begin() == 1) { in GetExceptionObject() 120 ExcIVI->getNumIndices() == 1 && *ExcIVI->idx_begin() == 0) { in GetExceptionObject()
|
D | SjLjEHPrepare.cpp | 153 if (*EVI->idx_begin() == 0) in substituteLPadValues() 155 else if (*EVI->idx_begin() == 1) in substituteLPadValues()
|
/external/llvm-project/llvm/unittests/IR/ |
D | InstructionsTest.cpp | 755 ASSERT_NE(GEPI->idx_begin(), GEPI->idx_end()); in TEST() 756 ASSERT_EQ(GEPI->idx_end(), std::next(GEPI->idx_begin(), 3)); in TEST() 757 EXPECT_EQ(Indices[0], GEPI->idx_begin()[0]); in TEST() 758 EXPECT_EQ(Indices[1], GEPI->idx_begin()[1]); in TEST() 759 EXPECT_EQ(Indices[2], GEPI->idx_begin()[2]); in TEST() 760 EXPECT_EQ(GEPI->idx_begin(), GEPI->indices().begin()); in TEST() 764 ASSERT_NE(CGEPI->idx_begin(), CGEPI->idx_end()); in TEST() 765 ASSERT_EQ(CGEPI->idx_end(), std::next(CGEPI->idx_begin(), 3)); in TEST() 766 EXPECT_EQ(Indices[0], CGEPI->idx_begin()[0]); in TEST() 767 EXPECT_EQ(Indices[1], CGEPI->idx_begin()[1]); in TEST() [all …]
|
/external/llvm/lib/Transforms/Scalar/ |
D | StraightLineStrengthReduce.cpp | 240 for (auto I = GEP->idx_begin(); I != GEP->idx_end(); ++I) in isGEPFoldable() 268 for (auto I = GEP->idx_begin(); I != GEP->idx_end(); ++I) { in hasOnlyOneNonZeroIndex() 489 for (auto I = GEP->idx_begin(); I != GEP->idx_end(); ++I) in allocateCandidatesAndFindBasisForGEP()
|
D | NaryReassociate.cpp | 305 for (auto I = GEP->idx_begin(); I != GEP->idx_end(); ++I) in isGEPFoldable() 375 for (auto Index = GEP->idx_begin(); Index != GEP->idx_end(); ++Index) in tryReassociateGEPAtIndex()
|
/external/swiftshader/third_party/llvm-10.0/llvm/lib/Transforms/Scalar/ |
D | StraightLineStrengthReduce.cpp | 276 for (auto I = GEP->idx_begin(); I != GEP->idx_end(); ++I) in isGEPFoldable() 304 for (auto I = GEP->idx_begin(); I != GEP->idx_end(); ++I) { in hasOnlyOneNonZeroIndex() 525 for (auto I = GEP->idx_begin(); I != GEP->idx_end(); ++I) in allocateCandidatesAndFindBasisForGEP()
|
D | NaryReassociate.cpp | 301 for (auto I = GEP->idx_begin(); I != GEP->idx_end(); ++I) in isGEPFoldable() 373 for (auto Index = GEP->idx_begin(); Index != GEP->idx_end(); ++Index) in tryReassociateGEPAtIndex()
|
/external/llvm/lib/Transforms/InstCombine/ |
D | InstructionCombining.cpp | 1543 } else if (isa<Constant>(*GEP.idx_begin()) && in visitGetElementPtrInst() 1544 cast<Constant>(*GEP.idx_begin())->isNullValue() && in visitGetElementPtrInst() 1548 Indices.append(GEP.idx_begin()+1, GEP.idx_end()); in visitGetElementPtrInst() 1633 SmallVector<Value*, 8> Idx(GEP.idx_begin()+1, GEP.idx_end()); in visitGetElementPtrInst() 1671 SmallVector<Value*, 8> Idx(GEP.idx_begin(), GEP.idx_end()); in visitGetElementPtrInst() 2244 for (exti = EV.idx_begin(), insi = IV->idx_begin(), in visitExtractValueInst() 2303 if (*EV.idx_begin() == 0) { // Normal result. in visitExtractValueInst() 2320 if (*EV.idx_begin() == 0) { // Normal result. in visitExtractValueInst() 2329 if (*EV.idx_begin() == 0) { // Normal result. in visitExtractValueInst() 2352 for (ExtractValueInst::idx_iterator I = EV.idx_begin(), E = EV.idx_end(); in visitExtractValueInst()
|
/external/llvm-project/llvm/lib/Transforms/Scalar/ |
D | NaryReassociate.cpp | 297 for (auto I = GEP->idx_begin(); I != GEP->idx_end(); ++I) in isGEPFoldable() 369 for (auto Index = GEP->idx_begin(); Index != GEP->idx_end(); ++Index) in tryReassociateGEPAtIndex()
|
D | StraightLineStrengthReduce.cpp | 289 for (auto I = GEP->idx_begin(); I != GEP->idx_end(); ++I) in isGEPFoldable() 317 for (auto I = GEP->idx_begin(); I != GEP->idx_end(); ++I) { in hasOnlyOneNonZeroIndex() 538 for (auto I = GEP->idx_begin(); I != GEP->idx_end(); ++I) in allocateCandidatesAndFindBasisForGEP()
|
/external/llvm/lib/Target/NVPTX/ |
D | NVPTXFavorNonGenericAddrSpaces.cpp | 159 SmallVector<Value *, 8> Indices(GEP->idx_begin(), GEP->idx_end()); in hoistAddrSpaceCastFromGEP()
|
/external/llvm/lib/Transforms/IPO/ |
D | IPConstantPropagation.cpp | 230 index = *EV->idx_begin(); in PropagateConstantReturn()
|