| /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/llvm/lib/Support/ |
| BranchProbability.cpp | 28 static uint64_t scale(uint64_t Num, uint32_t N, uint32_t D) {
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, D, N)
[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:__anon5010
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:__anon5011
184 int num; member in struct:__anon5012
[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 | 162 void setVarArgsNumGPR(unsigned Num) { VarArgsNumGPR = Num; }
165 void setVarArgsNumFPR(unsigned Num) { VarArgsNumFPR = Num; }
|
| /external/llvm/lib/CodeGen/ |
| SplitKit.h | 111 SlotIndex computeLastSplitPoint(unsigned Num);
140 /// in the basic block numbered Num.
141 SlotIndex getLastSplitPoint(unsigned Num) {
143 if (LastSplitPoint[Num].first.isValid() &&
144 !LastSplitPoint[Num].second.isValid())
145 return LastSplitPoint[Num].first;
146 return computeLastSplitPoint(Num);
|
| BasicTargetTransformInfo.cpp | 322 unsigned Num = Ty->getVectorNumElements();
326 return getScalarizationOverhead(Ty, true, true) + Num * Cost;
428 unsigned Num = Dst->getVectorNumElements();
434 return getScalarizationOverhead(Dst, true, true) + Num * Cost;
476 unsigned Num = ValTy->getVectorNumElements();
484 return getScalarizationOverhead(ValTy, true, false) + Num * Cost;
609 unsigned Num = RetTy->getVectorNumElements();
612 return 10 * Cost * Num;
|
| GCMetadata.cpp | 143 OS << "\t" << RI->Num << "\t" << RI->StackOffset << "[sp]\n";
154 OS << " " << RI->Num;
|
| /external/llvm/include/llvm/CodeGen/ |
| GCMetadata.h | 74 int Num; ///< Usually a frame index.
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) {
124 Roots.push_back(GCRoot(Num, Metadata));
132 /// addSafePoint - Notes the existence of a safe point. Num is the ID of the
|
| SelectionDAGISel.h | 187 void ReplaceUses(const SDValue *F, const SDValue *T, unsigned Num) {
188 CurDAG->ReplaceAllUsesOfValuesWith(F, T, Num);
|
| /external/llvm/include/llvm/Support/ |
| BranchProbability.h | 55 /// Scales \c Num. Guarantees full precision. Returns the floor of the
58 /// \return \c Num times \c this.
59 uint64_t scale(uint64_t Num) const;
63 /// Scales \c Num by the inverse of \c this. Guarantees full precision.
66 /// \return \c Num divided by \c this.
67 uint64_t scaleByInverse(uint64_t Num) const;
|
| /external/llvm/lib/Analysis/ |
| InstCount.cpp | 32 STATISTIC(Num ## OPCODE ## Inst, "Number of " #OPCODE " insts");
45 void visit##OPCODE(CLASS &) { ++Num##OPCODE##Inst; ++TotalInsts; }
|
| /external/llvm/unittests/ADT/ |
| PointerIntPairTest.cpp | 53 static inline void *getAsVoidPointer(Fixnum31 Num) {
54 return reinterpret_cast<void *>(Num.Value << NumLowBitsAvailable);
|
| /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.cpp | 55 void emitRecord(const CodeGenInstruction &Inst, unsigned Num,
76 unsigned Num, raw_ostream &OS) {
77 OS << "static const uint16_t ImplicitList" << Num << "[] = { ";
387 unsigned Num = 0;
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,
473 OS << Num << ",\t" << MinOperands << ",\t
[all...] |
| /external/llvm/lib/Target/SystemZ/AsmParser/ |
| SystemZAsmParser.cpp | 72 // LLVM register Num, which has kind Kind. In some ways it might be
83 unsigned Num;
133 createReg(RegisterKind Kind, unsigned Num, SMLoc StartLoc, SMLoc EndLoc) {
136 Op->Reg.Num = Num;
140 createAccessReg(unsigned Num, SMLoc StartLoc, SMLoc EndLoc) {
142 Op->AccessReg = Num;
182 return Reg.Num;
307 unsigned Num;
438 if (Name.substr(1).getAsInteger(10, Reg.Num))
[all...] |
| /external/llvm/lib/Target/NVPTX/ |
| NVPTXAsmPrinter.h | 111 unsigned addBytes(unsigned char *Ptr, int Num, int Bytes) {
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) {
125 assert((curpos + Num) <= size);
126 for (int i = 0; i < Num; ++i) {
|
| /external/llvm/lib/Target/AArch64/ |
| AArch64BranchRelaxation.cpp | 112 unsigned Num = MBB.getNumber();
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();
195 if (!Num) // block zero is never changed from offset zero.
200 BlockInfo[Num].Offset = BlockInfo[PrevNum].postOffset(LogAlign);
201 PrevNum = Num;
|
| /external/llvm/include/llvm/ADT/ |
| DenseMap.h | 348 void setNumEntries(unsigned Num) {
349 static_cast<DerivedT *>(this)->setNumEntries(Num);
360 void setNumTombstones(unsigned Num) {
361 static_cast<DerivedT *>(this)->setNumTombstones(Num);
647 void setNumEntries(unsigned Num) {
648 NumEntries = Num;
654 void setNumTombstones(unsigned Num) {
655 NumTombstones = Num;
666 bool allocateBuckets(unsigned Num) {
667 NumBuckets = Num;
[all...] |
| /prebuilts/python/darwin-x86/2.7.5/lib/python2.7/test/ |
| test_ast.py | 152 # Num
266 x = ast.Num()
272 x = ast.Num()
278 x = ast.Num(42)
287 x = ast.Num(lineno=2)
290 x = ast.Num(42, lineno=0)
295 self.assertRaises(TypeError, ast.Num, 1, 2)
296 self.assertRaises(TypeError, ast.Num, 1, 2, lineno=0)
299 body = [ast.Num(42)]
312 n1 = ast.Num(1
[all...] |
| /prebuilts/python/linux-x86/2.7.5/lib/python2.7/test/ |
| test_ast.py | 152 # Num
266 x = ast.Num()
272 x = ast.Num()
278 x = ast.Num(42)
287 x = ast.Num(lineno=2)
290 x = ast.Num(42, lineno=0)
295 self.assertRaises(TypeError, ast.Num, 1, 2)
296 self.assertRaises(TypeError, ast.Num, 1, 2, lineno=0)
299 body = [ast.Num(42)]
312 n1 = ast.Num(1
[all...] |
| /external/chromium_org/third_party/mesa/src/src/mesa/program/ |
| prog_optimize.c | 850 GLuint Num;
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; i++)
[all...] |
| /external/mesa3d/src/mesa/program/ |
| prog_optimize.c | 850 GLuint Num;
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; i++)
[all...] |
| /packages/apps/FMRadio/jni/fmr/ |
| fmr_core.cpp | 583 fm_s32 ret = 0, Num = 0, i, j;
622 if ((LastExist == fm_true) && (Num > 0)) /*neighbor channel*/ {
623 if (cur_freq.rssi>SortData[Num-1].rssi)/*save current freq and cover last channel*/ {
628 SortData[Num-1].ch=cur_freq.freq;
629 SortData[Num-1].rssi=cur_freq.rssi;
630 SortData[Num-1].reserve = 1;
641 SortData[Num].ch = cur_freq.freq;
642 SortData[Num].rssi = cur_freq.rssi;
643 SortData[Num].reserve = 1;
644 Num++
[all...] |
