/external/llvm/lib/Support/ |
StringMap.cpp | 185 unsigned NewSize; 192 NewSize = NumBuckets*2; 194 NewSize = NumBuckets; 202 (StringMapEntryBase **)calloc(NewSize+1, sizeof(StringMapEntryBase *) + 204 unsigned *NewHashArray = (unsigned *)(NewTableArray + NewSize + 1); 205 NewTableArray[NewSize] = (StringMapEntryBase*)2; 214 unsigned NewBucket = FullHash & (NewSize-1); 216 NewTableArray[FullHash & (NewSize-1)] = Bucket; 217 NewHashArray[FullHash & (NewSize-1)] = FullHash; 224 NewBucket = (NewBucket + ProbeSize++) & (NewSize-1) [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 | 130 void SmallPtrSetImpl::Grow(unsigned NewSize) { 138 CurArray = (const void**)malloc(sizeof(void*) * NewSize); 140 CurArraySize = NewSize; 141 memset(CurArray, -1, NewSize*sizeof(void*));
|
/external/llvm/include/llvm/ADT/ |
IndexedMap.h | 66 unsigned NewSize = toIndex_(n) + 1; 67 if (NewSize > storage_.size()) 68 resize(NewSize);
|
IntervalMap.h | 328 /// @param NewSize Array of desired node sizes. 331 unsigned CurSize[], const unsigned NewSize[]) { 334 if (CurSize[n] == NewSize[n]) 338 NewSize[n] - CurSize[n]); 342 if (CurSize[n] >= NewSize[n]) 352 if (CurSize[n] == NewSize[n]) 356 CurSize[n] - NewSize[n]); 360 if (CurSize[n] >= NewSize[n]) 367 assert(CurSize[n] == NewSize[n] && "Insufficient element shuffle"); 381 /// NewSize[] will be filled in such that [all...] |
SmallPtrSet.h | 129 void Grow(unsigned NewSize);
|
SmallBitVector.h | 93 void switchToSmall(uintptr_t NewSmallBits, size_t NewSize) { 95 setSmallSize(NewSize);
|
BitVector.h | 547 void grow(unsigned NewSize) { 548 Capacity = std::max(NumBitWords(NewSize), Capacity * 2);
|
/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 | 96 /// than NewSize, split it into two pieces (where the former is NewSize 99 uint64_t NewSize); 137 void GrowBlock(uintptr_t NewSize); 214 void FreeRangeHeader::GrowBlock(uintptr_t NewSize) { 215 assert(NewSize > BlockSize && "Not growing block?"); 216 BlockSize = NewSize; 222 /// than NewSize, split it into two pieces (where the former is NewSize 225 TrimAllocationToSize(FreeRangeHeader *FreeList, uint64_t NewSize) { [all...] |
/external/llvm/tools/llvm-diff/ |
DifferenceEngine.cpp | 69 unsigned NewSize = Storage.size() - 1; 70 if (NewSize) { 73 Storage[0] = Storage[NewSize]; 75 std::swap(Storage[0], Storage[NewSize]); 85 if (R >= NewSize) { 87 if (L >= NewSize) break;
|
/external/llvm/include/llvm/Analysis/ |
AliasSetTracker.h | 59 void updateSizeAndTBAAInfo(uint64_t NewSize, const MDNode *NewTBAAInfo) { 60 if (NewSize > Size) Size = NewSize;
|
AliasAnalysis.h | 129 Location getWithNewSize(uint64_t NewSize) const { 131 Copy.Size = NewSize;
|
/external/clang/lib/AST/ |
RecordLayoutBuilder.cpp | 784 void setSize(CharUnits NewSize) { Size = Context.toBits(NewSize); } 785 void setSize(uint64_t NewSize) { Size = NewSize; } 795 void setDataSize(CharUnits NewSize) { DataSize = Context.toBits(NewSize); } 796 void setDataSize(uint64_t NewSize) { DataSize = NewSize; } [all...] |
/external/llvm/lib/Linker/ |
LinkModules.cpp | 714 uint64_t NewSize = DstTy->getNumElements() + SrcTy->getNumElements(); 715 ArrayType *NewType = ArrayType::get(EltTy, NewSize); [all...] |
/external/clang/lib/Frontend/ |
ASTUnit.cpp | [all...] |
/external/llvm/lib/Target/ARM/ |
ARMConstantIslandPass.cpp | [all...] |
/external/antlr/antlr-3.4/runtime/Delphi/Sources/Antlr3.Runtime/ |
Antlr.Runtime.pas | [all...] |