HomeSort by: relevance | last modified time | path
    Searched defs:distance (Results 1 - 25 of 26) sorted by relevancy

1 2

  /xsrc/external/mit/brotli/dist/c/enc/
backward_references_hq.h 44 /* Distance associated with the length. */
45 uint32_t distance; member in struct:ZopfliNode
47 distance short code + 1 (or zero if no short code). */
60 /* Node position that provides next distance for distance cache. */
hash_to_binary_tree_inc.h 200 distance. */
256 size_t distance = dictionary_distance + (dict_id >> 5) + 1; local
257 if (distance <= params->dist.max_distance) {
258 InitDictionaryBackwardMatch(matches++, distance, l, dict_id & 31);
273 /* Maximum distance is window size - 16, see section 9.1. of the spec. */
310 /* Maximum distance is window size - 16, see section 9.1. of the spec.
compress_fragment_two_pass.c 67 /* Builds a command and distance prefix code (each 64 symbols) into "depth" and
210 static BROTLI_INLINE void EmitDistance(uint32_t distance, uint32_t** commands) {
211 uint32_t d = distance + 3;
312 /* Check copy distance. If candidate is not feasible, continue search.
328 int distance = (int)(base - candidate); /* > 0 */ local
335 if (distance == last_distance) {
339 EmitDistance((uint32_t)distance, commands);
340 last_distance = distance;
562 /* Save the start of the first block for position and distance computations.
metablock.c 107 uint32_t distance = CommandRestoreDistanceCode(cmd, orig_params); local
108 if (distance > new_params->max_distance) {
111 PrefixEncodeCopyDistance(distance,
294 #define FN(X) X ## Distance
300 /* Greedy block splitter for one block category (literal, command or distance).
compress_fragment.c 125 /* Builds a command and distance prefix code (each 64 symbols) into "depth" and
301 static BROTLI_INLINE void EmitDistance(size_t distance,
306 const size_t d = distance + 3;
437 /* Save the start of the first block for position and distance computations.
473 /* Store the pre-compressed command and distance prefix codes. */
483 /* Initialize the command and distance histograms. We will gather
484 statistics of command and distance codes during the processing
485 of this block and use it to update the command and distance
550 /* Check copy distance. If candidate is not feasible, continue search.
565 int distance = (int)(base - candidate); /* > 0 * local
    [all...]
hash.h 53 size_t distance; member in struct:HasherSearchResult
108 log2(distance). If the distance can be expressed in terms of the
170 out->distance = backward;
201 uint32_t distance; member in struct:BackwardMatch
207 self->distance = (uint32_t)dist;
213 self->distance = (uint32_t)dist;
backward_references_hq.c 46 stub.distance = 0;
62 return self->distance;
253 next->distance = (uint32_t)dist;
341 Also distance code 0 (last distance) does not update the last distances. */
443 /* Look for last distance matches using the distance cache from this
500 /* At higher iterations look only for new last distance matches, since
510 size_t dist = match.distance;
513 /* We already tried all possible last distance matches, so we can us
592 size_t distance = ZopfliNodeCopyDistance(next); local
    [all...]
  /xsrc/external/mit/xterm/dist/vttests/
closest-rgb.pl 34 # For a given RGB value, show its distance from xterm's 88/256-color
187 sub distance($$) { subroutine
205 my $test = &distance( \%ref, \%cmp );
  /xsrc/external/mit/xorg-server/dist/test/
fixes.c 105 double distance; local
121 assert(barrier_is_blocking(&barrier, x1, y1, x2, y2, &distance));
122 assert(distance == 1);
127 assert(!barrier_is_blocking(&barrier, x1, y1, x2, y2, &distance));
134 assert(!barrier_is_blocking(&barrier, x1, y1, x2, y2, &distance));
141 assert(barrier_is_blocking(&barrier, x1, y1, x2, y2, &distance));
148 assert(!barrier_is_blocking(&barrier, x1, y1, x2, y2, &distance));
155 assert(barrier_is_blocking(&barrier, x1, y1, x2, y2, &distance));
162 assert(!barrier_is_blocking(&barrier, x1, y1, x2, y2, &distance));
169 assert(!barrier_is_blocking(&barrier, x1, y1, x2, y2, &distance));
    [all...]
  /xsrc/external/mit/MesaLib/dist/src/freedreno/ir3/
ir3_delay.c 123 distance(struct ir3_block *block, struct ir3_instruction *instr, unsigned maxd) function
162 delay -= distance(block, assigner, delay);
307 struct ir3_instruction *consumer, unsigned distance,
319 distance += assigner->nop;
321 if (distance + delay >= (soft ? SOFT_SS_NOPS : MAX_NOPS))
342 new_delay = new_delay > distance ? new_delay - distance : 0;
346 distance += 1 + assigner->repeat;
368 unsigned pred_delay = delay_calc_postra(pred, NULL, consumer, distance,
ir3_sched.c 702 return "distance";
704 return "distance+ready";
748 unsigned distance = nearest_use(n->instr); local
751 (rank == chosen_rank && distance < chosen_distance)) {
753 chosen_distance = distance;
  /xsrc/external/mit/mesa-demos/dist/src/demos/
pointblast.c 11 is present , the particle size is attenuated based on eye distance. */
113 float distance; local
125 distance = pointVelocity[i][0] * theTime;
128 pointList[i][0] = pointDirection[i][0] * distance;
129 pointList[i][2] = pointDirection[i][1] * distance;
137 if (distance > EDGE) {
138 /* Particle has hit ground past the distance duration of
spriteblast.c 11 is present , the particle size is attenuated based on eye distance. */
175 float distance; local
187 distance = pointVelocity[i][0] * theTime;
190 pointList[i][0] = pointDirection[i][0] * distance;
191 pointList[i][2] = pointDirection[i][1] * distance;
199 if (distance > EDGE) {
200 /* Particle has hit ground past the distance duration of
projtex.c 493 float distance = -1.0; variable
510 glTranslatef(0.0, 0.0, distance);
524 n[0][2] = -(nnear + distance);
528 n[1][2] = -(nnear + distance);
532 n[2][2] = -(nnear + distance);
536 n[3][2] = -(nnear + distance);
540 f[0][2] = -(ffar + distance);
544 f[1][2] = -(ffar + distance);
548 f[2][2] = -(ffar + distance);
552 f[3][2] = -(ffar + distance);
    [all...]
  /xsrc/external/mit/xeyes/dist/
EyesP.h 67 Boolean distance; member in struct:__anon6657
  /xsrc/external/mit/MesaLib.old/dist/src/freedreno/ir3/
ir3_sched.c 218 * @maxd: max distance, bail after searching this # of instruction
222 * find the worst case (shortest) distance (only possible after
226 distance(struct ir3_block *block, struct ir3_instruction *instr, function
250 * shortest distance, since that will be the worst case
260 n = distance(block->predecessors[i], instr, min, pred);
298 delay -= distance(block, assigner, delay, pred);
711 delay -= distance(ctx->block, ctx->pred, delay, false);
  /xsrc/external/mit/MesaLib/dist/src/mesa/main/
texcompress_etc.c 51 int distance; member in struct:etc2_block
381 /* pick distance */
382 block->distance =
389 block->distance);
392 block->distance);
412 /* pick distance */
413 block->distance =
420 block->distance);
422 block->distance);
424 block->distance);
    [all...]
  /xsrc/external/mit/MesaLib.old/dist/src/mesa/main/
texcompress_etc.c 51 int distance; member in struct:etc2_block
381 /* pick distance */
382 block->distance =
389 block->distance);
392 block->distance);
412 /* pick distance */
413 block->distance =
420 block->distance);
422 block->distance);
424 block->distance);
    [all...]
  /xsrc/external/mit/xedit/dist/lisp/re/
re.c 1911 int length, offset = 0, distance, jump = 0, bas = 0; local
2014 distance = inf->len - offset;
2015 if (distance > 255) {
2018 rec_byte(inf, distance & 0xff) ||
2019 rec_byte(inf, (distance & 0xff00) >> 8))
2024 rec_byte(inf, distance))
2026 distance = inf->len - offset;
2027 inf->cod[jump] = distance & 0xff;
2028 inf->cod[jump + 1] = (distance & 0xff00) >> 8;
2078 /* Calculate jump distance information *
2233 int distance, i, bas = inf->bas; local
2287 int distance, i, bas = inf->bas; local
    [all...]
  /xsrc/external/mit/xorg-server/dist/Xi/
xibarriers.c 219 * @param[out] distance The distance between the start point and the
225 int x1, int y1, int x2, int y2, double *distance)
241 *distance = sqrt((pow(y - y1, 2) + pow(barrier->x1 - x1, 2)));
258 *distance = sqrt((pow(x - x1, 2) + pow(barrier->y1 - y1, 2)));
338 double distance; local
353 if (barrier_is_blocking(b, x1, y1, x2, y2, &distance)) {
354 if (min_distance > distance) {
355 min_distance = distance;
  /xsrc/external/mit/MesaLib/dist/src/amd/compiler/
aco_lower_to_hw_instr.cpp 1542 /* distance might underflow */
1543 unsigned distance = it->first.reg_b + i - copy.second.op.physReg().reg_b; local
1544 if (distance < copy.second.bytes)
1587 /* distance might underflow */
1670 /* distance might underflow */
1671 unsigned distance = copy.first.reg_b + i - it->second.op.physReg().reg_b; local
1672 if (distance < it->second.bytes && copy.second.uses[i] == 1 &&
1673 !it->second.uses[distance])
1729 /* distance might underflow */
1730 unsigned distance = other.first.reg_b + i - copy.second.op.physReg().reg_b local
    [all...]
aco_spill.cpp 177 /* to compute the next use distance at the beginning of the block, we have to add the block's
214 std::pair<uint32_t, uint32_t> distance{block_idx, 0};
220 distance = it->second;
228 std::make_pair(instr->operands[i].getTemp(), distance));
231 if (inserted || entry_distance != distance)
233 entry_distance = distance;
245 uint32_t distance = pair.second.second; local
250 distance += 0xFFFF;
258 distance = std::min(entry_distance.second, distance);
533 unsigned distance = 0; local
574 unsigned distance = 0; local
730 unsigned distance = 0; local
1217 unsigned distance = 0; local
    [all...]
  /xsrc/external/mit/fontconfig/dist/src/
fccharset.c 181 ptrdiff_t distance; local
202 distance = (char *) new_leaves - (char *) leaves;
204 new_leaves[i] -= distance;
  /xsrc/external/mit/xedit/dist/lisp/
bytecode.c 2340 long jumpto, offset, distance; local
2346 /* Effective distance */
2347 distance = jumpto - offset;
2349 if (distance < -32768 || distance > 32767) {
2352 tree->data.signed_int = distance;
  /xsrc/external/mit/freetype/dist/src/truetype/
ttinterp.c 1711 * - round distance (MIRP, MDRP) or value (MIAP, MDAP)
1713 * - check minimum distance (MIRP,MDRP)
1728 * Moves a point by a given distance along the freedom vector. The
1735 * distance ::
1736 * The distance to apply.
1750 FT_F26Dot6 distance )
1764 FT_MulDiv( distance,
1776 FT_MulDiv( distance,
1784 FT_MulDiv( distance,
1802 FT_MulDiv( distance,
5870 FT_F26Dot6 distance; local
5941 FT_F26Dot6 distance; local
5987 FT_F26Dot6 distance; local
6101 FT_F26Dot6 org_dist, distance; local
6240 distance, local
6470 FT_F26Dot6 distance; local
6630 FT_F26Dot6 distance; local
    [all...]

Completed in 35 milliseconds

1 2