/haiku-buildtools/gcc/gcc/testsuite/gcc.dg/cpp/ |
H A D | maccom4.c | 16 { dg-final { scan-file maccom4.i "p+assed" } }
|
H A D | maccom5.c | 16 { dg-final { scan-file maccom5.i "p+assed" } } 17 { dg-final { scan-file-not maccom5.i "p+assed:" } }
|
/haiku-buildtools/gcc/gcc/testsuite/gcc.dg/cpp/trad/ |
H A D | maccom4.c | 16 { dg-final { scan-file maccom4.i "p+assed" } }
|
/haiku-buildtools/gcc/gcc/testsuite/gcc.dg/debug/ |
H A D | pr45849.c | 11 char *scan; local 26 for (scan = text; scan != rp; scan++)
|
/haiku-buildtools/gcc/gcc/testsuite/gcc.dg/ |
H A D | pr47381-1.c | 12 register uch *scan = window + strstart; local 14 register uch scan_end1 = scan[best_len-1]; 15 register uch scan_end = scan[best_len]; 21 *match != *scan || 22 *++match != scan[1]) continue;
|
/haiku-buildtools/gcc/gcc/testsuite/gfortran.dg/goacc/ |
H A D | kernels-tree.f95 | 15 ! { dg-final { scan-tree-dump-times "pragma acc kernels" 1 "original" } } 17 ! { dg-final { scan-tree-dump-times "if" 1 "original" } } 18 ! { dg-final { scan-tree-dump-times "async" 1 "original" } } 20 ! { dg-final { scan-tree-dump-times "map\\(force_tofrom:i\\)" 1 "original" } } 21 ! { dg-final { scan-tree-dump-times "map\\(force_to:j\\)" 1 "original" } } 22 ! { dg-final { scan-tree-dump-times "map\\(force_from:k\\)" 1 "original" } } 23 ! { dg-final { scan-tree-dump-times "map\\(force_alloc:m\\)" 1 "original" } } 25 ! { dg-final { scan-tree-dump-times "map\\(force_present:o\\)" 1 "original" } } 26 ! { dg-final { scan-tree-dump-times "map\\(tofrom:p\\)" 1 "original" } } 27 ! { dg-final { scan [all...] |
H A D | parallel-tree.f95 | 18 ! { dg-final { scan-tree-dump-times "pragma acc parallel" 1 "original" } } 20 ! { dg-final { scan-tree-dump-times "if" 1 "original" } } 21 ! { dg-final { scan-tree-dump-times "async" 1 "original" } } 22 ! { dg-final { scan-tree-dump-times "num_gangs" 1 "original" } } 23 ! { dg-final { scan-tree-dump-times "num_workers" 1 "original" } } 24 ! { dg-final { scan-tree-dump-times "vector_length" 1 "original" } } 26 ! { dg-final { scan-tree-dump-times "reduction\\(max:q\\)" 1 "original" } } 27 ! { dg-final { scan-tree-dump-times "map\\(force_tofrom:i\\)" 1 "original" } } 28 ! { dg-final { scan-tree-dump-times "map\\(force_to:j\\)" 1 "original" } } 29 ! { dg-final { scan [all...] |
H A D | data-tree.f95 | 15 ! { dg-final { scan-tree-dump-times "pragma acc data" 1 "original" } } 17 ! { dg-final { scan-tree-dump-times "if" 1 "original" } } 18 ! { dg-final { scan-tree-dump-times "map\\(force_tofrom:i\\)" 1 "original" } } 19 ! { dg-final { scan-tree-dump-times "map\\(force_to:j\\)" 1 "original" } } 20 ! { dg-final { scan-tree-dump-times "map\\(force_from:k\\)" 1 "original" } } 21 ! { dg-final { scan-tree-dump-times "map\\(force_alloc:m\\)" 1 "original" } } 23 ! { dg-final { scan-tree-dump-times "map\\(force_present:o\\)" 1 "original" } } 24 ! { dg-final { scan-tree-dump-times "map\\(tofrom:p\\)" 1 "original" } } 25 ! { dg-final { scan-tree-dump-times "map\\(to:r\\)" 1 "original" } } 26 ! { dg-final { scan [all...] |
H A D | private-1.f95 | 34 ! { dg-final { scan-tree-dump-times "pragma omp target oacc_parallel" 3 "omplower" } } 35 ! { dg-final { scan-tree-dump-times "private\\(i\\)" 3 "omplower" } } 36 ! { dg-final { scan-tree-dump-times "private\\(j\\)" 2 "omplower" } } 37 ! { dg-final { scan-tree-dump-times "private\\(k\\)" 1 "omplower" } }
|
H A D | acc_on_device-1.f95 | 20 ! { dg-final { scan-rtl-dump-times "\\\(call \[^\\n\]* acc_on_device" 4 "expand" } }
|
H A D | declare-1.f95 | 19 ! { dg-final { scan-tree-dump-times "pragma acc declare map\\(force_tofrom:i\\)" 2 "original" } }
|
H A D | host_data-tree.f95 | 12 ! { dg-final { scan-tree-dump-times "pragma acc host_data use_device\\(i\\)" 1 "original" } }
|
/haiku-buildtools/gcc/gcc/testsuite/gcc.dg/graphite/ |
H A D | scop-15.c | 25 register uch *scan = window + strstart; local 31 register uch scan_end = scan[best_len]; 36 *++match != scan[1]) continue; 38 } while (*++scan == *++match && *++scan == *++match && 39 scan < strend); 40 len = MAX_MATCH - (int)(strend - scan); 50 /* { dg-final { scan-tree-dump-times "number of SCoPs: 0" 1 "graphite"} } */
|
/haiku-buildtools/jam/ |
H A D | regexp.c | 173 static char *regparse; /* Input-scan pointer. */ 218 register char *scan; local 260 scan = r->program+1; /* First BRANCH. */ 261 if (OP(regnext(scan)) == END) { /* Only one top-level choice. */ 262 scan = OPERAND(scan); 265 if (OP(scan) == EXACTLY) 266 r->regstart = *OPERAND(scan); 267 else if (OP(scan) == BOL) 281 for (; scan ! 726 register char *scan; local 894 register char *scan; /* Current node. */ local 1096 register const char *scan; local [all...] |
/haiku-buildtools/gcc/gcc/testsuite/go.test/test/ |
H A D | turing.go | 18 func scan(dir int) { func 45 scan(1) 49 scan(-1)
|
/haiku-buildtools/legacy/gcc/libio/ |
H A D | sbscan.cc | 38 int streambuf::scan(char const *format ...) function in class:streambuf
|
H A D | isscan.cc | 29 istream& istream::scan(const char *format ...) function in class:istream
|
/haiku-buildtools/gcc/gmp/scanf/ |
H A D | sscanffuns.c | 32 scan (const char **sp, const char *fmt, ...) 45 scan (const char **sp, const char *fmt, ...) function 109 (gmp_doscan_scan_t) scan,
|
/haiku-buildtools/legacy/binutils/libiberty/ |
H A D | argv.c | 110 register char **scan; local 114 for (scan = vector; *scan != NULL; scan++) 116 free (*scan);
|
/haiku-buildtools/legacy/gcc/libiberty/ |
H A D | argv.c | 154 register char **scan; local 158 for (scan = vector; *scan != NULL; scan++) 160 free (*scan);
|
/haiku-buildtools/gcc/zlib/ |
H A D | deflate.c | 1151 register Bytef *scan = s->window + s->strstart; /* current string */ local 1169 register ush scan_start = *(ushf*)scan; 1170 register ush scan_end = *(ushf*)(scan+best_len-1); 1173 register Byte scan_end1 = scan[best_len-1]; 1174 register Byte scan_end = scan[best_len]; 1212 /* It is not necessary to compare scan[2] and match[2] since they are 1221 Assert(scan[2] == match[2], "scan[2]?"); 1222 scan++, match++; 1224 } while (*(ushf*)(scan 1299 register Bytef *scan = s->window + s->strstart; /* current string */ local 1865 Bytef *scan, *strend; /* scan goes up to strend for length of run */ local [all...] |
/haiku-buildtools/binutils/zlib/ |
H A D | deflate.c | 1153 register Bytef *scan = s->window + s->strstart; /* current string */ local 1171 register ush scan_start = *(ushf*)scan; 1172 register ush scan_end = *(ushf*)(scan+best_len-1); 1175 register Byte scan_end1 = scan[best_len-1]; 1176 register Byte scan_end = scan[best_len]; 1214 /* It is not necessary to compare scan[2] and match[2] since they are 1223 Assert(scan[2] == match[2], "scan[2]?"); 1224 scan++, match++; 1226 } while (*(ushf*)(scan 1301 register Bytef *scan = s->window + s->strstart; /* current string */ local 1867 Bytef *scan, *strend; /* scan goes up to strend for length of run */ local [all...] |
/haiku-buildtools/binutils/bfd/ |
H A D | cpu-aarch64.c | 78 scan (const struct bfd_arch_info *info, const char *string) function 105 "aarch64", PRINT, 4, DEFAULT, compatible, scan, \
|
/haiku-buildtools/gcc/libiberty/ |
H A D | argv.c | 103 register char **scan; local 107 for (scan = vector; *scan != NULL; scan++) 109 free (*scan);
|
/haiku-buildtools/binutils/libiberty/ |
H A D | argv.c | 106 register char **scan; local 110 for (scan = vector; *scan != NULL; scan++) 112 free (*scan);
|