| /art/runtime/verifier/ |
| method_verifier.cc | 138 // http://code.google.com/p/smali/issues/detail?id=119
180 // http://code.google.com/p/smali/issues/detail?id=119
328 CHECK(code_item_ != NULL); // This only makes sense for methods with code.
347 CHECK(code_item_ != NULL); // This only makes sense for methods with code.
375 CHECK(code_item_ != NULL); // This only makes sense for methods with code.
398 Fail(VERIFY_ERROR_BAD_CLASS_HARD) << "zero-length code in concrete non-native method";
418 // Perform code-flow analysis and return.
437 // affect the soundness of the code being compiled. Instead, the generated code runs "slow
497 Instruction::Code opcode = inst->Opcode()
[all...] |
| /external/bison/lib/ |
| vasnprintf.c | 37 char or wchar_t. The code exploits that
199 # define IF_LINT(Code) Code
201 # define IF_LINT(Code) /* empty */
556 Code copied from gnulib's integer_length.c. */
[all...] |
| /external/chromium_org/v8/src/arm/ |
| assembler-arm.cc | 8 // - Redistributions of source code must retain the above copyright notice,
33 // The original source code covered by the above license above has been
92 ASSERT(kScratchDoubleReg.code() - kDoubleRegZero.code() ==
94 if (index >= kDoubleRegZero.code())
110 // minimal set of features which is also alowed for generated code in the
299 // Patch the code at the current address with the supplied instructions.
306 // Indicate that code has changed.
311 // Patch the code at the current PC with a call to the target address.
314 // Patch the code at the current address with a call to the target
[all...] |
| /external/chromium_org/v8/src/x64/ |
| assembler-x64.cc | 6 // * Redistributions of source code must retain the above copyright
164 // Patch the code at the current PC with a call to the target address.
169 // Create a code patcher.
172 // Add a label for checking the size of the code used for returning.
178 // Patch the code.
182 // Check that the size of the code generated is as expected.
194 // Patch the code at the current address with the supplied instructions.
199 // Indicate that code has changed.
320 int code = reg.code(); local
[all...] |
| /external/smali/dexlib/src/main/java/org/jf/dexlib/Code/Analysis/ |
| MethodAnalyzer.java | 9 * 1. Redistributions of source code must retain the above copyright
29 package org.jf.dexlib.Code.Analysis;
32 import org.jf.dexlib.Code.*;
33 import org.jf.dexlib.Code.Format.*;
80 throw new IllegalArgumentException("The method has no code");
538 //instruction and follow the execution path. Any unreachable code won't have any predecessors or successors,
539 //and no reachable code will have an unreachable predessor or successor
601 " instruction at code address 0x" + Integer.toHexString(getInstructionAddress(predecessor)) +
[all...] |
| /external/v8/src/arm/ |
| assembler-arm.cc | 8 // - Redistributions of source code must retain the above copyright notice,
33 // The original source code covered by the above license above has been
68 // If the compiler is allowed to use VFP then we can use VFP too in our code
91 // minimal set of features which is also alowed for generated code in the
143 // Patch the code at the current address with the supplied instructions.
150 // Indicate that code has changed.
155 // Patch the code at the current PC with a call to the target address.
158 // Patch the code at the current address with a call to the target.
169 // Verify all Objects referred by code are NOT in new space.
260 const Instr kBlxIp = al | kBlxRegPattern | ip.code();
[all...] |
| /external/v8/src/x64/ |
| assembler-x64.cc | 6 // * Redistributions of source code must retain the above copyright
156 // Patch the code at the current PC with a call to the target address.
164 // Create a code patcher.
167 // Add a label for checking the size of the code used for returning.
173 // Patch the code.
177 // Check that the size of the code generated is as expected.
189 // Patch the code at the current address with the supplied instructions.
194 // Indicate that code has changed.
314 int code = reg.code(); local
[all...] |
| /prebuilts/sdk/tools/lib/ |
| dx.jar | |
| /external/chromium_org/third_party/openssl/openssl/crypto/bn/asm/ |
| pa-risc2.s | 2 ; PA-RISC 2.0 implementation of bn_asm code, based on the
3 ; 64-bit version of the code. This code is effectively the
10 ; This code is approximately 2x faster than the C version
17 ; Code written by Chris Ruemmler (with some help from the HP C
20 ; The code compiles with HP's assembler
25 .subspa $CODE$,QUAD=0,ALIGN=8,ACCESS=0x2c,CODE_ONLY
152 ; then go straight to the cleanup code.
749 .IMPORT BN_num_bits_word,CODE
751 ;--- not PIC .IMPORT fprintf,CODE
[all...] |
| pa-risc2W.s | 2 ; PA-RISC 64-bit implementation of bn_asm code
4 ; This code is approximately 2x faster than the C version
11 ; Code written by Chris Ruemmler (with some help from the HP C
14 ; The code compiles with HP's assembler
19 .subspa $CODE$,QUAD=0,ALIGN=8,ACCESS=0x2c,CODE_ONLY
144 ; then go straight to the cleanup code.
740 .IMPORT BN_num_bits_word,CODE,NO_RELOCATION
742 .IMPORT fprintf,CODE,NO_RELOCATION
743 .IMPORT abort,CODE,NO_RELOCATION
909 ; Note, that when using b6 and b7, the code must save these befor
[all...] |
| /external/lzma/Java/SevenZip/Compression/LZMA/ |
| Encoder.java | [all...] |
| /external/openssl/crypto/bn/asm/ |
| pa-risc2.s | 2 ; PA-RISC 2.0 implementation of bn_asm code, based on the
3 ; 64-bit version of the code. This code is effectively the
10 ; This code is approximately 2x faster than the C version
17 ; Code written by Chris Ruemmler (with some help from the HP C
20 ; The code compiles with HP's assembler
25 .subspa $CODE$,QUAD=0,ALIGN=8,ACCESS=0x2c,CODE_ONLY
152 ; then go straight to the cleanup code.
749 .IMPORT BN_num_bits_word,CODE
751 ;--- not PIC .IMPORT fprintf,CODE
[all...] |
| pa-risc2W.s | 2 ; PA-RISC 64-bit implementation of bn_asm code
4 ; This code is approximately 2x faster than the C version
11 ; Code written by Chris Ruemmler (with some help from the HP C
14 ; The code compiles with HP's assembler
19 .subspa $CODE$,QUAD=0,ALIGN=8,ACCESS=0x2c,CODE_ONLY
144 ; then go straight to the cleanup code.
740 .IMPORT BN_num_bits_word,CODE,NO_RELOCATION
742 .IMPORT fprintf,CODE,NO_RELOCATION
743 .IMPORT abort,CODE,NO_RELOCATION
909 ; Note, that when using b6 and b7, the code must save these befor
[all...] |
| /external/v8/src/ |
| isolate.cc | 6 // * Redistributions of source code must retain the above copyright
577 int position = frames[i].code()->SourcePosition(frames[i].pc());
587 // For the case where the code is on the same line as the script
903 // TODO(1240995): To avoid having to call JavaScript code to compute
966 // Find code position if recorded in relocation info.
[all...] |
| liveedit-debugger.js | 6 // * Redistributions of source code must retain the above copyright
31 // A LiveEdit namespace. It contains functions that modifies JavaScript code
39 // version of the script) it remains unchanged, but the code that could
140 // Collect shared infos for functions whose code need to be patched.
305 // Replaces function's Code.
313 // The function got a new code. However, this new code brings all new
513 // The code of a function remains unchanged, but something happened inside
516 // The code of a function is changed or some nested function cannot be
541 // in UI, we use 'pure' level for actual code manipulation
[all...] |
| profile-generator.cc | 6 // * Redistributions of source code must retain the above copyright
884 // As actual number of decoded code entries may vary, initialize
892 // Don't use PC when in external callback code, as it can point
893 // inside callback's code, and we will erroneously report
2040 Code* code = Code::cast(obj); local
[all...] |
| /frameworks/base/docs/html/training/ |
| training_toc.cs | [all...] |
| /external/chromium_org/v8/src/ |
| liveedit-debugger.js | 6 // * Redistributions of source code must retain the above copyright
31 // A LiveEdit namespace. It contains functions that modifies JavaScript code
39 // version of the script) it remains unchanged, but the code that could
152 // Collect shared infos for functions whose code need to be patched.
322 // Replaces function's Code.
330 // The function got a new code. However, this new code brings all new
530 // The code of a function remains unchanged, but something happened inside
533 // The code of a function is changed or some nested function cannot be
558 // in UI, we use 'pure' level for actual code manipulation
[all...] |
| hydrogen.cc | 6 // * Redistributions of source code must retain the above copyright
[all...] |
| elements.cc | 6 // * Redistributions of source code must retain the above copyright
38 // common code.
496 Code* apply_builtin = isolate->builtins()->builtin(
[all...] |
| /external/llvm/utils/TableGen/ |
| CodeGenDAGPatterns.cpp | 378 // If we are down to concrete types, this code does not currently
415 // not have been accepted by this code previously.
682 /// Return the name to use in the generated code to reference this, this is
688 /// getCodeToRunOnSDNode - Return the code for the function body that
702 assert(!getPredCode().empty() && "Don't have any predicate code!");
[all...] |
| /external/lzma/CS/7zip/Compress/LZMA/ |
| LzmaEncoder.cs | [all...] |
| /external/llvm/lib/CodeGen/SelectionDAG/ |
| SelectionDAG.cpp | 654 "Cond code doesn't exist!");
[all...] |
| /external/chromium_org/third_party/WebKit/Source/core/html/ |
| HTMLMediaElement.cpp | 7 * 1. Redistributions of source code must retain the above copyright
742 // Some of the code paths below this function dispatch the BeforeLoad event. This ASSERT helps
[all...] |
| /external/dropbear/libtommath/ |
| bn.tex | 75 LibTomMath is a library of source code which provides a series of efficient and carefully written functions for manipulating
76 large integer numbers. It was written in portable ISO C source code so that it will build on any platform with a conforming
80 to implement ``bignum'' math. However, the resulting code has proven to be very useful. It has been used by numerous
85 As of the v0.25 the library source code has been placed in the public domain with every new release. As of the v0.28
247 source code public domain (unlike various other GPL/etc licensed code), not only is the code freely downloadable but the
248 source code is also accessible for computer science students attempting to learn ``BigNum'' or multiple precision
251 LibTomMath was written to be an instructive collection of source code. This is why there are many comments, only one
255 Source code alone cannot really teach how the algorithms work which is why I also wrote a textbook that accomp (…)
[all...] |
