/external/pcre/dist2/src/sljit/ |
H A D | sljitNativeARM_64.c | 53 #define RN(rn) (reg_map[rn] << 5) macro 432 return push_inst(compiler, (ORRI ^ W_OP) | RD(dst) | RN(TMP_ZERO) | bitmask); 437 return push_inst(compiler, ORRI | RD(dst) | RN(TMP_ZERO) | bitmask); 565 return push_inst(compiler, ((op == SLJIT_ADD ? ADDI : SUBI) ^ inv_bits) | RD(dst) | RN(reg)); 569 return push_inst(compiler, (ADDI ^ inv_bits) | RD(dst) | RN(reg) | (imm << 10)); 574 return push_inst(compiler, (SUBI ^ inv_bits) | RD(dst) | RN(reg) | (nimm << 10)); 578 return push_inst(compiler, (ADDI ^ inv_bits) | RD(dst) | RN(reg) | ((imm >> 12) << 10) | (1 << 22)); 582 return push_inst(compiler, (SUBI ^ inv_bits) | RD(dst) | RN(reg) | ((nimm >> 12) << 10) | (1 << 22)); 585 FAIL_IF(push_inst(compiler, (ADDI ^ inv_bits) | RD(dst) | RN(reg) | ((imm >> 12) << 10) | (1 << 22))); 586 return push_inst(compiler, (ADDI ^ inv_bits) | RD(dst) | RN(ds [all...] |
/external/llvm/include/llvm/CodeGen/ |
H A D | MachineRegionInfo.h | 60 bool operator==(const MachineRegion &RN) const { 61 return this == reinterpret_cast<const MachineRegionNode*>(&RN); 72 bool operator==(const MachineRegionNode &RN) const { 73 return &RN == reinterpret_cast<const MachineRegionNode*>(this);
|
/external/llvm/include/llvm/Transforms/Utils/ |
H A D | CodeExtractor.h | 82 CodeExtractor(DominatorTree &DT, const RegionNode &RN,
|
/external/valgrind/none/tests/arm/ |
H A D | vfp.c | 77 #define TESTINSN_vmov_core_single(instruction, RN, SD, SDval) \ 83 "mov " #RN ", #0\n\t" \ 86 "str " #RN ", [%0]\n\t" \ 89 : #SD, #RN, "memory" \ 91 printf("%s :: "#RN" 0x%08x\n", \ 95 #define TESTINSN_vmov_single_core(instruction, SD, RN, RNval) \ 99 printf(#RN" 0x%08x\t", RNval); \ 101 "mov " #RN ", %1\n\t" \ 107 : #SD, #RN, "memory" \ 134 #define TESTINSN_vmov_2single_2core(instruction, SD1, SD2, RN, R [all...] |
/external/llvm/lib/Target/NVPTX/ |
H A D | NVPTX.h | 129 RN, enumerator in enum:llvm::NVPTX::PTXCvtMode::CvtMode
|
/external/llvm/lib/Analysis/ |
H A D | ScalarEvolutionNormalization.cpp | 217 const SCEV *RN = TransformSubExpr(RO, User, OperandValToReplace); local 218 if (LO != LN || RO != RN) 219 return SE.getUDivExpr(LN, RN);
|
/external/swiftshader/third_party/LLVM/lib/Analysis/ |
H A D | ScalarEvolutionNormalization.cpp | 187 const SCEV *RN = TransformSubExpr(RO, User, OperandValToReplace); local 188 if (LO != LN || RO != RN) 189 return SE.getUDivExpr(LN, RN);
|
/external/valgrind/none/tests/arm64/ |
H A D | crc32.c | 25 #define TESTINST3(instruction, RMval, RNval, RD, RM, RN, carryin) \ 33 "mov " #RN ",%3;" \ 39 : #RD, #RM, #RN, "cc", "memory" \
|
H A D | memory.c | 42 // Same as TESTINST2 except it doesn't print the RN value, since 45 #define TESTINST2_hide2(instruction, RNval, RD, RN, carryin) \ 52 "mov " #RN ",%2;" \ 58 : #RD, #RN, "cc", "memory", "x28" \ 72 #define TESTINST3_hide2and3(instruction, RMval, RNval, RD, RM, RN, carryin) \ 80 "mov " #RN ",%3;" \ 86 : #RD, #RM, #RN, "cc", "memory" \
|
/external/swiftshader/third_party/LLVM/utils/TableGen/ |
H A D | CodeGenDAGPatterns.h | 612 Record *getResult(unsigned RN) const { 613 assert(RN < Results.size()); 614 return Results[RN]; 622 Record *getImpResult(unsigned RN) const { 623 assert(RN < ImpResults.size()); 624 return ImpResults[RN];
|
/external/eigen/Eigen/src/SparseLU/ |
H A D | SparseLU_gemm_kernel.h | 35 RN = 2, // register blocking enumerator in enum:Eigen::internal::__anon5858 41 Index n_end = (n/RN)*RN; // number of columns of B-C suitable for processing RN columns at once 65 for(Index j=0; j<n_end; j+=RN) 73 // load and expand a RN x RK block of B
|
/external/llvm/lib/Target/Hexagon/ |
H A D | RDFLiveness.h | 103 MachineBasicBlock *getBlockWithRef(NodeId RN) const;
|
H A D | HexagonExpandCondsets.cpp | 265 void renameInRange(RegisterRef RO, RegisterRef RN, unsigned PredR, 914 /// to the "new" register RN, but only in instructions predicated on the given 916 void HexagonExpandCondsets::renameInRange(RegisterRef RO, RegisterRef RN, argument 932 Op.setReg(RN.Reg); 933 Op.setSubReg(RN.Sub);
|
/external/llvm/lib/Transforms/Scalar/ |
H A D | StructurizeCFG.cpp | 311 for (RegionNode *RN : TempOrder) { 312 BasicBlock *BB = RN->getEntry(); 504 for (RegionNode *RN : reverse(Order)) { 507 << (RN->isSubRegion() ? "SubRegion with entry: " : "") 508 << RN->getEntry()->getName() << " Loop Depth: " 509 << LI->getLoopDepth(RN->getEntry()) << "\n"); 512 gatherPredicates(RN); 515 Visited.insert(RN->getEntry()); 518 analyzeLoops(RN);
|
/external/llvm/lib/Target/PowerPC/InstPrinter/ |
H A D | PPCInstPrinter.cpp | 45 std::string RN(RegName); 47 RN[0] = 'f'; 48 OS << RN; local
|
/external/llvm/include/llvm/Analysis/ |
H A D | RegionInfo.h | 850 bool operator==(const Region &RN) const { 851 return this == reinterpret_cast<const RegionNode *>(&RN); 861 bool operator==(const RegionNode &RN) const { 862 return &RN == reinterpret_cast<const RegionNode *>(this);
|
/external/llvm/lib/Transforms/Utils/ |
H A D | CodeExtractor.cpp | 112 buildExtractionBlockSet(const RegionNode &RN) { argument 113 if (!RN.isSubRegion()) 115 return buildExtractionBlockSet(RN.getNodeAs<BasicBlock>()); 117 const Region &R = *RN.getNodeAs<Region>(); 135 CodeExtractor::CodeExtractor(DominatorTree &DT, const RegionNode &RN, argument 138 Blocks(buildExtractionBlockSet(RN)), NumExitBlocks(~0U) {}
|
/external/llvm/utils/TableGen/ |
H A D | CodeGenDAGPatterns.h | 665 Record *getResult(unsigned RN) const { 666 assert(RN < Results.size()); 667 return Results[RN]; 675 Record *getImpResult(unsigned RN) const { 676 assert(RN < ImpResults.size()); 677 return ImpResults[RN];
|
/external/clang/lib/AST/ |
H A D | DeclarationName.cpp | 99 unsigned LN = LHSSelector.getNumArgs(), RN = RHSSelector.getNumArgs(); local 100 for (unsigned I = 0, N = std::min(LN, RN); I != N; ++I) { 109 return compareInt(LN, RN);
|
/external/v8/src/arm/ |
H A D | constants-arm.h | 407 RN = 0 << 22, // Round to Nearest. enumerator in enum:v8::internal::VFPRoundingMode 413 kRoundToNearest = RN,
|
/external/llvm/lib/Target/NVPTX/InstPrinter/ |
H A D | NVPTXInstPrinter.cpp | 124 case NVPTX::PTXCvtMode::RN:
|
/external/libopus/celt/arm/ |
H A D | arm2gnu.pl | 72 s/^(\S+)\s+RN\s+(\S+)/$1 .req r$2/ && do { s/\$\$/\$/g; next };
|
/external/llvm/include/llvm/Support/ |
H A D | GenericDomTree.h | 398 const DomTreeNodeBase<NodeT> *RN = getNode(R); local 399 if (!RN) 402 WL.push_back(RN);
|
/external/v8/src/mips/ |
H A D | constants-mips.h | 794 RN = 0 << 0, // Round to Nearest. 800 kRoundToNearest = RN, 805 mode_round = RN,
|
/external/v8/src/mips64/ |
H A D | constants-mips64.h | 827 RN = 0 << 0, // Round to Nearest. 833 kRoundToNearest = RN, 838 mode_round = RN,
|