/external/zopfli/src/zopfli/ |
tree.c | 33 size_t* next_code = (size_t*)malloc(sizeof(size_t) * (maxbits + 1)); local 55 next_code[bits] = code; 62 symbols[i] = next_code[len]; 63 next_code[len]++; 68 free(next_code);
|
/external/chromium-trace/trace-viewer/third_party/closure_linter/closure_linter/ |
ecmametadatapass.py | 295 next_code = tokenutil.SearchExcept(token, TokenType.NON_CODE_TYPES) 296 if next_code.type != TokenType.START_BLOCK: 317 next_code = tokenutil.SearchExcept(token, TokenType.NON_CODE_TYPES) 318 if (next_code.type != TokenType.START_BLOCK and 319 (next_code.type != TokenType.KEYWORD or next_code.string != 'if')): 442 next_code = tokenutil.SearchExcept(token, TokenType.NON_CODE_TYPES) 446 not next_code or next_code.line_number != token.line_number) 452 next_code_is_operator = next_code and next_code.type == TokenType.OPERATO [all...] |
indentation.py | 213 next_code = tokenutil.SearchExcept(token, Type.NON_CODE_TYPES) 214 if next_code and next_code.type == Type.END_BLOCK: 215 next_code = tokenutil.SearchExcept(next_code, Type.NON_CODE_TYPES) 216 if next_code and next_code.string in ('else', 'case', 'default'):
|
ecmalintrules.py | 635 next_code = tokenutil.SearchExcept(equal_operator, Type.NON_CODE_TYPES) 636 if next_code and ( 637 next_code.type in (Type.START_BRACKET, Type.START_BLOCK) or 638 next_code.IsOperator('new')): [all...] |
/external/chromium_org/third_party/closure_linter/closure_linter/ |
ecmametadatapass.py | 295 next_code = tokenutil.SearchExcept(token, TokenType.NON_CODE_TYPES) 296 if next_code.type != TokenType.START_BLOCK: 317 next_code = tokenutil.SearchExcept(token, TokenType.NON_CODE_TYPES) 318 if (next_code.type != TokenType.START_BLOCK and 319 (next_code.type != TokenType.KEYWORD or next_code.string != 'if')): 442 next_code = tokenutil.SearchExcept(token, TokenType.NON_CODE_TYPES) 446 not next_code or next_code.line_number != token.line_number) 452 next_code_is_operator = next_code and next_code.type == TokenType.OPERATO [all...] |
indentation.py | 213 next_code = tokenutil.SearchExcept(token, Type.NON_CODE_TYPES) 214 if next_code and next_code.type == Type.END_BLOCK: 215 next_code = tokenutil.SearchExcept(next_code, Type.NON_CODE_TYPES) 216 if next_code and next_code.string in ('else', 'case', 'default'):
|
ecmalintrules.py | 635 next_code = tokenutil.SearchExcept(equal_operator, Type.NON_CODE_TYPES) 636 if next_code and ( 637 next_code.type in (Type.START_BRACKET, Type.START_BLOCK) or 638 next_code.IsOperator('new')): [all...] |
/external/chromium_org/third_party/libwebp/utils/ |
huffman_encode.c | 378 uint32_t next_code[MAX_ALLOWED_CODE_LENGTH + 1]; local 389 next_code[0] = 0; 394 next_code[i] = code; 399 tree->codes[i] = ReverseBits(code_length, next_code[code_length]++);
|
/external/webp/src/utils/ |
huffman_encode.c | 378 uint32_t next_code[MAX_ALLOWED_CODE_LENGTH + 1]; local 389 next_code[0] = 0; 394 next_code[i] = code; 399 tree->codes[i] = ReverseBits(code_length, next_code[code_length]++);
|
/external/chromium_org/third_party/brotli/src/brotli/enc/ |
entropy_encode.cc | 488 uint16_t next_code[kMaxBits]; local 489 next_code[0] = 0; 494 next_code[bits] = code; 499 bits[i] = ReverseBits(depth[i], next_code[depth[i]]++);
|
/external/pdfium/core/src/fxcodec/fx_zlib/zlib_v128/ |
fx_zlib_trees.c | 580 ush next_code[MAX_BITS+1]; /* next code value for each bit length */ local 589 next_code[bits] = code = (code + bl_count[bits-1]) << 1; 602 tree[n].Code = bi_reverse(next_code[len]++, len); 605 n, (isgraph(n) ? n : ' '), len, tree[n].Code, next_code[len]-1)); [all...] |
/external/qemu/distrib/zlib-1.2.8/ |
trees.c | 580 ush next_code[MAX_BITS+1]; /* next code value for each bit length */ local 589 next_code[bits] = code = (code + bl_count[bits-1]) << 1; 602 tree[n].Code = bi_reverse(next_code[len]++, len); 605 n, (isgraph(n) ? n : ' '), len, tree[n].Code, next_code[len]-1)); [all...] |
/external/zlib/src/ |
trees.c | 580 ush next_code[MAX_BITS+1]; /* next code value for each bit length */ local 589 next_code[bits] = code = (code + bl_count[bits-1]) << 1; 602 tree[n].Code = bi_reverse(next_code[len]++, len); 605 n, (isgraph(n) ? n : ' '), len, tree[n].Code, next_code[len]-1)); [all...] |
/external/chromium_org/third_party/zlib/ |
trees.c | 586 ush next_code[MAX_BITS+1]; /* next code value for each bit length */ local 595 next_code[bits] = code = (code + bl_count[bits-1]) << 1; 608 tree[n].Code = bi_reverse(next_code[len]++, len); 611 n, (isgraph(n) ? n : ' '), len, tree[n].Code, next_code[len]-1)); [all...] |