| /external/llvm/utils/TableGen/ |
| AsmWriterInst.h | 11 // the string into operands, which can be literal strings (the constant bits of
12 // the string), actual operands (i.e., operands from the MachineInstr), and
87 std::vector<AsmWriterOperand> Operands;
104 if (!Operands.empty() &&
105 Operands.back().OperandType == AsmWriterOperand::isLiteralTextOperand)
106 Operands.back().Str.append(Str);
108 Operands.push_back(AsmWriterOperand(Str));
|
| DAGISelMatcher.cpp | 255 for (unsigned i = 0, e = Operands.size(); i != e; ++i)
256 OS << Operands[i] << ' ';
318 M->Operands == Operands && M->HasChain == HasChain &&
325 return (HashString(OpcodeName) << 4) | Operands.size();
|
| DAGISelMatcherOpt.cpp | 133 const SmallVectorImpl<unsigned> &Operands = EN->getOperandList();
136 Operands.data(),Operands.size(),
|
| X86RecognizableInstr.h | 63 /// Inferred from the operands; indicates whether the L bit in the VEX prefix is set
85 /// Indicates whether the instruction has FR operands - MOVs with FR operands
92 /// The operands of the instruction, as listed in the CodeGenInstruction.
93 /// They are not one-to-one with operands listed in the MCInst; for example,
94 /// memory operands expand to 5 operands in the MCInst
95 const std::vector<CGIOperandList::OperandInfo>* Operands;
117 /// instructions are pure intrinsics and use unencodable operands; many
139 /// prefix. If it does, 32-bit register operands sta
[all...] |
| CodeGenInstruction.h | 73 /// PrinterMethodName - The method used to print operands of this type in
86 /// operands correspond to multiple MachineInstr operands. In the X86
92 unsigned MINumOperands; // The number of operands.
100 /// up of multiple MI operands.
130 /// NumDefs - Number of def operands declared, this is the number of
135 /// OperandList - The list of declared operands, along with their declared
166 /// to operands with suboperands are allowed, otherwise not.
209 /// Operands - This is information about the (ins) and (outs) list specified
211 CGIOperandList Operands;
[all...] |
| FixedLenDecoderEmitter.cpp | 316 const std::map<unsigned, std::vector<OperandInfo> > &Operands;
340 Operands(FC.Operands), Filters(FC.Filters),
350 : AllInstructions(Insts), Opcodes(IDs), Operands(Ops), Filters(),
363 : AllInstructions(Insts), Opcodes(IDs), Operands(Ops),
569 Owner->Operands,
602 Owner->Operands,
[all...] |
| DAGISelMatcher.h | [all...] |
| AsmMatcherEmitter.cpp | 11 // assembly operands in the MCInst structures. It also emits a matcher for
14 // Converting assembly operands into MCInst structures
18 // operands. The target specific parser should generally eliminate any syntax
22 // operands.
59 // arbitrary operands, we expect the user to define the classes and their
63 // By partitioning the operands in this way, we guarantee that for any
65 // of the sets of operands which could classify to that tuple.
78 // Some targets need a custom way to parse operands, some specific instructions
136 /// class of operands which can be matched.
159 /// sake user operands only record their immediate super class, while registe
[all...] |
| CodeGenDAGPatterns.cpp | 348 // Both operands must be integer or FP, but we don't care which.
869 /// constraint to the nodes operands. This returns true if it makes a
[all...] |
| /external/llvm/lib/Analysis/ |
| ScalarEvolutionNormalization.cpp | 109 SmallVector<const SCEV *, 8> Operands;
111 // The addrec conceptually uses its operands at loop entry.
116 Operands.push_back(TransformSubExpr(*I, LUser, 0));
119 const SCEV *Result = SE.getAddRecExpr(Operands, L, SCEV::FlagAnyWrap);
160 SmallVector<const SCEV *, 8> Operands;
168 Operands.push_back(N);
173 case scAddExpr: return SE.getAddExpr(Operands);
174 case scMulExpr: return SE.getMulExpr(Operands);
175 case scSMaxExpr: return SE.getSMaxExpr(Operands);
176 case scUMaxExpr: return SE.getUMaxExpr(Operands);
[all...] |
| ScalarEvolution.cpp | 529 // Compare the number of operands.
854 SmallVector<const SCEV *, 4> Operands;
859 Operands.push_back(S);
862 return getAddExpr(Operands);
869 SmallVector<const SCEV *, 4> Operands;
874 Operands.push_back(S)
[all...] |
| /external/llvm/include/llvm/IR/ |
| Metadata.h | 144 /// getNumOperands - Return number of MDNode operands.
155 // critical code because it recursively visits all the MDNode's operands.
200 void *Operands; // SmallVector<TrackingVH<MDNode>, 4>
224 /// getNumOperands - Return the number of NamedMDNode operands.
|
| /external/llvm/lib/Transforms/IPO/ |
| StripSymbols.cpp | 145 SmallPtrSet<Constant*, 4> Operands;
148 Operands.insert(cast<Constant>(C->getOperand(i)));
158 for (SmallPtrSet<Constant*, 4>::iterator OI = Operands.begin(),
159 OE = Operands.end(); OI != OE; ++OI)
|
| ArgumentPromotion.cpp | 21 // more than three operands to the function, because passing thousands of
22 // operands for a large array or structure is unprofitable! This limit can be
264 // This load is safe if any prefix of its operands is safe to load.
377 IndicesVector Operands;
381 Operands.clear();
387 Operands.push_back(0);
404 Operands.push_back(C->getSExtValue());
424 // is safe if Operands, or a prefix of Operands, is marked as safe.
425 if (!PrefixIn(Operands, SafeToUnconditionallyLoad)
[all...] |
| /external/llvm/include/llvm/CodeGen/ |
| MachineInstr.h | 73 // Operands are allocated by an ArrayRecycler.
74 MachineOperand *Operands; // Pointer to the first operand.
75 unsigned NumOperands; // Number of operands on instruction.
77 OperandCapacity CapOperands; // Capacity of the Operands array.
110 /// implicit operands. It reserves space for number of operands specified by
263 /// Access to explicit operands of the instruction.
269 return Operands[i];
273 return Operands[i];
276 /// getNumExplicitOperands - Returns the number of non-implicit operands
[all...] |
| /external/llvm/include/llvm/MC/ |
| MCInst.h | 31 /// MCOperand - Instances of this class represent operands of the MCInst class.
153 SmallVector<MCOperand, 8> Operands;
163 const MCOperand &getOperand(unsigned i) const { return Operands[i]; }
164 MCOperand &getOperand(unsigned i) { return Operands[i]; }
165 unsigned getNumOperands() const { return Operands.size(); }
168 Operands.push_back(Op);
171 void clear() { Operands.clear(); }
172 size_t size() { return Operands.size(); }
175 iterator begin() { return Operands.begin(); }
176 iterator end() { return Operands.end();
[all...] |
| /external/llvm/lib/DebugInfo/ |
| DWARFDebugFrame.cpp | 64 /// opcode and an optional sequence of operands.
65 typedef std::vector<uint64_t> Operands;
72 Operands Ops;
78 /// operands to the Instructions vector.
128 // No operands
132 // Operands: Address
136 // Operands: 1-byte delta
140 // Operands: 2-byte delta
144 // Operands: 4-byte delta
152 // Operands: ULEB12
[all...] |
| /external/llvm/lib/IR/ |
| ConstantsContext.h | 55 // allocate space for exactly two operands
76 // allocate space for exactly three operands
97 // allocate space for exactly two operands
118 // allocate space for exactly three operands
140 // allocate space for exactly three operands
239 // allocate space for exactly two operands
323 operands(ops.begin(), ops.end()), indices(inds.begin(), inds.end()) {}
327 std::vector<Constant*> operands; member in struct:llvm::ExprMapKeyType
333 this->operands == that.operands &
[all...] |
| /external/llvm/include/llvm/Analysis/ |
| ScalarEvolutionExpressions.h | 139 const SCEV *const *Operands;
144 : SCEV(ID, T), Operands(O), NumOperands(N) {}
150 return Operands[i];
154 op_iterator op_begin() const { return Operands; }
155 op_iterator op_end() const { return Operands + NumOperands; }
281 /// All operands of an AddRec are required to be loop invariant.
293 const SCEV *getStart() const { return Operands[0]; }
581 SmallVector<const SCEV *, 2> Operands;
583 Operands.push_back(visit(Expr->getOperand(i)));
584 return SE.getAddExpr(Operands);
[all...] |
| /external/llvm/lib/Target/R600/ |
| AMDILPeepholeOptimizer.cpp | 617 Value *Operands[4] = {
623 CallInst *CI = CallInst::Create(Func, Operands, "BitInsertOpt");
781 Value *Operands[3] = {
786 // Lets create the Call with the operands
787 CallInst *CI = CallInst::Create(Func, Operands, "ByteExtractOpt");
[all...] |
| /external/llvm/lib/Transforms/Scalar/ |
| SCCP.cpp | 428 // because they have potentially new operands.
665 // Look at all of the executable operands of the PHI node. If any of them
669 // If there are no executable operands, the PHI remains undefined.
860 // Otherwise, one of our operands is overdefined. Try to produce something
[all...] |
