/third_party/parse5/packages/parse5/ |
H A D | uglify-source.js | 30 const code = fs.readFileSync(filePath, 'utf-8'); 31 uglifyCode(code, filePath); 41 function uglifyCode(code, outPath) { 42 const uglifyCode = uglifyJS.minify(code).code;
|
/third_party/weex-loader/ |
H A D | uglify-source.js | 31 const code = fs.readFileSync(filePath, 'utf-8'); 32 uglifyCode(code, filePath); 42 function uglifyCode(code, outPath) { 43 const uglifyCode = uglifyJS.minify(code).code;
|
/third_party/node/deps/cjs-module-lexer/ |
H A D | lexer.js | 72 // Out-of-range surrogate code (above 0xD800) 1058 // code point above 128. 1069 // >0xffff code points that are a valid part of identifiers. The 1080 // This has a complexity linear to the value of the code. The 1083 function isInAstralSet(code, set) { 1087 if (pos > code) return false 1089 if (pos >= code) return true 1093 // Test whether a given character code starts an identifier. 1095 function isIdentifierStart(code, astral) { 1096 if (code < 6 [all...] |
/third_party/node/deps/brotli/c/enc/ |
H A D | compress_fragment.c | 64 /* Builds a literal prefix code into "depths" and "bits" based on the statistics 66 Note that the prefix code here is built from the pre-LZ77 input, therefore 71 with generated code. */ 125 /* Builds a command and distance prefix code (each 64 symbols) into "depth" and 184 const size_t code = insertlen + 40; in EmitInsertLen() local 185 BrotliWriteBits(depth[code], bits[code], storage_ix, storage); in EmitInsertLen() 186 ++histo[code]; in EmitInsertLen() 198 const size_t code = nbits + 50; in EmitInsertLen() local 199 BrotliWriteBits(depth[code], bit in EmitInsertLen() 240 const size_t code = (nbits << 1) + prefix + 20; EmitCopyLen() local 247 const size_t code = nbits + 28; EmitCopyLen() local 271 const size_t code = (nbits << 1) + prefix + 4; EmitCopyLenLastDistance() local 277 const size_t code = (tail >> 5) + 30; EmitCopyLenLastDistance() local 286 const size_t code = nbits + 28; EmitCopyLenLastDistance() local [all...] |
/third_party/skia/third_party/externals/brotli/c/enc/ |
H A D | compress_fragment.c | 64 /* Builds a literal prefix code into "depths" and "bits" based on the statistics 66 Note that the prefix code here is built from the pre-LZ77 input, therefore 71 with generated code. */ 125 /* Builds a command and distance prefix code (each 64 symbols) into "depth" and 184 const size_t code = insertlen + 40; in EmitInsertLen() local 185 BrotliWriteBits(depth[code], bits[code], storage_ix, storage); in EmitInsertLen() 186 ++histo[code]; in EmitInsertLen() 198 const size_t code = nbits + 50; in EmitInsertLen() local 199 BrotliWriteBits(depth[code], bit in EmitInsertLen() 240 const size_t code = (nbits << 1) + prefix + 20; EmitCopyLen() local 247 const size_t code = nbits + 28; EmitCopyLen() local 271 const size_t code = (nbits << 1) + prefix + 4; EmitCopyLenLastDistance() local 277 const size_t code = (tail >> 5) + 30; EmitCopyLenLastDistance() local 286 const size_t code = nbits + 28; EmitCopyLenLastDistance() local [all...] |
/third_party/node/test/parallel/ |
H A D | test-fs-access.js | 96 assert.strictEqual(err.code, 'ENOENT'); 123 assert.strictEqual(err.code, 'ERR_INVALID_ARG_TYPE'); 142 code: 'ERR_INVALID_ARG_TYPE', 151 code: 'ERR_INVALID_ARG_TYPE', 172 code: 'ERR_INVALID_ARG_TYPE', 178 code: 'ERR_INVALID_ARG_TYPE', 194 code: 'ERR_OUT_OF_RANGE', 200 code: 'ERR_OUT_OF_RANGE', 208 assert.strictEqual(err.code, 'ENOENT'); 224 assert.strictEqual(err.code, 'ENOEN [all...] |
H A D | test-vm-basic.js | 103 code: 'ERR_INVALID_ARG_TYPE', 114 code: 'ERR_INVALID_ARG_TYPE', 125 code: 'ERR_INVALID_ARG_TYPE', 161 code: 'ERR_INVALID_ARG_TYPE', 162 message: 'The "code" argument must be of type string. ' + 170 code: 'ERR_INVALID_ARG_TYPE', 192 code: 'ERR_INVALID_ARG_TYPE', 205 code: 'ERR_INVALID_ARG_TYPE', 219 code: 'ERR_INVALID_ARG_TYPE', 239 code [all...] |
H A D | test-ttywrap-invalid-fd.js | 16 code: 'ERR_INVALID_FD', 24 code: common.isWindows ? 'EBADF' : 'EINVAL', 40 code: 'ERR_TTY_INIT_FAILED', 53 code: 'ERR_TTY_INIT_FAILED', 63 code: 'ERR_INVALID_FD', 23 code: common.isWindows ? 'EBADF' : 'EINVAL', global() property
|
/third_party/skia/third_party/externals/harfbuzz/src/ |
H A D | gen-ucd-table.py | 107 code = packTab.Code('_hb_ucd') variable 108 sc_array, _ = code.addArray('hb_script_t', 'sc_map', sc_array) 109 dm1_p0_array, _ = code.addArray('uint16_t', 'dm1_p0_map', dm1_p0_array) 110 dm1_p2_array, _ = code.addArray('uint16_t', 'dm1_p2_map', dm1_p2_array) 111 dm2_u32_array, _ = code.addArray('uint32_t', 'dm2_u32_map', dm2_u32_array) 112 dm2_u64_array, _ = code.addArray('uint64_t', 'dm2_u64_map', dm2_u64_array) 113 code.print_c(linkage='static inline') 149 code = packTab.Code('_hb_ucd') variable 154 sol.genCode(code, name) 156 code [all...] |
/third_party/python/Lib/test/test_capi/ |
H A D | test_misc.py | 263 code = textwrap.dedent(""" 270 rc, out, err = assert_python_failure('-c', code) 291 code = textwrap.dedent(""" 298 rc, out, err = assert_python_failure('-c', code) 326 code = textwrap.dedent(""" 333 rc, out, err = assert_python_failure('-c', code) 356 code = """if 1: 382 rc, out, err = assert_python_ok('-c', code) 532 code = textwrap.dedent(""" 539 rc, out, err = assert_python_failure('-c', code) [all...] |
/third_party/skia/third_party/externals/zlib/ |
H A D | trees.c | 13 * Each code tree is stored in a compressed form which is itself 14 * a Huffman encoding of the lengths of all the code strings (in 15 * ascending order by source values). The actual code strings are 51 /* end of block literal code */ 62 local const int extra_lbits[LENGTH_CODES] /* extra bits for each length code */ 65 local const int extra_dbits[D_CODES] /* extra bits for each distance code */ 68 local const int extra_blbits[BL_CODES]/* extra bits for each bit length code */ 105 /* length code for each normalized match length (0 == MIN_MATCH) */ 108 /* First normalized length for each code (0 = MIN_MATCH) */ 111 /* First normalized distance for each code ( 239 int code; /* code value */ tr_static_init() local 578 unsigned code = 0; /* running code value */ global() local 1050 unsigned code; /* the code to send */ global() local [all...] |
/third_party/openGLES/xml/ |
H A D | readme.tex | 19 \def\code#1{{\tt #1}} 59 often used for additional purposes such as library code generators or 69 \code{make} and generate C/C++ header files for all the following 73 \item \code{GL/glext.h} - OpenGL 1.2 (and later) compatibility profile 75 \item \code{GL/glcorearb.h} - OpenGL core profile API + extensions 76 \item \code{GLES/gl.h} - OpenGL compatibility profile API 77 \item \code{GLES/glext.h} - OpenGL ES 1.x extensions 78 \item \code{GLES2/gl2.h} - OpenGL ES 2.x API 79 \item \code{GLES2/gl2ext.h} - OpenGL ES 2.x extensions 80 \item \code{GLES [all...] |
/third_party/lwip/src/netif/ppp/ |
H A D | chap-new.c | 10 * 1. Redistributions of source code must retain the above copyright 93 static void chap_handle_response(ppp_pcb *pcb, int code, 102 static void chap_handle_status(ppp_pcb *pcb, int code, int id, 173 if (dp->code == digest_code) in chap_auth_peer() 205 if (dp->code == digest_code) in chap_auth_with_peer() 394 pcb->chap_server.digest->code, 497 static void chap_handle_status(ppp_pcb *pcb, int code, int id, argument 507 if (code == CHAP_SUCCESS) { 511 code = CHAP_FAILURE; 526 if (code 536 unsigned char code, id; global() local 595 int code, id, len; global() local [all...] |
/third_party/ffmpeg/libavcodec/ |
H A D | h261enc.c | 148 int sign, code; in h261_encode_motion() local 150 code = 0; in h261_encode_motion() 151 put_bits(pb, ff_h261_mv_tab[code][1], ff_h261_mv_tab[code][0]); in h261_encode_motion() 158 code = sign ? -val : val; in h261_encode_motion() 159 put_bits(pb, ff_h261_mv_tab[code][1], ff_h261_mv_tab[code][0]); in h261_encode_motion() 182 int level, run, i, j, last_index, last_non_zero, sign, slevel, code; in h261_encode_block() local 227 code = get_rl_index(rl, 0 /*no last in H.261, EOB is used*/, in h261_encode_block() 230 code in h261_encode_block() 351 int len, code; init_uni_h261_rl_tab() local [all...] |
H A D | bmvaudio.c | 66 uint8_t code = *buf++; in bmv_aud_decode_frame() local 67 code = (code >> 1) | (code << 7); in bmv_aud_decode_frame() 68 scale[0] = bmv_aud_mults[code & 0xF]; in bmv_aud_decode_frame() 69 scale[1] = bmv_aud_mults[code >> 4]; in bmv_aud_decode_frame()
|
/third_party/node/lib/internal/fs/cp/ |
H A D | cp.js | 84 code: 'EINVAL', 94 code: 'EISDIR', 104 code: 'ENOTDIR', 115 code: 'EINVAL', 133 if (err.code === 'ENOENT') return null; 151 (err) => (err.code === 'ENOENT' ? false : PromiseReject(err))); 168 if (err.code === 'ENOENT') return; 177 code: 'EINVAL', 205 code: 'EISDIR', 219 code [all...] |
/third_party/node/deps/openssl/openssl/crypto/sha/asm/ |
H A D | sha1-ppc.pl | 87 $code.=<<___ if (!$LITTLE_ENDIAN); 90 $code.=<<___ if ($LITTLE_ENDIAN); 106 $code.=<<___ if ($i<15); 117 $code.=<<___ if ($i>=15); 137 $code.=<<___ if ($i<79); 151 $code.=<<___ if ($i==79); 171 $code.=<<___; 189 $code=<<___; 302 $code.=<<___; 306 $code [all...] |
/third_party/openssl/crypto/sha/asm/ |
H A D | sha1-ppc.pl | 87 $code.=<<___ if (!$LITTLE_ENDIAN); 90 $code.=<<___ if ($LITTLE_ENDIAN); 106 $code.=<<___ if ($i<15); 117 $code.=<<___ if ($i>=15); 137 $code.=<<___ if ($i<79); 151 $code.=<<___ if ($i==79); 171 $code.=<<___; 189 $code=<<___; 302 $code.=<<___; 306 $code [all...] |
/third_party/node/deps/zlib/ |
H A D | trees.c | 13 * Each code tree is stored in a compressed form which is itself 14 * a Huffman encoding of the lengths of all the code strings (in 15 * ascending order by source values). The actual code strings are 51 /* end of block literal code */ 62 local const int extra_lbits[LENGTH_CODES] /* extra bits for each length code */ 65 local const int extra_dbits[D_CODES] /* extra bits for each distance code */ 68 local const int extra_blbits[BL_CODES]/* extra bits for each bit length code */ 105 /* length code for each normalized match length (0 == MIN_MATCH) */ 108 /* First normalized length for each code (0 = MIN_MATCH) */ 111 /* First normalized distance for each code ( 154 bi_reverse(unsigned code, int len) bi_reverse() argument 204 unsigned code = 0; /* running code value */ gen_codes() local 300 int code; /* code value */ tr_static_init() local 903 unsigned code; /* the code to send */ compress_block() local [all...] |
/third_party/libwebsockets/win32port/zlib/ |
H A D | trees.c | 13 * Each code tree is stored in a compressed form which is itself
14 * a Huffman encoding of the lengths of all the code strings (in
15 * ascending order by source values). The actual code strings are
51 /* end of block literal code */
62 local const int extra_lbits[LENGTH_CODES] /* extra bits for each length code */
65 local const int extra_dbits[D_CODES] /* extra bits for each distance code */
68 local const int extra_blbits[BL_CODES]/* extra bits for each bit length code */
110 /* length code for each normalized match length (0 == MIN_MATCH) */
113 /* First normalized length for each code (0 = MIN_MATCH) */
116 /* First normalized distance for each code ( 246 int code; /* code value */ tr_static_init() local 587 ush code = 0; /* running code value */ global() local 1062 unsigned code; /* the code to send */ global() local [all...] |
/third_party/zlib/ |
H A D | trees.c | 13 * Each code tree is stored in a compressed form which is itself 14 * a Huffman encoding of the lengths of all the code strings (in 15 * ascending order by source values). The actual code strings are 51 /* end of block literal code */ 62 local const int extra_lbits[LENGTH_CODES] /* extra bits for each length code */ 65 local const int extra_dbits[D_CODES] /* extra bits for each distance code */ 68 local const int extra_blbits[BL_CODES]/* extra bits for each bit length code */ 105 /* length code for each normalized match length (0 == MIN_MATCH) */ 108 /* First normalized length for each code (0 = MIN_MATCH) */ 111 /* First normalized distance for each code ( 163 bi_reverse(unsigned code, int len) bi_reverse() argument 217 unsigned code = 0; /* running code value */ gen_codes() local 315 int code; /* code value */ tr_static_init() local 928 unsigned code; /* the code to send */ compress_block() local [all...] |
/third_party/curl/tests/libtest/ |
H A D | lib1556.c | 49 CURLcode code; in test() local 63 code = curl_easy_perform(curl); in test() 64 if(CURLE_OK != code) { in test() 66 "with code %d (%s)\n", in test() 67 __FILE__, __LINE__, (int)code, curl_easy_strerror(code)); in test()
|
/third_party/elfutils/libdw/ |
H A D | dwarf_tag.c | 39 __libdw_findabbrev (struct Dwarf_CU *cu, unsigned int code) in __libdw_findabbrev() argument 43 /* Abbreviation code can never have a value of 0. */ in __libdw_findabbrev() 44 if (unlikely (code == 0)) in __libdw_findabbrev() 48 abb = Dwarf_Abbrev_Hash_find (&cu->abbrev_hash, code); in __libdw_findabbrev() 67 /* Is this the code we are looking for? */ in __libdw_findabbrev() 68 if (abb->code == code) in __libdw_findabbrev() 73 and the code is invalid. */ in __libdw_findabbrev()
|
/third_party/skia/src/effects/ |
H A D | SkHighContrastFilter.cpp | 4 * Use of this source code is governed by a BSD-style license that can be 23 SkString code{R"( in Make() 26 code += kRGB_to_HSL_sksl; in Make() 27 code += kHSL_to_RGB_sksl; in Make() 28 code += R"( in Make() 47 std::move(code)); in Make()
|
/third_party/backends/japi/ |
H A D | Sane.java | 25 account of linking the SANE library code into it. 91 public int versionMajor(int code) in versionMajor() argument 92 { return ((code) >> 24) & 0xff; } in versionMajor() 93 public int versionMinor(int code) in versionMinor() argument 94 { return ((code) >> 16) & 0xff; } in versionMinor() 95 public int versionBuild(int code) in versionBuild() argument 96 { return ((code) >> 0) & 0xffff; } in versionBuild()
|