HomeSort by relevance Sort by last modified time
    Searched refs:Num (Results 1 - 25 of 65) sorted by null

1 2 3

  /external/llvm/unittests/Support/
ArrayRecyclerTest.cpp 20 int Num;
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/bison/src/
state.h 65 num rules. lookahead_tokens is an array of bitsets, one per rule.
113 int num; member in struct:__anon2350
119 TRANSITIONS->states[Num]? Can be a token (amongst which the error
122 #define TRANSITION_SYMBOL(Transitions, Num) \
123 (Transitions->states[Num]->accessing_symbol)
125 /* Is the TRANSITIONS->states[Num] a shift? (as opposed to gotos). */
127 #define TRANSITION_IS_SHIFT(Transitions, Num) \
128 (ISTOKEN (TRANSITION_SYMBOL (Transitions, Num)))
130 /* Is the TRANSITIONS->states[Num] a goto?. */
132 #define TRANSITION_IS_GOTO(Transitions, Num) \
171 int num; member in struct:__anon2351
184 int num; member in struct:__anon2352
    [all...]
  /external/clang/test/CXX/temp/temp.decls/temp.friend/
p1.cpp 4 template <typename T> struct Num {
8 Num(T value) : value_(value) {}
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& b)
    [all...]
  /external/llvm/lib/Target/PowerPC/
PPCMachineFunctionInfo.h 143 void setVarArgsNumGPR(unsigned Num) { VarArgsNumGPR = Num; }
146 void setVarArgsNumFPR(unsigned Num) { VarArgsNumFPR = Num; }
  /external/llvm/include/llvm/Support/
Allocator.h 42 T *Allocate(size_t Num) {
43 return static_cast<T*>(malloc(sizeof(T)*Num));
162 T *Allocate(size_t Num) {
163 return static_cast<T*>(Allocate(Num * sizeof(T), AlignOf<T>::Alignment));
169 T *Allocate(size_t Num, size_t Alignment) {
172 return static_cast<T*>(Allocate(Num * EltSize, Alignment));
219 T *Allocate(size_t num = 1) {
220 return Allocator.Allocate<T>(num);
  /external/llvm/lib/CodeGen/
SplitKit.h 110 SlotIndex computeLastSplitPoint(unsigned Num);
139 /// in the basic block numbered Num.
140 SlotIndex getLastSplitPoint(unsigned Num) {
142 if (LastSplitPoint[Num].first.isValid() &&
143 !LastSplitPoint[Num].second.isValid())
144 return LastSplitPoint[Num].first;
145 return computeLastSplitPoint(Num);
BasicTargetTransformInfo.cpp 221 unsigned Num = Ty->getVectorNumElements();
225 return getScalarizationOverhead(Ty, true, true) + Num * Cost;
305 unsigned Num = Dst->getVectorNumElements();
311 return getScalarizationOverhead(Dst, true, true) + Num * Cost;
352 unsigned Num = ValTy->getVectorNumElements();
360 return getScalarizationOverhead(ValTy, true, false) + Num * Cost;
445 unsigned Num = RetTy->getVectorNumElements();
448 return 10 * Cost * Num;
GCMetadata.cpp 150 OS << "\t" << RI->Num << "\t" << RI->StackOffset << "[sp]\n";
161 OS << " " << RI->Num;
SpillPlacement.cpp 183 unsigned Num = I->getNumber();
184 BlockFrequency[Num] = Freq;
185 nodes[bundles->getBundle(Num, 1)].Scale[0] += Freq;
186 nodes[bundles->getBundle(Num, 0)].Scale[1] += Freq;
MachineFunction.cpp 237 MachineFunction::allocateMemRefsArray(unsigned long Num) {
238 return Allocator.Allocate<MachineMemOperand *>(Num);
245 unsigned Num = 0;
248 ++Num;
251 MachineInstr::mmo_iterator Result = allocateMemRefsArray(Num);
270 return std::make_pair(Result, Result + Num);
277 unsigned Num = 0;
280 ++Num;
283 MachineInstr::mmo_iterator Result = allocateMemRefsArray(Num);
302 return std::make_pair(Result, Result + Num);
    [all...]
MachineTraceMetrics.cpp 487 for (unsigned Num = 0, e = BlockInfo.size(); Num != e; ++Num) {
488 const TraceBlockInfo &TBI = BlockInfo[Num];
490 const MachineBasicBlock *MBB = MTM.MF->getBlockNumbered(Num);
498 const MachineBasicBlock *MBB = MTM.MF->getBlockNumbered(Num);
    [all...]
  /external/llvm/include/llvm/CodeGen/
GCMetadata.h 72 int Num; ///< Usually a frame index.
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) {
122 Roots.push_back(GCRoot(Num, Metadata));
130 /// addSafePoint - Notes the existence of a safe point. Num is the ID of the
SlotIndexes.h 447 getMBBRange(unsigned Num) const {
448 return MBBRanges[Num];
458 SlotIndex getMBBStartIdx(unsigned Num) const {
459 return getMBBRange(Num).first;
468 SlotIndex getMBBEndIdx(unsigned Num) const {
469 return getMBBRange(Num).second;
SelectionDAGISel.h 185 void ReplaceUses(const SDValue *F, const SDValue *T, unsigned Num) {
186 CurDAG->ReplaceAllUsesOfValuesWith(F, T, Num);
  /external/llvm/lib/Analysis/
InstCount.cpp 31 STATISTIC(Num ## OPCODE ## Inst, "Number of " #OPCODE " insts");
44 void visit##OPCODE(CLASS &) { ++Num##OPCODE##Inst; ++TotalInsts; }
AliasAnalysisEvaluator.cpp 254 static void PrintPercent(unsigned Num, unsigned Sum) {
255 errs() << "(" << Num*100ULL/Sum << "."
256 << ((Num*1000ULL/Sum) % 10) << "%)\n";
  /external/llvm/lib/Target/NVPTX/
NVPTXAsmPrinter.h 117 unsigned addBytes(unsigned char *Ptr, int Num, int Bytes) {
118 assert((curpos+Num) <= size);
120 for ( int i= 0; i < Num; ++i) {
124 for ( int i=Num; i < Bytes ; ++i) {
130 unsigned addZeros(int Num) {
131 assert((curpos+Num) <= size);
132 for ( int i= 0; i < Num; ++i) {
  /cts/tools/dasm/src/dasm/
sym.java 84 static final int Num = 71;
  /external/clang/test/CodeGen/
2002-07-14-MiscTests3.c 32 char PtrFunc2(FuncPtr FuncTab[30], int Num) {
33 return FuncTab[Num]('b');
111 int SumArray(int Array[], int Num) {
113 for (i = 0; i < Num; ++i)
  /external/llvm/include/llvm/ADT/
DenseMap.h 349 void setNumEntries(unsigned Num) {
350 static_cast<DerivedT *>(this)->setNumEntries(Num);
361 void setNumTombstones(unsigned Num) {
362 static_cast<DerivedT *>(this)->setNumTombstones(Num);
655 void setNumEntries(unsigned Num) {
656 NumEntries = Num;
662 void setNumTombstones(unsigned Num) {
663 NumTombstones = Num;
674 bool allocateBuckets(unsigned Num) {
675 NumBuckets = Num;
    [all...]
  /external/llvm/utils/TableGen/
InstrInfoEmitter.cpp 48 void emitRecord(const CodeGenInstruction &Inst, unsigned Num,
61 unsigned Num, raw_ostream &OS) {
62 OS << "static const uint16_t ImplicitList" << Num << "[] = { ";
298 void InstrInfoEmitter::emitRecord(const CodeGenInstruction &Inst, unsigned Num,
310 OS << Num << ",\t" << MinOperands << ",\t"
380 OS << " }, // Inst #" << Num << " = " << Inst.TheDef->getName() << "\n";
  /external/clang/lib/Sema/
TargetAttributesSema.cpp 47 unsigned Num = NumParams.getLimitedValue(255);
48 if ((Num & 1) || Num > 30) {
55 d->addAttr(::new (S.Context) MSP430InterruptAttr(Attr.getLoc(), S.Context, Num));
  /external/webkit/PerformanceTests/SunSpider/tests/sunspider-0.9/
3d-cube.js 29 var Num;
41 Num = dx / 2;
49 Num = dy / 2;
58 Num += NumAdd;
59 if (Num >= Den) {
60 Num -= Den;
  /external/webkit/PerformanceTests/SunSpider/tests/sunspider-0.9.1/
3d-cube.js 29 var Num;
41 Num = dx / 2;
49 Num = dy / 2;
58 Num += NumAdd;
59 if (Num >= Den) {
60 Num -= Den;
  /external/llvm/lib/Transforms/Scalar/
Sink.cpp 88 unsigned Num = PHINode::getIncomingValueNumForOperand(I.getOperandNo());
89 UseBlock = PN->getIncomingBlock(Num);

Completed in 885 milliseconds

1 2 3