| /external/e2fsprogs/lib/ext2fs/ |
| ext2_io.h | 43 unsigned long block,
50 unsigned long block,
77 errcode_t (*read_blk)(io_channel channel, unsigned long block,
79 errcode_t (*write_blk)(io_channel channel, unsigned long block,
87 errcode_t (*read_blk64)(io_channel channel, unsigned long long block,
89 errcode_t (*write_blk64)(io_channel channel, unsigned long long block,
91 errcode_t (*discard)(io_channel channel, unsigned long long block,
117 unsigned long long block,
120 unsigned long long block,
123 unsigned long long block,
[all...] |
| bmove.c | 46 blk64_t block, orig; local
49 block = orig = *block_nr;
55 if (ext2fs_test_block_bitmap2(pb->reserve, block)) {
57 if (++block >= ext2fs_blocks_count(fs->super))
58 block = fs->super->s_first_data_block;
59 if (block == orig) {
63 } while (ext2fs_test_block_bitmap2(pb->reserve, block) ||
64 ext2fs_test_block_bitmap2(pb->alloc_map, block));
71 retval = io_channel_write_blk64(fs->io, block, 1, pb->buf);
76 *block_nr = block;
[all...] |
| dirblock.c | 2 * dirblock.c --- directory block routines.
22 errcode_t ext2fs_read_dir_block3(ext2_filsys fs, blk64_t block,
31 retval = io_channel_read_blk64(fs->io, block, 1, buf);
61 errcode_t ext2fs_read_dir_block2(ext2_filsys fs, blk_t block,
64 return ext2fs_read_dir_block3(fs, block, buf, flags);
67 errcode_t ext2fs_read_dir_block(ext2_filsys fs, blk_t block,
70 return ext2fs_read_dir_block3(fs, block, buf, 0);
74 errcode_t ext2fs_write_dir_block3(ext2_filsys fs, blk64_t block,
107 retval = io_channel_write_blk64(fs->io, block, 1, buf);
111 return io_channel_write_blk64(fs->io, block, 1, (char *) inbuf)
[all...] |
| /frameworks/av/media/libnbaio/ |
| NBAIO.cpp | 64 ssize_t NBAIO_Sink::writeVia(writeVia_t via, size_t total, void *user, size_t block)
73 if (block == 0 || block > maxBlock) {
74 block = maxBlock;
76 double buffer[((frameSize * block) + sizeof(double) - 1) / sizeof(double)];
80 if (count > block) {
81 count = block;
101 int64_t readPTS, size_t block)
110 if (block == 0 || block > maxBlock)
[all...] |
| /libcore/luni/src/main/java/java/nio/ |
| DirectByteBuffer.java | 26 // This is the offset into {@code Buffer.block} at which this buffer logically starts.
27 // TODO: rewrite this so we set 'block' to an OffsetMemoryBlock?
32 protected DirectByteBuffer(MemoryBlock block, int capacity, int offset, boolean isReadOnly, MapMode mapMode) {
33 super(block, capacity, mapMode, block.toLong() + offset);
35 long baseSize = block.getSize();
54 DirectByteBuffer buf = new DirectByteBuffer(other.block, other.capacity(), other.offset, isReadOnly, other.mapMode);
83 return new DirectByteBuffer(block, remaining(), offset + position, isReadOnly, mapMode);
95 byte[] array = this.block.array();
108 return !isReadOnly && (block.array() != null)
[all...] |
| /cts/tests/tests/os/src/android/os/cts/ |
| ConditionVariableTest.java | 37 assertFalse(mConditionVariable.block(BLOCK_TIME));
38 assertFalse(new ConditionVariable(false).block(BLOCK_TIME));
39 assertTrue(new ConditionVariable(true).block(BLOCK_TIME));
43 // test open then block(long)
46 assertTrue(mConditionVariable.block(BLOCK_TIME));
49 // test close then block(long)
52 assertFalse(mConditionVariable.block(BLOCK_TIME));
55 // test block then open
70 mConditionVariable.block();
89 assertTrue(mConditionVariable.block(BLOCK_TIME))
[all...] |
| /external/chromium_org/net/spdy/fuzzing/ |
| hpack_fuzz_mutator.cc | 29 // block, and writes length-prefixed blocks to the output file. While blocks
65 StringPiece block; local
66 while (HpackFuzzUtil::NextHeaderBlock(&input, &block)) {
68 reinterpret_cast<uint8*>(const_cast<char*>(block.data())),
69 block.size(),
72 string prefix = HpackFuzzUtil::HeaderBlockPrefix(block.size());
75 CHECK_LT(0, file_out.WriteAtCurrentPos(block.data(), block.size()));
|
| /external/qemu/distrib/libsparse/src/ |
| backed_block.c | 27 unsigned int block; member in struct:backed_block
72 return bb->block;
181 if (!bb->next || bb->next->block > start->block) {
196 /* Block doesn't exist (possible if one block is the last block) */
201 assert(a->block < b->block);
210 if (a->block + block_len != b->block)
[all...] |
| /system/core/libsparse/ |
| backed_block.c | 27 unsigned int block; member in struct:backed_block
72 return bb->block;
181 if (!bb->next || bb->next->block > start->block) {
196 /* Block doesn't exist (possible if one block is the last block) */
201 assert(a->block < b->block);
210 if (a->block + block_len != b->block)
[all...] |
| /external/eigen/test/ |
| block.cpp | 20 VERIFY_IS_APPROX(m1.block(r1,c1,r2-r1+1,c2-c1+1).cwiseMin(s1), m1.cwiseMin(s1).block(r1,c1,r2-r1+1,c2-c1+1));
21 VERIFY_IS_APPROX(m1.block(r1,c1,r2-r1+1,c2-c1+1).cwiseMax(s1), m1.cwiseMax(s1).block(r1,c1,r2-r1+1,c2-c1+1));
33 template<typename MatrixType> void block(const MatrixType& m) function
68 // check nested block xpr on lhs
78 //check block()
81 RowVectorType br1(m1.block(r1,0,1,cols));
82 VectorType bc1(m1.block(0,c1,rows,1));
83 VERIFY_IS_EQUAL(b1, m1.block(r1,c1,1,1))
[all...] |
| /external/bouncycastle/bcprov/src/main/java/org/bouncycastle/crypto/engines/ |
| RFC3394WrapEngine.java | 84 byte[] block = new byte[inLen + iv.length];
87 System.arraycopy(iv, 0, block, 0, iv.length);
88 System.arraycopy(in, inOff, block, iv.length, inLen);
96 System.arraycopy(block, 0, buf, 0, iv.length);
97 System.arraycopy(block, 8 * i, buf, iv.length, 8);
110 System.arraycopy(buf, 0, block, 0, 8);
111 System.arraycopy(buf, 8, block, 8 * i, 8);
115 return block;
136 byte[] block = new byte[inLen - iv.length];
141 System.arraycopy(in, inOff + iv.length, block, 0, inLen - iv.length)
[all...] |
| /external/bouncycastle/bcprov/src/main/java/org/bouncycastle/crypto/modes/ |
| CTSBlockCipher.java | 9 * A Cipher Text Stealing (CTS) mode cipher. CTS allows block ciphers to
18 * Create a buffered block cipher that uses Cipher Text Stealing
20 * @param cipher the underlying block cipher this buffering object wraps.
27 // TODO: This is broken - need to introduce marker interface to differentiate block cipher primitive from mode?
76 * process a single byte, producing an output block if necessary.
176 * Process the last block in the buffer.
178 * @param out the array the block currently being held is copied into.
200 byte[] block = new byte[blockSize];
206 throw new DataLengthException("need at least one block of input for CTS");
209 cipher.processBlock(buf, 0, block, 0)
[all...] |
| /external/yaffs2/yaffs2/direct/ |
| yaffs_flashif.c | 43 yflash_Page page[32]; // The pages in the block
51 yflash_Block **block; member in struct:__anon37492
75 ramdisk.block = YMALLOC(sizeof(yflash_Block *) * ramdisk.nBlocks);
77 if(!ramdisk.block) return 0;
81 ramdisk.block[i] = NULL;
86 if((ramdisk.block[i] = YMALLOC(sizeof(yflash_Block))) == 0)
101 YFREE(ramdisk.block[i]);
103 YFREE(ramdisk.block);
129 memcpy(ramdisk.block[blk]->page[pg].data,data,512);
137 memcpy(&ramdisk.block[blk]->page[pg].data[512],&pt,sizeof(pt))
[all...] |
| /dalvik/dx/src/com/android/dx/ssa/ |
| SsaInsn.java | 30 /** {@code non-null;} the block that contains this instance */
31 private final SsaBasicBlock block; field in class:SsaInsn
40 * @param block {@code non-null;} block containing this insn. Can
43 protected SsaInsn(RegisterSpec result, SsaBasicBlock block) {
44 if (block == null) {
45 throw new NullPointerException("block == null");
48 this.block = block;
56 * @param block {@code non-null;} owning bloc
[all...] |
| SsaConverter.java | 55 * The exit block, added here, is not considered for edge splitting
126 * requiring each block with a final instruction that returns a
149 * New blocks are added to the end of the block list during
153 SsaBasicBlock block = blocks.get(i); local
154 if (nodeNeedsUniquePredecessor(block)) {
155 block.insertNewPredecessor();
161 * @param block {@code non-null;} block in question
165 private static boolean nodeNeedsUniquePredecessor(SsaBasicBlock block) {
167 * Any block with that has both multiple successors and multipl
194 SsaBasicBlock block = blocks.get(i); local
239 SsaBasicBlock block = blocks.get(i); local
[all...] |
| /external/chromium_org/third_party/mesa/src/src/gallium/auxiliary/util/ |
| u_linear.c | 42 size_t bytes = t->cols * t->block.size;
66 size_t bytes = t->cols * t->block.size;
85 const struct u_linear_format_block *block,
89 t->block = *block;
93 t->cols = t->tile.width / t->block.width;
94 t->rows = t->tile.height / t->block.height;
95 t->tile.size = t->cols * t->rows * t->block.size;
99 t->stride = t->cols * t->tiles_x * t->block.size;
|
| /external/chromium_org/third_party/mesa/src/src/gallium/drivers/llvmpipe/ |
| lp_rast_debug.c | 55 const struct cmd_block *block,
61 if (block->cmd[k] == LP_RAST_OP_SHADE_TILE ||
62 block->cmd[k] == LP_RAST_OP_SHADE_TILE_OPAQUE ||
63 block->cmd[k] == LP_RAST_OP_TRIANGLE_1 ||
64 block->cmd[k] == LP_RAST_OP_TRIANGLE_2 ||
65 block->cmd[k] == LP_RAST_OP_TRIANGLE_3 ||
66 block->cmd[k] == LP_RAST_OP_TRIANGLE_4 ||
67 block->cmd[k] == LP_RAST_OP_TRIANGLE_5 ||
68 block->cmd[k] == LP_RAST_OP_TRIANGLE_6 ||
69 block->cmd[k] == LP_RAST_OP_TRIANGLE_7
236 const struct cmd_block *block; local
[all...] |
| /external/chromium_org/third_party/re2/util/ |
| arena.cc | 50 // We do not know for sure whether or not the first block is aligned,
72 AllocatedBlock *block; local
73 // Find the next block.
76 block = &first_blocks_[blocks_alloced_++];
79 // Adds another block to the vector.
81 // block points to the last block of the vector.
82 block = &overflow_blocks_->back();
85 block->mem = reinterpret_cast<char*>(malloc(block_size));
86 block->size = block_size
129 AllocatedBlock *block = AllocNewBlock(block_size_); local
[all...] |
| /external/mesa3d/src/gallium/auxiliary/util/ |
| u_linear.c | 42 size_t bytes = t->cols * t->block.size;
66 size_t bytes = t->cols * t->block.size;
85 const struct u_linear_format_block *block,
89 t->block = *block;
93 t->cols = t->tile.width / t->block.width;
94 t->rows = t->tile.height / t->block.height;
95 t->tile.size = t->cols * t->rows * t->block.size;
99 t->stride = t->cols * t->tiles_x * t->block.size;
|
| /external/mesa3d/src/gallium/drivers/llvmpipe/ |
| lp_rast_debug.c | 55 const struct cmd_block *block,
61 if (block->cmd[k] == LP_RAST_OP_SHADE_TILE ||
62 block->cmd[k] == LP_RAST_OP_SHADE_TILE_OPAQUE ||
63 block->cmd[k] == LP_RAST_OP_TRIANGLE_1 ||
64 block->cmd[k] == LP_RAST_OP_TRIANGLE_2 ||
65 block->cmd[k] == LP_RAST_OP_TRIANGLE_3 ||
66 block->cmd[k] == LP_RAST_OP_TRIANGLE_4 ||
67 block->cmd[k] == LP_RAST_OP_TRIANGLE_5 ||
68 block->cmd[k] == LP_RAST_OP_TRIANGLE_6 ||
69 block->cmd[k] == LP_RAST_OP_TRIANGLE_7
236 const struct cmd_block *block; local
[all...] |
| /external/regex-re2/util/ |
| arena.cc | 50 // We do not know for sure whether or not the first block is aligned,
72 AllocatedBlock *block; local
73 // Find the next block.
76 block = &first_blocks_[blocks_alloced_++];
79 // Adds another block to the vector.
81 // block points to the last block of the vector.
82 block = &overflow_blocks_->back();
85 block->mem = reinterpret_cast<char*>(malloc(block_size));
86 block->size = block_size
129 AllocatedBlock *block = AllocNewBlock(block_size_); local
[all...] |
| /art/compiler/optimizing/ |
| ssa_builder.h | 38 GrowableArray<HInstruction*>* GetLocalsFor(HBasicBlock* block) {
39 HEnvironment* env = locals_for_.Get(block->GetBlockId());
43 locals_for_.Put(block->GetBlockId(), env);
48 HInstruction* ValueOfLocal(HBasicBlock* block, size_t local);
50 void VisitBasicBlock(HBasicBlock* block);
56 // Locals for the current block being visited.
63 // HEnvironment for each block.
|
| /external/chromium-trace/trace-viewer/third_party/gl-matrix/tasks/support/gl-matrix/ |
| release_helper.rb | 87 def sh(cmd, &block)
88 out, code = sh_with_code(cmd, &block)
92 def sh_with_code(cmd, &block)
99 block.call(outbuf) if block
|
| /external/chromium_org/third_party/freetype/src/base/ |
| ftutil.c | 55 FT_Pointer block = ft_mem_qalloc( memory, size, &error ); local
58 FT_MEM_ZERO( block, size );
61 return block;
71 FT_Pointer block = NULL; local
76 block = memory->alloc( memory, size );
77 if ( block == NULL )
87 return block;
96 void* block,
102 block = ft_mem_qrealloc( memory, item_size,
103 cur_count, new_count, block, &error )
[all...] |
| /external/chromium_org/v8/src/ |
| hydrogen-escape-analysis.h | 38 HPhi* NewPhiAndInsert(HBasicBlock* block, HValue* incoming_value, int index);
44 HCapturedObject* StateAt(HBasicBlock* block) {
45 return block_states_.at(block->block_id());
48 void SetStateAt(HBasicBlock* block, HCapturedObject* state) {
49 block_states_.Set(block->block_id(), state);
62 // Map of block IDs to the data-flow state at block entry during the
|
