Searched defs:Num (Results 1 - 25 of 49) sorted by relevance

12

/external/llvm/unittests/ADT/
H A DPointerIntPairTest.cpp53 static inline void *getAsVoidPointer(Fixnum31 Num) { argument
54 return reinterpret_cast<void *>(Num.Value << NumLowBitsAvailable);
/external/llvm/unittests/Support/
H A DBranchProbabilityTest.cpp189 uint64_t Num; member in struct:__anon26524::__anon26525
278 EXPECT_EQ(T.Result, BP(T.Prob[0], T.Prob[1]).scale(T.Num));
H A DArrayRecyclerTest.cpp20 int Num; member in struct:__anon26522::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/llvm/lib/Support/
H A DBranchProbability.cpp28 static uint64_t scale(uint64_t Num, uint32_t N, uint32_t D) { argument
32 if (!Num || D == N)
33 return Num;
35 // Split Num into upper and lower parts to multiply, then recombine.
36 uint64_t ProductHigh = (Num >> 32) * N;
37 uint64_t ProductLow = (Num & UINT32_MAX) * N;
67 uint64_t BranchProbability::scale(uint64_t Num) const {
68 return ::scale(Num, N, D);
71 uint64_t BranchProbability::scaleByInverse(uint64_t Num) const {
72 return ::scale(Num,
[all...]
H A DYAMLTraits.cpp692 uint32_t Num = Val; local
693 Out << Num; local
754 int32_t Num = Val; local
755 Out << Num; local
838 uint8_t Num = Val; local
839 Out << format("0x%02X", Num);
853 uint16_t Num = Val; local
854 Out << format("0x%04X", Num);
868 uint32_t Num = Val; local
869 Out << format("0x%08X", Num);
883 uint64_t Num = Val; local
888 unsigned long long Num; local
[all...]
/external/llvm/lib/Transforms/Scalar/
H A DSink.cpp89 unsigned Num = PHINode::getIncomingValueNumForOperand(U.getOperandNo()); local
90 UseBlock = PN->getIncomingBlock(Num);
/external/chromium_org/third_party/mesa/src/src/gallium/drivers/radeon/
H A DAMDGPUISelLowering.cpp186 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 DGCMetadata.h74 int Num; ///< Usually a frame index. member in struct:llvm::GCRoot
79 GCRoot(int N, const Constant *MD) : Num(N), StackOffset(-1), Metadata(MD) {}
120 /// addStackRoot - Registers a root that lives on the stack. Num is the
123 void addStackRoot(int Num, const Constant *Metadata) { argument
124 Roots.push_back(GCRoot(Num, Metadata));
132 /// addSafePoint - Notes the existence of a safe point. Num is the ID of the
H A DSelectionDAG.h52 SDVTListNode(const FoldingSetNodeIDRef ID, const EVT *VT, unsigned int Num) : argument
53 FastID(ID), VTs(VT), NumVTs(Num) {
1002 unsigned Num);
/external/llvm/lib/Analysis/
H A DAliasAnalysisEvaluator.cpp325 static void PrintPercent(unsigned Num, unsigned Sum) { argument
326 errs() << "(" << Num*100ULL/Sum << "."
327 << ((Num*1000ULL/Sum) % 10) << "%)\n";
/external/llvm/lib/CodeGen/
H A DSpillPlacement.cpp212 unsigned Num = I->getNumber(); local
213 BlockFrequencies[Num] = MBFI->getBlockFreq(I);
H A DSplitKit.h111 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 DBasicTargetTransformInfo.cpp322 unsigned Num = Ty->getVectorNumElements(); local
326 return getScalarizationOverhead(Ty, true, true) + Num * Cost;
428 unsigned Num = Dst->getVectorNumElements(); local
434 return getScalarizationOverhead(Dst, true, true) + Num * Cost;
476 unsigned Num = ValTy->getVectorNumElements(); local
484 return getScalarizationOverhead(ValTy, true, false) + Num * Cost;
609 unsigned Num = RetTy->getVectorNumElements(); local
612 return 10 * Cost * Num;
H A DLiveVariables.cpp718 unsigned Num = MBB.getNumber(); local
721 if (AliveBlocks.test(Num))
/external/llvm/lib/Target/AArch64/
H A DAArch64BranchRelaxation.cpp112 unsigned Num = MBB.getNumber(); local
113 assert(BlockInfo[Num].Offset % (1u << Align) == 0);
114 assert(!Num || BlockInfo[PrevNum].postOffset() <= BlockInfo[Num].Offset);
115 PrevNum = Num;
194 unsigned Num = MBB.getNumber(); local
195 if (!Num) // block zero is never changed from offset zero.
200 BlockInfo[Num].Offset = BlockInfo[PrevNum].postOffset(LogAlign);
201 PrevNum = Num;
H A DAArch64LoadStoreOptimizer.cpp378 static int alignTo(int Num, int PowOf2) { argument
379 return (Num + PowOf2 - 1) & ~(PowOf2 - 1);
/external/llvm/utils/TableGen/
H A DInstrInfoEmitter.cpp55 void emitRecord(const CodeGenInstruction &Inst, unsigned Num,
76 unsigned Num, raw_ostream &OS) {
77 OS << "static const uint16_t ImplicitList" << Num << "[] = { "; local
387 unsigned Num = 0; local
392 emitRecord(*Inst, Num++, InstrInfo, EmittedLists, OperandInfoIDs, OS);
403 Num = 0;
406 if (Num % 8 == 0)
409 ++Num;
461 void InstrInfoEmitter::emitRecord(const CodeGenInstruction &Inst, unsigned Num, argument
473 OS << Num << ",\
75 PrintDefList(const std::vector<Record*> &Uses, unsigned Num, raw_ostream &OS) argument
582 unsigned Num = 0; local
[all...]
/external/mesa3d/src/gallium/drivers/radeon/
H A DAMDGPUISelLowering.cpp186 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 Dp1.cpp4 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 D2002-07-14-MiscTests3.c32 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/NVPTX/
H A DNVPTXAsmPrinter.h111 unsigned addBytes(unsigned char *Ptr, int Num, int Bytes) { argument
112 assert((curpos + Num) <= size);
114 for (int i = 0; i < Num; ++i) {
118 for (int i = Num; i < Bytes; ++i) {
124 unsigned addZeros(int Num) { argument
125 assert((curpos + Num) <= size);
126 for (int i = 0; i < Num; ++i) {
/external/llvm/lib/Target/PowerPC/
H A DPPCMachineFunctionInfo.h162 void setVarArgsNumGPR(unsigned Num) { VarArgsNumGPR = Num; } argument
165 void setVarArgsNumFPR(unsigned Num) { VarArgsNumFPR = Num; } argument
/external/clang/include/clang/AST/
H A DOpenMPClause.h329 void setNumForLoops(Expr *Num) { NumForLoops = Num; } argument
334 /// \param Num Expression associated with this clause.
339 OMPCollapseClause(Expr *Num, SourceLocation StartLoc, argument
342 NumForLoops(Num) {}
/external/chromium_org/third_party/mesa/src/src/mesa/program/
H A Dprog_optimize.c850 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 DDenseMap.h348 void setNumEntries(unsigned Num) { argument
349 static_cast<DerivedT *>(this)->setNumEntries(Num);
360 void setNumTombstones(unsigned Num) { argument
361 static_cast<DerivedT *>(this)->setNumTombstones(Num);
647 void setNumEntries(unsigned Num) { argument
648 NumEntries = Num;
654 void setNumTombstones(unsigned Num) { argument
655 NumTombstones = Num;
666 bool allocateBuckets(unsigned Num) { argument
667 NumBuckets = Num;
911 setNumEntries(unsigned Num) argument
963 allocateBuckets(unsigned Num) argument
[all...]

Completed in 5785 milliseconds

12