/external/webkit/PerformanceTests/SunSpider/tests/v8-v4/ |
H A D | v8-crypto.js | 6 * a copy of this software and associated documentation files (the 9 * distribute, sublicense, and/or sell copies of the Software, and to 13 * The above copyright notice and this permission notice shall be 29 * and disclaimer. 66 // am1: use a single mult and divide to get the high bits, 80 // am2 avoids a big mult-and-extract completely. 194 // (protected) set from string and radix 442 // (protected) divide this by m, quotient and remainder to q, r (HAC 14.20) 529 // should reduce x and [all...] |
/external/webkit/PerformanceTests/SunSpider/tests/v8-v5/ |
H A D | v8-crypto.js | 6 * a copy of this software and associated documentation files (the 9 * distribute, sublicense, and/or sell copies of the Software, and to 13 * The above copyright notice and this permission notice shall be 29 * and disclaimer. 66 // am1: use a single mult and divide to get the high bits, 80 // am2 avoids a big mult-and-extract completely. 194 // (protected) set from string and radix 442 // (protected) divide this by m, quotient and remainder to q, r (HAC 14.20) 529 // should reduce x and [all...] |
/external/webkit/PerformanceTests/SunSpider/tests/v8-v6/ |
H A D | v8-crypto.js | 6 * a copy of this software and associated documentation files (the 9 * distribute, sublicense, and/or sell copies of the Software, and to 13 * The above copyright notice and this permission notice shall be 29 * and disclaimer. 66 // am1: use a single mult and divide to get the high bits, 80 // am2 avoids a big mult-and-extract completely. 194 // (protected) set from string and radix 442 // (protected) divide this by m, quotient and remainder to q, r (HAC 14.20) 529 // should reduce x and [all...] |
/external/v8/benchmarks/ |
H A D | crypto.js | 6 * a copy of this software and associated documentation files (the 9 * distribute, sublicense, and/or sell copies of the Software, and to 13 * The above copyright notice and this permission notice shall be 29 * and disclaimer. 74 // am1: use a single mult and divide to get the high bits, 88 // am2 avoids a big mult-and-extract completely. 202 // (protected) set from string and radix 450 // (protected) divide this by m, quotient and remainder to q, r (HAC 14.20) 537 // should reduce x and [all...] |
/external/proguard/lib/ |
H A D | proguard.jar | ... SHIFT_RIGHT public static final byte UNSIGNED_SHIFT_RIGHT public static final byte AND public static final byte OR public static final byte XOR ... |
/external/proguard/src/proguard/evaluation/value/ |
H A D | IntegerValue.java | 2 * ProGuard -- shrinking, optimization, obfuscation, and preverification 7 * This program is free software; you can redistribute it and/or modify it 82 * Returns the generalization of this IntegerValue and the given other 88 * Returns the sum of this IntegerValue and the given IntegerValue. 93 * Returns the difference of this IntegerValue and the given IntegerValue. 98 * Returns the difference of the given IntegerValue and this IntegerValue. 103 * Returns the product of this IntegerValue and the given IntegerValue. 109 * Returns the quotient of this IntegerValue and the given IntegerValue. 115 * Returns the quotient of the given IntegerValue and this IntegerValue. 182 * Returns the logical <i>and</ 185 public abstract IntegerValue and(IntegerValue other); method in class:IntegerValue 408 public IntegerValue and(UnknownIntegerValue other) method in class:IntegerValue 652 public IntegerValue and(SpecificIntegerValue other) method in class:IntegerValue 896 public IntegerValue and(ParticularIntegerValue other) method in class:IntegerValue [all...] |
H A D | LongValue.java | 2 * ProGuard -- shrinking, optimization, obfuscation, and preverification 7 * This program is free software; you can redistribute it and/or modify it 68 * Returns the generalization of this LongValue and the given other 77 * Returns the sum of this LongValue and the given LongValue. 85 * Returns the difference of this LongValue and the given LongValue. 93 * Returns the difference of the given LongValue and this LongValue. 101 * Returns the product of this LongValue and the given LongValue. 110 * Returns the quotient of this LongValue and the given LongValue. 119 * Returns the quotient of the given LongValue and this LongValue. 173 * Returns the logical <i>and</ 176 public LongValue and(LongValue other) method in class:LongValue 330 public LongValue and(SpecificLongValue other) method in class:LongValue 486 public LongValue and(ParticularLongValue other) method in class:LongValue [all...] |
H A D | ParticularIntegerValue.java | 2 * ProGuard -- shrinking, optimization, obfuscation, and preverification 7 * This program is free software; you can redistribute it and/or modify it 196 public IntegerValue and(IntegerValue other) method in class:ParticularIntegerValue 198 return other.and(this); 324 public IntegerValue and(ParticularIntegerValue other) method in class:ParticularIntegerValue
|
H A D | ParticularLongValue.java | 2 * ProGuard -- shrinking, optimization, obfuscation, and preverification 7 * This program is free software; you can redistribute it and/or modify it 139 public LongValue and(LongValue other) method in class:ParticularLongValue 141 return other.and(this); 227 public LongValue and(ParticularLongValue other) method in class:ParticularLongValue
|
H A D | SpecificIntegerValue.java | 2 * ProGuard -- shrinking, optimization, obfuscation, and preverification 7 * This program is free software; you can redistribute it and/or modify it 164 public IntegerValue and(IntegerValue other) method in class:SpecificIntegerValue 166 return other.and(this); 296 public IntegerValue and(SpecificIntegerValue other) method in class:SpecificIntegerValue
|
H A D | SpecificLongValue.java | 2 * ProGuard -- shrinking, optimization, obfuscation, and preverification 7 * This program is free software; you can redistribute it and/or modify it 119 public LongValue and(LongValue other) method in class:SpecificLongValue 121 return other.and(this); 211 public LongValue and(SpecificLongValue other) method in class:SpecificLongValue
|
H A D | UnknownIntegerValue.java | 2 * ProGuard -- shrinking, optimization, obfuscation, and preverification 7 * This program is free software; you can redistribute it and/or modify it 166 public IntegerValue and(IntegerValue other) method in class:UnknownIntegerValue
|
H A D | UnknownLongValue.java | 2 * ProGuard -- shrinking, optimization, obfuscation, and preverification 7 * This program is free software; you can redistribute it and/or modify it 120 public LongValue and(LongValue other) method in class:UnknownLongValue
|
/external/llvm/test/MC/ARM/ |
H A D | arm-arithmetic-aliases.s | 26 and r2, r2, #6 label 27 and r2, #6 label 28 and r2, r2, r3 label 29 and r2, r3 label 31 @ CHECK: and r2, r2, #6 @ encoding: [0x06,0x20,0x02,0xe2] 32 @ CHECK: and r2, r2, #6 @ encoding: [0x06,0x20,0x02,0xe2] 33 @ CHECK: and r2, r2, r3 @ encoding: [0x03,0x20,0x02,0xe0] 34 @ CHECK: and r2, r2, r3 @ encoding: [0x03,0x20,0x02,0xe0] 67 @ Also check that we handle the predicate and cc_out operands.
|
/external/libvorbis/doc/ |
H A D | 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 packet [all...] |
H A D | 02-bitpacking.tex | 10 bitstream in which bits are coded one-by-one by the encoder and then 19 \subsubsection{octets, bytes and words} 23 seven, ten, eleven and sixteen bit 'bytes' have been used. For 33 octet (eight bits) and a word to be a group of two, four or eight 56 which the lowest value byte comes first) and less commonly 3-1-2-0 and 59 The Vorbis bitpacking convention specifies storage and bitstream 63 Logically, bytes are always coded and decoded in order from byte zero 81 the next-least significant bit of the source integer and so on up to 84 byte and writin [all...] |
H A D | 03-codebook.tex | 4 \section{Probability Model and Codebooks} \label{vorbis:spec:codebook} 10 decoding configuration, VQ and Huffman, into the bitstream itself in 20 the codebooks themselves and the codewords they decode are unrolled 44 16 bit \varname{[codebook_dimensions]} and 24 bit \varname{[codebook_entries]} fields: 67 We now read the list of codeword lengths and store these lengths in 74 length ordered and the decoder needs to read each codeword length 122 2) [current_length] = read a five bit unsigned integer and add 1; 160 Lookup types one and two are similar, differing only in the 171 3) [codebook_value_bits] = read 4 bits as an unsigned integer and add 1 189 and indicate [all...] |
H A D | 04-codec.tex | 5 \section{Codec Setup and Packet Decode} \label{vorbis:spec:codec} 12 provided in \xref{vorbis:spec:intro}. \xref{vorbis:spec:bitpacking} covers reading and writing bit fields from 13 and to bitstream packets. 17 \subsection{Header decode and decode setup} 21 and the setup header. All are required for decode compliance. An 37 is type 1, the comment header type 3 and the setup header type 5 47 to declare the stream definitively as Vorbis, and provide a few externally 64 with this document. Both \varname{[audio_channels]} and 66 blocksize values are 64, 128, 256, 512, 1024, 2048, 4096 and 8192 in 78 \item Maximum and o [all...] |
H A D | 05-comment.tex | 4 \section{comment field and header specification} \label{vorbis:spec:comment} 12 greater structure and machine parseability. 16 remember the disc by and explain it to others; a short, to-the-point 22 Honest Bob and the Factory-to-Dealer-Incentives, \textit{``I'm Still 34 number of vectors is bounded to $2^{32}-1$ and the length of each vector 41 The vector lengths and number of vectors are stored lsb first, according 67 That is, comment fields consist of a field name and a corresponding value and 77 The field name is case-insensitive and may consist of ASCII 0x20 117 The artist(s) who performed the work. In classical music this would be the conductor, orchestra, soloists. In an audio book it would be the actor who did the reading. In popular music this is typically the same as the ARTIST and i [all...] |
H A D | 06-floor0.tex | 4 \section{Floor type 0 setup and decode} \label{vorbis:spec:floor0} 13 coding; LSP representation may be converted to LPC representation and 20 Floor zero configuration consists of six integer fields and a list of 36 6) [floor0_number_of_books] = read an unsigned integer of four bits and add 1 51 decoding the curve amplitude and \varname{[floor0_order]} LSP 52 coefficient values from the bitstream, and then computing the floor 86 1 ) bits. Nevertheless, the above specification is correct and values 93 \varname{[codebook_dimensions]} value of three and 97 condition, and care must be taken not to allow a buffer overflow in 98 decode. The extra values are not used and ma [all...] |
H A D | 07-floor1.tex | 4 \section{Floor type 1 setup and decode} \label{vorbis:spec:floor1} 10 mechanically on a linear frequency axis and a logarithmic (dB) 27 from x_0,y_0 to x_1,y_1 where in the base case x_0=0 and x_1=[n], the 31 logical line segment and produces a y_new value at that point computed 32 from the existing line's y value at x_new (as plotted by the line) and 36 x_0,y_0 to x_new,y_new and from x_new,y_new to x_1,y_1. This step is 53 0,16,32,48,64,80,96,112 and 128. In list order, the values interleave 54 as 0, 128, 64, 32, 96, 16, 48, 80 and 112. The corresponding 56 -45, 0, -25, -10, 30 and -10. We compute the floor in the following 64 We now draw new logical lines to reflect the correction to new_Y, and [all...] |
H A D | 08-residue.tex | 4 \section{Residue setup and decode} \label{vorbis:spec:residue} 10 curve and performs any channel coupling. A residue vector may 16 residue vectors into the bitstream packet, and then reconstructs the 18 variants (numbered 0, 1 and 2) of the same basic vector encoding 26 classifies each chunk, encodes the chunk classifications and finally 29 The exact interleaving and partitioning vary by residue encoding number, 30 however the high-level process used to classify and encode the residue 35 encoded and simply trusting that it is, is as follows: 40 \emph{n}, a partition size \emph{residue_partition_size}, and a total 79 Residue 0 and [all...] |
/external/junit/src/org/junit/internal/matchers/ |
H A D | CombinableMatcher.java | 26 public CombinableMatcher<T> and(Matcher<? extends T> matcher) { method in class:CombinableMatcher
|
/external/libpcap/ |
H A D | grammar.y | 6 * Redistribution and use in source and binary forms, with or without 8 * retain the above copyright notice and this paragraph in its entirety, (2) 9 * distributions including binary code include the above copyright notice and 11 * provided with the distribution, and (3) all advertising materials mentioning 14 * Lawrence Berkeley Laboratory and its contributors.'' Neither the name of 159 %type <blk> and or paren not null prog 219 | expr and term { gen_and($1.b, $3.b); $$ = $3; } 220 | expr and id { gen_and($1.b, $3.b); $$ = $3; } 224 and label [all...] |
/external/iproute2/doc/ |
H A D | api-ip6-flowlabels.tex | 24 prefer this term) and 20 bits of flow label. Currently there exist 56 Flows with coinciding source address and flow label must have identical 57 destination address and not-fragmentable extensions headers (i.e.\ 58 hop by hop options and all the headers up to and including routing header, 68 NB notes here and below reflect only my personal opinion, 74 Flow labels have finite lifetime and source is not allowed to reuse 100 It contradicts both to IETF spirit and the letter. Before RFC2553 109 and have to mangle it, even if we are not interested in flowinfo subtleties. 115 is followed by attempts to patch the hole and mor [all...] |