Home
last modified time | relevance | path

Searched refs:full (Results 1 - 25 of 222) sorted by relevance

123456789

/third_party/ffmpeg/libavcodec/
H A Dqpeldsp.c199 uint8_t full[16 * 9]; \
202 copy_block8(full, src, 16, stride, 9); \
203 put ## RND ## mpeg4_qpel8_v_lowpass(half, full, 8, 16); \
204 OPNAME ## pixels8_l2_8(dst, full, half, stride, 16, 8, 8); \
210 uint8_t full[16 * 9]; \
212 copy_block8(full, src, 16, stride, 9); \
213 OPNAME ## mpeg4_qpel8_v_lowpass(dst, full, stride, 16); \
219 uint8_t full[16 * 9]; \
222 copy_block8(full, src, 16, stride, 9); \
223 put ## RND ## mpeg4_qpel8_v_lowpass(half, full,
[all...]
H A Dsamidec.c38 AVBPrint full; member
118 av_bprint_clear(&sami->full); in sami_paragraph_to_ass()
123 av_bprintf(&sami->full, "{\\i1}%s{\\i0}\\N", sami->encoded_source.str); in sami_paragraph_to_ass()
128 av_bprintf(&sami->full, "%s", sami->encoded_content.str); in sami_paragraph_to_ass()
146 ret = ff_ass_add_rect(sub, sami->full.str, sami->readorder++, 0, NULL, NULL); in sami_decode_frame()
161 av_bprint_init(&sami->full, 0, 2048); in sami_init()
172 av_bprint_finalize(&sami->full, NULL); in sami_close()
H A Dh264qpel_template.c407 uint8_t full[SIZE*(SIZE+5)*sizeof(pixel)];\
408 uint8_t * const full_mid= full + SIZE*2*sizeof(pixel);\
410 FUNC(copy_block ## SIZE )(full, src - stride*2, SIZE*sizeof(pixel), stride, SIZE + 5);\
417 uint8_t full[SIZE*(SIZE+5)*sizeof(pixel)];\
418 uint8_t * const full_mid= full + SIZE*2*sizeof(pixel);\
419 FUNC(copy_block ## SIZE )(full, src - stride*2, SIZE*sizeof(pixel), stride, SIZE + 5);\
425 uint8_t full[SIZE*(SIZE+5)*sizeof(pixel)];\
426 uint8_t * const full_mid= full + SIZE*2*sizeof(pixel);\
428 FUNC(copy_block ## SIZE )(full, src - stride*2, SIZE*sizeof(pixel), stride, SIZE + 5);\
435 uint8_t full[SIZ
[all...]
H A Drv40dsp.c127 uint8_t full[SIZE*(SIZE+5)];\
128 uint8_t * const full_mid = full + SIZE*2;\
129 put_rv40_qpel ## SIZE ## _h_lowpass(full, src - 2*stride, SIZE, stride, SIZE+5, 52, 20, 6);\
135 uint8_t full[SIZE*(SIZE+5)];\
136 uint8_t * const full_mid = full + SIZE*2;\
137 put_rv40_qpel ## SIZE ## _h_lowpass(full, src - 2*stride, SIZE, stride, SIZE+5, 20, 20, 5);\
143 uint8_t full[SIZE*(SIZE+5)];\
144 uint8_t * const full_mid = full + SIZE*2;\
145 put_rv40_qpel ## SIZE ## _h_lowpass(full, src - 2*stride, SIZE, stride, SIZE+5, 20, 52, 6);\
151 uint8_t full[SIZ
[all...]
/third_party/ffmpeg/libavcodec/mips/
H A Dh264qpel_mmi.c2181 uint8_t full[36]; in ff_put_h264_qpel4_mc01_mmi() local
2182 uint8_t * const full_mid= full + 8; in ff_put_h264_qpel4_mc01_mmi()
2184 copy_block4_mmi(full, src - stride*2, 4, stride, 9); in ff_put_h264_qpel4_mc01_mmi()
2192 uint8_t full[36]; in ff_put_h264_qpel4_mc02_mmi() local
2193 uint8_t * const full_mid= full + 8; in ff_put_h264_qpel4_mc02_mmi()
2194 copy_block4_mmi(full, src - stride*2, 4, stride, 9); in ff_put_h264_qpel4_mc02_mmi()
2201 uint8_t full[36]; in ff_put_h264_qpel4_mc03_mmi() local
2202 uint8_t * const full_mid= full + 8; in ff_put_h264_qpel4_mc03_mmi()
2204 copy_block4_mmi(full, src - stride*2, 4, stride, 9); in ff_put_h264_qpel4_mc03_mmi()
2212 uint8_t full[3 in ff_put_h264_qpel4_mc11_mmi() local
2225 uint8_t full[36]; ff_put_h264_qpel4_mc31_mmi() local
2238 uint8_t full[36]; ff_put_h264_qpel4_mc13_mmi() local
2251 uint8_t full[36]; ff_put_h264_qpel4_mc33_mmi() local
2290 uint8_t full[36]; ff_put_h264_qpel4_mc12_mmi() local
2303 uint8_t full[36]; ff_put_h264_qpel4_mc32_mmi() local
2345 uint8_t full[36]; ff_avg_h264_qpel4_mc01_mmi() local
2356 uint8_t full[36]; ff_avg_h264_qpel4_mc02_mmi() local
2365 uint8_t full[36]; ff_avg_h264_qpel4_mc03_mmi() local
2376 uint8_t full[36]; ff_avg_h264_qpel4_mc11_mmi() local
2389 uint8_t full[36]; ff_avg_h264_qpel4_mc31_mmi() local
2402 uint8_t full[36]; ff_avg_h264_qpel4_mc13_mmi() local
2415 uint8_t full[36]; ff_avg_h264_qpel4_mc33_mmi() local
2454 uint8_t full[36]; ff_avg_h264_qpel4_mc12_mmi() local
2467 uint8_t full[36]; ff_avg_h264_qpel4_mc32_mmi() local
2509 uint8_t full[104]; ff_put_h264_qpel8_mc01_mmi() local
2520 uint8_t full[104]; ff_put_h264_qpel8_mc02_mmi() local
2529 uint8_t full[104]; ff_put_h264_qpel8_mc03_mmi() local
2540 uint8_t full[104]; ff_put_h264_qpel8_mc11_mmi() local
2553 uint8_t full[104]; ff_put_h264_qpel8_mc31_mmi() local
2566 uint8_t full[104]; ff_put_h264_qpel8_mc13_mmi() local
2579 uint8_t full[104]; ff_put_h264_qpel8_mc33_mmi() local
2673 uint8_t full[104]; ff_avg_h264_qpel8_mc01_mmi() local
2684 uint8_t full[104]; ff_avg_h264_qpel8_mc02_mmi() local
2693 uint8_t full[104]; ff_avg_h264_qpel8_mc03_mmi() local
2704 uint8_t full[104]; ff_avg_h264_qpel8_mc11_mmi() local
2717 uint8_t full[104]; ff_avg_h264_qpel8_mc31_mmi() local
2730 uint8_t full[104]; ff_avg_h264_qpel8_mc13_mmi() local
2743 uint8_t full[104]; ff_avg_h264_qpel8_mc33_mmi() local
2837 uint8_t full[336]; ff_put_h264_qpel16_mc01_mmi() local
2848 uint8_t full[336]; ff_put_h264_qpel16_mc02_mmi() local
2857 uint8_t full[336]; ff_put_h264_qpel16_mc03_mmi() local
2868 uint8_t full[336]; ff_put_h264_qpel16_mc11_mmi() local
2881 uint8_t full[336]; ff_put_h264_qpel16_mc31_mmi() local
2894 uint8_t full[336]; ff_put_h264_qpel16_mc13_mmi() local
2907 uint8_t full[336]; ff_put_h264_qpel16_mc33_mmi() local
3001 uint8_t full[336]; ff_avg_h264_qpel16_mc01_mmi() local
3012 uint8_t full[336]; ff_avg_h264_qpel16_mc02_mmi() local
3021 uint8_t full[336]; ff_avg_h264_qpel16_mc03_mmi() local
3032 uint8_t full[336]; ff_avg_h264_qpel16_mc11_mmi() local
3045 uint8_t full[336]; ff_avg_h264_qpel16_mc31_mmi() local
3058 uint8_t full[336]; ff_avg_h264_qpel16_mc13_mmi() local
3071 uint8_t full[336]; ff_avg_h264_qpel16_mc33_mmi() local
[all...]
/third_party/node/deps/npm/node_modules/negotiator/lib/
H A Dlanguage.js59 var full = prefix
61 if (suffix) full += "-" + suffix;
77 full: full
109 if(spec.full.toLowerCase() === p.full.toLowerCase()){
111 } else if (spec.prefix.toLowerCase() === p.full.toLowerCase()) {
113 } else if (spec.full.toLowerCase() === p.prefix.toLowerCase()) {
115 } else if (spec.full !== '*' ) {
164 * Get full languag
[all...]
/third_party/lame/frontend/
H A Dbrhist.c135 brhist_disp_line(int i, int br_hist_TOT, int br_hist_LR, int full, int frames) in brhist_disp_line() argument
142 if (full != 0) { in brhist_disp_line()
144 barlen_TOT = (br_hist_TOT * (Console_IO.disp_width - res) + full - 1) / full; /* round up */ in brhist_disp_line()
145 barlen_LR = (br_hist_LR * (Console_IO.disp_width - res) + full - 1) / full; /* round up */ in brhist_disp_line()
171 progress_line(const lame_global_flags * gf, int full, int frames) in progress_line() argument
181 if (full < frames) { in progress_line()
182 full = frames; in progress_line()
185 time_in_sec = (float)(full in progress_line()
[all...]
/third_party/ltp/testcases/open_posix_testsuite/stress/semaphores/
H A Dmulti_con_pro.c4 * This file is licensed under the GPL license. For the full content
32 sem_t full; member
49 if (-1 == sem_wait(&buf->full)) { in producer()
53 if (-1 == sem_getvalue(&buf->full, &full_value)) { in producer()
57 printf("The value of the full semaphore is %d \n", full_value); in producer()
76 if (-1 == sem_wait(&buf->full)) { in producer()
80 if (-1 == sem_getvalue(&buf->full, &full_value)) { in producer()
84 printf("The value of the full is %d \n", full_value); in producer()
130 if (-1 == sem_post(&buf->full)) { in consumer()
134 if (-1 == sem_getvalue(&buf->full, in consumer()
[all...]
/third_party/icu/icu4c/source/common/
H A Duniset_closure.cpp134 // add the result of a full case mapping to the set
137 addCaseMapping(UnicodeSet &set, int32_t result, const UChar *full, UnicodeString &str) { in addCaseMapping() argument
143 // add a string case mapping from full with length result in addCaseMapping()
144 str.setTo((UBool)false, full, result); in addCaseMapping()
178 const UChar *full; in closeOver() local
185 // full case closure in closeOver()
193 result = ucase_toFullLower(cp, NULL, NULL, &full, UCASE_LOC_ROOT); in closeOver()
194 addCaseMapping(foldSet, result, full, str); in closeOver()
196 result = ucase_toFullTitle(cp, NULL, NULL, &full, UCASE_LOC_ROOT); in closeOver()
197 addCaseMapping(foldSet, result, full, st in closeOver()
[all...]
H A Ducase.cpp250 * full case mappings. Add them all. in ucase_addCaseClosure()
279 closure=(const UChar *)pe+1; /* behind this slot, unless there are full case mappings */ in ucase_addCaseClosure()
285 /* add the full case folding */ in ucase_addCaseClosure()
290 /* start of full case mapping strings */ in ucase_addCaseClosure()
299 /* add the full case folding string */ in ucase_addCaseClosure()
312 closure=(const UChar *)pe; /* behind full case mappings */ in ucase_addCaseClosure()
422 FullCaseFoldingIterator::next(UnicodeString &full) { in next() argument
431 // Set "full" to the NUL-terminated string in the first unfold column. in next()
434 full.setTo(false, p, length); in next()
1071 int32_t full; in ucase_toFullLower() local
1223 int32_t full, idx; toUpperOrTitle() local
1458 int32_t full, idx; ucase_toFullFolding() local
[all...]
/third_party/skia/third_party/externals/icu/source/common/
H A Duniset_closure.cpp134 // add the result of a full case mapping to the set
137 addCaseMapping(UnicodeSet &set, int32_t result, const UChar *full, UnicodeString &str) { in addCaseMapping() argument
143 // add a string case mapping from full with length result in addCaseMapping()
144 str.setTo((UBool)FALSE, full, result); in addCaseMapping()
178 const UChar *full; in closeOver() local
185 // full case closure in closeOver()
193 result = ucase_toFullLower(cp, NULL, NULL, &full, UCASE_LOC_ROOT); in closeOver()
194 addCaseMapping(foldSet, result, full, str); in closeOver()
196 result = ucase_toFullTitle(cp, NULL, NULL, &full, UCASE_LOC_ROOT); in closeOver()
197 addCaseMapping(foldSet, result, full, st in closeOver()
[all...]
H A Ducase.cpp256 * full case mappings. Add them all. in ucase_addCaseClosure()
285 closure=(const UChar *)pe+1; /* behind this slot, unless there are full case mappings */ in ucase_addCaseClosure()
291 /* add the full case folding */ in ucase_addCaseClosure()
296 /* start of full case mapping strings */ in ucase_addCaseClosure()
305 /* add the full case folding string */ in ucase_addCaseClosure()
318 closure=(const UChar *)pe; /* behind full case mappings */ in ucase_addCaseClosure()
428 FullCaseFoldingIterator::next(UnicodeString &full) { in next() argument
437 // Set "full" to the NUL-terminated string in the first unfold column. in next()
440 full.setTo(FALSE, p, length); in next()
1075 int32_t full; in ucase_toFullLower() local
1226 int32_t full, idx; toUpperOrTitle() local
1460 int32_t full, idx; ucase_toFullFolding() local
[all...]
/third_party/protobuf/java/core/src/main/java/com/google/protobuf/
H A DManifestSchemaFactory.java67 ExtensionSchemas.full(), in createSchema()
98 NewInstanceSchemas.full(), in newSchema()
99 ListFieldSchema.full(), in newSchema()
101 ExtensionSchemas.full(), in newSchema()
102 MapFieldSchemas.full()) in newSchema()
106 NewInstanceSchemas.full(), in newSchema()
107 ListFieldSchema.full(), in newSchema()
110 MapFieldSchemas.full()); in newSchema()
/third_party/skia/third_party/externals/abseil-cpp/absl/random/internal/
H A Dnanobenchmark.cc172 // full fence (no reordering across it in either direction). Unfortunately
187 // reference manual says it acts as a full fence (waiting until all earlier
599 InputVec full; in ReplicateInputs() local
601 full.assign(p.subset_ratio * num_skip, inputs[0]); in ReplicateInputs()
602 return full; in ReplicateInputs()
605 full.reserve(p.subset_ratio * num_skip * num_inputs); in ReplicateInputs()
607 full.insert(full.end(), inputs, inputs + num_inputs); in ReplicateInputs()
610 std::shuffle(full.begin(), full in ReplicateInputs()
616 FillSubset(const InputVec& full, const FuncInput input_to_skip, const size_t num_skip, InputVec* subset) FillSubset() argument
739 MeasureImpl(const Func func, const void* arg, const size_t num_skip, const InputVec& unique, const InputVec& full, const Params& p, Result* results) MeasureImpl() argument
788 const InputVec full = Measure() local
[all...]
/third_party/skia/tests/
H A DSkTOptionalTest.cpp221 // assign to an empty optional from a full optional in DEF_TEST()
222 skstd::optional<SkTOptionalTestPayload> full(1); in DEF_TEST()
223 o = std::move(full); in DEF_TEST()
228 REPORTER_ASSERT(r, full->fState == SkTOptionalTestPayload::kMovedFrom); in DEF_TEST()
230 // assign to a full optional from a full optional in DEF_TEST()
231 full = skstd::optional<SkTOptionalTestPayload>(2); in DEF_TEST()
232 o = std::move(full); in DEF_TEST()
237 REPORTER_ASSERT(r, full->fState == SkTOptionalTestPayload::kMovedFrom); in DEF_TEST()
239 // assign to a full optiona in DEF_TEST()
[all...]
/third_party/icu/icu4j/main/classes/core/src/com/ibm/icu/impl/
H A DUCaseProps.java254 * Adds all simple case mappings and the full case folding for c to sa,
303 * full case mappings. Add them all. in addCaseClosure()
331 closureOffset=(int)(value>>32)+1; /* behind this slot, unless there are full case mappings */ in addCaseClosure()
337 /* add the full case folding */ in addCaseClosure()
343 /* start of full case mapping strings */ in addCaseClosure()
352 /* add the full case folding string */ in addCaseClosure()
365 closureOffset=excOffset; /* behind full case mappings */ in addCaseClosure()
410 * The string is mapped to code points if it is their full case folding string.
411 * In other words, this performs a reverse full case folding and then
980 * Get the full lowercas
[all...]
/third_party/icu/ohos_icu4j/src/main/java/ohos/global/icu/impl/
H A DUCaseProps.java258 * Adds all simple case mappings and the full case folding for c to sa,
307 * full case mappings. Add them all. in addCaseClosure()
335 closureOffset=(int)(value>>32)+1; /* behind this slot, unless there are full case mappings */ in addCaseClosure()
341 /* add the full case folding */ in addCaseClosure()
347 /* start of full case mapping strings */ in addCaseClosure()
356 /* add the full case folding string */ in addCaseClosure()
369 closureOffset=excOffset; /* behind full case mappings */ in addCaseClosure()
414 * The string is mapped to code points if it is their full case folding string.
415 * In other words, this performs a reverse full case folding and then
980 * Get the full lowercas
[all...]
/third_party/mesa3d/src/freedreno/computerator/examples/
H A Dtest-opcodes.sh3 # Test various instructions to check whether half<->full widening/narrowing
12 # edge cases, while still not loosing precision in a full->half->full
112 echo '; test, full->half:'
115 echo '; control, full->full:'
117 echo '; test, half->full:'
143 stib.untyped.1d.u32.1 r2.x, r3.x, 0 ; control: full->full
144 stib.untyped.1d.u32.1 r2.y, r3.y, 0 ; test: half->full
[all...]
/third_party/node/deps/icu-small/source/common/
H A Duniset_closure.cpp136 // add the result of a full case mapping to the set
139 addCaseMapping(UnicodeSet &set, int32_t result, const char16_t *full, UnicodeString &str) { in addCaseMapping() argument
145 // add a string case mapping from full with length result in addCaseMapping()
146 str.setTo((UBool)false, full, result); in addCaseMapping()
185 // (Normally when we case-fold a string we use full case foldings.)
307 const char16_t *full; in closeOverAddCaseMappings() local
317 result = ucase_toFullLower(cp, nullptr, nullptr, &full, UCASE_LOC_ROOT); in closeOverAddCaseMappings()
318 addCaseMapping(foldSet, result, full, str); in closeOverAddCaseMappings()
320 result = ucase_toFullTitle(cp, nullptr, nullptr, &full, UCASE_LOC_ROOT); in closeOverAddCaseMappings()
321 addCaseMapping(foldSet, result, full, st in closeOverAddCaseMappings()
[all...]
H A Ducase.cpp220 * full case mappings. Add them all. in ucase_addCaseClosure()
274 closure=(const char16_t *)pe+1; /* behind this slot, unless there are full case mappings */ in ucase_addCaseClosure()
280 /* add the full case folding */ in ucase_addCaseClosure()
286 /* start of full case mapping strings */ in ucase_addCaseClosure()
295 /* add the full case folding string */ in ucase_addCaseClosure()
308 closure=(const char16_t *)pe; /* behind full case mappings */ in ucase_addCaseClosure()
381 closure=(const char16_t *)pe+1; /* behind this slot, unless there are full case mappings */ in ucase_addSimpleCaseClosure()
387 // Skip the full case mappings. in ucase_addSimpleCaseClosure()
393 /* start of full case mapping strings */ in ucase_addSimpleCaseClosure()
398 // Skip all 4 full cas in ucase_addSimpleCaseClosure()
518 next(UnicodeString &full) next() argument
1167 int32_t full; ucase_toFullLower() local
1319 int32_t full, idx; toUpperOrTitle() local
1554 int32_t full, idx; ucase_toFullFolding() local
[all...]
/third_party/skia/third_party/externals/freetype/src/cid/
H A Dcidobjs.c387 char* full = info->full_name; in FT_LOCAL_DEF() local
391 if ( full ) in FT_LOCAL_DEF()
393 while ( *full ) in FT_LOCAL_DEF()
395 if ( *full == *family ) in FT_LOCAL_DEF()
398 full++; in FT_LOCAL_DEF()
402 if ( *full == ' ' || *full == '-' ) in FT_LOCAL_DEF()
403 full++; in FT_LOCAL_DEF()
409 cidface->style_name = full; in FT_LOCAL_DEF()
/third_party/python/Tools/scripts/
H A Dlll.py13 full = os.path.join(dirname, name)
14 if os.path.islink(full):
15 print(name, '->', os.readlink(full))
H A Dbyext.py37 full = os.path.join(dir, name)
38 if os.path.islink(full):
40 elif os.path.isdir(full):
41 self.statdir(full)
43 self.statfile(full)
/third_party/mesa3d/src/gallium/frontends/nine/
H A Dnine_queue.c66 BOOL full; member
87 /* wait for cmdbuf full */ in nine_queue_wait_flush()
89 while (!cmdbuf->full) in nine_queue_wait_flush()
91 DBG("waiting for full cmdbuf\n"); in nine_queue_wait_flush()
116 cmdbuf->full = 0; in nine_queue_get()
152 cmdbuf->full = 1; in nine_queue_flush()
162 while (cmdbuf->full) in nine_queue_flush()
174 * Does block if queue is full.
/third_party/protobuf/src/google/protobuf/util/internal/
H A Dprotostream_objectwriter_test.cc445 Primitive full; in TEST_P() local
446 full.set_fix32(101); in TEST_P()
447 full.set_u32(102); in TEST_P()
448 full.set_i32(-103); in TEST_P()
449 full.set_sf32(-104); in TEST_P()
450 full.set_s32(-105); in TEST_P()
451 full.set_fix64(40000000001L); in TEST_P()
452 full.set_u64(40000000002L); in TEST_P()
453 full.set_i64(-40000000003L); in TEST_P()
454 full in TEST_P()
545 Primitive full; TEST_P() local
578 Primitive full; TEST_P() local
[all...]

Completed in 27 milliseconds

123456789