| /haiku-buildtools/gcc/gcc/testsuite/gcc.dg/ |
| H A D | pr47381-1.c | 9 int longest_match(IPos cur_match, int len, int best_len) argument
14 register uch scan_end1 = scan[best_len-1];
15 register uch scan_end = scan[best_len];
19 if (match[best_len] != scan_end ||
20 match[best_len-1] != scan_end1 ||
23 best_len = len;
25 return best_len;
|
| /haiku-buildtools/gcc/gcc/testsuite/gcc.dg/graphite/ |
| H A D | scop-15.c | 28 int best_len = prev_length; local
31 register uch scan_end = scan[best_len];
35 if (match[best_len] != scan_end ||
41 if (len > best_len) {
42 best_len = len;
47 return best_len;
|
| /haiku-buildtools/legacy/binutils/opcodes/ |
| H A D | or32-opc.c | 492 unsigned int best_len = 0; local
527 for (len = best_len + 1; len < MIN (MAX_LEN, 33 - i); len++)
537 best_len = len;
548 if (!best_len)
561 (long)(cur - automata), best_len, best_first, ninstr);
565 *cur = (1 << best_len) - 1;
570 cur += 1 << best_len;
571 cur_mask = (1 << (unsigned long) best_len) - 1;
573 for (i = 0; i < ((unsigned) 1 << best_len); i++)
|
| /haiku-buildtools/gcc/zlib/ |
| H A D | deflate.c | 1154 int best_len = s->prev_length; /* best match length so far */ local
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];
1209 if (*(ushf*)(match+best_len-1) != scan_end ||
1240 if (match[best_len] != scan_end ||
1241 match[best_len-1] != scan_end1 ||
1245 /* The check at best_len-1 can be removed because it will be made
1271 if (len > best_len) {
1273 best_len
[all...] |
| /haiku-buildtools/binutils/zlib/ |
| H A D | deflate.c | 1156 int best_len = s->prev_length; /* best match length so far */ local
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];
1211 if (*(ushf*)(match+best_len-1) != scan_end ||
1242 if (match[best_len] != scan_end ||
1243 match[best_len-1] != scan_end1 ||
1247 /* The check at best_len-1 can be removed because it will be made
1273 if (len > best_len) {
1275 best_len
[all...] |
| /haiku-buildtools/gcc/zlib/contrib/masmx86/ |
| H A D | match686.asm | 53 best_len equ dword ptr [esp+NbStack-36]
define
277 ;;; int best_len = s->prev_length;
282 ;;; Store the sum of s->window + best_len in esi locally, and in esi.
288 ;;; register ush scan_end = *(ushf*)(scan+best_len-1);
306 ;;; if (*(ushf*)(match+best_len-1) != scan_end ||
411 ;;; best_len = len;
413 ;;; scan_end = *(ushf*)(scan+best_len-1);
435 ;;; if ((uInt)best_len <= s->lookahead) return (uInt)best_len;
|
| /haiku-buildtools/binutils/zlib/contrib/masmx86/ |
| H A D | match686.asm | 53 best_len equ dword ptr [esp+NbStack-36]
define
277 ;;; int best_len = s->prev_length;
282 ;;; Store the sum of s->window + best_len in esi locally, and in esi.
288 ;;; register ush scan_end = *(ushf*)(scan+best_len-1);
306 ;;; if (*(ushf*)(match+best_len-1) != scan_end ||
411 ;;; best_len = len;
413 ;;; scan_end = *(ushf*)(scan+best_len-1);
435 ;;; if ((uInt)best_len <= s->lookahead) return (uInt)best_len;
|
| /haiku-buildtools/gcc/zlib/contrib/masmx64/ |
| H A D | gvmat64.asm | 297 ;;; int best_len = s->prev_length;
300 ;;; Store the sum of s->window + best_len in esi locally, and in esi.
305 ;;; register ush scan_end = *(ushf*)(scan+best_len-1);
364 ;;; if (*(ushf*)(match+best_len-1) != scan_end ||
493 ;;; best_len = len;
495 ;;; scan_end = *(ushf*)(scan+best_len-1);
516 ;;; if ((uInt)best_len <= s->lookahead) return (uInt)best_len;
|
| /haiku-buildtools/binutils/zlib/contrib/masmx64/ |
| H A D | gvmat64.asm | 297 ;;; int best_len = s->prev_length;
300 ;;; Store the sum of s->window + best_len in esi locally, and in esi.
305 ;;; register ush scan_end = *(ushf*)(scan+best_len-1);
364 ;;; if (*(ushf*)(match+best_len-1) != scan_end ||
493 ;;; best_len = len;
495 ;;; scan_end = *(ushf*)(scan+best_len-1);
516 ;;; if ((uInt)best_len <= s->lookahead) return (uInt)best_len;
|
| /haiku-buildtools/gcc/gcc/ |
| H A D | bb-reorder.c | 1029 connect_better_edge_p (const_edge e, bool src_index_p, int best_len,
1058 else if (traces[bbd[e_index].end_of_trace].length > best_len)
1075 else if (traces[bbd[e_index].start_of_trace].length > best_len)
1124 int best_len;
1152 best_len = 0;
1163 && connect_better_edge_p (e, true, best_len, best, traces))
1166 best_len = traces[bbd[si].end_of_trace].length;
1195 best_len = 0;
1206 && connect_better_edge_p (e, false, best_len, best, traces))
1209 best_len
1028 connect_better_edge_p(const_edge e, bool src_index_p, int best_len, const_edge cur_best_edge, struct trace *traces) argument
1123 int best_len; local
[all...] |
| /haiku-buildtools/legacy/gcc/gcc/config/sh/ |
| H A D | sh.c | 1270 int best_right = 0, best_len = 0;
1311 best_len = cost;
1331 best_len = cost;
1351 best_len = cost - 1;
1367 best_len = cost - 1 - ! CONST_OK_FOR_I (mask >> i);
1374 attrp[1] = best_len;
1265 int best_right = 0, best_len = 0; local
|
| /haiku-buildtools/gcc/gcc/config/sh/ |
| H A D | sh.c | 4159 int best_right = 0, best_len = 0;
4202 best_len = cost;
4224 best_len = cost;
4244 best_len = cost - 1;
4262 best_len = cost - 1 - ! CONST_OK_FOR_I08 (mask >> i);
4269 attrp[1] = best_len;
4150 int best_right = 0, best_len = 0; local
|