/external/clang/lib/Sema/ |
H A D | ScopeInfo.cpp | 133 WeakUseVector &Uses = local 135 Uses.push_back(WeakUseTy(Msg, Msg->getNumArgs() == 0)); 160 FunctionScopeInfo::WeakObjectUseMap::iterator Uses; local 163 Uses = WeakObjectUses.find(WeakObjectProfileTy(RefExpr)); 170 Uses = WeakObjectUses.find(WeakObjectProfileTy(IvarE)); 172 Uses = WeakObjectUses.find(WeakObjectProfileTy(DRE)); 174 Uses = WeakObjectUses.end(); 177 Uses = 186 if (Uses == WeakObjectUses.end()) 191 std::find(Uses [all...] |
/external/llvm/lib/Target/ARM/ |
H A D | Thumb2ITBlockPass.cpp | 47 SmallSet<unsigned, 4> &Uses); 58 SmallSet<unsigned, 4> &Uses, 80 Uses.insert(*Subreg); 109 SmallSet<unsigned, 4> &Uses) { 123 if (Uses.count(DstReg) || Defs.count(SrcReg)) 166 SmallSet<unsigned, 4> Uses; local 179 Uses.clear(); 180 TrackDefUses(MI, Defs, Uses, TRI); 221 MoveCopyOutOfITBlock(NMI, CC, OCC, Defs, Uses)) { 230 TrackDefUses(NMI, Defs, Uses, TR 56 TrackDefUses(MachineInstr *MI, SmallSet<unsigned, 4> &Defs, SmallSet<unsigned, 4> &Uses, const TargetRegisterInfo *TRI) argument 106 MoveCopyOutOfITBlock(MachineInstr *MI, ARMCC::CondCodes CC, ARMCC::CondCodes OCC, SmallSet<unsigned, 4> &Defs, SmallSet<unsigned, 4> &Uses) argument [all...] |
H A D | A15SDOptimizer.cpp | 646 SmallVector<MachineOperand*, 8> Uses; local 650 Uses.push_back(&*I); 657 for (SmallVectorImpl<MachineOperand *>::const_iterator I = Uses.begin(), 658 E = Uses.end(); I != E; ++I) {
|
/external/chromium_org/v8/src/compiler/ |
H A D | generic-node.h | 76 class Uses { 83 explicit Uses(GenericNode* node) : node_(node) {} 89 Uses uses() { return Uses(this); } 171 friend class GenericNode<B, S>::Uses::iterator; 225 class GenericNode<B, S>::Uses::iterator { 227 iterator(const typename GenericNode<B, S>::Uses::iterator& other) // NOLINT 255 friend class GenericNode<B, S>::Uses;
|
H A D | generic-algorithm-inl.h | 36 typedef typename N::Uses::iterator Iterator;
|
H A D | generic-node-inl.h | 48 inline typename GenericNode<B, S>::Uses::iterator 49 GenericNode<B, S>::Uses::begin() { 50 return typename GenericNode<B, S>::Uses::iterator(this->node_); 54 inline typename GenericNode<B, S>::Uses::iterator 55 GenericNode<B, S>::Uses::end() { 56 return typename GenericNode<B, S>::Uses::iterator();
|
H A D | node.h | 81 typedef Node::Uses::iterator UseIter;
|
H A D | verifier.cc | 29 Node::Uses uses = def->uses(); 30 for (Node::Uses::iterator it = uses.begin(); it != uses.end(); ++it) { 121 Node::Uses uses = node->uses(); 122 for (Node::Uses::iterator it = uses.begin(); it != uses.end(); ++it) { 145 Node::Uses uses = node->uses(); 147 for (Node::Uses::iterator it = uses.begin(); it != uses.end(); ++it) {
|
/external/llvm/lib/Transforms/Scalar/ |
H A D | ConstantHoisting.cpp | 73 ConstantUseListType Uses; member in struct:__anon26269::ConstantCandidate 83 Uses.push_back(ConstantUser(Inst, Idx)); 90 ConstantUseListType Uses; member in struct:__anon26269::RebasedConstantInfo 93 RebasedConstantInfo(ConstantUseListType &&Uses, Constant *Offset) argument 94 : Uses(Uses), Offset(Offset) { } 242 for (auto const &U : RCI.Uses) 377 NumUses += ConstCand->Uses.size(); 396 RebasedConstantInfo(std::move(ConstCand->Uses), Offset)); 552 for (auto const &U : RCI.Uses) [all...] |
H A D | LoopStrengthReduce.cpp | 1680 /// Uses - The list of interesting uses. 1681 SmallVector<LSRUse, 16> Uses; member in class:__anon26302::LSRInstance 2306 LSRUse &LU = Uses[LUIdx]; 2313 size_t LUIdx = Uses.size(); 2315 Uses.push_back(LSRUse(Kind, AccessTy)); 2316 LSRUse &LU = Uses[LUIdx]; 2328 /// DeleteUse - Delete the given use from the Uses list. 2330 if (&LU != &Uses.back()) 2331 std::swap(LU, Uses.back()); 2332 Uses [all...] |
/external/llvm/lib/CodeGen/ |
H A D | RegAllocGreedy.cpp | 1529 ArrayRef<SlotIndex> Uses = SA->getUseSlots(); local 1530 if (Uses.size() <= 1) 1533 DEBUG(dbgs() << "Split around " << Uses.size() << " individual instrs.\n"); 1541 for (unsigned i = 0; i != Uses.size(); ++i) { 1542 if (const MachineInstr *MI = Indexes->getInstructionFromIndex(Uses[i])) 1547 DEBUG(dbgs() << " skip:\t" << Uses[i] << '\t' << *MI); 1551 SlotIndex SegStart = SE->enterIntvBefore(Uses[i]); 1552 SlotIndex SegStop = SE->leaveIntvAfter(Uses[i]); 1586 ArrayRef<SlotIndex> Uses = SA->getUseSlots(); local 1587 const unsigned NumGaps = Uses 1672 ArrayRef<SlotIndex> Uses = SA->getUseSlots(); local 1704 DEBUG(dbgs() << ' ' << RMS[ri] << ':' << Uses[i] << '-' << Uses[i+1]); local [all...] |
H A D | RegisterPressure.cpp | 318 SmallVector<unsigned, 8> Uses; member in class:RegisterOperands 331 pushRegUnits(MO.getReg(), Uses); 418 for (unsigned i = 0, e = RegOpers.Uses.size(); i != e; ++i) 419 PDiff.addPressureChange(RegOpers.Uses[i], false, MRI); 525 for (unsigned i = 0, e = RegOpers.Uses.size(); i < e; ++i) { 526 unsigned Reg = RegOpers.Uses[i]; 580 for (unsigned i = 0, e = RegOpers.Uses.size(); i < e; ++i) { 581 unsigned Reg = RegOpers.Uses[i]; 732 if (!containsReg(RegOpers.Uses, Reg)) 737 for (unsigned i = 0, e = RegOpers.Uses [all...] |
H A D | ScheduleDAGInstrs.cpp | 228 Uses.insert(PhysRegSUOper(&ExitSU, -1, Reg)); 238 assert(Uses.empty() && "Uses in set before adding deps?"); 244 if (!Uses.contains(Reg)) 245 Uses.insert(PhysRegSUOper(&ExitSU, -1, Reg)); 261 if (!Uses.contains(*Alias)) 263 for (Reg2SUnitsMap::iterator I = Uses.find(*Alias); I != Uses.end(); ++I) { 334 Uses.insert(PhysRegSUOper(SU, OperIdx, MO.getReg())); 343 if (Uses [all...] |
H A D | PeepholeOptimizer.cpp | 298 // Uses that are in the same BB of uses of the result of the instruction. 299 SmallVector<MachineOperand*, 8> Uses; local 301 // Uses that the result of the instruction can reach. 343 Uses.push_back(&UseMO); 347 Uses.push_back(&UseMO); 363 std::back_inserter(Uses)); 367 if (!Uses.empty()) { 378 for (unsigned i = 0, e = Uses.size(); i != e; ++i) { 379 MachineOperand *UseMO = Uses[i];
|
H A D | BranchFolding.cpp | 1492 SmallSet<unsigned,4> &Uses, 1507 Uses.insert(*AI); 1521 if (Uses.empty()) 1544 if (Uses.count(Reg)) 1575 Uses.insert(*AI); 1577 if (Uses.erase(Reg)) { 1579 Uses.erase(*SubRegs); // Use sub-registers to be conservative 1611 SmallSet<unsigned, 4> Uses, Defs; 1613 findHoistingInsertPosAndDeps(MBB, TII, TRI, Uses, Defs); 1659 if (Uses 1489 findHoistingInsertPosAndDeps(MachineBasicBlock *MBB, const TargetInstrInfo *TII, const TargetRegisterInfo *TRI, SmallSet<unsigned,4> &Uses, SmallSet<unsigned,4> &Defs) argument [all...] |
H A D | TwoAddressInstructionPass.cpp | 796 SmallSet<unsigned, 2> Uses; 809 Uses.insert(MOReg); 850 if (Uses.count(MOReg)) 864 ((isKill && Uses.count(MOReg)) || Kills.count(MOReg))) 979 SmallSet<unsigned, 2> Uses; 996 Uses.insert(MOReg); 1048 if (Uses.count(MOReg))
|
/external/llvm/lib/Target/Mips/ |
H A D | MipsDelaySlotFiller.cpp | 81 /// Set bits in Uses corresponding to MBB's live-out registers except for 96 BitVector Defs, Uses; member in class:__anon26049::RegDefsUses 150 /// Update Defs and Uses. Return true if there exist dependences that 151 /// disqualify the delay slot candidate between V and values in Uses and 160 SmallPtrSet<ValueType, 4> Uses, Defs; member in class:__anon26049::MemDefsUses 290 Uses(TRI.getNumRegs(), false) {} 345 Uses.set(*LI); 360 Uses |= NewUses; 370 return (isRegInSet(Defs, Reg) || isRegInSet(Uses, Reg)); 454 return !Defs.insert(V) || Uses [all...] |
/external/chromium_org/v8/test/cctest/compiler/ |
H A D | test-node.cc | 96 Node::Uses::iterator i(n1->uses().begin()); 111 Node::Uses::iterator i(n0->uses().begin()); 138 Node::Uses::iterator i1(n0->uses().begin()); 143 Node::Uses::iterator i2(n3->uses().begin()); 166 Node::Uses::iterator i1(n1->uses().begin()); 173 Node::Uses::iterator i2(n3->uses().begin()); 198 Node::Uses::iterator i2(n1->uses().begin()); 204 Node::Uses::iterator i3(n4->uses().begin()); 209 Node::Uses::iterator i4(n1->uses().begin()); 212 Node::Uses [all...] |
/external/llvm/utils/TableGen/ |
H A D | InstrInfoEmitter.cpp | 75 static void PrintDefList(const std::vector<Record*> &Uses, argument 78 for (unsigned i = 0, e = Uses.size(); i != e; ++i) 79 OS << getQualifiedName(Uses[i]) << ", "; 363 std::vector<Record*> Uses = Inst->getValueAsListOfDefs("Uses"); local 364 if (!Uses.empty()) { 365 unsigned &IL = EmittedLists[Uses]; 366 if (!IL) PrintDefList(Uses, IL = ++ListNumber, OS); 524 std::vector<Record*> UseList = Inst.TheDef->getValueAsListOfDefs("Uses");
|
/external/llvm/lib/Transforms/IPO/ |
H A D | FunctionAttrs.cpp | 304 SmallVector<ArgumentGraphNode*, 4> Uses; member in struct:__anon26225::ArgumentGraphNode 327 iterator begin() { return SyntheticRoot.Uses.begin(); } 328 iterator end() { return SyntheticRoot.Uses.end(); } 334 SyntheticRoot.Uses.push_back(&Node); 340 // consider that a capture, instead adding it to the "Uses" list and 365 Uses.push_back(AI); 376 SmallVector<Argument*, 4> Uses; // Uses within our SCC. member in struct:__anon26225::ArgumentUsesTracker 389 return N->Uses.begin(); 392 return N->Uses [all...] |
H A D | DeadArgumentElimination.cpp | 84 /// with no registered uses (in Uses) will never be marked alive and will 102 /// - Uses[ret F] = ret G 104 /// - Uses[arg F] = ret G 107 /// - Uses[ret F] = arg F 109 /// - Uses[arg F] = arg G 112 UseMap Uses; member in class:__anon26221::DAE 490 // any callers use the return value. This fills in the LiveValues set and Uses 511 // we can add those to the Uses map if the return value really turns out to be 620 /// MaybeLive, it also takes all uses in MaybeLiveUses and records them in Uses, 633 Uses [all...] |
/external/llvm/include/llvm/CodeGen/ |
H A D | ScheduleDAGInstrs.h | 129 /// Defs, Uses - Remember where defs and uses of each register are as we 134 Reg2SUnitsMap Uses; member in class:llvm::ScheduleDAGInstrs 140 /// unknown store, as we iterate. As with Defs and Uses, this is here
|
/external/clang/include/clang/Sema/ |
H A D | ScopeInfo.h | 802 WeakUseVector &Uses = WeakObjectUses[WeakObjectProfileTy(E)]; local 803 Uses.push_back(WeakUseTy(E, IsRead));
|
/external/llvm/test/MC/ARM/ |
H A D | thumb-shift-encoding.s | 3 @ Uses printT2SOOperand(), used by t2ADCrs t2ADDrs t2ANDrs t2BICrs t2EORrs
|
H A D | arm-shift-encoding.s | 63 @ Uses printAddrMode2OffsetOperand(), used by LDRBT_POST_IMM LDRBT_POST_REG 78 @ Uses printSORegImmOperand(), used by ADCrsi ADDrsi ANDrsi BICrsi EORrsi
|