/macosx-10.10.1/llvmCore-3425.0.34/lib/VMCore/ |
H A D | DebugLoc.cpp | 164 int &Idx = ScopeRecordIdx[Scope]; local 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)]; local 188 if (Idx) return Idx; [all...] |
H A D | Attributes.cpp | 280 /// returned. Attributes for the result are denoted with Idx = 0. 282 Attributes AttrListPtr::getAttributes(unsigned Idx) const { 286 for (unsigned i = 0, e = Attrs.size(); i != e && Attrs[i].Index <= Idx; ++i) 287 if (Attrs[i].Index == Idx) 306 AttrListPtr AttrListPtr::addAttr(unsigned Idx, Attributes Attrs) const { argument 307 Attributes OldAttrs = getAttributes(Idx); 323 NewAttrList.push_back(AttributeWithIndex::get(Idx, Attrs)); 328 for (; i != e && OldAttrList[i].Index < Idx; ++i) 332 if (i != e && OldAttrList[i].Index == Idx) { 337 NewAttrList.push_back(AttributeWithIndex::get(Idx, Attr 347 removeAttr(unsigned Idx, Attributes Attrs) const argument [all...] |
/macosx-10.10.1/llvmCore-3425.0.34/include/llvm/ADT/ |
H A D | PackedVector.h | 30 static T getValue(const BitVectorTy &Bits, unsigned Idx) { argument 33 val = T(val | ((Bits[(Idx << (BitNum-1)) + i] ? 1UL : 0UL) << i)); 37 static void setValue(BitVectorTy &Bits, unsigned Idx, T val) { argument 40 Bits[(Idx << (BitNum-1)) + i] = val & (T(1) << i); 47 static T getValue(const BitVectorTy &Bits, unsigned Idx) { argument 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) { argument 59 Bits.set((Idx << (BitNum-1)) + BitNum-1); 63 Bits[(Idx << (BitNu 84 const unsigned Idx; member in class:llvm::PackedVector::reference 122 operator [](unsigned Idx) argument [all...] |
H A D | BitVector.h | 47 reference(BitVector &b, unsigned Idx) { argument 48 WordRef = &b.Bits[Idx / BITWORD_SIZE]; 49 BitPos = Idx % BITWORD_SIZE; 235 BitVector &set(unsigned Idx) { argument 236 Bits[Idx / BITWORD_SIZE] |= 1L << (Idx % BITWORD_SIZE); 245 BitVector &reset(unsigned Idx) { argument 246 Bits[Idx / BITWORD_SIZE] &= ~(1L << (Idx % BITWORD_SIZE)); 257 BitVector &flip(unsigned Idx) { argument 263 operator [](unsigned Idx) argument [all...] |
H A D | SmallBitVector.h | 63 reference(SmallBitVector &b, unsigned Idx) : TheVector(b), BitPos(Idx) {} argument 295 SmallBitVector &set(unsigned Idx) { argument 297 setSmallBits(getSmallBits() | (uintptr_t(1) << Idx)); 299 getPointer()->set(Idx); 311 SmallBitVector &reset(unsigned Idx) { argument 313 setSmallBits(getSmallBits() & ~(uintptr_t(1) << Idx)); 315 getPointer()->reset(Idx); 327 SmallBitVector &flip(unsigned Idx) { argument 329 setSmallBits(getSmallBits() ^ (uintptr_t(1) << Idx)); 341 operator [](unsigned Idx) argument [all...] |
H A D | SparseSet.h | 196 /// @param Idx A valid index to find. 199 iterator findIndex(unsigned Idx) { argument 200 assert(Idx < Universe && "Key out of range"); 205 for (unsigned i = Sparse[Idx], e = size(); i < e; i += Stride) { 208 if (Idx == FoundIdx) 247 unsigned Idx = ValIndexOf(Val); 248 iterator I = findIndex(Idx); 251 Sparse[Idx] = size();
|
H A D | StringRef.h | 433 size_t Idx = find(Separator); 434 if (Idx == npos) 436 return std::make_pair(slice(0, Idx), slice(Idx+1, npos)); 450 size_t Idx = find(Separator); 451 if (Idx == npos) 453 return std::make_pair(slice(0, Idx), slice(Idx + Separator.size(), npos)); 485 size_t Idx = rfind(Separator); 486 if (Idx [all...] |
/macosx-10.10.1/gnutar-453/gnutar/lib/ |
H A D | regex_internal.h | 128 typedef __re_idx_t Idx; typedef 131 #define REG_MISSING ((Idx) -1) 134 #define REG_ERROR ((Idx) -2) 138 # define REG_VALID_INDEX(n) ((Idx) (n) < REG_ERROR) 145 # define REG_VALID_NONZERO_INDEX(n) ((Idx) ((n) - 1) < (Idx) (REG_ERROR - 1)) 227 Idx alloc; 228 Idx nelem; 229 Idx *elems; 315 Idx nmbchar [all...] |
H A D | regexec.c | 22 Idx n) internal_function; 25 static reg_errcode_t match_ctx_add_entry (re_match_context_t *cache, Idx node, 26 Idx str_idx, Idx from, Idx to) 28 static Idx search_cur_bkref_entry (const re_match_context_t *mctx, Idx str_idx) 30 static reg_errcode_t match_ctx_add_subtop (re_match_context_t *mctx, Idx node, 31 Idx str_idx) internal_function; 33 Idx nod [all...] |
H A D | regex_internal.c | 21 static void re_string_construct_common (const char *str, Idx len, 41 re_string_allocate (re_string_t *pstr, const char *str, Idx len, Idx init_len, 45 Idx init_buf_len; 69 re_string_construct (re_string_t *pstr, const char *str, Idx len, 132 re_string_realloc_buffers (re_string_t *pstr, Idx new_buf_len) 140 size_t max_object_size = MAX (sizeof (wint_t), sizeof (Idx)); 150 Idx *new_offsets = re_realloc (pstr->offsets, Idx, new_buf_len); 172 re_string_construct_common (const char *str, Idx le [all...] |
/macosx-10.10.1/llvmCore-3425.0.34/lib/Target/ARM/MCTargetDesc/ |
H A D | ARMMCTargetDesc.cpp | 42 unsigned Idx = 0; local 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 [all...] |
/macosx-10.10.1/llvmCore-3425.0.34/utils/TableGen/ |
H A D | CodeGenSchedule.h | 60 CodeGenSchedRW(unsigned Idx, Record *Def): Index(Idx), TheDef(Def), argument 74 CodeGenSchedRW(unsigned Idx, bool Read, const IdxVec &Seq, argument 76 Index(Idx), Name(Name), TheDef(0), IsRead(Read), IsAlias(false), 192 CodeGenProcModel(unsigned Idx, const std::string &Name, Record *MDef, argument 194 Index(Idx), ModelName(Name), ModelDef(MDef), ItinsDef(IDef) {} 283 const CodeGenSchedRW &getSchedWrite(unsigned Idx) const { 284 assert(Idx < SchedWrites.size() && "bad SchedWrite index"); 285 assert(SchedWrites[Idx].isValid() && "invalid SchedWrite"); 286 return SchedWrites[Idx]; [all...] |
/macosx-10.10.1/llvmCore-3425.0.34/unittests/ADT/ |
H A D | SCCIteratorTest.cpp | 27 static void ValidateIndex(unsigned Idx) { argument 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...] |
H A D | HashingTest.cpp | 178 for (unsigned Idx = 1, Size = all_one_c.size(); Idx < Size; ++Idx) { 179 hash_code code = hash_combine_range(&all_one_c[0], &all_one_c[0] + Idx); 181 I = code_to_size.insert(std::make_pair(code, Idx)).first; 182 EXPECT_EQ(Idx, I->second); 186 for (unsigned Idx = 1, Size = all_zero_c.size(); Idx < Size; ++Idx) { 187 hash_code code = hash_combine_range(&all_zero_c[0], &all_zero_c[0] + Idx); [all...] |
/macosx-10.10.1/llvmCore-3425.0.34/lib/ExecutionEngine/OProfileJIT/ |
H A D | OProfileWrapper.cpp | 143 ssize_t Idx = 0; local 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--;
|
/macosx-10.10.1/llvmCore-3425.0.34/lib/CodeGen/ |
H A D | 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) { 372 defValue(unsigned RegIdx, const VNInfo *ParentVNI, SlotIndex Idx) argument 471 selectIntv(unsigned Idx) argument 474 DEBUG(dbgs() << " selectIntv " << OpenIdx << " -> " << Idx << '\\n'); local 478 enterIntvBefore(SlotIndex Idx) argument 495 enterIntvAfter(SlotIndex Idx) argument 543 leaveIntvAfter(SlotIndex Idx) argument 574 leaveIntvBefore(SlotIndex Idx) argument 985 SlotIndex Idx = LIS.getInstructionIndex(MI); local 1203 SlotIndex Idx = leaveIntvAtTop(*MBB); local 1217 SlotIndex Idx = enterIntvAtEnd(*MBB); local 1247 SlotIndex Idx; local 1270 SlotIndex Idx = enterIntvAfter(EnterAfter); local 1323 SlotIndex Idx = leaveIntvAfter(BI.LastInstr); local 1329 SlotIndex Idx = leaveIntvBefore(LSP); local 1409 SlotIndex Idx = enterIntvBefore(std::min(LSP, BI.FirstInstr)); local 1425 SlotIndex Idx = enterIntvAfter(EnterAfter); local [all...] |
H A D | LiveDebugVariables.cpp | 127 /// insertDebugValue - Insert a DBG_VALUE into MBB at Idx for LocNo. 128 void insertDebugValue(MachineBasicBlock *MBB, SlotIndex Idx, unsigned LocNo, 204 void addDef(SlotIndex Idx, const MachineOperand &LocMO) { argument 205 // Add a singular (Idx,Idx) -> Loc mapping. 206 LocMap::iterator I = locInts.find(Idx); 207 if (!I.valid() || I.start() != Idx) 208 I.insert(Idx, Idx.getNextSlot(), getLocationNo(LocMO)); 218 /// @param Idx Startin 441 handleDebugValue(MachineInstr *MI, SlotIndex Idx) argument 469 SlotIndex Idx = MBBI == MBB->begin() ? local 485 extendDef(SlotIndex Idx, unsigned LocNo, LiveInterval *LI, const VNInfo *VNI, SmallVectorImpl<SlotIndex> *Kills, LiveIntervals &LIS, MachineDominatorTree &MDT, UserValueScopes &UVS) argument 577 SlotIndex Idx = LIS.getInstructionIndex(MI); local 597 SlotIndex Idx = Kills[i]; local 634 SlotIndex Idx = Defs[i].first; local 924 findInsertLocation(MachineBasicBlock *MBB, SlotIndex Idx, LiveIntervals &LIS) argument 950 insertDebugValue(MachineBasicBlock *MBB, SlotIndex Idx, unsigned LocNo, LiveIntervals &LIS, const TargetInstrInfo &TII) argument [all...] |
/macosx-10.10.1/cxxfilt-11/cxxfilt/binutils/testsuite/binutils-all/ |
H A D | copy-1.d | 9 Idx.*
|
/macosx-10.10.1/llvmCore-3425.0.34/include/llvm/ |
H A D | 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);
|
/macosx-10.10.1/llvmCore-3425.0.34/lib/Target/ARM/ |
H A D | Thumb2RegisterInfo.cpp | 46 unsigned Idx = ConstantPool->getConstantPoolIndex(C, 4); local 50 .addConstantPoolIndex(Idx).addImm((int64_t)ARMCC::AL).addReg(0)
|
/macosx-10.10.1/llvmCore-3425.0.34/lib/MC/ |
H A D | MCRegisterInfo.cpp | 26 unsigned MCRegisterInfo::getSubReg(unsigned Reg, unsigned Idx) const { 27 assert(Idx && Idx < getNumSubRegIndices() && 33 if (*SRI == Idx)
|
/macosx-10.10.1/llvmCore-3425.0.34/lib/Target/X86/ |
H A D | X86MachineFunctionInfo.h | 124 void setVarArgsFrameIndex(int Idx) { VarArgsFrameIndex = Idx; } argument 127 void setRegSaveFrameIndex(int Idx) { RegSaveFrameIndex = Idx; } argument
|
/macosx-10.10.1/llvmCore-3425.0.34/include/llvm/CodeGen/ |
H A D | MachineJumpTableInfo.h | 105 void RemoveJumpTable(unsigned Idx) { argument 106 JumpTables[Idx].MBBs.clear(); 115 bool ReplaceMBBInJumpTable(unsigned Idx, MachineBasicBlock *Old,
|
H A D | LiveInterval.h | 310 const LiveRange *getLiveRangeContaining(SlotIndex Idx) const { 311 const_iterator I = FindLiveRangeContaining(Idx); 317 LiveRange *getLiveRangeContaining(SlotIndex Idx) { 318 iterator I = FindLiveRangeContaining(Idx); 322 /// getVNInfoAt - Return the VNInfo that is live at Idx, or NULL. 323 VNInfo *getVNInfoAt(SlotIndex Idx) const { 324 const_iterator I = FindLiveRangeContaining(Idx); 329 /// necessarilly including Idx, or NULL. Use this to find the reaching def 331 VNInfo *getVNInfoBefore(SlotIndex Idx) const { 332 const_iterator I = FindLiveRangeContaining(Idx [all...] |
/macosx-10.10.1/llvmCore-3425.0.34/lib/Target/Hexagon/ |
H A D | HexagonRemoveSZExtArgs.cpp | 50 unsigned Idx = 1; local 52 ++AI, ++Idx) { 53 if (F.paramHasAttr(Idx, Attribute::SExt)) {
|