Searched defs:blocks (Results 51 - 75 of 164) sorted by relevance

1234567

/external/chromium_org/third_party/openssl/openssl/crypto/evp/
H A De_rc4_hmac_md5.c81 MD5_CTX *ctx,const void *inp,size_t blocks);
123 blocks; local
137 if (plen>md5_off && (blocks=(plen-md5_off)/MD5_CBLOCK) &&
143 &key->md,in+md5_off,blocks);
144 blocks *= MD5_CBLOCK;
145 rc4_off += blocks;
146 md5_off += blocks;
147 key->md.Nh += blocks>>29;
148 key->md.Nl += blocks<<=3;
149 if (key->md.Nl<(unsigned int)blocks) ke
[all...]
H A De_aes_cbc_hmac_sha1.c111 void aesni_cbc_sha1_enc (const void *inp, void *out, size_t blocks,
189 blocks; local
207 if (plen>(sha_off+iv) && (blocks=(plen-(sha_off+iv))/SHA_CBLOCK)) {
210 aesni_cbc_sha1_enc(in,out,blocks,&key->ks,
212 blocks *= SHA_CBLOCK;
213 aes_off += blocks;
214 sha_off += blocks;
215 key->md.Nh += blocks>>29;
216 key->md.Nl += blocks<<=3;
217 if (key->md.Nl<(unsigned int)blocks) ke
[all...]
/external/chromium_org/third_party/smhasher/src/
H A DMurmurHash3.cpp108 const uint32_t * blocks = (const uint32_t *)(data + nblocks*4); local
112 uint32_t k1 = getblock32(blocks,i);
169 const uint32_t * blocks = (const uint32_t *)(data + nblocks*16); local
173 uint32_t k1 = getblock32(blocks,i*4+0);
174 uint32_t k2 = getblock32(blocks,i*4+1);
175 uint32_t k3 = getblock32(blocks,i*4+2);
176 uint32_t k4 = getblock32(blocks,i*4+3);
270 const uint64_t * blocks = (const uint64_t *)(data); local
274 uint64_t k1 = getblock64(blocks,i*2+0);
275 uint64_t k2 = getblock64(blocks,
[all...]
H A DKeysetTest.h25 // Keyset 'Combination' - all possible combinations of input blocks
29 uint32_t * blocks, int blockcount,
36 key[len] = blocks[i];
47 CombinationKeygenRecurse(key,len+1,maxlen,blocks,blockcount,hash,hashes);
53 bool CombinationKeyTest ( hashfunc<hashtype> hash, int maxlen, uint32_t * blocks, int blockcount, bool testColl, bool testDist, bool drawDiagram ) argument
55 printf("Keyset 'Combination' - up to %d blocks from a set of %d - ",maxlen,blockcount);
63 CombinationKeygenRecurse<hashtype>(key,0,maxlen,blocks,blockcount,hash,hashes);
81 // Keyset 'Permutation' - given a set of 32-bit blocks, generate keys
82 // consisting of all possible permutations of those blocks
85 void PermutationKeygenRecurse ( pfHash hash, uint32_t * blocks, in argument
28 CombinationKeygenRecurse( uint32_t * key, int len, int maxlen, uint32_t * blocks, int blockcount, pfHash hash, std::vector<hashtype> & hashes ) argument
109 PermutationKeyTest( hashfunc<hashtype> hash, uint32_t * blocks, int blockcount, bool testColl, bool testDist, bool drawDiagram ) argument
[all...]
H A Dmain.cpp315 // Keyset 'Permutation' - all possible combinations of a set of blocks
327 uint32_t blocks[] = local
334 result &= CombinationKeyTest<hashtype>(hash,8,blocks,sizeof(blocks) / sizeof(uint32_t),true,true,drawDiagram);
346 uint32_t blocks[] = local
353 result &= CombinationKeyTest<hashtype>(hash,8,blocks,sizeof(blocks) / sizeof(uint32_t),true,true,drawDiagram);
365 uint32_t blocks[] = local
372 result &= CombinationKeyTest<hashtype>(hash,20,blocks,sizeof(blocks) / sizeo
384 uint32_t blocks[] = local
403 uint32_t blocks[] = local
[all...]
/external/dexmaker/src/dx/java/com/android/dx/ssa/
H A DDominators.java50 /* Method's basic blocks. */
51 private final ArrayList<SsaBasicBlock> blocks; field in class:Dominators
73 this.blocks = meth.getBlocks();
74 this.info = new DFSInfo[blocks.size() + 2];
180 * First we perform a DFS numbering of the blocks, by
199 SsaBasicBlock predBlock = blocks.get(j);
/external/freetype/src/gzip/
H A Dinflate.c20 BLOCKS, /* decompressing blocks */
49 *blocks; /* current inflate_blocks state */ member in struct:internal_state
62 inflate_blocks_reset(z->state->blocks, z, Z_NULL);
73 if (z->state->blocks != Z_NULL)
74 inflate_blocks_free(z->state->blocks, z);
105 z->state->blocks = Z_NULL;
124 if ((z->state->blocks =
218 r = inflate_blocks(z->state->blocks, z, r);
230 inflate_blocks_reset(z->state->blocks, z, &z->state->sub.check.was);
/external/javassist/src/main/javassist/bytecode/stackmap/
H A DLiveness.java34 public void compute(CodeIterator ci, TypedBlock[] blocks, int maxLocals, argument
38 computeUsage(ci, blocks, maxLocals);
40 useAllArgs(blocks, args);
42 computeLiveness1(blocks[0]);
43 while (hasChanged(blocks))
44 computeLiveness2(blocks[0]);
47 private void useAllArgs(TypedBlock[] blocks, TypeData[] args) { argument
48 for (int k = 0; k < blocks.length; k++) {
49 byte[] usage = blocks[k].localsUsage;
192 private boolean hasChanged(TypedBlock[] blocks) { argument
208 computeUsage(CodeIterator ci, TypedBlock[] blocks, int maxLocals) argument
[all...]
H A DBasicBlock.java41 public static BasicBlock find(BasicBlock[] blocks, int pos) argument
44 for (int i = 0; i < blocks.length; i++) {
45 int iPos = blocks[i].position;
46 if (iPos <= pos && pos < iPos + blocks[i].length)
47 return blocks[i];
312 ArrayList blocks = new ArrayList();
320 blocks.add(prev);
329 blocks.add(prev);
355 blocks.add(bb);
360 return (BasicBlock[])blocks
374 addCatchers(BasicBlock[] blocks, ExceptionTable et) argument
[all...]
H A DMapMaker.java71 TypedBlock[] blocks = TypedBlock.makeBlocks(minfo, ca, false);
73 mm.make(blocks, ca.getCode());
74 for (int i = 0; i < blocks.length; i++)
75 System.out.println(blocks[i]);
91 TypedBlock[] blocks = TypedBlock.makeBlocks(minfo, ca, true);
92 if (blocks == null)
96 mm.make(blocks, ca.getCode());
97 return mm.toStackMap(blocks);
112 TypedBlock[] blocks = TypedBlock.makeBlocks(minfo, ca, true);
113 if (blocks
134 make(TypedBlock[] blocks, byte[] code) argument
306 toStackMap(TypedBlock[] blocks) argument
468 toStackMap2(ConstPool cp, TypedBlock[] blocks) argument
[all...]
/external/jemalloc/include/jemalloc/internal/
H A Dhash.h100 const uint32_t *blocks = (const uint32_t *) (data + nblocks*4); local
104 uint32_t k1 = hash_get_block_32(blocks, i);
157 const uint32_t *blocks = (const uint32_t *) (data + nblocks*16); local
161 uint32_t k1 = hash_get_block_32(blocks, i*4 + 0);
162 uint32_t k2 = hash_get_block_32(blocks, i*4 + 1);
163 uint32_t k3 = hash_get_block_32(blocks, i*4 + 2);
164 uint32_t k4 = hash_get_block_32(blocks, i*4 + 3);
255 const uint64_t *blocks = (const uint64_t *) (data); local
259 uint64_t k1 = hash_get_block_64(blocks, i*2 + 0);
260 uint64_t k2 = hash_get_block_64(blocks,
[all...]
/external/kernel-headers/original/uapi/linux/
H A Dcramfs_fs.h47 __u32 blocks; member in struct:cramfs_info
/external/openssl/crypto/evp/
H A De_rc4_hmac_md5.c81 MD5_CTX *ctx,const void *inp,size_t blocks);
123 blocks; local
137 if (plen>md5_off && (blocks=(plen-md5_off)/MD5_CBLOCK) &&
143 &key->md,in+md5_off,blocks);
144 blocks *= MD5_CBLOCK;
145 rc4_off += blocks;
146 md5_off += blocks;
147 key->md.Nh += blocks>>29;
148 key->md.Nl += blocks<<=3;
149 if (key->md.Nl<(unsigned int)blocks) ke
[all...]
/external/wpa_supplicant_8/hostapd/src/crypto/
H A Dcrypto_internal-cipher.c106 size_t i, j, blocks; local
119 blocks = len / AES_BLOCK_SIZE;
120 for (i = 0; i < blocks; i++) {
133 blocks = len / 8;
134 for (i = 0; i < blocks; i++) {
147 blocks = len / 8;
148 for (i = 0; i < blocks; i++) {
169 size_t i, j, blocks; local
183 blocks = len / AES_BLOCK_SIZE;
184 for (i = 0; i < blocks;
[all...]
/external/wpa_supplicant_8/src/crypto/
H A Dcrypto_internal-cipher.c106 size_t i, j, blocks; local
119 blocks = len / AES_BLOCK_SIZE;
120 for (i = 0; i < blocks; i++) {
133 blocks = len / 8;
134 for (i = 0; i < blocks; i++) {
147 blocks = len / 8;
148 for (i = 0; i < blocks; i++) {
169 size_t i, j, blocks; local
183 blocks = len / AES_BLOCK_SIZE;
184 for (i = 0; i < blocks;
[all...]
/external/wpa_supplicant_8/wpa_supplicant/src/crypto/
H A Dcrypto_internal-cipher.c106 size_t i, j, blocks; local
119 blocks = len / AES_BLOCK_SIZE;
120 for (i = 0; i < blocks; i++) {
133 blocks = len / 8;
134 for (i = 0; i < blocks; i++) {
147 blocks = len / 8;
148 for (i = 0; i < blocks; i++) {
169 size_t i, j, blocks; local
183 blocks = len / AES_BLOCK_SIZE;
184 for (i = 0; i < blocks;
[all...]
/external/bluetooth/bluedroid/embdrv/sbc/decoder/srce/
H A Ddecoder-sbc.c369 OI_UINT8 blocks; local
385 subbands = mode = blocks = frameData[1];;
387 blocks = block_values[(blocks & (BIT5 | BIT4)) >> 4];
391 frameLen = blocks * frameData[2];
/external/chromium_org/sandbox/linux/seccomp-bpf/
H A Dcodegen_unittest.cc33 TargetsToBlocks* blocks) {
34 return CodeGen::CutGraphIntoBasicBlocks(insns, branch_targets, blocks);
37 void MergeTails(TargetsToBlocks* blocks) { CodeGen::MergeTails(blocks); } argument
146 // The two "LOAD 0" instructions are blocks of their own. MergeTails() could
149 // blocks.
208 // In PointerCompare(), this exercises the path where two blocks are of the
210 // following blocks don't need to be looked at and the blocks are mergeable.
337 // Basic blocks ar
31 CutGraphIntoBasicBlocks(Instruction* insns, const BranchTargets& branch_targets, TargetsToBlocks* blocks) argument
[all...]
/external/chromium_org/third_party/mesa/src/src/gallium/state_trackers/xvmc/tests/
H A Dtest_rendering.c149 short *blocks; local
189 blocks = block_array.blocks;
220 blocks,
227 blocks += BLOCK_SIZE;
237 blocks,
244 blocks += BLOCK_SIZE;
248 blocks,
255 blocks += BLOCK_SIZE;
/external/chromium_org/third_party/openssl/openssl/crypto/modes/
H A Dmodes_lcl.h127 u64 blocks; member in struct:ccm128_context
/external/chromium_org/third_party/openssl/openssl/crypto/poly1305/
H A Dpoly1305_arm.c65 #define blocks openssl_poly1305_neon2_blocks macro
69 extern int blocks(fe1305x2 *h, const fe1305x2 *precomp, const unsigned char *in, unsigned int inlen);
268 tlen -= blocks(h, precomp, in, tlen);
/external/e2fsprogs/e2fsck/
H A Dpass5.c138 * We can discard only blocks containing only unused
199 unsigned int blocks = 0; local
355 * When the compare data blocks in block bitmap
367 blocks = fs->super->s_clusters_per_group - 1;
441 blocks ++;
442 if ((blocks == fs->super->s_clusters_per_group) ||
457 blocks = 0;
493 blocks = 0; free_blocks = 0; group_free = 0; group = 0;
/external/e2fsprogs/lib/ext2fs/
H A Dtst_bitmaps.c152 unsigned int blocks, unsigned int inodes,
159 ext2fs_blocks_count_set(&param, blocks);
196 unsigned int blocks = 128; local
210 blocks = parse_ulong(optarg, argv[0],
211 "number of blocks", &err);
217 "number of blocks", &err);
231 fprintf(stderr, "%s: usage: setup [-b blocks] "
236 setup_filesystem(argv[0], blocks, inodes, type, flags);
319 printf("Marking blocks %u to %u\n", block, block + num - 1);
357 printf("Clearing blocks
151 setup_filesystem(const char *name, unsigned int blocks, unsigned int inodes, unsigned int type, int flags) argument
573 unsigned int blocks = 128; local
[all...]
/external/e2fsprogs/lib/quota/
H A Dquotaio_tree.c132 /* Remove given block from the list of blocks with free entries */
622 static uint find_set_bits(char *bmp, int blocks) argument
626 for (i = 0; i < blocks; i++)
/external/fio/t/
H A Dgenzipf.c268 unsigned long blocks = local
271 if (total_vals >= blocks) {

Completed in 568 milliseconds

1234567