/external/libvorbis/lib/ |
H A D | floor0.c | 59 vorbis_look_floor0 *look=(vorbis_look_floor0 *)i; local 60 if(look){ 62 if(look->linearmap){ 64 if(look->linearmap[0])_ogg_free(look->linearmap[0]); 65 if(look->linearmap[1])_ogg_free(look->linearmap[1]); 67 _ogg_free(look->linearmap); 69 memset(look,0,sizeof(*look)); 110 floor0_map_lazy_init(vorbis_block *vb, vorbis_info_floor *infoX, vorbis_look_floor0 *look) argument 147 vorbis_look_floor0 *look=_ogg_calloc(1,sizeof(*look)); local 158 vorbis_look_floor0 *look=(vorbis_look_floor0 *)i; local 195 vorbis_look_floor0 *look=(vorbis_look_floor0 *)i; local [all...] |
H A D | res0.c | 81 vorbis_look_residue0 *look=(vorbis_look_residue0 *)i; local 86 for(j=0;j<look->parts;j++){ 89 if(look->training_data[k][j]){ 92 codebook *statebook=look->partbooks[j][k]; 95 sprintf(buffer,"res_sub%d_part%d_pass%d.vqd",look->submap,j,k); 99 fprintf(of,"%d:%ld\n",l,look->training_data[k][j][l]); 104 look->training_min[k][j],look->training_max[k][j]);*/ 106 _ogg_free(look->training_data[k][j]); 107 look 270 vorbis_look_residue0 *look=_ogg_calloc(1,sizeof(*look)); local 416 vorbis_look_residue0 *look=(vorbis_look_residue0 *)vl; local 483 vorbis_look_residue0 *look=(vorbis_look_residue0 *)vl; local 543 vorbis_look_residue0 *look=(vorbis_look_residue0 *)vl; local 662 vorbis_look_residue0 *look=(vorbis_look_residue0 *)vl; local 807 vorbis_look_residue0 *look=(vorbis_look_residue0 *)vl; local [all...] |
H A D | floor1.c | 63 vorbis_look_floor1 *look=(vorbis_look_floor1 *)i; local 64 if(look){ 66 (float)look->phrasebits/look->frames, 67 (float)look->postbits/look->frames, 68 (float)(look->postbits+look->phrasebits)/look->frames);*/ 70 memset(look, 202 vorbis_look_floor1 *look=_ogg_calloc(1,sizeof(*look)); local 591 floor1_fit(vorbis_block *vb,vorbis_look_floor1 *look, const float *logmdct, const float *logmask) argument 746 floor1_interpolate_fit(vorbis_block *vb,vorbis_look_floor1 *look, int *A,int *B, int del) argument 768 floor1_encode(oggpack_buffer *opb,vorbis_block *vb, vorbis_look_floor1 *look, int *post,int *ilogmask) argument 969 vorbis_look_floor1 *look=(vorbis_look_floor1 *)in; local 1056 vorbis_look_floor1 *look=(vorbis_look_floor1 *)in; local [all...] |
H A D | codec_internal.h | 134 extern void _vp_global_free(vorbis_look_psy_global *look); 158 extern int *floor1_fit(vorbis_block *vb,vorbis_look_floor1 *look, 161 extern int *floor1_interpolate_fit(vorbis_block *vb,vorbis_look_floor1 *look, 165 vorbis_look_floor1 *look,
|
H A D | backends.h | 33 vorbis_look_floor *(*look) (vorbis_dsp_state *,vorbis_info_floor *); member in struct:__anon24735 91 vorbis_look_residue *(*look) (vorbis_dsp_state *, member in struct:__anon24738
|
/external/antlr/antlr-3.4/runtime/JavaScript/src/org/antlr/runtime/tree/ |
H A D | TreeParser.js | 56 var look = this.input.LT(1); 57 if ( this.input.getTreeAdaptor().getChildCount(look)===0 ) { 64 tokenType = this.input.getTreeAdaptor().getType(look); 69 look = this.input.LT(1); 70 tokenType = this.input.getTreeAdaptor().getType(look);
|
/external/antlr/antlr-3.4/runtime/Ruby/test/unit/ |
H A D | test-trees.rb | 156 stream.look(index + 1).type.should == type 158 stream.look(100).type.should == EOF 175 13.times { stream.look(1); stream.consume } # consume until end 177 stream.look(1).type.should == EOF 178 stream.look(-1).type.should == UP 181 13.times { stream.look(1); stream.consume } # consume until end 183 stream.look(1).type.should == EOF 184 stream.look(-1).type.should == UP 202 stream.look(1).type.should == 107 208 stream.look( [all...] |
H A D | test-streams.rb | 86 @stream.look(1).should == 'o' 87 @stream.look(2).should == 'h' 88 @stream.look(3).should == "\n" 94 @stream.look(1).should == '!' 95 @stream.look(2).should == "\n" 96 @stream.look(3).should be_nil 223 @stream.look(1).should == 'a' 279 @stream.look.should == ANTLR3::EOF_TOKEN 286 @stream.look(1).type.should == 12 295 @stream.look( [all...] |
/external/antlr/antlr-3.4/tool/src/main/java/org/antlr/analysis/ |
H A D | LL1Analyzer.java | 153 LookaheadSet look = _FIRST(s, false); 154 //System.out.println("< FIRST("+s.enclosingRule.name+") in rule "+s.enclosingRule+"="+look.toString(this.grammar)); 155 return look; 175 LookaheadSet look = _FIRST(s, true); 177 if ( grammar.type!=Grammar.LEXER && look.member(Label.EOR_TOKEN_TYPE) ) { 180 f.orInPlace(look); 182 look = f; 183 //look.orInPlace(FOLLOW(s.enclosingRule)); 185 else if ( grammar.type==Grammar.LEXER && look.member(Label.EOT) ) { 187 //look [all...] |
/external/jpeg/ |
H A D | jdhuff.h | 178 { register int nb, look; \ 186 look = PEEK_BITS(HUFF_LOOKAHEAD); \ 187 if ((nb = htbl->look_nbits[look]) != 0) { \ 189 result = htbl->look_sym[look]; \
|
/external/pdfium/core/src/fxcodec/libjpeg/ |
H A D | jdhuff.h | 177 { register int nb, look; \
185 look = PEEK_BITS(HUFF_LOOKAHEAD); \
186 if ((nb = htbl->look_nbits[look]) != 0) { \
188 result = htbl->look_sym[look]; \
|
/external/qemu/distrib/jpeg-6b/ |
H A D | jdhuff.h | 178 { register int nb, look; \ 186 look = PEEK_BITS(HUFF_LOOKAHEAD); \ 187 if ((nb = htbl->look_nbits[look]) != 0) { \ 189 result = htbl->look_sym[look]; \
|
/external/antlr/antlr-3.4/runtime/Ruby/lib/antlr3/debug/ |
H A D | rule-tracer.rb | 33 input_symbol = @input.look || :EOF 34 @device.puts( " look = %p" % input_symbol ) 48 input_symbol = ( @input.look || :EOF ) 49 @device.puts( " look = %p" % input_symbol )
|
/external/antlr/antlr-3.4/runtime/ActionScript/project/src/org/antlr/runtime/tree/ |
H A D | TreeParser.as | 86 var look:Object = input.LT(1); 87 if ( input.treeAdaptor.getChildCount(look)==0 ) { 94 var tokenType:int = input.treeAdaptor.getType(look); 97 look = input.LT(1); 98 tokenType = input.treeAdaptor.getType(look);
|
/external/chromium_org/third_party/libjpeg_turbo/ |
H A D | jdhuff.h | 192 { register int nb, look; \ 200 look = PEEK_BITS(HUFF_LOOKAHEAD); \ 201 if ((nb = (htbl->lookup[look] >> HUFF_LOOKAHEAD)) <= HUFF_LOOKAHEAD) { \ 203 result = htbl->lookup[look] & ((1 << HUFF_LOOKAHEAD) - 1); \
|
/external/chromium_org/third_party/yasm/source/patched-yasm/tools/re2c/ |
H A D | parser.c | 40 RegExp *re, *look; local 72 look = parse_expr(); 74 look = RegExp_new_NullOp(); 78 re = RegExp_new_RuleOp(re, look, yylval.token, accept++);
|
/external/llvm/test/MC/AArch64/ |
H A D | arm64-separator.s | 8 ; being on separate lines in the output. We look for the "; encoding" string
|
/external/chromium_org/native_client_sdk/src/doc/ |
H A D | Makefile | 44 @echo "Link check complete; look for any errors in the above output " \ 49 @echo "Testing of doctests in the sources finished, look at the " \
|
/external/llvm/utils/lit/lit/ |
H A D | ShUtil.py | 19 def look(self): member in class:ShLexer 51 c = self.look() 164 if self.look().isspace(): 182 def look(self): member in class:ShParser 198 tok = self.look() 227 while self.look() == ('|',): 235 while self.look(): 239 if not self.look():
|
/external/antlr/antlr-3.4/runtime/Java/src/main/java/org/antlr/runtime/tree/ |
H A D | TreeParser.java | 103 Object look = input.LT(1); 104 if ( input.getTreeAdaptor().getChildCount(look)==0 ) { 111 int tokenType = input.getTreeAdaptor().getType(look); 114 look = input.LT(1); 115 tokenType = input.getTreeAdaptor().getType(look);
|
/external/antlr/antlr-3.4/runtime/Ruby/lib/antlr3/tree/ |
H A D | debug.rb | 125 def look( i = 1 ) method in class:ANTLR3.Debug.TreeNodeStream 130 @debug_listener.look( i, node ) 139 @debug_listener.look( i, node )
|
/external/antlr/antlr-3.4/runtime/CSharp2/Sources/Antlr3.Runtime/Antlr.Runtime.Tree/ |
H A D | TreeParser.cs | 117 int look = input.LA(1); 118 if (look == DOWN) {
|
/external/antlr/antlr-3.4/runtime/CSharp3/Sources/Antlr3.Runtime/Tree/ |
H A D | TreeParser.cs | 128 int look = input.LA( 1 ); 129 if ( look == DOWN )
|
/external/antlr/antlr-3.4/runtime/Ruby/test/functional/parser/ |
H A D | ll-star.rb | 29 * Use ANTLRWorks to see the look use (step by Location) 30 * and look for blue tokens in the input window pane. :)
|
/external/antlr/antlr-3.4/runtime/Ruby/test/functional/lexer/ |
H A D | filter-mode.rb | 48 * ever match since k=1 look in the QID loop of '.' will make it loop. 182 * ever match since k=1 look in the QID loop of '.' will make it loop.
|