| /src/games/hunt/hunt/ |
| otto.c | 126 int distance; member in struct:item
245 if (itemp->distance == -1) {
246 itemp->distance = dist;
262 if (itemp->distance == -1 || (!side
265 itemp->distance = dist;
279 itemp->distance = dist;
292 if (itemp->distance == -1) {
293 itemp->distance = dist;
308 itemp->distance = -1;
329 for (r = row - 1; r > row - itemp->distance; r--
[all...] |
| /src/games/phantasia/ |
| macros.h | 9 #define CIRCLE(X, Y) floor(distance(X, 0.0, Y, 0.0) / 125.0 + 1)
|
| phantglobs.h | 78 double distance(double, double, double, double);
|
| main.c | 525 if (distance(Player.p_x, x, Player.p_y, y) > MAXMOVE())
590 temp = distance(Player.p_x, x, Player.p_y, y);
604 mvaddstr(5, 0, "Not enough power for that distance.\n");
|
| interplayer.c | 783 temp1 = distance(Player.p_x, Enrgyvoid.ev_x, Player.p_y, Enrgyvoid.ev_y);
|
| misc.c | 956 distance(double x_1, double x_2, double y_1, double y_2) function in typeref:typename:double
|
| /src/common/dist/zlib/ |
| deflate.h | 46 /* number of distance codes */
128 * bytes. With this organization, matches are limited to a distance of
205 struct ct_data_s dyn_dtree[2*D_CODES+1]; /* distance tree */
209 struct tree_desc_s d_desc; /* desc. for distance tree */
318 /* Mapping from a distance to a distance code. dist is the distance - 1 and
342 # define _tr_tally_dist(s, distance, length, flush) \
344 ush dist = (ush)(distance); \
361 # define _tr_tally_dist(s, distance, length, flush)
[all...] |
| /src/games/robots/ |
| auto.c | 63 static int distance(int, int, int, int);
74 /* distance():
75 * return "move" number distance of the two coordinates
78 distance(int x1, int y1, int x2, int y2) function in typeref:typename:int
168 * and put in dist its distance
179 tdist = distance(My_pos.x, My_pos.y, rob->x, rob->y);
191 * and put in dist its distance
204 tdist = distance(My_pos.x, My_pos.y, hp->x, hp->y);
359 robot_heap = distance(robot_close->x, robot_close->y,
|
| /src/games/sail/ |
| misc.c | 49 #define distance(x,y) \ macro
68 result = bb = distance(bow2r - bow1r, bow2c - bow1c);
74 bs = distance((bow2r - stern1r), (bow2c - stern1c));
75 sb = distance((bow1r - stern2r), (bow1c - stern2c));
76 ss = distance((stern2r - stern1r) ,(stern2c - stern1c));
|
| /src/libexec/ld.elf_so/arch/powerpc/ |
| ppc_reloc.c | 407 int distance;
419 distance = (Elf_Addr)pltresolve - (Elf_Addr)where;
420 *where++ = 0x48000000 | (distance & 0x03fffffc);
475 ptrdiff_t distance = value - (Elf_Addr)where; local in function:_rtld_relocate_plt_object
484 } else if (labs(distance) < 32*1024*1024) { /* inside 32MB? */
486 *where = 0x48000000 | (distance & 0x03fffffc);
522 distance = (Elf_Addr)pltcall - (Elf_Addr)where;
523 *where++ = 0x48000000 | (distance & 0x03fffffc);
|
| /src/sys/external/bsd/compiler_rt/dist/lib/xray/ |
| xray_utils.cc | 52 auto TotalBytes = std::distance(Begin, End);
139 auto TotalBytes = std::distance(Begin, End);
|
| xray_x86_64.cc | 34 auto BytesToRead = std::distance(Begin, End);
|
| /src/games/larn/ |
| movem.c | 33 static int tmp1, tmp2, tmp3, tmp4, distance; variable in typeref:typename:int
53 distance = 40; /* depth of intelligent monster movement */
59 distance = 17; /* depth of intelligent monster movement */
206 for (tmp = 1; tmp < distance; tmp++) /* only up to 20 squares
219 out: if (tmp < distance) /* did find connectivity */
246 * distance to player */
|
| /src/usr.bin/gzip/ |
| unlz.c | 468 unsigned distance; local in function:lz_decode_member
472 distance = rep[1];
477 distance = rep[2];
479 distance = rep[3];
485 rep[0] = distance;
|
| /src/common/lib/libprop/ |
| prop_dictionary.c | 924 unsigned int base, idx, distance; local in function:_prop_dict_lookup
931 for (idx = 0, base = 0, distance = pd->pd_count; distance != 0;
932 distance >>= 1) {
933 idx = base + (distance >> 1);
944 distance--;
|
| /src/sys/netinet/ |
| sctp_indata.c | 2214 int slide_from, slide_end, lgap, distance; local in function:sctp_sack_check
2301 distance = (slide_end-slide_from) + 1;
2308 if (distance + slide_from > asoc->mapping_array_size ||
2309 distance < 0) {
2323 sctp_log_map((uint32_t)distance, (uint32_t)slide_from,
2329 for (ii = 0; ii < distance; ii++) {
2333 for (ii = distance;ii <= slide_end; ii++) {
|
| /src/sys/external/mit/xen-include-public/dist/xen/include/public/ |
| sysctl.h | 479 * - Both 'meminfo' and 'distance' handles being null is a request
482 * of number of entries in 'distance' (when corresponding handle is
499 * Distance between nodes 'i' and 'j' is stored in index 'i*N + j',
503 XEN_GUEST_HANDLE_64(uint32) distance;
|
| /src/sys/net/ |
| zlib.c | 318 /* number of distance codes */
389 * bytes. With this organization, matches are limited to a distance of
466 struct ct_data_s dyn_dtree[2*D_CODES+1]; /* distance tree */
470 struct tree_desc_s d_desc; /* desc. for distance tree */
566 /* Mapping from a distance to a distance code. dist is the distance - 1 and
589 # define _tr_tally_dist(s, distance, length, flush) \
591 ush dist = (distance); \
601 # define _tr_tally_dist(s, distance, length, flush)
[all...] |
| /src/sys/arch/sparc/sparc/ |
| locore.s | 5812 xor %o1, 8, %o1 ! change 'endianness' of the shift distance
|
| /src/sys/arch/m68k/060sp/dist/ |
| fplsp.s | 10919 add.w &32, %d0 # no; fix shift distance
|
| fpsp.s | 18544 mov.w (tbl_fea_mode.b,%pc,%d0.w*2),%d0 # fetch jmp distance
22400 add.w &32, %d0 # no; fix shift distance
|
