| /src/games/hack/ |
| hack.dog.c | 192 int nx, ny, omx, omy, appr, nearer, j; local
438 nearer = GDIST(nx, ny);
439 nearer -= GDIST(nix, niy);
440 nearer *= appr;
441 if ((nearer == 0 && !rn2(++chcnt)) || nearer < 0 ||
442 (nearer > 0 && !whappr &&
448 if (nearer < 0)
|
| hack.dog.c | 192 int nx, ny, omx, omy, appr, nearer, j; local
438 nearer = GDIST(nx, ny);
439 nearer -= GDIST(nix, niy);
440 nearer *= appr;
441 if ((nearer == 0 && !rn2(++chcnt)) || nearer < 0 ||
442 (nearer > 0 && !whappr &&
448 if (nearer < 0)
|
| hack.mon.c | 320 int nx, ny, omx, omy, appr, nearer, cnt, i, j; local
482 nearer = (d1 < d2);
485 nearer = (DIST(nx, ny, gx, gy) < DIST(nix, niy, gx, gy));
487 if ((appr == 1 && nearer) || (appr == -1 && !nearer) ||
|
| hack.mon.c | 320 int nx, ny, omx, omy, appr, nearer, cnt, i, j; local
482 nearer = (d1 < d2);
485 nearer = (DIST(nx, ny, gx, gy) < DIST(nix, niy, gx, gy));
487 if ((appr == 1 && nearer) || (appr == -1 && !nearer) ||
|
| /src/external/gpl3/gcc/dist/gcc/ |
| lcm.cc | 617 /* Compute nearer and nearerout vectors for edge based lcm.
624 sbitmap *st_avloc, sbitmap *nearer, sbitmap *nearerout)
638 /* Initialize NEARER for each edge and build a mapping from an edge to
644 bitmap_vector_ones (nearer, num_edges);
646 /* Note that even though we want an optimistic setting of NEARER, we
648 the exit block. That edge should always have a NEARER value the
651 bitmap_copy (nearer[(size_t)e->aux], farthest[(size_t)e->aux]);
654 from the loop given our optimistic initialization of NEARER. */
668 /* Compute the intersection of NEARER for each outgoing edge from B. */
672 nearer[(size_t) e->aux])
738 sbitmap *nearer, *nearerout; local
[all...] |
| lcm.cc | 617 /* Compute nearer and nearerout vectors for edge based lcm.
624 sbitmap *st_avloc, sbitmap *nearer, sbitmap *nearerout)
638 /* Initialize NEARER for each edge and build a mapping from an edge to
644 bitmap_vector_ones (nearer, num_edges);
646 /* Note that even though we want an optimistic setting of NEARER, we
648 the exit block. That edge should always have a NEARER value the
651 bitmap_copy (nearer[(size_t)e->aux], farthest[(size_t)e->aux]);
654 from the loop given our optimistic initialization of NEARER. */
668 /* Compute the intersection of NEARER for each outgoing edge from B. */
672 nearer[(size_t) e->aux])
738 sbitmap *nearer, *nearerout; local
[all...] |
| /src/external/gpl3/gcc.old/dist/gcc/ |
| lcm.cc | 618 /* Compute nearer and nearerout vectors for edge based lcm.
625 sbitmap *st_avloc, sbitmap *nearer, sbitmap *nearerout)
639 /* Initialize NEARER for each edge and build a mapping from an edge to
645 bitmap_vector_ones (nearer, num_edges);
647 /* Note that even though we want an optimistic setting of NEARER, we
649 the exit block. That edge should always have a NEARER value the
652 bitmap_copy (nearer[(size_t)e->aux], farthest[(size_t)e->aux]);
655 from the loop given our optimistic initialization of NEARER. */
669 /* Compute the intersection of NEARER for each outgoing edge from B. */
673 nearer[(size_t) e->aux])
739 sbitmap *nearer, *nearerout; local
[all...] |
| lcm.cc | 618 /* Compute nearer and nearerout vectors for edge based lcm.
625 sbitmap *st_avloc, sbitmap *nearer, sbitmap *nearerout)
639 /* Initialize NEARER for each edge and build a mapping from an edge to
645 bitmap_vector_ones (nearer, num_edges);
647 /* Note that even though we want an optimistic setting of NEARER, we
649 the exit block. That edge should always have a NEARER value the
652 bitmap_copy (nearer[(size_t)e->aux], farthest[(size_t)e->aux]);
655 from the loop given our optimistic initialization of NEARER. */
669 /* Compute the intersection of NEARER for each outgoing edge from B. */
673 nearer[(size_t) e->aux])
739 sbitmap *nearer, *nearerout; local
[all...] |
