| /external/clang/lib/Sema/ |
| ScopeInfo.cpp | 133 WeakUseVector &Uses =
135 Uses.push_back(WeakUseTy(Msg, Msg->getNumArgs() == 0));
160 FunctionScopeInfo::WeakObjectUseMap::iterator Uses;
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->second.rbegin(), Uses->second.rend(), WeakUseTy(E, true))
[all...] |
| /external/llvm/lib/Target/ARM/ |
| Thumb2ITBlockPass.cpp | 47 SmallSet<unsigned, 4> &Uses);
54 /// instructions in the IT block. This also tracks "dependencies", i.e. 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;
179 Uses.clear();
180 TrackDefUses(MI, Defs, Uses, TRI);
221 MoveCopyOutOfITBlock(NMI, CC, OCC, Defs, Uses)) {
[all...] |
| A15SDOptimizer.cpp | 211 // Check if all the uses of this instruction are marked as
645 // Collect all the uses of this MI's DPR def for updating later.
646 SmallVector<MachineOperand*, 8> Uses;
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/ |
| generic-node.h | 26 // specialized Node instance. GenericNode uses a mixin template pattern to
76 class Uses {
83 explicit Uses(GenericNode* node) : node_(node) {}
89 Uses uses() { return Uses(this); }
142 // When a node is initially allocated, it uses a static buffer to hold its
171 friend class GenericNode<B, S>::Uses::iterator;
222 // A forward iterator to visit the uses of a node. The uses are returned i
[all...] |
| 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();
|
| generic-algorithm-inl.h | 36 typedef typename N::Uses::iterator Iterator;
38 static Iterator begin(Node* node) { return node->uses().begin(); }
39 static Iterator end(Node* node) { return node->uses().end(); }
|
| node.h | 81 typedef Node::Uses::iterator UseIter;
|
| verifier.cc | 29 Node::Uses uses = def->uses(); local
30 for (Node::Uses::iterator it = uses.begin(); it != uses.end(); ++it) {
80 // kFrameState uses undefined as a sentinel.
121 Node::Uses uses = node->uses(); local
145 Node::Uses uses = node->uses(); local
[all...] |
| /external/llvm/lib/Transforms/Scalar/ |
| ConstantHoisting.cpp | 71 /// \brief Keeps track of a constant candidate and its uses.
73 ConstantUseListType Uses;
83 Uses.push_back(ConstantUser(Inst, Idx));
90 ConstantUseListType Uses;
93 RebasedConstantInfo(ConstantUseListType &&Uses, Constant *Offset)
94 : Uses(Uses), Offset(Offset) { }
235 /// \brief Find an insertion point that dominates all uses.
242 for (auto const &U : RCI.Uses)
269 /// could also be a cast instruction or a constant expression that uses th
[all...] |
| LoopStrengthReduce.cpp | 30 // it's useful to think about these as the same register, with some uses using
32 // example, the icmp is a post-increment user, since it uses %i.next, which is
412 /// formula. This does not include register uses implied by non-constant
440 /// hasRegsUsedByUsesOtherThan - Test whether this formula uses registers
441 /// which are used by uses other than the use with the given index.
[all...] |
| /external/llvm/lib/CodeGen/ |
| RegAllocGreedy.cpp | 242 /// All basic blocks where the current register has uses.
[all...] |
| RegisterPressure.cpp | 308 /// Collect this instruction's unique uses and defs into SmallVectors for
309 /// processing defs and uses in order.
318 SmallVector<unsigned, 8> Uses;
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);
453 /// RegUnits that are made live by the current instruction's uses. This includes
524 // Generate liveness for uses.
525 for (unsigned i = 0, e = RegOpers.Uses.size(); i < e; ++i) {
526 unsigned Reg = RegOpers.Uses[i]
[all...] |
| ScheduleDAGInstrs.cpp | 147 // because the code that uses this function has no way to cope with
219 // If it's a call or a barrier, add dependencies on the defs and uses of
228 Uses.insert(PhysRegSUOper(&ExitSU, -1, Reg));
237 // uses all the registers that are livein to the successor blocks.
238 assert(Uses.empty() && "Uses in set before adding deps?");
244 if (!Uses.contains(Reg))
245 Uses.insert(PhysRegSUOper(&ExitSU, -1, Reg));
251 /// data dependencies from SU to any uses of the physical register.
261 if (!Uses.contains(*Alias)
[all...] |
| PeepholeOptimizer.cpp | 19 // will replace some uses of the pre-extension value with uses of the
31 // same flag that the "cmp" instruction sets and that "bz" uses, then we can
256 /// result, then replace all reachable uses of the source with the subreg of the
261 /// debug uses.
274 // No other uses.
287 // If UseSrcSubIdx is Set, SubIdx also applies to SrcReg, and only uses of
292 // The source has other uses. See if we can replace the other uses with use of
298 // Uses that are in the same BB of uses of the result of the instruction
[all...] |
| BranchFolding.cpp | 158 // See if it uses any of the implicitly defined registers.
[all...] |
| /external/llvm/lib/Target/Mips/ |
| MipsDelaySlotFiller.cpp | 81 /// Set bits in Uses corresponding to MBB's live-out registers except for
96 BitVector Defs, Uses;
139 /// This subclass uses memory dependence information to determine whether a
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;
290 Uses(TRI.getNumRegs(), false) {}
345 Uses.set(*LI);
360 Uses |= NewUses;
370 return (isRegInSet(Defs, Reg) || isRegInSet(Uses, Reg))
[all...] |
| /ndk/ |
| find-win-host.cmd | 30 rem Uses "endlocal &&" hack to allow env. vars to survive setlocal/endlocal
|
| /external/chromium_org/v8/test/mjsunit/regress/ |
| regress-877615.js | 36 assertEquals([1].toLocaleString(), 'invalid'); // Uses ToObject on elements.
37 assertEquals([1].toString(), '1'); // Uses ToString directly on elements.
|
| /external/chromium_org/v8/test/cctest/compiler/ |
| test-node.cc | 96 Node::Uses::iterator i(n1->uses().begin());
98 for (; i != n1->uses().end(); ++i) {
111 Node::Uses::iterator i(n0->uses().begin());
114 CHECK(n0->uses().end() == i);
125 CHECK(n0->uses().begin() == n0->uses().end());
127 CHECK(n0->uses().begin() == n0->uses().end())
[all...] |
| /external/llvm/utils/TableGen/ |
| InstrInfoEmitter.cpp | 75 static void PrintDefList(const std::vector<Record*> &Uses,
78 for (unsigned i = 0, e = Uses.size(); i != e; ++i)
79 OS << getQualifiedName(Uses[i]) << ", ";
360 // Emit all of the instruction's implicit uses and defs.
363 std::vector<Record*> Uses = Inst->getValueAsListOfDefs("Uses");
364 if (!Uses.empty()) {
365 unsigned &IL = EmittedLists[Uses];
366 if (!IL) PrintDefList(Uses, IL = ++ListNumber, OS);
523 // Emit the implicit uses and defs lists..
[all...] |
| /external/llvm/lib/Transforms/IPO/ |
| FunctionAttrs.cpp | 304 SmallVector<ArgumentGraphNode*, 4> Uses;
318 // uses every node. Because the graph is directed and nothing points into
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.
389 return N->Uses.begin()
[all...] |
| DeadArgumentElimination.cpp | 84 /// with no registered uses (in Uses) will never be marked alive and will
99 /// arguments it uses. This allows the MaybeLive values to be marked live
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;
133 // DAH uses this to specify a different ID.
287 // Loop over the argument list, transferring uses of the old arguments over t
[all...] |
| /external/llvm/include/llvm/CodeGen/ |
| ScheduleDAGInstrs.h | 46 /// For non-data-dependent uses, OpIdx == -1.
69 /// Track local uses of virtual registers. These uses are gathered by the DAG
122 /// is mapped to a set of SUnits. These include all local vreg uses, not
123 /// just the uses for a singly defined vreg.
129 /// Defs, Uses - Remember where defs and uses of each register are as we
134 Reg2SUnitsMap Uses;
140 /// unknown store, as we iterate. As with Defs and Uses, this is here
|
| /external/clang/include/clang/Sema/ |
| ScopeInfo.h | 269 /// Used to collect uses of a particular weak object in a function body.
274 /// Used to collect all uses of weak objects in a function body.
282 /// Used to collect all uses of weak objects in this function body.
802 WeakUseVector &Uses = WeakObjectUses[WeakObjectProfileTy(E)];
803 Uses.push_back(WeakUseTy(E, IsRead));
|
| /external/llvm/test/MC/ARM/ |
| thumb-shift-encoding.s | 3 @ Uses printT2SOOperand(), used by t2ADCrs t2ADDrs t2ANDrs t2BICrs t2EORrs
|
