Searched refs:num_symbols (Results 1 - 25 of 37) sorted by relevance

12

/external/lldb/utils/test/
H A Drun-dis.py25 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...]
H A Dlldb-disasm.py80 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/
H A Dparsesymbols.c51 int num_symbols = 0; local
78 ++num_symbols;
82 ++num_symbols;
93 printf("XRay: parsed %d symbols into symbol table\n", num_symbols);
H A Dsymtable.c50 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/
H A Delf_symbolizer_unittest.py33 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/
H A Dhuffman_encode.h31 int num_symbols; // Number of symbols. member in struct:__anon13299
H A Dhuffman.c236 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) {
288 VP8LHuffmanTreeBuildExplicit(HuffmanTree* const tree, const int* const code_lengths, const int* const codes, const int* const symbols, int max_symbol, int num_symbols) argument
H A Dhuffman.h90 int num_symbols);
H A Dhuffman_encode.c330 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,
/external/webp/src/utils/
H A Dhuffman_encode.h31 int num_symbols; // Number of symbols. member in struct:__anon33396
H A Dhuffman.c236 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) {
288 VP8LHuffmanTreeBuildExplicit(HuffmanTree* const tree, const int* const code_lengths, const int* const codes, const int* const symbols, int max_symbol, int num_symbols) argument
H A Dhuffman.h90 int num_symbols);
H A Dhuffman_encode.c330 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,
/external/chromium_org/third_party/webrtc/base/
H A Dlatebindingsymboltable.h36 int num_symbols; member in struct:rtc::LateBindingSymbolTable::TableInfo
37 // Array of size num_symbols.
H A Dlatebindingsymboltable.cc125 for (int i = 0; i < info_->num_symbols; ++i) {
153 memset(table_, 0, sizeof(void *) * info_->num_symbols);
/external/chromium_org/third_party/webrtc/modules/audio_device/linux/
H A Dlatebindingsymboltable_linux.cc110 int num_symbols,
117 for (int i = 0; i < num_symbols; ++i) {
109 InternalLoadSymbols(DllHandle handle, int num_symbols, const char *const symbol_names[], void *symbols[]) argument
H A Dlatebindingsymboltable_linux.h59 int num_symbols,
/external/chromium_org/third_party/tcmalloc/chromium/src/
H A Dsymbolize.cc258 int num_symbols = 0;
266 num_symbols++;
269 return num_symbols;
/external/chromium_org/third_party/tcmalloc/vendor/src/
H A Dsymbolize.cc263 int num_symbols = 0;
271 num_symbols++;
274 return num_symbols;
/external/chromium_org/third_party/libwebp/enc/
H A Dvp8l.c202 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
[all...]
/external/webp/src/enc/
H A Dvp8l.c202 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
[all...]
/external/chromium_org/third_party/brotli/src/brotli/dec/
H A Ddecode.c136 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);
134 ReadHuffmanCodeLengths( const uint8_t* code_length_code_lengths, int num_symbols, uint8_t* code_lengths, BrotliBitReader* br) argument
/external/qemu/include/disas/
H A Dbfd.h287 int num_symbols; member in struct:disassemble_info
459 (INFO).num_symbols = 0, \
/external/lldb/source/Symbol/
H A DSymtab.cpp93 s->Printf("Symtab, file = %s%s%s%s, num_symbols = %lu",
100 s->Printf("Symtab, num_symbols = %lu", m_symbols.size());
166 const size_t num_symbols = GetNumSymbols(); local
180 if (idx < num_symbols)
261 const size_t num_symbols = m_symbols.size(); local
263 m_name_to_index.Reserve (num_symbols);
289 std::vector<const char *> symbol_contexts(num_symbols, NULL);
291 for (entry.value = 0; entry.value<num_symbols; ++entry.value)
/external/chromium_org/third_party/libwebp/dec/
H A Dvp8l.c183 int num_symbols, int* const code_lengths) {
201 if (max_symbol > num_symbols) {
206 max_symbol = num_symbols;
210 while (symbol < num_symbols) {
224 if (symbol + repeat > num_symbols) {
252 const int num_symbols = VP8LReadBits(br, 1) + 1; local
257 code_lengths[0] = num_symbols - 1;
259 if (num_symbols == 2) {
262 code_lengths[1] = num_symbols - 1;
265 alphabet_size, num_symbols);
181 ReadHuffmanCodeLengths( VP8LDecoder* const dec, const int* const code_length_code_lengths, int num_symbols, int* const code_lengths) argument
[all...]

Completed in 442 milliseconds

12