HomeSort by relevance Sort by last modified time
    Searched refs:blks (Results 1 - 14 of 14) sorted by null

  /frameworks/av/media/libstagefright/codecs/m4v_h263/dec/src/
deringing_luma.cpp 41 int thr, blks, incr; local
56 blks = 0;
65 thres[blks] = (max_blk + min_blk + 1) >> 1;
66 range[blks] = max_blk - min_blk;
68 if (range[blks] >= max_range_blk)
70 max_range_blk = range[blks];
71 max_thres_blk = thres[blks];
73 blks++;
77 blks = 0;
86 if (range[blks]<32 && max_range_blk >= 64
    [all...]
  /external/llvm/lib/CodeGen/
PrologEpilogInserter.h 115 SmallVectorImpl<MachineBasicBlock *> &blks);
116 bool addUsesForTopLevelLoops(SmallVectorImpl<MachineBasicBlock *> &blks);
118 SmallVectorImpl<MachineBasicBlock *> &blks,
121 SmallVectorImpl<MachineBasicBlock *> &blks,
ShrinkWrapping.cpp 557 SmallVectorImpl<MachineBasicBlock *> &blks) {
603 blks.push_back(SUCC);
619 blks.push_back(PRED);
632 bool PEI::addUsesForTopLevelLoops(SmallVectorImpl<MachineBasicBlock *> &blks) {
663 blks.push_back(EXB);
677 SmallVectorImpl<MachineBasicBlock *> &blks,
723 blks.push_back(MBB);
739 SmallVectorImpl<MachineBasicBlock *> &blks,
784 blks.push_back(MBB);
    [all...]
  /external/chromium_org/v8/test/webkit/fast/js/kde/
md5-2.js 210 var blks = new Array(nblk * 16)
211 for(var i = 0; i < nblk * 16; i++) blks[i] = 0
213 blks[i>>2] |= (str.charCodeAt(i) & 0xFF) << ((i%4) * 8)
214 blks[i>>2] |= 0x80 << ((i%4) * 8)
215 blks[nblk*16-2] = str.length * 8
216 return blks
226 var blks = new Array(nblk * 16)
227 for(var i = 0; i < nblk * 16; i++) blks[i] = 0
229 blks[i>>1] |= str.charCodeAt(i) << ((i%2) * 16)
230 blks[i>>1] |= 0x80 << ((i%2) * 16
    [all...]
  /external/blktrace/btt/
output.c 185 blks_avg = (double)dip->avgs.blks.total / d2c_n;
192 (unsigned long long)dip->avgs.blks.min,
194 (unsigned long long)dip->avgs.blks.max,
195 (unsigned long long)dip->avgs.blks.total);
204 (unsigned long long)dip->avgs.blks.min,
206 (unsigned long long)dip->avgs.blks.max,
207 (unsigned long long)dip->avgs.blks.total);
211 merge_data.blkmin = dip->avgs.blks.min;
212 merge_data.blkmax = dip->avgs.blks.max;
217 merge_data.total += dip->avgs.blks.total
    [all...]
inlines.h 279 avg_update(&all_avgs.blks, nblks);
280 avg_update(&iop->dip->avgs.blks, nblks);
282 avg_update(&iop->pip->avgs.blks, nblks);
globals.h 31 * 1 == 2 blks
33 * 1022 == 1023 blks
34 * 1023 == 1024 blks
35 * 1024 == > 1024 blks
97 struct avg_info blks; /* Blocks transferred */ member in struct:avgs_info
  /external/grub/stage2/
fs.h 173 int fs_maxcontig; /* max number of contiguous blks */
174 int fs_maxbpg; /* max number of blks per cyl group */
415 #define blkstofrags(fs, blks) /* calculates (blks * fs->fs_frag) */ \
416 ((blks) << (fs)->fs_fragshift)
ufs2.h 270 grub_int32_t fs_maxcontig; /* max number of contiguous blks */
271 grub_int32_t fs_maxbpg; /* max number of blks per cyl group */
400 #define blkstofrags(fs, blks) /* calculates (blks * fs->fs_frag) */ \
401 ((blks) << (fs)->fs_fragshift)
  /prebuilts/gcc/linux-x86/host/i686-linux-glibc2.7-4.4.3/sysroot/usr/include/linux/
ufs_fs.h 248 #define ufs_blkstofrags(blks) ((blks) << uspi->s_fpbshift)
363 __fs32 fs_maxcontig; /* max number of contiguous blks */
364 __fs32 fs_maxbpg; /* max number of blks per cyl group */
    [all...]
  /prebuilts/gcc/linux-x86/host/i686-linux-glibc2.7-4.6/sysroot/usr/include/linux/
ufs_fs.h 248 #define ufs_blkstofrags(blks) ((blks) << uspi->s_fpbshift)
363 __fs32 fs_maxcontig; /* max number of contiguous blks */
364 __fs32 fs_maxbpg; /* max number of blks per cyl group */
    [all...]
  /prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.7-4.6/sysroot/usr/include/linux/
ufs_fs.h 248 #define ufs_blkstofrags(blks) ((blks) << uspi->s_fpbshift)
363 __fs32 fs_maxcontig; /* max number of contiguous blks */
364 __fs32 fs_maxbpg; /* max number of blks per cyl group */
    [all...]
  /external/chromium_org/third_party/mesa/src/src/gallium/drivers/radeon/
AMDILCFGStructurizer.cpp     [all...]
  /external/mesa3d/src/gallium/drivers/radeon/
AMDILCFGStructurizer.cpp     [all...]

Completed in 973 milliseconds