HomeSort by relevance Sort by last modified time
    Searched refs:To (Results 26 - 50 of 359) sorted by null

12 3 4 5 6 7 8 91011>>

  /prebuilts/ndk/7/sources/cxx-stl/gnu-libstdc++/include/backward/
backward_warning.h 33 backward_warning.h. To disable this warning use -Wno-deprecated.
  /prebuilts/ndk/8/sources/cxx-stl/gnu-libstdc++/4.4.3/include/backward/
backward_warning.h 33 backward_warning.h. To disable this warning use -Wno-deprecated.
  /prebuilts/ndk/8/sources/cxx-stl/gnu-libstdc++/4.6/include/backward/
backward_warning.h 26 * Do not attempt to use it directly. @headername{iosfwd}
38 backward_warning.h. To disable this warning use -Wno-deprecated.
  /prebuilts/ndk/8/sources/cxx-stl/gnu-libstdc++/4.7/include/backward/
backward_warning.h 26 * Do not attempt to use it directly. @headername{iosfwd}
38 backward_warning.h. To disable this warning use -Wno-deprecated.
  /external/antlr/antlr-3.4/runtime/ObjC/Framework/
ANTLRCommonErrorNode.h 17 // 3. The name of the author may not be used to endorse or promote products
21 // IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES
25 // NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
48 To:(id<ANTLRToken>)stopToken
53 To:(id<ANTLRToken>)stopToken
ANTLRTreeNodeStream.h 13 // 3. The name of the author may not be used to endorse or promote products
17 // IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES
21 // NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
49 - (void) replaceChildren:(id)parent From:(NSInteger)startChildIndex To:(NSInteger)stopChildIndex With:(id) t;
ANTLRCommonTreeAdaptor.h 13 // 3. The name of the author may not be used to endorse or promote products
17 // IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES
21 // NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
47 - (void) setTokenBoundaries:(ANTLRCommonTree *)t From:(id<ANTLRToken>)startToken To:(id<ANTLRToken>)stopToken;
62 - (void)replaceChildren:(ANTLRCommonTree *)parent From:(NSInteger)startChildIndex To:(NSInteger)stopChildIndex With:(ANTLRCommonTree *)t;
ANTLRTreeAdaptor.h 13 // 3. The name of the author may not be used to endorse or promote products
17 // IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES
21 // NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
54 * to some applications; default implementation stores ptr to it in
63 To:(id<ANTLRToken>)aStopToken
66 /** Is tree considered a nil node used to make lists of child nodes? */
72 /** If oldRoot is a nil root, just copy or move the children to newRoot.
93 * Be advised that it's ok for newRoot to point at oldRoot's
94 * children; i.e., you don't have to copy the list. We ar
    [all...]
  /external/llvm/lib/Target/PowerPC/
PPCJITInfo.cpp 49 static void EmitBranchToAt(uint64_t At, uint64_t To, bool isCall, bool is64Bit){
50 intptr_t Offset = ((intptr_t)To - (intptr_t)At) >> 2;
56 AtI[0] = BUILD_LIS(12, To >> 16); // lis r12, hi16(address)
57 AtI[1] = BUILD_ORI(12, 12, To); // ori r12, r12, lo16(address)
61 AtI[0] = BUILD_LIS(12, To >> 48); // lis r12, hi16(address)
62 AtI[1] = BUILD_ORI(12, 12, To >> 32); // ori r12, r12, lo16(address)
64 AtI[3] = BUILD_ORIS(12, 12, To >> 16); // oris r12, r12, hi16(address)
65 AtI[4] = BUILD_ORI(12, 12, To); // ori r12, r12, lo16(address)
86 // FIXME: need to save v[0-19] for altivec?
110 // Arguments to Compilation Callback
    [all...]
  /external/llvm/test/MC/X86/AlignedBundling/
long-nop-pad.s 14 # To align this group to a bundle end, we need a 15-byte NOP and a 12-byte NOP.
23 # To align this group to a bundle end, we need two 15-byte NOPs, and a 1-byte.
  /external/openssl/
build-config.mk 2 # To regenerate, edit openssl.config, then run:
3 # ./import_openssl.sh import /path/to/openssl-1.0.1e.tar.gz
  /external/clang/include/clang/Lex/
PreprocessorOptions.h 43 /// used in preprocessor initialization to InitializePreprocessor().
61 /// \brief Headers that will be converted to chained PCHs in memory.
74 /// \brief This is a set of names for decls that we do not want to be
89 /// If given, a PTH cache file to use for speeding up header parsing.
93 /// contents of files that were remapped to other files. Defaults to true.
102 /// \brief The set of file-to-buffer remappings, which take existing files
111 /// This flag defaults to false; it can be set true only through direct
117 /// by providing appropriate definitions to retrofit the standard library
135 /// \brief The set of modules that failed to build
    [all...]
  /external/clang/include/clang/Sema/
SemaFixItUtils.h 34 /// Performs a simple check to see if From type can be converted to To type.
36 CanQualType To,
49 /// to the kid of the very first conversion.
57 /// The type comparison function used to decide if expression FromExpr of
58 /// type FromTy can be converted to ToTy. For example, one could check if
  /external/icu4c/data/misc/
miscfiles.mk 3 # A list of txt's to build
8 # Instead of changing this file [unless you want to check it back in],
15 # * To add an additional file to the list:
19 # * To REPLACE the default list and only build a subset of files:
  /external/icu4c/data/sprep/
sprepfiles.mk 3 # A list of txt's to build
8 # Instead of changing this file [unless you want to check it back in],
15 # * To add an additional locale to the list:
19 # * To REPLACE the default list and only build a subset of files:
  /external/llvm/lib/Analysis/
NoAliasAnalysis.cpp 24 /// implementations, in that it does not chain to a previous analysis. As
67 virtual void copyValue(Value *From, Value *To) {}
72 /// should override this to adjust the this pointer as needed for the
AliasDebugger.cpp 10 // This simple pass checks alias analysis users to ensure that if they
35 //A query to a value that didn't exist when the AA was created
36 //means someone forgot to update the AA when creating new values
86 /// should override this to adjust the this pointer as needed for the
125 virtual void copyValue(Value *From, Value *To) {
126 Vals.insert(To);
127 AliasAnalysis::copyValue(From, To);
  /external/antlr/antlr-3.4/runtime/ObjC/ANTLR.framework/Headers/
ANTLRCommonTreeAdaptor.h 13 // 3. The name of the author may not be used to endorse or promote products
17 // IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES
21 // NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
44 - (void) setTokenBoundaries:(id<ANTLRTree>)t From:(id<ANTLRToken>)startToken To:(id<ANTLRToken>)stopToken;
59 - (void)replaceChildren:(id<ANTLRTree>)parent From:(NSInteger)startChildIndex To:(NSInteger)stopChildIndex With:(id<ANTLRTree>)t;
ANTLRTreeAdaptor.h 13 // 3. The name of the author may not be used to endorse or promote products
17 // IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES
21 // NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
58 * to some applications; default implementation stores ptr to it in
67 To:(id<ANTLRToken>)aStopToken
70 /** Is tree considered a nil node used to make lists of child nodes? */
76 /** If oldRoot is a nil root, just copy or move the children to newRoot.
97 * Be advised that it's ok for newRoot to point at oldRoot's
98 * children; i.e., you don't have to copy the list. We ar
    [all...]
  /external/antlr/antlr-3.4/runtime/ObjC/ANTLR.framework/Versions/A/Headers/
ANTLRCommonTreeAdaptor.h 13 // 3. The name of the author may not be used to endorse or promote products
17 // IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES
21 // NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
44 - (void) setTokenBoundaries:(id<ANTLRTree>)t From:(id<ANTLRToken>)startToken To:(id<ANTLRToken>)stopToken;
59 - (void)replaceChildren:(id<ANTLRTree>)parent From:(NSInteger)startChildIndex To:(NSInteger)stopChildIndex With:(id<ANTLRTree>)t;
ANTLRTreeAdaptor.h 13 // 3. The name of the author may not be used to endorse or promote products
17 // IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES
21 // NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
58 * to some applications; default implementation stores ptr to it in
67 To:(id<ANTLRToken>)aStopToken
70 /** Is tree considered a nil node used to make lists of child nodes? */
76 /** If oldRoot is a nil root, just copy or move the children to newRoot.
97 * Be advised that it's ok for newRoot to point at oldRoot's
98 * children; i.e., you don't have to copy the list. We ar
    [all...]
  /external/antlr/antlr-3.4/runtime/ObjC/ANTLR.framework/Versions/Current/Headers/
ANTLRCommonTreeAdaptor.h 13 // 3. The name of the author may not be used to endorse or promote products
17 // IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES
21 // NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
44 - (void) setTokenBoundaries:(id<ANTLRTree>)t From:(id<ANTLRToken>)startToken To:(id<ANTLRToken>)stopToken;
59 - (void)replaceChildren:(id<ANTLRTree>)parent From:(NSInteger)startChildIndex To:(NSInteger)stopChildIndex With:(id<ANTLRTree>)t;
  /external/clang/lib/Tooling/
RefactoringCallbacks.cpp 31 const Stmt &To) {
33 CharSourceRange::getTokenRange(To.getSourceRange()),
73 // If we want to use the 'else'-branch, but it doesn't exist, delete
  /external/antlr/antlr-3.4/runtime/ObjC/Framework/examples/treeparser/
LangParser.m 296 [treeAdaptor setTokenBoundaries:retval.tree From:retval.start To:retval.stopToken];
303 retval.tree = (ANTLRCommonTree *)[treeAdaptor errorNode:input From:retval.start To:[input LT:-1] Exception:re];
422 [treeAdaptor setTokenBoundaries:retval.tree From:retval.start To:retval.stopToken];
429 retval.tree = (ANTLRCommonTree *)[treeAdaptor errorNode:input From:retval.start To:[input LT:-1] Exception:re];
495 [treeAdaptor setTokenBoundaries:retval.tree From:retval.start To:retval.stopToken];
502 retval.tree = (ANTLRCommonTree *)[treeAdaptor errorNode:input From:retval.start To:[input LT:-1] Exception:re];
  /external/llvm/include/llvm/Analysis/
LoopIterator.h 9 // This file defines iterators to visit the basic blocks within a loop.
15 // If you want to visit all blocks in a loop and don't need an ordered traveral,
18 // This is intentionally designed to work with ill-formed loops in which the
20 // contained within the loop according to the most recent LoopInfo analysis are
49 /// Map each block to its postorder number. A block is only mapped after it is
51 /// to nonzero after it is finished by postorder traversal.
66 /// Return true if postorder numbers are assigned to all loop blocks.
111 /// Specialize po_iterator_storage to record postorder numbers.
117 bool insertEdge(BasicBlock *From, BasicBlock *To);
135 /// Postorder traversal over the graph. This only needs to be done once
    [all...]

Completed in 469 milliseconds

12 3 4 5 6 7 8 91011>>