HomeSort by: relevance | last modified time | path
    Searched refs:newSize (Results 1 - 18 of 18) sorted by relevancy

  /src/external/bsd/zstd/dist/tests/fuzz/
fuzz_data_producer.c 80 size_t FUZZ_dataProducer_contract(FUZZ_dataProducer_t *producer, size_t newSize)
82 const size_t effectiveNewSize = newSize > producer->size ? producer->size : newSize;
fuzz_data_producer.h 57 /* Restricts the producer to only the last newSize bytes of data.
58 If newSize > current data size, nothing happens. Returns the number of bytes
60 size_t FUZZ_dataProducer_contract(FUZZ_dataProducer_t *producer, size_t newSize);
  /src/external/gpl3/gcc.old/dist/libphobos/src/std/experimental/allocator/building_blocks/
fallback_allocator.d 156 primary.reallocate(b, newSize)) is attempted. If it fails, an attempt is
160 newSize)) is attempted. If that fails, an attempt is made to move the
165 bool reallocate(ref void[] b, size_t newSize)
169 auto b1 = to.allocate(newSize);
170 if (b1.length != newSize) return false;
171 if (b.length < newSize) b1[0 .. b.length] = b[];
172 else b1[] = b[0 .. newSize];
181 return primary.reallocate(b, newSize)
185 return fallback.reallocate(b, newSize)
193 bool alignedReallocate(ref void[] b, size_t newSize, uint a
    [all...]
bitmapped_block.d 705 @system bool reallocate(ref void[] b, size_t newSize)
713 return reallocateImpl(b, newSize);
717 private @system bool reallocateImpl(ref void[] b, size_t newSize)
734 b = allocateImpl(newSize);
735 return b.length == newSize;
737 if (newSize == 0)
743 if (newSize < b.length)
746 auto newCapacity = bytes2blocks(newSize) * blockSize;
748 b = b[0 .. newSize];
752 return slowReallocate(this, b, newSize);
    [all...]
  /src/external/gpl3/gcc.old/dist/libphobos/src/std/experimental/allocator/
gc_allocator.d 48 immutable newSize = GC.extend(b.ptr, sizeRequest, sizeRequest);
49 if (newSize == 0)
54 assert(newSize >= desired);
61 pure nothrow @system bool reallocate(ref void[] b, size_t newSize) shared const
66 auto p = cast(ubyte*) GC.realloc(b.ptr, newSize);
67 b = p[0 .. newSize];
mallocator.d 300 Forwards to $(D alignedReallocate(b, newSize, platformAlignment)).
305 bool reallocate(ref void[] b, size_t newSize) shared
307 return alignedReallocate(b, newSize, alignment);
315 $(D __aligned_realloc(b.ptr, newSize, a))).
  /src/usr.bin/make/
hash.c 225 unsigned newSize = 2 * oldSize;
226 unsigned newMask = newSize - 1;
227 HashEntry **newBuckets = bmake_malloc(sizeof *newBuckets * newSize);
230 for (i = 0; i < newSize; i++)
245 t->bucketsSize = newSize;
  /src/external/gpl3/gcc.old/dist/libphobos/libdruntime/gcc/
emutls.d 268 auto newSize = arr.length * 2;
269 if (offset > newSize)
270 newSize = offset + 32;
271 arr.length = newSize;
  /src/external/gpl3/binutils/dist/gprofng/src/
Table.cc 1380 long newSize = ddscr->getSize ();
1381 if (ddsize == newSize)
1391 assert (tmpView->getSize () == newSize);
1392 while (ddsize < newSize)
1402 while (ddsize < newSize)
  /src/external/gpl3/binutils.old/dist/gprofng/src/
Table.cc 1380 long newSize = ddscr->getSize ();
1381 if (ddsize == newSize)
1391 assert (tmpView->getSize () == newSize);
1392 while (ddsize < newSize)
1402 while (ddsize < newSize)
  /src/external/bsd/zstd/dist/lib/compress/
huf_compress.c 1291 size_t hSize, newSize;
1313 newSize = HUF_estimateCompressedSize(table, count, maxSymbolValue) + hSize;
1315 if (newSize > optSize + 1) {
1319 if (newSize < optSize) {
1320 optSize = newSize;
1417 size_t const newSize = HUF_estimateCompressedSize(table->CTable, table->count, maxSymbolValue);
1418 if (oldSize <= hSize + newSize || hSize + 12 >= srcSize) {
  /src/external/bsd/byacc/dist/test/
expr.oxout.y 189 long oldSize = 0, newSize;
206 newSize = (3*oldSize)/2;
207 if (newSize < 100) newSize = 100;
211 fprintf(stderr,msg2,which,newSize);
  /src/external/bsd/byacc/dist/test/yacc/
expr.oxout.tab.c 398 long oldSize = 0, newSize;
415 newSize = (3*oldSize)/2;
416 if (newSize < 100) newSize = 100;
420 fprintf(stderr,msg2,which,newSize);
1671 unsigned newsize; local
1675 if ((newsize = data->stacksize) == 0)
1676 newsize = YYINITSTACKSIZE;
1677 else if (newsize >= YYMAXDEPTH)
1679 else if ((newsize *= 2) > YYMAXDEPTH
    [all...]
  /src/sys/arch/shark/ofw/
ofw.c 1811 vsize_t newSize, claim_size;
1831 newSize = (*ppLeftover)->size - size; /* reduce size */
1836 (*ppLeftover)->size = newSize;
  /src/external/bsd/byacc/dist/test/btyacc/
expr.oxout.tab.c 549 long oldSize = 0, newSize;
566 newSize = (3*oldSize)/2;
567 if (newSize < 100) newSize = 100;
571 fprintf(stderr,msg2,which,newSize);
1828 unsigned newsize; local
1835 if ((newsize = data->stacksize) == 0)
1836 newsize = YYINITSTACKSIZE;
1837 else if (newsize >= YYMAXDEPTH)
1839 else if ((newsize *= 2) > YYMAXDEPTH
    [all...]
  /src/external/mit/expat/dist/lib/
xmlparse.c 7503 size_t newSize = (size_t)1 << newPower;
7504 unsigned long newMask = (unsigned long)newSize - 1;
7507 if (newSize > (size_t)(-1) / sizeof(NAMED *)) {
7511 size_t tsize = newSize * sizeof(NAMED *);
7524 j < step ? (j += newSize - step) : (j -= step);
7531 table->size = newSize;
7537 i < step ? (i += newSize - step) : (i -= step);
  /src/external/gpl3/gcc.old/dist/libphobos/src/std/algorithm/
sorting.d 2598 size_t newSize = 1<<(bsr(minCapacity)+1);
2600 if (newSize < minCapacity) newSize = minCapacity;
2602 if (__ctfe) temp.length = newSize;
2603 else temp = () @trusted { return uninitializedArray!(T[])(newSize); }();
  /src/external/public-domain/sqlite/dist/
sqlite3.c     [all...]

Completed in 91 milliseconds