HomeSort by relevance Sort by last modified time
    Searched defs:blk (Results 26 - 50 of 88) sorted by null

12 3 4

  /external/e2fsprogs/misc/
e2freefrag.c 106 unsigned long long blk, num_blks; local
120 for (blk = 0; blk < num_blks; blk++, chunk_start_blk++) {
121 if (chunk_num == 0 && blk == 0) {
122 blk = fs->super->s_first_data_block;
123 chunk_start_blk = blk;
  /external/mesa3d/src/mesa/main/
texcompress_etc_tmp.h 120 int modifier, bit, idx, blk; local
128 blk = (block->flipped) ? (y >= 2) : (x >= 2);
130 base_color = block->base_colors[blk];
131 modifier = block->modifier_tables[blk][idx];
  /external/qemu/distrib/ext4_utils/src/
sha1.c 38 * blk0() and blk() perform the initial expand.
47 #define blk(i) (block->l[i&15] = rol(block->l[(i+13)&15]^block->l[(i+8)&15] \ macro
54 #define R1(v,w,x,y,z,i) z+=((w&(x^y))^y)+blk(i)+0x5A827999+rol(v,5);w=rol(w,30);
55 #define R2(v,w,x,y,z,i) z+=(w^x^y)+blk(i)+0x6ED9EBA1+rol(v,5);w=rol(w,30);
56 #define R3(v,w,x,y,z,i) z+=(((w|x)&y)|(w&x))+blk(i)+0x8F1BBCDC+rol(v,5);w=rol(w,30);
57 #define R4(v,w,x,y,z,i) z+=(w^x^y)+blk(i)+0xCA62C1D6+rol(v,5);w=rol(w,30);
  /external/valgrind/main/none/tests/
sha1_test.c 79 /* blk0() and blk() perform the initial expand. */
89 #define blk(i) (block->l[i&15] = rol(block->l[(i+13)&15]^block->l[(i+8)&15] \ macro
94 #define R1(v,w,x,y,z,i) z+=((w&(x^y))^y)+blk(i)+0x5A827999+rol(v,5);w=rol(w,30);
95 #define R2(v,w,x,y,z,i) z+=(w^x^y)+blk(i)+0x6ED9EBA1+rol(v,5);w=rol(w,30);
96 #define R3(v,w,x,y,z,i) z+=(((w|x)&y)|(w&x))+blk(i)+0x8F1BBCDC+rol(v,5);w=rol(w,30);
97 #define R4(v,w,x,y,z,i) z+=(w^x^y)+blk(i)+0xCA62C1D6+rol(v,5);w=rol(w,30);
  /external/wpa_supplicant_8/src/crypto/
sha1-internal.c 129 /* blk0() and blk() perform the initial expand. */
137 #define blk(i) (block->l[i & 15] = rol(block->l[(i + 13) & 15] ^ \ macro
145 z += ((w & (x ^ y)) ^ y) + blk(i) + 0x5A827999 + rol(v, 5); \
148 z += (w ^ x ^ y) + blk(i) + 0x6ED9EBA1 + rol(v, 5); w = rol(w, 30);
150 z += (((w | x) & y) | (w & x)) + blk(i) + 0x8F1BBCDC + rol(v, 5); \
153 z += (w ^ x ^ y) + blk(i) + 0xCA62C1D6 + rol(v, 5); \
  /system/extras/ext4_utils/
sha1.c 38 * blk0() and blk() perform the initial expand.
47 #define blk(i) (block->l[i&15] = rol(block->l[(i+13)&15]^block->l[(i+8)&15] \ macro
54 #define R1(v,w,x,y,z,i) z+=((w&(x^y))^y)+blk(i)+0x5A827999+rol(v,5);w=rol(w,30);
55 #define R2(v,w,x,y,z,i) z+=(w^x^y)+blk(i)+0x6ED9EBA1+rol(v,5);w=rol(w,30);
56 #define R3(v,w,x,y,z,i) z+=(((w|x)&y)|(w&x))+blk(i)+0x8F1BBCDC+rol(v,5);w=rol(w,30);
57 #define R4(v,w,x,y,z,i) z+=(w^x^y)+blk(i)+0xCA62C1D6+rol(v,5);w=rol(w,30);
  /dalvik/libdex/
sha1.cpp 113 /* blk0() and blk() perform the initial expand. */
122 #define blk(i) (block->l[i&15] = rol(block->l[(i+13)&15]^block->l[(i+8)&15] \ macro
127 #define R1(v,w,x,y,z,i) z+=((w&(x^y))^y)+blk(i)+0x5A827999+rol(v,5);w=rol(w,30);
128 #define R2(v,w,x,y,z,i) z+=(w^x^y)+blk(i)+0x6ED9EBA1+rol(v,5);w=rol(w,30);
129 #define R3(v,w,x,y,z,i) z+=(((w|x)&y)|(w&x))+blk(i)+0x8F1BBCDC+rol(v,5);w=rol(w,30);
130 #define R4(v,w,x,y,z,i) z+=(w^x^y)+blk(i)+0xCA62C1D6+rol(v,5);w=rol(w,30);
  /external/bluetooth/bluedroid/embdrv/sbc/decoder/srce/
synthesis-sbc.c 260 OI_UINT blk; local
268 for (blk = blkstart; blk < blkstop; blk++) {
291 OI_UINT blk; local
299 for (blk = blkstart; blk < blkstop; blk++) {
325 OI_UINT blk; local
333 for (blk = blkstart; blk < blkstop; blk++)
    [all...]
  /external/chromium_org/third_party/libwebp/enc/
iterator.c 428 const uint8_t* const blk = yuv_out + VP8Scan[it->i4_]; local
434 top[-4 + i] = blk[i + 3 * BPS]; // store future top samples
438 top[i] = blk[3 + (2 - i) * BPS];
  /external/e2fsprogs/debugfs/
extent_inode.c 511 blk64_t blk; local
518 if (strtoblk(argv[0], argv[1], &blk))
527 retval = ext2fs_extent_goto2(current_handle, level, (blk64_t) blk);
532 (unsigned long long) blk, level);
util.c 307 blk64_t blk; local
310 blk = parse_ulonglong(str, cmd, "block number", &err);
311 *ret = blk;
  /external/e2fsprogs/e2fsck/
ea_refcount.c 113 blk64_t blk, int pos)
144 el->ea_blk = blk;
155 blk64_t blk, int create)
165 (blk > refcount->list[high].ea_blk))) {
169 return insert_refcount_el(refcount, blk,
177 if (blk == refcount->list[refcount->cursor].ea_blk)
180 printf("Non-cursor get_refcount_el: %u\n", blk);
184 if (blk == refcount->list[mid].ea_blk) {
188 if (blk < refcount->list[mid].ea_blk)
203 return insert_refcount_el(refcount, blk, low)
373 blk64_t blk; local
    [all...]
pass3.c 146 blk64_t blk; local
178 pctx.errcode = ext2fs_new_block2(fs, 0, ctx->block_found_map, &blk);
185 ext2fs_mark_block_bitmap2(ctx->block_found_map, blk);
186 ext2fs_mark_block_bitmap2(fs->block_map, blk);
201 pctx.errcode = ext2fs_write_dir_block3(fs, blk, block, 0);
219 inode.i_block[0] = blk;
360 blk64_t blk; local
414 retval = ext2fs_new_block2(fs, 0, ctx->block_found_map, &blk);
420 ext2fs_mark_block_bitmap2(ctx->block_found_map, blk);
421 ext2fs_block_alloc_stats2(fs, blk, +1)
    [all...]
pass5.c 105 blk64_t blk, num; local
141 blk = DIV_ROUND_UP(start,
143 count -= (blk * EXT2_INODES_PER_BLOCK(fs->super) - start);
144 blk += ext2fs_inode_table_loc(fs, group);
148 e2fsck_discard_blocks(ctx, blk, num);
158 if (pctx->blk == pctx->blk2)
164 if (pctx->blk == pctx->blk2)
183 pctx->blk = pctx->blk2 = NO_BLK;
231 pctx.blk = B2C(fs->super->s_first_data_block);
246 pctx.blk = B2C(fs->super->s_first_data_block)
    [all...]
  /external/e2fsprogs/lib/ext2fs/
blknum.c 19 dgrp_t ext2fs_group_of_blk2(ext2_filsys fs, blk64_t blk)
21 return (blk - fs->super->s_first_data_block) /
102 void ext2fs_blocks_count_set(struct ext2_super_block *super, blk64_t blk)
104 super->s_blocks_count = blk;
106 super->s_blocks_count_hi = (__u64) blk >> 32;
112 void ext2fs_blocks_count_add(struct ext2_super_block *super, blk64_t blk)
115 tmp = ext2fs_blocks_count(super) + blk;
132 void ext2fs_r_blocks_count_set(struct ext2_super_block *super, blk64_t blk)
134 super->s_r_blocks_count = blk;
136 super->s_r_blocks_count_hi = (__u64) blk >> 32
477 blk64_t blk = inode->i_file_acl; local
    [all...]
block.c 393 blk64_t blk, new_blk; local
415 blk = 0;
416 r = (*ctx.func)(fs, &blk, blockcnt,
425 (blk64_t) blk, 0);
428 if (blk)
435 blk = extent.e_pblk;
445 ret |= (*ctx.func)(fs, &blk,
448 extent.e_pblk = blk;
479 blk += j;
482 blk++, blockcnt++, j++)
    [all...]
fileio.c 403 blk64_t blk; local
416 offset / fs->blocksize, &ret_flags, &blk);
419 if ((blk == 0) || (ret_flags & BMAP_RET_UNINIT))
428 retval = io_channel_read_blk64(fs->io, blk, 1, b);
434 retval = io_channel_write_blk64(fs->io, blk, 1, b);
gen_bitmap64.c 812 blk_t blk = 0; local
822 end, &blk);
824 *out = blk;
inode.c 274 blk64_t blk = scan->current_block; local
281 if (blk == 0)
290 while (blk > bb->list[scan->bad_block_ptr]) {
305 if (blk == bb->list[scan->bad_block_ptr]) {
319 if ((blk + *num_blocks) > bb->list[scan->bad_block_ptr])
320 *num_blocks = (int) (bb->list[scan->bad_block_ptr] - blk);
  /external/e2fsprogs/lib/quota/
quotaio_tree.c 61 static void read_blk(struct quota_handle *h, uint blk, dqbuf_t buf)
65 err = h->e2fs_read(&h->qh_qf, blk << QT_BLKSIZE_BITS, buf,
68 log_err("Cannot read block %u: %s", blk, strerror(errno));
74 static int write_blk(struct quota_handle *h, uint blk, dqbuf_t buf)
78 err = h->e2fs_write(&h->qh_qf, blk << QT_BLKSIZE_BITS, buf,
81 log_err("Cannot write block (%u): %s", blk, strerror(errno));
93 int blk; local
99 blk = info->dqi_free_blk;
100 read_blk(h, blk, buf);
111 blk = info->dqi_blocks++
193 int blk, i; local
    [all...]
  /external/e2fsprogs/tests/progs/
test_rel.c 55 const char *str, blk_t *blk)
59 *blk = strtoul(str, &tmp, 0);
218 blk_t blk; local
226 if (parse_block(argv[0], "block", argv[1], &blk))
228 retval = ext2fs_brel_get(brel, blk, &ent);
233 display_brel_entry(blk, &ent);
256 blk_t blk; local
261 retval = ext2fs_brel_next(brel, &blk, &ent);
266 if (blk == 0) {
270 display_brel_entry(blk, &ent)
278 blk_t blk; local
332 blk_t blk; local
    [all...]
  /external/webp/src/enc/
iterator.c 428 const uint8_t* const blk = yuv_out + VP8Scan[it->i4_]; local
434 top[-4 + i] = blk[i + 3 * BPS]; // store future top samples
438 top[i] = blk[3 + (2 - i) * BPS];
  /external/yaffs2/yaffs2/direct/
yaffs_fileem2k.c 108 int blk; local
127 for(i = 0,blk = 0; blk < filedisk.nBlocks; blk+=BLOCKS_PER_HANDLE,i++)
yaffs_ramem2k.c 93 nandemul_Block *blk; local
100 blk = ned.block[blockNumber];
104 memset(blk->page[i],0xff,sizeof(nandemul_Page));
105 blk->page[i]->empty = 1;
149 nandemul_Block *blk; local
151 if(!(blk = ned.block[i] = YMALLOC(sizeof(nandemul_Block))))
159 if((blk->page[j] = YMALLOC(sizeof(nandemul_Page))) == 0)
194 int blk; local
201 blk = chunkInNAND/PAGES_PER_BLOCK;
207 x = ned.block[blk]->page[pg]->data
237 int blk; local
267 int blk; local
    [all...]
  /frameworks/compile/libbcc/lib/Support/
sha1.c 111 /* blk0() and blk() perform the initial expand. */
120 #define blk(i) (block->l[i&15] = rol(block->l[(i+13)&15]^block->l[(i+8)&15] \ macro
125 #define R1(v,w,x,y,z,i) z+=((w&(x^y))^y)+blk(i)+0x5A827999+rol(v,5);w=rol(w,30);
126 #define R2(v,w,x,y,z,i) z+=(w^x^y)+blk(i)+0x6ED9EBA1+rol(v,5);w=rol(w,30);
127 #define R3(v,w,x,y,z,i) z+=(((w|x)&y)|(w&x))+blk(i)+0x8F1BBCDC+rol(v,5);w=rol(w,30);
128 #define R4(v,w,x,y,z,i) z+=(w^x^y)+blk(i)+0xCA62C1D6+rol(v,5);w=rol(w,30);

Completed in 710 milliseconds

12 3 4