Searched refs:n_blocks (Results 1 – 3 of 3) sorted by relevance
31 uint32_t n_blocks; member72 if(read(s->fd,&s->n_blocks,4)<4) in cloop_open()74 s->n_blocks=be32_to_cpu(s->n_blocks); in cloop_open()77 offsets_size=s->n_blocks*sizeof(uint64_t); in cloop_open()82 for(i=0;i<s->n_blocks;i++) { in cloop_open()98 s->current_block=s->n_blocks; in cloop_open()101 bs->total_sectors = s->n_blocks*s->sectors_per_block; in cloop_open()152 if(s->n_blocks>0) in cloop_close()
316 int n_blocks; in dump_bbg_file() local320 n_blocks = 0; in dump_bbg_file()372 n_blocks += n_blocks_in_func; in dump_bbg_file()432 n_functions, n_blocks, n_arcs, n_arcs_off_tree); in dump_bbg_file()643 int n_blocks; member731 for (i = 0; i < func->n_blocks; i++) in function_reverse_succ_arcs()744 int n_blocks; in get_functions_from_bbg() local752 n_blocks = 0; in get_functions_from_bbg()793 n_blocks += n_blocks_in_func; in get_functions_from_bbg()807 func->n_blocks = n_blocks_in_func; in get_functions_from_bbg()[all …]
146 static int n_blocks; variable249 memset((char *)levels, 0, n_blocks * sizeof(*levels));270 i = n_blocks * nodewords;345 n_blocks * nodewords * sizeof(*all_closure_sets));1660 for (i = 0; i < n_blocks; ++i)1830 for (i = 0; i < n_blocks; ++i)1835 for (i = n_blocks - 1; --i >= 0; ) {1838 for (j = i + 1; j < n_blocks; ++j) {1848 for (i = 0; i < n_blocks; ++i) {1919 n = n_blocks++;[all …]