/external/e2fsprogs/lib/ext2fs/ |
H A D | tst_getsize.c | 31 blk_t blocks; local 38 retval = ext2fs_get_device_size(argv[1], 1024, &blocks); 43 printf("%s is device has %u blocks.\n", argv[1], blocks);
|
/external/clang/test/CodeGenCXX/ |
H A D | 2006-09-12-OpaqueStructCrash.cpp | 24 B<C<Ty> > blocks; member in struct:D
|
/external/webkit/Source/JavaScriptCore/heap/ |
H A D | HandleStack.cpp | 44 const Vector<HandleSlot>& blocks = m_blockStack.blocks(); local 47 int end = blocks.size() - 1; 49 HandleSlot block = blocks[i]; 52 HandleSlot block = blocks[end];
|
H A D | MarkedSpace.cpp | 63 void MarkedSpace::freeBlocks(DoublyLinkedList<MarkedBlock>& blocks) argument 66 for (MarkedBlock* block = blocks.head(); block; block = next) { 69 blocks.remove(block);
|
/external/dexmaker/src/dx/java/com/android/dx/rop/code/ |
H A D | LocalVariableExtractor.java | 31 private final BasicBlockList blocks; field in class:LocalVariableExtractor 36 /** {@code non-null;} work set indicating blocks needing to be processed */ 60 BasicBlockList blocks = method.getBlocks(); 61 int maxLabel = blocks.getMaxLabel(); 64 this.blocks = blocks; 93 BasicBlock block = blocks.labelToBlock(label);
|
H A D | RopMethod.java | 28 private final BasicBlockList blocks; field in class:RopMethod 41 * the labels for the blocks that return, if calculated 48 * @param blocks {@code non-null;} basic block list of the method 51 public RopMethod(BasicBlockList blocks, int firstLabel) { argument 52 if (blocks == null) { 53 throw new NullPointerException("blocks == null"); 60 this.blocks = blocks; 73 return blocks; 130 RopMethod result = new RopMethod(blocks [all...] |
/external/dexmaker/src/dx/java/com/android/dx/ssa/ |
H A D | LocalVariableExtractor.java | 40 private final ArrayList<SsaBasicBlock> blocks; field in class:LocalVariableExtractor 45 /** {@code non-null;} work set indicating blocks needing to be processed */ 69 ArrayList<SsaBasicBlock> blocks = method.getBlocks(); 72 this.blocks = blocks; 74 this.workSet = new BitSet(blocks.size()); 106 SsaBasicBlock block = blocks.get(blockIndex);
|
H A D | Dominators.java | 50 /* 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/jmonkeyengine/engine/src/blender/com/jme3/scene/plugins/blender/ |
H A D | BlenderLoader.java | 74 /** The blocks read from the file. */
75 protected List<FileBlockHeader> blocks;
field in class:BlenderLoader 85 for (FileBlockHeader block : blocks) {
183 // reading blocks
184 blocks = new ArrayList<FileBlockHeader>();
210 // reading the blocks (dna block is automatically saved in the blender context when found)//TODO: zmienić to
215 blocks.add(fileBlock);
|
/external/webkit/Source/JavaScriptCore/wtf/ |
H A D | BlockStack.h | 45 const Vector<T*>& blocks(); 65 template <typename T> inline const Vector<T*>& BlockStack<T>::blocks() function in class:WTF::BlockStack
|
/external/wpa_supplicant_8/hostapd/src/crypto/ |
H A D | aes-cbc.c | 29 int i, j, blocks; local 36 blocks = data_len / AES_BLOCK_SIZE; 37 for (i = 0; i < blocks; i++) { 62 int i, j, blocks; local 69 blocks = data_len / AES_BLOCK_SIZE; 70 for (i = 0; i < blocks; i++) {
|
/external/wpa_supplicant_8/src/crypto/ |
H A D | aes-cbc.c | 29 int i, j, blocks; local 36 blocks = data_len / AES_BLOCK_SIZE; 37 for (i = 0; i < blocks; i++) { 62 int i, j, blocks; local 69 blocks = data_len / AES_BLOCK_SIZE; 70 for (i = 0; i < blocks; i++) {
|
/external/wpa_supplicant_8/wpa_supplicant/src/crypto/ |
H A D | aes-cbc.c | 29 int i, j, blocks; local 36 blocks = data_len / AES_BLOCK_SIZE; 37 for (i = 0; i < blocks; i++) { 62 int i, j, blocks; local 69 blocks = data_len / AES_BLOCK_SIZE; 70 for (i = 0; i < blocks; i++) {
|
/external/valgrind/main/include/ |
H A D | pub_tool_libcfile.h | 62 ULong blocks; member in struct:vg_stat
|
/external/dexmaker/src/dx/java/com/android/dx/ssa/back/ |
H A D | IdenticalBlockCombiner.java | 32 * Searches for basic blocks that all have the same successor and insns 33 * but different predecessors. These blocks are then combined into a single 34 * block and the now-unused blocks are deleted. These identical blocks 35 * frequently are created when catch blocks are edge-split. 39 private final BasicBlockList blocks; field in class:IdenticalBlockCombiner 49 blocks = ropMethod.getBlocks(); 50 newBlocks = blocks.getMutableCopy(); 56 * compare blocks with the same hash. 61 int szBlocks = blocks [all...] |
H A D | SsaToRop.java | 132 * Removes all blocks containing only GOTOs from the control flow. 136 * blocks containing the real return or throw statements must be 140 final ArrayList<SsaBasicBlock> blocks = ssaMeth.getBlocks(); 152 SsaBasicBlock pb = blocks.get(i); 167 ArrayList<SsaBasicBlock> blocks = ssaMeth.getBlocks(); 169 for (SsaBasicBlock block : blocks) { 170 // Add moves in all the pred blocks for each phi insn. 171 block.forEachPhiInsn(new PhiVisitor(blocks)); 181 for (SsaBasicBlock block : blocks) { 191 private final ArrayList<SsaBasicBlock> blocks; field in class:SsaToRop.PhiVisitor 193 PhiVisitor(ArrayList<SsaBasicBlock> blocks) argument [all...] |
/external/llvm/lib/Transforms/Scalar/ |
H A D | LoopDeletion.cpp | 75 /// checked for unique exit and exiting blocks, and that the code is in LCSSA 92 // Make sure all exiting blocks produce the same incoming value for the exit 94 // blocks, then it is impossible to statically determine which value should 201 // Update the dominator tree and remove the instructions and blocks that will 223 // Erase the instructions and the blocks without having to worry 231 // Finally, the blocks from loopinfo. This has to happen late because 234 SmallPtrSet<BasicBlock*, 8> blocks; local 235 blocks.insert(L->block_begin(), L->block_end()); 236 for (SmallPtrSet<BasicBlock*,8>::iterator I = blocks.begin(), 237 E = blocks [all...] |
/external/openssh/ |
H A D | cipher-aes.c | 80 int i, j, blocks = len / RIJNDAEL_BLOCKSIZE; local 94 for (i = 0; i < blocks; i++, plain+=RIJNDAEL_BLOCKSIZE, 107 for (i = blocks; i > 0; i--, cnow-=RIJNDAEL_BLOCKSIZE,
|
/external/openssl/crypto/modes/ |
H A D | ctr128.c | 210 size_t blocks = len/16; local 216 if (sizeof(size_t)>sizeof(unsigned int) && blocks>(1U<<28)) 217 blocks = (1U<<28); 222 * amount of blocks to the exact overflow point... 224 ctr32 += (u32)blocks; 225 if (ctr32 < blocks) { 226 blocks -= ctr32; 229 (*func)(in,out,blocks,key,ivec); 234 blocks *= 16; 235 len -= blocks; [all...] |
/external/dbus/dbus/ |
H A D | dbus-mempool.c | 35 * blocks of small uniformly-sized objects. The main point is to avoid 84 * only saved so we can free all the blocks 104 DBusMemBlock *blocks; /**< blocks of memory from malloc() */ member in struct:DBusMemPool 188 block = pool->blocks; 234 block->next = pool->blocks; 235 pool->blocks = block; 268 if (pool->blocks == NULL || 269 pool->blocks->used_so_far == pool->block_size) 313 block->next = pool->blocks; [all...] |
/external/e2fsprogs/e2fsck/ |
H A D | pass5.c | 109 blk_t blocks = 0; local 249 blocks ++; 250 if ((blocks == fs->super->s_blocks_per_group) || 254 blocks = 0; 290 blocks = 0; free_blocks = 0; group_free = 0; group = 0;
|
/external/javassist/src/main/javassist/bytecode/stackmap/ |
H A D | Liveness.java | 34 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...] |
/external/openssl/crypto/evp/ |
H A D | e_rc4_hmac_md5.c | 81 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/webkit/Source/WebCore/rendering/mathml/ |
H A D | RenderMathMLUnderOver.cpp | 64 // look through the children for rendered elements counting the blocks so we know what child 66 int blocks = 0; local 69 blocks++; 73 switch (blocks) {
|
/external/webkit/Tools/Scripts/webkitpy/tool/steps/ |
H A D | options.py | 32 blocks = make_option("--blocks", action="store", type="string", dest="blocks", default=None, help="Bug number which the created bug blocks.") variable in class:Options
|