/external/lldb/utils/test/ |
run-dis.py | 25 num_symbols = -1 variable 37 def walk_and_invoke(sdk_root, path_regexp, suffix, num_symbols): 63 command = template % (scriptPath, path, num_symbols if num_symbols > 0 else 1000) 73 global num_symbols 95 dest='num_symbols', 114 num_symbols = opts.num_symbols variable 119 print "num of symbols to disassemble:", num_symbols 121 walk_and_invoke(root_dir, path_regexp, suffix, num_symbols) [all...] |
lldb-disasm.py | 80 def do_lldb_disassembly(lldb_commands, exe, disassemble_options, num_symbols, 165 for symbol in symbol_iter(num_symbols, symbols_to_disassemble, re_symbol_pattern, target, not quiet_disassembly): 199 dest='num_symbols', 221 num_symbols = opts.num_symbols variable 231 print "num of symbols to disassemble:", num_symbols 237 num_symbols,
|
/external/chromium_org/native_client_sdk/src/libraries/xray/ |
parsesymbols.c | 51 int num_symbols = 0; local 78 ++num_symbols; 82 ++num_symbols; 93 printf("XRay: parsed %d symbols into symbol table\n", num_symbols);
|
symtable.c | 50 int num_symbols; member in struct:XRaySymbolTable 125 symtab->num_symbols = XRayHashTableGetCount(symtab->hash_table); 175 return symtab->num_symbols; 183 symtab->num_symbols = 0; 196 symtab->num_symbols = 0;
|
/external/chromium_org/build/android/pylib/symbols/ |
elf_symbolizer_unittest.py | 33 self._RunTest(max_concurrent_jobs=1, num_symbols=100) 36 self._RunTest(max_concurrent_jobs=4, num_symbols=100) 39 self._RunTest(max_concurrent_jobs=8, num_symbols=100) 43 self._RunTest(max_concurrent_jobs=1, num_symbols=100) 48 self._RunTest(max_concurrent_jobs=1, num_symbols=100) 122 def _RunTest(self, max_concurrent_jobs, num_symbols): 130 for addr in xrange(num_symbols): 140 for addr in xrange(num_symbols):
|
/external/chromium_org/third_party/libwebp/utils/ |
quant_levels.c | 19 #define NUM_SYMBOLS 256 29 int freq[NUM_SYMBOLS] = { 0 }; 30 int q_level[NUM_SYMBOLS] = { 0 }; 31 double inv_q_level[NUM_SYMBOLS] = { 0 }; 76 double q_sum[NUM_SYMBOLS] = { 0 }; 77 double q_count[NUM_SYMBOLS] = { 0 }; 122 uint8_t map[NUM_SYMBOLS];
|
huffman.c | 236 int num_symbols = 0; local 246 ++num_symbols; 251 // Initialize the tree. Will fail for num_symbols = 0 252 if (!TreeInit(tree, num_symbols)) return 0; 255 if (num_symbols == 1) { // Trivial case. 292 int num_symbols) { 300 // Initialize the tree. Will fail if num_symbols = 0. 301 if (!TreeInit(tree, num_symbols)) return 0; 304 for (i = 0; i < num_symbols; ++i) {
|
huffman_encode.c | 330 const int depth_size = tree->num_symbols; 382 len = tree->num_symbols; 410 const int num_symbols = huff_code->num_symbols; local 411 memset(buf_rle, 0, num_symbols * sizeof(*buf_rle)); 412 OptimizeHuffmanForRle(num_symbols, buf_rle, histogram); 413 GenerateOptimalTree(histogram, num_symbols, huff_tree, tree_depth_limit,
|
huffman_encode.h | 31 int num_symbols; // Number of symbols. member in struct:__anon16919
|
huffman.h | 90 int num_symbols);
|
/external/webp/src/utils/ |
quant_levels.c | 19 #define NUM_SYMBOLS 256 29 int freq[NUM_SYMBOLS] = { 0 }; 30 int q_level[NUM_SYMBOLS] = { 0 }; 31 double inv_q_level[NUM_SYMBOLS] = { 0 }; 76 double q_sum[NUM_SYMBOLS] = { 0 }; 77 double q_count[NUM_SYMBOLS] = { 0 }; 122 uint8_t map[NUM_SYMBOLS];
|
huffman.c | 236 int num_symbols = 0; local 246 ++num_symbols; 251 // Initialize the tree. Will fail for num_symbols = 0 252 if (!TreeInit(tree, num_symbols)) return 0; 255 if (num_symbols == 1) { // Trivial case. 292 int num_symbols) { 300 // Initialize the tree. Will fail if num_symbols = 0. 301 if (!TreeInit(tree, num_symbols)) return 0; 304 for (i = 0; i < num_symbols; ++i) {
|
huffman_encode.c | 330 const int depth_size = tree->num_symbols; 382 len = tree->num_symbols; 410 const int num_symbols = huff_code->num_symbols; local 411 memset(buf_rle, 0, num_symbols * sizeof(*buf_rle)); 412 OptimizeHuffmanForRle(num_symbols, buf_rle, histogram); 413 GenerateOptimalTree(histogram, num_symbols, huff_tree, tree_depth_limit,
|
huffman_encode.h | 31 int num_symbols; // Number of symbols. member in struct:__anon37088
|
huffman.h | 90 int num_symbols);
|
/external/chromium_org/third_party/webrtc/base/ |
latebindingsymboltable.h | 36 int num_symbols; member in struct:rtc::LateBindingSymbolTable::TableInfo 37 // Array of size num_symbols.
|
latebindingsymboltable.cc | 125 for (int i = 0; i < info_->num_symbols; ++i) { 153 memset(table_, 0, sizeof(void *) * info_->num_symbols);
|
/external/chromium_org/third_party/libjingle/source/talk/base/ |
latebindingsymboltable.h | 53 int num_symbols; member in struct:talk_base::LateBindingSymbolTable::TableInfo 54 // Array of size num_symbols.
|
latebindingsymboltable.cc | 142 for (int i = 0; i < info_->num_symbols; ++i) { 170 memset(table_, 0, sizeof(void *) * info_->num_symbols);
|
/external/chromium_org/third_party/webrtc/modules/audio_device/linux/ |
latebindingsymboltable_linux.cc | 101 int num_symbols, 108 for (int i = 0; i < num_symbols; ++i) {
|
/external/chromium_org/third_party/libwebp/enc/ |
vp8l.c | 202 const int num_symbols = local 205 codes[k].num_symbols = num_symbols; 206 total_length_size += num_symbols; 221 const int bit_length = huffman_codes[i].num_symbols; 284 for (k = 0; k < huffman_code->num_symbols; ++k) { 290 for (k = 0; k < huffman_code->num_symbols; ++k) { 326 const int max_tokens = tree->num_symbols; 329 huffman_code.num_symbols = CODE_LENGTH_CODES; 394 for (i = 0; i < huffman_code->num_symbols && count < 3; ++i) [all...] |
/external/webp/src/enc/ |
vp8l.c | 202 const int num_symbols = local 205 codes[k].num_symbols = num_symbols; 206 total_length_size += num_symbols; 221 const int bit_length = huffman_codes[i].num_symbols; 284 for (k = 0; k < huffman_code->num_symbols; ++k) { 290 for (k = 0; k < huffman_code->num_symbols; ++k) { 326 const int max_tokens = tree->num_symbols; 329 huffman_code.num_symbols = CODE_LENGTH_CODES; 394 for (i = 0; i < huffman_code->num_symbols && count < 3; ++i) [all...] |
/external/chromium_org/third_party/tcmalloc/chromium/src/ |
symbolize.cc | 258 int num_symbols = 0; 266 num_symbols++; 269 return num_symbols;
|
/external/chromium_org/third_party/tcmalloc/vendor/src/ |
symbolize.cc | 263 int num_symbols = 0; 271 num_symbols++; 274 return num_symbols;
|
/external/chromium_org/third_party/brotli/src/brotli/dec/ |
decode.c | 136 int num_symbols, uint8_t* code_lengths, 153 while (symbol < num_symbols && space > 0) { 190 if (symbol + repeat_delta > num_symbols) { 204 memset(&code_lengths[symbol], 0, (size_t)(num_symbols - symbol)); 237 const int num_symbols = (int)BrotliReadBits(br, 2) + 1; local 243 for (i = 0; i < num_symbols; ++i) { 248 switch (num_symbols) { 275 BROTLI_LOG_UINT(num_symbols); [all...] |