HomeSort by relevance Sort by last modified time
    Searched defs:Users (Results 1 - 13 of 13) sorted by null

  /frameworks/data-binding/samples/BindingDemo/app/src/main/java/com/android/example/bindingdemo/vo/
Users.java 5 public class Users {
  /external/llvm/lib/Target/PowerPC/
PPCBoolRetToInt.cpp 132 const auto &Users = P->users();
134 if (!std::all_of(Users.begin(), Users.end(), IsValidUser) ||
151 const auto &Users = P->users();
153 if (!std::all_of(Users.begin(), Users.end(), IsPromotable) ||
  /external/llvm/lib/CodeGen/
SjLjEHPrepare.cpp 297 // Avoid iterator invalidation by copying users to a temporary vector.
298 SmallVector<Instruction *, 16> Users;
299 for (User *U : Inst->users()) {
302 Users.push_back(UI);
308 while (!Users.empty()) {
309 Instruction *U = Users.back();
310 Users.pop_back();
  /external/llvm/lib/Transforms/Utils/
LoopUtils.cpp 171 // This includes users of the reduction, variables (which form a cycle
177 // We start with the PHI node and scan for all of the users of this
178 // instruction. All users must be instructions that can be used as reduction
234 // No Users.
235 // If the instruction has no users then this is a broken chain and can't be
280 // Process users of current instruction. Push non-PHI nodes after PHI nodes
285 for (User *U : Cur->users()) {
291 // Exit if you find multiple outside users or if the header phi node is
349 // only have a single instruction with out-of-loop users.
351 // The ExitInstruction(Instruction which is allowed to have out-of-loop users)
    [all...]
  /external/llvm/lib/Target/AArch64/
AArch64CollectLOH.cpp 748 // Check the number of users of ADRP.
749 const SetOfMachineInstr *Users =
752 if (Users->size() > 1) {
    [all...]
  /external/llvm/lib/Transforms/Scalar/
LoopRerollPass.cpp 385 DenseSet<Instruction *> &Users);
389 DenseSet<Instruction *> &Users);
456 for (User *U : I->users()) {
528 for (User *U : C->users()) {
560 // Collect the set of all users of the provided root instruction. This set of
561 // users contains not only the direct users of the root instruction, but also
562 // all users of those users, and so on. There are two exceptions:
565 // use set (even if they are users). This is used, for example, to exclud
    [all...]
RewriteStatepointsForGC.cpp     [all...]
  /external/llvm/lib/Target/AMDGPU/
SIISelLowering.cpp     [all...]
  /external/llvm/lib/Transforms/ObjCARC/
ObjCARCOpts.cpp 73 for (const User *U : Arg->users())
647 SmallVector<const Value *, 2> Users;
648 Users.push_back(Ptr);
650 Ptr = Users.pop_back_val();
651 for (const User *U : Ptr->users()) {
655 Users.push_back(U);
657 } while (!Users.empty());
    [all...]
  /external/llvm/lib/Transforms/IPO/
GlobalOpt.cpp 185 /// This GV is a pointer root. Loop over all users of the global and clean up
271 /// We just marked GV constant. Loop over all users of the global, cleaning up
385 for (User *U : GEPI->users())
451 for (User *UU : U->users())
461 for (User *U : GV->users())
617 /// Return true if all users of the specified value will trap if the value is
622 for (const User *U : V->users())
664 for (const User *U : GV->users())
    [all...]
  /external/llvm/lib/Transforms/InstCombine/
InstructionCombining.cpp 802 for (User *U : PN->users()) {
807 // Otherwise, we can replace *all* users with the new PHI we form.
    [all...]
  /external/llvm/lib/Transforms/Vectorize/
BBVectorize.cpp 289 bool trackUsesOfI(DenseSet<Value *> &Users,
759 // users of the pair are also paired. This defines a (directed) forest
    [all...]
  /prebuilts/gcc/linux-x86/host/x86_64-w64-mingw32-4.8/x86_64-w64-mingw32/include/
adoctint.h 158 typedef struct ADOUsers Users;
    [all...]

Completed in 887 milliseconds