HomeSort by: relevance | last modified time | path
    Searched defs:AN (Results 1 - 8 of 8) sorted by relevancy

  /src/external/gpl3/gdb/dist/sim/testsuite/bfin/
b0.S 18 AN = CC;
c_cc2stat_cc_an.s 2 // Spec Reference: cc2stat cc an
19 // test CC = AN 0-0, 0-1, 1-0, 1-1
21 ASTAT = R7; // cc = 0, AN = 0
22 CC = AN; //
26 ASTAT = R7; // cc = 0, AN = 1
27 CC = AN; //
31 ASTAT = R7; // cc = 1, AN = 0
32 CC = AN; //
36 ASTAT = R7; // cc = 1, AN = 1
37 CC = AN; //
    [all...]
  /src/external/gpl3/gdb.old/dist/sim/testsuite/bfin/
b0.S 18 AN = CC;
c_cc2stat_cc_an.s 2 // Spec Reference: cc2stat cc an
19 // test CC = AN 0-0, 0-1, 1-0, 1-1
21 ASTAT = R7; // cc = 0, AN = 0
22 CC = AN; //
26 ASTAT = R7; // cc = 0, AN = 1
27 CC = AN; //
31 ASTAT = R7; // cc = 1, AN = 0
32 CC = AN; //
36 ASTAT = R7; // cc = 1, AN = 1
37 CC = AN; //
    [all...]
  /src/external/apache2/llvm/dist/clang/utils/TableGen/
ClangAttrEmitter.cpp 113 // Get a type that is suitable for storing an object of the specified type.
173 std::string AN;
176 AN = std::string(Attr->getValueAsString("ParseKind"));
180 if (Seen.find(AN) != Seen.end()) {
182 Dupes->push_back(std::make_pair(AN, Attr));
185 Seen.insert(AN);
187 AN = NormalizeAttrName(Attr->getName()).str();
189 R.push_back(std::make_pair(AN, Attr));
212 // have an attribute argument called 'Interface', so only the lower case
890 // as a string literal, while others require printing as an identifier
    [all...]
  /src/external/apache2/llvm/dist/llvm/utils/TableGen/
CodeGenDAGPatterns.cpp 239 // If there is no default mode, an empty set is equivalent to not having
361 assert(!Out.empty() && "cannot pick from an empty set");
696 // An actual vector type cannot have 0 elements, so we can treat scalars
759 TypeSizeSet AN, BN;
762 AN.insert(T.getSizeInBits());
767 Changed |= berase_if(BS, std::bind(NoSize, AN, std::placeholders::_1));
890 ".td file corrupt: can't have a node predicate *and* an imm predicate");
1584 /// change, false otherwise. If a type contradiction is found, flag an error.
1620 // have an integer type that is smaller than the VT.
1692 // Update the node type to match an instruction operand or result as specifie
    [all...]
  /src/external/apache2/llvm/dist/llvm/lib/CodeGen/SelectionDAG/
LegalizeIntegerTypes.cpp 10 // Promotion is the act of changing a computation in an illegal type into a
11 // computation in a larger type. For example, implementing i8 arithmetic in an
13 // Expansion is the act of changing a computation in an illegal type into a
367 // Convert the element to an integer and promote it by hand.
665 // to an in-register extension.
667 // The high bits are not guaranteed to be anything. Insert an extend.
735 /// Promote the overflow flag of an overflowing arithmetic node.
1319 // An ADDCARRY can generate carry only if any of the operands has its
1647 // This should only occur in unusual situations like bitcasting to an
2126 AtomicSDNode *AN = cast<AtomicSDNode>(N)
    [all...]
  /src/external/apache2/llvm/dist/llvm/lib/Target/AArch64/
AArch64ISelLowering.cpp 153 // changes then just add an extra "type" parameter.
792 // Lower READCYCLECOUNTER using an mrs from PMCCNTR_EL0.
915 // In case of strict alignment, avoid an excessive number of byte wide stores.
1572 // For example, if we have an immediate 0bx10xx0x1 ('x' indicates a
2221 /// changeIntCCToAArch64CC - Convert a DAG integer condition code to an AArch64
2250 /// changeFPCCToAArch64CC - Convert a DAG fp condition code to an AArch64 CC.
2311 /// Convert a DAG fp condition code to an AArch64 CC.
2340 /// changeVectorFPCCToAArch64CC - Convert a DAG fp condition code to an AArch64
2425 // The CMP instruction is just an alias for SUBS, and representing it as
2560 /// outer expression is an OR. We can use this fact to kno
    [all...]

Completed in 40 milliseconds