Searched refs:users (Results 101 - 125 of 175) sorted by relevance

1234567

/external/llvm/lib/Transforms/IPO/
H A DGlobalOpt.cpp179 /// CleanupPointerRootUsers - This GV is a pointer root. Loop over all users
267 /// users of the global, cleaning up the obvious ones. This is largely just a
381 for (User *U : GEPI->users())
448 for (User *UU : U->users())
459 for (User *U : GV->users())
611 /// AllUsesOfValueWillTrapIfNull - Return true if all users of the specified
616 for (const User *U : V->users())
658 for (const User *U : GV->users())
849 // If there are bitcast users of the malloc (which is typical, usually we have
851 // other users t
[all...]
H A DInliner.cpp369 for (User *U : Caller->users()) {
661 // If the only remaining users of the function are dead constants, remove
H A DMergeFunctions.cpp1474 for (User *U : V->users()) {
1480 for (User *UU : C->users())
/external/llvm/lib/Transforms/Scalar/
H A DScalarReplAggregates.cpp471 for (User *U : V->users()) {
591 /// ConvertUsesToScalar - Convert all of the users of Ptr to use the new alloca
1067 for (User *U : DebugNode->users())
1148 for (User *U : SI->users()) {
1184 // TODO: Allow recursive phi users.
1188 for (User *U : PN->users()) {
1247 for (User *U : AI->users()) {
1435 for (User *U : AI->users())
1506 // all its users can be transformed, then split up the aggregate into its
1664 for (User *U : I->users()) {
[all...]
H A DLICM.cpp376 // of the loop. We can do this if the all users of the instruction are
507 /// isNotUsedInLoop - Return true if the only users of this instruction are
512 for (User *U : I.users()) {
593 // If this instruction is only used outside of the loop, then all users are
816 for (User *U : ASIV->users()) {
H A DLoopIdiomRecognize.cpp460 for (User *U : Inst->users()) {
597 for (User *U : CntInst->users())
H A DMemCpyOptimizer.cpp674 for (User *UU : U->users())
678 for (User *UU : U->users())
H A DIndVarSimplify.cpp467 // RewriteLoopExitValues - Optimize IV users outside the loop.
706 /// phi of the wider type and redirects all users, either removing extends or
968 // of the new users, because their parent IV will be processed later as a
1020 /// pushNarrowIVUsers - Add eligible users of NarrowDef to NarrowIVUsers.
1023 for (User *U : NarrowDef->users()) {
1038 /// interesting IV users, the narrow IV will be isolated for removal by
1120 // Simplification of IV users based on SCEV evaluation.
1147 /// users. Each successive simplification may push more users which may
1421 for (User *U : Phi->users())
[all...]
/external/chromium_org/third_party/WebKit/Tools/Scripts/webkitpy/thirdparty/irc/
H A Dircbot.py323 def users(self): member in class:Channel
324 """Returns an unsorted list of the channel's users."""
/external/llvm/lib/CodeGen/
H A DAtomicExpandLoadLinkedPass.cpp321 // Look for any users of the cmpxchg that are just comparing the loaded value
324 for (auto User : CI->users()) {
H A DStackProtector.cpp154 for (const User *U : AI->users()) {
H A DCodeGenPrepare.cpp199 // users. Do this before OptimizeBlock -> OptimizeInst ->
349 for (const User *U : PN->users()) {
2856 // If the load has other users and the truncate is not free, this probably
2902 for (User *U : I->users()) {
2915 for (User *U : Src->users()) {
3074 for (User *U : SVI->users()) {
3293 // Push the "and; icmp" for any users that are conditional branches.
H A DSjLjEHPrepare.cpp308 // Avoid iterator invalidation by copying users to a temporary vector.
310 for (User *U : Inst->users()) {
/external/eclipse-basebuilder/basebuilder-3.6.2/org.eclipse.releng.basebuilder/plugins/org.apache.ant_1.7.1.v20090120-1145/bin/
H A Dant.bat107 rem check for ant in C:\ant for Win9X users
/external/llvm/lib/Transforms/InstCombine/
H A DInstCombinePHI.cpp260 for (User *U : AI->users()) {
652 for (User *U : PN->users()) {
679 // If we have no users, they must be all self uses, just nuke the PHI.
684 // extracted out of it. First, sort the users by their offset and size.
/external/llvm/lib/Transforms/Utils/
H A DInlineFunction.cpp410 for (User *U : V->users()) {
433 for (User *U : AI->users()) {
918 // any users of the original call/invoke instruction.
H A DPromoteMemoryToRegister.cpp66 for (const User *U : AI->users()) {
326 // The only users of this bitcast/GEP instruction are lifetime intrinsics.
456 for (User *U : AI->users())
656 // tree. Just delete the users now.
H A DSimplifyLibCalls.cpp92 for (User *U : V->users()) {
107 for (User *U : V->users()) {
1126 for (User *U : CI->users()) {
1162 for (User *U : CI->users()) {
1375 for (User *U : Arg->users())
H A DLocal.cpp1053 for (User *U : AI->users())
1077 for (User *U : DebugNode->users())
/external/sepolicy/
H A DAndroid.mk93 users \
/external/chromium_org/chrome/browser/resources/chromeos/login/
H A Dscreen_supervised_user_creation.js249 * UI element for displaying single supervised user in list of possible users
250 * for importing existing users.
1327 * @param {Array} userList - list of users that can be managers.
1563 setExistingSupervisedUsers: function(users) {
1569 var userList = users;
1571 // Put existing users last.
/external/lldb/source/Expression/
H A DIRForTarget.cpp704 log->Printf(" <Begin %d users>", value->getNumUses());
1172 // Replace the load with the call in all users
2185 SmallVector<User*, 16> users; local
2192 users.push_back(*ui);
2195 i < users.size();
2198 User *user = users[i];
/external/llvm/lib/Analysis/IPA/
H A DGlobalsModRef.cpp204 /// AnalyzeGlobals - Scan through the users of all of the internal
244 /// AnalyzeUsesOfPointer - Look at all of the users of the specified pointer.
307 for (User *U : GV->users()) {
/external/llvm/lib/CodeGen/SelectionDAG/
H A DFunctionLoweringInfo.cpp51 for (const User *U : I->users())
/external/llvm/lib/Target/NVPTX/
H A DNVPTXAsmPrinter.cpp974 for (const User *U : C->users())
1004 for (const User *UU : U->users())
1038 for (const User *U : C->users()) {
1069 for (const User *U : F->users()) {

Completed in 437 milliseconds

1234567