| /src/external/gpl2/groff/dist/src/preproc/pic/ |
| position.h | 48 typedef position distance; typedef
|
| /src/external/public-domain/xz/dist/src/liblzma/delta/ |
| delta_private.h | 21 /// Delta distance 22 size_t distance; member in struct:__anon383
|
| delta_decoder.c | 19 const size_t distance = coder->distance; local 22 buffer[i] += coder->history[(distance + coder->pos) & 0xFF];
|
| delta_encoder.c | 23 const size_t distance = coder->distance; local 27 (distance + coder->pos) & 0xFF]; 39 const size_t distance = coder->distance; local 43 (distance + coder->pos) & 0xFF];
|
| /src/external/gpl3/gcc/dist/libstdc++-v3/include/bits/ |
| stl_iterator_base_funcs.h | 56 * functions, such as distance() and advance(). 110 // Forward declaration because of the qualified call in distance. 125 // Give better error if std::distance called with a non-Cpp17InputIterator. 135 * @return The distance between them. 148 distance(_InputIterator __first, _InputIterator __last) function
|
| /src/external/gpl3/gcc.old/dist/libstdc++-v3/include/bits/ |
| stl_iterator_base_funcs.h | 56 * functions, such as distance() and advance(). 109 // Forward declaration because of the qualified call in distance. 124 // Give better error if std::distance called with a non-Cpp17InputIterator. 134 * @return The distance between them. 147 distance(_InputIterator __first, _InputIterator __last) function
|
| /src/external/apache2/llvm/dist/llvm/utils/yaml-bench/ |
| YAMLBench.cpp | 60 unsigned distance; member in struct:indent 61 indent(unsigned d) : distance(d) {} 65 for (unsigned i = 0; i < in.distance; ++i)
|
| /src/games/larn/ |
| movem.c | 33 static int tmp1, tmp2, tmp3, tmp4, distance; variable 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/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/external/bsd/wpa/dist/wpa_supplicant/ |
| wnm_sta.h | 37 u32 distance; /* valid if bearing_present=1 */ member in struct:neighbor_report
|
| /src/games/phantasia/ |
| misc.c | 956 distance(double x_1, double x_2, double y_1, double y_2) function
|
| /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 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/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 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/external/gpl3/gcc/dist/gcc/ |
| ddg.h | 94 /* The distance: number of loop iterations the dependency crosses. */ 95 int distance; member in struct:ddg_edge 131 /* Array and number of backarcs (edges with distance > 0) in the DDG. */ 144 /* Array and number of backarcs (edges with distance > 0) in the SCC. */
|
| /src/external/gpl3/gcc.old/dist/gcc/ |
| ddg.h | 94 /* The distance: number of loop iterations the dependency crosses. */ 95 int distance; member in struct:ddg_edge 131 /* Array and number of backarcs (edges with distance > 0) in the DDG. */ 144 /* Array and number of backarcs (edges with distance > 0) in the SCC. */
|
| /src/external/public-domain/xz/dist/src/liblzma/lzma/ |
| lzma_encoder.c | 143 const uint32_t distance, const uint32_t len) 150 const uint32_t dist_slot = get_dist_slot(distance); 158 const uint32_t dist_reduced = distance - base; 179 coder->reps[0] = distance; 198 const uint32_t distance = coder->reps[rep]; local 215 coder->reps[0] = distance; 250 // It's a repeated match i.e. the same distance
|
| /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/external/bsd/libarchive/dist/libarchive/ |
| archive_windows.c | 274 LARGE_INTEGER distance; local 287 distance.QuadPart = offset; 288 if (!SetFilePointerEx_perso(handle, distance, &newpointer, whence)) {
|
| /src/external/bsd/libarchive/dist/tar/ |
| write.c | 108 LARGE_INTEGER distance; local 110 distance.QuadPart = offset; 112 distance, NULL, FILE_BEGIN) ? 1 : -1);
|
| /src/external/mpl/bind/dist/tests/dns/ |
| rbt_test.c | 273 const size_t *distance = (const size_t *)node->data; local 274 if (distance != NULL) { 275 assert_int_equal(*distance, 357 /* The distance from each node to its sub-tree root must be less 422 /* The distance from each node to its sub-tree root must be less 907 * The distance from each node to its sub-tree root must be less
|
| /src/external/gpl3/gdb.old/dist/gdb/python/ |
| py-record-btrace.c | 486 const Py_ssize_t distance = obj->last - obj->first; local 487 const Py_ssize_t result = distance / obj->step; 489 if ((distance % obj->step) == 0)
|
| /src/external/gpl3/gdb/dist/gdb/python/ |
| py-record-btrace.c | 486 const Py_ssize_t distance = obj->last - obj->first; local 487 const Py_ssize_t result = distance / obj->step; 489 if ((distance % obj->step) == 0)
|
| /src/common/lib/libprop/ |
| prop_dictionary.c | 924 unsigned int base, idx, distance; local 931 for (idx = 0, base = 0, distance = pd->pd_count; distance != 0; 932 distance >>= 1) { 933 idx = base + (distance >> 1); 944 distance--;
|
| /src/external/apache2/llvm/dist/llvm/include/llvm/CodeGen/ |
| SlotIndexes.h | 135 /// The default distance between instructions as returned by distance(). 213 /// Return the distance from this index to the given one. 214 int distance(SlotIndex other) const { function in class:llvm::SlotIndex 218 /// Return the scaled distance from this index to the given one, where all 219 /// slots on the same instruction have zero distance.
|
| /src/external/gpl2/groff/dist/src/roff/troff/ |
| column.cpp | 86 virtual vunits distance(); 98 vunits distance(); 174 vunits output_line::distance() function in class:output_line 194 vunits position_output_line::distance() function in class:position_output_line 338 bottom += ln->distance(); 390 bottom -= ln->distance(); 402 bottom += ln->distance(); 412 b += ln->distance(); 424 vpos += ln->distance();
|