OpenGrok
Home
Sort by:
relevance
|
last modified time
|
path
Full Search
in project(s):
src
xsrc
Definition
Symbol
File Path
History
|
|
Help
Searched
defs:chunkSize
(Results
1 - 9
of
9
) sorted by relevancy
/src/external/gpl3/binutils/dist/gprofng/src/
DbeSyncMap.h
53
long
chunkSize
;
64
chunkSize
= _chunkSize;
65
chunk = new DbeLinkList<ITEM *> * [
chunkSize
];
66
for (long i = 0; i <
chunkSize
; i++)
74
for (long i = 0; i <
chunkSize
; i++)
84
for (long i = 0; i <
chunkSize
; i++)
110
return (hash_ty) (crc64 (key, strlen (key)) %
chunkSize
);
200
for (long i = 0; i <
chunkSize
; i++)
/src/external/gpl3/binutils.old/dist/gprofng/src/
DbeSyncMap.h
53
long
chunkSize
;
64
chunkSize
= _chunkSize;
65
chunk = new DbeLinkList<ITEM *> * [
chunkSize
];
66
for (long i = 0; i <
chunkSize
; i++)
74
for (long i = 0; i <
chunkSize
; i++)
84
for (long i = 0; i <
chunkSize
; i++)
110
return (hash_ty) (crc64 (key, strlen (key)) %
chunkSize
);
200
for (long i = 0; i <
chunkSize
; i++)
/src/external/bsd/zstd/dist/contrib/pzstd/
Pzstd.cpp
362
* Reads `size` data in chunks of `
chunkSize
` and puts it into `queue`.
367
readData(BufferWorkQueue& queue, size_t
chunkSize
, size_t size, FILE* fd,
372
std::fread(buffer.data(), 1, std::min(
chunkSize
, buffer.size()), fd);
510
const size_t
chunkSize
= ZSTD_DStreamInSize();
552
status = readData(*in,
chunkSize
,
chunkSize
, fd, &totalBytesRead);
558
status = readData(*in,
chunkSize
, frameSize, fd, &totalBytesRead);
/src/external/bsd/zstd/dist/programs/
dibio.c
156
size_t const
chunkSize
= MIN((size_t)(fileSize-fileDataLoaded), targetChunkSize);
157
if (totalDataLoaded +
chunkSize
> *bufferSizePtr) /* buffer is full */
160
if (fread( buff+totalDataLoaded, 1,
chunkSize
, f ) !=
chunkSize
)
162
sampleSizes[nbSamplesLoaded++] =
chunkSize
;
163
totalDataLoaded +=
chunkSize
;
164
fileDataLoaded +=
chunkSize
;
267
* Given a list of files, and a
chunkSize
(0 == no chunk, whole files)
271
static fileStats DiB_fileStats(const char** fileNamesTable, int nbFiles, size_t
chunkSize
, int displayLevel)
278
assert(
chunkSize
<= SAMPLESIZE_MAX )
[
all
...]
/src/external/apache2/llvm/dist/clang/lib/CodeGen/
SwiftCallingConv.cpp
428
CharUnits
chunkSize
) {
429
return getOffsetAtStartOfUnit(first,
chunkSize
)
430
== getOffsetAtStartOfUnit(second,
chunkSize
);
455
CharUnits
chunkSize
) {
460
chunkSize
))
475
const CharUnits
chunkSize
= getMaximumVoluntaryIntegerSize(CGM);
482
if (shouldMergeEntries(Entries[i - 1], Entries[i],
chunkSize
)) {
529
CharUnits chunkBegin = getOffsetAtStartOfUnit(localBegin,
chunkSize
);
530
CharUnits chunkEnd = chunkBegin +
chunkSize
;
537
assert(unitSize <=
chunkSize
);
[
all
...]
/src/external/bsd/zstd/dist/lib/compress/
zstd_ldm.c
538
size_t const
chunkSize
= chunkEnd - chunkStart;
569
ldmState, sequences, params, chunkStart,
chunkSize
);
581
assert(newLeftoverSize ==
chunkSize
);
582
leftoverSize +=
chunkSize
;
zstdmt_compress.c
745
{ size_t const
chunkSize
= 4*ZSTD_BLOCKSIZE_MAX;
746
int const nbChunks = (int)((job->src.size + (
chunkSize
-1)) /
chunkSize
);
752
if (sizeof(size_t) > sizeof(int)) assert(job->src.size < ((size_t)INT_MAX) *
chunkSize
); /* check overflow */
756
size_t const cSize = ZSTD_compressContinue_public(cctx, op, oend-op, ip,
chunkSize
);
758
ip +=
chunkSize
;
763
job->consumed =
chunkSize
* chunkNb;
770
assert(
chunkSize
> 0);
771
assert((
chunkSize
& (
chunkSize
- 1)) == 0); /* chunkSize must be power of 2 for mask==(chunkSize-1) to work *
[
all
...]
/src/external/apache2/mDNSResponder/dist/mDNSShared/
DebugServices.c
2053
size_t
chunkSize
;
2152
chunkSize
= ( inDataSize < 16 ) ? inDataSize : 16;
2153
n = ( inFlags & kDebugFlagsNo16ByteHexPad ) ?
chunkSize
: 16;
2168
if( i <
chunkSize
)
2192
if( i <
chunkSize
)
2323
offset += (int)
chunkSize
;
2324
src +=
chunkSize
;
2325
inDataSize -=
chunkSize
;
/src/external/bsd/zstd/dist/tests/
fuzzer.c
1431
size_t const
chunkSize
= MIN(CNBuffSize - b, avgChunkSize);
1432
RDG_genBuffer((char*)CNBuffer + b,
chunkSize
, compressibility, 0. /* auto */, seed);
Completed in 38 milliseconds
Indexes created Tue Feb 24 08:35:24 UTC 2026