Searched refs:chunk (Results 26 - 50 of 80) sorted by relevance

1234

/haiku-buildtools/gcc/libgomp/
H A Diter_ull.c118 /* Initial guess is a C sized chunk positioned nthreads iterations
154 gomp_ull start, end, chunk, left; local
160 chunk = ws->chunk_size_ull;
164 if (chunk < left)
165 chunk = left;
169 if (chunk > left)
170 chunk = left;
172 end = start + chunk;
190 gomp_ull start, end, nend, chunk; local
193 chunk
[all...]
/haiku-buildtools/binutils/ld/testsuite/ld-mmix/
H A Dsec-8m.d10 # bug. When one input-section (seen in mmo.c as a chunk of data to
12 # to be concatenated with the next chunk. If it was followed by a chunk
16 # first chunk.
H A Dsec-7m.d13 # exceeded the "chunk size" (32768), would get to-4-padding
14 # inserted at each chunk division. Also check that section
/haiku-buildtools/legacy/binutils/ld/testsuite/ld-mmix/
H A Dsec-8m.d10 # bug. When one input-section (seen in mmo.c as a chunk of data to
12 # to be concatenated with the next chunk. If it was followed by a chunk
16 # first chunk.
H A Dsec-7m.d13 # exceeded the "chunk size" (32768), would get to-4-padding
14 # inserted at each chunk division. Also check that section
/haiku-buildtools/gcc/libstdc++-v3/testsuite/21_strings/basic_string/inserters_extractors/char/
H A D11.cc47 string chunk; local
51 while (stream >> chunk)
54 VERIFY( !str.compare(index, index_new - index, chunk) );
H A D10.cc47 string chunk; local
51 while (getline(stream, chunk, delim))
54 VERIFY( !str.compare(index, index_new - index, chunk) );
/haiku-buildtools/gcc/libstdc++-v3/testsuite/21_strings/basic_string/inserters_extractors/wchar_t/
H A D11.cc51 wstring chunk; local
55 while (stream >> chunk)
58 VERIFY( !str.compare(index, index_new - index, chunk) );
H A D10.cc51 wstring chunk; local
55 while (getline(stream, chunk, delim))
58 VERIFY( !str.compare(index, index_new - index, chunk) );
/haiku-buildtools/gcc/libsanitizer/lsan/
H A Dlsan_common_linux.cc109 static void ProcessPlatformSpecificAllocationsCb(uptr chunk, void *arg) { argument
113 chunk = GetUserBegin(chunk);
114 LsanMetadata m(chunk);
120 // If caller_pc is unknown, this chunk may be allocated in a coroutine. Mark
124 param->frontier->push_back(chunk);
H A Dlsan_common.cc167 uptr chunk = PointsIntoChunk(p); local
168 if (!chunk) continue;
170 if (chunk == begin) continue;
171 LsanMetadata m(chunk);
179 "%p is poisoned: ignoring %p pointing into chunk %p-%p of size "
181 pp, p, chunk, chunk + m.requested_size(), m.requested_size());
186 LOG_POINTERS("%p: found %p pointing into chunk %p-%p of size %zu.\n", pp, p,
187 chunk, chunk
308 MarkIndirectlyLeakedCb(uptr chunk, void *arg) argument
319 CollectIgnoredCb(uptr chunk, void *arg) argument
361 CollectLeaksCb(uptr chunk, void *arg) argument
503 AddLeakedChunk(uptr chunk, u32 stack_trace_id, uptr leaked_size, ChunkTag tag) argument
[all...]
H A Dlsan_common.h97 void AddLeakedChunk(uptr chunk, u32 stack_trace_id, uptr leaked_size,
138 // to the end of allocated chunk.
170 // If p points into a chunk that has been allocated to the user, returns its
173 // Returns address of user-visible chunk contained in this allocator chunk.
174 uptr GetUserBegin(uptr chunk);
177 // Wrapper for chunk metadata operations.
180 // Constructor accepts address of user-visible chunk.
181 explicit LsanMetadata(uptr chunk);
/haiku-buildtools/gcc/gcc/testsuite/gcc.c-torture/execute/
H A D20001203-2.c4 struct _obstack_chunk *chunk; member in struct:obstack
81 if (__o1->next_free - (char *)__o1->chunk
82 > __o1->chunk_limit - (char *)__o1->chunk)
/haiku-buildtools/legacy/binutils/include/
H A Dobstack.h68 The way we do this is to take a large chunk, allocating memory from
69 low addresses. When you want to build a symbol in the chunk you just
70 add chars above the current "high water mark" in the chunk. When you
73 Mostly the chars will not burst over the highest address of the chunk,
74 because you would typically expect a chunk to be (say) 100 times as
84 When the chars burst over a chunk boundary, we allocate a larger
85 chunk, and then copy the partly formed object from the end of the old
86 chunk to the beginning of the new larger chunk. We then carry on
95 We carve out one object at a time from the current chunk
167 struct _obstack_chunk *chunk; /* address of current struct obstack_chunk */ member in struct:obstack
[all...]
/haiku-buildtools/gcc/include/
H A Dobstack.h68 The way we do this is to take a large chunk, allocating memory from
69 low addresses. When you want to build a symbol in the chunk you just
70 add chars above the current "high water mark" in the chunk. When you
73 Mostly the chars will not burst over the highest address of the chunk,
74 because you would typically expect a chunk to be (say) 100 times as
84 When the chars burst over a chunk boundary, we allocate a larger
85 chunk, and then copy the partly formed object from the end of the old
86 chunk to the beginning of the new larger chunk. We then carry on
95 We carve out one object at a time from the current chunk
167 struct _obstack_chunk *chunk; /* address of current struct obstack_chunk */ member in struct:obstack
[all...]
/haiku-buildtools/gcc/zlib/examples/
H A Dgun.c174 if (chunk > have) { \
175 chunk -= have; \
179 chunk--; \
180 if (chunk > have) { \
181 chunk = have = 0; \
185 have -= chunk; \
186 next += chunk; \
187 chunk = 0; \
203 unsigned chunk; /* bytes left in current chunk */ local
[all...]
/haiku-buildtools/binutils/zlib/examples/
H A Dgun.c175 if (chunk > have) { \
176 chunk -= have; \
180 chunk--; \
181 if (chunk > have) { \
182 chunk = have = 0; \
186 have -= chunk; \
187 next += chunk; \
188 chunk = 0; \
204 unsigned chunk; /* bytes left in current chunk */ local
[all...]
/haiku-buildtools/binutils/include/
H A Dobstack.h62 The way we do this is to take a large chunk, allocating memory from
63 low addresses. When you want to build a symbol in the chunk you just
64 add chars above the current "high water mark" in the chunk. When you
67 Mostly the chars will not burst over the highest address of the chunk,
68 because you would typically expect a chunk to be (say) 100 times as
78 When the chars burst over a chunk boundary, we allocate a larger
79 chunk, and then copy the partly formed object from the end of the old
80 chunk to the beginning of the new larger chunk. We then carry on
89 We carve out one object at a time from the current chunk
166 struct _obstack_chunk *chunk; /* address of current struct obstack_chunk */ member in struct:obstack
[all...]
/haiku-buildtools/legacy/gcc/include/
H A Dobstack.h66 The way we do this is to take a large chunk, allocating memory from
67 low addresses. When you want to build a symbol in the chunk you just
68 add chars above the current "high water mark" in the chunk. When you
71 Mostly the chars will not burst over the highest address of the chunk,
72 because you would typically expect a chunk to be (say) 100 times as
82 When the chars burst over a chunk boundary, we allocate a larger
83 chunk, and then copy the partly formed object from the end of the old
84 chunk to the beginning of the new larger chunk. We then carry on
93 We carve out one object at a time from the current chunk
165 struct _obstack_chunk *chunk; /* address of current struct obstack_chunk */ member in struct:obstack
[all...]
/haiku-buildtools/gcc/gcc/testsuite/gcc.c-torture/compile/
H A D20010102-1.c19 struct _obstack_chunk *chunk; member in struct:obstack
63 register struct _obstack_chunk *old_chunk = h->chunk;
75 h->chunk = new_chunk;
/haiku-buildtools/legacy/gcc/gcc/java/
H A Djcf-write.c84 /* A chunk or segment of a .class file. */
86 struct chunk struct
89 struct chunk *next;
136 struct chunk *chunk; member in union:jcf_block::__anon3419
220 struct chunk *first;
221 struct chunk *chunk; member in struct:jcf_partial
276 static struct chunk * alloc_chunk PROTO ((struct chunk *, unsigne
341 struct chunk *chunk = (struct chunk *) local
2548 struct chunk *chunk = block->v.chunk; local
[all...]
/haiku-buildtools/gcc/libsanitizer/asan/
H A Dasan_report.cc481 static void DescribeAccessToHeapChunk(AsanChunkView chunk, uptr addr,
487 if (chunk.AddrIsAtLeft(addr, access_size, &offset)) {
489 } else if (chunk.AddrIsAtRight(addr, access_size, &offset)) {
495 } else if (chunk.AddrIsInside(addr, access_size, &offset)) {
501 str.append(" %zu-byte region [%p,%p)\n", chunk.UsedSize(),
502 (void *)(chunk.Beg()), (void *)(chunk.End()));
508 AsanChunkView chunk = FindHeapChunkByAddress(addr);
509 if (!chunk.IsValid()) {
514 DescribeAccessToHeapChunk(chunk, add
[all...]
/haiku-buildtools/jam/
H A Dmake1.c433 int start, chunk, length, maxline; local
500 chunk = length = list_length( ns );
510 list_sublist( ns, start, chunk ),
521 start += chunk;
523 else if( ( ruleFlags & RULE_PIECEMEAL ) && chunk > 1 )
525 /* Reduce chunk size slowly. */
527 chunk = chunk * 9 / 10;
/haiku-buildtools/legacy/gcc/texinfo/info/
H A Dfilesys.c474 char *chunk; local
477 chunk = (char *)xmalloc (FILESYS_PIPE_BUFFER_SIZE);
483 bytes_read = fread (chunk, 1, FILESYS_PIPE_BUFFER_SIZE, stream);
489 memcpy (contents + offset, chunk, bytes_read);
495 free (chunk);
/haiku-buildtools/gcc/gcc/testsuite/gcc.target/aarch64/advsimd-intrinsics/
H A Dvshuffle.inc15 macro enables to move another chunk of data from result_bis to
128 CHECK_RESULTS_NAMED (TEST_MSG, expected0, "(chunk 0)");
131 CHECK_RESULTS_NAMED (TEST_MSG, expected1, "(chunk 1)");

Completed in 209 milliseconds

1234