HomeSort by relevance Sort by last modified time
    Searched refs:Operands (Results 126 - 150 of 349) sorted by null

1 2 3 4 56 7 8 91011>>

  /prebuilts/clang/host/linux-x86/clang-3960126/prebuilt_include/llvm/include/llvm/Analysis/
TargetTransformInfoImpl.h 107 ArrayRef<const Value *> Operands) {
110 for (unsigned Idx = 0, Size = Operands.size(); Idx != Size; ++Idx)
111 if (!isa<Constant>(Operands[Idx]))
581 ArrayRef<const Value *> Operands) {
594 auto GTI = gep_type_begin(PointeeType, Operands);
596 for (auto I = Operands.begin(); I != Operands.end(); ++I, ++GTI) {
  /prebuilts/clang/host/linux-x86/clang-3960126/prebuilt_include/llvm/include/llvm/CodeGen/
MachineInstr.h 79 // Operands are allocated by an ArrayRecycler.
80 MachineOperand *Operands; // Pointer to the first operand.
81 unsigned NumOperands; // Number of operands on instruction.
83 OperandCapacity CapOperands; // Capacity of the Operands array.
99 // of memory operands required to be precise exceeds the maximum value of
100 // NumMemRefs - currently 256 - we remove the operands entirely. Note also
121 /// This constructor create a MachineInstr and add the implicit operands.
122 /// It reserves space for number of operands specified by
275 /// Access to explicit operands of the instruction.
281 return Operands[i]
    [all...]
  /prebuilts/clang/host/linux-x86/clang-3977809/prebuilt_include/llvm/include/llvm/Analysis/
TargetTransformInfoImpl.h 107 ArrayRef<const Value *> Operands) {
110 for (unsigned Idx = 0, Size = Operands.size(); Idx != Size; ++Idx)
111 if (!isa<Constant>(Operands[Idx]))
581 ArrayRef<const Value *> Operands) {
594 auto GTI = gep_type_begin(PointeeType, Operands);
596 for (auto I = Operands.begin(); I != Operands.end(); ++I, ++GTI) {
  /prebuilts/clang/host/linux-x86/clang-3977809/prebuilt_include/llvm/include/llvm/CodeGen/
MachineInstr.h 79 // Operands are allocated by an ArrayRecycler.
80 MachineOperand *Operands; // Pointer to the first operand.
81 unsigned NumOperands; // Number of operands on instruction.
83 OperandCapacity CapOperands; // Capacity of the Operands array.
99 // of memory operands required to be precise exceeds the maximum value of
100 // NumMemRefs - currently 256 - we remove the operands entirely. Note also
121 /// This constructor create a MachineInstr and add the implicit operands.
122 /// It reserves space for number of operands specified by
275 /// Access to explicit operands of the instruction.
281 return Operands[i]
    [all...]
  /prebuilts/clang/host/linux-x86/clang-4053586/prebuilt_include/llvm/include/llvm/Analysis/
TargetTransformInfoImpl.h 107 ArrayRef<const Value *> Operands) {
110 for (unsigned Idx = 0, Size = Operands.size(); Idx != Size; ++Idx)
111 if (!isa<Constant>(Operands[Idx]))
581 ArrayRef<const Value *> Operands) {
594 auto GTI = gep_type_begin(PointeeType, Operands);
596 for (auto I = Operands.begin(); I != Operands.end(); ++I, ++GTI) {
  /prebuilts/clang/host/linux-x86/clang-4053586/prebuilt_include/llvm/include/llvm/CodeGen/
MachineInstr.h 79 // Operands are allocated by an ArrayRecycler.
80 MachineOperand *Operands; // Pointer to the first operand.
81 unsigned NumOperands; // Number of operands on instruction.
83 OperandCapacity CapOperands; // Capacity of the Operands array.
99 // of memory operands required to be precise exceeds the maximum value of
100 // NumMemRefs - currently 256 - we remove the operands entirely. Note also
121 /// This constructor create a MachineInstr and add the implicit operands.
122 /// It reserves space for number of operands specified by
275 /// Access to explicit operands of the instruction.
281 return Operands[i]
    [all...]
  /external/llvm/lib/Target/PowerPC/AsmParser/
PPCAsmParser.cpp 265 bool ParseOperand(OperandVector &Operands);
275 OperandVector &Operands, MCStreamer &Out,
304 SMLoc NameLoc, OperandVector &Operands) override;
556 assert(N == 1 && "Invalid number of operands!");
561 assert(N == 1 && "Invalid number of operands!");
566 assert(N == 1 && "Invalid number of operands!");
571 assert(N == 1 && "Invalid number of operands!");
590 assert(N == 1 && "Invalid number of operands!");
595 assert(N == 1 && "Invalid number of operands!");
600 assert(N == 1 && "Invalid number of operands!");
    [all...]
  /external/swiftshader/third_party/LLVM/lib/Analysis/
ScalarEvolution.cpp 499 // Compare the number of operands.
828 SmallVector<const SCEV *, 4> Operands;
833 Operands.push_back(S);
836 return getAddExpr(Operands);
843 SmallVector<const SCEV *, 4> Operands;
848 Operands.push_back(S);
851 return getMulExpr(Operands);
855 // If the input value is a chrec scev, truncate the chrec's operands.
857 SmallVector<const SCEV *, 4> Operands;
859 Operands.push_back(getTruncateExpr(AddRec->getOperand(i), Ty))
    [all...]
ConstantFolding.cpp 212 // Otherwise, add any offset that our operands provide.
729 /// Note that this fails if not all of the operands are constant. Otherwise,
742 // all operands are constants.
764 return 0; // All operands not constant!
796 // Recursively fold the ConstantExpr's operands.
809 /// specified opcode and operands. If successful, the constant result is
815 /// information, due to only being passed an opcode and operands. Constan
    [all...]
  /external/swiftshader/third_party/LLVM/include/llvm/Analysis/
ScalarEvolution.h 602 const SCEV *getAddRecExpr(SmallVectorImpl<const SCEV *> &Operands,
604 const SCEV *getAddRecExpr(const SmallVectorImpl<const SCEV *> &Operands,
606 SmallVector<const SCEV *, 4> NewOp(Operands.begin(), Operands.end());
610 const SCEV *getSMaxExpr(SmallVectorImpl<const SCEV *> &Operands);
612 const SCEV *getUMaxExpr(SmallVectorImpl<const SCEV *> &Operands);
677 /// getUMaxFromMismatchedTypes - Promote the operands to the wider of
683 /// getUMinFromMismatchedTypes - Promote the operands to the wider of
689 /// getPointerBase - Transitively follow the chain of pointer-type operands
    [all...]
  /external/llvm/utils/TableGen/
DAGISelMatcher.cpp 275 for (unsigned i = 0, e = Operands.size(); i != e; ++i)
276 OS << Operands[i] << ' ';
296 M->Operands == Operands && M->HasChain == HasChain &&
  /external/swiftshader/third_party/LLVM/include/llvm/
Metadata.h 141 /// getNumOperands - Return number of MDNode operands.
152 // critical code because it recursively visits all the MDNode's operands.
193 void *Operands; // SmallVector<TrackingVH<MDNode>, 4>
217 /// getNumOperands - Return the number of NamedMDNode operands.
  /external/swiftshader/third_party/LLVM/lib/Transforms/IPO/
StripSymbols.cpp 144 SmallPtrSet<Constant*, 4> Operands;
147 Operands.insert(cast<Constant>(C->getOperand(i)));
157 for (SmallPtrSet<Constant*, 4>::iterator OI = Operands.begin(),
158 OE = Operands.end(); OI != OE; ++OI)
  /external/v8/src/interpreter/
bytecode-array-builder.cc 227 template <typename... Operands>
230 Operands... operands)) {
232 // The "OperandHelper<operand_types>::Convert(builder, operands)..." will
233 // expand both the OperandType... and Operands... parameter packs e.g. for:
241 OperandHelper<operand_types>::Convert(builder, operands)...);
246 template <typename... Operands> \
247 void BytecodeArrayBuilder::Output##name(Operands... operands) { \
248 static_assert(sizeof...(Operands) <= Bytecodes::kMaxOperands,
    [all...]
bytecode-array-builder.h 430 template <typename... Operands> \
431 INLINE(void Output##Name(Operands... operands)); \
432 template <typename... Operands> \
433 INLINE(void Output##Name(BytecodeLabel* label, Operands... operands));
  /toolchain/binutils/binutils-2.25/gas/testsuite/gas/arm/
barrier-thumb.d 2 #name: Barrier Instruction Operands (Thumb)
8 # Test Barrier Instruction Operands
  /external/llvm/lib/CodeGen/MIRParser/
MIParser.cpp 59 "Only used register operands can be tied");
201 ArrayRef<ParsedMachineOperand> Operands);
203 bool verifyImplicitOperands(ArrayRef<ParsedMachineOperand> Operands,
579 // Parse any register operands before '='
581 SmallVector<ParsedMachineOperand, 8> Operands;
587 Operands.push_back(
593 if (!Operands.empty() && expectAndConsume(MIToken::equal))
608 // Parse the remaining machine operands.
615 Operands.push_back(
636 // Parse the machine memory operands
    [all...]
  /external/llvm/lib/Analysis/
ScalarEvolution.cpp 524 // Compare the number of operands.
679 // Keep looking at all operands of S.
731 for (const SCEV *Op : T->operands()) {
805 for (const SCEV *Op : Numerator->operands()) {
832 for (const SCEV *Op : Numerator->operands()) {
842 // Check whether Denominator divides one of the product operands.
    [all...]
  /external/llvm/lib/Target/X86/AsmParser/
X86AsmInstrumentation.cpp 45 // memory but don't have an explicit memory operands, for instance,
185 OperandVector &Operands,
189 InstrumentMOVS(Inst, Operands, Ctx, MII, Out);
193 InstrumentMOV(Inst, Operands, Ctx, MII, Out);
228 void InstrumentMOVS(const MCInst &Inst, OperandVector &Operands,
230 void InstrumentMOV(const MCInst &Inst, OperandVector &Operands,
348 OperandVector &Operands,
375 OperandVector &Operands, MCContext &Ctx,
414 for (unsigned Ix = 0; Ix < Operands.size(); ++Ix) {
415 assert(Operands[Ix])
    [all...]
  /external/llvm/lib/CodeGen/
MachineInstr.cpp 50 cl::desc("Print the full contents of regmask operands in IR dumps"),
267 // Register operands don't have target flags.
650 /// implicit operands. It reserves space for the number of operands specified by
654 : MCID(&tid), Parent(nullptr), Operands(nullptr), NumOperands(0), Flags(0),
664 // Reserve space for the expected number of operands.
668 Operands = MF.allocateOperandArray(CapOperands);
678 : MCID(&MI.getDesc()), Parent(nullptr), Operands(nullptr), NumOperands(0),
689 Operands = MF.allocateOperandArray(CapOperands);
691 // Copy operands
    [all...]
  /external/swiftshader/third_party/LLVM/utils/TableGen/
CodeGenDAGPatterns.h 188 /// constraint to the nodes operands. This returns true if it makes a
211 /// getNumOperands - This is the number of operands required or -1 if
232 /// constraints for this node to the operands of the node. This returns
593 std::vector<Record*> Operands;
599 const std::vector<Record*> &operands,
601 : Pattern(TP), Results(results), Operands(operands),
606 unsigned getNumOperands() const { return Operands.size(); }
618 assert(ON < Operands.size());
619 return Operands[ON]
    [all...]
  /external/spirv-llvm/lib/SPIRV/libSPIRV/
SPIRVInstruction.h 87 Operands(TheOperands){};
89 Operands(std::move(TheOperands)){};
91 return Operands;
100 std::vector<SPIRVValue *> Operands;
188 /// Create a instruction without operands.
247 /// \return Expected number of operands. If the instruction has variable
308 // Get the offset of operands.
309 // Some instructions skip literals when returning operands.
316 // Get operands which are values.
328 std::vector<SPIRVEntry*> Operands;
    [all...]
  /external/llvm/include/llvm/TableGen/
Record.h 734 virtual OpInit *clone(std::vector<Init *> &Operands) const = 0;
773 OpInit *clone(std::vector<Init *> &Operands) const override {
774 assert(Operands.size() == 1 &&
775 "Wrong number of operands for unary operation");
776 return UnOpInit::get(getOpcode(), *Operands.begin(), getType());
823 OpInit *clone(std::vector<Init *> &Operands) const override {
824 assert(Operands.size() == 2 &&
825 "Wrong number of operands for binary operation");
826 return BinOpInit::get(getOpcode(), Operands[0], Operands[1], getType())
    [all...]
  /external/swiftshader/third_party/LLVM/include/llvm/TableGen/
Record.h     [all...]
  /prebuilts/clang/host/darwin-x86/clang-3957855/prebuilt_include/llvm/include/llvm/TableGen/
Record.h 756 virtual OpInit *clone(ArrayRef<Init *> Operands) const = 0;
796 OpInit *clone(ArrayRef<Init *> Operands) const override {
797 assert(Operands.size() == 1 &&
798 "Wrong number of operands for unary operation");
799 return UnOpInit::get(getOpcode(), *Operands.begin(), getType());
848 OpInit *clone(ArrayRef<Init *> Operands) const override {
849 assert(Operands.size() == 2 &&
850 "Wrong number of operands for binary operation");
851 return BinOpInit::get(getOpcode(), Operands[0], Operands[1], getType())
    [all...]

Completed in 1836 milliseconds

1 2 3 4 56 7 8 91011>>