| /frameworks/data-binding/samples/BindingDemo/app/src/main/java/com/android/example/bindingdemo/vo/ |
| Users.java | 5 public class Users {
|
| /external/spirv-llvm/lib/SPIRV/ |
| SPIRVLowerConstExpr.cpp | 138 std::vector<Instruction *> Users;
140 for (auto U:CE->users()){
146 Users.push_back(InstUser);
149 for (auto &User: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 | 269 // Avoid iterator invalidation by copying users to a temporary vector.
270 SmallVector<Instruction *, 16> Users;
271 for (User *U : Inst.users()) {
274 Users.push_back(UI);
280 while (!Users.empty()) {
281 Instruction *U = Users.pop_back_val();
|
| /external/llvm/lib/Transforms/Utils/ |
| LoopUtils.cpp | 178 // This includes users of the reduction, variables (which form a cycle
184 // We start with the PHI node and scan for all of the users of this
185 // instruction. All users must be instructions that can be used as reduction
241 // No Users.
242 // If the instruction has no users then this is a broken chain and can't be
287 // Process users of current instruction. Push non-PHI nodes after PHI nodes
292 for (User *U : Cur->users()) {
298 // Exit if you find multiple outside users or if the header phi node is
356 // only have a single instruction with out-of-loop users.
358 // The ExitInstruction(Instruction which is allowed to have out-of-loop users)
[all...] |
| /external/swiftshader/third_party/LLVM/lib/Transforms/Utils/ |
| LowerInvoke.cpp | 355 // Avoid iterator invalidation by copying users to a temporary vector.
356 SmallVector<Instruction*,16> Users;
361 Users.push_back(User);
372 while (!Users.empty()) {
373 Instruction *U = Users.back();
374 Users.pop_back();
|
| /external/llvm/lib/Target/AArch64/ |
| AArch64CollectLOH.cpp | 750 // Check the number of users of ADRP.
751 const SetOfMachineInstr *Users =
754 if (Users->size() > 1) {
[all...] |
| /external/swiftshader/third_party/LLVM/lib/CodeGen/ |
| SjLjEHPrepare.cpp | 318 // Avoid iterator invalidation by copying users to a temporary vector.
319 SmallVector<Instruction*,16> Users;
324 Users.push_back(User);
330 while (!Users.empty()) {
331 Instruction *U = Users.back();
332 Users.pop_back();
[all...] |
| /external/llvm/lib/Transforms/IPO/ |
| GlobalOpt.cpp | 144 /// This GV is a pointer root. Loop over all users of the global and clean up
230 /// We just marked GV constant. Loop over all users of the global, cleaning up
344 for (User *U : GEPI->users())
410 for (User *UU : U->users())
420 for (User *U : GV->users())
578 /// Return true if all users of the specified value will trap if the value is
583 for (const User *U : V->users())
625 for (const User *U : GV->users())
811 // If there are bitcast users of the malloc (which is typical, usually we have
813 // other users to use the global as well
[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/Scalar/ |
| LoopRerollPass.cpp | 384 DenseSet<Instruction *> &Users);
388 DenseSet<Instruction *> &Users);
464 for (User *U : I->users()) {
524 for (auto *User : IV->users()) {
544 // The users of the IV must be a binary operation or a comparison
549 for (auto *UU : User->users()) {
652 for (User *U : C->users()) {
684 // Collect the set of all users of the provided root instruction. This set of
685 // users contains not only the direct users of the root instruction, but als
[all...] |
| /external/swiftshader/third_party/LLVM/lib/Transforms/InstCombine/ |
| InstructionCombining.cpp | 609 // Otherwise, we can replace *all* users with the new PHI we form.
[all...] |
| /external/llvm/lib/Target/AMDGPU/ |
| SIISelLowering.cpp | [all...] |
| /external/llvm/lib/Transforms/InstCombine/ |
| InstructionCombining.cpp | 798 for (User *U : PN->users()) {
803 // 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...] |
| /external/swiftshader/third_party/LLVM/lib/Transforms/Scalar/ |
| ObjCARC.cpp | 292 // only question is whether or not they may be users.
440 /// argument verbatim, so if it's such a call and the return value has users,
450 "Can't delete non-forwarding instruction with users!");
[all...] |
| /prebuilts/gcc/linux-x86/host/x86_64-w64-mingw32-4.8/x86_64-w64-mingw32/include/ |
| adoctint.h | 192 typedef interface ADOUsers Users;
[all...] |
| /prebuilts/tools/common/m2/repository/com/amazonaws/aws-java-sdk-iam/1.11.18/ |
| aws-java-sdk-iam-1.11.18.jar | |
