/haiku-buildtools/gcc/libgomp/testsuite/libgomp.c/ |
H A D | ordered-2.c | 13 static int CHUNK, NTHR; variable 31 if (GOMP_loop_ordered_##sched##_start (0, N, 1, CHUNK, &s0, &e0)) \ 69 CHUNK = 1; 72 CHUNK = 5; 75 CHUNK = 7; 78 CHUNK = 0;
|
H A D | loop-1.c | 13 static int S, E, INCR, CHUNK, NTHR; variable 52 if (GOMP_loop_##sched##_start (S, E, INCR, CHUNK, &s0, &e0)) \ 90 (f_##sched##_2, NULL, NTHR, S, E, INCR, CHUNK); \ 116 S = 0, E = N, INCR = 1, CHUNK = 4; 119 S = 0, E = N, INCR = 2, CHUNK = 4; 122 S = 1, E = N-1, INCR = 1, CHUNK = 5; 125 S = 1, E = N-1, INCR = 2, CHUNK = 5; 128 S = 2, E = 4, INCR = 1, CHUNK = 1; 131 S = 0, E = N, INCR = 1, CHUNK = 0; 135 S = 1, E = N-1, INCR = 1, CHUNK [all...] |
H A D | ordered-1.c | 15 static int S, E, INCR, CHUNK, NTHR; variable 54 if (GOMP_loop_ordered_##sched##_start (S, E, INCR, CHUNK, &s0, &e0)) \ 89 S = 0, E = N, INCR = 1, CHUNK = 4; 92 S = 0, E = N, INCR = 2, CHUNK = 4; 95 S = 1, E = N-1, INCR = 1, CHUNK = 5; 98 S = 1, E = N-1, INCR = 2, CHUNK = 5; 101 S = 2, E = 4, INCR = 1, CHUNK = 1; 104 S = 0, E = N, INCR = 1, CHUNK = 0; 107 S = 1, E = N-1, INCR = 1, CHUNK = 0; 111 S = 1, E = 9, INCR = 1, CHUNK [all...] |
H A D | loop-2.c | 15 static int INCR, NTHR, CHUNK; variable 26 chunk = CHUNK; 75 if (GOMP_loop_static_start (0, N, INCR, CHUNK, &s0, &e0)) 101 INCR = 1, CHUNK = 0; /* chunk = 360 / 5 = 72 */ 104 INCR = 4, CHUNK = 0; /* chunk = 360 / 4 / 5 = 18 */ 107 INCR = 1, CHUNK = 4; /* 1 * 4 * 5 = 20 -> 360 / 20 = 18 iterations. */ 110 INCR = 3, CHUNK = 4; /* 3 * 4 * 5 = 60 -> 360 / 60 = 6 iterations. */
|
/haiku-buildtools/gcc/libgomp/testsuite/libgomp.fortran/ |
H A D | omp_workshare1.f | 6 C across the team of threads. A thread will perform CHUNK iterations 7 C at a time before being scheduled for the next CHUNK of work. 15 + OMP_GET_THREAD_NUM, N, CHUNKSIZE, CHUNK, I variable in program:WORKSHARE1 25 CHUNK = CHUNKSIZE 27 !$OMP PARALLEL SHARED(A,B,C,NTHREADS,CHUNK) PRIVATE(I,TID) 36 !$OMP DO SCHEDULE(DYNAMIC,CHUNK)
|
/haiku-buildtools/gcc/zlib/examples/ |
H A D | zpipe.c | 28 #define CHUNK 16384 macro 41 unsigned char in[CHUNK]; 42 unsigned char out[CHUNK]; 54 strm.avail_in = fread(in, 1, CHUNK, source); 65 strm.avail_out = CHUNK; 69 have = CHUNK - strm.avail_out; 97 unsigned char in[CHUNK]; 98 unsigned char out[CHUNK]; 112 strm.avail_in = fread(in, 1, CHUNK, source); 123 strm.avail_out = CHUNK; [all...] |
H A D | gzjoin.c | 74 #define CHUNK 32768 /* must be a power of two and fit in unsigned */ macro 82 unsigned char *buf; /* allocated buffer of length CHUNK */ 106 in->buf = malloc(CHUNK); 130 len = (long)read(in->fd, in->buf + in->left, CHUNK - in->left); 134 } while (len != 0 && in->left < CHUNK); 173 /* seek past multiples of CHUNK bytes */ 174 if (skip > CHUNK) { 177 left = skip & (CHUNK - 1); 298 junk = malloc(CHUNK); 326 strm.avail_out = CHUNK; [all...] |
H A D | zran.c | 59 #define CHUNK 16384 /* file input buffer size */ macro 146 unsigned char input[CHUNK]; 167 strm.avail_in = fread(input, 1, CHUNK, in); 250 unsigned char input[CHUNK]; 310 strm.avail_in = fread(input, 1, CHUNK, in); 355 unsigned char buf[CHUNK]; 391 len = extract(in, index, offset, buf, CHUNK);
|
H A D | gzappend.c | 87 #define CHUNK (1U << LGCHUNK) macro 270 gz.buf = malloc(CHUNK); 402 in = fd == -1 ? NULL : malloc(CHUNK); 403 out = malloc(CHUNK); 409 len = fd == -1 ? 0 : read(fd, in, CHUNK); 422 strm->avail_out = CHUNK; 425 left = CHUNK - strm->avail_out; 427 len = write(gd, out + CHUNK - strm->avail_out - left, left);
|
/haiku-buildtools/binutils/zlib/examples/ |
H A D | zpipe.c | 28 #define CHUNK 16384 macro 41 unsigned char in[CHUNK]; 42 unsigned char out[CHUNK]; 54 strm.avail_in = fread(in, 1, CHUNK, source); 65 strm.avail_out = CHUNK; 69 have = CHUNK - strm.avail_out; 97 unsigned char in[CHUNK]; 98 unsigned char out[CHUNK]; 112 strm.avail_in = fread(in, 1, CHUNK, source); 123 strm.avail_out = CHUNK; [all...] |
H A D | gzjoin.c | 75 #define CHUNK 32768 /* must be a power of two and fit in unsigned */ macro 83 unsigned char *buf; /* allocated buffer of length CHUNK */ 107 in->buf = malloc(CHUNK); 131 len = (long)read(in->fd, in->buf + in->left, CHUNK - in->left); 135 } while (len != 0 && in->left < CHUNK); 174 /* seek past multiples of CHUNK bytes */ 175 if (skip > CHUNK) { 178 left = skip & (CHUNK - 1); 299 junk = malloc(CHUNK); 327 strm.avail_out = CHUNK; [all...] |
H A D | zran.c | 64 #define CHUNK 16384 /* file input buffer size */ macro 151 unsigned char input[CHUNK]; 172 strm.avail_in = fread(input, 1, CHUNK, in); 255 unsigned char input[CHUNK]; 315 strm.avail_in = fread(input, 1, CHUNK, in); 360 unsigned char buf[CHUNK]; 396 len = extract(in, index, offset, buf, CHUNK);
|
H A D | gzappend.c | 89 #define CHUNK (1U << LGCHUNK) macro 272 gz.buf = malloc(CHUNK); 404 in = malloc(CHUNK); 405 out = malloc(CHUNK); 411 len = read(fd, in, CHUNK); 424 strm->avail_out = CHUNK; 427 left = CHUNK - strm->avail_out; 429 len = write(gd, out + CHUNK - strm->avail_out - left, left);
|
/haiku-buildtools/gcc/gcc/testsuite/gcc.c-torture/execute/ |
H A D | multi-ix.c | 18 * 40 int[CHUNK] arrays; 30 #define CHUNK \ macro 34 #define CHUNK 500 macro 41 typedef int l[CHUNK]; 156 /* CHUNK needs to be at least 40 to avoid stack corruption, 158 if (CHUNK < 40)
|
/haiku-buildtools/gcc/zlib/contrib/blast/ |
H A D | blast.c | 412 #define CHUNK 16384 macro 416 static unsigned char hold[CHUNK]; 419 return fread(hold, 1, CHUNK, (FILE *)how);
|
/haiku-buildtools/binutils/zlib/contrib/blast/ |
H A D | blast.c | 414 #define CHUNK 16384 macro 418 static unsigned char hold[CHUNK]; 421 return fread(hold, 1, CHUNK, (FILE *)how);
|
/haiku-buildtools/legacy/binutils/bfd/ |
H A D | ihex.c | 129 #define CHUNK 16 macro 720 char buf[9 + CHUNK * 2 + 4]; 781 if (count > CHUNK) 782 now = CHUNK;
|
H A D | tekhex.c | 232 #define CHUNK 21 macro
|
/haiku-buildtools/binutils/bfd/ |
H A D | ihex.c | 130 #define CHUNK 16 macro 728 char buf[9 + CHUNK * 2 + 4]; 789 if (count > CHUNK) 790 now = CHUNK;
|
H A D | tekhex.c | 233 #define CHUNK 21 macro
|