| /haiku-buildtools/gcc/gcc/testsuite/g++.dg/cpp0x/ |
| H A D | constexpr-46420.C | 8 A drop=A(); local
|
| /haiku-buildtools/gcc/zlib/ |
| H A D | inftrees.c | 45 unsigned drop; /* code bits to drop for sub-table */ local
152 with length len. That code is converted to an index by dropping drop
153 bits off of the bottom. For codes where len is less than drop + curr,
154 those top drop + curr - len bits are incremented through all values to
160 new sub-table should be started. drop is zero when the root table is
161 being filled, and drop is root when sub-tables are being filled.
205 drop = 0; /* current bits to drop from code for index */
218 here.bits = (unsigned char)(len - drop);
[all...] |
| /haiku-buildtools/binutils/zlib/ |
| H A D | inftrees.c | 45 unsigned drop; /* code bits to drop for sub-table */ local
152 with length len. That code is converted to an index by dropping drop
153 bits off of the bottom. For codes where len is less than drop + curr,
154 those top drop + curr - len bits are incremented through all values to
160 new sub-table should be started. drop is zero when the root table is
161 being filled, and drop is root when sub-tables are being filled.
205 drop = 0; /* current bits to drop from code for index */
218 here.bits = (unsigned char)(len - drop);
[all...] |
| /haiku-buildtools/gcc/zlib/contrib/infback9/ |
| H A D | inftree9.c | 45 unsigned drop; /* code bits to drop for sub-table */ local
146 with length len. That code is converted to an index by dropping drop
147 bits off of the bottom. For codes where len is less than drop + curr,
148 those top drop + curr - len bits are incremented through all values to
154 new sub-table should be started. drop is zero when the root table is
155 being filled, and drop is root when sub-tables are being filled.
199 drop = 0; /* current bits to drop from code for index */
212 this.bits = (unsigned char)(len - drop);
[all...] |
| /haiku-buildtools/binutils/zlib/contrib/infback9/ |
| H A D | inftree9.c | 45 unsigned drop; /* code bits to drop for sub-table */ local
146 with length len. That code is converted to an index by dropping drop
147 bits off of the bottom. For codes where len is less than drop + curr,
148 those top drop + curr - len bits are incremented through all values to
154 new sub-table should be started. drop is zero when the root table is
155 being filled, and drop is root when sub-tables are being filled.
199 drop = 0; /* current bits to drop from code for index */
212 this.bits = (unsigned char)(len - drop);
[all...] |
| /haiku-buildtools/gcc/contrib/ |
| H A D | dg-cmp-results.sh | 133 function drop() { function
157 drop() function
182 drop() function
|
| /haiku-buildtools/gcc/gcc/testsuite/gcc.target/powerpc/ |
| H A D | pr58673-1.c | 14 neverneverland, drop, duplicate, over, setstackSI, adjstackSI, constQI, enumerator in enum:bytecode_opcode
|
| /haiku-buildtools/gcc/libdecnumber/ |
| H A D | decCommon.c | 274 Int drop; /* digits to be dropped */ local
282 drop=MAXI(length-DECPMAX, DECQTINY-num->exponent);
283 /* drop can now be > digits for bottom-clamp (subnormal) cases */
284 if (drop>0) { /* rounding needed */
289 /* printf("Rounding; drop=%ld\n", (LI)drop); */
291 num->exponent+=drop; /* always update exponent */
300 if (drop<length) { /* NB lengths not addresses */
301 roundat=umsd+length-drop;
312 if (drop
[all...] |
| H A D | decBasic.c | 95 /* drop through to check payload */
575 for (; *ub==0;) ub--; /* drop zeros */
613 Int drop=-num.exponent; local
615 num.lsd-=drop;
627 if (drop<length) roundat=num.lsd-drop+1;
628 else if (drop==length) roundat=num.msd;
1022 if (*pa!=0) num->msd=bcdacc+LEADZEROS;/* drop known lead zeros */
1235 /* drop through to slow path */
1919 } /* [cannot drop throug
2906 Int drop; /* .. */ local
[all...] |
| H A D | decNumber.c | 404 /* bad -- drop through */
586 /* good; drop through to convert the integer to coefficient */
714 free(allocres); /* drop any storage used */
973 free(allocbufa); /* drop any storage used */
1077 free(allocrhs); /* drop any storage used */
1172 free(allocbufa); /* drop any storage used */
1299 free(allocrhs); /* drop any storage used */
1512 free(allocbufa); /* drop any storage used */
2164 /* and drop through for final rounding */
2256 free(allocdac); /* drop an
4622 Int drop=0; local
7625 decDecap(decNumber *dn, Int drop) argument
[all...] |
| /haiku-buildtools/gcc/libgcc/config/cris/ |
| H A D | mulsi3.S | 202 ;; We drop the upper part of (a*d)<<16 as we're only doing a
|
| H A D | umulsidi3.S | 112 ;; $r9 = d, need to do b*c and a*c; we can drop d.
|
| /haiku-buildtools/isl/ |
| H A D | isl_coalesce.c | 139 static void drop(struct isl_map *map, int i, struct isl_tab **tabs) function
239 drop(map, j, tabs);
524 drop(map, j, tabs);
1394 drop(map, j, tabs);
1398 drop(map, i, tabs);
1478 * and, if so, drop basic map "j".
1516 drop(map, j, tabs);
1697 drop(map, i, tabs);
|
| H A D | isl_arg.c | 1125 static int drop_argument(int argc, char **argv, int drop, int n) argument
1127 for (; drop + n < argc; ++drop)
1128 argv[drop] = argv[drop + n];
|
| H A D | isl_vertices.c | 804 int drop; local
818 drop = has_opposite(todo, &first->next);
819 if (drop < 0)
822 if (drop)
|
| H A D | isl_list_templ.c | 150 __isl_give LIST(EL) *FN(LIST(EL),drop)(__isl_take LIST(EL) *list,
|
| H A D | isl_schedule.c | 2090 int drop; local
2096 drop = graph->n_total_row - graph->band_start;
2097 graph->n_total_row -= drop;
2098 graph->n_row -= drop;
2103 int row = isl_mat_rows(node->sched) - drop;
2113 graph->band_start, drop);
|
| /haiku-buildtools/legacy/binutils/bfd/doc/ |
| H A D | chew.c | 58 drop - discard TOS
334 static void drop (void), idrop (void);
1066 drop () function
1498 add_intrinsic ("drop", drop);
|
| /haiku-buildtools/binutils/bfd/doc/ |
| H A D | chew.c | 57 drop - discard TOS
351 static void drop (void), idrop (void);
1089 drop () function
1557 add_intrinsic ("drop", drop);
|
| /haiku-buildtools/legacy/binutils/bfd/ |
| H A D | elf64-ppc.c | 7119 unsigned long *skip, *drop;
7321 for (drop = skip, keep = used, last = 0, some_unused = 0;
7322 drop < skip + (toc->size + 7) / 8;
7323 ++drop, ++keep)
7327 *drop = 0;
7330 else if (*drop)
7336 *drop = last;
7353 for (src = contents, off = 0, drop = skip;
7355 src += 8, ++drop)
7357 if (*drop)
7115 unsigned long *skip, *drop; local
[all...] |
| /haiku-buildtools/gcc/libgcc/config/rl78/ |
| H A D | fpbit-sf.S | 479 ;; Test the sign bit. If the value is positive then drop into
|
| /haiku-buildtools/binutils/bfd/ |
| H A D | elf64-ppc.c | 8964 unsigned long *skip, *drop;
9354 for (drop = skip, keep = used, last = 0, some_unused = 0;
9355 drop < skip + (toc->size + 7) / 8;
9356 ++drop, ++keep)
9360 *drop &= ~ref_from_discarded;
9361 if ((*drop & can_optimize) != 0)
9365 else if ((*drop & ref_from_discarded) != 0)
9371 *drop = last;
9390 for (src = contents, off = 0, drop = skip;
9392 src += 8, ++drop)
8960 unsigned long *skip, *drop; local
[all...] |