| /external/lldb/examples/scripting/ |
| H A 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/net/cert/ |
| H A D | signed_tree_head.h | 31 uint64 tree_size; member in struct:net::ct::SignedTreeHead
|
| H A D | ct_log_response_parser.cc | 26 int tree_size; member in struct:net::ct::__anon9075::JsonSignedTreeHead
68 converter->RegisterIntField("tree_size", &JsonSignedTreeHead::tree_size);
80 if (sth.tree_size < 0) {
82 << sth.tree_size;
127 signed_tree_head->tree_size = parsed_sth.tree_size;
|
| /external/chromium_org/ui/accessibility/ |
| H A D | ax_generated_tree_unittest.cc | 53 int tree_size = 3; local
54 TreeGenerator generator(tree_size);
95 int tree_size = 4; local
98 int tree_size = 3;
101 TreeGenerator generator(tree_size);
117 for (int k = 0; k < tree_size; k++) {
142 for (int k_index = 0; k_index < tree_size; ++k_index) {
143 int id = 1 + (k + k_index) % tree_size;
|
| /external/chromium_org/chrome/installer/test/ |
| H A D | pe_image_resources.cc | 29 const base::win::PEImage& image, const uint8* tree_base, DWORD tree_size,
35 if (!StructureAt(tree_base + directory_offset, tree_size - directory_offset,
40 sizeof(IMAGE_RESOURCE_DIRECTORY_ENTRY) > tree_size) {
65 tree_size - scan->NameOffset, &dir_string) ||
67 dir_string->Length * sizeof(wchar_t) > tree_size) {
79 success = EnumResourcesWorker(image, tree_base, tree_size,
85 tree_size - scan->OffsetToData, &data_entry) &&
88 tree_base + tree_size) {
28 EnumResourcesWorker( const base::win::PEImage& image, const uint8* tree_base, DWORD tree_size, DWORD directory_offset, upgrade_test::EntryPath* path, upgrade_test::EnumResource_Fn callback, uintptr_t context) argument
|
| /external/chromium_org/third_party/brotli/src/brotli/enc/ |
| H A D | bit_cost.h | 99 int tree_size = 0; local
103 tree_size += histogram[i];
|
| H A D | entropy_encode.cc | 178 int* tree_size) {
180 tree[*tree_size] = value;
181 extra_bits[*tree_size] = 0;
182 ++(*tree_size);
186 tree[*tree_size] = value;
187 extra_bits[*tree_size] = 0;
188 ++(*tree_size);
193 tree[*tree_size] = value;
194 extra_bits[*tree_size] = 0;
195 ++(*tree_size);
172 WriteHuffmanTreeRepetitions( const int previous_value, const int value, int repetitions, uint8_t* tree, uint8_t* extra_bits, int* tree_size) argument
212 WriteHuffmanTreeRepetitionsZeros( int repetitions, uint8_t* tree, uint8_t* extra_bits, int* tree_size) argument
[all...] |
| /external/chromium_org/third_party/libwebp/utils/ |
| H A D | huffman_encode.c | 192 int tree_size = tree_size_orig; local
210 qsort(tree, tree_size, sizeof(*tree), CompareHuffmanTrees);
212 if (tree_size > 1) { // Normal case.
214 while (tree_size > 1) { // Finish when we have only one root.
216 tree_pool[tree_pool_size++] = tree[tree_size - 1];
217 tree_pool[tree_pool_size++] = tree[tree_size - 2];
220 tree_size -= 2;
224 for (k = 0; k < tree_size; ++k) {
229 memmove(tree + (k + 1), tree + k, (tree_size - k) * sizeof(*tree));
235 tree_size
[all...] |
| /external/pdfium/core/src/fxcrt/ |
| H A D | fx_basic_array.cpp | 227 int tree_size = 1;
local
230 tree_size *= m_IndexSize;
232 if (m_DataSize == tree_size * m_SegmentSize) {
243 tree_size /= m_IndexSize;
247 if (pSpot[seg_index / tree_size] == NULL) {
248 pSpot[seg_index / tree_size] = (void*)FX_Allocator_Alloc(m_pAllocator, void*, m_IndexSize);
249 if (pSpot[seg_index / tree_size] == NULL) {
252 FXSYS_memset32(pSpot[seg_index / tree_size], 0, sizeof(void*) * m_IndexSize);
254 pSpot = (void**)pSpot[seg_index / tree_size];
255 seg_index = seg_index % tree_size;
275 int tree_size = 1; local
[all...] |
| /external/webp/src/utils/ |
| H A D | huffman_encode.c | 192 int tree_size = tree_size_orig; local
210 qsort(tree, tree_size, sizeof(*tree), CompareHuffmanTrees);
212 if (tree_size > 1) { // Normal case.
214 while (tree_size > 1) { // Finish when we have only one root.
216 tree_pool[tree_pool_size++] = tree[tree_size - 1];
217 tree_pool[tree_pool_size++] = tree[tree_size - 2];
220 tree_size -= 2;
224 for (k = 0; k < tree_size; ++k) {
229 memmove(tree + (k + 1), tree + k, (tree_size - k) * sizeof(*tree));
235 tree_size
[all...] |
| /external/chromium_org/chrome/browser/extensions/api/automation/ |
| H A D | automation_apitest.cc | 202 : tree_size(3),
204 : tree_size(2),
206 generator(tree_size),
289 const int tree_size; member in class:extensions::TreeSerializationState
372 for (int node_delta = 0; node_delta < state.tree_size; ++node_delta) {
373 int id = 1 + (state.starting_node + node_delta) % state.tree_size;
376 bool is_last_update = node_delta == state.tree_size - 1;
412 // 5. When starting_node exceeds state.tree_size, we increment tree0_version if
435 if (state.starting_node < state.tree_size) {
|
| /external/chromium_org/mojo/services/public/cpp/view_manager/tests/ |
| H A D | view_manager_unittest.cc | 125 // Spins a runloop until the tree beginning at |root| has |tree_size| views
129 TreeSizeMatchesObserver(View* tree, size_t tree_size) argument
131 tree_size_(tree_size) {}
159 void WaitForTreeSizeToMatch(View* view, size_t tree_size) { argument
160 TreeSizeMatchesObserver observer(view, tree_size);
|