/external/llvm/lib/VMCore/ |
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/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 | 45 unsigned &Idx; 199 const RecordData &Record, unsigned &Idx) 201 RawLocation(RawLocation), Record(Record), Idx(Idx), 309 GetTypeSourceInfo(Record, Idx); 312 DD->DeclInfo = GetTypeSourceInfo(Record, Idx); 324 if (Record[Idx++]) 343 DeclContextIDForTemplateParmDecl = ReadDeclID(Record, Idx); 344 LexicalDeclContextIDForTemplateParmDecl = ReadDeclID(Record, Idx); 347 DeclContext *SemaDC = ReadDeclAs<DeclContext>(Record, Idx); [all...] |
ASTReader.cpp | 801 unsigned Idx = 0; 806 for (int I = 0, N = Record[Idx++]; I != N; ++I) { 808 unsigned FilenameLen = Record[Idx++]; 809 std::string Filename(&Record[Idx], &Record[Idx] + FilenameLen); 810 Idx += FilenameLen; 817 while (Idx < Record.size()) { 818 int FID = Record[Idx++]; 824 unsigned NumEntries = Record[Idx++]; 829 unsigned FileOffset = Record[Idx++] [all...] |
/external/llvm/include/llvm/ADT/ |
PackedVector.h | 30 static T getValue(const llvm::BitVector &Bits, unsigned Idx) { 33 val = T(val | ((Bits[(Idx << (BitNum-1)) + i] ? 1UL : 0UL) << i)); 37 static void setValue(llvm::BitVector &Bits, unsigned Idx, T val) { 40 Bits[(Idx << (BitNum-1)) + i] = val & (T(1) << i); 47 static T getValue(const llvm::BitVector &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(llvm::BitVector &Bits, unsigned Idx, T val) { 59 Bits.set((Idx << (BitNum-1)) + BitNum-1); 63 Bits[(Idx << (BitNum-1)) + i] = val & (T(1) << i) [all...] |
BitVector.h | 47 reference(BitVector &b, unsigned Idx) { 48 WordRef = &b.Bits[Idx / BITWORD_SIZE]; 49 BitPos = Idx % BITWORD_SIZE; 235 BitVector &set(unsigned Idx) { 236 Bits[Idx / BITWORD_SIZE] |= 1L << (Idx % BITWORD_SIZE); 245 BitVector &reset(unsigned Idx) { 246 Bits[Idx / BITWORD_SIZE] &= ~(1L << (Idx % BITWORD_SIZE)); 257 BitVector &flip(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...] |
SmallBitVector.h | 63 reference(SmallBitVector &b, unsigned Idx) : TheVector(b), BitPos(Idx) {} 295 SmallBitVector &set(unsigned Idx) { 297 setSmallBits(getSmallBits() | (uintptr_t(1) << Idx)); 299 getPointer()->set(Idx); 311 SmallBitVector &reset(unsigned Idx) { 313 setSmallBits(getSmallBits() & ~(uintptr_t(1) << Idx)); 315 getPointer()->reset(Idx); 327 SmallBitVector &flip(unsigned Idx) { 329 setSmallBits(getSmallBits() ^ (uintptr_t(1) << 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:__anon21377::__anon21378 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...] |
regex_internal.c | 23 static void re_string_construct_common (const char *str, Idx len, 43 re_string_allocate (re_string_t *pstr, const char *str, Idx len, Idx init_len, 47 Idx init_buf_len; 71 re_string_construct (re_string_t *pstr, const char *str, Idx len, 134 re_string_realloc_buffers (re_string_t *pstr, Idx new_buf_len) 142 size_t max_object_size = MAX (sizeof (wint_t), sizeof (Idx)); 152 Idx *new_offsets = re_realloc (pstr->offsets, Idx, new_buf_len); 174 re_string_construct_common (const char *str, Idx len, re_string_t *pstr 1283 Idx idx; local 1373 __re_size_t idx, right, mid; local [all...] |
/external/llvm/lib/Target/ARM/MCTargetDesc/ |
ARMMCTargetDesc.cpp | 42 unsigned Idx = 0; 47 Idx = 4; 51 Idx = 6; 56 if (Idx) { 57 unsigned SubVer = TT[Idx]; 59 if (Len >= Idx+2 && TT[Idx+1] == 'm') { 66 } else if (Len >= Idx+3 && TT[Idx+1] == 'e'&& TT[Idx+2] == 'm') [all...] |
/external/llvm/include/llvm/ |
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);
|
Attributes.h | 282 static AttributeWithIndex get(unsigned Idx, Attributes Attrs) { 284 P.Index = Idx; 318 AttrListPtr addAttr(unsigned Idx, Attributes Attrs) const; 323 AttrListPtr removeAttr(unsigned Idx, Attributes Attrs) const; 330 Attributes getParamAttributes(unsigned Idx) const { 331 assert (Idx && Idx != ~0U && "Invalid parameter index!"); 332 return getAttributes(Idx); 348 bool paramHasAttr(unsigned Idx, Attributes Attr) const { 349 return getAttributes(Idx) & Attr [all...] |
/external/clang/lib/StaticAnalyzer/Checkers/ |
ArrayBoundChecker.cpp | 47 DefinedOrUnknownSVal Idx = cast<DefinedOrUnknownSVal>(ER->getIndex()); 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 = cast<DefinedOrUnknownSVal>(ER->getIndex()); 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 | 143 ssize_t Idx = 0; 146 while (Idx < NumRead-1 && ExeName[Idx] != 0) { 147 Idx++; 151 Idx--; 154 while (Idx > 0) { 155 if (ExeName[Idx] == '/') { 156 BaseName = ExeName + Idx + 1; 159 Idx--;
|
/external/llvm/utils/TableGen/ |
CodeGenSchedule.h | 56 // ItinDefList orders this processor's InstrItinData records by SchedClass idx. 114 const CodeGenSchedClass &getSchedClass(unsigned Idx) { 115 assert(Idx < SchedClasses.size() && "bad SchedClass index"); 116 return SchedClasses[Idx]; 123 unsigned Idx = SchedClassIdxMap.lookup(ItinDef->getName()); 124 assert(Idx <= NumItineraryClasses && "bad ItinClass index"); 125 return Idx; 134 unsigned idx = getProcModelIdx(ProcDef); local 135 assert(idx < ProcModels.size() && "missing machine model"); 136 return ProcModels[idx]; [all...] |
/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/lib/Target/ARM/ |
Thumb2RegisterInfo.cpp | 46 unsigned Idx = ConstantPool->getConstantPoolIndex(C, 4); 50 .addConstantPoolIndex(Idx).addImm((int64_t)ARMCC::AL).addReg(0)
|
/external/clang/test/PCH/ |
exprs.c | 78 double get_from_double_array(unsigned Idx) { return double_array[Idx]; } 81 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 | 50 unsigned Idx = 1; 52 ++AI, ++Idx) { 53 if (F.paramHasAttr(Idx, Attribute::SExt)) {
|