| /third_party/ffmpeg/libavfilter/ |
| H A D | af_chorus.c | 49 float *depths; member
72 { "depths", "set depths", OFFSET(depths_str), AV_OPT_TYPE_STRING, {.str=NULL}, 0, 0, A },
112 av_log(ctx, AV_LOG_ERROR, "Both delays & decays & speeds & depths must be set.\n"); in init()
124 s->depths = av_realloc_f(s->depths, nb_depths, sizeof(*s->depths)); in init()
126 if (!s->delays || !s->decays || !s->speeds || !s->depths) in init()
132 fill_items(s->depths_str, &nb_depths, s->depths); in init()
135 av_log(ctx, AV_LOG_ERROR, "Number of delays & decays & speeds & depths give in init()
[all...] |
| /third_party/vk-gl-cts/framework/common/ |
| H A D | tcuTexCompareVerifier.cpp | 200 const Vec2& depths,
208 const float d0 = depths[0];
209 const float d1 = depths[1];
265 const Vec4& depths,
272 const float d0 = depths[0];
273 const float d1 = depths[1];
274 const float d2 = depths[2];
275 const float d3 = depths[3];
295 const Vec4& depths,
306 const float d0 = depths[
[all...] |
| /third_party/node/deps/brotli/c/enc/ |
| H A D | brotli_bit_stream.c | 242 static void StoreSimpleHuffmanTree(const uint8_t* depths, in StoreSimpleHuffmanTree() argument
257 if (depths[symbols[j]] < depths[symbols[i]]) { in StoreSimpleHuffmanTree()
277 BrotliWriteBits(1, depths[symbols[0]] == 1 ? 1 : 0, storage_ix, storage); in StoreSimpleHuffmanTree()
282 depths = symbol depths */
283 void BrotliStoreHuffmanTree(const uint8_t* depths, size_t num, in BrotliStoreHuffmanTree() argument
301 BrotliWriteHuffmanTree(depths, num, &huffman_tree_size, huffman_tree, in BrotliStoreHuffmanTree()
692 uint8_t depths[BROTLI_MAX_CONTEXT_MAP_SYMBOLS]; in EncodeContextMap() local
719 tree, depths, bit in EncodeContextMap()
801 uint8_t depths[BROTLI_MAX_CONTEXT_MAP_SYMBOLS]; StoreTrivialContextMap() local
[all...] |
| H A D | compress_fragment.c | 64 /* Builds a literal prefix code into "depths" and "bits" based on the statistics
75 uint8_t depths[256], in BuildAndStoreLiteralPrefixCode()
101 /* We add 1 to each population count to avoid 0 bit depths (since this is in BuildAndStoreLiteralPrefixCode()
113 depths, bits, storage_ix, storage); in BuildAndStoreLiteralPrefixCode()
118 if (histogram[i]) literal_ratio += histogram[i] * depths[i]; in BuildAndStoreLiteralPrefixCode()
373 const uint8_t* data, size_t len, const uint8_t* depths) { in ShouldMergeBlock()
384 r -= (double)histo[i] * (depths[i] + FastLog2(histo[i])); in ShouldMergeBlock()
72 BuildAndStoreLiteralPrefixCode(MemoryManager* m, const uint8_t* input, const size_t input_size, uint8_t depths[256], uint16_t bits[256], size_t* storage_ix, uint8_t* storage) BuildAndStoreLiteralPrefixCode() argument
372 ShouldMergeBlock( const uint8_t* data, size_t len, const uint8_t* depths) ShouldMergeBlock() argument
|
| H A D | brotli_bit_stream.h | 34 BROTLI_INTERNAL void BrotliStoreHuffmanTree(const uint8_t* depths, size_t num,
|
| /third_party/skia/third_party/externals/brotli/c/enc/ |
| H A D | brotli_bit_stream.c | 242 static void StoreSimpleHuffmanTree(const uint8_t* depths, in StoreSimpleHuffmanTree() argument
257 if (depths[symbols[j]] < depths[symbols[i]]) { in StoreSimpleHuffmanTree()
277 BrotliWriteBits(1, depths[symbols[0]] == 1 ? 1 : 0, storage_ix, storage); in StoreSimpleHuffmanTree()
282 depths = symbol depths */
283 void BrotliStoreHuffmanTree(const uint8_t* depths, size_t num, in BrotliStoreHuffmanTree() argument
301 BrotliWriteHuffmanTree(depths, num, &huffman_tree_size, huffman_tree, in BrotliStoreHuffmanTree()
692 uint8_t depths[BROTLI_MAX_CONTEXT_MAP_SYMBOLS]; in EncodeContextMap() local
719 tree, depths, bit in EncodeContextMap()
801 uint8_t depths[BROTLI_MAX_CONTEXT_MAP_SYMBOLS]; StoreTrivialContextMap() local
[all...] |
| H A D | compress_fragment.c | 64 /* Builds a literal prefix code into "depths" and "bits" based on the statistics
75 uint8_t depths[256], in BuildAndStoreLiteralPrefixCode()
101 /* We add 1 to each population count to avoid 0 bit depths (since this is in BuildAndStoreLiteralPrefixCode()
113 depths, bits, storage_ix, storage); in BuildAndStoreLiteralPrefixCode()
118 if (histogram[i]) literal_ratio += histogram[i] * depths[i]; in BuildAndStoreLiteralPrefixCode()
373 const uint8_t* data, size_t len, const uint8_t* depths) { in ShouldMergeBlock()
384 r -= (double)histo[i] * (depths[i] + FastLog2(histo[i])); in ShouldMergeBlock()
72 BuildAndStoreLiteralPrefixCode(MemoryManager* m, const uint8_t* input, const size_t input_size, uint8_t depths[256], uint16_t bits[256], size_t* storage_ix, uint8_t* storage) BuildAndStoreLiteralPrefixCode() argument
372 ShouldMergeBlock( const uint8_t* data, size_t len, const uint8_t* depths) ShouldMergeBlock() argument
|
| H A D | brotli_bit_stream.h | 34 BROTLI_INTERNAL void BrotliStoreHuffmanTree(const uint8_t* depths, size_t num,
|
| /third_party/backends/backend/ |
| H A D | canon_pp.c | 114 /* bit depths */
115 static const SANE_String_Const depths[] = { "8", "12", NULL }; variable
783 depths[cs->vals[opt]]); in sane_control_option()
834 while ((depths[cs->vals[opt]] != NULL) in sane_control_option()
835 && strcmp(depths[cs->vals[opt]], in sane_control_option()
1650 cs->opt[OPT_DEPTH].constraint.string_list = depths; in init_device()
|
| /third_party/skia/third_party/externals/angle2/src/compiler/translator/ |
| H A D | Compiler.cpp | 1409 std::vector<int> depths(mCallDag.size()); in checkCallDepth()
1418 depth = std::max(depth, depths[calleeIndex] + 1); in checkCallDepth()
1421 depths[i] = depth; in checkCallDepth()
1443 if (depths[calleeIndex] == currentDepth - 1) in checkCallDepth()
|
| /third_party/vk-gl-cts/external/openglcts/modules/gl/ |
| H A D | gl4cCopyImageTests.cpp | 3089 GLuint depths[FUNCTIONAL_TEST_N_LEVELS]; in prepareDstPxls() local
3091 calculateDimmensions(desc.m_target, desc.m_level, desc.m_width, desc.m_height, widths, heights, depths); in prepareDstPxls()
3097 const GLuint req_memory_for_level = req_memory_per_layer * depths[i]; in prepareDstPxls()
3112 const GLuint n_layers = depths[i]; in prepareDstPxls()
3149 GLuint depths[FUNCTIONAL_TEST_N_LEVELS]; in prepareSrcPxls() local
3151 calculateDimmensions(desc.m_target, desc.m_level, desc.m_width, desc.m_height, widths, heights, depths); in prepareSrcPxls()
3157 const GLuint req_memory_for_level = req_memory_per_layer * depths[i]; in prepareSrcPxls()
3171 const GLuint n_layers = depths[lvl]; in prepareSrcPxls()
3399 GLuint depths[FUNCTIONAL_TEST_N_LEVELS]; in prepareTexture() local
3401 calculateDimmensions(desc.m_target, desc.m_level, desc.m_width, desc.m_height, widths, heights, depths); in prepareTexture()
[all...] |