Searched defs:Users (Results 1 - 6 of 6) sorted by relevance

/external/llvm/lib/CodeGen/
H A DSjLjEHPrepare.cpp306 SmallVector<Instruction*, 16> Users; local
311 Users.push_back(User);
317 while (!Users.empty()) {
318 Instruction *U = Users.back();
319 Users.pop_back();
/external/llvm/lib/Transforms/Utils/
H A DLowerInvoke.cpp341 SmallVector<Instruction*,16> Users; local
346 Users.push_back(User);
357 while (!Users.empty()) {
358 Instruction *U = Users.back();
359 Users.pop_back();
/external/llvm/lib/Transforms/InstCombine/
H A DInstructionCombining.cpp1110 isAllocSiteRemovable(Instruction *AI, SmallVectorImpl<WeakVH> &Users, argument
1127 Users.push_back(I);
1136 Users.push_back(I);
1162 Users.push_back(I);
1168 Users.push_back(I);
1177 Users.push_back(I);
1191 SmallVector<WeakVH, 64> Users; local
1192 if (isAllocSiteRemovable(&MI, Users, TLI)) {
1193 for (unsigned i = 0, e = Users.size(); i != e; ++i) {
1194 Instruction *I = cast_or_null<Instruction>(&*Users[
[all...]
/external/llvm/lib/Transforms/Vectorize/
H A DBBVectorize.cpp230 bool trackUsesOfI(DenseSet<Value *> &Users,
774 // structures associated with I. Specifically, Users represents the set of
777 // and J uses I, then Users is updated to contain J and WriteSet is updated
788 bool BBVectorize::trackUsesOfI(DenseSet<Value *> &Users, argument
796 if (Users.count(J))
803 if (I == V || Users.count(V)) {
825 Users.insert(J);
848 DenseSet<Value *> Users; local
856 bool UsesI = trackUsesOfI(Users, WriteSet, I, J, !Config.FastDep);
1031 // Iterate through the basic block, recording all Users o
1038 DenseSet<Value *> Users; local
2101 DenseSet<Value *> Users; local
2121 DenseSet<Value *> Users; local
2149 DenseSet<Value *> Users; local
[all...]
/external/llvm/lib/Transforms/Scalar/
H A DLoopStrengthReduce.cpp2388 /// any IV users that keep the IV live across increments (the Users set should
2397 isProfitableChain(IVChain &Chain, SmallPtrSet<Instruction*, 4> &Users, argument
2405 if (!Users.empty()) {
2407 for (SmallPtrSet<Instruction*, 4>::const_iterator I = Users.begin(),
2408 E = Users.end(); I != E; ++I) {
2618 // consider leaf IV Users. This effectively rediscovers a portion of
4606 DEBUG(dbgs() << "LSR skipping loop, too many IV Users in " << *L
H A DObjCARC.cpp2225 SmallVector<const Value *, 2> Users; local
2226 Users.push_back(Ptr);
2228 Ptr = Users.pop_back_val();
2235 Users.push_back(I);
2237 } while (!Users.empty());

Completed in 276 milliseconds