| /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 | 133 u_int8_t code[2]; /* range of code */ member in struct:ipt_icmp
138 #define IPT_ICMP_INV 0x01 /* Invert the sense of type/code test */
|
| /external/iptables/include/linux/netfilter_ipv4/ |
| ip_tables.h | 133 u_int8_t code[2]; /* range of code */ member in struct:ipt_icmp
138 #define IPT_ICMP_INV 0x01 /* Invert the sense of type/code test */
|
| /external/iptables/include/linux/netfilter_ipv6/ |
| ip6_tables.h | 190 u_int8_t code[2]; /* range of code */ member in struct:ip6t_icmp
195 #define IP6T_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
|
| if_pppox.h | 142 __u8 code; member in struct:pppoe_hdr
|
| /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/opencv/otherlibs/highgui/ |
| bitstrm.cpp | 19 // * Redistribution's of source code must retain the above copyright notice,
614 int code = src[k] & huff_code_mask; local
615 sub_tables[code >> sb].bits = sb;
654 int code = src[k] & huff_code_mask; local
660 int idx = code >> (code_bits -= table_bits);
661 code &= (1 << code_bits) - 1;
673 offset += (code << table_bits) + 1;
689 int i, val_idx, code = 0; local
696 code <<= 1;
699 dst[k + 1] = (src[val_idx + k] << huff_val_shift)|(code + k)
1051 ulong code = table[val + 2]; local
1099 int code = src[k] & huff_code_mask; local
[all...] |
| /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::__anon9659
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/skia/include/core/ |
| SkScalerContext.h | 90 unsigned code = ID2Code(fID); local
91 SkASSERT(code >= baseGlyphCount);
92 return code - baseGlyphCount;
146 static uint32_t MakeID(unsigned code) {
147 return code;
150 static uint32_t MakeID(unsigned code, SkFixed x, SkFixed y) {
151 SkASSERT(code <= kCodeMask);
156 code;
245 /** Map the glyphID to its glyph index, and then to its char code. Unmapped
|
| /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/ |
| builtins-arm.cc | 6 // * Redistributions of source code must retain the above copyright
196 // keeps the code below free of special casing for the empty array.
299 // If the Array cannot be constructed in native code the runtime is called. This
308 // entering the generic code. In both cases argc in r0 needs to be preserved.
309 // Both registers are preserved by this code so no need to differentiate between
440 // Run the native code for the Array function called as a normal function.
443 // Jump to the generic array code if the specialized code cannot handle
447 Handle<Code> array_code =
463 // The array construct code is only set for the builtin and interna
913 Handle<Code> code = local
[all...] |
| /external/v8/src/ |
| execution.cc | 6 // * Redistributions of source code must retain the above copyright
89 Handle<Code> code; local
92 code = stub.GetCode();
95 code = stub.GetCode();
115 JSEntryFunction entry = FUNCTION_CAST<JSEntryFunction>(code->entry());
118 byte* entry_address = func->code()->entry();
169 // Enter a try-block while executing the JavaScript code. To avoid
483 // See the similar code in runtime.js:ToBoolean.
|
| /external/v8/src/ia32/ |
| builtins-ia32.cc | 6 // * Redistributions of source code must retain the above copyright
94 __ lea(ebx, FieldOperand(ebx, Code::kHeaderSize));
103 Handle<Code> arguments_adaptor =
125 // Try to allocate the object without transitioning into C code. If any of the
126 // preconditions is not met, the code bails out to the runtime call.
214 // jump into the continuation code at any time from now on. Any failures
339 Handle<Code> code = local
342 __ InvokeCode(code, expected, expected,
439 // Invoke the code
[all...] |
| deoptimizer-ia32.cc | 6 // * Redistributions of source code must retain the above copyright
58 void Deoptimizer::EnsureRelocSpaceForLazyDeoptimization(Handle<Code> code) {
59 Isolate* isolate = code->GetIsolate();
62 // Compute the size of relocation information needed for the code
65 Address prev_reloc_address = code->instruction_start();
66 Address code_start_address = code->instruction_start();
67 SafepointTable table(*code);
74 // The gap code is needed to get to the state expected at the
94 int reloc_length = code->relocation_info()->length()
142 Code* code = function->code(); local
[all...] |
| /external/v8/src/x64/ |
| builtins-x64.cc | 6 // * Redistributions of source code must retain the above copyright
92 __ lea(rbx, FieldOperand(rbx, Code::kHeaderSize));
122 // Try to allocate the object without transitioning into C code. If any of the
123 // preconditions is not met, the code bails out to the runtime call.
216 // jump into the continuation code at any time from now on. Any failures
342 Handle<Code> code = local
345 __ InvokeCode(code, expected, expected,
493 // Invoke the code.
505 // context and the function left on the stack by the code
[all...] |
| /external/v8/test/cctest/ |
| test-assembler-mips.cc | 6 // * Redistributions of source code must retain the above copyright
76 Object* code = HEAP->CreateCode( local
78 Code::ComputeFlags(Code::STUB),
80 CHECK(code->IsCode());
81 F2 f = FUNCTION_CAST<F2>(Code::cast(code)->entry());
114 Object* code = HEAP->CreateCode( local
116 Code::ComputeFlags(Code::STUB)
254 Object* code = HEAP->CreateCode( local
320 Object* code = HEAP->CreateCode( local
386 Object* code = HEAP->CreateCode( local
455 Object* code = HEAP->CreateCode( local
528 Object* code = HEAP->CreateCode( local
602 Object* code = HEAP->CreateCode( local
701 Object* code = HEAP->CreateCode( local
748 Object* code = HEAP->CreateCode( local
809 Object* code = HEAP->CreateCode( local
941 Object* code = HEAP->CreateCode( local
1045 Object* code = HEAP->CreateCode( local
1104 Object* code = HEAP->CreateCode( local
1230 Object* code = HEAP->CreateCode( local
[all...] |
| /external/webkit/Source/JavaScriptCore/parser/ |
| Lexer.cpp | 288 const UChar* code = m_code + offset; local
289 return (code < m_codeEnd) ? *code : -1;
708 const UChar* code = m_code; local
709 while (code < m_codeEnd && (isWhiteSpace(*code) || isLineTerminator(*code)))
710 code++;
712 return code < m_codeEnd && *code == ':'
[all...] |
