/external/llvm/unittests/Support/ |
H A D | ArrayRecyclerTest.cpp | 20 int Num; member in struct:__anon22794::Object 57 A1[0].Num = 21; 58 A1[7].Num = 17; 61 A2[0].Num = 121; 62 A2[7].Num = 117; 65 A3[0].Num = 221; 66 A3[7].Num = 217; 68 EXPECT_EQ(21, A1[0].Num); 69 EXPECT_EQ(17, A1[7].Num); 70 EXPECT_EQ(121, A2[0].Num); [all...] |
/external/clang/lib/Sema/ |
H A D | TargetAttributesSema.cpp | 49 unsigned Num = NumParams.getLimitedValue(255); local 50 if ((Num & 1) || Num > 30) { 57 d->addAttr(::new (S.Context) MSP430InterruptAttr(Attr.getLoc(), S.Context, Num));
|
/external/llvm/lib/Transforms/Scalar/ |
H A D | Sink.cpp | 88 unsigned Num = PHINode::getIncomingValueNumForOperand(I.getOperandNo()); local 89 UseBlock = PN->getIncomingBlock(Num);
|
/external/chromium_org/third_party/mesa/src/src/gallium/drivers/radeon/ |
H A D | AMDGPUISelLowering.cpp | 186 SDValue Num = Op.getOperand(0); local 223 // Quotient = mulhu(Tmp0, Num) 224 SDValue Quotient = DAG.getNode(ISD::MULHU, DL, VT, Tmp0, Num); 229 // Remainder = Num - Num_S_Remainder 230 SDValue Remainder = DAG.getNode(ISD::SUB, DL, VT, Num, Num_S_Remainder);
|
/external/llvm/include/llvm/CodeGen/ |
H A D | GCMetadata.h | 72 int Num; ///< Usually a frame index. member in struct:llvm::GCRoot 77 GCRoot(int N, const Constant *MD) : Num(N), StackOffset(-1), Metadata(MD) {} 118 /// addStackRoot - Registers a root that lives on the stack. Num is the 121 void addStackRoot(int Num, const Constant *Metadata) { argument 122 Roots.push_back(GCRoot(Num, Metadata)); 130 /// addSafePoint - Notes the existence of a safe point. Num is the ID of the
|
H A D | SelectionDAGISel.h | 185 void ReplaceUses(const SDValue *F, const SDValue *T, unsigned Num) { argument 186 CurDAG->ReplaceAllUsesOfValuesWith(F, T, Num);
|
/external/llvm/include/llvm/Support/ |
H A D | Allocator.h | 42 T *Allocate(size_t Num) { argument 43 return static_cast<T*>(malloc(sizeof(T)*Num)); 162 T *Allocate(size_t Num) { argument 163 return static_cast<T*>(Allocate(Num * sizeof(T), AlignOf<T>::Alignment)); 169 T *Allocate(size_t Num, size_t Alignment) { argument 172 return static_cast<T*>(Allocate(Num * EltSize, Alignment));
|
/external/llvm/lib/Analysis/ |
H A D | AliasAnalysisEvaluator.cpp | 326 static void PrintPercent(unsigned Num, unsigned Sum) { argument 327 errs() << "(" << Num*100ULL/Sum << "." 328 << ((Num*1000ULL/Sum) % 10) << "%)\n";
|
/external/llvm/lib/CodeGen/ |
H A D | SpillPlacement.cpp | 193 unsigned Num = I->getNumber(); local 194 BlockFrequencies[Num] = MBFI.getBlockFreq(I);
|
H A D | SplitKit.h | 111 SlotIndex computeLastSplitPoint(unsigned Num); 140 /// in the basic block numbered Num. 141 SlotIndex getLastSplitPoint(unsigned Num) { argument 143 if (LastSplitPoint[Num].first.isValid() && 144 !LastSplitPoint[Num].second.isValid()) 145 return LastSplitPoint[Num].first; 146 return computeLastSplitPoint(Num);
|
H A D | BasicTargetTransformInfo.cpp | 251 unsigned Num = Ty->getVectorNumElements(); local 255 return getScalarizationOverhead(Ty, true, true) + Num * Cost; 336 unsigned Num = Dst->getVectorNumElements(); local 342 return getScalarizationOverhead(Dst, true, true) + Num * Cost; 384 unsigned Num = ValTy->getVectorNumElements(); local 392 return getScalarizationOverhead(ValTy, true, false) + Num * Cost; 483 unsigned Num = RetTy->getVectorNumElements(); local 486 return 10 * Cost * Num;
|
H A D | LiveVariables.cpp | 717 unsigned Num = MBB.getNumber(); local 720 if (AliveBlocks.test(Num))
|
H A D | MachineFunction.cpp | 243 MachineFunction::allocateMemRefsArray(unsigned long Num) { argument 244 return Allocator.Allocate<MachineMemOperand *>(Num); 251 unsigned Num = 0; local 254 ++Num; 257 MachineInstr::mmo_iterator Result = allocateMemRefsArray(Num); 276 return std::make_pair(Result, Result + Num); 283 unsigned Num = 0; local 286 ++Num; 289 MachineInstr::mmo_iterator Result = allocateMemRefsArray(Num); 308 return std::make_pair(Result, Result + Num); [all...] |
H A D | SplitKit.cpp | 61 SlotIndex SplitAnalysis::computeLastSplitPoint(unsigned Num) { argument 62 const MachineBasicBlock *MBB = MF.getBlockNumbered(Num); 64 std::pair<SlotIndex, SlotIndex> &LSP = LastSplitPoint[Num];
|
/external/llvm/lib/Target/NVPTX/ |
H A D | NVPTXAsmPrinter.h | 110 unsigned addBytes(unsigned char *Ptr, int Num, int Bytes) { argument 111 assert((curpos + Num) <= size); 113 for (int i = 0; i < Num; ++i) { 117 for (int i = Num; i < Bytes; ++i) { 123 unsigned addZeros(int Num) { argument 124 assert((curpos + Num) <= size); 125 for (int i = 0; i < Num; ++i) {
|
/external/llvm/utils/TableGen/ |
H A D | InstrInfoEmitter.cpp | 55 void emitRecord(const CodeGenInstruction &Inst, unsigned Num, 75 unsigned Num, raw_ostream &OS) { 76 OS << "static const uint16_t ImplicitList" << Num << "[] = { "; local 435 void InstrInfoEmitter::emitRecord(const CodeGenInstruction &Inst, unsigned Num, argument 447 OS << Num << ",\t" << MinOperands << ",\t" 517 OS << " }, // Inst #" << Num << " = " << Inst.TheDef->getName() << "\n"; 74 PrintDefList(const std::vector<Record*> &Uses, unsigned Num, raw_ostream &OS) argument
|
/external/mesa3d/src/gallium/drivers/radeon/ |
H A D | AMDGPUISelLowering.cpp | 186 SDValue Num = Op.getOperand(0); local 223 // Quotient = mulhu(Tmp0, Num) 224 SDValue Quotient = DAG.getNode(ISD::MULHU, DL, VT, Tmp0, Num); 229 // Remainder = Num - Num_S_Remainder 230 SDValue Remainder = DAG.getNode(ISD::SUB, DL, VT, Num, Num_S_Remainder);
|
/external/clang/test/CXX/temp/temp.decls/temp.friend/ |
H A D | p1.cpp | 4 template <typename T> struct Num { struct in namespace:test0 8 Num(T value) : value_(value) {} function in struct:test0::Num 15 friend Num operator*(const Num &a, const Rep &n) { 16 Num x = 0; 23 friend Num operator+(const Num &a, const Num &b) { 27 Num& operator+=(const Num [all...] |
/external/clang/test/CodeGen/ |
H A D | 2002-07-14-MiscTests3.c | 32 char PtrFunc2(FuncPtr FuncTab[30], int Num) { argument 33 return FuncTab[Num]('b'); 111 int SumArray(int Array[], int Num) { argument 113 for (i = 0; i < Num; ++i)
|
/external/llvm/lib/Target/PowerPC/ |
H A D | PPCMachineFunctionInfo.h | 162 void setVarArgsNumGPR(unsigned Num) { VarArgsNumGPR = Num; } argument 165 void setVarArgsNumFPR(unsigned Num) { VarArgsNumFPR = Num; } argument
|
/external/llvm/lib/Target/R600/ |
H A D | AMDGPUISelLowering.cpp | 345 SDValue Num = Op.getOperand(0); local 382 // Quotient = mulhu(Tmp0, Num) 383 SDValue Quotient = DAG.getNode(ISD::MULHU, DL, VT, Tmp0, Num); 388 // Remainder = Num - Num_S_Remainder 389 SDValue Remainder = DAG.getNode(ISD::SUB, DL, VT, Num, Num_S_Remainder);
|
/external/llvm/lib/Support/ |
H A D | YAMLTraits.cpp | 626 uint32_t Num = Val; local 627 Out << Num; local 688 int32_t Num = Val; local 689 Out << Num; local 772 uint8_t Num = Val; local 773 Out << format("0x%02X", Num); 787 uint16_t Num = Val; local 788 Out << format("0x%04X", Num); 802 uint32_t Num = Val; local 803 Out << format("0x%08X", Num); 817 uint64_t Num = Val; local 822 unsigned long long Num; local [all...] |
/external/chromium_org/third_party/mesa/src/src/mesa/program/ |
H A D | prog_optimize.c | 850 GLuint Num; member in struct:interval_list 858 list->Intervals[list->Num++] = *inv; 867 GLint i = list->Num - 1; 873 list->Num++; 878 for (i = 0; i + 1 < list->Num; i++) { 892 for (k = 0; k < list->Num; k++) { 897 while (k < list->Num - 1) { 901 list->Num--; 927 qsort(list->Intervals, list->Num, sizeof(struct interval), compare_start); 931 for (i = 0; i + 1 < list->Num; [all...] |
/external/llvm/include/llvm/ADT/ |
H A D | DenseMap.h | 349 void setNumEntries(unsigned Num) { argument 350 static_cast<DerivedT *>(this)->setNumEntries(Num); 361 void setNumTombstones(unsigned Num) { argument 362 static_cast<DerivedT *>(this)->setNumTombstones(Num); 655 void setNumEntries(unsigned Num) { argument 656 NumEntries = Num; 662 void setNumTombstones(unsigned Num) { argument 663 NumTombstones = Num; 674 bool allocateBuckets(unsigned Num) { argument 675 NumBuckets = Num; 923 setNumEntries(unsigned Num) argument 975 allocateBuckets(unsigned Num) argument [all...] |
/external/mesa3d/src/mesa/program/ |
H A D | prog_optimize.c | 850 GLuint Num; member in struct:interval_list 858 list->Intervals[list->Num++] = *inv; 867 GLint i = list->Num - 1; 873 list->Num++; 878 for (i = 0; i + 1 < list->Num; i++) { 892 for (k = 0; k < list->Num; k++) { 897 while (k < list->Num - 1) { 901 list->Num--; 927 qsort(list->Intervals, list->Num, sizeof(struct interval), compare_start); 931 for (i = 0; i + 1 < list->Num; [all...] |