HomeSort by relevance Sort by last modified time
    Searched refs:Code (Results 276 - 300 of 586) sorted by null

<<11121314151617181920>>

  /external/lzma/CPP/7zip/Compress/
LzmaEncoder.cpp 132 STDMETHODIMP CEncoder::Code(ISequentialInStream *inStream, ISequentialOutStream *outStream,
Bcj2Coder.cpp 253 STDMETHODIMP CEncoder::Code(ISequentialInStream **inStreams, const UInt64 **inSizes, UInt32 numInStreams,
373 STDMETHODIMP CDecoder::Code(ISequentialInStream **inStreams, const UInt64 **inSizes, UInt32 numInStreams,
  /art/compiler/dex/quick/
dex_file_method_inliner.cc 369 #define UNSAFE_GET_PUT(type, code, type_flags) \
370 INTRINSIC(SunMiscUnsafe, Get ## type, ObjectJ_ ## code, kIntrinsicUnsafeGet, \
372 INTRINSIC(SunMiscUnsafe, Get ## type ## Volatile, ObjectJ_ ## code, kIntrinsicUnsafeGet, \
374 INTRINSIC(SunMiscUnsafe, Put ## type, ObjectJ ## code ## _V, kIntrinsicUnsafePut, \
376 INTRINSIC(SunMiscUnsafe, Put ## type ## Volatile, ObjectJ ## code ## _V, kIntrinsicUnsafePut, \
378 INTRINSIC(SunMiscUnsafe, PutOrdered ## type, ObjectJ ## code ## _V, kIntrinsicUnsafePut, \
569 move_result->dalvikInsn.opcode = static_cast<Instruction::Code>(kMirOpNop);
    [all...]
  /dalvik/dx/src/com/android/dx/merge/
DexMerger.java 22 import com.android.dex.Code;
137 codeOut = dexOut.appendSection(writerSizes.code, "code");
660 * Reads a class_def_item beginning at {@code in} and writes the index and
818 private void transformCode(Dex in, Code code, IndexMap indexMap) {
822 codeOut.writeUnsignedShort(code.getRegistersSize());
823 codeOut.writeUnsignedShort(code.getInsSize());
824 codeOut.writeUnsignedShort(code.getOutsSize());
826 Code.Try[] tries = code.getTries()
1012 private int code; field in class:DexMerger.WriterSizes
    [all...]
  /external/chromium_org/chrome/browser/resources/chromeos/chromevox/closure/
closure_preinit.js 2 // Use of this source code is governed by a BSD-style license that can be
6 * @fileoverview Code to execute before Closure's base.js.
11 * Tell Closure to load JavaScript code from the extension root directory.
55 eval(response['code']);
  /external/chromium_org/native_client_sdk/src/doc/
faq.rst 28 compiled code.
29 * **Security:** Native Client lets users run native compiled code in the
34 * Developers can leverage existing code, written in C/C++ or other
37 * This code can interact with the embedding web page as part of an
64 .. link to it here. How does one profile PNaCl code? What are common
65 .. causes of slowness? How can code be made faster? What's the best way
96 How fast does code run in Portable Native Client?
113 averages. For example floating-point heavy code usually exhibits much
114 lower overheads whereas very branch-heavy code often performs worse.
117 native code such as :ref:`threading <language_support_threading>` an
    [all...]
  /external/chromium_org/third_party/skia/forth/
Forth.cpp 5 * Use of this source code is governed by a BSD-style license that can be
103 reading an initial 32bit value from the code stream:
113 11 -- switch (value >>> 2) for Code
137 enum Code {
143 static unsigned MakeCode(Code code) {
144 return (code << kCodeShift) | kCodeShift2_Bits;
202 // record the offset in the data part of the if-code
217 // record the offset in the data part of the code
268 // we assume ownership of code[]
    [all...]
  /external/chromium_org/v8/src/
contexts.cc 2 // Use of this source code is governed by a BSD-style license that can be
263 // enqueued as a code flushing candidate and we remove it now.
312 void Context::AddOptimizedCode(Code* code) {
314 ASSERT(code->kind() == Code::OPTIMIZED_FUNCTION);
315 ASSERT(code->next_code_link()->IsUndefined());
316 code->set_next_code_link(get(OPTIMIZED_CODE_LIST));
317 set(OPTIMIZED_CODE_LIST, code);
350 "Code generation from strings disallowed for this context")
    [all...]
regexp-macro-assembler.cc 2 // Use of this source code is governed by a BSD-style license that can be
35 #ifndef V8_INTERPRETED_REGEXP // Avoid unused code, e.g., on ARM.
81 Handle<Code> regexp_code,
135 Code* code,
148 int result = CALL_GENERATED_REGEXP_CODE(code->entry(),
161 // We detected a stack overflow (on the backtrack stack) in RegExp code,
220 // A GC might move the calling generated code and invalidate the
incremental-marking.cc 2 // Use of this source code is governed by a BSD-style license that can be
9 #include "src/code-stubs.h"
78 void IncrementalMarking::RecordCodeTargetPatch(Code* host,
90 Code* host = heap_->isolate()->inner_pointer_to_code_cache()->
100 Code* value) {
128 Code::cast(value));
462 void IncrementalMarking::ActivateGeneratedStub(Code* stub) {
492 RecordWriteStub::Patch(Code::cast(e), mode);
    [all...]
gdb-jit.cc 2 // Use of this source code is governed by a BSD-style license that can be
912 Code* code,
918 code_(code),
988 Code* code_;
1010 symtab->Add(ELFSymbol("V8 Code",
1068 w->WriteULEB128(1); // Abbreviation code.
2153 Code* code = reinterpret_cast<Code*>(e->key); local
    [all...]
  /external/chromium_org/v8/src/ia32/
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.
80 static Register from_code(int code) {
81 ASSERT(code >= 0);
82 ASSERT(code < kNumRegisters);
83 Register r = { code };
    [all...]
  /external/chromium_org/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
50 // compatible with int, which has caused code-generation bugs.
62 // code generated for some assembly instructions (because they boil down
63 // to a few constants). If this is a problem, we could change the code
66 // and best performance in optimized code.
83 return kAllocationIndexByRegisterCode[reg.code()];
110 static Register from_code(int code) {
111 Register r = { code };
118 int code() const function in struct:v8::internal::Register
    [all...]
codegen-x64.cc 2 // Use of this source code is governed by a BSD-style license that can be
100 // Generated code is put into a fixed, unmovable, buffer, and not into
183 // Code generators
546 // Load the two-byte character code into the result register.
621 // The sequence of instructions that is patched out for aging code is the
623 // FUNCTION and OPTIMIZED_FUNCTION code:
639 bool Code::IsYoungSequence(Isolate* isolate, byte* sequence) {
646 void Code::GetCodeAgeAndParity(Isolate* isolate, byte* sequence, Age* age,
655 Code* stub = GetCodeFromTargetAddress(target_address);
661 void Code::PatchPlatformCodeAge(Isolate* isolate
    [all...]
macro-assembler-x64.h 2 // Use of this source code is governed by a BSD-style license that can be
15 // Default scratch register used by MacroAssembler (and other code that needs
94 // May emit code to set up the scratch register. The operand is
102 // Special case code for load and store to take advantage of
112 // Returns the size of the code generated by LoadAddress.
155 void RememberedSetHelper(Register object, // Used for debug code.
295 // Generates function and stub prologue code.
340 // Invoke the JavaScript function code by either calling or jumping.
341 void InvokeCode(Register code,
375 // Store the code object for the given builtin in the target register
    [all...]
  /external/llvm/tools/llvm-readobj/
Win64EHDumper.cpp 56 // Returns the name of the unwind code.
57 static StringRef getUnwindCodeTypeName(uint8_t Code) {
58 switch (Code) {
59 default: llvm_unreachable("Invalid unwind code");
95 // Calculates the number of array slots required for the unwind code.
98 default: llvm_unreachable("Invalid unwind code");
172 // Prints one unwind code. Because an unwind code can occupy up to 3 slots in
  /external/lzma/Java/SevenZip/
LzmaBench.java 345 encoder.Code(inStream, compressedStream, -1, -1, progressInfo);
367 if (!decoder.Code(inputCompressedStream, crcOutStream, outSize))
  /art/compiler/dex/quick/mips/
int_mips.cc 218 void MipsMir2Lir::GenSelectConst32(RegStorage left_op, RegStorage right_op, ConditionCode code,
224 LIR* ne_branchover = OpCmpBranch(code, left_op, right_op, NULL);
374 bool MipsMir2Lir::SmallLiteralDivRem(Instruction::Code dalvik_opcode, bool is_div,
395 void MipsMir2Lir::GenAddLong(Instruction::Code opcode, RegLocation rl_dest,
417 void MipsMir2Lir::GenSubLong(Instruction::Code opcode, RegLocation rl_dest,
439 void MipsMir2Lir::GenArithOpLong(Instruction::Code opcode, RegLocation rl_dest, RegLocation rl_src1,
630 void MipsMir2Lir::GenShiftImmOpLong(Instruction::Code opcode, RegLocation rl_dest,
636 void MipsMir2Lir::GenArithImmOpLong(Instruction::Code opcode,
  /external/chromium_org/v8/src/arm64/
codegen-arm64.cc 2 // Use of this source code is governed by a BSD-style license that can be
101 // Code generators
355 // The sequence of instructions that is patched out for aging code is the
357 // FUNCTION and OPTIMIZED_FUNCTION code:
360 // The young sequence is the frame setup code for FUNCTION code types. It is
380 bool Code::IsYoungSequence(Isolate* isolate, byte* sequence) {
385 void Code::GetCodeAgeAndParity(Isolate* isolate, byte* sequence, Age* age,
392 Code* stub = GetCodeFromTargetAddress(Memory::Address_at(target));
398 void Code::PatchPlatformCodeAge(Isolate* isolate
    [all...]
  /external/chromium_org/v8/src/x87/
codegen-x87.cc 2 // Use of this source code is governed by a BSD-style license that can be
87 // Generated code is put into a fixed, unmovable buffer, and not into
186 // TODO(jkummerow): It would be nice to register this code creation event
195 // Code generators
554 // Load the two-byte character code into the result register.
592 bool Code::IsYoungSequence(Isolate* isolate, byte* sequence) {
599 void Code::GetCodeAgeAndParity(Isolate* isolate, byte* sequence, Age* age,
608 Code* stub = GetCodeFromTargetAddress(target_address);
614 void Code::PatchPlatformCodeAge(Isolate* isolate,
616 Code::Age age
    [all...]
  /external/clang/include/clang/Basic/
Diagnostic.h 42 /// \brief Annotates a diagnostic with some code that should be
47 /// amount of code will correct a compilation error. The compiler
53 /// \brief Code that should be replaced to correct the error. Empty for an
57 /// \brief Code in the specific range that should be inserted in the insertion
61 /// \brief The actual code to insert at the insertion location, as a
67 /// \brief Empty code modification hint, indicating that no code
75 /// \brief Create a code modification hint that inserts the given
76 /// code string at a specific location.
78 StringRef Code,
    [all...]
  /external/libmtp/src/
libusb-glue.c 503 * <code>free_mtpdevice_list(mtp_device_list)</code> when you are done
575 * The user shall simply <code>free()</code> this
600 "error code: %d on line %d\n", ret, __LINE__);
    [all...]
  /external/chromium_org/third_party/zlib/
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 (0 = distance of 1) *
246 int code; \/* code value *\/ local
587 ush code = 0; \/* running code value *\/ local
1084 unsigned code; \/* the code to send *\/ local
    [all...]
  /external/chromium_org/v8/src/mips/
regexp-macro-assembler-mips.cc 2 // Use of this source code is governed by a BSD-style license that can be
11 #include "src/code-stubs.h"
25 * - t1 : Pointer to current code object (Code*) including heap object tag.
43 * - fp[60] direct_call (if 1, direct call from JavaScript code,
76 * code and the remaining arguments are passed in registers, e.g. by calling the
77 * code entry as cast to a function with the signature:
89 * When calling as a non-direct call (i.e., from C++ code), the return address
90 * area is overwritten with the ra register by the RegExp code. When doing a
91 * direct call from generated code, the return address is placed there b
860 Handle<Code> code = isolate()->factory()->NewCode( local
    [all...]
  /external/clang/lib/AST/
MicrosoftMangle.cpp 470 char Code = '\0';
472 case MSInheritanceAttr::Keyword_single_inheritance: Code = '0'; break;
473 case MSInheritanceAttr::Keyword_multiple_inheritance: Code = '0'; break;
474 case MSInheritanceAttr::Keyword_virtual_inheritance: Code = 'F'; break;
475 case MSInheritanceAttr::Keyword_unspecified_inheritance: Code = 'G'; break;
478 Out << '$' << Code;
501 char Code = '\0';
503 case MSInheritanceAttr::Keyword_single_inheritance: Code = '1'; break;
504 case MSInheritanceAttr::Keyword_multiple_inheritance: Code = 'H'; break;
505 case MSInheritanceAttr::Keyword_virtual_inheritance: Code = 'I'; break
    [all...]

Completed in 1244 milliseconds

<<11121314151617181920>>