Home
last modified time | relevance | path

Searched refs:NewSize (Results 1 – 25 of 79) sorted by relevance

1234

/external/llvm/lib/Fuzzer/test/
DFuzzerUnittest.cpp68 size_t NewSize = MD.CrossOver(A.data(), A.size(), B.data(), B.size(), in TEST() local
70 C.resize(NewSize); in TEST()
107 size_t NewSize = (MD.*M)(T, sizeof(T), sizeof(T)); in TestEraseByte() local
108 if (NewSize == 7 && !memcmp(REM0, T, 7)) FoundMask |= 1 << 0; in TestEraseByte()
109 if (NewSize == 7 && !memcmp(REM1, T, 7)) FoundMask |= 1 << 1; in TestEraseByte()
110 if (NewSize == 7 && !memcmp(REM2, T, 7)) FoundMask |= 1 << 2; in TestEraseByte()
111 if (NewSize == 7 && !memcmp(REM3, T, 7)) FoundMask |= 1 << 3; in TestEraseByte()
112 if (NewSize == 7 && !memcmp(REM4, T, 7)) FoundMask |= 1 << 4; in TestEraseByte()
113 if (NewSize == 7 && !memcmp(REM5, T, 7)) FoundMask |= 1 << 5; in TestEraseByte()
114 if (NewSize == 7 && !memcmp(REM6, T, 7)) FoundMask |= 1 << 6; in TestEraseByte()
[all …]
/external/swiftshader/third_party/llvm-7.0/llvm/lib/Support/
DStringMap.cpp202 unsigned NewSize; in RehashTable() local
209 NewSize = NumBuckets*2; in RehashTable()
212 NewSize = NumBuckets; in RehashTable()
221 safe_calloc(NewSize+1, sizeof(StringMapEntryBase *) + sizeof(unsigned))); in RehashTable()
223 unsigned *NewHashArray = (unsigned *)(NewTableArray + NewSize + 1); in RehashTable()
224 NewTableArray[NewSize] = (StringMapEntryBase*)2; in RehashTable()
233 unsigned NewBucket = FullHash & (NewSize-1); in RehashTable()
235 NewTableArray[FullHash & (NewSize-1)] = Bucket; in RehashTable()
236 NewHashArray[FullHash & (NewSize-1)] = FullHash; in RehashTable()
245 NewBucket = (NewBucket + ProbeSize++) & (NewSize-1); in RehashTable()
[all …]
DIntervalMap.cpp121 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()
DSmallPtrSet.cpp95 void SmallPtrSetImplBase::Grow(unsigned NewSize) { in Grow() argument
101 const void **NewBuckets = (const void**) safe_malloc(sizeof(void*) * NewSize); in Grow()
105 CurArraySize = NewSize; in Grow()
106 memset(CurArray, -1, NewSize*sizeof(void*)); in Grow()
/external/llvm/lib/Support/
DStringMap.cpp199 unsigned NewSize; in RehashTable() local
206 NewSize = NumBuckets*2; in RehashTable()
209 NewSize = NumBuckets; in RehashTable()
218 (StringMapEntryBase **)calloc(NewSize+1, sizeof(StringMapEntryBase *) + in RehashTable()
220 unsigned *NewHashArray = (unsigned *)(NewTableArray + NewSize + 1); in RehashTable()
221 NewTableArray[NewSize] = (StringMapEntryBase*)2; in RehashTable()
230 unsigned NewBucket = FullHash & (NewSize-1); in RehashTable()
232 NewTableArray[FullHash & (NewSize-1)] = Bucket; in RehashTable()
233 NewHashArray[FullHash & (NewSize-1)] = FullHash; in RehashTable()
242 NewBucket = (NewBucket + ProbeSize++) & (NewSize-1); in RehashTable()
[all …]
DIntervalMap.cpp121 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()
DSmallPtrSet.cpp117 void SmallPtrSetImplBase::Grow(unsigned NewSize) { in Grow() argument
123 CurArray = (const void**)malloc(sizeof(void*) * NewSize); in Grow()
125 CurArraySize = NewSize; in Grow()
126 memset(CurArray, -1, NewSize*sizeof(void*)); in Grow()
/external/swiftshader/third_party/llvm-subzero/lib/Support/
DStringMap.cpp197 unsigned NewSize; in RehashTable() local
204 NewSize = NumBuckets*2; in RehashTable()
207 NewSize = NumBuckets; in RehashTable()
216 (StringMapEntryBase **)calloc(NewSize+1, sizeof(StringMapEntryBase *) + in RehashTable()
218 unsigned *NewHashArray = (unsigned *)(NewTableArray + NewSize + 1); in RehashTable()
219 NewTableArray[NewSize] = (StringMapEntryBase*)2; in RehashTable()
228 unsigned NewBucket = FullHash & (NewSize-1); in RehashTable()
230 NewTableArray[FullHash & (NewSize-1)] = Bucket; in RehashTable()
231 NewHashArray[FullHash & (NewSize-1)] = FullHash; in RehashTable()
240 NewBucket = (NewBucket + ProbeSize++) & (NewSize-1); in RehashTable()
[all …]
DSmallPtrSet.cpp118 void SmallPtrSetImplBase::Grow(unsigned NewSize) { in Grow() argument
124 CurArray = (const void**)malloc(sizeof(void*) * NewSize); in Grow()
126 CurArraySize = NewSize; in Grow()
127 memset(CurArray, -1, NewSize*sizeof(void*)); in Grow()
/external/swiftshader/third_party/LLVM/lib/Support/
DStringMap.cpp182 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()
DIntervalMap.cpp121 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()
DSmallPtrSet.cpp132 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/Fuzzer/
DFuzzerMutate.cpp85 size_t NewSize = EF->LLVMFuzzerCustomCrossOver( in Mutate_CustomCrossOver() local
87 if (!NewSize) in Mutate_CustomCrossOver()
89 assert(NewSize <= MaxSize && "CustomCrossOver returned overisized unit"); in Mutate_CustomCrossOver()
90 memcpy(Data, U.data(), NewSize); in Mutate_CustomCrossOver()
91 return NewSize; in Mutate_CustomCrossOver()
220 size_t NewSize = in Mutate_CrossOver() local
222 assert(NewSize > 0 && "CrossOver returned empty unit"); in Mutate_CrossOver()
223 assert(NewSize <= MaxSize && "CrossOver returned overisized unit"); in Mutate_CrossOver()
224 memcpy(Data, U.data(), NewSize); in Mutate_CrossOver()
225 return NewSize; in Mutate_CrossOver()
[all …]
DFuzzerFnAdapter.h120 size_t NewSize = UnpackSingle(Data, Size, &std::get<N>(*Tuple)); variable
121 if (NewSize == Size) {
125 return UnpackImpl<N + 1, TupleT>(Data + (Size - NewSize), NewSize, Tuple);
DFuzzerLoop.cpp566 size_t NewSize = Corpus.size(); in FindExtraUnits() local
567 assert(NewSize <= OldSize); in FindExtraUnits()
570 if (NewSize + 5 >= OldSize) in FindExtraUnits()
572 OldSize = NewSize; in FindExtraUnits()
652 size_t NewSize = 0; in MutateAndTestOne() local
653 NewSize = MD.Mutate(CurrentUnitData, Size, Options.MaxLen); in MutateAndTestOne()
654 assert(NewSize > 0 && "Mutator returned empty unit"); in MutateAndTestOne()
655 assert(NewSize <= Options.MaxLen && in MutateAndTestOne()
657 Size = NewSize; in MutateAndTestOne()
/external/swiftshader/third_party/LLVM/lib/ExecutionEngine/JIT/
DJITMemoryManager.cpp83 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/swiftshader/third_party/LLVM/lib/Target/MSP430/
DMSP430BranchSelector.cpp140 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/Target/MSP430/
DMSP430BranchSelector.cpp143 unsigned NewSize; in runOnMachineFunction() local
148 NewSize = 4; in runOnMachineFunction()
161 NewSize = 6; in runOnMachineFunction()
171 BlockSizes[MBB.getNumber()] += NewSize-2; in runOnMachineFunction()
172 MBBStartOffset += NewSize; in runOnMachineFunction()
/external/swiftshader/third_party/llvm-7.0/llvm/include/llvm/ADT/
DIndexedMap.h69 unsigned NewSize = toIndex_(n) + 1; in grow() local
70 if (NewSize > storage_.size()) in grow()
71 resize(NewSize); in grow()
DIntervalMap.h338 unsigned CurSize[], const unsigned NewSize[]) { in adjustSiblingSizes() argument
341 if (CurSize[n] == NewSize[n]) in adjustSiblingSizes()
345 NewSize[n] - CurSize[n]); in adjustSiblingSizes()
349 if (CurSize[n] >= NewSize[n]) in adjustSiblingSizes()
359 if (CurSize[n] == NewSize[n]) in adjustSiblingSizes()
363 CurSize[n] - NewSize[n]); in adjustSiblingSizes()
367 if (CurSize[n] >= NewSize[n]) in adjustSiblingSizes()
374 assert(CurSize[n] == NewSize[n] && "Insufficient element shuffle"); in adjustSiblingSizes()
412 const unsigned *CurSize, unsigned NewSize[],
1891 unsigned NewSize = P.leafSize() - 1; in treeErase() local
[all …]
/external/llvm/include/llvm/ADT/
DIndexedMap.h69 unsigned NewSize = toIndex_(n) + 1; in grow() local
70 if (NewSize > storage_.size()) in grow()
71 resize(NewSize); in grow()
DIntervalMap.h332 unsigned CurSize[], const unsigned NewSize[]) { in adjustSiblingSizes() argument
335 if (CurSize[n] == NewSize[n]) in adjustSiblingSizes()
339 NewSize[n] - CurSize[n]); in adjustSiblingSizes()
343 if (CurSize[n] >= NewSize[n]) in adjustSiblingSizes()
353 if (CurSize[n] == NewSize[n]) in adjustSiblingSizes()
357 CurSize[n] - NewSize[n]); in adjustSiblingSizes()
361 if (CurSize[n] >= NewSize[n]) in adjustSiblingSizes()
368 assert(CurSize[n] == NewSize[n] && "Insufficient element shuffle"); in adjustSiblingSizes()
406 const unsigned *CurSize, unsigned NewSize[],
1890 unsigned NewSize = P.leafSize() - 1; in treeErase() local
[all …]
/external/swiftshader/third_party/LLVM/include/llvm/ADT/
DIndexedMap.h71 unsigned NewSize = toIndex_(n) + 1; in grow() local
72 if (NewSize > storage_.size()) in grow()
73 resize(NewSize); in grow()
DIntervalMap.h311 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[],
1880 unsigned NewSize = P.leafSize() - 1; in treeErase() local
[all …]
/external/swiftshader/third_party/subzero/src/
DIceAssembler.h200 void setSize(intptr_t NewSize) { in setSize() argument
201 assert(NewSize <= size()); in setSize()
202 Cursor = Contents + NewSize; in setSize()
331 void setBufferSize(intptr_t NewSize) { Buffer.setSize(NewSize); } in setBufferSize() argument

1234