HomeSort by relevance Sort by last modified time
    Searched refs:Uses (Results 1 - 25 of 30) sorted by null

1 2

  /external/clang/lib/Sema/
ScopeInfo.cpp 128 WeakUseVector &Uses =
130 Uses.push_back(WeakUseTy(Msg, Msg->getNumArgs() == 0));
155 FunctionScopeInfo::WeakObjectUseMap::iterator Uses;
157 Uses = WeakObjectUses.find(WeakObjectProfileTy(RefExpr));
159 Uses = WeakObjectUses.find(WeakObjectProfileTy(IvarE));
161 Uses = WeakObjectUses.find(WeakObjectProfileTy(DRE));
163 Uses = WeakObjectUses.end();
166 Uses =
175 if (Uses == WeakObjectUses.end())
180 std::find(Uses->second.rbegin(), Uses->second.rend(), WeakUseTy(E, true))
    [all...]
AnalysisBasedWarnings.cpp 628 /// DiagnoseUninitializedUse -- Helper function for diagnosing uses of an
630 /// emitted for particular types of uses. Returns true if the use was diagnosed
1158 UsesMap *uses; member in class:__anon5817::UninitValsDiagReporter
    [all...]
  /external/llvm/lib/Target/ARM/
Thumb2ITBlockPass.cpp 45 SmallSet<unsigned, 4> &Uses);
52 /// instructions in the IT block. This also tracks "dependencies", i.e. uses
56 SmallSet<unsigned, 4> &Uses,
76 Uses.insert(Reg);
78 Uses.insert(*Subreg);
107 SmallSet<unsigned, 4> &Uses) {
121 if (Uses.count(DstReg) || Defs.count(SrcReg))
164 SmallSet<unsigned, 4> Uses;
177 Uses.clear();
178 TrackDefUses(MI, Defs, Uses, TRI)
    [all...]
A15SDOptimizer.cpp 217 // Check if all the uses of this instruction are marked as
646 // Collect all the uses of this MI's DPR def for updating later.
647 SmallVector<MachineOperand*, 8> Uses;
651 Uses.push_back(&I.getOperand());
658 for (SmallVector<MachineOperand*, 8>::const_iterator I = Uses.begin(),
659 E = Uses.end(); I != E; ++I) {
  /external/llvm/lib/Transforms/IPO/
FunctionAttrs.cpp 241 SmallVector<ArgumentGraphNode*, 4> Uses;
255 // uses every node. Because the graph is directed and nothing points into
264 iterator begin() { return SyntheticRoot.Uses.begin(); }
265 iterator end() { return SyntheticRoot.Uses.end(); }
271 SyntheticRoot.Uses.push_back(&Node);
277 // consider that a capture, instead adding it to the "Uses" list and
301 Uses.push_back(AI);
305 assert(!Uses.empty() && "Capturing call-site captured nothing?");
310 SmallVector<Argument*, 4> Uses; // Uses within our SCC
    [all...]
DeadArgumentElimination.cpp 87 /// with no registered uses (in Uses) will never be marked alive and will
102 /// arguments it uses. This allows the MaybeLive values to be marked live
105 /// - Uses[ret F] = ret G
107 /// - Uses[arg F] = ret G
110 /// - Uses[ret F] = arg F
112 /// - Uses[arg F] = arg G
115 UseMap Uses;
137 // DAH uses this to specify a different ID.
317 // Loop over the argument list, transferring uses of the old arguments over t
    [all...]
  /external/llvm/lib/CodeGen/
RegAllocGreedy.cpp 175 /// All basic blocks where the current register has uses.
    [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
141 /// result, then replace all reachable uses of the source with the subreg of the
146 /// debug uses.
159 // No other uses.
172 // If UseSrcSubIdx is Set, SubIdx also applies to SrcReg, and only uses of
177 // The source has other uses. See if we can replace the other uses with use of
185 // Uses that are in the same BB of uses of the result of the instruction
    [all...]
RegisterPressure.cpp 312 /// Collect this instruction's unique uses and defs into SmallVectors for
313 /// processing defs and uses in order.
319 SmallVector<unsigned, 8> Uses;
331 pushRegUnits(MO.getReg(), Uses);
448 // Generate liveness for uses.
449 for (unsigned i = 0, e = RegOpers.Uses.size(); i < e; ++i) {
450 unsigned Reg = RegOpers.Uses[i];
490 for (unsigned i = 0, e = RegOpers.Uses.size(); i < e; ++i) {
491 unsigned Reg = RegOpers.Uses[i];
496 // Kill liveness at last uses
    [all...]
ScheduleDAGInstrs.cpp 144 // because the code that uses this function has no way to cope with
208 // If it's a call or a barrier, add dependencies on the defs and uses of
217 Uses.insert(PhysRegSUOper(&ExitSU, -1, Reg));
226 // uses all the registers that are livein to the successor blocks.
227 assert(Uses.empty() && "Uses in set before adding deps?");
233 if (!Uses.contains(Reg))
234 Uses.insert(PhysRegSUOper(&ExitSU, -1, Reg));
240 /// data dependencies from SU to any uses of the physical register.
250 if (!Uses.contains(*Alias)
    [all...]
BranchFolding.cpp 150 // See if it uses any of the implicitly defined registers.
    [all...]
TwoAddressInstructionPass.cpp 275 // One of the uses is killed before the destination.
303 /// noUseAfterLastDef - Return true if there are no intervening uses between the
402 // All uses of physical registers are likely to be kills.
426 /// isTwoAddrUse - Return true if the specified MI uses the specified register
510 // general, we want no uses between this instruction and the definition of
562 // Since there are no intervening uses for both registers, then commute
637 // uses RegB, convertToThreeAddress must have created more
655 /// scanUses - Scan forward recursively for only uses, update maps if the use
793 SmallSet<unsigned, 2> Uses;
806 Uses.insert(MOReg)
    [all...]
  /external/llvm/utils/TableGen/
InstrInfoEmitter.cpp 60 static void PrintDefList(const std::vector<Record*> &Uses,
63 for (unsigned i = 0, e = Uses.size(); i != e; ++i)
64 OS << getQualifiedName(Uses[i]) << ", ";
203 // Emit all of the instruction's implicit uses and defs.
207 std::vector<Record*> Uses = Inst->getValueAsListOfDefs("Uses");
208 if (!Uses.empty()) {
209 unsigned &IL = EmittedLists[Uses];
210 if (!IL) PrintDefList(Uses, IL = ++ListNumber, OS);
360 // Emit the implicit uses and defs lists..
    [all...]
  /external/llvm/lib/Target/Mips/
MipsDelaySlotFiller.cpp 93 /// Set bits in Uses corresponding to MBB's live-out registers except for
108 BitVector Defs, Uses;
151 /// This subclass uses memory dependence information to determine whether a
160 /// Update Defs and Uses. Return true if there exist dependences that
161 /// disqualify the delay slot candidate between V and values in Uses and
170 SmallPtrSet<const Value*, 4> Uses, Defs;
294 Uses(TRI.getNumRegs(), false) {}
349 Uses.set(*LI);
364 Uses |= NewUses;
374 return (isRegInSet(Defs, Reg) || isRegInSet(Uses, Reg))
    [all...]
  /external/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/llvm/lib/Transforms/Scalar/
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
351 /// formula. This does not include register uses implied by non-constant
379 /// hasRegsUsedByUsesOtherThan - Test whether this formula uses registers
380 /// which are used by uses other than the use with the given index.
    [all...]
SROA.cpp 13 /// convert uses of an element (or set of elements) of an alloca into a vector
116 /// formed by examining the uses of the alloca. During formation, they may
150 /// This structure is used to associate uses of a partition with it. They
153 /// The bounds of these uses are determined by intersecting the bounds of the
155 /// intentionally overlap between various uses of the same partition.
189 /// information about the nature of uses of each slice of the alloca. The goal
220 /// partition's uses.
222 /// The iteration support provided for uses is more limited, but also
223 /// includes some manipulation routines to support rewriting the uses of
227 use_iterator use_begin(unsigned Idx) { return Uses[Idx].begin();
    [all...]
  /external/llvm/include/llvm/CodeGen/
ScheduleDAGInstrs.h 45 /// For non data-dependent uses, OpIdx == -1.
117 /// Defs, Uses - Remember where defs and uses of each register are as we
122 Reg2SUnitsMap Uses;
128 /// unknown store, as we iterate. As with Defs and Uses, this is here
MachineRegisterInfo.h 84 /// for other target specific uses.
161 /// and uses of a register within the MachineFunction that corresponds to this
163 template<bool Uses, bool Defs, bool SkipDebug>
169 /// reg_iterator/reg_begin/reg_end - Walk all defs and uses of the specified
181 /// reg_nodbg_iterator/reg_nodbg_begin/reg_nodbg_end - Walk all defs and uses
215 /// use_iterator/use_begin/use_end - Walk all uses of the specified register.
235 /// use_nodbg_iterator/use_nodbg_begin/use_nodbg_end - Walk all uses of the
276 /// clearKillFlags - Iterate over all the uses of the given register and
502 /// ReturnUses is true it returns uses of registers, if ReturnDefs is true it
504 /// returns end(). If SkipDebug is true it skips uses marked Debu
    [all...]
  /external/clang/include/clang/Sema/
ScopeInfo.h 243 /// Used to collect uses of a particular weak object in a function body.
248 /// Used to collect all uses of weak objects in a function body.
256 /// Used to collect all uses of weak objects in this function body.
564 WeakUseVector &Uses = WeakObjectUses[WeakObjectProfileTy(E)];
565 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
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
  /external/webrtc/src/modules/audio_processing/test/
apmtest.m 7 % 'show' Uses spclab to show the test case specified by the
  /external/llvm/lib/CodeGen/SelectionDAG/
SelectionDAG.cpp 572 // Process the worklist, deleting the nodes and adding their uses to the
590 // Now that we removed this operand, see if there are no uses of it left.
614 // Finally, remove uses due to operands of this node, remove from the
    [all...]
  /external/llvm/lib/Target/X86/
X86FrameLowering.cpp 120 SmallSet<uint16_t, 8> Uses;
129 Uses.insert(*AI);
134 if (!Uses.count(*CS))
870 // more than 4K bytes on the stack. Windows uses __chkstk and cygwin/mingw
871 // uses __alloca. __alloca and the 32-bit version of __chkstk will probe the
    [all...]

Completed in 4528 milliseconds

1 2