/haiku-buildtools/gcc/gcc/testsuite/gcc.dg/gomp/ |
H A D | sharing-3.c | 9 int i, chunk; local 12 chunk = CHUNKSIZE; 13 #pragma omp parallel for shared (c, chunk) schedule (dynamic, chunk)
|
/haiku-buildtools/gcc/libgomp/testsuite/libgomp.c/ |
H A D | omp_workshare3.c | 22 int i, chunk, tid; local 28 chunk = CHUNKSIZE; 31 shared(a,b,c,chunk) \ 33 schedule(static,chunk)
|
H A D | omp_workshare1.c | 19 int nthreads, tid, i, chunk; local 25 chunk = CHUNKSIZE; 27 #pragma omp parallel shared(a,b,c,nthreads,chunk) private(i,tid) 37 #pragma omp for schedule(dynamic,chunk)
|
H A D | omp_workshare4.c | 21 int i, chunk, tid; local 28 chunk = CHUNKSIZE; 32 shared(a,b,c,chunk) \ 34 schedule(static,chunk) \
|
H A D | loop-2.c | 24 int n, i, c, thr, iter, chunk; local 26 chunk = CHUNK; 27 if (chunk == 0) 28 chunk = N / INCR / NTHR; 48 if (++c == chunk) 101 INCR = 1, CHUNK = 0; /* chunk = 360 / 5 = 72 */ 104 INCR = 4, CHUNK = 0; /* chunk = 360 / 4 / 5 = 18 */
|
/haiku-buildtools/gcc/gcc/testsuite/gcc.c-torture/compile/ |
H A D | 20120913-1.c | 9 struct dm_exception *dm_lookup_exception(struct list_head *table, unsigned long long chunk) { argument 15 if (chunk <= (e->new_chunk>>56))
|
H A D | cp.c | 11 struct _obstack_chunk* chunk; member in struct:obstack 32 register struct _obstack_chunk* chunk; local
|
/haiku-buildtools/legacy/binutils/libiberty/ |
H A D | objalloc.c | 56 /* This structure appears at the start of each chunk. */ 60 /* Next chunk. */ 62 /* If this chunk contains large objects, this is the value of 63 current_ptr when this chunk was allocated. If this chunk 74 /* We ask for this much memory each time we create a chunk which is to 89 struct objalloc_chunk *chunk; local 102 chunk = (struct objalloc_chunk *) ret->chunks; 103 chunk->next = NULL; 104 chunk 134 struct objalloc_chunk *chunk; local 150 struct objalloc_chunk *chunk; local [all...] |
H A D | obstack.c | 133 /* Initialize an obstack H for use. Specify chunk size SIZE (0 means default). 146 register struct _obstack_chunk *chunk; /* points to new chunk */ 173 chunk = h->chunk = CALL_CHUNKFUN (h, h -> chunk_size); 174 if (!chunk) 176 h->next_free = h->object_base = chunk->contents; 177 h->chunk_limit = chunk->limit 178 = (char *) chunk + h->chunk_size; 179 chunk 145 register struct _obstack_chunk *chunk; /* points to new chunk */ local 190 register struct _obstack_chunk *chunk; /* points to new chunk */ local [all...] |
/haiku-buildtools/legacy/gcc/libiberty/ |
H A D | objalloc.c | 51 /* This structure appears at the start of each chunk. */ 55 /* Next chunk. */ 57 /* If this chunk contains large objects, this is the value of 58 current_ptr when this chunk was allocated. If this chunk 69 /* We ask for this much memory each time we create a chunk which is to 84 struct objalloc_chunk *chunk; local 97 chunk = (struct objalloc_chunk *) ret->chunks; 98 chunk->next = NULL; 99 chunk 131 struct objalloc_chunk *chunk; local 147 struct objalloc_chunk *chunk; local [all...] |
H A D | obstack.c | 142 /* Initialize an obstack H for use. Specify chunk size SIZE (0 means default). 164 register struct _obstack_chunk *chunk; /* points to new chunk */ 196 chunk = h->chunk = CALL_CHUNKFUN (h, h -> chunk_size); 197 if (!chunk) 199 h->next_free = h->object_base = chunk->contents; 200 h->chunk_limit = chunk->limit 201 = (char *) chunk + h->chunk_size; 202 chunk 163 register struct _obstack_chunk *chunk; /* points to new chunk */ local 222 register struct _obstack_chunk *chunk; /* points to new chunk */ local [all...] |
/haiku-buildtools/gcc/libiberty/ |
H A D | objalloc.c | 56 /* This structure appears at the start of each chunk. */ 60 /* Next chunk. */ 62 /* If this chunk contains large objects, this is the value of 63 current_ptr when this chunk was allocated. If this chunk 74 /* We ask for this much memory each time we create a chunk which is to 89 struct objalloc_chunk *chunk; local 102 chunk = (struct objalloc_chunk *) ret->chunks; 103 chunk->next = NULL; 104 chunk 141 struct objalloc_chunk *chunk; local 157 struct objalloc_chunk *chunk; local [all...] |
H A D | obstack.c | 133 /* Initialize an obstack H for use. Specify chunk size SIZE (0 means default). 146 register struct _obstack_chunk *chunk; /* points to new chunk */ 173 chunk = h->chunk = CALL_CHUNKFUN (h, h -> chunk_size); 174 if (!chunk) 176 h->next_free = h->object_base = chunk->contents; 177 h->chunk_limit = chunk->limit 178 = (char *) chunk + h->chunk_size; 179 chunk 145 register struct _obstack_chunk *chunk; /* points to new chunk */ local 190 register struct _obstack_chunk *chunk; /* points to new chunk */ local [all...] |
/haiku-buildtools/binutils/libiberty/ |
H A D | objalloc.c | 56 /* This structure appears at the start of each chunk. */ 60 /* Next chunk. */ 62 /* If this chunk contains large objects, this is the value of 63 current_ptr when this chunk was allocated. If this chunk 74 /* We ask for this much memory each time we create a chunk which is to 89 struct objalloc_chunk *chunk; local 102 chunk = (struct objalloc_chunk *) ret->chunks; 103 chunk->next = NULL; 104 chunk 141 struct objalloc_chunk *chunk; local 157 struct objalloc_chunk *chunk; local [all...] |
H A D | obstack.c | 107 /* Initialize an obstack H for use. Specify chunk size SIZE (0 means default). 117 struct _obstack_chunk *chunk; /* points to new chunk */ local 141 chunk = (struct _obstack_chunk *) call_chunkfun (h, h->chunk_size); 142 if (!chunk) 144 h->chunk = chunk; 145 h->next_free = h->object_base = __PTR_ALIGN ((char *) chunk, chunk->contents, 147 h->chunk_limit = chunk [all...] |
/haiku-buildtools/gcc/libstdc++-v3/testsuite/27_io/basic_istream/extractors_character/char/ |
H A D | 4.cc | 50 char* chunk = new char[str.size()]; local 51 memset(chunk, 'X', str.size()); 56 while (stream >> chunk) 59 VERIFY( !str.compare(index, index_new - index, chunk) ); 62 memset(chunk, 'X', str.size()); 67 delete[] chunk;
|
/haiku-buildtools/gcc/libstdc++-v3/testsuite/27_io/basic_istream/extractors_character/wchar_t/ |
H A D | 4.cc | 53 wchar_t* chunk = new wchar_t[str.size()]; local 54 wmemset(chunk, L'X', str.size()); 59 while (stream >> chunk) 62 VERIFY( !str.compare(index, index_new - index, chunk) ); 65 wmemset(chunk, L'X', str.size()); 70 delete[] chunk;
|
/haiku-buildtools/gcc/libstdc++-v3/testsuite/performance/27_io/ |
H A D | filebuf_sgetn_unbuf.cc | 36 char* chunk = new char[chunksize]; local 52 if (fread(chunk, 1, chunksize, file) < chunksize) 64 if (fread_unlocked(chunk, 1, chunksize, file) < chunksize) 77 if (buf.sgetn(chunk, chunksize) < chunksize) 82 delete [] chunk;
|
H A D | filebuf_sputn_unbuf.cc | 35 char* chunk = new char[chunksize]; local 42 fwrite(chunk, 1, chunksize, file); 53 fwrite_unlocked(chunk, 1, chunksize, file); 65 buf.sputn(chunk, chunksize); 70 delete [] chunk;
|
/haiku-buildtools/gcc/libsanitizer/asan/ |
H A D | asan_debugging.cc | 49 AsanChunkView chunk = FindHeapChunkByAddress(addr); local 55 if (!chunk.IsValid()) { 60 descr->region_address = chunk.Beg(); 61 descr->region_size = chunk.UsedSize(); 84 AsanChunkView chunk = FindHeapChunkByAddress(addr); local 85 if (!chunk.IsValid()) return 0; 89 if (chunk.AllocTid() == kInvalidTid) return 0; 90 stack = chunk.GetAllocStack(); 91 if (thread_id) *thread_id = chunk.AllocTid(); 93 if (chunk [all...] |
H A D | asan_poisoning.cc | 42 u8 *chunk; member in struct:__asan::ShadowSegmentEndpoint 44 s8 value; // = *chunk; 47 chunk = (u8*)MemToShadow(address); 49 value = *chunk; 54 // Since asan's mapping is compacting, the shadow chunk may be 106 if (beg.chunk == end.chunk) { 114 *beg.chunk = Min(value, beg.offset); 116 *beg.chunk = kAsanUserPoisonedMemoryMagic; 121 CHECK(beg.chunk < en [all...] |
/haiku-buildtools/gcc/gcc/testsuite/go.test/test/ |
H A D | init1.go | 20 const chunk = 1 << 20 24 b := make([]byte, chunk) 34 if sys1-sys > chunk*50 { 35 println("allocated 1000 chunks of", chunk, "and used ", sys1-sys, "memory")
|
/haiku-buildtools/gcc/libgomp/ |
H A D | iter.c | 116 /* Initial guess is a C sized chunk positioned nthreads iterations 152 long start, end, chunk, left; local 158 chunk = ws->chunk_size; 162 if (chunk < left) 163 chunk = left; 167 if (chunk > left) 168 chunk = left; 170 end = start + chunk; 188 long start, end, nend, chunk, incr; local 192 chunk [all...] |
/haiku-buildtools/gcc/libsanitizer/lsan/ |
H A D | lsan_allocator.cc | 140 uptr chunk = reinterpret_cast<uptr>(allocator.GetBlockBeginFastLocked(p)); local 141 if (!chunk) return 0; 142 // LargeMmapAllocator considers pointers to the meta-region of a chunk to be 144 if (addr < chunk) return 0; 145 ChunkMetadata *m = Metadata(reinterpret_cast<void *>(chunk)); 149 if (addr < chunk + m->requested_size) 150 return chunk; 151 if (IsSpecialCaseOfOperatorNew0(chunk, m->requested_size, addr)) 152 return chunk; 156 uptr GetUserBegin(uptr chunk) { argument 160 LsanMetadata(uptr chunk) argument 190 void *chunk = allocator.GetBlockBegin(p); local [all...] |
/haiku-buildtools/gcc/gmp/ |
H A D | tal-notreent.c | 56 void *chunk; local 61 /* Allocate a chunk that makes the total current allocation somewhat 81 chunk = (*__gmp_allocate_func) (chunk_size); 82 header = (tmp_stack *) chunk; 83 header->end = (char *) chunk + chunk_size; 84 header->alloc_point = (char *) chunk + HSIZ;
|