HomeSort by relevance Sort by last modified time
    Searched refs:Code (Results 176 - 200 of 274) sorted by null

1 2 3 4 5 6 78 91011

  /external/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::__anon14463
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...]
  /external/v8/src/
serialize.cc 6 // * Redistributions of source code must retain the above copyright
84 uint32_t code(int i) { return refs_[i].code; } function in class:v8::internal::ExternalReferenceTable
88 int max_id(int code) { return max_id_[code]; }
98 uint32_t code; member in struct:v8::internal::ExternalReferenceTable::ExternalReferenceEntry
160 entry.code = EncodeExternal(type, id);
162 ASSERT_NE(0, entry.code);
176 // NOTE: This function was originally 100k of code. It has since been
178 // very easily cause code bloat. Please be careful in the future when addin
    [all...]
full-codegen.cc 6 // * Redistributions of source code must retain the above copyright
299 Code::Flags flags = Code::ComputeFlags(Code::FUNCTION, NOT_IN_LOOP);
300 Handle<Code> code = CodeGenerator::MakeCodeEpilogue(&masm, flags, info); local
301 code->set_optimizable(info->IsOptimizable());
302 cgen.PopulateDeoptimizationData(code);
303 code->set_has_deoptimization_support(info->HasDeoptimizationSupport());
304 code->set_allow_osr_at_loop_nesting_level(0)
    [all...]
heap.h 6 // * Redistributions of source code must retain the above copyright
121 V(Code, js_entry_code, JsEntryCode) \
122 V(Code, js_construct_entry_code, JsConstructEntryCode) \
148 V(code_symbol, ".code") \
345 // code that looks here, because it is faster than loading from the static
485 // Allocates an empty code cache.
559 // Computes a single character string where the character has code.
564 uint16_t code);
    [all...]
objects-debug.cc 6 // * Redistributions of source code must retain the above copyright
120 Code::cast(this)->CodeVerify();
400 void Code::CodeVerify() {
438 // Code/ByteArray: Compiled code.
558 VerifyPointer(code());
spaces.cc 6 // * Redistributions of source code must retain the above copyright
225 // Code range is full or too fragmented.
322 // space, and one for code space.
378 // Allocate executable memory either from code range or from the
2455 Code* code = Code::cast(obj); local
3139 Code* code = Code::cast(obj); local
    [all...]
  /external/v8/src/ia32/
macro-assembler-ia32.cc 6 // * Redistributions of source code must retain the above copyright
117 // Clobber all input registers when running with the debug-code flag
145 // Clobber all input registers when running with the debug-code flag
320 Check(not_equal, "code object not properly patched");
343 // Reserve room for entry stack pointer and push the code object.
453 // Adjust this code if not the case.
466 // for ebp. We expect the code throwing an exception to check ebp
490 // Adjust this code if not the case.
527 // Adjust this code if not the case.
595 // When generating debug code, make sure the lexical context is set
    [all...]
lithium-codegen-ia32.cc 6 // * Redistributions of source code must retain the above copyright
33 #include "code-stubs.h"
67 HPhase phase("Code generation", chunk());
78 void LCodeGen::FinishCode(Handle<Code> code) {
80 code->set_stack_slots(StackSlotCount());
81 code->set_safepoint_table_offset(safepoints_.GetCodeOffset());
82 PopulateDeoptimizationData(code);
83 Deoptimizer::EnsureRelocSpaceForLazyDeoptimization(code);
134 // Reserve space for the stack slots needed by the code
242 LDeferredCode* code = deferred_[i]; local
    [all...]
regexp-macro-assembler-ia32.cc 6 // * Redistributions of source code must retain the above copyright
60 * - direct_call (if 1, direct call from JavaScript code, if 0
86 * code, by calling the code entry as cast to a function with the signature:
112 __ jmp(&entry_label_); // We'll write the entry code later.
153 // Pop Code* offset from backtrack stack, add Code* and jump to location.
666 // Finalize code - write the entry point code now we know how many
669 // Entry code
877 Handle<Code> code = local
    [all...]
assembler-ia32.h 8 // - Redistributions of source code must retain the above copyright notice,
31 // The original source code covered by the above license above has been
49 // compatible with int, which has caused code-generation bugs.
61 // code generated for some assembly instructions (because they boil down
62 // to a few constants). If this is a problem, we could change the code
65 // and best performance in optimized code.
77 static Register from_code(int code) {
78 Register r = { code };
85 int code() const { function in struct:v8::internal::Register
120 return (reg.code() >= 6) ? reg.code() - 2 : reg.code()
165 int code() const { function in struct:v8::internal::XMMRegister
    [all...]
  /external/v8/src/arm/
lithium-codegen-arm.cc 6 // * Redistributions of source code must retain the above copyright
32 #include "code-stubs.h"
52 // for the generated code there.
80 HPhase phase("Code generation", chunk());
92 void LCodeGen::FinishCode(Handle<Code> code) {
94 code->set_stack_slots(StackSlotCount());
95 code->set_safepoint_table_offset(safepoints_.GetCodeOffset());
96 PopulateDeoptimizationData(code);
97 Deoptimizer::EnsureRelocSpaceForLazyDeoptimization(code);
246 LDeferredCode* code = deferred_[i]; local
    [all...]
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/x64/
assembler-x64.h 8 // - Redistributions of source code must retain the above copyright notice,
31 // The original source code covered by the above license above has been
71 // compatible with int, which has caused code-generation bugs.
83 // code generated for some assembly instructions (because they boil down
84 // to a few constants). If this is a problem, we could change the code
87 // and best performance in optimized code.
102 return kAllocationIndexByRegisterCode[reg.code()];
128 static Register toRegister(int code) {
129 Register r = { code };
134 int code() const function in struct:v8::internal::Register
220 int code() const { function in struct:v8::internal::XMMRegister
    [all...]
lithium-codegen-x64.cc 6 // * Redistributions of source code must retain the above copyright
33 #include "code-stubs.h"
81 HPhase phase("Code generation", chunk());
92 void LCodeGen::FinishCode(Handle<Code> code) {
94 code->set_stack_slots(StackSlotCount());
95 code->set_safepoint_table_offset(safepoints_.GetCodeOffset());
96 PopulateDeoptimizationData(code);
97 Deoptimizer::EnsureRelocSpaceForLazyDeoptimization(code);
148 // Reserve space for the stack slots needed by the code
264 LDeferredCode* code = deferred_[i]; local
    [all...]
macro-assembler-x64.cc 6 // * Redistributions of source code must retain the above copyright
86 // Safe code.
105 // Safe code.
125 // Safe code.
228 // The compiled code assumes that record write doesn't change the
241 // Clobber all input registers when running with the debug-code flag
257 // The compiled code assumes that record write doesn't change the
273 // Clobber all input registers when running with the debug-code flag
331 // Clobber all input registers when running with the debug-code flag
438 call(Handle<Code>(Code::cast(result->ToObjectUnchecked()))
    [all...]
  /external/libffi/src/s390/
sysv.S 162 .uleb128 0x1 # CIE Code Alignment Factor
361 .uleb128 0x1 # CIE Code Alignment Factor
  /external/llvm/lib/Transforms/InstCombine/
InstCombineAndOrXor.cpp 141 static Value *getICmpValue(bool Sign, unsigned Code, Value *LHS, Value *RHS,
144 switch (Code) {
145 default: assert(0 && "Illegal ICmp code!");
163 static Value *getFCmpValue(bool isordered, unsigned code,
167 switch (code) {
168 default: assert(0 && "Illegal FCmp code!");
342 "Lo is not <= Hi in range emission code!");
729 unsigned Code = getICmpCode(LHS) & getICmpCode(RHS);
731 return getICmpValue(isSigned, Code, Op0, Op1, Builder);
    [all...]
  /external/v8/tools/
tickprocessor.js 6 // * Redistributions of source code must retain the above copyright
61 * Parser for dynamic code optimization state.
69 throw new Error("unknown code state: " + s);
75 'code-creation': {
78 'code-move': { parsers: [parseInt, parseInt],
80 'code-delete': { parsers: [parseInt],
93 print('Snapshot: Code move event for unknown code: 0x' +
97 print('Snapshot: Code delete event for unknown code: 0x'
    [all...]
  /frameworks/base/docs/html/resources/
resources_toc.cs 8 <span class="en">Sample Code</span>
11 <span class="fr" style="display:none">Exemple de code</span>
  /external/libffi/src/alpha/
osf.S 309 .byte 0x1 # uleb128 0x1; CIE Code Alignment Factor
  /external/libffi/src/powerpc/
linux64_closure.S 111 # Each of the ret_typeX code fragments has to be exactly 16 bytes long
206 .uleb128 0x1 # CIE Code Alignment Factor
  /external/libffi/src/sparc/
v8.S 209 .byte 0x1 ! uleb128 0x1; CIE Code Alignment Factor
  /external/qemu/distrib/sdl-1.2.12/src/video/cybergfx/
SDL_amigaevents.c 40 SDL_keysym *amiga_TranslateKey(int code, SDL_keysym *keysym);
116 static int amiga_GetButton(int code)
118 switch(code)
131 int class=msg->Class,code=msg->Code; local
176 if(!(code&IECODE_UP_PREFIX))
179 amiga_GetButton(code), 0, 0);
184 code&=~IECODE_UP_PREFIX;
186 amiga_GetButton(code), 0, 0);
194 if( !(code&IECODE_UP_PREFIX)
    [all...]
  /external/v8/test/cctest/
test-log-stack-tracer.cc 6 // * Redistributions of source code must retain the above copyright
85 // pure JS code is being executed
205 i::Code* code = function->code(); local
206 return code->contains(addr);
278 // execution of a native function called from JS code. In this case,
320 // execution of JS code. However, as calling StackTracer requires
321 // entering native code, we can only emulate pure JS by erasing
394 // pure native code. StackTracer only unrolls JS code, so we can'
    [all...]
  /external/llvm/lib/MC/
MCAssembler.cpp 702 SmallString<256> Code;
703 raw_svector_ostream VecOS(Code);
709 IF.getCode() = Code;

Completed in 1663 milliseconds

1 2 3 4 5 6 78 91011