Searched refs:gap (Results 1 - 25 of 37) sorted by relevance

12

/xsrc/external/mit/brotli/dist/c/enc/
H A Dentropy_encode.h104 size_t gap = kBrotliShellGaps[g]; local in function:SortHuffmanTreeItems
106 for (i = gap; i < n; ++i) {
109 for (; j >= gap && comparator(&tmp, &items[j - gap]); j -= gap) {
110 items[j] = items[j - gap];
H A Dmemory.c73 size_t gap = gaps[g]; local in function:SortPointers
75 for (i = gap; i < n; ++i) {
78 for (; j >= gap && tmp < items[j - gap]; j -= gap) {
79 items[j] = items[j - gap];
H A Dbackward_references_inc.h31 const size_t gap = 0; local in function:EXPORT_FN
52 max_distance, dictionary_start + gap, params->dist.max_distance, &sr);
71 max_distance, dictionary_start + gap, params->dist.max_distance,
94 sr.distance, dictionary_start + gap, dist_cache);
95 if ((sr.distance <= (dictionary_start + gap)) && distance_code > 0) {
H A Dbackward_references_hq.c332 const size_t gap,
339 this or greater than |max_backward_limit| + |gap| are static dictionary
344 } else if (dist + clen <= block_start + pos + gap &&
345 dist <= max_backward_limit + gap &&
383 const size_t gap, const int* starting_dist_cache,
388 block_start, pos, max_backward_limit, gap, nodes);
421 size_t gap = 0; local in function:UpdateNodes
423 EvaluateNode(block_start + stream_offset, pos, max_backward_limit, gap,
457 if (BROTLI_PREDICT_FALSE(backward > dictionary_start + gap)) {
512 TO_BROTLI_BOOL(dist > dictionary_start + gap);
329 ComputeDistanceShortcut(const size_t block_start,const size_t pos,const size_t max_backward_limit,const size_t gap,const ZopfliNode * nodes) argument
381 EvaluateNode(const size_t block_start,const size_t pos,const size_t max_backward_limit,const size_t gap,const int * starting_dist_cache,const ZopfliCostModel * model,StartPosQueue * queue,ZopfliNode * nodes) argument
580 size_t gap = 0; local in function:BrotliZopfliCreateCommands
616 ZopfliIterate(size_t num_bytes,size_t position,const uint8_t * ringbuffer,size_t ringbuffer_mask,const BrotliEncoderParams * params,const size_t gap,const int * dist_cache,const ZopfliCostModel * model,const uint32_t * num_matches,const BackwardMatch * matches,ZopfliNode * nodes) argument
670 size_t gap = 0; local in function:BrotliZopfliComputeShortestPath
759 size_t gap = 0; local in function:BrotliCreateHqZopfliBackwardReferences
[all...]
/xsrc/external/mit/xf86-video-geode/dist/src/
H A Dlx_memory.c142 unsigned int gap; local in function:GeodeAllocOffscreen
145 gap = pGeode->offscreenSize + pGeode->offscreenStart;
148 gap = ptr->next->offset;
150 gap = gap - (ptr->offset + ptr->size);
151 gap = ALIGN(gap, align);
153 if (size < gap) {
/xsrc/external/mit/libXmu/dist/src/
H A DDrawLogo.c47 int thin, gap, d31; local in function:XmuDrawLogo
76 gap = (thin+3) / 4;
77 d31 = thin + thin + gap;
138 * Erase to create gap.
148 poly[1].x = x + size-( thin+gap); poly[1].y = y;
150 poly[3].x = x + thin + gap; poly[3].y = y + size;
/xsrc/external/mit/xlogo/dist/
H A DRenderLogo.c63 double thin, thick, gap, d31; local in function:RenderLogo
77 gap = thin / 4.0;
78 d31 = thin + thin + gap;
92 gap_left.p1.x = x + size-( thin+gap); gap_left.p1.y = y;
96 gap_right.p2.x = x + thin + gap; gap_right.p2.y = y + size;
/xsrc/external/mit/ctwm/dist/
H A Danimate.c60 unsigned long gap; local in function:TryToAnimate
67 gap = ((tp.tv_sec - lastsec) * 1000000) + (tp.tv_usec - lastusec);
70 lastusec, (long)tp.tv_sec, (long)tp.tv_usec, gap);
73 gap *= AnimationSpeed;
74 if(gap < 1000000) {
/xsrc/external/mit/xterm/dist/vttests/
H A Dtitlestack.pl519 my $gap = " " . chr(215) . " ";
527 . $gap
529 . $gap
531 . $gap
533 . $gap
/xsrc/external/mit/xorg-server/dist/xkb/
H A DxkbUtils.c936 int gap; local in function:_XkbCopyClientMap
966 gap = MAP_LENGTH - (src->max_key_code + 1);
976 if (gap > 0) {
977 memset((char *) &dst->map->key_sym_map[gap], 0,
978 gap * sizeof(XkbSymMapRec));
1156 if (gap > 0) {
1157 memset(dst->map->modmap + gap, 0, gap);
1178 int gap; local in function:_XkbCopyServerMap
1189 gap
1293 int gap; local in function:_XkbCopyNames
[all...]
H A Dxkbgeom.h197 short gap; member in struct:_XkbKey
/xsrc/external/mit/xorg-server.old/dist/hw/xfree86/common/
H A Dxf86Mode.c125 int i, j, k, gap; local in function:xf86GetNearestClock
138 gap = abs((freq * j) - ((scrp->clock[i] * DivFactor) / MulFactor));
139 if ((gap < minimumGap) ||
140 ((gap == minimumGap) && (j < nearestDiv))) {
141 minimumGap = gap;
457 int i, k, gap, minimumGap = CLOCK_TOLERANCE + 1; local in function:xf86LookupMode
576 gap = abs((p->Clock * 2) -
580 gap = abs(p->Clock -
583 if (gap > minimumGap) {
607 if (gap < minimumGa
990 int i, k, gap, minimumGap = CLOCK_TOLERANCE + 1; local in function:xf86CheckModeForDriver
[all...]
/xsrc/external/mit/xorg-server/dist/hw/xfree86/common/
H A Dxf86Mode.c125 int i, j, k, gap; local in function:xf86GetNearestClock
138 gap = abs((freq * j) - ((scrp->clock[i] * DivFactor) / MulFactor));
139 if ((gap < minimumGap) || ((gap == minimumGap) && (j < nearestDiv))) {
140 minimumGap = gap;
460 int i, k, gap, minimumGap = CLOCK_TOLERANCE + 1; local in function:xf86LookupMode
584 gap = abs((p->Clock * 2) -
588 gap = abs(p->Clock -
591 if (gap > minimumGap) {
615 if (gap < minimumGa
992 int i, k, gap, minimumGap = CLOCK_TOLERANCE + 1; local in function:xf86CheckModeForDriver
[all...]
/xsrc/external/mit/libX11/dist/src/xkb/
H A DXKBGeom.c128 if (key->gap != 0) {
129 pos += key->gap;
137 if (key->gap != 0) {
138 pos += key->gap;
561 key->gap = keyWire->gap;
H A DXKBSetGeom.c362 keyWire[k].gap = key->gap;
/xsrc/external/mit/libxkbfile/dist/include/X11/extensions/
H A DXKMformat.h199 INT16 gap; member in struct:_xkmKeyDesc
/xsrc/external/mit/libX11/dist/include/X11/extensions/
H A DXKBgeom.h171 short gap; member in struct:_XkbKey
/xsrc/external/mit/xorg-server.old/dist/xkb/
H A Dxkbgeom.h208 short gap; member in struct:_XkbKey
H A Dxkmread.c969 key->gap= keyWire.gap;
/xsrc/external/mit/xorgproto/dist/include/X11/extensions/
H A DXKBgeom.h215 short gap; member in struct:_XkbKey
/xsrc/external/mit/libxkbui/dist/src/
H A DXKBui.c488 y+= key->gap;
493 x+= key->gap;
/xsrc/external/mit/MesaLib/dist/src/amd/compiler/
H A Daco_register_allocation.cpp384 /* Use a slightly shorter box to leave a small gap between adjacent variables */
847 /* best fit algorithm: find the smallest gap to fit in the variable */
868 PhysRegInterval gap = PhysRegInterval::from_until(*reg_it, *next_nonfree_it); local in function:aco::__anon1a58e4b40110::get_reg_simple
871 if (size == gap.size) {
872 adjust_max_used_regs(ctx, rc, gap.lo());
873 return {gap.lo(), true};
876 /* check if it fits and the gap size is smaller */
877 if (size < gap.size && gap.size < best_gap.size) {
878 best_gap = gap;
[all...]
/xsrc/external/mit/xkbcomp/dist/
H A Dgeometry.c137 short gap; member in struct:_KeyInfo
333 key->gap = 0;
2032 if (uStrCaseCmp(field, "gap") == 0)
2045 key->gap = tmp.ival;
2611 if (!SetKeyField(key, "gap", NULL, expr, info))
3589 key->gap = ki->gap;
/xsrc/external/mit/libxkbfile/dist/src/
H A Dxkmout.c1032 keyWire.gap = key->gap;
H A Dxkmread.c910 key->gap = keyWire.gap;

Completed in 31 milliseconds

12