Home
last modified time | relevance | path

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

1234

/third_party/node/deps/ngtcp2/ngtcp2/lib/
H A Dngtcp2_gaptr.c31 ngtcp2_ksl_init(&gaptr->gap, ngtcp2_ksl_range_compar, sizeof(ngtcp2_range), in ngtcp2_gaptr_init()
41 rv = ngtcp2_ksl_insert(&gaptr->gap, NULL, &range, NULL); in gaptr_gap_init()
54 ngtcp2_ksl_free(&gaptr->gap); in ngtcp2_gaptr_free()
62 if (ngtcp2_ksl_len(&gaptr->gap) == 0) { in ngtcp2_gaptr_push()
69 it = ngtcp2_ksl_lower_bound_compar(&gaptr->gap, &q, in ngtcp2_gaptr_push()
80 ngtcp2_ksl_remove_hint(&gaptr->gap, &it, &it, &k); in ngtcp2_gaptr_push()
85 ngtcp2_ksl_update_key(&gaptr->gap, &k, &l); in ngtcp2_gaptr_push()
88 rv = ngtcp2_ksl_insert(&gaptr->gap, &it, &r, NULL); in ngtcp2_gaptr_push()
94 ngtcp2_ksl_update_key(&gaptr->gap, &k, &r); in ngtcp2_gaptr_push()
105 if (ngtcp2_ksl_len(&gaptr->gap) in ngtcp2_gaptr_first_gap_offset()
[all...]
H A Dngtcp2_idtr.c30 ngtcp2_gaptr_init(&idtr->gap, mem); in ngtcp2_idtr_init()
40 ngtcp2_gaptr_free(&idtr->gap); in ngtcp2_idtr_free()
59 if (ngtcp2_gaptr_is_pushed(&idtr->gap, q, 1)) { in ngtcp2_idtr_open()
63 return ngtcp2_gaptr_push(&idtr->gap, q, 1); in ngtcp2_idtr_open()
74 return ngtcp2_gaptr_is_pushed(&idtr->gap, q, 1); in ngtcp2_idtr_is_open()
78 return ngtcp2_gaptr_first_gap_offset(&idtr->gap); in ngtcp2_idtr_first_gap()
H A Dngtcp2_strm.c201 ngtcp2_range gap; in strm_streamfrq_unacked_pop() local
221 gap = ngtcp2_strm_get_unacked_range_after(strm, offset); in strm_streamfrq_unacked_pop()
222 if (gap.begin < offset) { in strm_streamfrq_unacked_pop()
223 gap.begin = offset; in strm_streamfrq_unacked_pop()
226 for (; idx < fr->datacnt && offset < gap.begin; ++idx) { in strm_streamfrq_unacked_pop()
228 if (offset + v->len > gap.begin) { in strm_streamfrq_unacked_pop()
229 base_offset = gap.begin - offset; in strm_streamfrq_unacked_pop()
263 assert(gap.begin == offset + base_offset); in strm_streamfrq_unacked_pop()
271 if (end_offset + v->len > gap.end) { in strm_streamfrq_unacked_pop()
272 end_base_offset = gap in strm_streamfrq_unacked_pop()
549 ngtcp2_range gap; ngtcp2_strm_streamfrq_unacked_offset() local
630 ngtcp2_range gap; ngtcp2_strm_get_unacked_range_after() local
[all...]
/third_party/node/deps/ngtcp2/nghttp3/lib/
H A Dnghttp3_gaptr.c32 nghttp3_ksl_init(&gaptr->gap, nghttp3_ksl_range_compar, sizeof(nghttp3_range), in nghttp3_gaptr_init()
42 rv = nghttp3_ksl_insert(&gaptr->gap, NULL, &range, NULL); in gaptr_gap_init()
55 nghttp3_ksl_free(&gaptr->gap); in nghttp3_gaptr_free()
64 if (nghttp3_ksl_len(&gaptr->gap) == 0) { in nghttp3_gaptr_push()
71 it = nghttp3_ksl_lower_bound_compar(&gaptr->gap, &q, in nghttp3_gaptr_push()
82 nghttp3_ksl_remove_hint(&gaptr->gap, &it, &it, &k); in nghttp3_gaptr_push()
87 nghttp3_ksl_update_key(&gaptr->gap, &k, &l); in nghttp3_gaptr_push()
90 rv = nghttp3_ksl_insert(&gaptr->gap, &it, &r, NULL); in nghttp3_gaptr_push()
96 nghttp3_ksl_update_key(&gaptr->gap, &k, &r); in nghttp3_gaptr_push()
107 if (nghttp3_ksl_len(&gaptr->gap) in nghttp3_gaptr_first_gap_offset()
[all...]
H A Dnghttp3_idtr.c31 nghttp3_gaptr_init(&idtr->gap, mem); in nghttp3_idtr_init()
41 nghttp3_gaptr_free(&idtr->gap); in nghttp3_idtr_free()
60 if (nghttp3_gaptr_is_pushed(&idtr->gap, q, 1)) { in nghttp3_idtr_open()
64 return nghttp3_gaptr_push(&idtr->gap, q, 1); in nghttp3_idtr_open()
75 return nghttp3_gaptr_is_pushed(&idtr->gap, q, 1); in nghttp3_idtr_is_open()
79 return nghttp3_gaptr_first_gap_offset(&idtr->gap); in nghttp3_idtr_first_gap()
/third_party/ffmpeg/libavformat/
H A Drtmpdigest.c34 int ff_rtmp_calc_digest(const uint8_t *src, int len, int gap, in ff_rtmp_calc_digest() argument
44 if (gap <= 0) { in ff_rtmp_calc_digest()
47 av_hmac_update(hmac, src, gap); in ff_rtmp_calc_digest()
48 av_hmac_update(hmac, src + gap + 32, len - gap - 32); in ff_rtmp_calc_digest()
/third_party/skia/samplecode/
H A DSampleMixer.cpp40 void dodraw(SkCanvas* canvas, sk_sp<SkColorFilter> cf0, sk_sp<SkColorFilter> cf1, float gap) { in dodraw() argument
46 canvas->drawImage(fImg, fImg->width() + gap * fWeight, 0, in dodraw()
50 canvas->drawImage(fImg, 2*fImg->width() + gap, 0, SkSamplingOptions(), &paint); in dodraw()
60 float gap = fImg->width() * 3; variable
63 dodraw(canvas, nullptr, fCF1, gap);
65 dodraw(canvas, fCF0, nullptr, gap);
67 dodraw(canvas, fCF0, fCF1, gap);
/third_party/node/deps/v8/src/json/
H A Djson-stringifier.cc31 Handle<Object> gap);
37 bool InitializeGap(Handle<Object> gap);
143 Handle<Object> replacer, Handle<Object> gap) { in JsonStringify()
145 return stringifier.Stringify(object, replacer, gap); in JsonStringify()
227 Handle<Object> gap) { in Stringify()
229 if (!gap->IsUndefined(isolate_) && !InitializeGap(gap)) { in Stringify()
289 bool JsonStringifier::InitializeGap(Handle<Object> gap) { in InitializeGap() argument
292 if (gap->IsJSPrimitiveWrapper()) { in InitializeGap()
293 Handle<Object> value(Handle<JSPrimitiveWrapper>::cast(gap) in InitializeGap()
142 JsonStringify(Isolate* isolate, Handle<Object> object, Handle<Object> replacer, Handle<Object> gap) JsonStringify() argument
225 Stringify(Handle<Object> object, Handle<Object> replacer, Handle<Object> gap) Stringify() argument
[all...]
/third_party/node/deps/brotli/c/enc/
H A Dentropy_encode.h104 size_t gap = kBrotliShellGaps[g]; in SortHuffmanTreeItems()
106 for (i = gap; i < n; ++i) { in SortHuffmanTreeItems()
109 for (; j >= gap && comparator(&tmp, &items[j - gap]); j -= gap) { in SortHuffmanTreeItems()
110 items[j] = items[j - gap]; in SortHuffmanTreeItems()
H A Dmemory.c73 size_t gap = gaps[g]; in SortPointers() local
75 for (i = gap; i < n; ++i) { in SortPointers()
78 for (; j >= gap && tmp < items[j - gap]; j -= gap) { in SortPointers()
79 items[j] = items[j - gap]; in SortPointers()
H A Dbackward_references_inc.h31 const size_t gap = 0; in CreateBackwardReferences() local
52 max_distance, dictionary_start + gap, params->dist.max_distance, &sr); in CreateBackwardReferences()
71 max_distance, dictionary_start + gap, params->dist.max_distance, in CreateBackwardReferences() local
94 sr.distance, dictionary_start + gap, dist_cache); in CreateBackwardReferences()
95 if ((sr.distance <= (dictionary_start + gap)) && distance_code > 0) { in CreateBackwardReferences()
H A Dbackward_references_hq.c332 const size_t gap, in ComputeDistanceShortcut()
339 this or greater than |max_backward_limit| + |gap| are static dictionary in ComputeDistanceShortcut()
344 } else if (dist + clen <= block_start + pos + gap && in ComputeDistanceShortcut()
345 dist <= max_backward_limit + gap && in ComputeDistanceShortcut()
383 const size_t gap, const int* starting_dist_cache, in EvaluateNode()
388 block_start, pos, max_backward_limit, gap, nodes); in EvaluateNode()
421 size_t gap = 0; in UpdateNodes() local
423 EvaluateNode(block_start + stream_offset, pos, max_backward_limit, gap, in UpdateNodes()
457 if (BROTLI_PREDICT_FALSE(backward > dictionary_start + gap)) { in UpdateNodes()
512 TO_BROTLI_BOOL(dist > dictionary_start + gap); in UpdateNodes()
329 ComputeDistanceShortcut(const size_t block_start, const size_t pos, const size_t max_backward_limit, const size_t gap, const ZopfliNode* nodes) ComputeDistanceShortcut() 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) EvaluateNode() argument
580 size_t gap = 0; BrotliZopfliCreateCommands() local
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) ZopfliIterate() argument
670 size_t gap = 0; BrotliZopfliComputeShortestPath() local
759 size_t gap = 0; BrotliCreateHqZopfliBackwardReferences() local
[all...]
/third_party/skia/third_party/externals/brotli/c/enc/
H A Dentropy_encode.h104 size_t gap = kBrotliShellGaps[g]; in SortHuffmanTreeItems()
106 for (i = gap; i < n; ++i) { in SortHuffmanTreeItems()
109 for (; j >= gap && comparator(&tmp, &items[j - gap]); j -= gap) { in SortHuffmanTreeItems()
110 items[j] = items[j - gap]; in SortHuffmanTreeItems()
H A Dmemory.c73 size_t gap = gaps[g]; in SortPointers() local
75 for (i = gap; i < n; ++i) { in SortPointers()
78 for (; j >= gap && tmp < items[j - gap]; j -= gap) { in SortPointers()
79 items[j] = items[j - gap]; in SortPointers()
H A Dbackward_references_inc.h31 const size_t gap = 0; in CreateBackwardReferences() local
52 max_distance, dictionary_start + gap, params->dist.max_distance, &sr); in CreateBackwardReferences()
71 max_distance, dictionary_start + gap, params->dist.max_distance, in CreateBackwardReferences() local
94 sr.distance, dictionary_start + gap, dist_cache); in CreateBackwardReferences()
95 if ((sr.distance <= (dictionary_start + gap)) && distance_code > 0) { in CreateBackwardReferences()
H A Dbackward_references_hq.c332 const size_t gap, in ComputeDistanceShortcut()
339 this or greater than |max_backward_limit| + |gap| are static dictionary in ComputeDistanceShortcut()
344 } else if (dist + clen <= block_start + pos + gap && in ComputeDistanceShortcut()
345 dist <= max_backward_limit + gap && in ComputeDistanceShortcut()
383 const size_t gap, const int* starting_dist_cache, in EvaluateNode()
388 block_start, pos, max_backward_limit, gap, nodes); in EvaluateNode()
421 size_t gap = 0; in UpdateNodes() local
423 EvaluateNode(block_start + stream_offset, pos, max_backward_limit, gap, in UpdateNodes()
457 if (BROTLI_PREDICT_FALSE(backward > dictionary_start + gap)) { in UpdateNodes()
512 TO_BROTLI_BOOL(dist > dictionary_start + gap); in UpdateNodes()
329 ComputeDistanceShortcut(const size_t block_start, const size_t pos, const size_t max_backward_limit, const size_t gap, const ZopfliNode* nodes) ComputeDistanceShortcut() 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) EvaluateNode() argument
580 size_t gap = 0; BrotliZopfliCreateCommands() local
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) ZopfliIterate() argument
670 size_t gap = 0; BrotliZopfliComputeShortestPath() local
759 size_t gap = 0; BrotliCreateHqZopfliBackwardReferences() local
[all...]
/third_party/python/Objects/stringlib/
H A Dfastsearch.h309 Py_ssize_t gap; in STRINGLIB() local
329 p->gap = 0; // unused in _preprocess()
334 // The gap between the last character and the previous in _preprocess()
336 p->gap = len_needle; in _preprocess()
341 p->gap = len_needle - 1 - i; in _preprocess()
434 Py_ssize_t gap = p->gap; in _two_way() local
435 period = Py_MAX(gap, period); in _two_way()
437 Py_ssize_t gap_jump_end = Py_MIN(len_needle, cut + gap); in _two_way()
457 LOG("Early right half mismatch: jump by gap in _two_way()
545 Py_ssize_t gap = mlast; default_find() local
605 Py_ssize_t gap = mlast; adaptive_find() local
[all...]
/third_party/icu/icu4j/demos/src/com/ibm/icu/dev/demo/holiday/
H A DHolidayBorderPanel.java69 /** Default gap between border and contained component (5). */
82 private int gap; field in HolidayBorderPanel
97 gap = DEFAULT_GAP; in HolidayBorderPanel()
192 int dist = thickness + gap; in getInsets()
244 * Sets the gap between the border and the contained Component.
246 * @param gap The new gap, in pixels.
248 public HolidayBorderPanel setGap(int gap) { in setGap() argument
250 if (gap > -1) { in setGap()
251 this.gap in setGap()
[all...]
/third_party/ltp/testcases/cve/
H A Dstack_clash.c12 * that there is at least 256 PAGE_SIZE of stack guard gap which is considered
28 * guard gap. This part of the test works by forcing a bottom up search. The
29 * assumptions are that the stack grows down (start gap) and either:
190 static void do_mmap_placement_test(unsigned long stack_addr, unsigned long gap) in do_mmap_placement_test() argument
198 * path should fail, and search up might take a look at the guard gap in do_mmap_placement_test()
200 * uses it, the allocation will be in the gap and the test should fail. in do_mmap_placement_test()
205 if (stack_addr - gap <= (unsigned long)map_test_gap && in do_mmap_placement_test()
207 tst_res(TFAIL, "New mmap was placed in the guard gap."); in do_mmap_placement_test()
218 unsigned long gap = GAP_PAGES * page_size; in do_child() local
233 mapped_addr = stack_addr - gap in do_child()
[all...]
/third_party/skia/gm/
H A Darithmode.cpp111 SkScalar gap = SkIntToScalar(WW + 20); variable
116 canvas->translate(gap, 0);
118 canvas->translate(gap, 0);
125 canvas->translate(gap, 0);
143 canvas->translate(gap, 0);
145 canvas->translate(gap, 0);
155 canvas->translate(gap, 0);
H A Dcomposeshader.cpp331 const SkScalar gap = 4; in draw_pair() local
332 SkRect r = SkRect::MakeWH(2 * gCellSize + gap, 2 * gCellSize + gap); in draw_pair()
333 r.outset(gap + 1.5f, gap + 1.5f); in draw_pair()
342 canvas->translate(gCellSize + gap, 0); in draw_pair()
346 canvas->translate(0, gCellSize + gap); in draw_pair()
/third_party/skia/src/utils/
H A DSkDashPath.cpp23 SkScalar gap = intervals[i]; in find_first_interval() local
24 if (phase > gap || (phase == gap && gap)) { in find_first_interval()
25 phase -= gap; in find_first_interval()
28 return gap - phase; in find_first_interval()
/third_party/skia/tools/flags/
H A DCommandLineFlags.cpp167 int gap; in print_indented() local
171 gap = 0; in print_indented()
174 gap = 1; in print_indented()
177 currLine += spaceIndex + gap; in print_indented()
/third_party/skia/third_party/externals/dng_sdk/source/
H A Ddng_utils.h657 real32 gap = v - Min_real32 (r, Min_real32 (g, b)); in DNG_RGBtoHSV() local
659 if (gap > 0.0f) in DNG_RGBtoHSV()
665 h = (g - b) / gap; in DNG_RGBtoHSV()
676 h = 2.0f + (b - r) / gap; in DNG_RGBtoHSV()
681 h = 4.0f + (r - g) / gap; in DNG_RGBtoHSV()
684 s = gap / v; in DNG_RGBtoHSV()
/third_party/ltp/testcases/kernel/kvm/
H A DMakefile59 objcopy -O binary -j .init.boot -j .text -j .data -j .init -j .preinit_array -j .init_array --gap-fill=0 $*-payload.elf $*-payload.bin
63 @objcopy -O binary -j .init.boot -j .text -j .data -j .init -j .preinit_array -j .init_array --gap-fill=0 $*-payload.elf $*-payload.bin

Completed in 15 milliseconds

1234