| /external/llvm/lib/Support/ |
| D | StringMap.cpp | 182 unsigned NewSize; in RehashTable() local
188 NewSize = NumBuckets*2; in RehashTable()
190 NewSize = NumBuckets; in RehashTable()
197 ItemBucket *NewTableArray =(ItemBucket*)calloc(NewSize+1, sizeof(ItemBucket)); in RehashTable()
198 NewTableArray[NewSize].Item = (StringMapEntryBase*)2; in RehashTable()
206 unsigned NewBucket = FullHash & (NewSize-1); in RehashTable()
208 NewTableArray[FullHash & (NewSize-1)].Item = IB->Item; in RehashTable()
209 NewTableArray[FullHash & (NewSize-1)].FullHashValue = FullHash; in RehashTable()
216 NewBucket = (NewBucket + ProbeSize++) & (NewSize-1); in RehashTable()
228 NumBuckets = NewSize; in RehashTable()
|
| D | IntervalMap.cpp | 121 const unsigned *CurSize, unsigned NewSize[], in distribute() argument
134 Sum += NewSize[n] = PerNode + (n < Extra); in distribute()
136 PosPair = IdxPair(n, Position - (Sum - NewSize[n])); in distribute()
143 assert(NewSize[PosPair.first] && "Too few elements to need Grow"); in distribute()
144 --NewSize[PosPair.first]; in distribute()
150 assert(NewSize[n] <= Capacity && "Overallocated node"); in distribute()
151 Sum += NewSize[n]; in distribute()
|
| D | SmallPtrSet.cpp | 132 void SmallPtrSetImpl::Grow(unsigned NewSize) { in Grow() argument
140 CurArray = (const void**)malloc(sizeof(void*) * (NewSize+1)); in Grow()
142 CurArraySize = NewSize; in Grow()
143 memset(CurArray, -1, NewSize*sizeof(void*)); in Grow()
147 CurArray[NewSize] = 0; in Grow()
|
| /external/llvm/lib/Target/MSP430/ |
| D | MSP430BranchSelector.cpp | 140 unsigned NewSize; in runOnMachineFunction() local
145 NewSize = 4; in runOnMachineFunction()
158 NewSize = 6; in runOnMachineFunction()
168 BlockSizes[MBB.getNumber()] += NewSize-2; in runOnMachineFunction()
169 MBBStartOffset += NewSize; in runOnMachineFunction()
|
| /external/llvm/lib/ExecutionEngine/JIT/ |
| D | JITMemoryManager.cpp | 83 uint64_t NewSize);
121 void GrowBlock(uintptr_t NewSize);
198 void FreeRangeHeader::GrowBlock(uintptr_t NewSize) { in GrowBlock() argument
199 assert(NewSize > BlockSize && "Not growing block?"); in GrowBlock()
200 BlockSize = NewSize; in GrowBlock()
209 TrimAllocationToSize(FreeRangeHeader *FreeList, uint64_t NewSize) { in TrimAllocationToSize() argument
214 NewSize = std::max<uint64_t>(FreeRangeHeader::getMinBlockSize(), NewSize); in TrimAllocationToSize()
218 NewSize = (NewSize+ (HeaderAlign-1)) & ~(HeaderAlign-1); in TrimAllocationToSize()
222 assert(NewSize <= BlockSize && in TrimAllocationToSize()
227 if (BlockSize <= NewSize+FreeRangeHeader::getMinBlockSize()) in TrimAllocationToSize()
[all …]
|
| /external/llvm/include/llvm/ADT/ |
| D | IndexedMap.h | 71 unsigned NewSize = toIndex_(n) + 1; in grow() local
72 if (NewSize > storage_.size()) in grow()
73 resize(NewSize); in grow()
|
| D | IntervalMap.h | 311 unsigned CurSize[], const unsigned NewSize[]) { in adjustSiblingSizes() argument
314 if (CurSize[n] == NewSize[n]) in adjustSiblingSizes()
318 NewSize[n] - CurSize[n]); in adjustSiblingSizes()
322 if (CurSize[n] >= NewSize[n]) in adjustSiblingSizes()
332 if (CurSize[n] == NewSize[n]) in adjustSiblingSizes()
336 CurSize[n] - NewSize[n]); in adjustSiblingSizes()
340 if (CurSize[n] >= NewSize[n]) in adjustSiblingSizes()
347 assert(CurSize[n] == NewSize[n] && "Insufficient element shuffle"); in adjustSiblingSizes()
385 const unsigned *CurSize, unsigned NewSize[],
1877 unsigned NewSize = P.leafSize() - 1; in treeErase() local
[all …]
|
| D | BitVector.h | 393 void grow(unsigned NewSize) { in grow() argument
394 Capacity = std::max(NumBitWords(NewSize), Capacity * 2); in grow()
|
| D | SmallBitVector.h | 92 void switchToSmall(uintptr_t NewSmallBits, size_t NewSize) { in switchToSmall() argument
94 setSmallSize(NewSize); in switchToSmall()
|
| D | SmallPtrSet.h | 136 void Grow(unsigned NewSize);
|
| /external/llvm/tools/llvm-diff/ |
| D | DifferenceEngine.cpp | 71 unsigned NewSize = Storage.size() - 1; in remove_min() local
72 if (NewSize) { in remove_min()
75 Storage[0] = Storage[NewSize]; in remove_min()
77 std::swap(Storage[0], Storage[NewSize]); in remove_min()
87 if (R >= NewSize) { in remove_min()
89 if (L >= NewSize) break; in remove_min()
|
| /external/llvm/include/llvm/Analysis/ |
| D | AliasSetTracker.h | 60 void updateSizeAndTBAAInfo(uint64_t NewSize, const MDNode *NewTBAAInfo) { in updateSizeAndTBAAInfo() argument
61 if (NewSize > Size) Size = NewSize; in updateSizeAndTBAAInfo()
|
| D | AliasAnalysis.h | 121 Location getWithNewSize(uint64_t NewSize) const { in getWithNewSize()
123 Copy.Size = NewSize; in getWithNewSize()
|
| /external/clang/lib/AST/ |
| D | RecordLayoutBuilder.cpp | 713 void setSize(CharUnits NewSize) { Size = Context.toBits(NewSize); } in setSize() argument
714 void setSize(uint64_t NewSize) { Size = NewSize; } in setSize() argument
722 void setDataSize(CharUnits NewSize) { DataSize = Context.toBits(NewSize); } in setDataSize() argument
723 void setDataSize(uint64_t NewSize) { DataSize = NewSize; } in setDataSize() argument
|
| /external/llvm/lib/Linker/ |
| D | LinkModules.cpp | 573 uint64_t NewSize = DstTy->getNumElements() + SrcTy->getNumElements(); in linkAppendingVarProto() local
574 ArrayType *NewType = ArrayType::get(EltTy, NewSize); in linkAppendingVarProto()
|
| /external/llvm/lib/CodeGen/ |
| D | RegisterCoalescer.cpp | 980 unsigned NewSize = SrcSize + DstSize; in isWinToJoinCrossClass() local
983 if (NewUses*SrcSize*SrcRCCount > 2*SrcUses*NewSize*NewRCCount) in isWinToJoinCrossClass()
988 if (NewUses*DstSize*DstRCCount > 2*DstUses*NewSize*NewRCCount) in isWinToJoinCrossClass()
|
| /external/clang/lib/Frontend/ |
| D | ASTUnit.cpp | 1132 unsigned NewSize, in CreatePaddedMainFileBuffer() argument
1135 = llvm::MemoryBuffer::getNewUninitMemBuffer(NewSize, NewName); in CreatePaddedMainFileBuffer()
1139 ' ', NewSize - Old->getBufferSize() - 1); in CreatePaddedMainFileBuffer()
|
| /external/llvm/lib/Target/ARM/ |
| D | ARMConstantIslandPass.cpp | 1791 unsigned NewSize = TII->GetInstSizeInBytes(NewJTMI); in OptimizeThumb2JumpTables() local
1800 int delta = OrigSize - NewSize; in OptimizeThumb2JumpTables()
|