| /external/llvm/include/llvm/IR/ |
| Value.h | 164 /// \brief Returns true if this iterator is equal to user_end() on the value.
344 user_iterator user_end() { return user_iterator(); } function
345 const_user_iterator user_end() const { return const_user_iterator(); } function
356 return make_range(materialized_user_begin(), user_end());
360 return make_range(materialized_user_begin(), user_end());
|
| CFG.h | 51 inline PredIterator(Ptr *bb, bool) : It(bb->user_end()) {}
|
| /external/llvm/lib/Target/Hexagon/ |
| HexagonOptimizeSZextends.cpp | 133 for (auto UI = Ashr->user_begin(), UE = Ashr->user_end();
|
| /external/llvm/lib/Target/XCore/ |
| XCoreLowerThreadLocal.cpp | 131 SmallVector<WeakVH,8> WUsers(CE->user_begin(), CE->user_end());
205 SmallVector<User *, 16> Users(GV->user_begin(), GV->user_end());
|
| /external/llvm/lib/Analysis/ |
| CodeMetrics.cpp | 48 if (!std::all_of(V->user_begin(), V->user_end(),
|
| MemoryBuiltins.cpp | 251 for (Value::const_user_iterator UI = CI->user_begin(), E = CI->user_end();
|
| /external/llvm/lib/CodeGen/ |
| InterleavedAccessPass.cpp | 186 for (auto UI = LI->user_begin(), E = LI->user_end(); UI != E; UI++) {
|
| SjLjEHPrepare.cpp | 159 SmallVector<Value *, 8> UseWorkList(LPI->user_begin(), LPI->user_end());
|
| CodeGenPrepare.cpp | 717 for (Value::user_iterator UI = CI->user_begin(), E = CI->user_end();
[all...] |
| /external/llvm/lib/Transforms/IPO/ |
| PartialInlining.cpp | 133 duplicateFunction->user_end());
|
| IPConstantPropagation.cpp | 249 for (auto I = Call->user_begin(), E = Call->user_end(); I != E;) {
|
| GlobalOpt.cpp | 206 for (Value::user_iterator UI = GV->user_begin(), E = GV->user_end();
282 SmallVector<WeakVH, 8> WorkList(V->user_begin(), V->user_end());
681 for (auto UI = V->user_begin(), E = V->user_end(); UI != E; ) {
756 for (Value::user_iterator GUI = GV->user_begin(), E = GV->user_end(); GUI != E;){
812 for (Value::user_iterator UI = V->user_begin(), E = V->user_end(); UI != E; )
[all...] |
| ArgumentPromotion.cpp | 183 WorkList.insert(WorkList.end(), arg->user_begin(), arg->user_end());
189 WorkList.insert(WorkList.end(), V->user_begin(), V->user_end());
[all...] |
| DeadArgumentElimination.cpp | 239 for (Value::user_iterator I = Fn.user_begin(), E = Fn.user_end(); I != E; ) {
[all...] |
| /external/llvm/lib/Transforms/Utils/ |
| PromoteMemoryToRegister.cpp | 125 for (auto UI = AI->user_begin(), E = AI->user_end(); UI != E;) {
308 for (auto UI = AI->user_begin(), UE = AI->user_end(); UI != UE;) {
318 for (auto UUI = I->user_begin(), UUE = I->user_end(); UUI != UUE;) {
348 for (auto UI = AI->user_begin(), E = AI->user_end(); UI != E;) {
458 for (auto UI = AI->user_begin(), E = AI->user_end(); UI != E;) {
[all...] |
| CodeExtractor.cpp | 374 std::vector<User*> Users(inputs[i]->user_begin(), inputs[i]->user_end());
394 std::vector<User*> Users(header->user_begin(), header->user_end());
504 std::vector<User*> Users(outputs[i]->user_begin(), outputs[i]->user_end());
|
| Local.cpp | 386 Value::user_iterator UE = I->user_end();
[all...] |
| /external/llvm/lib/Transforms/Scalar/ |
| IndVarSimplify.cpp | 308 if (IncrUse == Incr->user_end()) return;
310 if (IncrUse != Incr->user_end()) return;
629 for (auto IB = Inst->user_begin(), IE = Inst->user_end();
643 PE = UseInstr->user_end();
[all...] |
| MemCpyOptimizer.cpp | 671 srcAlloca->user_end());
[all...] |
| LoopInterchange.cpp | 604 return !std::any_of(Ins->user_begin(), Ins->user_end(), [=](User *U) -> bool {
[all...] |
| /external/compiler-rt/lib/asan/ |
| asan_allocator.cc | 394 uptr user_end = user_beg + size; local
395 CHECK_LE(user_end, alloc_end);
|
| /external/llvm/lib/Transforms/InstCombine/ |
| InstCombineLoadStoreAlloca.cpp | 475 if (std::all_of(LI.user_begin(), LI.user_end(), [&LI](User *U) {
483 for (auto UI = LI.user_begin(), UE = LI.user_end(); UI != UE;) {
[all...] |
| /external/llvm/lib/IR/ |
| Value.cpp | 121 const_user_iterator UI = user_begin(), UE = user_end();
|
| AutoUpgrade.cpp | [all...] |
| /external/llvm/lib/Transforms/Vectorize/ |
| LoopVectorize.cpp | [all...] |
