Searched refs:distance (Results 1 - 25 of 116) sorted by relevance

12345

/freebsd-9.3-release/contrib/groff/src/preproc/pic/
H A Dcommon.h38 const position &, const distance &,
42 void dashed_ellipse(const position &, const distance &, const line_type &);
43 void dotted_ellipse(const position &, const distance &, const line_type &);
50 void dashed_rounded_box(const position &, const distance &, double,
52 void dotted_rounded_box(const position &, const distance &, double,
54 void solid_rounded_box(const position &, const distance &, double,
56 void filled_rounded_box(const position &, const distance &, double, double);
68 void ellipse(const position &, const distance &,
70 void rounded_box(const position &, const distance &, double,
H A Dposition.h46 typedef position distance; typedef
H A Dtroff.cpp35 virtual void simple_ellipse(int, const position &, const distance &) = 0;
56 void ellipse(const position &, const distance &, const line_type &, double);
96 distance vec(v[i] - pos);
110 distance vec(v[i] - pos);
116 distance dash_vec = vec*(lt.dash_width/dist);
118 distance dash_gap_vec = vec*(dash_gap/dist);
186 void simple_output::ellipse(const position &cent, const distance &dim,
235 void simple_ellipse(int, const position &, const distance &);
336 const distance &dim)
349 void troff_output::simple_arc(const position &start, const distance
[all...]
H A Doutput.h54 virtual void ellipse(const position &, const distance &,
56 virtual void rounded_box(const position &, const distance &, double,
H A Dcommon.cpp85 const distance &dim, const line_type &lt)
107 // compute distance between circle and ellipse arc at start and end
124 void common_output::dashed_ellipse(const position &cent, const distance &dim,
183 void common_output::dotted_ellipse(const position &cent, const distance &dim,
239 distance c = cent - start;
240 distance e = end - start;
259 distance start_offset = start - c;
260 distance end_offset = end - c;
290 distance start_offset = start - c;
291 distance end_offse
[all...]
/freebsd-9.3-release/contrib/xz/src/liblzma/delta/
H A Ddelta_private.h22 /// Delta distance
23 size_t distance; member in struct:lzma_coder_s
H A Ddelta_encoder.c24 const size_t distance = coder->distance; local
28 (distance + coder->pos) & 0xFF];
40 const size_t distance = coder->distance; local
44 (distance + coder->pos) & 0xFF];
H A Ddelta_decoder.c20 const size_t distance = coder->distance; local
23 buffer[i] += coder->history[(distance + coder->pos) & 0xFF];
H A Ddelta_common.c45 // Set the delta distance.
47 next->coder->distance = opt->dist;
/freebsd-9.3-release/contrib/xz/src/liblzma/lz/
H A Dlz_decoder.h103 dict_get(const lzma_dict *const dict, const uint32_t distance) argument
105 return dict->buf[dict->pos - distance - 1
106 + (distance < dict->pos ? 0 : dict->size)];
118 /// Validate the match distance
120 dict_is_distance_valid(const lzma_dict *const dict, const size_t distance) argument
122 return dict->full > distance;
126 /// Repeat *len bytes at distance.
128 dict_repeat(lzma_dict *dict, uint32_t distance, uint32_t *len) argument
138 if (distance < left) {
142 dict->buf[dict->pos] = dict_get(dict, distance);
[all...]
/freebsd-9.3-release/contrib/libstdc++/include/ext/pb_ds/detail/list_update_map_/
H A Dinfo_fn_imps.hpp51 { return std::distance(begin(), end()); }
/freebsd-9.3-release/contrib/libstdc++/include/ext/pb_ds/detail/pat_trie_/
H A Dsplit_fn_imps.hpp79 other.m_size = std::distance(other.PB_DS_CLASS_C_DEC::begin(),
160 std::distance(p_internal_nd->begin(), child_it) + 1;
165 std::distance(p_internal_nd->begin(), p_internal_nd->end()) -
187 _GLIBCXX_DEBUG_ASSERT(std::distance(p_internal_nd->begin(),
190 if (std::distance(p_internal_nd->begin(), p_internal_nd->end()) > 1)
H A Dtrace_fn_imps.hpp91 const size_type num_children = std::distance(p_internal->begin(),
/freebsd-9.3-release/contrib/groff/src/roff/troff/
H A Ddiv.h56 virtual void space(vunits distance, int forced = 0) = 0;
85 void space(vunits distance, int forced = 0);
124 void space(vunits distance, int forced = 0);
H A Dcolumn.cpp84 virtual vunits distance();
96 vunits distance();
172 vunits output_line::distance() function in class:output_line
192 vunits position_output_line::distance() function in class:position_output_line
336 bottom += ln->distance();
388 bottom -= ln->distance();
400 bottom += ln->distance();
410 b += ln->distance();
422 vpos += ln->distance();
H A Denv.h85 tab_stops(hunits distance, tab_type type);
89 tab_type distance_to_next_tab(hunits pos, hunits *distance);
90 tab_type distance_to_next_tab(hunits curpos, hunits *distance, hunits *leftpos);
234 tab_type distance_to_next_tab(hunits *distance, hunits *leftpos);
/freebsd-9.3-release/contrib/libstdc++/include/bits/
H A Dstl_tempbuf.h145 : _M_original_len(std::distance(__first, __last)),
/freebsd-9.3-release/lib/libz/
H A Ddeflate.h40 /* number of distance codes */
119 * bytes. With this organization, matches are limited to a distance of
196 struct ct_data_s dyn_dtree[2*D_CODES+1]; /* distance tree */
200 struct tree_desc_s d_desc; /* desc. for distance tree */
307 /* Mapping from a distance to a distance code. dist is the distance - 1 and
330 # define _tr_tally_dist(s, distance, length, flush) \
332 ush dist = (distance); \
342 # define _tr_tally_dist(s, distance, lengt
[all...]
/freebsd-9.3-release/sys/cddl/contrib/opensolaris/uts/common/zmod/
H A Ddeflate.h40 /* number of distance codes */
116 * bytes. With this organization, matches are limited to a distance of
193 struct ct_data_s dyn_dtree[2*D_CODES+1]; /* distance tree */
197 struct tree_desc_s d_desc; /* desc. for distance tree */
292 /* Mapping from a distance to a distance code. dist is the distance - 1 and
315 # define _tr_tally_dist(s, distance, length, flush) \
317 ush dist = (distance); \
327 # define _tr_tally_dist(s, distance, lengt
[all...]
/freebsd-9.3-release/libexec/rtld-elf/powerpc/
H A Dreloc.c337 Elf_Addr distance; local
349 distance = (Elf_Addr)pltresolve - (Elf_Addr)(where + 1);
351 dbg(" reloc_plt_object: where=%p,pltres=%p,reloff=%x,distance=%x",
352 (void *)where, (void *)pltresolve, reloff, distance);
358 where[1] = 0x48000000 | (distance & 0x03fffffc);
488 int distance; local
507 distance = (Elf_Addr)pltcall - (Elf_Addr)(wherep + 1);
513 wherep[1] = 0x48000000 | (distance & 0x03fffffc);
/freebsd-9.3-release/contrib/gcc/
H A Dddg.c148 /* Computes the dependence parameters (latency, distance etc.), creates
155 int latency, distance = 0;
162 /* For now we don't have an exact calculation of the distance,
165 distance = 1;
176 e = create_ddg_edge (src_node, dest_node, t, dt, latency, distance);
183 opposite direction with distance 1; such register deps
200 dep_type d_t, dep_data_type d_dt, int distance)
214 e = create_ddg_edge (from, to, d_t, d_dt, l, distance);
215 if (distance > 0)
566 dep_c, e->latency, e->distance, INSN_UI
154 int latency, distance = 0; local
198 create_ddg_dep_no_link(ddg_ptr g, ddg_node_ptr from, ddg_node_ptr to, dep_type d_t, dep_data_type d_dt, int distance) argument
675 int distance = backarc->distance; local
[all...]
H A Dddg.h98 /* The distance: number of loop iterations the dependency crosses. */
99 int distance; member in struct:ddg_edge
138 /* Array and number of backarcs (edges with distance > 0) in the DDG. */
151 /* Array and number of backarcs (edges with distance > 0) in the SCC. */
/freebsd-9.3-release/tools/tools/net80211/wesside/wesside/
H A Daircrack-ptw-lib.c55 int distance; member in struct:__anon10710
171 if (a->distance > b->distance) {
173 } else if (a->distance == b->distance) {
397 sh[i][j-1].distance = table[i][0].votes - table[i][j].votes;
/freebsd-9.3-release/contrib/libstdc++/include/backward/
H A Diterator.h68 #include <ext/iterator> // For 3-parameter distance extension
146 using std::distance;
147 using __gnu_cxx::distance; // 3-parameter extension
/freebsd-9.3-release/contrib/libstdc++/include/ext/pb_ds/detail/trie_policy/
H A Dtrie_policy_base.hpp167 std::distance(b_l, e_l);
170 std::distance(b_r, e_r);

Completed in 190 milliseconds

12345