| /external/llvm/tools/llvm-bcanalyzer/ |
| llvm-bcanalyzer.cpp | 57 cl::desc("Do not print per-code histogram"));
115 /// GetCodeName - Return a symbolic code name if known, otherwise return
304 /// CodeFreq - Keep track of the number of times we see each code.
418 unsigned Code = Stream.readRecord(Entry.ID, Record, &Blob);
420 // Increment the # occurrences of this code.
421 if (BlockStats.CodeFreq.size() <= Code)
422 BlockStats.CodeFreq.resize(Code+1);
423 BlockStats.CodeFreq[Code].NumInstances++;
424 BlockStats.CodeFreq[Code].TotalBits +=
427 BlockStats.CodeFreq[Code].NumAbbrev++
[all...] |
| /external/v8/src/ |
| debug.h | 6 // * Redistributions of source code must retain the above copyright
109 return static_cast<int>(pc() - debug_info_->code()->entry());
115 inline Code* code() { return debug_info_->code(); } function in class:v8::internal::BreakLocationIterator
219 // setting break points in the code.
264 // Check whether a code stub with the specified major key is a possible break
266 static bool IsSourceBreakStub(Code* code);
267 static bool IsBreakStub(Code* code)
[all...] |
| runtime-profiler.cc | 6 // * Redistributions of source code must retain the above copyright
33 #include "code-stubs.h"
75 // Maximum size in bytes of generated code for a function to be optimized
118 function->shared()->code()->type_feedback_info();
161 // If the code is not optimizable, don't try OSR.
162 if (!shared->code()->optimizable()) return;
165 // allocated arguments object. The optimized code would bypass it for
169 // We're using on-stack replacement: patch the unoptimized code so that
178 // Get the stack check stub code object to match against. We aren't
181 Code* stack_check_code = NULL
[all...] |
| /external/chromium_org/tools/json_schema_compiler/ |
| cpp_type_generator.py | 2 # Use of this source code is governed by a BSD-style license that can be
5 from code import Code
30 format extensions::api::sub. The generator will generate code suitable for
47 return Code().Append('namespace %s {' %
53 return Code().Append('} // %s' %
146 c = Code()
165 c = Code()
251 """Generates the Code to display all value-containing properties.
253 c = Code()
[all...] |
| /external/chromium_org/v8/src/ |
| compiler.cc | 6 // * Redistributions of source code must retain the above copyright
148 void CompilationInfo::CommitDependencies(Handle<Code> code) {
158 dependent_code->UpdateToFinishedCode(group, this, *code);
197 Code::Flags CompilationInfo::flags() const {
199 return Code::ComputeFlags(code_stub()->GetCodeKind(),
205 return Code::ComputeFlags(Code::OPTIMIZED_FUNCTION);
236 Handle<Code> code(shared_info()->code())
580 Code* code = it.frame()->LookupCode(); local
827 Handle<Code> code = info->code(); local
869 Handle<Code> code = info->code(); local
886 Handle<Code> code = info->code(); local
959 Handle<Code> code = info->code(); local
1089 Handle<Code> code = info->code(); local
1140 Handle<Code> code = isolate->builtins()->LazyCompile(); local
1215 Handle<Code> code = info->code(); local
[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.
673 TYPE_CHECKER(Code, CODE_TYPE)
4790 Code* SharedFunctionInfo::code() { function in class:v8::internal::SharedFunctionInfo
4897 Code* code = this->code(); local
4960 Code* JSFunction::code() { function in class:v8::internal::JSFunction
[all...] |
| objects-visiting-inl.h | 6 // * Redistributions of source code must retain the above copyright
252 Code* code = Code::cast(Code::GetObjectFromEntryAddress(entry_address)); local
253 heap->mark_compact_collector()->RecordCodeEntrySlot(entry_address, code);
254 StaticVisitor::MarkObject(heap, code);
265 rinfo->host()->kind() != Code::OPTIMIZED_FUNCTION ||
289 Code* target = Code::GetCodeFromTargetAddress(rinfo->call_address())
395 Code* code = Code::cast(object); local
[all...] |
| /external/chromium_org/v8/test/cctest/ |
| test-hashing.cc | 6 // * Redistributions of source code must retain the above copyright
35 #include "code-stubs.h"
166 Handle<Code> code = factory->NewCode(desc, local
167 Code::ComputeFlags(Code::STUB),
169 CHECK(code->IsCode());
171 HASH_FUNCTION hash = FUNCTION_CAST<HASH_FUNCTION>(code->entry());
203 Handle<Code> code = factory->NewCode(desc local
[all...] |
| test-assembler-x64.cc | 6 // * Redistributions of source code must retain the above copyright
39 using v8::internal::Code;
427 Code* code = Code::cast(isolate->heap()->CreateCode( local
429 Code::ComputeFlags(Code::STUB),
430 v8::internal::Handle<Code>())->ToObjectChecked());
431 CHECK(code->IsCode());
433 F0 f = FUNCTION_CAST<F0>(code->entry())
480 Code* code = Code::cast(isolate->heap()->CreateCode( local
[all...] |
| /external/clang/unittests/ASTMatchers/Dynamic/ |
| ParserTest.cpp | 71 void parse(StringRef Code) {
74 Parser::parseExpression(Code, this, &Value, &Error);
212 std::string ParseWithError(StringRef Code) {
215 Parser::parseExpression(Code, &Value, &Error);
219 std::string ParseMatcherWithError(StringRef Code) {
221 Parser::parseMatcherExpression(Code, &Error);
233 "1:4: Error parsing matcher. Found end-of-code while looking for ')'.",
235 EXPECT_EQ("1:1: End of code found while looking for token.",
242 EXPECT_EQ("1:7: Expected end of code.", ParseWithError("expr()a"));
|
| RegistryTest.cpp | 109 std::string code = "int i;"; local
110 EXPECT_FALSE(matches(code, HasInitializerSimple));
111 EXPECT_FALSE(matches(code, HasInitializerComplex));
113 code = "int i = 1;";
114 EXPECT_TRUE(matches(code, HasInitializerSimple));
115 EXPECT_FALSE(matches(code, HasInitializerComplex));
117 code = "int y(); int i = y();";
118 EXPECT_TRUE(matches(code, HasInitializerSimple));
119 EXPECT_TRUE(matches(code, HasInitializerComplex));
142 std::string Code = "class Y { public: void x(); }; void z() { Y y; y.x(); }"
[all...] |
| /external/llvm/lib/Bitcode/Reader/ |
| BitstreamReader.cpp | 139 unsigned Code = ReadVBR(6);
140 (void)Code;
198 unsigned Code = ReadVBR(6);
202 return Code;
207 // Read the record code first.
208 assert(Abbv->getNumOperandInfos() != 0 && "no record code in abbreviation?");
214 unsigned Code = (unsigned)Vals.pop_back_val();
276 return Code;
|
| /external/bison/src/ |
| system.h | 70 /* Use PACIFY_CC to indicate that Code is unimportant to the logic of Bison
72 Code might be a variable initializer that's always overwritten before the
76 Code. It is tempting to redefine PACIFY_CC so that it will suppress Code
80 suppressing Code is unlikely to offer any significant improvement in
82 # define PACIFY_CC(Code) Code
|
| /external/dexmaker/src/test/java/com/google/dexmaker/examples/ |
| HelloWorldMaker.java | 20 import com.google.dexmaker.Code;
45 // Execute our newly-generated code in-process.
68 // Declare that method on the dexMaker. Use the returned Code instance
70 Code code = dexMaker.declare(hello, Modifier.STATIC | Modifier.PUBLIC); local
73 Local<Integer> a = code.newLocal(TypeId.INT);
74 Local<Integer> b = code.newLocal(TypeId.INT);
75 Local<Integer> c = code.newLocal(TypeId.INT);
76 Local<String> s = code.newLocal(TypeId.STRING);
77 Local<PrintStream> localSystemOut = code.newLocal(printStreamType)
[all...] |
| /external/libmtp/src/ |
| ptp.c | 118 * filled in (i.e. operation code and parameters). It's up to caller to do
132 * Return values: Some PTP_RC_* code.
192 if ((ptp->Code == PTP_OC_OpenSession) && tries--)
202 return ptp->Code;
404 * Return values: Some PTP_RC_* code.
417 ptp.Code=PTP_OC_GetDeviceInfo;
439 ptp.Code=PTP_OC_CANON_EOS_GetDeviceInfoEx;
453 * code PTP OP Code
459 * Return values: Some PTP_RC_* code
[all...] |
| /external/lzma/CPP/7zip/Compress/ |
| Bcj2Coder.h | 56 STDMETHOD(Code)(ISequentialInStream **inStreams, const UInt64 **inSizes, UInt32 numInStreams,
104 STDMETHOD(Code)(ISequentialInStream **inStreams, const UInt64 **inSizes, UInt32 numInStreams,
|
| /external/smack/src/org/xbill/DNS/ |
| ClientSubnetOption.java | 21 * An option code has not been assigned by IANA; the value 20730 (used here) is
45 super(EDNSOption.Code.CLIENT_SUBNET);
71 super(EDNSOption.Code.CLIENT_SUBNET);
|
| /external/smali/dexlib/src/main/java/org/jf/dexlib/Code/Format/ |
| Instruction35mi.java | 9 * * Redistributions of source code must retain the above copyright
32 package org.jf.dexlib.Code.Format;
34 import org.jf.dexlib.Code.*;
|
| /external/chromium_org/v8/src/ia32/ |
| stub-cache-ia32.cc | 6 // * Redistributions of source code must retain the above copyright
44 Code::Flags flags,
57 // Multiply by 3 because there are 3 fields per entry (name, code, map).
61 // Get the code entry from the cache.
74 __ mov(offset, FieldOperand(extra, Code::kFlagsOffset));
75 __ and_(offset, ~Code::kFlagsNotUsedInLookup);
87 // Jump to the first instruction in the code stub.
88 __ add(extra, Immediate(Code::kHeaderSize - kHeapObjectTag));
108 // Get the code entry from the cache.
112 __ mov(offset, FieldOperand(offset, Code::kFlagsOffset))
1598 Handle<Code> code = local
2264 Register code = ebx; local
2727 Handle<Code> code = CompileCustomCall(object, holder, local
2820 Handle<Code> code = CompileCustomCall( local
[all...] |
| /external/chromium_org/v8/src/arm/ |
| deoptimizer-arm.cc | 6 // * Redistributions of source code must retain the above copyright
47 void Deoptimizer::PatchCodeForDeoptimization(Isolate* isolate, Code* code) {
48 Address code_start_address = code->instruction_start();
50 // code patching below, and is not needed any more.
51 code->InvalidateRelocation();
56 DeoptimizationInputData::cast(code->deoptimization_data());
64 // We need calls to have a predictable size in the unoptimized code, but
65 // this is optimized code, so we don't have to have a predictable size.
76 ASSERT(call_address + patch_size() <= code->instruction_end())
[all...] |
| stub-cache-arm.cc | 6 // * Redistributions of source code must retain the above copyright
44 Code::Flags flags,
73 // Multiply by 3 because there are 3 fields per entry (name, code, map).
91 // Get the code entry from the cache.
92 Register code = scratch2; local
94 __ ldr(code, MemOperand(base_addr, value_off_addr - key_off_addr));
99 __ ldr(flags_reg, FieldMemOperand(code, Code::kFlagsOffset));
102 uint32_t mask = Code::kFlagsNotUsedInLookup;
116 // Jump to the first instruction in the code stub
1618 Handle<Code> code = local
2252 Register code = r1; local
2669 Handle<Code> code = CompileCustomCall(object, holder, local
2737 Handle<Code> code = CompileCustomCall( local
[all...] |
| /external/chromium_org/v8/src/mips/ |
| deoptimizer-mips.cc | 7 // * Redistributions of source code must retain the above copyright
46 void Deoptimizer::PatchCodeForDeoptimization(Isolate* isolate, Code* code) {
47 Address code_start_address = code->instruction_start();
49 // code patching below, and is not needed any more.
50 code->InvalidateRelocation();
55 DeoptimizationInputData::cast(code->deoptimization_data());
72 ASSERT(call_address + patch_size() <= code->instruction_end());
82 // The back edge bookkeeping code matches the pattern:
92 // We patch the code to the following form
[all...] |
| stub-cache-mips.cc | 6 // * Redistributions of source code must retain the above copyright
44 Code::Flags flags,
73 // Multiply by 3 because there are 3 fields per entry (name, code, map).
91 // Get the code entry from the cache.
92 Register code = scratch2; local
94 __ lw(code, MemOperand(base_addr, value_off_addr - key_off_addr));
99 __ lw(flags_reg, FieldMemOperand(code, Code::kFlagsOffset));
100 __ And(flags_reg, flags_reg, Operand(~Code::kFlagsNotUsedInLookup));
111 // Jump to the first instruction in the code stub
1634 Handle<Code> code = local
2268 Register code = a1; local
2708 Handle<Code> code = CompileCustomCall(object, holder, local
2779 Handle<Code> code = CompileCustomCall( local
[all...] |
| /external/chromium_org/v8/src/x64/ |
| deoptimizer-x64.cc | 6 // * Redistributions of source code must retain the above copyright
49 void Deoptimizer::PatchCodeForDeoptimization(Isolate* isolate, Code* code) {
51 // code patching below, and is not needed any more.
52 code->InvalidateRelocation();
57 // before the safepoint table (space was allocated there when the Code
60 Address instruction_start = code->instruction_start();
65 DeoptimizationInputData::cast(code->deoptimization_data());
77 ASSERT(call_address + patch_size() <= code->instruction_end());
91 // The back edge bookkeeping code matches the pattern
[all...] |
| /external/v8/test/cctest/ |
| test-assembler-mips.cc | 6 // * Redistributions of source code must retain the above copyright
76 Object* code = HEAP->CreateCode( local
78 Code::ComputeFlags(Code::STUB),
80 CHECK(code->IsCode());
81 F2 f = FUNCTION_CAST<F2>(Code::cast(code)->entry());
114 Object* code = HEAP->CreateCode( local
116 Code::ComputeFlags(Code::STUB)
254 Object* code = HEAP->CreateCode( local
320 Object* code = HEAP->CreateCode( local
386 Object* code = HEAP->CreateCode( local
455 Object* code = HEAP->CreateCode( local
528 Object* code = HEAP->CreateCode( local
607 Object* code = HEAP->CreateCode( local
706 Object* code = HEAP->CreateCode( local
753 Object* code = HEAP->CreateCode( local
814 Object* code = HEAP->CreateCode( local
946 Object* code = HEAP->CreateCode( local
1050 Object* code = HEAP->CreateCode( local
1109 Object* code = HEAP->CreateCode( local
1233 Object* code = HEAP->CreateCode( local
[all...] |
