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

1 2 3

  /external/bison/src/
state.h 116 int num; member in struct:__anon1503
122 TRANSITIONS->states[Num]? Can be a token (amongst which the error
125 #define TRANSITION_SYMBOL(Transitions, Num) \
126 (Transitions->states[Num]->accessing_symbol)
128 /* Is the TRANSITIONS->states[Num] a shift? (as opposed to gotos). */
130 #define TRANSITION_IS_SHIFT(Transitions, Num) \
131 (ISTOKEN (TRANSITION_SYMBOL (Transitions, Num)))
133 /* Is the TRANSITIONS->states[Num] a goto?. */
135 #define TRANSITION_IS_GOTO(Transitions, Num) \
136 (!TRANSITION_IS_SHIFT (Transitions, Num))
174 int num; member in struct:__anon1504
187 int num; member in struct:__anon1505
    [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 123 void setVarArgsNumGPR(unsigned Num) { VarArgsNumGPR = Num; }
126 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);
MachineFunction.cpp 216 MachineFunction::allocateMemRefsArray(unsigned long Num) {
217 return Allocator.Allocate<MachineMemOperand *>(Num);
224 unsigned Num = 0;
227 ++Num;
230 MachineInstr::mmo_iterator Result = allocateMemRefsArray(Num);
249 return std::make_pair(Result, Result + Num);
256 unsigned Num = 0;
259 ++Num;
262 MachineInstr::mmo_iterator Result = allocateMemRefsArray(Num);
281 return std::make_pair(Result, Result + Num);
    [all...]
GCMetadata.cpp 162 OS << "\t" << RI->Num << "\t" << RI->StackOffset << "[sp]\n";
173 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;
  /external/llvm/include/llvm/CodeGen/
GCMetadata.h 72 int Num; //< Usually a frame index.
76 GCRoot(int N, const Constant *MD) : Num(N), StackOffset(-1), Metadata(MD) {}
117 /// addStackRoot - Registers a root that lives on the stack. Num is the
120 void addStackRoot(int Num, const Constant *Metadata) {
121 Roots.push_back(GCRoot(Num, Metadata));
124 /// addSafePoint - Notes the existence of a safe point. Num is the ID of the
SlotIndexes.h 86 enum Slot { LOAD, USE, DEF, STORE, NUM };
116 InstrDist = 4*NUM
553 getMBBRange(unsigned Num) const {
554 return MBBRanges[Num];
564 SlotIndex getMBBStartIdx(unsigned Num) const {
565 return getMBBRange(Num).first;
574 SlotIndex getMBBEndIdx(unsigned Num) const {
575 return getMBBRange(Num).second;
SelectionDAGISel.h 209 void ReplaceUses(const SDValue *F, const SDValue *T, unsigned Num) {
211 CurDAG->ReplaceAllUsesOfValuesWith(F, T, Num, &ISU);
  /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 258 static void PrintPercent(unsigned Num, unsigned Sum) {
259 errs() << "(" << Num*100ULL/Sum << "."
260 << ((Num*1000ULL/Sum) % 10) << "%)\n";
  /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/utils/TableGen/
InstrInfoEmitter.h 45 void emitRecord(const CodeGenInstruction &Inst, unsigned Num,
InstrInfoEmitter.cpp 23 unsigned Num, raw_ostream &OS) {
24 OS << "static const unsigned ImplicitList" << Num << "[] = { ";
252 void InstrInfoEmitter::emitRecord(const CodeGenInstruction &Inst, unsigned Num,
264 OS << Num << ",\t" << MinOperands << ",\t"
333 OS << " }, // Inst #" << Num << " = " << Inst.TheDef->getName() << "\n";
ARMDecoderEmitter.cpp 936 unsigned Num, BitNo;
937 Num = BitNo = 0;
    [all...]
FixedLenDecoderEmitter.cpp 686 unsigned Num, BitNo;
687 Num = BitNo = 0;
720 ++Num;
733 ++Num;
736 assert(StartBits.size() == Num && EndBits.size() == Num &&
737 FieldVals.size() == Num);
738 return Num;
    [all...]
  /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/llvm/lib/Target/Blackfin/
BlackfinISelDAGToDAG.cpp 129 unsigned Num,
132 ops[Num] = Val;
  /external/llvm/lib/Transforms/Scalar/
Sink.cpp 85 unsigned Num = PHINode::getIncomingValueNumForOperand(I.getOperandNo());
86 UseBlock = PN->getIncomingBlock(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/clang/include/clang/AST/
DeclObjC.h 690 void setProtocolList(ObjCProtocolDecl *const* List, unsigned Num,
692 ReferencedProtocols.set(List, Num, Locs, C);
698 unsigned Num,
    [all...]

Completed in 804 milliseconds

1 2 3