| /external/llvm/lib/IR/ |
| DebugLoc.cpp | 164 int &Idx = ScopeRecordIdx[Scope];
165 if (Idx) return Idx;
169 return Idx = ExistingIdx;
179 Idx = ScopeRecords.size()+1;
180 ScopeRecords.push_back(DebugRecVH(Scope, this, Idx));
181 return Idx;
187 int &Idx = ScopeInlinedAtIdx[std::make_pair(Scope, IA)];
188 if (Idx) return Idx;
[all...] |
| /external/llvm/lib/Target/AArch64/ |
| AArch64MachineFunctionInfo.h | 128 void setVariadicGPRIdx(int Idx) { VariadicGPRIdx = Idx; }
134 void setVariadicFPRIdx(int Idx) { VariadicFPRIdx = Idx; }
140 void setVariadicStackIdx(int Idx) { VariadicStackIdx = Idx; }
143 void setFramePointerOffset(int Idx) { FramePointerOffset = Idx; }
|
| /external/clang/lib/Serialization/ |
| ASTReaderStmt.cpp | 33 unsigned &Idx;
73 const ASTReader::RecordData &Record, unsigned &Idx)
74 : Reader(Reader), F(F), DeclsCursor(Cursor), Record(Record), Idx(Idx) { }
101 SourceLocation TemplateKWLoc = ReadSourceLocation(Record, Idx);
103 ArgInfo.setLAngleLoc(ReadSourceLocation(Record, Idx));
104 ArgInfo.setRAngleLoc(ReadSourceLocation(Record, Idx));
107 Reader.ReadTemplateArgumentLoc(F, Record, Idx));
112 assert(Idx == NumStmtFields && "Incorrect statement field count");
117 S->setSemiLoc(ReadSourceLocation(Record, Idx));
[all...] |
| ASTReaderDecl.cpp | 44 unsigned &Idx;
193 const RecordData &Record, unsigned &Idx)
195 RawLocation(RawLocation), Record(Record), Idx(Idx),
307 GetTypeSourceInfo(Record, Idx);
310 DD->DeclInfo = GetTypeSourceInfo(Record, Idx);
326 if (Record[Idx++]) {
339 GlobalDeclID SemaDCIDForTemplateParmDecl = ReadDeclID(Record, Idx);
340 GlobalDeclID LexicalDCIDForTemplateParmDecl = ReadDeclID(Record, Idx);
346 DeclContext *SemaDC = ReadDeclAs<DeclContext>(Record, Idx);
[all...] |
| ASTReader.cpp | 756 unsigned Idx = 0;
761 for (int I = 0, N = Record[Idx++]; I != N; ++I) {
763 unsigned FilenameLen = Record[Idx++];
764 std::string Filename(&Record[Idx], &Record[Idx] + FilenameLen);
765 Idx += FilenameLen;
772 while (Idx < Record.size()) {
773 int FID = Record[Idx++];
779 unsigned NumEntries = Record[Idx++];
784 unsigned FileOffset = Record[Idx++]
[all...] |
| /external/llvm/include/llvm/ADT/ |
| PackedVector.h | 30 static T getValue(const BitVectorTy &Bits, unsigned Idx) {
33 val = T(val | ((Bits[(Idx << (BitNum-1)) + i] ? 1UL : 0UL) << i));
37 static void setValue(BitVectorTy &Bits, unsigned Idx, T val) {
40 Bits[(Idx << (BitNum-1)) + i] = val & (T(1) << i);
47 static T getValue(const BitVectorTy &Bits, unsigned Idx) {
50 val = T(val | ((Bits[(Idx << (BitNum-1)) + i] ? 1UL : 0UL) << i));
51 if (Bits[(Idx << (BitNum-1)) + BitNum-1])
56 static void setValue(BitVectorTy &Bits, unsigned Idx, T val) {
59 Bits.set((Idx << (BitNum-1)) + BitNum-1);
63 Bits[(Idx << (BitNum-1)) + i] = val & (T(1) << i)
[all...] |
| SparseMultiSet.h | 160 unsigned Idx = FreelistIdx;
161 unsigned NextFree = Dense[Idx].Next;
162 assert(Dense[Idx].isTombstone() && "Non-tombstone free?");
164 Dense[Idx] = SMSNode(V, Prev, Next);
167 return Idx;
171 void makeTombstone(unsigned Idx) {
172 Dense[Idx].Prev = SMSNode::INVALID;
173 Dense[Idx].Next = FreelistIdx;
174 FreelistIdx = Idx;
217 unsigned Idx;
[all...] |
| SparseBitVector.h | 66 explicit SparseBitVectorElement(unsigned Idx) {
67 ElementIndex = Idx;
85 // Return the bits that make up word Idx in our element.
86 BitWord word(unsigned Idx) const {
87 assert (Idx < BITWORDS_PER_ELEMENT);
88 return Bits[Idx];
102 void set(unsigned Idx) {
103 Bits[Idx / BITWORD_SIZE] |= 1L << (Idx % BITWORD_SIZE);
106 bool test_and_set (unsigned Idx) {
[all...] |
| /external/llvm/include/llvm/Support/ |
| ArrayRecycler.h | 41 // Remove an entry from the free list in Bucket[Idx] and return it.
43 T *pop(unsigned Idx) {
44 if (Idx >= Bucket.size())
46 FreeList *Entry = Bucket[Idx];
49 Bucket[Idx] = Entry->Next;
53 // Add an entry to the free list at Bucket[Idx].
54 void push(unsigned Idx, T *Ptr) {
59 if (Idx >= Bucket.size())
60 Bucket.resize(size_t(Idx) + 1);
61 Entry->Next = Bucket[Idx];
[all...] |
| /ndk/sources/host-tools/sed-4.2.1/lib/ |
| regex_internal.h | 132 typedef __re_idx_t Idx;
135 #define REG_MISSING ((Idx) -1)
138 #define REG_ERROR ((Idx) -2)
142 # define REG_VALID_INDEX(n) ((Idx) (n) < REG_ERROR)
149 # define REG_VALID_NONZERO_INDEX(n) ((Idx) ((n) - 1) < (Idx) (REG_ERROR - 1))
227 Idx alloc;
228 Idx nelem;
229 Idx *elems;
315 Idx nmbchars
340 Idx idx; \/* for BACK_REF *\/ member in union:__anon22179::__anon22180
646 Idx idx; member in struct:re_fail_stack_ent_t
[all...] |
| regexec.c | 24 Idx n) internal_function;
27 static reg_errcode_t match_ctx_add_entry (re_match_context_t *cache, Idx node,
28 Idx str_idx, Idx from, Idx to)
30 static Idx search_cur_bkref_entry (const re_match_context_t *mctx, Idx str_idx)
32 static reg_errcode_t match_ctx_add_subtop (re_match_context_t *mctx, Idx node,
33 Idx str_idx) internal_function;
35 Idx node, Idx str_idx
1442 Idx idx, cur_node; local
1918 Idx idx = re_node_set_contains (dest_nodes, cur_node) - 1; local
3168 Idx idx, outside_node; local
3896 int32_t idx; local
4031 int32_t idx; local
[all...] |
| /external/llvm/lib/Target/ARM/MCTargetDesc/ |
| ARMMCTargetDesc.cpp | 46 unsigned Idx = 0;
51 Idx = 4;
55 Idx = 6;
60 if (Idx) {
61 unsigned SubVer = TT[Idx];
63 if (Len >= Idx+2 && TT[Idx+1] == 'm') {
70 } else if (Len >= Idx+3 && TT[Idx+1] == 'e'&& TT[Idx+2] == 'm')
[all...] |
| /external/llvm/utils/TableGen/ |
| CodeGenSchedule.h | 61 CodeGenSchedRW(unsigned Idx, Record *Def)
62 : Index(Idx), TheDef(Def), IsAlias(false), IsVariadic(false) {
75 CodeGenSchedRW(unsigned Idx, bool Read, const IdxVec &Seq,
77 : Index(Idx), Name(Name), TheDef(0), IsRead(Read), IsAlias(false),
173 // ItinDefList orders this processor's InstrItinData records by SchedClass idx.
199 CodeGenProcModel(unsigned Idx, const std::string &Name, Record *MDef,
201 Index(Idx), ModelName(Name), ModelDef(MDef), ItinsDef(IDef) {}
284 const CodeGenSchedRW &getSchedWrite(unsigned Idx) const {
285 assert(Idx < SchedWrites.size() && "bad SchedWrite index");
286 assert(SchedWrites[Idx].isValid() && "invalid SchedWrite")
[all...] |
| /external/clang/lib/StaticAnalyzer/Checkers/ |
| ArrayBoundChecker.cpp | 47 DefinedOrUnknownSVal Idx = ER->getIndex().castAs<DefinedOrUnknownSVal>();
51 if (Idx.isZeroConstant())
61 ProgramStateRef StInBound = state->assumeInBound(Idx, NumElements, true);
62 ProgramStateRef StOutBound = state->assumeInBound(Idx, NumElements, false);
|
| ReturnPointerRangeChecker.cpp | 49 DefinedOrUnknownSVal Idx = ER->getIndex().castAs<DefinedOrUnknownSVal>();
52 if (Idx.isZeroConstant())
61 ProgramStateRef StInBound = state->assumeInBound(Idx, NumElements, true);
62 ProgramStateRef StOutBound = state->assumeInBound(Idx, NumElements, false);
|
| /external/llvm/lib/Target/X86/ |
| X86MachineFunctionInfo.h | 124 void setVarArgsFrameIndex(int Idx) { VarArgsFrameIndex = Idx; }
127 void setRegSaveFrameIndex(int Idx) { RegSaveFrameIndex = Idx; }
|
| /external/llvm/unittests/ADT/ |
| SCCIteratorTest.cpp | 27 static void ValidateIndex(unsigned Idx) {
28 assert(Idx < N && "Invalid node index!");
54 void AddNode(unsigned Idx) {
55 ValidateIndex(Idx);
56 Elements |= 1U << Idx;
60 void DeleteNode(unsigned Idx) {
61 ValidateIndex(Idx);
62 Elements &= ~(1U << Idx);
66 bool count(unsigned Idx) {
67 ValidateIndex(Idx);
[all...] |
| /external/llvm/lib/ExecutionEngine/OProfileJIT/ |
| OProfileWrapper.cpp | 144 ssize_t Idx = 0;
147 while (Idx < NumRead-1 && ExeName[Idx] != 0) {
148 Idx++;
152 Idx--;
155 while (Idx > 0) {
156 if (ExeName[Idx] == '/') {
157 BaseName = ExeName + Idx + 1;
160 Idx--;
|
| /external/llvm/lib/CodeGen/ |
| SplitKit.cpp | 299 bool SplitAnalysis::isOriginalEndpoint(SlotIndex Idx) const {
303 LiveInterval::const_iterator I = Orig.find(Idx);
305 // Range containing Idx should begin at Idx.
306 if (I != Orig.end() && I->start <= Idx)
307 return I->start == Idx;
309 // Range does not contain Idx, previous must end at Idx.
310 return I != Orig.begin() && (--I)->end == Idx;
374 SlotIndex Idx) {
[all...] |
| /external/llvm/include/llvm/IR/ |
| User.h | 76 template <int Idx, typename U> static Use &OpFrom(const U *that) {
77 return Idx < 0
78 ? OperandTraits<U>::op_end(const_cast<U*>(that))[Idx]
79 : OperandTraits<U>::op_begin(const_cast<U*>(that))[Idx];
81 template <int Idx> Use &Op() {
82 return OpFrom<Idx>(this);
84 template <int Idx> const Use &Op() const {
85 return OpFrom<Idx>(this);
|
| /external/llvm/lib/Target/ARM/ |
| Thumb2RegisterInfo.cpp | 46 unsigned Idx = ConstantPool->getConstantPoolIndex(C, 4);
50 .addConstantPoolIndex(Idx).addImm((int64_t)ARMCC::AL).addReg(0)
|
| /external/llvm/lib/MC/ |
| MCRegisterInfo.cpp | 26 unsigned MCRegisterInfo::getSubReg(unsigned Reg, unsigned Idx) const {
27 assert(Idx && Idx < getNumSubRegIndices() &&
33 if (*SRI == Idx)
|
| /external/clang/test/PCH/ |
| exprs.c | 82 double get_from_double_array(unsigned Idx) { return double_array[Idx]; }
85 float get_from_designated(unsigned Idx) {
|
| /external/llvm/include/llvm/CodeGen/ |
| MachineJumpTableInfo.h | 105 void RemoveJumpTable(unsigned Idx) {
106 JumpTables[Idx].MBBs.clear();
115 bool ReplaceMBBInJumpTable(unsigned Idx, MachineBasicBlock *Old,
|
| /external/llvm/lib/Target/Hexagon/ |
| HexagonRemoveSZExtArgs.cpp | 51 unsigned Idx = 1;
53 ++AI, ++Idx) {
54 if (F.getAttributes().hasAttribute(Idx, Attribute::SExt)) {
|
