/external/wpa_supplicant_8/hostapd/src/crypto/ |
H A D | crypto_internal-cipher.c | 106 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 D | crypto_internal-cipher.c | 106 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 D | crypto_internal-cipher.c | 106 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/e2fsprogs/lib/ext2fs/ |
H A D | mkjournal.c | 138 * Convenience function which zeros out _num_ blocks starting at 310 * of free blocks. 372 * Find a reasonable journal file size (in blocks) given the number of blocks 376 int ext2fs_default_journal_size(__u64 blocks) argument 378 if (blocks < 2048) 380 if (blocks < 32768) 382 if (blocks < 256*1024) 384 if (blocks < 512*1024) 386 if (blocks < 102 [all...] |
H A D | inode.c | 111 errcode_t (*save_get_blocks)(ext2_filsys f, ext2_ino_t ino, blk_t *blocks); 266 * blocks in the inode table. 279 * bad blocks. :-) 287 * is no longer the case. If we run out of bad blocks, then 300 * (We could try to handle runs of bad blocks, but that 315 * read in, adjust the number of blocks to read so that we we 327 * read in more blocks from the current blockgroup's inode table. 335 * Figure out how many blocks to read; we read at most 337 * many blocks left to read. 452 * need to read in more blocks 789 ext2fs_get_blocks(ext2_filsys fs, ext2_ino_t ino, blk_t *blocks) argument [all...] |
/external/grub/stage2/ |
H A D | bios.c | 62 unsigned short blocks; 79 dap.blocks = nsec; 60 unsigned short blocks; member in struct:disk_address_packet
|
H A D | vstafs.h | 76 struct alloc blocks[32]; member in struct:fs_file
|
/external/javassist/src/main/javassist/bytecode/stackmap/ |
H A D | BasicBlock.java | 41 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 D | MapMaker.java | 71 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/kernel-headers/original/linux/mmc/ |
H A D | mmc.h | 73 unsigned int blocks; /* number of blocks */ member in struct:mmc_data
|
/external/kernel-headers/original/linux/ |
H A D | stat.h | 72 unsigned long long blocks; member in struct:kstat
|
/external/openssl/crypto/evp/ |
H A D | e_aes_cbc_hmac_sha1.c | 107 void aesni_cbc_sha1_enc (const void *inp, void *out, size_t blocks, 182 blocks; local 198 if (plen>(sha_off+iv) && (blocks=(plen-(sha_off+iv))/SHA_CBLOCK)) { 201 aesni_cbc_sha1_enc(in,out,blocks,&key->ks, 203 blocks *= SHA_CBLOCK; 204 aes_off += blocks; 205 sha_off += blocks; 206 key->md.Nh += blocks>>29; 207 key->md.Nl += blocks<<=3; 208 if (key->md.Nl<(unsigned int)blocks) ke [all...] |
/external/openssl/crypto/modes/ |
H A D | modes_lcl.h | 127 u64 blocks; member in struct:ccm128_context
|
/external/webkit/Source/JavaScriptCore/dfg/ |
H A D | DFGNonSpeculativeJIT.cpp | 681 Vector<BasicBlock> blocks = m_jit.graph().m_blocks; local 682 for (m_block = 0; m_block < blocks.size(); ++m_block) 683 compile(checkIterator, blocks[m_block]);
|
H A D | DFGSpeculativeJIT.cpp | 813 Vector<BasicBlock> blocks = m_jit.graph().m_blocks; local 814 for (m_block = 0; m_block < blocks.size(); ++m_block) { 815 if (!compile(blocks[m_block]))
|
/external/wpa_supplicant_6/wpa_supplicant/src/crypto/ |
H A D | aes_wrap.c | 175 * @len: Lengths of the data blocks 480 int i, j, blocks; local 487 blocks = data_len / BLOCK_SIZE; 488 for (i = 0; i < blocks; i++) { 513 int i, j, blocks; local 520 blocks = data_len / BLOCK_SIZE; 521 for (i = 0; i < blocks; i++) {
|
H A D | crypto_internal.c | 313 size_t i, j, blocks; local 326 blocks = len / ctx->u.aes.block_size; 327 for (i = 0; i < blocks; i++) { 341 blocks = len / 8; 342 for (i = 0; i < blocks; i++) { 363 size_t i, j, blocks; local 377 blocks = len / ctx->u.aes.block_size; 378 for (i = 0; i < blocks; i++) { 391 blocks = len / 8; 392 for (i = 0; i < blocks; [all...] |
/external/dexmaker/src/dx/java/com/android/dx/ssa/ |
H A D | SsaMethod.java | 42 /** basic blocks, indexed by block index */ 43 private ArrayList<SsaBasicBlock> blocks; field in class:SsaMethod 132 * @param blocks Rop blocks 136 static BitSet bitSetFromLabelList(BasicBlockList blocks, argument 138 BitSet result = new BitSet(blocks.size()); 141 result.set(blocks.indexOfLabel(labelList.get(i))); 151 * @param ropBlocks Rop blocks 171 blocks = new ArrayList<SsaBasicBlock>(sz + 2); 175 blocks [all...] |
/external/e2fsprogs/e2fsck/ |
H A D | rehash.c | 24 * blocks. This pretty much requires an incremental approach, where 30 * yet available, blocks from the beginning part of the old directory 224 int blocks) 229 new_mem = realloc(outdir->buf, blocks * fs->blocksize); 234 blocks * sizeof(ext2_dirhash_t)); 239 outdir->buf = malloc(blocks * fs->blocksize); 240 outdir->hashes = malloc(blocks * sizeof(ext2_dirhash_t)); 243 outdir->max = blocks; 569 /* Write out the pointer blocks */ 223 alloc_size_dir(ext2_filsys fs, struct out_dir *outdir, int blocks) argument
|
/external/qemu/ |
H A D | arch_init.c | 122 block = QLIST_FIRST(&ram_list.blocks); 165 block = QLIST_FIRST(&ram_list.blocks); 185 QLIST_FOREACH(block, &ram_list.blocks, next) { 213 QLIST_FOREACH(block, &ram_list.blocks, next) 233 RAMBlock *block, *nblock, **blocks; local 236 QLIST_FOREACH(block, &ram_list.blocks, next) { 239 blocks = qemu_malloc(n * sizeof *blocks); 241 QLIST_FOREACH_SAFE(block, &ram_list.blocks, next, nblock) { 242 blocks[ [all...] |
/external/v8/src/ |
H A D | api.h | 440 inline List<internal::Object**>* blocks() { return &blocks_; } function in class:v8::internal::HandleScopeImplementer
|
/external/wpa_supplicant_6/wpa_supplicant/src/eap_common/ |
H A D | ikev2_common.c | 203 size_t i, blocks; local 213 blocks = len / 8; 215 for (i = 0; i < blocks; i++) { 262 size_t i, blocks; local 276 blocks = len / 8; 277 for (i = 0; i < blocks; i++) {
|
/external/wpa_supplicant_8/hostapd/src/eap_common/ |
H A D | ikev2_common.c | 198 size_t i, blocks; local 208 blocks = len / 8; 210 for (i = 0; i < blocks; i++) { 257 size_t i, blocks; local 271 blocks = len / 8; 272 for (i = 0; i < blocks; i++) {
|
/external/wpa_supplicant_8/src/eap_common/ |
H A D | ikev2_common.c | 198 size_t i, blocks; local 208 blocks = len / 8; 210 for (i = 0; i < blocks; i++) { 257 size_t i, blocks; local 271 blocks = len / 8; 272 for (i = 0; i < blocks; i++) {
|
/external/wpa_supplicant_8/wpa_supplicant/src/eap_common/ |
H A D | ikev2_common.c | 198 size_t i, blocks; local 208 blocks = len / 8; 210 for (i = 0; i < blocks; i++) { 257 size_t i, blocks; local 271 blocks = len / 8; 272 for (i = 0; i < blocks; i++) {
|