| /prebuilts/gdb/linux-x86/lib/python2.7/compiler/ |
| transformer.py | 6 The simplest ways to invoke this module are via parse and parseFile.
12 # and Bill Tutt (rassilon@lima.mudlib.org)
15 # Modifications and improvements for Python 2.0 by Jeremy Hylton and
19 # (except Module, Discard and Stmt) added by Sylvain Thenault
26 # and replace OWNER, ORGANIZATION, and YEAR as appropriate.
187 if node[0] != token.ENDMARKER and node[0] != token.NEWLINE:
198 assert listlen >= 1 and listlen % 2 == 1
587 if len(nodelist) == 2 and nodelist[1][0] == symbol.comp_for
[all...] |
| /prebuilts/gdb/linux-x86/lib/python2.7/test/ |
| test_xml_etree.py | 6 # order to ensure consistency between the C implementation and the
401 a warning in 1.3, and the behaviour will be modified in 1.4.
[all...] |
| /prebuilts/python/darwin-x86/2.7.5/lib/python2.7/compiler/ |
| transformer.py | 6 The simplest ways to invoke this module are via parse and parseFile.
12 # and Bill Tutt (rassilon@lima.mudlib.org)
15 # Modifications and improvements for Python 2.0 by Jeremy Hylton and
19 # (except Module, Discard and Stmt) added by Sylvain Thenault
26 # and replace OWNER, ORGANIZATION, and YEAR as appropriate.
187 if node[0] != token.ENDMARKER and node[0] != token.NEWLINE:
198 assert listlen >= 1 and listlen % 2 == 1
587 if len(nodelist) == 2 and nodelist[1][0] == symbol.comp_for
[all...] |
| /prebuilts/python/darwin-x86/2.7.5/lib/python2.7/test/ |
| test_xml_etree.py | 6 # order to ensure consistency between the C implementation and the
401 a warning in 1.3, and the behaviour will be modified in 1.4.
[all...] |
| /prebuilts/python/linux-x86/2.7.5/lib/python2.7/compiler/ |
| transformer.py | 6 The simplest ways to invoke this module are via parse and parseFile.
12 # and Bill Tutt (rassilon@lima.mudlib.org)
15 # Modifications and improvements for Python 2.0 by Jeremy Hylton and
19 # (except Module, Discard and Stmt) added by Sylvain Thenault
26 # and replace OWNER, ORGANIZATION, and YEAR as appropriate.
187 if node[0] != token.ENDMARKER and node[0] != token.NEWLINE:
198 assert listlen >= 1 and listlen % 2 == 1
587 if len(nodelist) == 2 and nodelist[1][0] == symbol.comp_for
[all...] |
| /prebuilts/python/linux-x86/2.7.5/lib/python2.7/test/ |
| test_xml_etree.py | 6 # order to ensure consistency between the C implementation and the
401 a warning in 1.3, and the behaviour will be modified in 1.4.
[all...] |
| /external/curl/packages/vms/ |
| config_h.com | 11 $! The CONFIGURE shell script will be examined for hints and a few symbols
13 $! will produce false positives and some will produce false negatives.
15 $! It is easier to just read the config.h_in file and make up tests based
26 $! and others.
29 $! and is a work in progress.
33 $! Permission to use, copy, modify, and/or distribute this software for any
35 $! copyright notice and this permission notice appear in all copies.
37 $! THE SOFTWARE IS PROVIDED "AS IS" AND THE AUTHOR DISCLAIMS ALL WARRANTIES
39 $! MERCHANTABILITY AND FITNESS. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR
49 $! 09-Apr-2005 J. Malmberg Update for RSYNC and large file
[all...] |
| /external/libvorbis/doc/ |
| 01-introduction.tex | 4 \section{Introduction and Description} \label{vorbis:spec:intro}
20 it is in the same league as MPEG-2 and MPC. Similarly, the 1.0
21 encoder can encode high-quality CD and DAT rate stereo at below 48kbps
23 lower and higher sample rates (from 8kHz telephony to 192kHz digital
24 masters) and a range of channel representations (monaural,
33 transient response and reproduction using a transform better suited to
40 encoder and simple, low-complexity decoder. Vorbis decode is
52 dividing it into individual frames and compressing these frames into
55 them, and reassembles the frames into a facsimile of the original
56 audio stream. Vorbis is a free-form variable bit rate (VBR) codec and packets have n
[all...] |
| /external/llvm/lib/Bitcode/Writer/ |
| BitcodeWriter.cpp | 104 case Instruction::And: return bitc::BINOP_AND;
116 case AtomicRMWInst::And: return bitc::RMW_AND;
611 // Compute and return the bit offset to the placeholder, which will be
618 /// descriptors for global variables, and function prototype info.
633 // Emit information about sections and GC, computing how many there are. Also
674 // Emit abbrev for globals, now that we know # sections and max alignment.
[all...] |
| /external/llvm/lib/CodeGen/SelectionDAG/ |
| TargetLowering.cpp | 69 /// and called function attributes.
83 /// Generate a libcall taking the given operands as arguments and returning a
122 /// shared among BR_CC, SELECT_CC, and SETCC handlers.
296 /// constant and return true.
305 case ISD::AND:
332 /// casts are free. This uses isZExtFree and ZERO_EXTEND for the widening
354 // Search for the smallest integer type with free casts to and from
382 /// use this information to simplify Op, create a new simplified DAG node and
383 /// return true, returning the original and new nodes in Old and New. Otherwise
[all...] |
| FastISel.cpp | 14 // types (e.g. i64 on 32-bit targets) and operations are not supported. It is
17 // constants into immediate fields is often done, because it's cheap and it
20 // "Fast" instruction selection is able to fail gracefully and transfer
28 // at -O0, the LLVM optimizers are not running, and this makes the
36 // and identifying simple arithmetic operations that can be directly selected
95 /// appended, and clear the local CSE map.
148 // FastISel might fold the use into another instruction and now there is more
179 // Handle integer promotions, though, because they're common and easy.
263 /// already available in a register and must be materialized with new
287 // cache values defined by Instructions across blocks, and other value
[all...] |
| /external/llvm/lib/MC/MCParser/ |
| AsmParser.cpp | 165 /// and current line. Since this is slow and messes up the SourceMgr's
171 /// AssemblerDialect. ~OU means unset value and use value provided by MAI.
243 /// and set \p Res to the identifier contents.
275 /// \brief Define a new macro with the given name and information.
321 /// \brief Parse up to the end of statement and a return the contents from the
342 // Generic (target and platform independent) directive parsing.
435 // .sleb128 (Signed=true) and .uleb128 (Signed=false)
442 bool parseDirectiveComm(bool IsLocal); // ".comm" and ".lcomm"
597 // Pick up the bytes from the file and emit them
[all...] |
| /external/opencv3/modules/cudaarithm/test/ |
| test_element_operations.cpp | 17 // Redistribution and use in source and binary forms, with or without modification,
21 // this list of conditions and the following disclaimer.
24 // this list of conditions and the following disclaimer in the documentation
25 // and/or other materials provided with the distribution.
30 // This software is provided by the copyright holders and contributors "as is" and
32 // warranties of merchantability and fitness for a particular purpose are disclaimed.
37 // and on any theory of liability, whether in contract, strict liability,
[all...] |
| /external/v8/src/full-codegen/arm64/ |
| full-codegen-arm64.cc | 90 // and arguments have been pushed on the stack left to right. The actual
205 // It's saved in the stack and kept live in cp.
236 // Register holding this function and new target are both trashed in case we
238 // and we allocate a context, the value of |function_in_register| is correct.
301 // Visit the declarations and body.
455 // Drop the arguments and receiver and return.
958 // Discard the test value and jump to the default if present, otherwise to
[all...] |
| /external/vixl/src/vixl/a64/ |
| macro-assembler-a64.h | 4 // Redistribution and use in source and binary forms, with or without
8 // this list of conditions and the following disclaimer.
10 // this list of conditions and the following disclaimer in the documentation
11 // and/or other materials provided with the distribution.
16 // THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS CONTRIBUTORS "AS IS" AND
18 // WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
23 // CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY,
242 // This is for code size checking purposes, and can be extended in the future
546 // These two are *different* from the architectural codes al and nv
[all...] |
| macro-assembler-a64.cc | 4 // Redistribution and use in source and binary forms, with or without
8 // this list of conditions and the following disclaimer.
10 // this list of conditions and the following disclaimer in the documentation
11 // and/or other materials provided with the distribution.
16 // THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS CONTRIBUTORS "AS IS" AND
18 // WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
23 // CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY,
169 // is bound with masm Bind and not asm bind.
244 // Patch the branch to point to the current position, and emit a branc
[all...] |
| /frameworks/compile/libbcc/bcinfo/BitReader_3_0/ |
| BitcodeReader.cpp | 153 // This map links the invoke instruction with the eh.exception and eh.selector
172 assert(Exn && Sel && "Cannot find eh.exception and eh.selector calls!");
177 // This map stores the slots where the exception object and selector value are
191 // Store the exception object and selector value in the entry block.
268 // exception and selector values from the stored place.
447 /// file is for null, and is thus not represented here. As such all indices
762 case bitc::BINOP_AND: return Instruction::And;
774 case bitc::RMW_AND: return AtomicRMWInst::And;
822 /// @brief Methods to support type inquiry through isa, cast, and dyn_cast.
858 // Handle constants and non-constants (e.g. instrs) differently fo
[all...] |
| /external/clang/lib/CodeGen/ |
| CGBuiltin.cpp | 84 /// and the expression node.
142 /// Utility to insert an atomic instruction based Instrinsic::ID and
213 // Extract boolean success flag and zext it to int.
217 // Extract old value and emit it using the same type as compare value.
241 // did works as if the double-double was stored to memory and then
243 // lower address in both little- and big-Endian modes, but the "load"
348 // Note: Our __builtin_object_size implementation currently treats Type=0 and
395 // LLVM can't handle Type=3 appropriately, and __builtin_object_size shouldn't
401 // LLVM only supports 0 and 2, make sure that we pass along that
426 default: break; // Handle intrinsics and libm functions below
[all...] |
| /external/chromium-trace/catapult/third_party/gsutil/gslib/ |
| copy_helper.py | 14 # See the License for the specific language governing permissions and
144 # For debugging purposes; if True, files and objects that fail hash validation
155 one of their object names and then done an MD5 hash of the name, and
162 # filling in command output and manifests.
178 # of components and final object.
307 # We create a tuple with union of options needed by CopyHelper and any
395 subdir, and non-existent bucket subdir.
408 if ((exp_dst_url.IsFileUrl() and not exp_dst_url.IsDirectory()) or
409 (exp_dst_url.IsCloudUrl() and exp_dst_url.IsBucket(
[all...] |
| /external/eclipse-basebuilder/basebuilder-3.6.2/org.eclipse.releng.basebuilder/plugins/ |
| org.eclipse.equinox.p2.metadata_2.0.0.v20100601.jar | |
| /external/llvm/lib/Analysis/ |
| ScalarEvolution.cpp | 35 // TODO: We should use these routines and value representations to implement
55 // Using the chains of recurrences algebra for data dependence testing and
477 // so that (a + b) and (b + a) don't end up as different expressions.
507 // For instructions, compare their loop depth, and their operand
624 /// complexity, and group objects of the same complexity together by value.
626 /// consecutive and that complexity is monotonically increasing.
656 // If there are any objects of the same complexity and same value as this
695 // Computes the Quotient and Remainder of the division of Numerator by
909 // be equal to zero and the remainder to be equal to the numerator.
945 // K! (i.e. trailing zeros in the binary representation of K!), and ^ i
[all...] |
| /external/llvm/lib/Transforms/Scalar/ |
| GVN.cpp | 1 //===- GVN.cpp - Eliminate redundant values and loads ---------------------===//
81 /// This class holds the mapping between values and value numbers. It is used
188 // Sort the operand value numbers so x<y and y>x get the same value number.
214 // Sort the operand value numbers so x<y and y>x get the same value number.
428 case Instruction::And:
636 /// our various maps and marks it for deletion.
663 /// value number, and remove the given instruction if encountered.
777 /// 3) we are speculating for this block and have used that to speculate for
785 // Optimistically assume that the block is fully available and check to see
809 // optimistic assumption and bail out
[all...] |
| /external/v8/src/arm64/ |
| macro-assembler-arm64.h | 122 // These two are *different* from the architectural codes al and nv.
127 // cbz and cbnz
129 // tbz and tbnz
174 inline void And(const Register& rd,
204 // Add and sub macros.
265 // instruction. Returns true for success, and updates the contents of dst.
269 // Move an immediate into register dst, and return an Operand object for use
438 // Provide explicit double and float interfaces for FP immediate moves, rather
441 // signalling NaNs to quiet NaNs when converting between float and double.
587 // to be 'NoReg', and are thus not pushed or popped
[all...] |
| /external/v8/src/wasm/ |
| asm-wasm-builder.cc | [all...] |
| /frameworks/compile/slang/BitWriter_2_9/ |
| BitcodeWriter.cpp | 114 case Instruction::And: return bitc::BINOP_AND;
382 // descriptors for global variables, and function prototype info.
397 // Emit information about sections and GC, computing how many there are. Also
438 // Emit abbrev for globals, now that we know # sections and max alignment.
623 // Assume the column is usually under 128, and always output the inlined-at
[all...] |
