HomeSort by relevance Sort by last modified time
    Searched full:num_symbols (Results 1 - 25 of 35) sorted by null

1 2

  /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/third_party/libwebp/utils/
quant_levels.c 23 #define NUM_SYMBOLS 256
33 int freq[NUM_SYMBOLS] = { 0 };
34 int q_level[NUM_SYMBOLS] = { 0 };
35 double inv_q_level[NUM_SYMBOLS] = { 0 };
80 double q_sum[NUM_SYMBOLS] = { 0 };
81 double q_count[NUM_SYMBOLS] = { 0 };
126 uint8_t map[NUM_SYMBOLS];
huffman.c 149 int num_symbols = 0; local
159 ++num_symbols;
164 // Initialize the tree. Will fail for num_symbols = 0
165 if (!TreeInit(tree, num_symbols)) return 0;
168 if (num_symbols == 1) { // Trivial case.
208 int num_symbols) {
217 // Initialize the tree. Will fail if num_symbols = 0.
218 if (!TreeInit(tree, num_symbols)) return 0;
221 for (i = 0; i < num_symbols; ++i) {
huffman_encode.h 31 int num_symbols; // Number of symbols. member in struct:__anon14032
huffman_encode.c 351 const int depth_size = tree->num_symbols;
403 len = tree->num_symbols;
429 const int num_symbols = tree->num_symbols; local
430 if (!OptimizeHuffmanForRle(num_symbols, histogram)) {
433 if (!GenerateOptimalTree(histogram, num_symbols,
huffman.h 67 int num_symbols);
  /external/webp/src/utils/
quant_levels.c 23 #define NUM_SYMBOLS 256
33 int freq[NUM_SYMBOLS] = { 0 };
34 int q_level[NUM_SYMBOLS] = { 0 };
35 double inv_q_level[NUM_SYMBOLS] = { 0 };
80 double q_sum[NUM_SYMBOLS] = { 0 };
81 double q_count[NUM_SYMBOLS] = { 0 };
126 uint8_t map[NUM_SYMBOLS];
huffman.c 149 int num_symbols = 0; local
159 ++num_symbols;
164 // Initialize the tree. Will fail for num_symbols = 0
165 if (!TreeInit(tree, num_symbols)) return 0;
168 if (num_symbols == 1) { // Trivial case.
208 int num_symbols) {
217 // Initialize the tree. Will fail if num_symbols = 0.
218 if (!TreeInit(tree, num_symbols)) return 0;
221 for (i = 0; i < num_symbols; ++i) {
huffman_encode.h 31 int num_symbols; // Number of symbols. member in struct:__anon30396
huffman_encode.c 351 const int depth_size = tree->num_symbols;
403 len = tree->num_symbols;
429 const int num_symbols = tree->num_symbols; local
430 if (!OptimizeHuffmanForRle(num_symbols, histogram)) {
433 if (!GenerateOptimalTree(histogram, num_symbols,
huffman.h 67 int num_symbols);
  /system/core/libcorkscrew/
symbol_table.c 109 table->num_symbols = 0;
157 table->num_symbols += symbol_count + dynsymbol_count;
158 table->symbols = malloc(table->num_symbols * sizeof(symbol_t));
200 qsort(table->symbols, table->num_symbols, sizeof(symbol_t), qcompar);
215 for (size_t i = 0; i < table->num_symbols; i++) {
225 return (const symbol_t*)bsearch(&addr, table->symbols, table->num_symbols,
  /external/chromium/third_party/libjingle/source/talk/base/
latebindingsymboltable.cc 96 int num_symbols,
103 for (int i = 0; i < num_symbols; ++i) {
  /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 126 for (int i = 0; i < info_->num_symbols; ++i) {
154 memset(table_, 0, sizeof(void *) * info_->num_symbols);
  /system/core/include/corkscrew/
symbol_table.h 35 size_t num_symbols; member in struct:__anon62580
  /sdk/emulator/qtools/
trace_reader.cpp 25 DexSymList *head, int num_symbols);
818 DexSymList *head, int num_symbols)
824 if (num_symbols > 0) {
825 symbols = new DexSym[num_symbols];
827 dexfile->nsymbols = num_symbols;
933 int num_symbols = 0; local
944 CopyDexSymbolsToArray(dexfile, head, num_symbols);
956 num_symbols = 0;
993 num_symbols += 1;
998 CopyDexSymbolsToArray(dexfile, head, num_symbols);
    [all...]
  /external/chromium_org/third_party/tcmalloc/chromium/src/
symbolize.cc 263 int num_symbols = 0;
271 num_symbols++;
274 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/base/third_party/symbolize/
symbolize.cc 272 const int num_symbols = symtab->sh_size / symtab->sh_entsize; local
273 for (int i = 0; i < num_symbols;) {
280 #define NUM_SYMBOLS 32
282 #define NUM_SYMBOLS 64
285 // Read at most NUM_SYMBOLS symbols at once to save read() calls.
286 ElfW(Sym) buf[NUM_SYMBOLS];
  /external/chromium_org/third_party/libwebp/dec/
vp8l.c 172 int num_symbols, int* const code_lengths) {
189 if (max_symbol > num_symbols) {
194 max_symbol = num_symbols;
198 while (symbol < num_symbols) {
212 if (symbol + repeat > num_symbols) {
238 const int num_symbols = VP8LReadBits(br, 1) + 1; local
243 code_lengths[0] = num_symbols - 1;
245 if (num_symbols == 2) {
248 code_lengths[1] = num_symbols - 1;
251 alphabet_size, num_symbols);
    [all...]
  /external/chromium_org/third_party/libwebp/enc/
vp8l.c 196 const int num_symbols = (k == 0) ? VP8LHistogramNumCodes(histo) local
199 codes[k].num_symbols = num_symbols;
200 total_length_size += num_symbols;
217 const int bit_length = huffman_codes[i].num_symbols;
271 for (k = 0; k < huffman_code->num_symbols; ++k) {
277 for (k = 0; k < huffman_code->num_symbols; ++k) {
311 const int max_tokens = tree->num_symbols;
318 huffman_code.num_symbols = CODE_LENGTH_CODES;
385 for (i = 0; i < huffman_code->num_symbols && count < 3; ++i)
    [all...]
  /external/webp/src/dec/
vp8l.c 172 int num_symbols, int* const code_lengths) {
189 if (max_symbol > num_symbols) {
194 max_symbol = num_symbols;
198 while (symbol < num_symbols) {
212 if (symbol + repeat > num_symbols) {
238 const int num_symbols = VP8LReadBits(br, 1) + 1; local
243 code_lengths[0] = num_symbols - 1;
245 if (num_symbols == 2) {
248 code_lengths[1] = num_symbols - 1;
251 alphabet_size, num_symbols);
    [all...]
  /external/webp/src/enc/
vp8l.c 196 const int num_symbols = (k == 0) ? VP8LHistogramNumCodes(histo) local
199 codes[k].num_symbols = num_symbols;
200 total_length_size += num_symbols;
217 const int bit_length = huffman_codes[i].num_symbols;
271 for (k = 0; k < huffman_code->num_symbols; ++k) {
277 for (k = 0; k < huffman_code->num_symbols; ++k) {
311 const int max_tokens = tree->num_symbols;
318 huffman_code.num_symbols = CODE_LENGTH_CODES;
385 for (i = 0; i < huffman_code->num_symbols && count < 3; ++i)
    [all...]

Completed in 1770 milliseconds

1 2