| /external/chromium/third_party/icu/source/common/ |
| ucnvscsu.c | 58 * Unicode code points from 3400 to E000 are not adressible by
270 * Instead, there are two code blocks for the two SCSU modes.
277 * When the fast-path runs into a code that it cannot handle, its loop ends and it
282 * The callback handling is done by returning with an error code.
616 * Instead, there are two code blocks for the two SCSU modes.
623 * When the fast-path runs into a code that it cannot handle, its loop ends and it
628 * The callback handling is done by returning with an error code.
875 * Real compression heuristics are applied to the rest, in code branches for
876 * single/Unicode mode and BMP/supplementary code points.
1030 int code; local
1520 int code; local
[all...] |
| /external/chromium/third_party/zlib/ |
| deflate.h | 20 the crc code when it is not needed. For shared libraries, gzip encoding
31 /* number of length codes, not counting the special END_BLOCK code */
37 /* number of Literal or Length codes, including the END_BLOCK code */
61 /* Data structure describing a single value and its code string. */
65 ush code; /* bit string */ member in union:ct_data_s::__anon3284
74 #define Code fc.code
82 int max_code; /* largest code with non zero frequency */
229 * example a binary file with poorly compressible code followed by
239 /* Buffer for distances. To simplify the code, d_buf and l_buf hav
[all...] |
| trees.c | 12 * Each code tree is stored in a compressed form which is itself
13 * a Huffman encoding of the lengths of all the code strings (in
14 * ascending order by source values). The actual code strings are
50 /* end of block literal code */
61 local const int extra_lbits[LENGTH_CODES] /* extra bits for each length code */
64 local const int extra_dbits[D_CODES] /* extra bits for each distance code */
67 local const int extra_blbits[BL_CODES]/* extra bits for each bit length code */
109 /* length code for each normalized match length (0 == MIN_MATCH) */
112 /* First normalized length for each code (0 = MIN_MATCH) */
115 /* First normalized distance for each code (0 = distance of 1) *
245 int code; \/* code value *\/ local
583 ush code = 0; \/* running code value *\/ local
1080 unsigned code; \/* the code to send *\/ local
[all...] |
| /external/dbus/dbus/ |
| dbus-marshal-header.c | 70 unsigned char code; /**< the field code */ member in struct:__anon3374
786 _dbus_assert (_dbus_header_field_types[field].code == field);
911 _dbus_verbose ("Validating string header field; code %d if fails\n",
[all...] |
| /external/e2fsprogs/e2fsck/ |
| pass2.c | 101 problem_t code; local
204 code = 0;
209 code = PR_2_HTREE_MIN_HASH;
210 fix_problem(ctx, code, &pctx);
216 code = PR_2_HTREE_BAD_DEPTH;
217 fix_problem(ctx, code, &pctx);
229 code = PR_2_HTREE_MAX_HASH;
230 fix_problem(ctx, code, &pctx);
234 code = PR_2_HTREE_NOTREF;
235 fix_problem(ctx, code, &pctx)
[all...] |
| /external/emma/core/java12/com/vladium/jcd/cls/ |
| ClassDef.java | 374 // note: although this is not documented, J2SDK code uses '.''s as
581 final CodeAttribute_info code = new CodeAttribute_info (attribute_name_index, 0, 0, local
586 attributes.add (code);
|
| /external/freetype/include/freetype/internal/ |
| t1types.h | 59 /* code_first :: The lowest valid character code in the encoding. */
61 /* code_last :: The highest valid character code in the encoding */
142 FT_Byte** code; member in struct:CID_SubrsRec_
|
| /external/freetype/src/truetype/ |
| ttinterp.h | 143 FT_Int curRange; /* current code range number */
144 FT_Byte* code; /* current code range */ member in struct:TT_ExecContextRec_
178 TT_CodeRangeTable codeRangeTable; /* table of valid code ranges */
302 /* FreeType error code. 0 means success. */
|
| /external/icu4c/common/ |
| ucnvscsu.c | 58 * Unicode code points from 3400 to E000 are not adressible by
270 * Instead, there are two code blocks for the two SCSU modes.
277 * When the fast-path runs into a code that it cannot handle, its loop ends and it
282 * The callback handling is done by returning with an error code.
616 * Instead, there are two code blocks for the two SCSU modes.
623 * When the fast-path runs into a code that it cannot handle, its loop ends and it
628 * The callback handling is done by returning with an error code.
875 * Real compression heuristics are applied to the rest, in code branches for
876 * single/Unicode mode and BMP/supplementary code points.
1030 int code; local
1520 int code; local
[all...] |
| /external/iproute2/include/linux/netfilter_ipv4/ |
| ip_tables.h | 135 u_int8_t code[2]; /* range of code */ member in struct:ipt_icmp
140 #define IPT_ICMP_INV 0x01 /* Invert the sense of type/code test */
|
| /external/kernel-headers/original/linux/ |
| binder.h | 65 * On 64-bit platforms where user code may run in 32-bits the driver must
100 * handled by retrying the ioctl() until a different error code
106 * that once this error code is returned, all further calls to
107 * the driver from any thread will return this same code.
113 TF_STATUS_CODE = 0x08, /* contents are a 32-bit status code */
126 unsigned int code; /* transaction command */ member in struct:binder_transaction_data
172 * int: error code
|
| /external/kernel-headers/original/linux/netfilter_ipv4/ |
| ip_tables.h | 138 u_int8_t code[2]; /* range of code */ member in struct:ipt_icmp
143 #define IPT_ICMP_INV 0x01 /* Invert the sense of type/code test */
|
| /external/kernel-headers/original/linux/netfilter_ipv6/ |
| ip6_tables.h | 151 u_int8_t code[2]; /* range of code */ member in struct:ip6t_icmp
156 #define IP6T_ICMP_INV 0x01 /* Invert the sense of type/code test */
|
| /external/ppp/pppd/ |
| ipv6cp.c | 10 * 1. Redistributions of source code must retain the above copyright
84 This software is derived from source code from
106 * 1. Redistributions of source code must retain the above copyright
183 * Callbacks for fsm code. (CI = Configuration Information)
260 * Protocol entry points from main code.
694 #define NAKCIIFACEID(opt, neg, code) \
703 code \
706 #define NAKCIVJ(opt, neg, code) \
715 code \
900 int rc = CONFACK; /* Final packet return code */
1440 int code, id, len, olen; local
[all...] |
| /external/ppp/pppd/plugins/rp-pppoe/ |
| pppoe.h | 215 unsigned int code:8; /* PPPoE code */ member in struct:PPPoEPacketStruct
222 #define PPPOE_OVERHEAD 6 /* type, code, session, length */
|
| /external/proguard/src/proguard/classfile/editor/ |
| CodeAttributeComposer.java | 34 * copies them into code attributes that it visits.
67 private byte[] code = new byte[ClassConstants.TYPICAL_CODE_LENGTH]; field in class:CodeAttributeComposer
104 * Starts a new code definition.
116 * Starts a new code fragment. Branch instructions that are added are
117 * assumed to be relative within such code fragments.
118 * @param maximumCodeFragmentLength the maximum length of the code that will
127 throw new IllegalArgumentException("Maximum number of code fragment levels exceeded ["+level+"]");
137 // Make sure there is sufficient space for adding the code fragment.
142 // Try to reuse the previous array for this code fragment.
154 // Remember the location of the code fragment
[all...] |
| /external/qemu/distrib/sdl-1.2.12/include/ |
| SDL_events.h | 206 int code; /* User defined event code */ member in struct:SDL_UserEvent
|
| /external/qemu/distrib/zlib-1.2.3/ |
| deflate.h | 20 the crc code when it is not needed. For shared libraries, gzip encoding
31 /* number of length codes, not counting the special END_BLOCK code */
37 /* number of Literal or Length codes, including the END_BLOCK code */
61 /* Data structure describing a single value and its code string. */
65 ush code; /* bit string */ member in union:ct_data_s::__anon6254
74 #define Code fc.code
82 int max_code; /* largest code with non zero frequency */
229 * example a binary file with poorly compressible code followed by
239 /* Buffer for distances. To simplify the code, d_buf and l_buf hav
[all...] |
| trees.c | 12 * Each code tree is stored in a compressed form which is itself
13 * a Huffman encoding of the lengths of all the code strings (in
14 * ascending order by source values). The actual code strings are
50 /* end of block literal code */
61 local const int extra_lbits[LENGTH_CODES] /* extra bits for each length code */
64 local const int extra_dbits[D_CODES] /* extra bits for each distance code */
67 local const int extra_blbits[BL_CODES]/* extra bits for each bit length code */
109 /* length code for each normalized match length (0 == MIN_MATCH) */
112 /* First normalized length for each code (0 = MIN_MATCH) */
115 /* First normalized distance for each code (0 = distance of 1) *
245 int code; \/* code value *\/ local
583 ush code = 0; \/* running code value *\/ local
1080 unsigned code; \/* the code to send *\/ local
[all...] |
| /external/tcpdump/ |
| print-radius.c | 8 * 1. Redistributions of source code must retain the above copyright
147 struct radius_hdr { u_int8_t code; /* Radius packet code */ member in struct:radius_hdr
914 tok2str(radius_command_values,"Unknown Command",rad->code),
915 rad->code,
923 tok2str(radius_command_values,"Unknown Command",rad->code),
924 rad->code,
[all...] |
| /external/v8/src/arm/ |
| stub-cache-arm.cc | 6 // * Redistributions of source code must retain the above copyright
41 Code::Flags flags,
59 // Get the code entry from the cache.
64 __ ldr(offset, FieldMemOperand(offset, Code::kFlagsOffset));
65 __ and_(offset, offset, Operand(~Code::kFlagsNotUsedInLookup));
69 // Restore offset and re-load code entry from cache.
74 // Jump to the first instruction in the code stub.
75 __ add(offset, offset, Operand(Code::kHeaderSize - kHeapObjectTag));
85 Code::Flags flags,
92 // Make sure that code is valid. The shifting code relies on th
356 Code* code = NULL; local
1799 Code* code = Builtins::builtin(Builtins::JSConstructStubGeneric); local
[all...] |
| /external/v8/src/ |
| assembler.cc | 8 // - Redistributions of source code must retain the above copyright notice,
31 // The original source code covered by the above license above has been
390 RelocIterator::RelocIterator(Code* code, int mode_mask) {
391 rinfo_.pc_ = code->instruction_start();
394 pos_ = code->relocation_start() + code->relocation_size();
395 end_ = code->relocation_start();
430 return "code target (js construct call)";
432 return "code target (context)"
476 Code* code = Code::GetCodeFromTargetAddress(target_address()); local
505 Code* code = Code::GetCodeFromTargetAddress(addr); local
[all...] |
| execution.cc | 6 // * Redistributions of source code must retain the above copyright
65 Handle<Code> code; local
68 code = stub.GetCode();
71 code = stub.GetCode();
91 JSEntryFunction entry = FUNCTION_CAST<JSEntryFunction>(code->entry());
94 byte* entry_address = func->code()->entry();
139 // Enter a try-block while executing the JavaScript code. To avoid
424 // See the similar code in runtime.js:ToBoolean.
|
| stub-cache.cc | 6 // * Redistributions of source code must retain the above copyright
55 Code* StubCache::Set(String* name, Map* map, Code* code) {
56 // Get the flags from the code.
57 Code::Flags flags = Code::RemoveTypeFromFlags(code->flags());
68 ASSERT(Code::ExtractICStateFromFlags(flags) == MONOMORPHIC);
69 ASSERT(Code::kFlagsICStateShift == 0)
101 Object* code = receiver->map()->FindInCodeCache(name, flags); local
120 Object* code = receiver->map()->FindInCodeCache(name, flags); local
139 Object* code = receiver->map()->FindInCodeCache(name, flags); local
156 Object* code = receiver->map()->FindInCodeCache(name, flags); local
170 Code* code = Builtins::builtin(Builtins::LoadIC_Normal); local
181 Object* code = receiver->map()->FindInCodeCache(name, flags); local
203 Object* code = receiver->map()->FindInCodeCache(name, flags); local
222 Object* code = receiver->map()->FindInCodeCache(name, flags); local
240 Object* code = receiver->map()->FindInCodeCache(name, flags); local
259 Object* code = receiver->map()->FindInCodeCache(name, flags); local
277 Object* code = receiver->map()->FindInCodeCache(name, flags); local
294 Object* code = receiver->map()->FindInCodeCache(name, flags); local
311 Object* code = receiver->map()->FindInCodeCache(name, flags); local
330 Object* code = receiver->map()->FindInCodeCache(name, flags); local
347 Object* code = receiver->map()->FindInCodeCache(name, flags); local
365 Object* code = receiver->map()->FindInCodeCache(name, flags); local
382 Object* code = receiver->map()->FindInCodeCache(name, flags); local
399 Object* code = receiver->map()->FindInCodeCache(name, flags); local
436 Object* code = map->FindInCodeCache(name, flags); local
484 Object* code = map->FindInCodeCache(name, flags); local
521 Object* code = map->FindInCodeCache(name, flags); local
541 Object* code = ComputeCallNormal(argc, in_loop); local
556 Object* code = receiver->map()->FindInCodeCache(name, flags); local
710 Code* code = Code::cast(result); local
942 Code* code = Code::cast(result); local
960 Code* code = Code::cast(result); local
976 Code* code = Code::cast(result); local
992 Code* code = Code::cast(result); local
1008 Code* code = Code::cast(result); local
1022 Code* code = Code::cast(result); local
1039 Code* code = Code::cast(result); local
1127 Code* code = Code::cast(result); local
[all...] |
| /external/v8/src/x64/ |
| stub-cache-x64.cc | 6 // * Redistributions of source code must retain the above copyright
46 Code::Flags flags,
64 // Get the code entry from the cache.
69 __ movl(offset, FieldOperand(kScratchRegister, Code::kFlagsOffset));
70 __ and_(offset, Immediate(~Code::kFlagsNotUsedInLookup));
74 // Jump to the first instruction in the code stub.
75 __ addq(kScratchRegister, Immediate(Code::kHeaderSize - kHeapObjectTag));
82 void StubCompiler::GenerateLoadMiss(MacroAssembler* masm, Code::Kind kind) {
83 ASSERT(kind == Code::LOAD_IC || kind == Code::KEYED_LOAD_IC)
84 Code* code = NULL; local
1851 Code* code = Builtins::builtin(Builtins::JSConstructStubGeneric); local
[all...] |
