| /external/llvm/include/llvm/CodeGen/ |
| SelectionDAG.h | 61 /// not build SDNodes for these so as not to perturb the generated code;
67 /// parameters separately: they may not have code generated for them, they
68 /// should always go at the beginning of the function regardless of other code
128 /// and code simplifications.
192 /// init - Prepare this SelectionDAG to process code in the given
444 SDValue Rnd, SDValue Sat, ISD::CvtCode Code);
[all...] |
| /external/qemu-pc-bios/vgabios/ |
| vbe.c | 698 ; VBE Init - Initialise the Vesa Bios Extension Code
699 ; This function does a sanity check on the host side display code interface.
1207 * this function must fail with completion code AH=03h
[all...] |
| /external/v8/src/ |
| jsregexp.cc | 6 // * Redistributions of source code must retain the above copyright
70 // Call the construct code with 2 arguments.
295 #else // V8_INTERPRETED_REGEXP (RegExp native code)
358 data->set(JSRegExp::code_index(is_ascii), result.code);
394 Code* RegExpImpl::IrregexpNativeCode(FixedArray* re, bool is_ascii) {
395 return Code::cast(re->get(JSRegExp::code_index(is_ascii)));
403 // Initialize compiled code entries to null.
431 // Byte-code regexp needs space allocated for all its registers.
463 Handle<Code> code(IrregexpNativeCode(*irregexp, is_ascii), isolate)
[all...] |
| jsregexp.h | 6 // * Redistributions of source code must retain the above copyright
176 static Code* IrregexpNativeCode(FixedArray* re, bool is_ascii);
179 // would like to keep track of the amount of regexp code on the heap. This
181 // total regexp code compiled including code that has subsequently been freed
602 // Generates a goto to this node or actually generates the code at this point.
614 // Emits some quick code that checks whether the preloaded characters match.
634 // If non-generic code is generated for a node (ie the node is not at the
637 // trace and generating generic code for a node that can be reused by flushing
703 // This variable keeps track of how many times code has been generated fo
1442 Object* code; member in struct:v8::internal::RegExpEngine::CompilationResult
[all...] |
| parser.cc | 6 // * Redistributions of source code must retain the above copyright
809 // Base class containing common code for the different finder classes used by
1428 Handle<Code> code = Handle<Code>(fun->shared()->code()); local
[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
512 // The code of a function remains unchanged, but something happened inside
515 // The code of a function is changed or some nested function cannot be
540 // in UI, we use 'pure' level for actual code manipulation
[all...] |
| liveobjectlist.cc | 6 // * Redistributions of source code must retain the above copyright
118 v(Code, "meta: Code") \
193 if (strcmp(key_str, "code") == 0) return CODE_SPACE;
[all...] |
| /prebuilt/sdk/tools/lib/ |
| dx.jar | |
| /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
60 // If the compiler is allowed to use VFP then we can use VFP too in our code
128 // Patch the code at the current address with the supplied instructions.
135 // Indicate that code has changed.
140 // Patch the code at the current PC with a call to the target address.
143 // Patch the code at the current address with a call to the target.
154 // Verify all Objects referred by code are NOT in new space.
225 al | PostIndex | 4 | LeaveCC | I | sp.code() * B16 | sp.code() * B12
[all...] |
| code-stubs-arm.cc | 6 // * Redistributions of source code must retain the above copyright
33 #include "code-stubs.h"
119 // Initialize the code pointer in the function to be the one
122 __ add(r3, r3, Operand(Code::kHeaderSize - kHeapObjectTag));
294 return result1_.code() +
295 (result2_.code() << 4) +
296 (source_.code() << 8) +
297 (zeros_.code() << 12);
446 // Generate non VFP3 code to check if a double can be exactly represented by a
467 // Generates code to call a C function to do a double operation using cor
[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/llvm/utils/TableGen/ |
| CodeGenDAGPatterns.cpp | 349 // If we are down to concrete types, this code does not currently
383 // not have been accepted by this code previously.
645 /// Return the name to use in the generated code to reference this, this is
651 /// getCodeToRunOnSDNode - Return the code for the function body that
665 assert(!getPredCode().empty() && "Don't have any predicate code!");
[all...] |
| /frameworks/base/docs/html/resources/ |
| resources-data.js | 7 'library': 'Code Library'
72 en: 'Android offers a very powerful and yet easy-to-use message type called an intent. You can use intents to turn applications into high-level libraries and make code modular and reusable. While it is nice to be able to make use of a loosely coupled API, there is no guarantee that the intent you send will be received by another application. This article describes a technique you can use to find out whether the system contains any application capable of responding to the intent you want to use.'
162 en: 'Learn about using ViewStubs inside an application\'s layout in order to inflate rarely used UI elements, without the performance implications which would otherwise be caused by using the <code><include></code> tag.'
172 en: 'Learn how to use the <code><merge></code> tag in your XML layouts in order to avoid unnecessary levels of hierarchy within an application\'s view tree.'
387 /// SAMPLE CODE ///
407 en: 'Shows how to use the action bar on both pre-API 11 and API 11+ devices, maximizing code re-use.'
497 en: 'An application that demonstrates how to query the system contacts provider using the <code>ContactsContract</code> API, as well as insert contacts into a specific account.
[all...] |
| /external/llvm/lib/CodeGen/SelectionDAG/ |
| SelectionDAG.cpp | 618 "Cond code doesn't exist!");
[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...] |
| /external/clang/lib/Sema/ |
| SemaDecl.cpp | 310 /// @code
[all...] |
| /prebuilt/darwin-x86/swt/ |
| swt.jar | |
| /external/dropbear/libtomcrypt/ |
| crypt.tex | 151 application can support all ciphers/hashes/prngs/bignum without changing the source code.
181 you have to update the associated support code as well. In LibTomCrypt the associated code (\textit{chaining modes in this case})
229 commented upon. When a function does return a CRYPT error code it can be translated into a string with
253 There is no initialization routine for the library and for the most part the code is thread safe. The only thread
351 In the above example if the size of the RSA public key was more than 1024 bytes this function would return an error code
658 the file \textit{tomcrypt\_cfg.h}. The first option is \textit{TWOFISH\_SMALL} which when defined will force the Twofish code
661 defined will force the Twofish code to use pre-computed tables for the two s-boxes $q_0, q_1$ as well as the multiplication
662 by the polynomials 5B and EF used in the MDS multiplication. As a result the code is faster and slightly larger. The
673 \hline undefined & defined & Faster key setup, larger code. \
[all...] |
| /prebuilt/darwin-x86_64/swt/ |
| swt.jar | |
| /prebuilt/linux-x86/swt/ |
| swt.jar | |
| /prebuilt/linux-x86_64/swt/ |
| swt.jar | |
| /prebuilt/windows/swt/ |
| swt.jar | |
| /prebuilt/windows-x86_64/swt/ |
| swt.jar | |
