| /toolchain/binutils/binutils-2.25/gas/testsuite/gas/tic6x/ |
| reloc-bad-5.s | 1 # Test bad uses of $DSBT_INDEX. Uses with addend.
|
| /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);
93 /// Clear kill flags for any uses in the given set. This will likely
96 static void ClearKillFlags(MachineInstr *MI, SmallSet<unsigned, 4> &Uses) {
100 if (!Uses.count(MO.getReg()))
122 SmallSet<unsigned, 4> &Uses) {
136 if (Uses.count(DstReg) || Defs.count(SrcReg))
179 SmallSet<unsigned, 4> Uses;
[all...] |
| A15SDOptimizer.cpp | 216 // Check if all the uses of this instruction are marked as
650 // Collect all the uses of this MI's DPR def for updating later.
651 SmallVector<MachineOperand*, 8> Uses;
655 Uses.push_back(&*I);
662 for (SmallVectorImpl<MachineOperand *>::const_iterator I = Uses.begin(),
663 E = Uses.end(); I != E; ++I) {
|
| /external/clang/lib/Sema/ |
| ScopeInfo.cpp | 155 WeakUseVector &Uses =
157 Uses.push_back(WeakUseTy(Msg, Msg->getNumArgs() == 0));
182 FunctionScopeInfo::WeakObjectUseMap::iterator Uses;
187 Uses = WeakObjectUses.find(WeakObjectProfileTy(RefExpr));
194 Uses = WeakObjectUses.find(WeakObjectProfileTy(IvarE));
196 Uses = WeakObjectUses.find(WeakObjectProfileTy(DRE));
198 Uses = WeakObjectUses.end();
201 Uses =
210 if (Uses == WeakObjectUses.end())
215 std::find(Uses->second.rbegin(), Uses->second.rend(), WeakUseTy(E, true))
[all...] |
| /external/llvm/lib/Target/Hexagon/ |
| HexagonGenMux.cpp | 63 BitVector Defs, Uses;
64 DefUseInfo() : Defs(), Uses() {}
65 DefUseInfo(const BitVector &D, const BitVector &U) : Defs(D), Uses(U) {}
88 BitVector &Uses) const;
119 BitVector &Uses) const {
120 // First, get the implicit defs and uses for this instruction.
128 expandReg(*R++, Uses);
130 // Look over all operands, and collect explicit defs and uses.
135 BitVector &Set = Mo->isDef() ? Defs : Uses;
145 BitVector Defs(NR), Uses(NR)
[all...] |
| HexagonCommonGEP.cpp | 134 NodeToUsesMap Uses;
380 Uses[PN].insert(Us.begin(), Us.end());
395 // instruction that uses another GEP instruction as the base pointer, the
589 UseSet &MinUs = Uses[Min];
596 MinUs.insert(Uses[N].begin(), Uses[N].end());
600 Uses.erase(Min);
744 // uses an index value that is not available at the location required
752 // Append all blocks with uses of the original values to the
754 NodeToUsesMap::iterator UF = Uses.find(Node)
[all...] |
| HexagonExpandCondsets.cpp | 27 // If the uses of the source values vreg1 and vreg2 are kills, and their
166 bool canMoveOver(MachineInstr *MI, ReferenceMap &Defs, ReferenceMap &Uses);
265 /// going on, predicated instructions will have implicit uses of the
323 /// not yet been removed, or there may be missing uses that have not yet been
383 /// shrunk-to-uses later.
427 // Strip all implicit uses from predicated instructions. They will be
463 // either case it will be "shrunk-to-uses" later.
506 DEBUG(dbgs() << "updated imp-uses: " << *MI);
512 // extend the previous one. Ignore implicit uses.
523 assert(P != LIU.end() && "MI uses undefined register?")
[all...] |
| /external/v8/src/compiler/ |
| node.h | 164 class Uses final {
174 explicit Uses(Node* node) : node_(node) {}
180 Uses uses() { return Uses(this); } function in class:v8::internal::compiler::final
476 // A forward iterator to visit the uses edges of a node.
518 // A forward iterator to visit the uses of a node.
519 class Node::Uses::const_iterator final {
544 friend class Node::Uses;
553 Node::Uses::const_iterator Node::Uses::begin() const
[all...] |
| node.cc | 105 // Initialize the input pointers and the uses.
133 DCHECK(uses().empty());
410 Node::Uses::const_iterator Node::Uses::const_iterator::operator++(int n) {
417 bool Node::Uses::empty() const { return begin() == end(); }
|
| /external/llvm/lib/Transforms/Scalar/ |
| LoopRerollPass.cpp | 426 UsesTy Uses;
583 for (Use &U : I->uses()) {
586 // Ignore "wrap-around" uses to PHIs of this loop's header.
882 Uses[&I].resize(IL_End);
897 Uses[I].set(0);
912 Uses[I].set(Idx);
919 Uses[I].set(IL_All);
935 Uses[I].set(IL_All);
[all...] |
| ConstantHoisting.cpp | 72 /// \brief Keeps track of a constant candidate and its uses.
74 ConstantUseListType Uses;
84 Uses.push_back(ConstantUser(Inst, Idx));
91 ConstantUseListType Uses;
94 RebasedConstantInfo(ConstantUseListType &&Uses, Constant *Offset)
95 : Uses(std::move(Uses)), Offset(Offset) { }
239 /// \brief Find an insertion point that dominates all uses.
246 for (auto const &U : RCI.Uses)
273 /// 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
426 /// not include register uses implied by non-constant addrec strides.
453 /// Test whether this formula uses registers which are used by uses other than
[all...] |
| /external/vboot_reference/scripts/image_signing/ |
| convert_recovery_to_full_ssd.sh | 19 Converts <signed_recovery_image> into a full SSD image usable by factory. Uses
|
| /external/llvm/lib/CodeGen/ |
| RegAllocGreedy.cpp | 255 /// All basic blocks where the current register has uses.
[all...] |
| RegisterPressure.cpp | 320 SmallVector<unsigned, 8> Uses;
332 /// Collect this instruction's unique uses and defs into SmallVectors for
333 /// processing defs and uses in order.
365 pushRegUnits(Reg, RegOpers.Uses);
479 for (unsigned Reg : RegOpers.Uses)
514 /// RegUnits that are made live by the current instruction's uses. This includes
564 // Generate liveness for uses.
565 for (unsigned Reg : RegOpers.Uses) {
613 for (unsigned Reg : RegOpers.Uses) {
618 // Kill liveness at last uses
[all...] |
| ScheduleDAGInstrs.cpp | 150 // 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));
234 // uses all the registers that are livein to the successor blocks.
235 assert(Uses.empty() && "Uses in set before adding deps?");
239 if (!Uses.contains(LI.PhysReg))
240 Uses.insert(PhysRegSUOper(&ExitSU, -1, LI.PhysReg));
246 /// data dependencies from SU to any uses of the physical register.
256 if (!Uses.contains(*Alias)
[all...] |
| BranchFolding.cpp | 172 // See if it uses any of the implicitly defined registers.
[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/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);
528 // Emit the implicit uses and defs lists..
[all...] |
| /external/llvm/lib/Transforms/IPO/ |
| FunctionAttrs.cpp | 281 SmallVector<ArgumentGraphNode *, 4> Uses;
295 // uses every node. Because the graph is directed and nothing points into
304 iterator begin() { return SyntheticRoot.Uses.begin(); }
305 iterator end() { return SyntheticRoot.Uses.end(); }
311 SyntheticRoot.Uses.push_back(&Node);
317 /// consider that a capture, instead adding it to the "Uses" list and
367 Uses.push_back(&*std::next(F->arg_begin(), UseIndex));
372 SmallVector<Argument *, 4> Uses; // Uses within our SCC.
385 return N->Uses.begin()
[all...] |
| /external/llvm/lib/Target/AArch64/ |
| AArch64PromoteConstant.cpp | 52 STATISTIC(NumPromotedUses, "Number of promoted constants uses");
77 /// The constants in this example are folded into the uses. Thus, 4 different
117 /// Type to store a list of Uses.
118 typedef SmallVector<Use *, 4> Uses;
119 /// Map an insertion point to all the uses it dominates.
120 typedef DenseMap<Instruction *, Uses> InsertionPoints;
130 /// If true, the given use is added to the list of dominated uses for
133 /// \param Use the use to be added into the list of dominated uses
145 /// \param Use the use to be added into the list of dominated uses
155 /// uses of value
[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;
296 : TRI(TRI), Defs(TRI.getNumRegs(), false), Uses(TRI.getNumRegs(), false) {}
359 Uses.set(LI.PhysReg);
374 Uses |= NewUses;
384 return (isRegInSet(Defs, Reg) || isRegInSet(Uses, Reg))
[all...] |
| /external/llvm/lib/IR/ |
| Metadata.cpp | 165 // Copy out uses since UseMap will get touched below.
167 SmallVector<UseTy, 8> Uses(UseMap.begin(), UseMap.end());
168 std::sort(Uses.begin(), Uses.end(), [](const UseTy &L, const UseTy &R) {
171 for (const auto &Pair : Uses) {
206 assert(UseMap.empty() && "Expected all uses to be replaced");
218 // Copy out uses since UseMap could get touched below.
220 SmallVector<UseTy, 8> Uses(UseMap.begin(), UseMap.end());
221 std::sort(Uses.begin(), Uses.end(), [](const UseTy &L, const UseTy &R)
[all...] |
| /external/llvm/include/llvm/CodeGen/ |
| ScheduleDAGInstrs.h | 56 /// For non-data-dependent uses, OpIdx == -1.
79 /// Track local uses of virtual registers. These uses are gathered by the DAG
131 /// is mapped to a set of SUnits. These include all local vreg uses, not
132 /// just the uses for a singly defined vreg.
138 /// Defs, Uses - Remember where defs and uses of each register are as we
143 Reg2SUnitsMap Uses;
153 /// unknown store, as we iterate. As with Defs and Uses, this is here
|
| /external/llvm/lib/Target/Hexagon/MCTargetDesc/ |
| HexagonMCChecker.cpp | 84 Uses.insert(*SRI);
163 Uses.insert(*SRI);
208 // Figure out uses of new values.
375 // Check for legal register uses and definitions.
423 // Check for multiple uses of the same condition.
449 if (!Uses.count(R)) {
461 if (!Uses.count(R)) {
466 vHistFound = true; // vhist() implicitly uses ALL REGxx.tmp
|
