Searched refs:chunks (Results 1 - 25 of 72) sorted by relevance

123

/freebsd-current/contrib/bearssl/src/ssl/
H A Dssl_keyexport.c49 br_tls_prf_seed_chunk chunks[4]; local
58 chunks[0].data = cc->client_random;
59 chunks[0].len = sizeof cc->client_random;
60 chunks[1].data = cc->server_random;
61 chunks[1].len = sizeof cc->server_random;
64 chunks[2].data = tmp;
65 chunks[2].len = 2;
66 chunks[3].data = context;
67 chunks[3].len = context_len;
81 label, num_chunks, chunks);
[all...]
/freebsd-current/tests/sys/cddl/zfs/tests/txg_integrity/
H A Dmake_patterns.py36 chunks = random.sample(range(NUM_CHUNKS), NUM_CHUNKS / 2)
37 for chunk in chunks:
/freebsd-current/contrib/llvm-project/lld/COFF/
H A DICF.cpp62 std::vector<SectionChunk *> chunks; member in class:lld::coff::ICF
81 // Non-comdat chunks, dead chunks, and writable chunks are not eligible.
113 chunks.begin() + begin + 1, chunks.begin() + end, [&](SectionChunk *s) {
115 return equalsConstant(chunks[begin], s);
116 return equalsVariable(chunks[begin], s);
118 size_t mid = bound - chunks.begin();
123 chunks[
[all...]
H A DDLL.h18 // IdataContents creates all chunks for the DLL import table.
37 // DelayLoadContents creates all chunks for the delay-load DLL import table.
75 // EdataContents creates all chunks for the DLL export table.
79 std::vector<Chunk *> chunks; member in class:lld::coff::EdataContents
81 uint64_t getRVA() { return chunks[0]->getRVA(); }
83 return chunks.back()->getRVA() + chunks.back()->getSize() - getRVA();
H A DWriter.h31 std::vector<Chunk *> chunks; member in class:lld::coff::PartialSection
35 // container of chunks. OutputSection and Chunk are 1:N relationship.
79 std::vector<Chunk *> chunks; member in class:lld::coff::OutputSection
H A DWriter.cpp182 // PartialSection represents a group of chunks that contribute to an
227 bool verifyRanges(const std::vector<Chunk *> chunks);
257 void sortCRTSectionChunks(std::vector<Chunk *> &chunks);
259 void sortBySectionOrder(std::vector<Chunk *> &chunks);
328 // the chunks that the linker creates. All .pdata chunks come from input
345 chunks.push_back(c);
349 chunks.insert(chunks.begin(), c);
358 chunks
596 verifyRanges(const std::vector<Chunk *> chunks) argument
803 sortBySectionOrder(std::vector<Chunk *> &chunks) argument
2290 sortCRTSectionChunks(std::vector<Chunk *> &chunks) argument
[all...]
H A DDLL.cpp9 // This file defines various types of chunks for the DLL import or export
635 explicit NamePointersChunk(std::vector<Chunk *> &v) : chunks(v) {}
636 size_t getSize() const override { return chunks.size() * 4; }
639 for (Chunk *c : chunks) {
646 std::vector<Chunk *> chunks; member in class:lld::coff::__anon1279::NamePointersChunk
681 // we need to create hintName chunks to store the names.
879 chunks.push_back(dir);
880 chunks.push_back(dllName);
881 chunks.push_back(addressTab);
882 chunks
[all...]
/freebsd-current/usr.bin/split/
H A Dsplit.c55 static long chunks; /* Chunks count to split into. */ variable
136 chunks = strtonum(optarg, 1, LONG_MAX, &errstr);
138 errx(EX_USAGE, "%s: number of chunks is %s",
179 if (pflag && (numlines != 0 || bytecnt != 0 || chunks != 0))
184 else if (bytecnt != 0 || chunks != 0)
187 if (bytecnt != 0 && chunks != 0)
196 } else if (chunks != 0) {
230 if (chunks == 0 || nfiles < chunks) {
242 if (chunks
[all...]
/freebsd-current/contrib/libcbor/src/cbor/
H A Dbytestrings.c56 .chunks = NULL,
83 return ((struct cbor_indefinite_string_data *)item->data)->chunks;
109 data->chunks, sizeof(cbor_item_t *), new_chunk_capacity);
115 data->chunks = new_chunks_data;
117 data->chunks[data->chunk_count++] = cbor_incref(chunk);
H A Dstrings.c37 .chunks = NULL,
84 return ((struct cbor_indefinite_string_data *)item->data)->chunks;
107 data->chunks, sizeof(cbor_item_t *), new_chunk_capacity);
114 data->chunks = new_chunks_data;
116 data->chunks[data->chunk_count++] = cbor_incref(chunk);
H A Dserialization.c89 cbor_item_t **chunks = cbor_bytestring_chunks_handle(item); local
92 indef_bytestring_size, cbor_serialized_size(chunks[i]));
104 cbor_item_t **chunks = cbor_string_chunks_handle(item); local
107 indef_string_size, cbor_serialized_size(chunks[i]));
223 cbor_item_t **chunks = cbor_bytestring_chunks_handle(item);
226 chunks[i], buffer + written, buffer_size - written);
255 cbor_item_t **chunks = cbor_string_chunks_handle(item);
257 size_t chunk_written = cbor_serialize_string(chunks[i], buffer + written,
H A Dcommon.c97 /* We need to decref all chunks */
102 ((struct cbor_indefinite_string_data *)item->data)->chunks);
111 /* We need to decref all chunks */
116 ((struct cbor_indefinite_string_data *)item->data)->chunks);
H A Ddata.h110 size_t codepoint_count; /* Sum of chunks' codepoint_counts for indefinite
189 cbor_item_t** chunks; member in struct:cbor_indefinite_string_data
/freebsd-current/contrib/llvm-project/compiler-rt/lib/sanitizer_common/
H A Dsanitizer_allocator_secondary.h16 // Fixed array to store LargeMmapAllocator chunks list, limited to 32K total
17 // allocated chunks. To be used in memory constrained or not memory hungry cases
28 // Much less restricted LargeMmapAllocator chunks list (comparing to
29 // PtrArrayStatic). Backed by mmaped memory region and can hold up to 1M chunks.
66 // This class can (de)allocate only large chunks of memory using mmap/unmap.
186 Header *const *chunks = AddressSpaceView::Load(chunks_, n_chunks_); local
189 uptr ch = reinterpret_cast<uptr>(chunks[i]);
209 Header **chunks = AddressSpaceView::LoadWritable(chunks_, n_chunks_);
210 Sort(reinterpret_cast<uptr *>(chunks), n_chunks_);
212 AddressSpaceView::LoadWritable(chunks[
224 Header *const *chunks = AddressSpaceView::Load(chunks_, n_chunks_); local
278 const Header *const *chunks = AddressSpaceView::Load(chunks_, n_chunks_); local
[all...]
H A Dsanitizer_allocator_local_cache.h43 CompactPtrT chunk = c->chunks[--c->count];
61 c->chunks[c->count++] = chunk;
82 CompactPtrT chunks[2 * SizeClassMap::kMaxNumCachedHint]; member in struct:SizeClassAllocator64LocalCache::PerClass
103 if (UNLIKELY(!allocator->GetFromAllocator(&stats_, class_id, c->chunks,
122 &c->chunks[first_idx_to_drain], count);
228 // of the chunks. If using a separate size class, it will always be
/freebsd-current/contrib/libucl/src/
H A Ducl_sexp.c76 assert (parser->chunks != NULL);
77 assert (parser->chunks->begin != NULL);
78 assert (parser->chunks->remain != 0);
80 p = parser->chunks->begin;
81 end = p + parser->chunks->remain;
H A Ducl_parser.c64 struct ucl_chunk *chunk = parser->chunks;
136 struct ucl_chunk *chunk = parser->chunks;
644 nobj = ucl_object_new_full (is_array ? UCL_ARRAY : UCL_OBJECT, parser->chunks->priority);
694 st->e.params.line = parser->chunks->line;
695 st->chunk = parser->chunks;
1199 switch (parser->chunks->strategy) {
1474 nobj = ucl_object_new_full (UCL_NULL, parser->chunks->priority);
1645 obj = ucl_object_new_full (UCL_NULL, parser->chunks->priority);
1966 parser->chunks->line, st->e.params.line);
2337 struct ucl_chunk *chunk = parser->chunks;
[all...]
H A Ducl_msgpack.c781 parser->stack->chunk = parser->chunks;
791 stack->chunk = parser->chunks;
971 p = parser->chunks->begin;
972 remain = parser->chunks->remain;
1072 parser->chunks->priority);
1103 parser->chunks->priority);
1257 parser->chunks->priority);
1340 assert (parser->chunks != NULL);
1341 assert (parser->chunks->begin != NULL);
1342 assert (parser->chunks
[all...]
/freebsd-current/contrib/libdiff/lib/
H A Ddiff_output_edscript.c138 for (i = 0; i < result->chunks.len; i++) {
139 struct diff_chunk *c = &result->chunks.head[i];
154 for (i = 0; i < result->chunks.len; i++) {
155 struct diff_chunk *chunk = &result->chunks.head[i];
164 * chunks may be joined up to this chunk by being
H A Ddiff_output_unidiff.c88 return &r->chunks.head[chunk_idx];
107 const struct diff_chunk *c = &r->chunks.head[chunk_idx];
160 for (i = start_chunk_idx; i < result->chunks.len; i++) {
161 struct diff_chunk *chunk = &result->chunks.head[i];
179 * chunks may be joined up to this chunk by being
312 first_chunk = &result->chunks.head[cc->chunk.start];
366 /* Now write out all the joined chunks and contexts between them */
369 const struct diff_chunk *c = &result->chunks.head[c_idx];
386 if (cc->chunk.end == result->chunks.len) {
396 last_chunk = &result->chunks
[all...]
H A Ddiff_output_plain.c109 * Now write out all the joined chunks.
118 const struct diff_chunk *c = &result->chunks.head[c_idx];
143 if (cc->chunk.end == result->chunks.len) {
182 for (i = 0; i < result->chunks.len; i++) {
183 struct diff_chunk *c = &result->chunks.head[i];
207 for (i = 0; i < result->chunks.len; i++) {
208 struct diff_chunk *chunk = &result->chunks.head[i];
217 * chunks may be joined up to this chunk by being
/freebsd-current/contrib/libdiff/test/
H A Dresults_test.c72 for (i = 0; i < result->chunks.len; i++) {
73 struct diff_chunk *c = &result->chunks.head[i];
154 ARRAYLIST_FOREACH(c, result->chunks) {
158 (unsigned long)ARRAYLIST_IDX(c, result->chunks),
/freebsd-current/sys/dev/adlink/
H A Dadlink.c36 * a given number of chunks in it. The a control structure and the
83 u_int ringsize; /* chunks */
111 struct pgstat *chunks; member in struct:softc
180 pg = sc->chunks;
252 sc->chunks = pg;
263 pg->next = sc->chunks;
268 sc->next = sc->chunks;
272 pg = sc->chunks;
306 pg = sc->next = sc->chunks;
/freebsd-current/sys/netinet/
H A Dsctp_auth.c99 * add a chunk to the required chunks list
114 if (list->chunks[chunk] == 0) {
115 list->chunks[chunk] = 1;
125 * delete a chunk from the required chunks list
133 if (list->chunks[chunk] == 1) {
134 list->chunks[chunk] = 0;
153 * return the current number and list of required chunks caller must
165 if (list->chunks[i] != 0) {
184 if (list->chunks[i] != 0) {
194 if (list->chunks[
1371 struct sctp_auth_chunk_list *chunks = NULL; local
1848 struct sctp_auth_chunk_list *chunks; local
[all...]
/freebsd-current/usr.sbin/makefs/zfs/
H A Dzap.c63 unsigned long chunks; /* count of chunks needed for fat ZAP */ member in struct:zfs_zap
123 zap->chunks = 0;
155 zap->chunks += zap_entry_chunks(ent);
259 if (zap->chunks <= ZAP_LEAF_NUMCHUNKS(l)) {
261 * All chunks will fit in a single leaf block.
272 uint16_t chunks; local
276 chunks = zap_entry_chunks(ent);
277 if (ZAP_LEAF_NUMCHUNKS(l) - leafchunks[li] < chunks) {
283 leafchunks[li] += chunks;
[all...]

Completed in 404 milliseconds

123