/external/llvm/lib/Support/ |
StringMap.cpp | 182 unsigned NewSize; 188 NewSize = NumBuckets*2; 190 NewSize = NumBuckets; 197 ItemBucket *NewTableArray =(ItemBucket*)calloc(NewSize+1, sizeof(ItemBucket)); 198 NewTableArray[NewSize].Item = (StringMapEntryBase*)2; 206 unsigned NewBucket = FullHash & (NewSize-1); 208 NewTableArray[FullHash & (NewSize-1)].Item = IB->Item; 209 NewTableArray[FullHash & (NewSize-1)].FullHashValue = FullHash; 216 NewBucket = (NewBucket + ProbeSize++) & (NewSize-1); 228 NumBuckets = NewSize; [all...] |
IntervalMap.cpp | 121 const unsigned *CurSize, unsigned NewSize[], 134 Sum += NewSize[n] = PerNode + (n < Extra); 136 PosPair = IdxPair(n, Position - (Sum - NewSize[n])); 143 assert(NewSize[PosPair.first] && "Too few elements to need Grow"); 144 --NewSize[PosPair.first]; 150 assert(NewSize[n] <= Capacity && "Overallocated node"); 151 Sum += NewSize[n];
|
SmallPtrSet.cpp | 132 void SmallPtrSetImpl::Grow(unsigned NewSize) { 140 CurArray = (const void**)malloc(sizeof(void*) * (NewSize+1)); 142 CurArraySize = NewSize; 143 memset(CurArray, -1, NewSize*sizeof(void*)); 147 CurArray[NewSize] = 0;
|
/external/llvm/include/llvm/ADT/ |
IndexedMap.h | 71 unsigned NewSize = toIndex_(n) + 1; 72 if (NewSize > storage_.size()) 73 resize(NewSize);
|
IntervalMap.h | 308 /// @param NewSize Array of desired node sizes. 311 unsigned CurSize[], const unsigned NewSize[]) { 314 if (CurSize[n] == NewSize[n]) 318 NewSize[n] - CurSize[n]); 322 if (CurSize[n] >= NewSize[n]) 332 if (CurSize[n] == NewSize[n]) 336 CurSize[n] - NewSize[n]); 340 if (CurSize[n] >= NewSize[n]) 347 assert(CurSize[n] == NewSize[n] && "Insufficient element shuffle"); 361 /// NewSize[] will be filled in such that [all...] |
SmallPtrSet.h | 136 void Grow(unsigned NewSize);
|
BitVector.h | 393 void grow(unsigned NewSize) { 394 Capacity = std::max(NumBitWords(NewSize), Capacity * 2);
|
SmallBitVector.h | 92 void switchToSmall(uintptr_t NewSmallBits, size_t NewSize) { 94 setSmallSize(NewSize);
|
/external/llvm/lib/Target/MSP430/ |
MSP430BranchSelector.cpp | 140 unsigned NewSize; 145 NewSize = 4; 158 NewSize = 6; 166 // Remember that this instruction is NewSize bytes, increase the size of the 167 // block by NewSize-2, remember to iterate. 168 BlockSizes[MBB.getNumber()] += NewSize-2; 169 MBBStartOffset += NewSize;
|
/external/llvm/lib/ExecutionEngine/JIT/ |
JITMemoryManager.cpp | 80 /// than NewSize, split it into two pieces (where the former is NewSize 83 uint64_t NewSize); 121 void GrowBlock(uintptr_t NewSize); 198 void FreeRangeHeader::GrowBlock(uintptr_t NewSize) { 199 assert(NewSize > BlockSize && "Not growing block?"); 200 BlockSize = NewSize; 206 /// than NewSize, split it into two pieces (where the former is NewSize 209 TrimAllocationToSize(FreeRangeHeader *FreeList, uint64_t NewSize) { [all...] |
/external/llvm/tools/llvm-diff/ |
DifferenceEngine.cpp | 71 unsigned NewSize = Storage.size() - 1; 72 if (NewSize) { 75 Storage[0] = Storage[NewSize]; 77 std::swap(Storage[0], Storage[NewSize]); 87 if (R >= NewSize) { 89 if (L >= NewSize) break;
|
/external/llvm/include/llvm/Analysis/ |
AliasSetTracker.h | 60 void updateSizeAndTBAAInfo(uint64_t NewSize, const MDNode *NewTBAAInfo) { 61 if (NewSize > Size) Size = NewSize;
|
AliasAnalysis.h | 121 Location getWithNewSize(uint64_t NewSize) const { 123 Copy.Size = NewSize;
|
/external/clang/lib/AST/ |
RecordLayoutBuilder.cpp | 722 void setSize(CharUnits NewSize) { Size = Context.toBits(NewSize); } 723 void setSize(uint64_t NewSize) { Size = NewSize; } 733 void setDataSize(CharUnits NewSize) { DataSize = Context.toBits(NewSize); } 734 void setDataSize(uint64_t NewSize) { DataSize = NewSize; } [all...] |
/external/llvm/lib/Linker/ |
LinkModules.cpp | 582 uint64_t NewSize = DstTy->getNumElements() + SrcTy->getNumElements(); 583 ArrayType *NewType = ArrayType::get(EltTy, NewSize); [all...] |
/external/llvm/lib/CodeGen/ |
RegisterCoalescer.cpp | [all...] |
/external/clang/lib/Frontend/ |
ASTUnit.cpp | [all...] |
/external/llvm/lib/Target/ARM/ |
ARMConstantIslandPass.cpp | [all...] |