/external/aac/libFDK/include/ |
H A D | fixmul.h | 9 The Fraunhofer FDK AAC Codec Library for Android ("FDK AAC Codec") is software that implements 11 This FDK AAC Codec software is intended to be used on a wide variety of Android devices. 14 audio codecs. AAC-ELD is considered the best-performing full-bandwidth communications codec by 15 independent studies and is widely deployed. AAC has been standardized by ISO and IEC as part 23 software may already be covered under those patent licenses when it is used for those licensed purposes only. 64 This FDK AAC Codec software is provided by Fraunhofer on behalf of the copyright holders and contributors 257 #error Fallback for fixpow2div2_D is not 16 bit safe ! 266 #error Fallback for fixpow2_D is not 16 bit safe !
|
/external/ant-glob/ |
H A D | Android.mk | 10 # distributed under the License is distributed on an "AS IS" BASIS,
|
H A D | NOTICE | 14 * the copyright owner that is granting the License. 38 * copyright notice that is included in or attached to the work 39 * (an example is provided in the Appendix below). 42 * form, that is based on (or derived from) the Work and for which the 51 * to that Work or Derivative Works thereof, that is intentionally 60 * excluding communication that is conspicuously marked or otherwise 88 * as of the date such litigation is filed. 199 * distributed under the License is distributed on an "AS IS" BASIS, 209 related items) is being provided by the copyright holders under the following 215 with or without modification, for any purpose and without fee or royalty is [all...] |
/external/antlr/ |
H A D | Android.mk | 10 # distributed under the License is distributed on an "AS IS" BASIS,
|
/external/antlr/antlr-3.4/lib/ |
H A D | antlr-3.4-complete.jar | META-INF/ META-INF/MANIFEST.MF org/ org/antlr/ org/antlr/analysis/ org/antlr/codegen/ org/ ... |
/external/antlr/antlr-3.4/runtime/ActionScript/project/lib/ |
H A D | FlexAntTasks.jar | META-INF/ META-INF/MANIFEST.MF com/ com/adobe/ com/adobe/ac/ com/adobe/ac/ant/ ... |
/external/antlr/antlr-3.4/runtime/ActionScript/project/src/org/antlr/runtime/ |
H A D | BaseRecognizer.as | 4 * lexer, parser, and tree grammars. This is all the parsing 5 * support code essentially; most of it is error recovery stuff and 20 * object so the state can be shared. This sharing is needed to 106 // if current token is consistent with what could come after set 107 // then we know we're missing a token; error recovery is free to 113 // in follow set to indicate that the fall of the start symbol is 116 //System.out.println("LT(1)=="+((TokenStream)input).LT(1)+" is consistent with what follows; inserting..."); 141 * This method sets errorRecovery to indicate the parser is recovering 200 if ( e is UnwantedTokenException ) { 212 else if ( e is MissingTokenExceptio [all...] |
H A D | BitSet.as | 30 /**A stripped-down version of org.antlr.misc.BitSet that is just 39 * turns out that, for powers of two, this mod operation is 40 * same as (i & (nbits-1)). Since mod is slow, we use a 101 // If this is smaller than a, grow this first 145 if ( other == null || !(other is BitSet) ) { 212 /** return how much space is being used by the bits array not
|
H A D | CommonToken.as | 40 * this is non-null, then getText should return this. Note that 45 /** What token number is this from 0..n-1 tokens; < 0 implies invalid index */ 74 if ( oldToken is CommonToken ) {
|
H A D | DFA.as | 5 * Any state that has a semantic predicate edge is special; those states 7 * which is generated by cyclicDFA template. 76 " state "+s+" is special state "+specialState); 100 // must check EOT, which is like the else clause. 184 // walk first to find how big it is.
|
H A D | Lexer.as | 30 /** A lexer is recognizer that draws input symbols from a character stream. 36 /** Where is the lexer drawing characters from? */ 109 /** This is the lexer entry point that sets instance var 'token' */ 141 * char buffer start..stop. If there is a text override in 'text', 216 /** What is the index of the current character of lookahead? */ 244 if ( e is MismatchedTokenException ) { 248 else if ( e is NoViableAltException ) { 255 else if ( e is EarlyExitException ) { 260 else if ( e is MismatchedNotSetException ) { 264 else if ( e is MismatchedSetExceptio [all...] |
H A D | NoViableAltException.as | 47 if ( input is CharStream ) {
|
H A D | RecognitionException.as | 57 * state can change before the exception is reported so current token index 58 * is computed and stored at exception time. From this info, you can 67 /** What is index of token/char were we looking at when the error occurred? */ 76 /** If this is a tree parser exception, node is set to the node with 84 /** Track the line at which the error occurred in case this is 95 * that info is approximate. 105 if ( input is TokenStream ) { 110 if ( input is TreeNodeStream ) { 113 else if ( input is CharStrea [all...] |
H A D | RecognizerSharedState.as | 8 * parser is protected. 18 /** This is true when we see an error and before having successfully 25 * This is used to prevent infinite loops where an error is found 26 * but no token is consumed during recovery...another error is found, 27 * ad naseum. This is a failsafe mechanism to guarantee that at least 28 * one token/tree node is consumed for two errors. 40 /** If 0, no backtracking is going on. Safe to exec actions etc... 46 * the stop token index for each rule. ruleMemo[ruleIndex] is [all...] |
H A D | TokenRewriteStream.as | 37 * String. This is very efficient because you are not moving data around 38 * all the time. As the buffer of tokens is converted to strings, the 39 * toString() method(s) check to see if there is an operation at the 40 * current index. If so, the operation is done and then normal String 41 * rendering continues on the buffer. This is like having multiple Turing 45 * screw up the token index values. That is, an insert operation at token 51 * roll back any changes if there is an error just by removing instructions. 80 * If you don't use named rewrite streams, a "default" stream is used as 102 * the indicated instruction (via instructionIndex) is no 292 * 2. Drop any replace op before that is containe [all...] |
/external/antlr/antlr-3.4/runtime/ActionScript/project/src/org/antlr/runtime/tree/ |
H A D | BaseTreeAdaptor.as | 11 /** System.identityHashCode() is not always unique; we have to 48 /** This is generic in the sense that it will work with any kind of 69 /** Add a child to the tree t. If child is a flat tree (a list), make all 71 * and child isNil then you can decide it is ok to move children to t via 73 * make sure that this is consistent with have the user will build 82 /** If oldRoot is a nil root, just copy or move the children to newRoot. 88 * If newRoot is a nil-rooted single child tree, use the single 99 * Return newRoot. Throw an exception if newRoot is not a 101 * node. If newRoot is ^(nil x) return x as newRoot. 109 // If new Root is toke [all...] |
H A D | CommonErrorNode.as | 21 // sometimes resync does not consume a token (when LT(1) is 23 // Also handle case where start is the first token and no token 24 // is consumed during recovery; LT(-1) will return null. 43 if ( start is Token ) { 51 else if ( start is Tree ) { 56 // next one is for sure correct. 63 if ( trappedException is MissingTokenException ) { 68 else if ( trappedException is UnwantedTokenException ) { 73 else if ( trappedException is MismatchedTokenException ) { 76 else if ( trappedException is NoViableAltExceptio [all...] |
H A D | CommonTreeNodeStream.as | 43 * This stream is most suitable for tree interpreters that need to 45 * There is some duplicated functionality here with UnBufferedTreeNodeStream 63 * It is built upon ctor invocation. The elements are type 81 /** Reuse same DOWN, UP navigation nodes unless this is true */ 126 * Don't do DOWN, UP nodes if its a list (t is isNil). 155 /** What is the stream index for node? 0..n-1 173 * so instantiate new ones when uniqueNavigationNodes is true. 385 if ( start is CommonTree ) 389 if ( stop is CommonTree )
|
H A D | RewriteRuleElementStream.as | 44 /** Cursor 0..n-1. If singleElement!=null, cursor is 0 until you next(), 76 if (element is Array) { 98 //System.out.println("add '"+elementDescription+"' is "+el); 118 * an exception unless size()==1. If size is 1, then return elements[0]. 119 * Return a duplicate node/subtree if stream is out of elements and 126 // if out of elements and size is 1, dup 138 * if the stream is empty or we're out of elements and size>1. 147 if ( n ==1 ) { // if size is 1, it's ok; return and we'll dup 167 * the element is for a tree root; then it must be a node dup.
|
H A D | RewriteRuleNodeStream.as | 4 /** Queues up nodes matched on left side of -> in a tree parser. This is
|
H A D | TreeParser.as | 32 * of this. All the error reporting and recovery is shared with Parser via 91 // current node is a subtree, skip to corresponding UP. 117 /** Prefix error message with the grammar name because message is 130 if ( this is TreeParser ) {
|
/external/antlr/antlr-3.4/runtime/C/include/ |
H A D | antlr3cyclicdfa.h | 4 /// structures and show Java how it is done ;-) 44 // If this header file is included as part of a generated recognizer that 45 // is being compiled as if it were C++, and this is Windows, then the const elements 71 ANTLR3_INT32 (*specialStateTransition) (void * ctx, pANTLR3_BASE_RECOGNIZER recognizer, pANTLR3_INT_STREAM is, struct ANTLR3_CYCLIC_DFA_struct * dfa, ANTLR3_INT32 s); 73 ANTLR3_INT32 (*specialTransition) (void * ctx, pANTLR3_BASE_RECOGNIZER recognizer, pANTLR3_INT_STREAM is, struct ANTLR3_CYCLIC_DFA_struct * dfa, ANTLR3_INT32 s); 75 ANTLR3_INT32 (*predict) (void * ctx, pANTLR3_BASE_RECOGNIZER recognizer, pANTLR3_INT_STREAM is, struct ANTLR3_CYCLIC_DFA_struct * dfa);
|
H A D | antlr3defs.h | 95 /// Input is 8 bit EBCDIC (which we convert to 8 bit ASCII on the fly 103 /* Work out what operating system/compiler this is. We just do this once 340 /* Some platforms define a macro, index() in string.h. AIX is 343 * files is a really bad idea, but I doubt that IBM will listen to me ;-) 361 // HPUX is always different usually for no good reason. Tru64 should have kicked it 593 ANTLR3_API ANTLR3_INT32 antlr3dfaspecialTransition (void * ctx, pANTLR3_BASE_RECOGNIZER rec, pANTLR3_INT_STREAM is, pANTLR3_CYCLIC_DFA dfa, ANTLR3_INT32 s); 594 ANTLR3_API ANTLR3_INT32 antlr3dfaspecialStateTransition (void * ctx, pANTLR3_BASE_RECOGNIZER rec, pANTLR3_INT_STREAM is, pANTLR3_CYCLIC_DFA dfa, ANTLR3_INT32 s); 595 ANTLR3_API ANTLR3_INT32 antlr3dfapredict (void * ctx, pANTLR3_BASE_RECOGNIZER rec, pANTLR3_INT_STREAM is, pANTLR3_CYCLIC_DFA cdfa);
|
/external/antlr/antlr-3.4/runtime/C/src/ |
H A D | antlr3baserecognizer.c | 57 static ANTLR3_BOOLEAN mismatchIsUnwantedToken (pANTLR3_BASE_RECOGNIZER recognizer, pANTLR3_INT_STREAM is, ANTLR3_UINT32 ttype); 58 static ANTLR3_BOOLEAN mismatchIsMissingToken (pANTLR3_BASE_RECOGNIZER recognizer, pANTLR3_INT_STREAM is, pANTLR3_BITSET_LIST follow); 130 // free it when the base recognizer is freed. 260 /* Now update it to indicate this is a Mismatched token exception 277 pANTLR3_INT_STREAM is; local 284 is = NULL; 295 is = ins->istream; 303 is = parser->tstream->istream; 311 is = tns->istream; 333 switch (is 420 pANTLR3_INT_STREAM is; local 493 pANTLR3_INT_STREAM is; local 529 mismatchIsUnwantedToken(pANTLR3_BASE_RECOGNIZER recognizer, pANTLR3_INT_STREAM is, ANTLR3_UINT32 ttype) argument 552 mismatchIsMissingToken(pANTLR3_BASE_RECOGNIZER recognizer, pANTLR3_INT_STREAM is, pANTLR3_BITSET_LIST follow) argument 646 pANTLR3_INT_STREAM is; local 1012 pANTLR3_INT_STREAM is; local 1327 pANTLR3_INT_STREAM is; local 1436 pANTLR3_INT_STREAM is; local 1559 pANTLR3_INT_STREAM is; local 1625 pANTLR3_INT_STREAM is; local 1721 pANTLR3_INT_STREAM is; local 1771 pANTLR3_INT_STREAM is; local 1924 pANTLR3_INT_STREAM is; local 1999 pANTLR3_INT_STREAM is; local 2060 pANTLR3_INT_STREAM is; local [all...] |
H A D | antlr3commontreenodestream.c | 66 static void consume (pANTLR3_INT_STREAM is); 67 static ANTLR3_MARKER tindex (pANTLR3_INT_STREAM is); 68 static ANTLR3_UINT32 _LA (pANTLR3_INT_STREAM is, ANTLR3_INT32 i); 69 static ANTLR3_MARKER mark (pANTLR3_INT_STREAM is); 70 static void release (pANTLR3_INT_STREAM is, ANTLR3_MARKER marker); 71 static void rewindMark (pANTLR3_INT_STREAM is, ANTLR3_MARKER marker); 72 static void rewindLast (pANTLR3_INT_STREAM is); 73 static void seek (pANTLR3_INT_STREAM is, ANTLR3_MARKER index); 74 static ANTLR3_UINT32 size (pANTLR3_INT_STREAM is); 260 // Signal that this is 615 consume(pANTLR3_INT_STREAM is) argument 631 _LA(pANTLR3_INT_STREAM is, ANTLR3_INT32 i) argument 656 mark(pANTLR3_INT_STREAM is) argument 677 release(pANTLR3_INT_STREAM is, ANTLR3_MARKER marker) argument 688 rewindMark(pANTLR3_INT_STREAM is, ANTLR3_MARKER marker) argument 694 rewindLast(pANTLR3_INT_STREAM is) argument 703 seek(pANTLR3_INT_STREAM is, ANTLR3_MARKER index) argument 715 tindex(pANTLR3_INT_STREAM is) argument 731 size(pANTLR3_INT_STREAM is) argument [all...] |