| /src/external/gpl3/gcc/dist/contrib/ |
| compareSumTests3 | 35 compareSumTests3 old1.sum [old2.sum] new.sum
36 compareSumTests3 -i 1:2 -x 2:3 old1.sum old2.sum new.sum
92 one of the three runs (C<old1>, C<old2>, or C<new>.) C<1> and C<2> signify C<old1> and C<old2>
157 print STDERR "Usage: compareSumTests3 [-p] [-i X:Y [-x X:Y]] old1.sum old2.sum new.sum\n";
192 print "\tSuccess in old1 only: $subcounts[$i]\n";
194 print "\tFailure in old1 only: $subcounts[$i]\n";
|
| /src/external/gpl3/gcc.old/dist/contrib/ |
| compareSumTests3 | 35 compareSumTests3 old1.sum [old2.sum] new.sum
36 compareSumTests3 -i 1:2 -x 2:3 old1.sum old2.sum new.sum
92 one of the three runs (C<old1>, C<old2>, or C<new>.) C<1> and C<2> signify C<old1> and C<old2>
157 print STDERR "Usage: compareSumTests3 [-p] [-i X:Y [-x X:Y]] old1.sum old2.sum new.sum\n";
192 print "\tSuccess in old1 only: $subcounts[$i]\n";
194 print "\tFailure in old1 only: $subcounts[$i]\n";
|
| /src/external/gpl3/binutils/dist/gprofng/libcollector/ |
| libcol_util.h | 223 uint32_t old1 = (uint32_t) (*old & 0xFFFFFFFFL); local
232 : "m" (mem), "a" (old1), "d" (old2), "b" (new1), "c" (new2) /* input */
|
| /src/external/gpl3/binutils.old/dist/gprofng/libcollector/ |
| libcol_util.h | 223 uint32_t old1 = (uint32_t) (*old & 0xFFFFFFFFL); local
232 : "m" (mem), "a" (old1), "d" (old2), "b" (new1), "c" (new2) /* input */
|
| /src/external/gpl2/rcs/dist/src/ |
| rcs.c | 1022 int old1, old2, c, status; local
1046 old1 = '\n'; old2 = ' ';
1050 aprintf(mailmess, "%c\n", old1);
1053 else if ( c == '\n' && old1 == '.' && old2 == '\n')
1056 afputc(old1, mailmess);
1057 old2 = old1; old1 = c;
|
| /src/external/mit/lua/dist/src/ |
| lstate.h | 42 ** 'old1' -> 'reallyold': objects that became old in last collection;
54 ** OLD0, which then become OLD1. However, a list never contains
58 ** points to the first OLD1 object in the list. It is used to optimize
59 ** 'markold'. (Potentially OLD1 objects can be anywhere between 'allgc'
60 ** and 'reallyold', but often the list has no OLD1 objects or they are
61 ** after 'old1'.) Note the difference between it and 'old1':
62 ** 'firstold1': no OLD1 objects before this point; there can be all
64 ** 'old1': no objects younger than OLD1 after this point
290 GCObject *old1; \/* start of old1 objects *\/ member in struct:global_State
[all...] |
| lgc.c | 204 ** OLD1, and in the next it will finally become OLD (regular old). By
897 g->firstold1 = o; /* it is the first OLD1 object in the list */
1010 checkpointer(&g->old1, o);
1143 *pfirstold1 = curr; /* first OLD1 object in the list */
1218 ** Mark black 'OLD1' objects when starting a new young collection.
1248 ** Does a young collection. First, mark 'OLD1' objects. Then does the
1256 if (g->firstold1) { /* are there regular OLD1 objects? */
1258 g->firstold1 = NULL; /* no more OLD1 objects (for now) */
1268 sweepgen(L, g, psurvival, g->old1, &g->firstold1);
1269 g->reallyold = g->old1;
[all...] |
| lstate.c | 395 g->firstold1 = g->survival = g->old1 = g->reallyold = NULL;
|
| /src/external/lgpl2/userspace-rcu/dist/src/ |
| rculfhash.c | 914 unsigned long old1, old2; local
916 old1 = uatomic_read(ptr);
918 old2 = old1;
923 } while ((old1 = uatomic_cmpxchg(ptr, old2, v)) != old2);
|
| /src/external/gpl3/gcc/dist/gcc/ |
| fold-const.cc | 4381 NEW1 and OLD1. */
4385 tree old1, tree new1)
4403 old0, new0, old1, new1));
4408 old0, new0, old1, new1),
4410 old0, new0, old1, new1));
4417 old1, new1);
4421 old1, new1);
4426 old0, new0, old1, new1),
4428 old0, new0, old1, new1),
4430 old0, new0, old1, new1))
[all...] |
| /src/external/gpl3/gcc.old/dist/gcc/ |
| fold-const.cc | 4150 NEW1 and OLD1. */
4154 tree old1, tree new1)
4172 old0, new0, old1, new1));
4177 old0, new0, old1, new1),
4179 old0, new0, old1, new1));
4186 old1, new1);
4190 old1, new1);
4195 old0, new0, old1, new1),
4197 old0, new0, old1, new1),
4199 old0, new0, old1, new1))
[all...] |
