| /src/external/gpl2/groff/dist/src/preproc/pic/ |
| common.h | 40 const position &, const distance &,
44 void dashed_ellipse(const position &, const distance &, const line_type &);
45 void dotted_ellipse(const position &, const distance &, const line_type &);
52 void dashed_rounded_box(const position &, const distance &, double,
54 void dotted_rounded_box(const position &, const distance &, double,
56 void solid_rounded_box(const position &, const distance &, double,
58 void filled_rounded_box(const position &, const distance &, double, double);
70 void ellipse(const position &, const distance &,
72 void rounded_box(const position &, const distance &, double,
|
| position.h | 48 typedef position distance; typedef
|
| troff.cpp | 37 virtual void simple_ellipse(int, const position &, const distance &) = 0;
58 void ellipse(const position &, const distance &, const line_type &, double);
98 distance vec(v[i] - pos);
112 distance vec(v[i] - pos);
118 distance dash_vec = vec*(lt.dash_width/dist);
120 distance dash_gap_vec = vec*(dash_gap/dist);
188 void simple_output::ellipse(const position ¢, const distance &dim,
237 void simple_ellipse(int, const position &, const distance &);
338 const distance &dim)
351 void troff_output::simple_arc(const position &start, const distance ¢
[all...] |
| output.h | 56 virtual void ellipse(const position &, const distance &,
58 virtual void rounded_box(const position &, const distance &, double,
|
| /src/external/public-domain/xz/dist/src/liblzma/delta/ |
| delta_private.h | 21 /// Delta distance
22 size_t distance; member in struct:__anon383
|
| 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];
|
| delta_decoder.c | 19 const size_t distance = coder->distance; local
22 buffer[i] += coder->history[(distance + coder->pos) & 0xFF];
|
| /src/external/gpl3/gcc/dist/libstdc++-v3/include/ext/pb_ds/detail/list_update_map_/ |
| info_fn_imps.hpp | 47 { return std::distance(begin(), end()); }
|
| /src/external/gpl3/gcc.old/dist/libstdc++-v3/include/ext/pb_ds/detail/list_update_map_/ |
| info_fn_imps.hpp | 47 { return std::distance(begin(), end()); }
|
| /src/external/public-domain/xz/dist/src/liblzma/lz/ |
| lz_decoder.h | 60 /// position. This way dict_repeat() with the maximum valid distance
68 /// Note that memcpy() still cannot be used if distance < len.
169 dict_get(const lzma_dict *const dict, const uint32_t distance)
171 return dict->buf[dict->pos - distance - 1
172 + (distance < dict->pos
193 /// Validate the match distance
195 dict_is_distance_valid(const lzma_dict *const dict, const size_t distance)
197 return dict->full > distance;
201 /// Repeat *len bytes at distance.
204 uint32_t distance, uint32_t *restrict len
[all...] |
| /src/external/bsd/ntp/dist/scripts/ntptrace/ |
| ntptrace-opts.def | 55 % ntptrace localhost: stratum 4, offset 0.0019529, synch distance 0.144135
56 server2ozo.com: stratum 2, offset 0.0124263, synch distance 0.115784 usndh.edu:
57 stratum 1, offset 0.0019298, synch distance 0.011993, refid 'WWVB'
63 synchronization distance, and (only for stratum-1 servers) the reference clock
65 count to the primary source, while the synchronization distance is the
|
| /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);
|
| /src/external/gpl3/gdb/dist/gdbsupport/ |
| iterator-range.h | 57 { return std::distance (m_begin, m_end); }
|
| /src/external/gpl3/gdb.old/dist/gdbsupport/ |
| iterator-range.h | 58 { return std::distance (m_begin, m_end); }
|
| /src/external/zlib/pigz/dist/zopfli/ |
| lz77.h | 37 dists: Indicates the distance, or 0 to indicate that there is no distance and
44 if > 0: length in corresponding litlens, this is the distance. */
63 /* Cache for length/distance pairs found so far. */
73 Finds the longest match (length and corresponding distance) for LZ77
84 smallest distance required to reach this length. Only 256 of its 259 values
91 unsigned short* sublen, unsigned short* distance, unsigned short* length);
100 Counts the number of literal, length and distance symbols in the given lz77
|
| lz77.c | 56 Appends the length and distance to the LZ77 arrays of the ZopfliLZ77Store.
67 Gets the value of the length given the distance. Typically, the value of the
68 length is the length, but if the distance is very long, decrease the value of
72 static int GetLengthValue(int length, int distance) {
74 At distance > 1024, using length 3 is no longer good, due to the large amount
75 of extra bits for the distance code. distance > 1024 uses 9+ extra bits, and
78 return distance > 1024 ? length - 1 : length;
143 Gets distance, length and sublen values from the cache if possible.
150 unsigned short* sublen, unsigned short* distance, unsigned short* length)
[all...] |
| /src/external/gpl3/binutils/dist/zlib/ |
| deflate.h | 44 /* number of distance codes */
126 * bytes. With this organization, matches are limited to a distance of
203 struct ct_data_s dyn_dtree[2*D_CODES+1]; /* distance tree */
207 struct tree_desc_s d_desc; /* desc. for distance tree */
316 /* Mapping from a distance to a distance code. dist is the distance - 1 and
340 # define _tr_tally_dist(s, distance, length, flush) \
342 ush dist = (ush)(distance); \
359 # define _tr_tally_dist(s, distance, length, flush)
[all...] |
| /src/external/gpl3/gdb/dist/zlib/ |
| deflate.h | 44 /* number of distance codes */
126 * bytes. With this organization, matches are limited to a distance of
203 struct ct_data_s dyn_dtree[2*D_CODES+1]; /* distance tree */
207 struct tree_desc_s d_desc; /* desc. for distance tree */
316 /* Mapping from a distance to a distance code. dist is the distance - 1 and
340 # define _tr_tally_dist(s, distance, length, flush) \
342 ush dist = (ush)(distance); \
359 # define _tr_tally_dist(s, distance, length, flush)
[all...] |
| /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 */
324 /* Mapping from a distance to a distance code. dist is the distance - 1 and
348 # define _tr_tally_dist(s, distance, length, flush) \
350 ush dist = (ush)(distance); \
367 # 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
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/external/gpl2/groff/dist/src/roff/troff/ |
| div.h | 58 virtual void space(vunits distance, int forced = 0) = 0;
87 void space(vunits distance, int forced = 0);
126 void space(vunits distance, int forced = 0);
|
| /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);
|
