| /dalvik/dx/src/com/android/dx/dex/cf/ |
| CfTranslator.java | 19 import com.android.dx.cf.code.ConcreteMethod;
20 import com.android.dx.cf.code.Ropper;
27 import com.android.dx.dex.code.DalvCode;
28 import com.android.dx.dex.code.PositionList;
29 import com.android.dx.dex.code.RopTranslator;
35 import com.android.dx.rop.code.AccessFlags;
36 import com.android.dx.rop.code.LocalVariableExtractor;
37 import com.android.dx.rop.code.LocalVariableInfo;
38 import com.android.dx.rop.code.RopMethod;
39 import com.android.dx.rop.code.DexTranslationAdvice
237 DalvCode code; local
[all...] |
| /dalvik/dx/src/com/android/dx/dex/code/ |
| OutputFinisher.java | 17 package com.android.dx.dex.code;
19 import com.android.dx.rop.code.LocalItem;
20 import com.android.dx.rop.code.RegisterSpec;
21 import com.android.dx.rop.code.RegisterSpecList;
22 import com.android.dx.rop.code.RegisterSpecSet;
23 import com.android.dx.rop.code.SourcePosition;
40 * {@code >= 0;} register count for the method, not including any extra
45 /** {@code non-null;} the list of instructions, per se */
55 * {@code >= 0;} the count of reserved registers (low-numbered
65 * @param regCount {@code >= 0;} register count for the metho
[all...] |
| /dalvik/dx/src/com/android/dx/rop/code/ |
| RegOps.java | 17 package com.android.dx.rop.code;
24 * <p><b>Note:</b> Opcode descriptions use a rough pseudocode. {@code r}
25 * is the result register, {@code x} is the first argument,
26 * {@code y} is the second argument, and {@code z} is the
32 /** {@code nop()} */
35 /** {@code T: any type; r,x: T :: r = x;} */
38 /** {@code T: any type; r,param(x): T :: r = param(x)} */
42 * {@code T: Throwable; r: T :: r = caught_exception}.
49 /** {@code T: any type; r, literal: T :: r = literal;} *
[all...] |
| RegisterSpec.java | 17 package com.android.dx.rop.code;
33 /** {@code non-null;} string to prefix register numbers with */
36 /** {@code non-null;} intern table for instances */
40 /** {@code non-null;} common comparison instance used while interning */
43 /** {@code >= 0;} register number */
46 /** {@code non-null;} type loaded or stored */
49 /** {@code null-ok;} local variable info associated with this register, if any */
55 * @param reg {@code >= 0;} the register number
56 * @param type {@code non-null;} the type (or possibly actual value) which
58 * @param local {@code null-ok;} the associated local variable, if an
[all...] |
| /development/ndk/platforms/android-3/include/linux/ |
| filter.h | 23 __u16 code; member in struct:sock_filter
35 #define BPF_CLASS(code) ((code) & 0x07)
45 #define BPF_SIZE(code) ((code) & 0x18)
49 #define BPF_MODE(code) ((code) & 0xe0)
57 #define BPF_OP(code) ((code) & 0xf0)
72 #define BPF_SRC(code) ((code) & 0x08
[all...] |
| /external/chromium/net/url_request/ |
| url_request_http_job.cc | 2 // Use of this source code is governed by a BSD-style license that can be
35 // TODO(darin): make sure the port blocking code is not lost
274 int code = GetResponseCode(); local
275 if (code == -1)
280 switch (code) {
|
| /external/iproute2/include/linux/ |
| inet_diag.h | 45 * All the commands identified by "code" are conditional jumps forward:
51 unsigned char code; member in struct:inet_diag_bc_op
|
| /external/jpeg/ |
| jchuff.c | 36 * structure assignment. You'll need to fix this code if you have
102 * just count the Huffman symbols used and generate Huffman code tables.
187 unsigned int code; local
189 /* Note that huffsize[] and huffcode[] are filled in code-length order,
208 /* Figure C.1: make table of Huffman code length for each symbol */
222 /* We also validate that the counts represent a legal Huffman code tree. */
224 code = 0;
229 huffcode[p++] = code;
230 code++;
232 /* code is now 1 more than the last code used for codelength si; bu
[all...] |
| jdhuff.c | 37 * structure assignment. You'll need to fix this code if you have
159 unsigned int code; local
161 /* Note that huffsize[] and huffcode[] are filled in code-length order,
181 /* Figure C.1: make table of Huffman code length for each symbol */
195 /* We also validate that the counts represent a legal Huffman code tree. */
197 code = 0;
202 huffcode[p++] = code;
203 code++;
205 /* code is now 1 more than the last code used for codelength si; bu
414 register INT32 code; local
[all...] |
| /external/kernel-headers/original/linux/ |
| filter.h | 16 * Current version of the filter code architecture.
23 * the BPF code definitions which need to match so you can share filters
28 __u16 code; /* Actual filter code */ member in struct:sock_filter
58 #define BPF_CLASS(code) ((code) & 0x07)
69 #define BPF_SIZE(code) ((code) & 0x18)
73 #define BPF_MODE(code) ((code) & 0xe0
[all...] |
| /external/ppp/pppd/ |
| ccp.c | 10 * 1. Redistributions of source code must retain the above copyright
165 * Protocol entry points from main code.
206 * Callbacks for fsm code.
475 * Handle a CCP-specific code.
478 ccp_extcode(f, code, id, p, len)
480 int code, id;
484 switch (code) {
937 * Peer wants us to use a different code size or something.
1492 int code, id, len; local
[all...] |
| /external/skia/include/core/ |
| SkScalerContext.h | 69 unsigned code = ID2Code(fID); local
70 SkASSERT(code >= baseGlyphCount);
71 return code - baseGlyphCount;
125 static uint32_t MakeID(unsigned code) {
126 return code;
129 static uint32_t MakeID(unsigned code, SkFixed x, SkFixed y) {
130 SkASSERT(code <= kCodeMask);
135 code;
215 /** Map the glyphID to its glyph index, and then to its char code. Unmapped
|
| /external/tcpdump/ |
| print-egp.c | 221 register int code; local
238 code = egp->egp_code;
244 switch (code) {
247 printf(" %s", egp_acquire_codes[code]);
267 printf(" %s", egp_acquire_codes[code]);
285 printf("[code %d]", code);
291 switch (code) {
295 printf(" %s", egp_reach_codes[code]);
303 printf("[reach code %d]", code)
[all...] |
| smbutil.c | 184 /* XXX - this should use the same code that the DNS dissector does */
867 int code; member in struct:__anon7932
904 { "ERRerror", 1, "Non-specific error code." },
963 int code; member in struct:__anon7933
991 if (err_classes[i].code == class) {
995 if (num == err[j].code) {
1011 u_int32_t code; member in struct:__anon7934
[all...] |
| /external/v8/src/arm/ |
| builtins-arm.cc | 6 // * Redistributions of source code must retain the above copyright
191 // keeps the code below free of special casing for the empty array.
291 // If the Array cannot be constructed in native code the runtime is called. This
300 // entering the generic code. In both cases argc in r0 needs to be preserved.
301 // Both registers are preserved by this code so no need to differentiate between
431 // Run the native code for the Array function called as a normal function.
434 // Jump to the generic array code if the specialized code cannot handle
437 Code* code = Builtins::builtin(Builtins::ArrayCodeGeneric) local
472 Code* code = Builtins::builtin(Builtins::JSConstructStubGeneric); local
753 Handle<Code> code = Handle<Code>( local
[all...] |
| /external/v8/src/ |
| codegen.cc | 6 // * Redistributions of source code must retain the above copyright
80 // Copy the register locations from the code generator's frame.
82 // deferred code and restored on exit.
102 DeferredCode* code = deferred_.RemoveLast(); local
103 ASSERT(masm_ == code->masm());
104 // Record position of deferred code stub.
105 masm_->RecordStatementPosition(code->statement_position());
106 if (code->position() != RelocInfo::kNoPosition) {
107 masm_->RecordPosition(code->position());
109 // Generate the code
198 Handle<Code> code = local
[all...] |
| frames.cc | 6 // * Redistributions of source code must retain the above copyright
102 // frame code that computes the caller state to access the top
309 void StackHandler::Cook(Code* code) {
311 ASSERT(code->contains(pc()));
312 set_pc(AddressFrom<Address>(pc() - code->instruction_start()));
316 void StackHandler::Uncook(Code* code) {
318 set_pc(code->instruction_start() + OffsetFrom(pc()));
319 ASSERT(code->contains(pc()))
357 Code* code = this->code(); local
368 Code* code = this->code(); local
384 Code* EntryFrame::code() const { function in class:v8::internal::EntryFrame
401 Code* EntryConstructFrame::code() const { function in class:v8::internal::EntryConstructFrame
412 Code* ExitFrame::code() const { function in class:v8::internal::ExitFrame
488 Code* JavaScriptFrame::code() const { function in class:v8::internal::JavaScriptFrame
494 Code* ArgumentsAdaptorFrame::code() const { function in class:v8::internal::ArgumentsAdaptorFrame
499 Code* InternalFrame::code() const { function in class:v8::internal::InternalFrame
501 Object* code = Memory::Object_at(fp() + offset); local
523 Code* code = NULL; local
[all...] |
| ic.cc | 6 // * Redistributions of source code must retain the above copyright
51 // computed from the original code - not the patched code. Let
52 // these cases fall through to the unreachable code below.
63 Code* new_target,
79 // To improve the performance of the (much used) IC code, we unfold
80 // a few levels of the stack frame iteration code. This yields a
114 // Find the function on the stack and both the active code for the
115 // function and the original code.
118 Code* code = shared->code() local
184 Code* code = Code::cast(Heap::FindCodeObject(addr)); local
501 Object* code = NULL; local
713 Object* code = NULL; local
808 Object* code = NULL; local
821 Object* code = StubCache::ComputeKeyedLoadArrayLength(*name, *array); local
833 Object* code = local
927 Object* code = NULL; local
1077 Object* code = NULL; local
1223 Object* code = NULL; local
[all...] |
| /external/v8/src/ia32/ |
| builtins-ia32.cc | 6 // * Redistributions of source code must retain the above copyright
90 __ lea(ebx, FieldOperand(ebx, Code::kHeaderSize));
103 __ jmp(Handle<Code>(builtin(ArgumentsAdaptorTrampoline)),
120 // Try to allocate the object without transitioning into C code. If any of the
121 // preconditions is not met, the code bails out to the runtime call.
183 // jump into the continuation code at any time from now on. Any failures
307 Handle<Code> code = Handle<Code>( local
310 __ InvokeCode(code, expected, expected
1100 Code* code = Builtins::builtin(Builtins::ArrayCodeGeneric); local
1136 Code* code = Builtins::builtin(Builtins::JSConstructStubGeneric); local
[all...] |
| /external/v8/src/x64/ |
| builtins-x64.cc | 6 // * Redistributions of source code must retain the above copyright
109 // -- rdx : code entry to call
298 __ Jump(Handle<Code>(builtin(ArgumentsAdaptorTrampoline)),
303 // 5b. Get the code to call from the function and check that the number of
305 // (tail-call) to the code in register edx without checking arguments.
310 __ lea(rdx, FieldOperand(rdx, Code::kHeaderSize));
313 Handle<Code>(builtin(ArgumentsAdaptorTrampoline)),
422 Handle<Code> ic(Builtins::builtin(Builtins::KeyedLoadIC_Initialize));
535 // Fill the FixedArray with the hole value. Inline the code if short.
592 // keeps the code below free of special casing for the empty array
837 Code* code = Builtins::builtin(Builtins::ArrayCodeGeneric); local
874 Code* code = Builtins::builtin(Builtins::JSConstructStubGeneric); local
1120 Handle<Code> code = Handle<Code>( local
[all...] |
| /external/webkit/JavaScriptCore/jit/ |
| JITStubs.h | 8 * 1. Redistributions of source code must retain the above copyright
92 void* code; member in struct:JSC::JITStackFrame
107 // When JIT code makes a call, it pushes its return address just below the rest of the stack.
128 void* code; member in struct:JSC::JITStackFrame
135 // When JIT code makes a call, it pushes its return address just below the rest of the stack.
156 // These arguments passed in r1..r3 (r0 contained the entry code pointed, which is not preserved)
191 // When JIT code makes a call, it pushes its return address just below the rest of the stack.
241 extern "C" EncodedJSValue ctiTrampoline(void* code, RegisterFile*, CallFrame*, JSValue* exception, Profiler**, JSGlobalData*);
|
| /external/webkit/WebCore/bridge/ |
| testbindings.cpp | 343 static char code[BufferSize]; variable
353 int num = fread(code, 1, BufferSize, f);
354 code[num] = '\0';
360 return code;
386 const char *code = readJavaScriptFromFile(argv[i]); local
388 if (code) {
390 Completion comp(interp.evaluate(code));
|
| /external/webkit/WebCore/inspector/ |
| InspectorBackend.cpp | 9 * 1. Redistributions of source code must retain the above copyright
366 ExceptionCode code; local
367 parentNode->removeChild(node, code);
368 if (code) {
|
| /external/webkit/WebCore/loader/ |
| TextResourceDecoder.cpp | 101 static int ISkanji(int code)
103 if (code >= 0x100)
105 return sjisMap[code & 0xff] & 1;
107 static int ISkana(int code)
109 if (code >= 0x100)
111 return sjisMap[code & 0xff] & 2;
156 enum Type code; local
165 code = ASCII;
172 code = JIS;
176 code = JIS
[all...] |
| /external/webkit/WebKit/chromium/src/ |
| WebDevToolsAgentImpl.cpp | 8 * * Redistributions of source code must retain the above copyright
339 // Call custom code to create inspector backend wrapper in the utility context
439 String code; local
442 code = WebCore::toWebCoreStringWithNullCheck(args[0]);
443 if (code.isEmpty() || exceptionCatcher.HasCaught())
449 v8::Local<v8::Value> result = proxy->runScript(v8::Script::Compile(v8::String::New(code.utf8().data())), true);
|
