/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/ceres-solver/internal/ceres/ |
H A D | compressed_row_sparse_matrix.cc | 292 const vector<int>& blocks) { 295 for (int i = 0; i < blocks.size(); ++i) { 296 num_rows += blocks[i]; 297 num_nonzeros += blocks[i] * blocks[i]; 310 for (int i = 0; i < blocks.size(); ++i) { 311 const int block_size = blocks[i]; 323 *matrix->mutable_row_blocks() = blocks; 324 *matrix->mutable_col_blocks() = blocks; 290 CreateBlockDiagonalMatrix( const double* diagonal, const vector<int>& blocks) argument
|
/external/chromium_org/sandbox/linux/seccomp-bpf/ |
H A D | codegen_unittest.cc | 31 TargetsToBlocks *blocks) { 32 return CodeGen::CutGraphIntoBasicBlocks(insns, branch_targets, blocks); 35 void MergeTails(TargetsToBlocks *blocks) { argument 36 CodeGen::MergeTails(blocks); 241 // Basic blocks are supposed to start with a branch target and end with 313 // Also serialize the addresses the basic blocks as we encounter them. 314 // This will change as basic blocks are coalesed by MergeTails(). 29 CutGraphIntoBasicBlocks(Instruction *insns, const BranchTargets& branch_targets, TargetsToBlocks *blocks) argument
|
H A D | codegen.cc | 234 // boundaries of basic blocks. 343 // Textbook implementation of a basic block generator. All basic blocks 356 SANDBOX_DIE("Internal compiler error; cannot compute basic blocks"); 409 // basic block and any blocks referenced by this block. This function can be 411 // blocks in STL containers; this gives an easy option to use STL to find 412 // shared tail sequences of basic blocks. 414 const TargetsToBlocks& blocks) { 422 // We compare the sequence of instructions in both basic blocks. 429 // both basic blocks, we know the relative ordering between the two blocks 413 PointerCompare(const BasicBlock *block1, const BasicBlock *block2, const TargetsToBlocks& blocks) argument 489 MergeTails(TargetsToBlocks *blocks) argument 549 TopoSortBasicBlocks(BasicBlock *first_block, const TargetsToBlocks& blocks, BasicBlocks *basic_blocks) argument [all...] |
/external/chromium_org/third_party/mesa/src/src/gallium/state_trackers/xvmc/tests/ |
H A D | test_rendering.c | 149 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/evp/ |
H A D | e_aes_cbc_hmac_sha1.c | 111 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/openssl/openssl/crypto/modes/ |
H A D | modes_lcl.h | 127 u64 blocks; member in struct:ccm128_context
|
/external/chromium_org/third_party/smhasher/src/ |
H A D | KeysetTest.h | 25 // 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 D | main.cpp | 315 // 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/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/mesa3d/src/gallium/state_trackers/xvmc/tests/ |
H A D | test_rendering.c | 149 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/openssl/crypto/evp/ |
H A D | e_aes_cbc_hmac_sha1.c | 111 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/openssl/crypto/modes/ |
H A D | modes_lcl.h | 127 u64 blocks; member in struct:ccm128_context
|
/external/chromium_org/third_party/tcmalloc/chromium/src/ |
H A D | addressmap-inl.h | 54 // entries in a block (for non-empty blocks). 73 // the cluster. Empty blocks impose no extra space requirement. 152 // up the address-space into blocks and using a linked-list entry 168 // We further group a sequence of consecutive blocks into a cluster. 179 Entry* blocks[kClusterBlocks]; // Per-block linked-lists member in struct:AddressMap::Cluster 298 for (Entry* e = c->blocks[BlockID(num)]; e != NULL; e = e->next) { 314 for (Entry* e = c->blocks[block]; e != NULL; e = e->next) { 335 e->next = c->blocks[block]; 336 c->blocks[block] = e; 344 for (Entry** p = &c->blocks[BlockI [all...] |
H A D | malloc_extension.cc | 129 bool MallocExtension::MallocMemoryStats(int* blocks, size_t* total, argument 131 *blocks = 0; 355 (int* blocks, size_t* total, int histogram[kMallocHistogramSize]), 356 (blocks, total, histogram));
|
/external/chromium_org/third_party/tcmalloc/vendor/src/ |
H A D | addressmap-inl.h | 54 // entries in a block (for non-empty blocks). 73 // the cluster. Empty blocks impose no extra space requirement. 152 // up the address-space into blocks and using a linked-list entry 168 // We further group a sequence of consecutive blocks into a cluster. 179 Entry* blocks[kClusterBlocks]; // Per-block linked-lists member in struct:AddressMap::Cluster 298 for (Entry* e = c->blocks[BlockID(num)]; e != NULL; e = e->next) { 314 for (Entry* e = c->blocks[block]; e != NULL; e = e->next) { 335 e->next = c->blocks[block]; 336 c->blocks[block] = e; 344 for (Entry** p = &c->blocks[BlockI [all...] |
H A D | malloc_extension.cc | 128 bool MallocExtension::MallocMemoryStats(int* blocks, size_t* total, argument 130 *blocks = 0; 350 (int* blocks, size_t* total, int histogram[kMallocHistogramSize]), 351 (blocks, total, histogram));
|
/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...] |