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

123

/freebsd-11-stable/contrib/llvm-project/lld/COFF/
H A DICF.h20 void doICF(ArrayRef<Chunk *> chunks);
H A DMarkLive.h20 void markLive(ArrayRef<Chunk *> chunks);
H A DICF.cpp63 std::vector<SectionChunk *> chunks; member in class:lld::coff::ICF
80 // Non-comdat chunks, dead chunks, and writable chunks are not eligible.
108 chunks.begin() + begin + 1, chunks.begin() + end, [&](SectionChunk *s) {
110 return equalsConstant(chunks[begin], s);
111 return equalsVariable(chunks[begin], s);
113 size_t mid = bound - chunks.begin();
118 chunks[
314 doICF(ArrayRef<Chunk *> chunks) argument
[all...]
H A DDLL.h19 // IdataContents creates all chunks for the DLL import table.
38 // DelayLoadContents creates all chunks for the delay-load DLL import table.
67 // EdataContents creates all chunks for the DLL export table.
71 std::vector<Chunk *> chunks; member in class:lld::coff::EdataContents
73 uint64_t getRVA() { return chunks[0]->getRVA(); }
75 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.
73 std::vector<Chunk *> chunks; member in class:lld::coff::OutputSection
H A DMarkLive.cpp21 // COMDAT chunks will be ignored by Writer, so they will be excluded
23 void markLive(ArrayRef<Chunk *> chunks) { argument
31 // COMDAT section chunks are dead by default. Add non-COMDAT chunks. Do not
34 for (Chunk *c : chunks)
55 // Add GC root chunks.
H A DWriter.cpp169 // PartialSection represents a group of chunks that contribute to an
222 void sortCRTSectionChunks(std::vector<Chunk *> &chunks);
283 // the chunks that the linker creates. All .pdata chunks come from input
296 chunks.push_back(c);
300 chunks.insert(chunks.begin(), c);
309 chunks.insert(chunks.end(), other->chunks
500 verifyRanges(const std::vector<Chunk *> chunks) argument
644 sortBySectionOrder(std::vector<Chunk *> &chunks) argument
1864 sortCRTSectionChunks(std::vector<Chunk *> &chunks) argument
[all...]
H A DDLL.cpp9 // This file defines various types of chunks for the DLL import or export
538 explicit NamePointersChunk(std::vector<Chunk *> &v) : chunks(v) {}
539 size_t getSize() const override { return chunks.size() * 4; }
542 for (Chunk *c : chunks) {
549 std::vector<Chunk *> chunks; member in class:lld::coff::__anon57::NamePointersChunk
578 // we need to create hintName chunks to store the names.
734 chunks.push_back(dir);
735 chunks.push_back(dllName);
736 chunks.push_back(addressTab);
737 chunks
[all...]
/freebsd-11-stable/contrib/gcclibs/libiberty/
H A Dobjalloc.c95 ret->chunks = (PTR) malloc (CHUNK_SIZE);
96 if (ret->chunks == NULL)
102 chunk = (struct objalloc_chunk *) ret->chunks;
148 chunk->next = (struct objalloc_chunk *) o->chunks;
151 o->chunks = (PTR) chunk;
162 chunk->next = (struct objalloc_chunk *) o->chunks;
168 o->chunks = (PTR) chunk;
181 l = (struct objalloc_chunk *) o->chunks;
206 for (p = (struct objalloc_chunk *) o->chunks; p != NULL; p = p->next)
233 any chunks containin
[all...]
/freebsd-11-stable/contrib/binutils/libiberty/
H A Dobjalloc.c95 ret->chunks = (PTR) malloc (CHUNK_SIZE);
96 if (ret->chunks == NULL)
102 chunk = (struct objalloc_chunk *) ret->chunks;
141 chunk->next = (struct objalloc_chunk *) o->chunks;
144 o->chunks = (PTR) chunk;
155 chunk->next = (struct objalloc_chunk *) o->chunks;
161 o->chunks = (PTR) chunk;
174 l = (struct objalloc_chunk *) o->chunks;
199 for (p = (struct objalloc_chunk *) o->chunks; p != NULL; p = p->next)
226 any chunks containin
[all...]
/freebsd-11-stable/usr.bin/split/
H A Dsplit.c67 static off_t chunks = 0; /* Chunks count to split into. */ variable
137 (chunks = (size_t)strtoul(optarg, &ep, 10)) == 0 ||
139 errx(EX_USAGE, "%s: illegal number of chunks",
170 if (pflag && (numlines != 0 || bytecnt != 0 || chunks != 0))
175 else if (bytecnt != 0 || chunks != 0)
178 if (bytecnt && chunks)
187 } else if (chunks) {
220 if (!chunks || (nfiles < chunks)) {
232 if (!chunks || (nfile
[all...]
/freebsd-11-stable/sys/dev/drm2/radeon/
H A Dradeon_cs.c49 chunk = &p->chunks[p->chunk_relocs_idx];
173 /* get chunks */
189 chunk_array_ptr = (uint64_t *)(unsigned long)(cs->chunks);
196 p->chunks = malloc(p->nchunks * sizeof(struct radeon_cs_chunk),
198 if (p->chunks == NULL) {
211 p->chunks[i].length_dw = user_chunk.length_dw;
212 p->chunks[i].kdata = NULL;
213 p->chunks[i].chunk_id = user_chunk.chunk_id;
215 if (p->chunks[i].chunk_id == RADEON_CHUNK_ID_RELOCS) {
218 if (p->chunks[
[all...]
/freebsd-11-stable/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
282 const Header *const *chunks = AddressSpaceView::Load(chunks_, n_chunks_); local
[all...]
H A Dsanitizer_allocator_local_cache.h42 CompactPtrT chunk = c->chunks[--c->count];
60 c->chunks[c->count++] = chunk;
81 CompactPtrT chunks[2 * SizeClassMap::kMaxNumCachedHint]; member in struct:SizeClassAllocator64LocalCache::PerClass
102 if (UNLIKELY(!allocator->GetFromAllocator(&stats_, class_id, c->chunks,
115 &c->chunks[first_idx_to_drain], count);
221 // of the chunks. If using a separate size class, it will always be
/freebsd-11-stable/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;
/freebsd-11-stable/sys/dev/drm/
H A Dradeon_cs.c168 chunk_array_ptr = (uint64_t *)(unsigned long)(cs->chunks);
181 parser.chunks = drm_calloc(parser.num_chunks, sizeof(struct drm_radeon_kernel_chunk), DRM_MEM_DRIVER);
182 if (!parser.chunks) {
196 parser.chunks[i].chunk_id = user_chunk.chunk_id;
198 if (parser.chunks[i].chunk_id == RADEON_CHUNK_ID_RELOCS)
201 if (parser.chunks[i].chunk_id == RADEON_CHUNK_ID_IB)
204 if (parser.chunks[i].chunk_id == RADEON_CHUNK_ID_OLD) {
209 parser.chunks[i].length_dw = user_chunk.length_dw;
210 parser.chunks[i].chunk_data = (uint32_t *)(unsigned long)user_chunk.chunk_data;
212 parser.chunks[
[all...]
/freebsd-11-stable/contrib/gcclibs/include/
H A Dobjalloc.h48 void *chunks; member in struct:objalloc
/freebsd-11-stable/contrib/binutils/include/
H A Dobjalloc.h48 void *chunks; member in struct:objalloc
/freebsd-11-stable/contrib/subversion/subversion/libsvn_fs_base/
H A Dreps-strings.c106 apr_array_header_t *chunks;
114 chunks = rep->contents.delta.chunks;
117 *keys = apr_array_make(pool, chunks->nelts, sizeof(key));
118 if (! chunks->nelts)
122 for (i = 0; i < chunks->nelts; i++)
124 rep_delta_chunk_t *chunk = APR_ARRAY_IDX(chunks, i, rep_delta_chunk_t *);
268 apr_array_header_t *chunks = rep->contents.delta.chunks;
272 if (chunks
105 apr_array_header_t *chunks; local
265 apr_array_header_t *chunks = rep->contents.delta.chunks; local
434 const apr_array_header_t *chunks = rep->contents.delta.chunks; local
744 apr_array_header_t *chunks = rep->contents.delta.chunks; local
1575 apr_array_header_t *chunks; local
[all...]
H A Dfs.h292 /* an array of rep_delta_chunk_t * chunks of delta
294 apr_array_header_t *chunks;
291 apr_array_header_t *chunks; member in struct:representation_t::__anon5363::__anon5365
/freebsd-11-stable/sys/dev/cxgb/ulp/iw_cxgb/
H A Diw_cxgb_hal.h223 int chunks; local
226 chunks = (size + (1<<gp->gen_chunk_shift) - 1) >> gp->gen_chunk_shift;
228 blkno = blist_alloc(gp->gen_list, chunks);
240 int chunks; local
243 chunks = (size + (1<<gp->gen_chunk_shift) - 1) >> gp->gen_chunk_shift;
246 blist_free(gp->gen_list, blkno, chunks);
/freebsd-11-stable/contrib/gdb/include/
H A Dobjalloc.h48 PTR chunks; member in struct:objalloc
/freebsd-11-stable/sys/dev/adlink/
H A Dadlink.c34 * 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-11-stable/sys/netinet/
H A Dsctp_auth.c102 * add a chunk to the required chunks list
117 if (list->chunks[chunk] == 0) {
118 list->chunks[chunk] = 1;
128 * delete a chunk from the required chunks list
136 if (list->chunks[chunk] == 1) {
137 list->chunks[chunk] = 0;
156 * return the current number and list of required chunks caller must
168 if (list->chunks[i] != 0) {
187 if (list->chunks[i] != 0) {
197 if (list->chunks[
1417 struct sctp_auth_chunk_list *chunks = NULL; local
1904 struct sctp_auth_chunk_list *chunks; local
[all...]
/freebsd-11-stable/contrib/ofed/infiniband-diags/src/
H A Dibroute.c101 unsigned chunks = ALIGN(nports + 1, 16) / 16; local
102 for (i = 0; i < chunks; i++) {
147 unsigned block, i, j, e, nports, cap, chunks, startblock, lastblock, local
207 chunks = ALIGN(nports + 1, 16) / 16;
212 for (j = 0; j < chunks; j++) {

Completed in 240 milliseconds

123