Home
last modified time | relevance | path

Searched refs:next_code (Results 1 – 17 of 17) sorted by relevance

/external/chromium_org/third_party/closure_linter/closure_linter/
Decmametadatapass.py342 next_code = tokenutil.SearchExcept(token, TokenType.NON_CODE_TYPES)
343 if next_code.type != TokenType.START_BLOCK:
364 next_code = tokenutil.SearchExcept(token, TokenType.NON_CODE_TYPES)
365 if (next_code.type != TokenType.START_BLOCK and
366 (next_code.type != TokenType.KEYWORD or next_code.string != 'if')):
493 next_code = tokenutil.SearchExcept(token, TokenType.NON_CODE_TYPES)
497 not next_code or next_code.line_number != token.line_number)
503 next_code_is_operator = next_code and next_code.type == TokenType.OPERATOR
504 next_code_is_dot = next_code and next_code.string == '.'
510 next_code and
[all …]
Dindentation.py213 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'):
Decmalintrules.py654 next_code = tokenutil.SearchExcept(equal_operator, Type.NON_CODE_TYPES)
655 if next_code and (
656 next_code.type in (Type.START_BRACKET, Type.START_BLOCK) or
657 next_code.IsOperator('new')):
/external/chromium-trace/trace-viewer/third_party/closure_linter/closure_linter/
Decmametadatapass.py295 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.OPERATOR
453 next_code_is_dot = next_code and next_code.string == '.'
457 next_code_is_block = next_code and next_code.type == TokenType.START_BLOCK
Dindentation.py213 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'):
Decmalintrules.py635 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')):
/external/zopfli/src/zopfli/
Dtree.c33 size_t* next_code = (size_t*)malloc(sizeof(size_t) * (maxbits + 1)); in ZopfliLengthsToSymbols() local
55 next_code[bits] = code; in ZopfliLengthsToSymbols()
62 symbols[i] = next_code[len]; in ZopfliLengthsToSymbols()
63 next_code[len]++; in ZopfliLengthsToSymbols()
68 free(next_code); in ZopfliLengthsToSymbols()
/external/chromium_org/third_party/libwebp/utils/
Dhuffman_encode.c378 uint32_t next_code[MAX_ALLOWED_CODE_LENGTH + 1]; in ConvertBitDepthsToSymbols() local
389 next_code[0] = 0; in ConvertBitDepthsToSymbols()
394 next_code[i] = code; in ConvertBitDepthsToSymbols()
399 tree->codes[i] = ReverseBits(code_length, next_code[code_length]++); in ConvertBitDepthsToSymbols()
/external/webp/src/utils/
Dhuffman_encode.c378 uint32_t next_code[MAX_ALLOWED_CODE_LENGTH + 1]; in ConvertBitDepthsToSymbols() local
389 next_code[0] = 0; in ConvertBitDepthsToSymbols()
394 next_code[i] = code; in ConvertBitDepthsToSymbols()
399 tree->codes[i] = ReverseBits(code_length, next_code[code_length]++); in ConvertBitDepthsToSymbols()
/external/chromium_org/third_party/brotli/src/brotli/enc/
Dentropy_encode.cc488 uint16_t next_code[kMaxBits]; in ConvertBitDepthsToSymbols() local
489 next_code[0] = 0; in ConvertBitDepthsToSymbols()
494 next_code[bits] = code; in ConvertBitDepthsToSymbols()
499 bits[i] = ReverseBits(depth[i], next_code[depth[i]]++); in ConvertBitDepthsToSymbols()
/external/qemu/distrib/zlib-1.2.8/
Dtrees.c580 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));
/external/chromium_org/third_party/zlib/
Dtrees.c586 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));
/external/zlib/src/
Dtrees.c580 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));
/external/pdfium/core/src/fxcodec/fx_zlib/zlib_v128/
Dfx_zlib_trees.c580 ush next_code[MAX_BITS+1]; /* next code value for each bit length */ in gen_codes() local
589 next_code[bits] = code = (code + bl_count[bits-1]) << 1; in gen_codes()
602 tree[n].Code = bi_reverse(next_code[len]++, len); in gen_codes()
605 n, (isgraph(n) ? n : ' '), len, tree[n].Code, next_code[len]-1)); in gen_codes()
/external/pcre/dist/
Dpcre_compile.c3075 const pcre_uchar *next_code; in compare_opcodes() local
3150 next_code = code + GET(code, 1); in compare_opcodes()
3153 while (*next_code == OP_ALT) in compare_opcodes()
3156 code = next_code + 1 + LINK_SIZE; in compare_opcodes()
3157 next_code += GET(next_code, 1); in compare_opcodes()
3166 next_code = code + 1; in compare_opcodes()
3167 if (*next_code != OP_BRA && *next_code != OP_CBRA in compare_opcodes()
3168 && *next_code != OP_ONCE && *next_code != OP_ONCE_NC) return FALSE; in compare_opcodes()
3170 do next_code += GET(next_code, 1); while (*next_code == OP_ALT); in compare_opcodes()
3174 next_code += 1 + LINK_SIZE; in compare_opcodes()
[all …]
/external/zlib/src/doc/
Drfc1951.txt432 next_code[bits] = code;
444 tree[n].Code = next_code[len];
445 next_code[len]++;
468 Step 2 computes the following next_code values:
470 N next_code[N]
/external/chromium_org/third_party/brotli/src/brotli/
Dbrotlispec.txt353 next_code[bits] = code;
365 tree[n].Code = next_code[len];
366 next_code[len]++;
381 Step 2 computes the following next_code values:
383 N next_code[N]