| /external/chromium_org/third_party/brotli/src/brotli/enc/ |
| D | entropy_encode.cc | 178 int* tree_size) { in WriteHuffmanTreeRepetitions() argument
180 tree[*tree_size] = value; in WriteHuffmanTreeRepetitions()
181 extra_bits[*tree_size] = 0; in WriteHuffmanTreeRepetitions()
182 ++(*tree_size); in WriteHuffmanTreeRepetitions()
186 tree[*tree_size] = value; in WriteHuffmanTreeRepetitions()
187 extra_bits[*tree_size] = 0; in WriteHuffmanTreeRepetitions()
188 ++(*tree_size); in WriteHuffmanTreeRepetitions()
193 tree[*tree_size] = value; in WriteHuffmanTreeRepetitions()
194 extra_bits[*tree_size] = 0; in WriteHuffmanTreeRepetitions()
195 ++(*tree_size); in WriteHuffmanTreeRepetitions()
[all …]
|
| D | bit_cost.h | 99 int tree_size = 0; in HuffmanBitCost() local
103 tree_size += histogram[i]; in HuffmanBitCost()
|
| /external/chromium_org/chrome/installer/test/ |
| D | pe_image_resources.cc | 29 const base::win::PEImage& image, const uint8* tree_base, DWORD tree_size, in EnumResourcesWorker() argument
35 if (!StructureAt(tree_base + directory_offset, tree_size - directory_offset, in EnumResourcesWorker()
40 sizeof(IMAGE_RESOURCE_DIRECTORY_ENTRY) > tree_size) { in EnumResourcesWorker()
65 tree_size - scan->NameOffset, &dir_string) || in EnumResourcesWorker()
67 dir_string->Length * sizeof(wchar_t) > tree_size) { in EnumResourcesWorker()
79 success = EnumResourcesWorker(image, tree_base, tree_size, in EnumResourcesWorker()
85 tree_size - scan->OffsetToData, &data_entry) && in EnumResourcesWorker()
88 tree_base + tree_size) { in EnumResourcesWorker()
|
| /external/pdfium/core/src/fxcrt/ |
| D | fx_basic_array.cpp | 227 int tree_size = 1; in Add() local
230 tree_size *= m_IndexSize; in Add()
232 if (m_DataSize == tree_size * m_SegmentSize) { in Add()
243 tree_size /= m_IndexSize; in Add()
247 if (pSpot[seg_index / tree_size] == NULL) { in Add()
248 … pSpot[seg_index / tree_size] = (void*)FX_Allocator_Alloc(m_pAllocator, void*, m_IndexSize); in Add()
249 if (pSpot[seg_index / tree_size] == NULL) { in Add()
252 FXSYS_memset32(pSpot[seg_index / tree_size], 0, sizeof(void*) * m_IndexSize); in Add()
254 pSpot = (void**)pSpot[seg_index / tree_size]; in Add()
255 seg_index = seg_index % tree_size; in Add()
[all …]
|
| /external/chromium_org/net/cert/ |
| D | ct_log_response_parser.cc | 26 int tree_size; member
68 converter->RegisterIntField("tree_size", &JsonSignedTreeHead::tree_size); in RegisterJSONConverter()
80 if (sth.tree_size < 0) { in IsJsonSTHStructurallyValid()
82 << sth.tree_size; in IsJsonSTHStructurallyValid()
127 signed_tree_head->tree_size = parsed_sth.tree_size; in FillSignedTreeHead()
|
| D | signed_tree_head.h | 31 uint64 tree_size; member
|
| D | ct_log_response_parser_unittest.cc | 55 ASSERT_EQ(2903698u, tree_head.tree_size); in TEST()
|
| D | ct_serialization.cc | 317 WriteUint(kTreeSizeLength, signed_tree_head.tree_size, output); in EncodeTreeHeadSignature()
|
| /external/chromium_org/ui/accessibility/ |
| D | ax_generated_tree_unittest.cc | 139 int tree_size = 3; in TEST() local
140 TreeGenerator generator(tree_size); in TEST()
181 int tree_size = 4; in TEST() local
184 int tree_size = 3; in TEST()
187 TreeGenerator generator(tree_size); in TEST()
203 for (int k = 0; k < tree_size; k++) { in TEST()
228 for (int k_index = 0; k_index < tree_size; ++k_index) { in TEST()
229 int id = 1 + (k + k_index) % tree_size; in TEST()
|
| /external/webp/src/utils/ |
| D | huffman_encode.c | 192 int tree_size = tree_size_orig; in GenerateOptimalTree() local
210 qsort(tree, tree_size, sizeof(*tree), CompareHuffmanTrees); in GenerateOptimalTree()
212 if (tree_size > 1) { // Normal case. in GenerateOptimalTree()
214 while (tree_size > 1) { // Finish when we have only one root. in GenerateOptimalTree()
216 tree_pool[tree_pool_size++] = tree[tree_size - 1]; in GenerateOptimalTree()
217 tree_pool[tree_pool_size++] = tree[tree_size - 2]; in GenerateOptimalTree()
220 tree_size -= 2; in GenerateOptimalTree()
224 for (k = 0; k < tree_size; ++k) { in GenerateOptimalTree()
229 memmove(tree + (k + 1), tree + k, (tree_size - k) * sizeof(*tree)); in GenerateOptimalTree()
235 tree_size = tree_size + 1; in GenerateOptimalTree()
[all …]
|
| /external/chromium_org/third_party/libwebp/utils/ |
| D | huffman_encode.c | 192 int tree_size = tree_size_orig; in GenerateOptimalTree() local
210 qsort(tree, tree_size, sizeof(*tree), CompareHuffmanTrees); in GenerateOptimalTree()
212 if (tree_size > 1) { // Normal case. in GenerateOptimalTree()
214 while (tree_size > 1) { // Finish when we have only one root. in GenerateOptimalTree()
216 tree_pool[tree_pool_size++] = tree[tree_size - 1]; in GenerateOptimalTree()
217 tree_pool[tree_pool_size++] = tree[tree_size - 2]; in GenerateOptimalTree()
220 tree_size -= 2; in GenerateOptimalTree()
224 for (k = 0; k < tree_size; ++k) { in GenerateOptimalTree()
229 memmove(tree + (k + 1), tree + k, (tree_size - k) * sizeof(*tree)); in GenerateOptimalTree()
235 tree_size = tree_size + 1; in GenerateOptimalTree()
[all …]
|
| /external/lldb/examples/scripting/ |
| D | tree_utils.py | 78 def tree_size (root): function
93 left_size = tree_size (root.GetChildAtIndex(1));
94 right_size = tree_size (root.GetChildAtIndex(2));
|
| /external/chromium_org/mojo/services/public/cpp/view_manager/tests/ |
| D | view_manager_unittest.cc | 146 TreeSizeMatchesObserver(Node* tree, size_t tree_size) in TreeSizeMatchesObserver() argument
148 tree_size_(tree_size) {} in TreeSizeMatchesObserver()
176 void WaitForTreeSizeToMatch(Node* node, size_t tree_size) { in WaitForTreeSizeToMatch() argument
177 TreeSizeMatchesObserver observer(node, tree_size); in WaitForTreeSizeToMatch()
|
| /external/chromium_org/net/test/ |
| D | ct_test_util.cc | 261 sth->tree_size = 21u; in GetSignedTreeHead()
|