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

12 3 4 5 6 7 8 91011

  /external/v8/src/
stub-cache.h 6 // * Redistributions of source code must retain the above copyright
40 // It maps (map, name, type)->Code*
66 Code* value;
201 Code::Kind,
210 Code::Kind,
211 Code::ExtraICState extra_ic_state,
219 Code::Kind,
224 Code::Kind,
232 Code::Kind,
243 Code::Kind kind)
    [all...]
deoptimizer.h 6 // * Redistributions of source code must retain the above copyright
88 // List of deoptimized code which still have references from active stack
89 // frames. These code objects are needed by the deoptimizer when deoptimizing
90 // a frame for which the code object for the function function has been
91 // changed from the code present when deoptimizing was done.
119 // information of a code object to perform lazy deoptimization
123 static void EnsureRelocSpaceForLazyDeoptimization(Handle<Code> code);
125 // Deoptimize the function now. Its current optimized code will never be run
126 // again and any activations of the optimized code will get deoptimized whe
    [all...]
frames.h 6 // * Redistributions of source code must retain the above copyright
42 // Return the code of the n-th saved register available to JavaScript.
55 Code* code; member in struct:v8::internal::PcToCodeCache::PcToCodeCacheEntry
63 Code* GcSafeFindCodeForPc(Address pc);
64 Code* GcSafeCastToCode(HeapObject* object, Address pc);
102 inline void Iterate(ObjectVisitor* v, Code* holder) const;
211 // Get the code associated with this frame.
213 virtual Code* unchecked_code() const = 0;
215 // Get the code associated with this frame
446 Handle<Code> code() { return code_; } function in class:v8::internal::BASE_EMBEDDED
    [all...]
log.h 6 // * Redistributions of source code must retain the above copyright
43 // Minimal logging (no API, code, or GC sample events), default is off.
47 // --log-api, --log-code, --log-gc, and --log-regexp.
52 // --log-code
53 // Log code (create, move, and delete) events to the logfile, default is off.
54 // --log-code implies --log.
69 // tick profiler requires code events, so --prof implies --log-code.
92 V(CODE_CREATION_EVENT, "code-creation") \
93 V(CODE_MOVE_EVENT, "code-move")
    [all...]
ic.cc 6 // * Redistributions of source code must retain the above copyright
52 // computed from the original code - not the patched code. Let
53 // these cases fall through to the unreachable code below.
64 Code* new_target,
83 // To improve the performance of the (much used) IC code, we unfold
84 // a few levels of the stack frame iteration code. This yields a
119 // Find the function on the stack and both the active code for the
120 // function and the original code.
123 Code* code = shared->code() local
238 Code* code = Code::cast(isolate()->heap()->FindCodeObject(addr)); local
769 Object* code; local
816 Object* code; local
1050 Object* code; local
1171 Object* code = NULL; local
1188 Object* code; local
1206 Object* code; local
1328 Object* code; local
1578 Object* code = NULL; local
1756 Object* code = NULL; local
2106 Handle<Code> code = GetTypeRecordingBinaryOpStub(key, type, result_type); local
    [all...]
log.cc 6 // * Redistributions of source code must retain the above copyright
33 #include "code-stubs.h"
290 // http://code.google.com/p/v8/issues/detail?id=487
735 Code* code,
743 msg.AppendAddress(code->address());
744 msg.Append(",%d,\"", code->ExecutableSize());
752 LowLevelCodeCreateEvent(code, &msg);
760 Code* code,
    [all...]
objects-inl.h 6 // * Redistributions of source code must retain the above copyright
32 // code. gcc is not happy when attempting to inline too deep.
1024 // CAUTION: The original code below:
1163 // Assert that we are not in GC, implement GC code in a way that it doesn't
    [all...]
cpu-profiler.h 6 // * Redistributions of source code must retain the above copyright
241 Code* code, const char* comment);
243 Code* code, String* name);
245 Code* code,
249 Code* code,
253 Code* code, int args_count)
    [all...]
frames.cc 6 // * Redistributions of source code must retain the above copyright
116 // frame code that computes the caller state to access the top
368 Code* StackFrame::GetSafepointData(Isolate* isolate,
376 entry->safepoint_entry = entry->code->GetSafepointEntry(pc);
379 ASSERT(entry->safepoint_entry.Equals(entry->code->GetSafepointEntry(pc)));
382 // Fill in the results and return the code.
383 Code* code = entry->code; local
385 *stack_slots = code->stack_slots()
402 Object* code = holder; local
578 Code* code = StackFrame::GetSafepointData( local
765 Code* code = function->shared()->code(); local
790 Code* code = opt_function->code(); local
862 Object* code = Memory::Object_at(fp() + offset); local
884 Code* code = NULL; local
1113 Code* code = reinterpret_cast<Code*>(object); local
    [all...]
factory.h 6 // * Redistributions of source code must retain the above copyright
109 // characters of the string are uninitialized. Currently used in regexp code
253 Handle<Code> NewCode(const CodeDesc& desc,
254 Code::Flags flags,
258 Handle<Code> CopyCode(Handle<Code> code);
260 Handle<Code> CopyCode(Handle<Code> code, Vector<byte> reloc_info)
    [all...]
debug.cc 6 // * Redistributions of source code must retain the above copyright
33 #include "code-stubs.h"
86 static Handle<Code> ComputeCallDebugBreak(int argc, Code::Kind kind) {
91 Code);
95 static Handle<Code> ComputeCallDebugPrepareStepIn(int argc, Code::Kind kind) {
100 Code);
136 // Iterate through reloc info for code and original code stopping at eac
168 Code* code = Code::GetCodeFromTargetAddress(target); local
507 Code* code = Code::GetCodeFromTargetAddress(target); local
1325 Code* code = Code::GetCodeFromTargetAddress(target); local
1497 Code* code = Code::GetCodeFromTargetAddress(addr); local
    [all...]
  /external/llvm/utils/TableGen/
StringMatcher.cpp 40 /// code to verify that CharNo and later are the same.
42 /// \return - True if control can leave the emitted code fragment.
50 // matching code.
54 // If the to-execute code has \n's in it, indent each subsequent line.
55 StringRef Code = Matches[0]->second;
57 std::pair<StringRef, StringRef> Split = Code.split('\n');
60 Code = Split.second;
61 while (!Code.empty()) {
62 Split = Code.split('\n');
64 Code = Split.second
    [all...]
  /external/v8/test/cctest/
test-assembler-arm.cc 6 // * Redistributions of source code must retain the above copyright
69 Object* code = HEAP->CreateCode( variable
71 Code::ComputeFlags(Code::STUB),
73 CHECK(code->IsCode());
75 Code::cast(code)->Print();
77 F2 f = FUNCTION_CAST<F2>(Code::cast(code)->entry());
106 Object* code = HEAP->CreateCode variable
152 Object* code = HEAP->CreateCode( variable
200 Object* code = HEAP->CreateCode( variable
315 Object* code = HEAP->CreateCode( variable
375 Object* code = HEAP->CreateCode( variable
410 Object* code = HEAP->CreateCode( variable
486 Object* code = HEAP->CreateCode( local
672 Object* code = HEAP->CreateCode( variable
787 Object* code = HEAP->CreateCode( variable
898 Object* code = HEAP->CreateCode( variable
    [all...]
  /dalvik/dx/src/com/android/dx/io/
Code.java 19 public final class Code {
28 public Code(int registersSize, int insSize, int outsSize, int debugInfoOffset,
  /external/opencv/cxcore/include/
cxerror.h 19 // * Redistribution's of source code must retain the above copyright notice,
138 CV_ERROR macro unconditionally raises error with passed code and message.
141 #define CV_ERROR( Code, Msg ) \
143 cvError( (Code), cvFuncName, Msg, __FILE__, __LINE__ ); \
148 #define CV_ERROR_FROM_CODE( code ) \
149 CV_ERROR( code, "" )
  /external/llvm/lib/Bitcode/Writer/
BitcodeWriter.cpp 141 static void WriteStringRecord(unsigned Code, StringRef Str,
145 // Code: [strchar x N]
153 Stream.EmitRecord(Code, Vals, AbbrevToUse);
257 unsigned Code = 0;
261 case Type::VoidTyID: Code = bitc::TYPE_CODE_VOID; break;
262 case Type::FloatTyID: Code = bitc::TYPE_CODE_FLOAT; break;
263 case Type::DoubleTyID: Code = bitc::TYPE_CODE_DOUBLE; break;
264 case Type::X86_FP80TyID: Code = bitc::TYPE_CODE_X86_FP80; break;
265 case Type::FP128TyID: Code = bitc::TYPE_CODE_FP128; break;
266 case Type::PPC_FP128TyID: Code = bitc::TYPE_CODE_PPC_FP128; break
    [all...]
  /external/llvm/lib/MC/
MCPureStreamer.cpp 201 SmallString<256> Code;
202 raw_svector_ostream VecOS(Code);
206 IF->getCode() = Code;
214 SmallString<256> Code;
215 raw_svector_ostream VecOS(Code);
224 DF->getContents().append(Code.begin(), Code.end());
  /frameworks/compile/slang/BitWriter_2_9/
BitcodeWriter.cpp 113 static void WriteStringRecord(unsigned Code, StringRef Str,
117 // Code: [strchar x N]
125 Stream.EmitRecord(Code, Vals, AbbrevToUse);
312 unsigned Code = 0;
316 case Type::VoidTyID: Code = bitc::TYPE_CODE_VOID; break;
317 case Type::FloatTyID: Code = bitc::TYPE_CODE_FLOAT; break;
318 case Type::DoubleTyID: Code = bitc::TYPE_CODE_DOUBLE; break;
319 case Type::X86_FP80TyID: Code = bitc::TYPE_CODE_X86_FP80; break;
320 case Type::FP128TyID: Code = bitc::TYPE_CODE_FP128; break;
321 case Type::PPC_FP128TyID: Code = bitc::TYPE_CODE_PPC_FP128; break
    [all...]
  /external/bison/src/
system.h 88 # define IF_LINT(Code) Code
90 # define IF_LINT(Code) /* empty */
  /external/giflib/
gif_hash.h 38 #define HT_MAX_KEY 8191 /* 13bits - 1, maximal code possible */
39 #define HT_MAX_CODE 4095 /* Biggest code possible in 12 bits. */
41 /* The 32 bits of the long are divided into two parts for the key & code: */
42 /* 1. The code is 12 bits as our compression algorithm is limited to 12bits */
43 /* 2. The key is 12 bits Prefix code + 8 bit new char or 20 bits. */
44 /* The key is the upper 20 bits. The code is the lower 12. */
56 void _InsertHashTable(GifHashTableType *HashTable, UINT32 Key, int Code);
  /external/llvm/include/llvm/MC/
MCWin64EH.h 1 //===- MCWin64EH.h - Machine Code Win64 EH support --------------*- C++ -*-===//
51 MCWin64EHInstruction(OpType Op, MCSymbol *L, bool Code)
52 : Operation(Op), Label(L), Offset(Code ? 1 : 0) {
  /external/llvm/lib/DebugInfo/
DWARFAbbreviationDeclaration.cpp 24 uint32_t code) {
25 Code = code;
27 if (Code) {
  /external/valgrind/main/coregrind/m_initimg/
simple_huffman.c 14 * - Maximum tree depth of 32 (the coder aborts if any code exceeds a
73 UInt Code;
191 sym[k].Code = 0;
225 UInt code, UInt bits, UInt first,
237 /* Store code info in symbol array */
238 sym[first].Code = code;
272 _Huffman_MakeTree( sym, stream, (code<<1)+0, bits+1,
294 _Huffman_MakeTree( sym, stream, (code<<1)+1, bits+1,
310 huff_bitstream_t *stream, UInt code, UInt bits
455 UInt bits, delta_bits, new_bits, code; local
    [all...]
  /external/clang/lib/Serialization/
ASTWriterDecl.cpp 40 serialization::DeclCode Code;
191 Code = serialization::DECL_TYPEDEF;
197 Code = serialization::DECL_TYPEALIAS;
243 Code = serialization::DECL_ENUM;
265 Code = serialization::DECL_RECORD;
280 Code = serialization::DECL_ENUM_CONSTANT;
386 Code = serialization::DECL_FUNCTION;
433 Code = serialization::DECL_OBJC_METHOD;
440 // Abstract class (no need to define a stable serialization::DECL code).
478 Code = serialization::DECL_OBJC_INTERFACE
    [all...]
  /external/llvm/include/llvm/Bitcode/
BitstreamReader.h 135 // CurCodeSize - This is the declared size of code values used for the current
361 /// ReadSubBlockID - Having read the ENTER_SUBBLOCK code, read the BlockID for
372 // don't care what code widths are used inside of it.
485 unsigned Code = ReadVBR(6);
489 return Code;
541 unsigned Code = (unsigned)Vals[0];
543 return Code;
589 unsigned Code = ReadCode();
590 if (Code == bitc::END_BLOCK)
592 if (Code == bitc::ENTER_SUBBLOCK)
    [all...]

Completed in 1542 milliseconds

12 3 4 5 6 7 8 91011