Home
last modified time | relevance | path

Searched full:chunks (Results 1 – 25 of 711) sorted by relevance

12345678910>>...29

/freebsd-src/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_); in GetBlockBegin() local
189 uptr ch = reinterpret_cast<uptr>(chunks[i]); in GetBlockBegin()
209 Header **chunks = AddressSpaceView::LoadWritable(chunks_, n_chunks_); in EnsureSortedChunks() local
210 Sort(reinterpret_cast<uptr *>(chunks), n_chunks_); in EnsureSortedChunks()
212 AddressSpaceView::LoadWritable(chunks[i])->chunk_idx = i; in EnsureSortedChunks()
[all …]
H A Dsanitizer_allocator_primary64.h34 // FreeArray is an array free-d chunks (stored as 4-byte offsets)
176 const CompactPtrT *chunks, uptr n_chunks) { in ReturnToAllocator() argument
194 free_array[old_num_chunks + i] = chunks[i]; in ReturnToAllocator()
202 CompactPtrT *chunks, uptr n_chunks) { in GetFromAllocator() argument
228 chunks[i] = free_array[base_idx + i]; in GetFromAllocator()
369 // Iterate over all existing chunks.
512 // chunks only and returns these pages back to OS.
523 // Figure out the number of chunks per page and whether we can take a fast in ReleaseFreeMemoryToOS()
524 // path (the number of chunks per page is the same for all pages). in ReleaseFreeMemoryToOS()
528 // Same number of chunks pe in ReleaseFreeMemoryToOS()
[all...]
/freebsd-src/contrib/llvm-project/lld/COFF/
H A DICF.cpp22 #include "Chunks.h"
62 std::vector<SectionChunk *> chunks; member in lld::coff::ICF
81 // Non-comdat chunks, dead chunks, and writable chunks are not eligible. in isEligible()
113 chunks.begin() + begin + 1, chunks.begin() + end, [&](SectionChunk *s) { in segregate()
115 return equalsConstant(chunks[begin], s); in segregate()
116 return equalsVariable(chunks[begin], s); in segregate()
118 size_t mid = bound - chunks in segregate()
[all...]
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); in addChunk()
349 chunks.insert(chunks.begin(), c); in insertChunkAtStart()
358 chunks in merge()
596 verifyRanges(const std::vector<Chunk * > chunks) verifyRanges() argument
803 sortBySectionOrder(std::vector<Chunk * > & chunks) sortBySectionOrder() argument
2290 sortCRTSectionChunks(std::vector<Chunk * > & chunks) sortCRTSectionChunks() argument
[all...]
H A DDLL.h12 #include "Chunks.h"
18 // 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; variable
81 uint64_t getRVA() { return chunks[0]->getRVA(); } in getRVA()
83 return chunks.back()->getRVA() + chunks.back()->getSize() - getRVA(); in getSize()
H A DMarkLive.cpp10 #include "Chunks.h"
20 // COMDAT chunks will be ignored by Writer, so they will be excluded
31 // COMDAT section chunks are dead by default. Add non-COMDAT chunks. Do not in markLive()
55 // Add GC root chunks. in markLive()
H A DWriter.h12 #include "Chunks.h"
31 std::vector<Chunk *> chunks; variable
35 // container of chunks. OutputSection and Chunk are 1:N relationship.
36 // Chunks cannot belong to more than one OutputSections. The writer
79 std::vector<Chunk *> chunks; variable
/freebsd-src/contrib/bearssl/src/ssl/
H A Dssl_keyexport.c49 br_tls_prf_seed_chunk chunks[4]; in br_ssl_key_export() local
58 chunks[0].data = cc->client_random; in br_ssl_key_export()
59 chunks[0].len = sizeof cc->client_random; in br_ssl_key_export()
60 chunks[1].data = cc->server_random; in br_ssl_key_export()
61 chunks[1].len = sizeof cc->server_random; in br_ssl_key_export()
64 chunks[2].data = tmp; in br_ssl_key_export()
65 chunks[2].len = 2; in br_ssl_key_export()
66 chunks[3].data = context; in br_ssl_key_export()
67 chunks[3].len = context_len; in br_ssl_key_export()
81 label, num_chunks, chunks); in br_ssl_key_export()
/freebsd-src/contrib/lua/doc/
H A Dluac.116 into binary files containing precompiled chunks
19 The main advantages of precompiling chunks are:
25 because in Lua chunks are always compiled into bytecodes before being executed.
28 Precompiled chunks are not necessarily smaller than the corresponding source.
34 binary files containing precompiled chunks.
46 Precompiled chunks are
50 the internal format of precompiled chunks
83 Used mainly for syntax checking and for testing precompiled chunks:
94 This saves some space in very large chunks,
/freebsd-src/usr.bin/split/
H A Dsplit.c55 static long chunks; /* Chunks count to split into. */ variable
135 case 'n': /* Chunks. */ in main()
136 chunks = strtonum(optarg, 1, LONG_MAX, &errstr); in main()
138 errx(EX_USAGE, "%s: number of chunks is %s", in main()
179 if (pflag && (numlines != 0 || bytecnt != 0 || chunks != 0)) in main()
184 else if (bytecnt != 0 || chunks != 0) in main()
187 if (bytecnt != 0 && chunks != 0) in main()
196 } else if (chunks != 0) { in main()
230 if (chunks == 0 || nfiles < chunks) { in split1()
242 if (chunks == 0 || nfiles < chunks) { in split1()
[all …]
/freebsd-src/contrib/llvm-project/compiler-rt/lib/scudo/standalone/
H A Dlocal_cache.h50 // We read ClassSize first before accessing Chunks because it's adjacent to in allocate()
51 // Count, while Chunks might be further off (depending on Count). That keeps in allocate()
54 CompactPtrT CompactP = C->Chunks[--C->Count]; in allocate()
70 C->Chunks[C->Count++] = in deallocate()
143 CompactPtrT Chunks[2 * SizeClassMap::MaxNumCachedHint]; member
171 Allocator->popBlocks(this, ClassId, C->Chunks, MaxRefill); in refill()
179 Allocator->pushBlocks(this, ClassId, &C->Chunks[0], Count); in drain()
183 C->Chunks[I] = C->Chunks[I + Count]; in drain()
/freebsd-src/contrib/libdiff/lib/
H A Ddiff_output_unidiff.c88 return &r->chunks.head[chunk_idx]; in diff_chunk_get()
107 const struct diff_chunk *c = &r->chunks.head[chunk_idx]; in diff_chunk_context_get()
160 for (i = start_chunk_idx; i < result->chunks.len; i++) { in diff_chunk_context_load_change()
161 struct diff_chunk *chunk = &result->chunks.head[i]; in diff_chunk_context_load_change()
179 * chunks may be joined up to this chunk by being in diff_chunk_context_load_change()
312 first_chunk = &result->chunks.head[cc->chunk.start]; in output_unidiff_chunk()
366 /* Now write out all the joined chunks and contexts between them */ in output_unidiff_chunk()
369 const struct diff_chunk *c = &result->chunks.head[c_idx]; in output_unidiff_chunk()
386 if (cc->chunk.end == result->chunks.len) { in output_unidiff_chunk()
396 last_chunk = &result->chunks.head[cc->chunk.end - 1]; in output_unidiff_chunk()
[all …]
H A Ddiff_output_plain.c109 * Now write out all the joined chunks. in output_plain_chunk()
118 const struct diff_chunk *c = &result->chunks.head[c_idx]; in output_plain_chunk()
143 if (cc->chunk.end == result->chunks.len) { in output_plain_chunk()
182 for (i = 0; i < result->chunks.len; i++) { in diff_output_plain()
183 struct diff_chunk *c = &result->chunks.head[i]; in diff_output_plain()
207 for (i = 0; i < result->chunks.len; i++) { in diff_output_plain()
208 struct diff_chunk *chunk = &result->chunks.head[i]; in diff_output_plain()
217 * chunks may be joined up to this chunk by being in diff_output_plain()
/freebsd-src/share/doc/papers/malloc/
H A Dimplementation.ms79 into some number of equal size chunks.
84 describes the size of the chunks on this page, how many there are,
86 The description consist of a bitmap of used chunks, and various counters
90 pages that have free chunks in them form a list.
96 of free chunks on that page is decreased by one and, if zero, the
101 free bit is set for the chunk, the number of free chunks increased by
103 proper place on the list for this size of chunks.
104 If the count increases to match the number of chunks on the page, the
156 the chunks described by that structure.
/freebsd-src/usr.bin/systat/
H A Dsctp.c57 07 SCTP Timers SCTP Chunks
58 08999999999999 init timeouts 999999999999 control chunks sent
59 09999999999999 cookie timeouts 999999999999 data chunks sent
62 12999999999999 shutdown timeouts 999999999999 control chunks received
63 13999999999999 shutdown-ack timeouts 999999999999 data chunks received
103 L(7, "SCTP Timers"); R(7, "SCTP Chunks"); in labelsctp()
104 L(8, "init timeouts"); R(8, "control chunks sent"); in labelsctp()
105 L(9, "cookie timeouts"); R(9, "data chunks sent"); in labelsctp()
108 L(12, "shutdown timeouts"); R(12, "control chunks received"); in labelsctp()
109 L(13, "shutdown-ack timeouts"); R(13, "data chunks received"); in labelsctp()
/freebsd-src/sys/dev/qlnx/qlnxe/
H A Drdma_common.h298 u8 wqe_size /* Size of WQE in 16B chunks including SGE */;
299 u8 prev_wqe_size /* Previous WQE size in 16B chunks */;
329 u8 wqe_size /* Size of WQE in 16B chunks including all SGEs. Set to number of SGEs + 1. */;
330 u8 prev_wqe_size /* Previous WQE size in 16B chunks */;
370 u8 wqe_size /* Size of WQE in 16B chunks */;
371 u8 prev_wqe_size /* Previous WQE size in 16B chunks */;
420 u8 wqe_size /* Size of WQE in 16B chunks */;
421 u8 prev_wqe_size /* Previous WQE size in 16B chunks */;
476 …u8 wqe_size /* Size of WQE in 16B chunks including all SGEs or inline data. In case there are SGEs…
477 u8 prev_wqe_size /* Previous WQE size in 16B chunks */;
[all …]
/freebsd-src/usr.sbin/makefs/zfs/
H A Dzap.c63 unsigned long chunks; /* count of chunks needed for fat ZAP */ member
123 zap->chunks = 0; in zap_alloc()
155 zap->chunks += zap_entry_chunks(ent); in zap_add()
268 if (zap->chunks <= ZAP_LEAF_NUMCHUNKS(l)) { in zap_fat_write_prefixlen()
270 * All chunks will fit in a single leaf block. in zap_fat_write_prefixlen()
281 uint16_t chunks; in zap_fat_write_prefixlen() local
285 chunks = zap_entry_chunks(ent); in zap_fat_write_prefixlen()
286 if (ZAP_LEAF_NUMCHUNKS(l) - leafchunks[li] < chunks) { in zap_fat_write_prefixlen()
292 leafchunks[li] += chunks; in zap_fat_write_prefixlen()
334 /* Initialize the leaf chunks. */ in zap_fat_write_leaf_init()
[all …]
/freebsd-src/contrib/llvm-project/clang/include/clang/Rewrite/Core/
H A DRewriteRope.h172 RopePieceBTree Chunks; variable
182 RewriteRope(const RewriteRope &RHS) : Chunks(RHS.Chunks) {} in RewriteRope()
191 iterator begin() const { return Chunks.begin(); } in begin()
192 iterator end() const { return Chunks.end(); } in end()
193 unsigned size() const { return Chunks.size(); } in size()
196 Chunks.clear(); in clear()
202 Chunks.insert(0, MakeRopeString(Start, End)); in assign()
208 Chunks.insert(Offset, MakeRopeString(Start, End)); in insert()
214 Chunks.erase(Offset, NumBytes); in erase()
/freebsd-src/contrib/libcbor/src/cbor/
H A Dbytestrings.c56 .chunks = NULL, in cbor_new_indefinite_bytestring()
83 return ((struct cbor_indefinite_string_data *)item->data)->chunks; in cbor_bytestring_chunks_handle()
109 data->chunks, sizeof(cbor_item_t *), new_chunk_capacity); in cbor_bytestring_add_chunk()
115 data->chunks = new_chunks_data; in cbor_bytestring_add_chunk()
117 data->chunks[data->chunk_count++] = cbor_incref(chunk); in cbor_bytestring_add_chunk()
H A Dstrings.c37 .chunks = NULL, in cbor_new_indefinite_string()
84 return ((struct cbor_indefinite_string_data *)item->data)->chunks; in cbor_string_chunks_handle()
107 data->chunks, sizeof(cbor_item_t *), new_chunk_capacity); in cbor_string_add_chunk()
114 data->chunks = new_chunks_data; in cbor_string_add_chunk()
116 data->chunks[data->chunk_count++] = cbor_incref(chunk); in cbor_string_add_chunk()
/freebsd-src/contrib/llvm-project/lld/docs/
H A DNewLLD.rst190 Chunks created for common or BSS symbols are not backed by sections.
191 The linker may create chunks to append additional data to an output as well.
193 Chunks know about their size, how to copy their data to mmap'ed outputs,
195 Specifically, section-based chunks know how to read relocation tables
201 input files as Chunks for ELF. Instead, we directly use the input section
205 mmap'ed outputs, just like COFF Chunks.
209 OutputSection is a container of InputSections (ELF) or Chunks (COFF).
219 They are responsible for creating and owning Symbols and InputSections/Chunks.
223 The writer is responsible for writing file headers and InputSections/Chunks to
224 a file. It creates OutputSections, put all InputSections/Chunks into them,
/freebsd-src/sys/powerpc/powerpc/
H A Dplatform_if.m124 * @param _memp Array of physical memory chunks
125 * @param _memsz Number of physical memory chunks
126 * @param _availp Array of available physical memory chunks
127 * @param _availsz Number of available physical memory chunks
144 * @param _memp Array of physical memory chunks
145 * @param _memsz Number of physical memory chunks
/freebsd-src/contrib/llvm-project/llvm/lib/Target/AArch64/
H A DAArch64ExpandImm.cpp36 /// Check for identical 16-bit chunks within the constant and if so
38 /// 16-bit chunks will be materialized with MOVK instructions.
41 /// of the chunks doesn't matter), assuming |A|A|A|A| can be materialized with
53 // Traverse the chunks to find one which occurs more than once. in tryToreplicateChunks()
60 // We are looking for chunks which have two or three instances and can be in tryToreplicateChunks()
138 /// which might be interrupted by one or two chunks. If so, materialize the
140 /// Materialize the chunks which are either interrupting the sequence or outside
157 // Try to find the chunks which start/end a contiguous sequence of ones. in trySequenceOfOnes()
175 // Chunks between the start and end chunk need to have all their bits set. in trySequenceOfOnes()
190 // Find out which chunks w in trySequenceOfOnes()
[all...]
/freebsd-src/sys/contrib/openzfs/include/sys/
H A Dzap_leaf.h45 * The amount of space available for chunks is:
68 * Low water mark: when there are only this many chunks free, start
70 * "reasonably-sized" entry. 20 chunks is more than enough for the
80 * chunks per entry (3).
88 * The chunks start immediately after the hash table. The end of the
117 uint16_t lh_nfree; /* number free chunks */
125 } l_hdr; /* 2 24-byte chunks */
/freebsd-src/sys/netinet/
H A Dsctp_auth.c99 * add a chunk to the required chunks list
114 if (list->chunks[chunk] == 0) { in sctp_auth_add_chunk()
115 list->chunks[chunk] = 1; in sctp_auth_add_chunk()
125 * delete a chunk from the required chunks list
133 if (list->chunks[chunk] == 1) { in sctp_auth_delete_chunk()
134 list->chunks[chunk] = 0; in sctp_auth_delete_chunk()
153 * return the current number and list of required chunks caller must
165 if (list->chunks[i] != 0) { in sctp_serialize_auth_chunks()
184 if (list->chunks[i] != 0) { in sctp_pack_auth_chunks()
194 if (list->chunks[i] != 0) { in sctp_pack_auth_chunks()
[all …]

12345678910>>...29