| /frameworks/base/media/libstagefright/codecs/amrnb/dec/src/ |
| d4_17pf.cpp | 121 index -- Word16 -- Positions of the 3 pulses.
178 Word16 index, /* i : Positions of the 4 pulses. */
188 * positions 0-2, with 4 bits allocated for position 3.
197 /* Decode the positions */
|
| /frameworks/base/media/libstagefright/codecs/amrwbenc/inc/ |
| basic_op.h | 188 | Arithmetically shift the 16 bit input var1 left var2 positions.Zero fill|
248 | Arithmetically shift the 16 bit input var1 right var2 positions with |
[all...] |
| /frameworks/base/media/libstagefright/codecs/m4v_h263/dec/src/ |
| post_proc_semaphore.cpp | 65 3. If any non-zero elements exist in positions other than q_block[0],
167 /* positions other than q_block[0], q_block[1] or */
199 /* positions other than q_block[0], q_block[1] or */
226 /* positions other than q_block[0], q_block[1] or */
|
| /prebuilt/darwin-x86/sdl/include/SDL/ |
| SDL_joystick.h | 126 * The return value is one of the following positions:
|
| /prebuilt/linux-x86/sdl/include/SDL/ |
| SDL_joystick.h | 126 * The return value is one of the following positions:
|
| /prebuilt/linux-x86/toolchain/i686-linux-glibc2.7-4.4.3/i686-linux/include/c++/4.4.3/parallel/ |
| unique_copy.h | 125 // Store result in output on calculated positions.
|
| /prebuilt/windows/sdl/host/include/SDL/ |
| SDL_joystick.h | 130 * The return value is one of the following positions:
|
| /prebuilt/windows/sdl/include/SDL/ |
| SDL_joystick.h | 126 * The return value is one of the following positions:
|
| /frameworks/base/media/libstagefright/codecs/amrnb/enc/src/ |
| c3_14pf.cpp | 157 Pulse i0 can have 8 possible positions, pulses i1 and i2 can have
158 2x8=16 positions.
336 PURPOSE: Search the best codevector; determine positions of the 3 pulses
434 * i0 loop: try 8 positions. *
448 * i1 loop: 8 positions. *
503 * i2 loop: 8 positions. *
629 codevector, based on the signs and positions of 3 pulses.
|
| c1035pf.cpp | 249 codevector, based on the signs and positions of 10 pulses.
565 The 40 positions in a subframe are divided into 5 tracks of
566 interleaved positions. Each track contains two pulses.
567 The pulses can have the following possible positions:
576 positions (3 bits + 3 bits). This results in a 35 bit codebook.
577 The function determines the optimal pulse signs and positions, builds
|
| c4_17pf.cpp | 167 Pulse i0 to i2 can have 8 possible positions, pulse i3 can have
168 2x8=16 positions.
348 PURPOSE: Search the best codevector; determine positions of the 4 pulses
448 * i0 loop: try 4 positions (use position with max of corr.). *
460 * i1 loop: 8 positions. *
513 * i2 loop: 8 positions. *
571 * i3 loop: 8 positions. *
699 codevector, based on the signs and positions of 4 pulses.
|
| /external/webkit/WebCore/dom/ |
| Position.cpp | 316 // positions are both non editable.
453 // upstream() and downstream() want to return positions that are either in a
470 // Also, upstream() will return [boundary, 0] for any of the positions from [boundary, 0] to the first candidate
591 // Also, downstream() will return the last position in the last atomic node in boundary for all of the positions
633 // positions will be [boundary->parentNode(), originalBlock->nodeIndex() + 1].
[all...] |
| /prebuilt/linux-x86/toolchain/i686-linux-glibc2.7-4.4.3/sysroot/usr/include/linux/ |
| ufs_fs.h | 475 __fs32 fs_nrpos; /* number of rotational positions */
536 __fs32 cg_boff; /* (short) free block positions */
578 __fs16 cg_b[32][8]; /* positions of free blocks */
703 __u32 c_boff; /* (short) free block positions */
759 __s32 s_nrpos; /* number of rotational positions */
[all...] |
| /libcore/luni/src/main/java/java/util/ |
| DualPivotQuicksort.java | 159 * the pivots are swapped back into their final positions, and
270 // Swap pivots into their final positions
437 * the pivots are swapped back into their final positions, and
548 // Swap pivots into their final positions
732 * the pivots are swapped back into their final positions, and
[all...] |
| /external/icu4c/i18n/unicode/ |
| numfmt.h | 269 * @param posIter On return, can be used to iterate over positions
374 * @param posIter On return, can be used to iterate over positions
408 * @param posIter On return, can be used to iterate over positions
442 * @param posIter On return, can be used to iterate over positions
463 * @param posIter On return, can be used to iterate over positions
486 * @param posIter On return, can be used to iterate over positions
[all...] |
| /external/webkit/WebCore/editing/ |
| ReplaceSelectionCommand.cpp | 710 // FIXME: Maintain positions for the start and end of inserted content instead of keeping nodes. The nodes are
711 // only ever used to create positions where inserted content starts/ends. Also, we sometimes insert content
[all...] |
| /external/guava/src/com/google/common/base/ |
| Splitter.java | 167 positions:
172 continue positions;
|
| /external/v8/test/mjsunit/ |
| debug-sourceinfo.js | 102 // Test that when running through source positions the position, line and
130 // positions and find the right line # for each.
|
| /frameworks/base/docs/html/guide/topics/ui/ |
| index.jd | 67 overlap positions, the last one to be drawn will lie on top of others previously drawn to that space.</p>
121 positions of child views and layout structure.</p>
|
| layout-objects.jd | 92 <p>{@link android.widget.TableLayout} positions its children into rows
209 relative layout positions — their values must be the ID of the element to which you'd like this view laid relative.
|
| /frameworks/base/media/libstagefright/codecs/amrwbenc/src/ |
| c2t64fx.c | 39 * 2 tracks x 32 positions per track = 64 samples. *
44 * Each pulse can have 32 possible positions. *
|
| /libcore/luni/src/main/java/org/apache/xpath/ |
| VariableStack.java | 101 * The stack of frame positions. I call 'em links because of distant
164 // Adding one here to the stack of frame positions will allow us always
|
| /cts/tools/dasm/src/java_cup/ |
| production.java | 287 * @param label_map a hash table mapping labels to positions in the RHS.
293 Hashtable label_map, /* map from labels to positions in the RHS */
348 * @param label_map a hash table mapping labels to positions in the RHS.
354 Hashtable label_map, /* map from labels to RHS positions */
|
| /cts/tools/dx-tests/scripts/ |
| collect_dasm_files.sh | 91 OUT=`dx --dex --no-optimize --positions=lines --output="/tmp/dxclasses.jar" ${jtestclassfile} 2>&1`
|
| /external/bison/src/ |
| state.h | 30 particular positions in particular rules -- that are the possible
|
