| /prebuilts/clang/host/darwin-x86/clang-3960126/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...] |
| /prebuilts/clang/host/darwin-x86/clang-3977809/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...] |
| /prebuilts/clang/host/darwin-x86/clang-4053586/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...] |
| /prebuilts/clang/host/linux-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...] |
| /prebuilts/clang/host/linux-x86/clang-3960126/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...] |
| /prebuilts/clang/host/linux-x86/clang-3977809/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...] |
| /prebuilts/clang/host/linux-x86/clang-4053586/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...] |
| /external/llvm/lib/CodeGen/SelectionDAG/ |
| LegalizeVectorOps.cpp | 113 /// This is essentially just bitcasting the operands to a different type and
141 // the operands because we are going to check their values at some point.
160 // node is only legalized after all of its operands are legalized.
194 // Legalize the operands
407 SmallVector<SDValue, 4> Operands(Op.getNumOperands());
416 Operands[j] = DAG.getNode(ISD::FP_EXTEND, dl, NVT, Op.getOperand(j));
418 Operands[j] = DAG.getNode(ISD::BITCAST, dl, NVT, Op.getOperand(j));
420 Operands[j] = Op.getOperand(j);
423 Op = DAG.getNode(Op.getOpcode(), dl, NVT, Operands, Op.getNode()->getFlags());
450 SmallVector<SDValue, 4> Operands(Op.getNumOperands())
[all...] |
| /external/llvm/lib/IR/ |
| Metadata.cpp | 480 // Count the unresolved operands. If there are any, RAUW support will be
505 NumUnresolved = count_if(operands(), isOperandUnresolved);
559 assert(NumUnresolved != 0 && "Expected unresolved operands");
591 // Resolve all operands.
592 for (const auto &Op : operands()) {
605 for (Metadata *MD : N->operands())
698 // First, clear out all operands to prevent any recursion (similar to
844 /// the same operands as \c Ops, return the first operand instead.
880 for (Metadata *MD : A->operands())
894 for (Metadata *MD : A->operands())
[all...] |
| /external/swiftshader/third_party/LLVM/utils/TableGen/ |
| DAGISelMatcherOpt.cpp | 133 const SmallVectorImpl<unsigned> &Operands = EN->getOperandList();
136 Operands.data(),Operands.size(),
|
| 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
125 /// class of operands which can be matched.
148 /// sake user operands only record their immediate super class, while registe
[all...] |
| CodeGenDAGPatterns.cpp | 319 // Both operands must be integer or FP, but we don't care which.
832 /// constraint to the nodes operands. This returns true if it makes a
[all...] |
| DAGISelMatcher.h | [all...] |
| X86RecognizableInstr.cpp | 227 Operands = &insn.Operands.OperandList;
401 // Filter out instructions with subreg operands.
478 const std::vector<CGIOperandList::OperandInfo> &OperandList = *Operands;
491 const std::vector<CGIOperandList::OperandInfo> &OperandList = *Operands;
519 Spec->operands[operandIndex].encoding = ENCODING_DUP;
520 Spec->operands[operandIndex].type =
525 const std::string &typeName = (*Operands)[operandIndex].Rec->getName();
527 Spec->operands[operandIndex].encoding = encodingFromString(typeName,
529 Spec->operands[operandIndex].type = typeFromString(typeName,
[all...] |
| /external/llvm/lib/Transforms/Vectorize/ |
| SLPVectorizer.cpp | 434 /// \reorder commutative operands in alt shuffle if they result in
439 /// \reorder commutative operands to get better probability of
755 for (Use &U : BundleMember->Inst->operands()) {
[all...] |
| LoadStoreVectorizer.cpp | 92 /// (the instructions defining its operands), to ensure they dominate I.
641 SmallVector<Value *, 16> Operands;
647 Operands.push_back(Instrs[I]);
652 if (isa<LoadInst>(*Operands.begin()))
653 Vectorized = vectorizeLoadChain(Operands, &InstructionsProcessed);
655 Vectorized = vectorizeStoreChain(Operands, &InstructionsProcessed);
[all...] |
| /external/swiftshader/third_party/LLVM/lib/VMCore/ |
| ConstantsContext.h | 51 // allocate space for exactly two operands
71 // allocate space for exactly three operands
91 // allocate space for exactly two operands
111 // allocate space for exactly three operands
132 // allocate space for exactly three operands
226 // allocate space for exactly two operands
310 operands(ops.begin(), ops.end()), indices(inds.begin(), inds.end()) {}
314 std::vector<Constant*> operands; member in struct:llvm::ExprMapKeyType
320 this->operands == that.operands &
[all...] |
| /external/vixl/test/aarch32/ |
| test-assembler-cond-rdlow-rnlow-operand-immediate-t32-zero.cc | 57 // across test files during template instantiation. Specifically, `Operands` has
64 struct Operands {
74 // The `operands` field represents what to pass to the assembler to
76 Operands operands; member in struct:vixl::aarch32::__anon38320::TestData
82 // Description of the operands, used for error reporting.
183 Condition cond = kTests[i].operands.cond;
184 Register rd = kTests[i].operands.rd;
185 Register rn = kTests[i].operands.rn;
186 int32_t immediate = kTests[i].operands.immediate
[all...] |
| test-assembler-cond-rdlow-rnlow-rmlow-t32.cc | 57 // across test files during template instantiation. Specifically, `Operands` has
64 struct Operands {
74 // The `operands` field represents what to pass to the assembler to
76 Operands operands; member in struct:vixl::aarch32::__anon38322::TestData
82 // Description of the operands, used for error reporting.
183 Condition cond = kTests[i].operands.cond;
184 Register rd = kTests[i].operands.rd;
185 Register rn = kTests[i].operands.rn;
186 Register rm = kTests[i].operands.rm
[all...] |
| /external/llvm/include/llvm/Analysis/ |
| ScalarEvolution.h | [all...] |
| /external/llvm/utils/TableGen/ |
| DAGISelMatcher.h | 924 const SmallVector<unsigned, 6> Operands;
929 /// operands in the root of the pattern. The rest are appended to this node.
934 ArrayRef<unsigned> operands,
939 VTs(vts.begin(), vts.end()), Operands(operands.begin(), operands.end()),
[all...] |
| CodeGenDAGPatterns.cpp | 341 // Both operands must be integer or FP, but we don't care which.
[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
147 /// class of operands which can be matched.
170 /// sake user operands only record their immediate super class, while registe
[all...] |
| /external/llvm/lib/Transforms/Scalar/ |
| SCCP.cpp | 446 // because they have potentially new operands.
691 // Look at all of the executable operands of the PHI node. If any of them
695 // If there are no executable operands, the PHI remains unknown.
896 // Otherwise, one of our operands is overdefined. Try to produce something
[all...] |
| /external/swiftshader/third_party/LLVM/lib/Transforms/Scalar/ |
| SCCP.cpp | 440 // because they have potentially new operands.
726 // Look at all of the executable operands of the PHI node. If any of them
730 // If there are no executable operands, the PHI remains undefined.
[all...] |
