| /external/llvm/lib/TableGen/ |
| TGLexer.h | 45 Bit, Bits, Class, Code, Dag, Def, Defm, Field, In, Int, Let, List,
107 /// LexToken - Read the next token and return its code.
|
| /external/v8/src/arm/ |
| lithium-codegen-arm.h | 6 // * Redistributions of source code must retain the above copyright
93 // Try to generate code for the entire chunk, but it may fail if the
95 // code generation attempt succeeded.
98 // Finish the code by setting stack height, safepoint, and bailout
100 void FinishCode(Handle<Code> code);
102 // Deferred code support.
167 void AddDeferredCode(LDeferredCode* code) { deferred_.Add(code); }
169 // Code generation passes. Returns true if code generation shoul
[all...] |
| stub-cache-arm.cc | 6 // * Redistributions of source code must retain the above copyright
44 Code::Flags flags,
70 // Get the code entry from the cache.
76 __ ldr(scratch2, FieldMemOperand(scratch2, Code::kFlagsOffset));
77 __ bic(scratch2, scratch2, Operand(Code::kFlagsNotUsedInLookup));
81 // Re-load code entry from cache.
84 // Jump to the first instruction in the code stub.
85 __ add(offset, offset, Operand(Code::kHeaderSize - kHeapObjectTag));
208 Code::Flags flags,
217 // Make sure that code is valid. The shifting code relies on th
513 Code* code = NULL; local
2003 Register code = r1; local
3424 Handle<Code> code = masm()->isolate()->builtins()->JSConstructStubGeneric(); local
[all...] |
| /external/v8/src/ia32/ |
| lithium-codegen-ia32.h | 6 // * Redistributions of source code must retain the above copyright
86 // Try to generate code for the entire chunk, but it may fail if the
88 // code generation attempt succeeded.
91 // Finish the code by setting stack height, safepoint, and bailout
93 void FinishCode(Handle<Code> code);
95 // Deferred code support.
156 void AddDeferredCode(LDeferredCode* code) { deferred_.Add(code); }
158 // Code generation passes. Returns true if code generation shoul
[all...] |
| stub-cache-ia32.cc | 6 // * Redistributions of source code must retain the above copyright
44 Code::Flags flags,
55 // Get the code entry from the cache.
63 __ mov(offset, FieldOperand(extra, Code::kFlagsOffset));
64 __ and_(offset, ~Code::kFlagsNotUsedInLookup);
68 // Jump to the first instruction in the code stub.
69 __ add(Operand(extra), Immediate(Code::kHeaderSize - kHeapObjectTag));
81 // Get the code entry from the cache.
85 __ mov(offset, FieldOperand(offset, Code::kFlagsOffset));
86 __ and_(offset, ~Code::kFlagsNotUsedInLookup)
749 Code* code = NULL; local
1877 Register code = ebx; local
[all...] |
| /external/v8/src/ |
| liveedit.h | 6 // * Redistributions of source code must retain the above copyright
40 // A single change always has a form of a simple replacement (in pseudo-code):
45 // expectations (or number of parameters). If it didn't, function's code is
46 // patched with a newly compiled code. If it did change, enclosing function
48 // to them in a new script version. However, new version of code will
63 // in order to analyze whether function code maybe safely patched (with new
64 // code successfully reading existing data from function scopes). The Tracker
72 void RecordRootFunctionInfo(Handle<Code> code);
111 // In a code of a parent function replaces original function as embedde
[all...] |
| compiler.cc | 6 // * Redistributions of source code must retain the above copyright
117 // Determine whether to use the full compiler for all code. If the flag
120 // the code from the full compiler supports mode precise break points. For the
121 // crankshaft adaptive compiler debugging the optimized code is not possible at
167 // code as non-optimizable. The marker on the shared function info
168 // is there because we flush non-optimized code thereby loosing the
169 // non-optimizable information for the code. When the code is
175 Handle<Code> code = Handle<Code>(shared->code()) local
376 Code* code = it.frame()->LookupCode(); local
621 Handle<Code> code = info->code(); local
708 Handle<Code> code = info.isolate()->builtins()->LazyCompile(); local
773 Handle<Code> code = info->code(); local
[all...] |
| compiler.h | 6 // * Redistributions of source code must retain the above copyright
59 Handle<Code> code() const { return code_; } function in class:v8::internal::BASE_EMBEDDED
100 void SetCode(Handle<Code> code) { code_ = code; }
152 // OPTIMIZE is optimized code generated by the Hydrogen-based backend.
202 // The compiled code.
203 Handle<Code> code_;
214 // The context of the caller is needed for eval code, and will be a nul
[all...] |
| debug.h | 6 // * Redistributions of source code must retain the above copyright
107 return static_cast<int>(pc() - debug_info_->code()->entry());
113 inline Code* code() { return debug_info_->code(); } function in class:v8::internal::BreakLocationIterator
215 // setting break points in the code.
257 // Check whether a code stub with the specified major key is a possible break
259 static bool IsSourceBreakStub(Code* code);
260 static bool IsBreakStub(Code* code)
[all...] |
| builtins.cc | 6 // * Redistributions of source code must retain the above copyright
149 // code below.
164 // changes this code has to be changed as well.
1624 Object* code = NULL; local
[all...] |
| mark-compact.cc | 6 // * Redistributions of source code must retain the above copyright
250 Code* lazy_compile = isolate_->builtins()->builtin(Builtins::kLazyCompile);
259 Code* code = shared->unchecked_code(); local
260 if (!code->IsMarked()) {
275 Code* lazy_compile = isolate_->builtins()->builtin(Builtins::kLazyCompile);
283 Code* code = candidate->unchecked_code(); local
284 if (!code->IsMarked()) {
308 STATIC_ASSERT(kPointerSize <= Code::kHeaderSize - Code::kHeaderPaddingStart)
312 Code* code = candidate->unchecked_code(); local
461 Code* code = Code::GetCodeFromTargetAddress(rinfo->target_address()); local
486 HeapObject* code = Code::GetCodeFromTargetAddress(rinfo->call_address()); local
732 Object* code = Code::GetObjectFromEntryAddress(entry_address); local
[all...] |
| deoptimizer.cc | 6 // * Redistributions of source code must retain the above copyright
191 RemoveDeoptimizingCode(*node->code());
237 // Find the optimized code.
240 optimized_code_ = function_->code();
247 // function. The return address (from) points to unoptimized code.
248 optimized_code_ = function_->code();
249 ASSERT(optimized_code_->kind() == Code::OPTIMIZED_FUNCTION);
331 // Print the source code if available.
776 // Optimized code assumes that the argument object has not been
790 void Deoptimizer::PatchStackCheckCode(Code* unoptimized_code
[all...] |
| cpu-profiler.cc | 6 // * Redistributions of source code must retain the above copyright
265 // proceed to the next code event.
273 // Perform processing until we have tick events, skip remaining code events.
365 Code* code, const char* comment) {
367 tag, comment, code->address(), code->ExecutableSize());
372 Code* code, String* name) {
379 code->address()
[all...] |
| /external/v8/src/x64/ |
| lithium-codegen-x64.h | 6 // * Redistributions of source code must retain the above copyright
84 // Try to generate code for the entire chunk, but it may fail if the
86 // code generation attempt succeeded.
89 // Finish the code by setting stack height, safepoint, and bailout
91 void FinishCode(Handle<Code> code);
93 // Deferred code support.
150 void AddDeferredCode(LDeferredCode* code) { deferred_.Add(code); }
152 // Code generation passes. Returns true if code generation shoul
[all...] |
| regexp-macro-assembler-x64.h | 6 // * Redistributions of source code must retain the above copyright
103 static Result Match(Handle<Code> regexp,
110 static Result Execute(Code* code,
119 // If the code object is relocated, the return address is fixed before
122 Code* re_code,
184 // Initial size of code buffer.
210 // The registers containing a self pointer to this code's Code object.
226 // Call and return internally in the generated code in a way tha
[all...] |
| deoptimizer-x64.cc | 6 // * Redistributions of source code must retain the above copyright
50 // Overwrites code with int3 instructions.
66 explicit SafepointTableDeoptimiztionEntryIterator(Code* code)
67 : code_(code), table_(code), index_(-1), limit_(table_.length()) {
93 Code* code_;
104 void Deoptimizer::EnsureRelocSpaceForLazyDeoptimization(Handle<Code> code) {
115 // Get the optimized code
[all...] |
| stub-cache-x64.cc | 6 // * Redistributions of source code must retain the above copyright
44 Code::Flags flags,
62 // Get the code entry from the cache.
67 __ movl(offset, FieldOperand(kScratchRegister, Code::kFlagsOffset));
68 __ and_(offset, Immediate(~Code::kFlagsNotUsedInLookup));
72 // Jump to the first instruction in the code stub.
73 __ addq(kScratchRegister, Immediate(Code::kHeaderSize - kHeapObjectTag));
182 Code::Flags flags,
192 // Make sure that code is valid. The shifting code relies on th
738 Code* code = NULL; local
1839 Register code = rbx; local
3153 Code* code = local
[all...] |
| ic-x64.cc | 6 // * Redistributions of source code must retain the above copyright
61 // Generated code falls through if the receiver is a regular non-global
158 // The generated code assumes that the receiver has slow properties,
213 // is in the dictionary, so code at miss_label must always call a
216 // that case. The generated code assumes that the receiver has slow
311 // Compute the hash code from the untagged key. This must be kept in sync
399 StubCompiler::GenerateLoadMiss(masm, Code::LOAD_IC);
414 StubCompiler::GenerateLoadMiss(masm, Code::LOAD_IC);
428 StubCompiler::GenerateLoadMiss(masm, Code::LOAD_IC);
869 // The generated code does not accept smi keys
[all...] |
| /dalvik/dx/src/com/android/dx/gen/ |
| DexGenerator.java | 21 import com.android.dx.dex.code.DalvCode;
22 import com.android.dx.dex.code.PositionList;
23 import com.android.dx.dex.code.RopTranslator;
28 import com.android.dx.rop.code.AccessFlags;
29 import static com.android.dx.rop.code.AccessFlags.*;
30 import com.android.dx.rop.code.LocalVariableInfo;
31 import com.android.dx.rop.code.RopMethod;
61 * @param flags any flags masked by {@link com.android.dx.rop.code.AccessFlags#CLASS_FLAGS}.
77 * @param flags any flags masked by {@link com.android.dx.rop.code.AccessFlags#METHOD_FLAGS}.
79 public Code declare(MethodId<?, ?> method, int flags)
235 private final Code code; field in class:DexGenerator.MethodDeclaration
[all...] |
| /external/elfutils/libelf/ |
| gelf_xlate.c | 114 #define TYPE_EXTRA(Code)
115 #define TYPE_XLATE(Code) Code
|
| /external/v8/tools/ |
| profile.js | 6 // * Redistributions of source code must retain the above copyright
55 * code entries.
67 * Enum for code state regarding its dynamic optimization.
85 * @param {number} addr Address of the unknown code.
98 * @param {string} name Code entry name.
112 * Registers statically compiled code entry.
114 * @param {string} name Code entry name.
128 * Registers dynamic (JIT-compiled) code entry.
130 * @param {string} type Code entry type.
131 * @param {string} name Code entry name
[all...] |
| codemap.js | 6 // * Redistributions of source code must retain the above copyright
30 * Constructs a mapper that maps addresses into code entries.
36 * Dynamic code entries. Used for JIT compiled code.
46 * Static code entries. Used for statically compiled code.
51 * Libraries entries. Used for the whole static code libraries.
56 * Map of memory pages occupied with static code.
76 * Adds a dynamic (i.e. moveable and discardable) code entry.
79 * @param {CodeMap.CodeEntry} codeEntry Code entry object
[all...] |
| /external/clang/lib/Serialization/ |
| ASTWriter.cpp | 77 /// \brief Type code that corresponds to the record generated.
78 TypeCode Code;
81 : Writer(Writer), Record(Record), Code(TYPE_EXT_QUAL) { }
99 Code = TYPE_COMPLEX;
104 Code = TYPE_POINTER;
109 Code = TYPE_BLOCK_POINTER;
115 Code = TYPE_LVALUE_REFERENCE;
120 Code = TYPE_RVALUE_REFERENCE;
126 Code = TYPE_MEMBER_POINTER;
138 Code = TYPE_CONSTANT_ARRAY
[all...] |
| ASTReader.cpp | 743 unsigned Code = Cursor.ReadCode();
744 unsigned RecCode = Cursor.ReadRecord(Code, Record, &Blob, &BlobLen);
761 unsigned Code = Cursor.ReadCode();
762 unsigned RecCode = Cursor.ReadRecord(Code, Record, &Blob, &BlobLen);
[all...] |
| /external/clang/include/clang/Basic/ |
| Diagnostic.h | 38 /// \brief Annotates a diagnostic with some code that should be
43 /// amount of code will correct a compilation error. The compiler
49 /// \brief Code that should be replaced to correct the error. Empty for an
53 /// \brief The actual code to insert at the insertion location, as a
57 /// \brief Empty code modification hint, indicating that no code
65 /// \brief Create a code modification hint that inserts the given
66 /// code string at a specific location.
68 StringRef Code) {
72 Hint.CodeToInsert = Code;
[all...] |
