/system/core/libsparse/ |
H A D | 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) { 292 backed_block_add_fill(struct backed_block_list *bbl, unsigned int fill_val, unsigned int len, unsigned int block) argument 310 backed_block_add_data(struct backed_block_list *bbl, void *data, unsigned int len, unsigned int block) argument 328 backed_block_add_file(struct backed_block_list *bbl, const char *filename, int64_t offset, unsigned int len, unsigned int block) argument 347 backed_block_add_fd(struct backed_block_list *bbl, int fd, int64_t offset, unsigned int len, unsigned int block) argument [all...] |
H A D | backed_block.h | 33 unsigned int len, unsigned int block); 35 unsigned int len, unsigned int block); 37 int64_t offset, unsigned int len, unsigned int block); 39 int64_t offset, unsigned int len, unsigned int block);
|
H A D | sparse.c | 56 void *data, unsigned int len, unsigned int block) 58 return backed_block_add_data(s->backed_block_list, data, len, block); 62 uint32_t fill_val, unsigned int len, unsigned int block) 64 return backed_block_add_fill(s->backed_block_list, fill_val, len, block); 69 unsigned int block) 72 len, block); 76 int fd, int64_t file_offset, unsigned int len, unsigned int block) 79 len, block); 55 sparse_file_add_data(struct sparse_file *s, void *data, unsigned int len, unsigned int block) argument 61 sparse_file_add_fill(struct sparse_file *s, uint32_t fill_val, unsigned int len, unsigned int block) argument 67 sparse_file_add_file(struct sparse_file *s, const char *filename, int64_t file_offset, unsigned int len, unsigned int block) argument 75 sparse_file_add_fd(struct sparse_file *s, int fd, int64_t file_offset, unsigned int len, unsigned int block) argument
|
H A D | sparse_read.c | 102 int fd, int64_t offset, unsigned int blocks, unsigned int block, 117 ret = sparse_file_add_fd(s, fd, offset, len, block); 140 int fd, unsigned int blocks, unsigned int block, uint32_t *crc32) 158 ret = sparse_file_add_fill(s, fill_val, len, block); 182 unsigned int block __unused, uint32_t *crc32) 237 verbose_error(s->verbose, ret, "data block at %" PRId64, offset); 245 verbose_error(s->verbose, ret, "fill block at %" PRId64, offset); 254 verbose_error(s->verbose, ret, "skip block at %" PRId64, offset); 262 verbose_error(s->verbose, -EINVAL, "crc block at %" PRId64, 268 verbose_error(s->verbose, -EINVAL, "unknown block 101 process_raw_chunk(struct sparse_file *s, unsigned int chunk_size, int fd, int64_t offset, unsigned int blocks, unsigned int block, uint32_t *crc32) argument 139 process_fill_chunk(struct sparse_file *s, unsigned int chunk_size, int fd, unsigned int blocks, unsigned int block, uint32_t *crc32) argument 361 unsigned int block = 0; local [all...] |
/system/keymaster/ |
H A D | iso18033kdf.cpp | 48 for (size_t block = 0; block < num_blocks; block++) { 63 !Uint32ToBigEndianByteArray(block + start_counter_, counter.get()) || 78 size_t block_start = digest_size_ * block;
|
H A D | ocb.c | 150 typedef __m128i block; typedef 159 static inline block swap_if_le(block b) { 160 block a = _mm_shuffle_epi32(b, _MM_SHUFFLE(0, 1, 2, 3)); 166 static inline block gen_offset(uint64_t KtopStr[3], unsigned bot) { 167 block hi = _mm_load_si128((__m128i*)(KtopStr + 0)); /* hi = B A */ 168 block lo = _mm_loadu_si128((__m128i*)(KtopStr + 1)); /* lo = C B */ 178 static inline block double_block(block bl) { 188 typedef vector unsigned block; typedef 242 typedef int8x16_t block; /* Yay! Endian-neutral reads! */ typedef 275 typedef struct { uint64_t l, r; } block; typedef in typeref:struct:__anon1782 [all...] |
/system/update_engine/common/ |
H A D | terminator.h | 36 // Set to true if the terminator should block termination requests in an 37 // attempt to block exiting. 38 static void set_exit_blocked(bool block) { exit_blocked_ = block ? 1 : 0; } argument
|
/system/extras/ext4_utils/ |
H A D | allocate.c | 119 reg->block, reg->block + reg->len - 1, reg->len) 139 fprintf(f, "%d", reg->block); 141 fprintf(f, "%d-%d", reg->block, reg->block + reg->len - 1); 149 u32 block, u32 len, int bg_num) 153 reg->block = block; 166 u32 block = bg->first_block + 2; 169 block 148 append_region(struct block_allocation *alloc, u32 block, u32 len, int bg_num) argument 203 u32 block = start; local 230 free_blocks(struct block_group_info *bg, u32 block, u32 num_blocks) argument 284 u32 block = bg->first_block; local 342 u32 block; local 489 get_block(struct block_allocation *alloc, u32 block) argument 502 get_oob_block(struct block_allocation *alloc, u32 block) argument 517 get_region(struct block_allocation *alloc, u32 *block, u32 *len) argument 675 struct ext4_xattr_header *block = xattr_list_find(inode); local [all...] |
H A D | ext2simg.c | 48 fprintf(stderr, "%s [ options ] <image or block device> <output image>\n", path); 50 fprintf(stderr, " -c include CRC block\n"); 59 unsigned int block; local 66 critical_error("failed to allocate block bitmap"); 79 critical_error_errno("failed to seek to block group bitmap %d", i); 83 critical_error_errno("failed to read block group bitmap %d", i); 85 critical_error("failed to read all of block group bitmap %d", i); 88 for (block = 0; block < last_block; block [all...] |
H A D | allocate.h | 25 u32 block; member in struct:region 74 u32 get_block(struct block_allocation *alloc, u32 block); 75 u32 get_oob_block(struct block_allocation *alloc, u32 block); 77 void get_region(struct block_allocation *alloc, u32 *block, u32 *len); 93 u32 block, u32 len, int bg);
|
H A D | sha1.c | 42 # define blk0(i) (block->l[i] = (rol(block->l[i],24)&0xFF00FF00) \ 43 |(rol(block->l[i],8)&0x00FF00FF)) 45 # define blk0(i) block->l[i] 47 #define blk(i) (block->l[i&15] = rol(block->l[(i+13)&15]^block->l[(i+8)&15] \ 48 ^block->l[(i+2)&15]^block->l[i&15],1)) 83 do_R01(u_int32_t *a, u_int32_t *b, u_int32_t *c, u_int32_t *d, u_int32_t *e, CHAR64LONG16 *block) argument 93 do_R2(u_int32_t *a, u_int32_t *b, u_int32_t *c, u_int32_t *d, u_int32_t *e, CHAR64LONG16 *block) argument 103 do_R3(u_int32_t *a, u_int32_t *b, u_int32_t *c, u_int32_t *d, u_int32_t *e, CHAR64LONG16 *block) argument 113 do_R4(u_int32_t *a, u_int32_t *b, u_int32_t *c, u_int32_t *d, u_int32_t *e, CHAR64LONG16 *block) argument 131 CHAR64LONG16 *block; local [all...] |
/system/core/libsparse/include/sparse/ |
H A D | sparse.h | 38 * size of the file is 2**32 * block_size (16TB for 4k block size). 58 * @data - pointer to data block 59 * @len - length of the data block 60 * @block - offset in blocks into the sparse file to place the data chunk 63 * [block * block_size : block * block_size + len) must not already be used in 64 * the sparse file. If len is not a multiple of the block size the data 68 * data block is removed from the sparse file. 73 void *data, unsigned int len, unsigned int block); 80 * @len - length of the fill block [all...] |
/system/core/toolbox/upstream-netbsd/bin/dd/ |
H A D | extern.h | 41 __dead void block(void); 46 void block(void);
|
/system/extras/verity/ |
H A D | build_verity_metadata.py | 25 block = struct.pack("II256sI", MAGIC_NUMBER, VERSION, signature, table_len) 26 block += verity_table 27 block = block.ljust(METADATA_SIZE, '\x00') 28 return block 58 # build the metadata block
|
/system/update_engine/payload_generator/ |
H A D | extent_utils.h | 30 // |block| must either be the next block in the last extent or a block 31 // in the next extent. This function will not handle inserting block 33 void AppendBlockToExtents(std::vector<Extent>* extents, uint64_t block); 63 for (uint64_t block = extent.start_block(); 64 block < (extent.start_block() + extent.num_blocks()); block++) { 65 ret.push_back(block); 90 // to be sorted by start block [all...] |
H A D | extent_ranges.h | 50 void AddBlock(uint64_t block); 51 void SubtractBlock(uint64_t block); 63 // Returns whether the block |block| is in this ExtentRange. 64 bool ContainsBlock(uint64_t block) const;
|
H A D | block_mapping.cc | 63 for (size_t block = 0; block < num_blocks; block++) { 64 (*block_ids)[block] = AddDiskBlock( 65 fd, initial_byte_offset + block * block_size_); 66 ret = ret && (*block_ids)[block] != -1; 97 // No existing block was found at this point, so we create and fill in a new 128 // We increase the number of times we had to read this block from disk and 129 // we cache this block based on that. This caching method is optimized for 131 // but have few repeated blocks inside each partition, such as the block [all...] |
H A D | graph_utils.cc | 52 uint64_t block) { 61 AppendBlockToExtents(&edge_it->second.extents, block); 67 // TODO(adlr): Be more efficient than adding each block individually. 71 for (uint64_t block = extent.start_block(), 73 block != block_end; ++block) { 74 AddReadBeforeDep(src, dst, block); 50 AddReadBeforeDep(Vertex* src, Vertex::Index dst, uint64_t block) argument
|
H A D | graph_utils.h | 37 // already exists, the block/s is/are added to the existing edge. 40 uint64_t block);
|
H A D | extent_ranges.cc | 57 void ExtentRanges::AddBlock(uint64_t block) { argument 58 AddExtent(ExtentForRange(block, 1)); 61 void ExtentRanges::SubtractBlock(uint64_t block) { argument 62 SubtractExtent(ExtentForRange(block, 1)); 195 bool ExtentRanges::ContainsBlock(uint64_t block) const { 196 auto lower = extent_set_.lower_bound(ExtentForRange(block, 1)); 197 // The block could be on the extent before the one in |lower|. 200 // Any extent starting at block+1 or later is not interesting, so this is the 202 auto upper = extent_set_.lower_bound(ExtentForRange(block + 1, 0)); 204 if (iter->start_block() <= block [all...] |
H A D | delta_diff_utils.cc | 103 // Remove identical corresponding block ranges in |src_extents| and 107 // case the last block is only partly occupied with data. Returns the total 148 // If we removed the last block and this block is only partly used by file 305 for (uint64_t block = 0; block < num_blocks; block++) { 306 if (old_block_ids[block] == new_block_ids[block] && 307 !old_visited_blocks->ContainsBlock(block) [all...] |
H A D | ext2_filesystem.cc | 65 // If |blockcnt| is non-negative, |blocknr| points to the physical block 69 // |blocknr| points to a block in the first three cases. The last case is 130 0, // superblock block number 280 for (uint64_t block : inode_blocks) { 281 AppendBlockToExtents(&inode_file.extents, block); 294 for (blk64_t block = blk_start; block < blk_end; block++) { 295 if (!ext2fs_test_block_bitmap2(filsys_->block_map, block)) 296 AppendBlockToExtents(&free_space.extents, block); [all...] |
/system/bt/embdrv/sbc/decoder/include/ |
H A D | oi_string.h | 59 #define OI_MemSet(block, val, size) memset((block), (val), (size)) 60 #define OI_MemZero(block, size) memset((block), 0, (size)) 83 * Sets all bytes in a block of memory to the same value 91 * Sets all bytes in a block of memory to zero
|
/system/core/logd/ |
H A D | libaudit.h | 73 * @param block 74 * Whether or not to block on IO 81 extern int audit_get_reply(int fd, struct audit_message *rep, reply_t block,
|
/system/tools/aidl/ |
H A D | ast_cpp_unittest.cpp | 177 StatementBlock block; local 178 block.AddStatement(unique_ptr<AstNode>(new Statement("foo"))); 179 block.AddStatement(unique_ptr<AstNode>(new Statement("bar"))); 180 CompareGeneratedCode(block, "{\nfoo;\nbar;\n}\n");
|