/fs/ubifs/ |
H A D | master.c | 40 int lnum, offs = 0, nodes_cnt; local 42 lnum = UBIFS_MST_LNUM; 44 sleb = ubifs_scan(c, lnum, 0, c->sbuf, 1); 58 lnum += 1; 60 sleb = ubifs_scan(c, lnum, 0, c->sbuf, 1); 86 snod->type, lnum, snod->offs); 126 if (c->zroot.lnum >= c->leb_cnt || c->zroot.lnum < c->main_first || 282 c->zroot.lnum = le32_to_cpu(c->mst_node->root_lnum); 361 int err, lnum, off local [all...] |
H A D | commit.c | 175 c->mst_node->root_lnum = cpu_to_le32(zroot.lnum); 529 int lnum, offs, len, err = 0; local 533 lnum = d->old_zroot.lnum; 541 err = ubifs_read_node(c, idx, UBIFS_IDX_NODE, len, lnum, offs); 567 int lnum, offs, len, err = 0, uninitialized_var(last_level), child_cnt; local 586 lnum = d->old_zroot.lnum; 609 err = ubifs_read_node(c, idx, UBIFS_IDX_NODE, len, lnum, offs); 697 lnum [all...] |
H A D | misc.h | 170 * @lnum: LEB to add dirty space for 176 static inline int ubifs_add_dirt(struct ubifs_info *c, int lnum, int dirty) argument 178 return ubifs_update_one_lp(c, lnum, LPROPS_NC, dirty, 0, 0); 184 * @lnum: LEB to return 190 static inline int ubifs_return_leb(struct ubifs_info *c, int lnum) argument 192 return ubifs_change_one_lp(c, lnum, LPROPS_NC, LPROPS_NC, 0, 289 * @lnum: current log LEB 292 * 'lnum'. 294 static inline int ubifs_next_log_lnum(const struct ubifs_info *c, int lnum) argument 296 lnum [all...] |
H A D | scan.c | 63 * @lnum: logical eraseblock number 69 int ubifs_scan_a_node(const struct ubifs_info *c, void *buf, int len, int lnum, argument 78 dbg_scan("hit empty space at LEB %d:%d", lnum, offs); 89 dbg_ntype(ch->node_type), lnum, offs); 91 if (ubifs_check_node(c, buf, lnum, offs, quiet, 1)) 104 lnum, offs); 119 lnum, offs, ALIGN(offs + node_len + pad_len, 8)); 130 * @lnum: logical eraseblock number 137 struct ubifs_scan_leb *ubifs_start_scan(const struct ubifs_info *c, int lnum, argument 143 dbg_scan("scan LEB %d:%d", lnum, off 175 ubifs_end_scan(const struct ubifs_info *c, struct ubifs_scan_leb *sleb, int lnum, int offs) argument 238 ubifs_scanned_corruption(const struct ubifs_info *c, int lnum, int offs, void *buf) argument 267 ubifs_scan(const struct ubifs_info *c, int lnum, int offs, void *sbuf, int quiet) argument [all...] |
H A D | tnc_misc.c | 262 * @lnum: LEB of the indexing node to read 273 static int read_znode(struct ubifs_info *c, int lnum, int offs, int len, argument 283 err = ubifs_read_node(c, idx, UBIFS_IDX_NODE, len, lnum, offs); 293 lnum, offs, znode->level, znode->child_cnt); 309 zbr->lnum = le32_to_cpu(br->lnum); 316 if (zbr->lnum < c->main_first || 317 zbr->lnum >= c->leb_cnt || zbr->offs < 0 || 389 ubifs_err("bad indexing node at LEB %d:%d, error %d", lnum, offs, err); 422 err = read_znode(c, zbr->lnum, zb [all...] |
H A D | budget.c | 80 int err, lnum; local 84 lnum = ubifs_garbage_collect(c, 1); 86 if (lnum < 0) 87 return lnum; 90 dbg_budg("GC freed LEB %d", lnum); 91 err = ubifs_return_leb(c, lnum);
|
H A D | find.c | 36 * @lnum: LEB number found is returned here 42 int lnum; member in struct:scan_data 121 data->lnum = lprops->lnum; 179 data.lnum = -1; 186 ubifs_assert(data.lnum >= c->main_first && data.lnum < c->leb_cnt); 187 c->lscan_lnum = data.lnum; 188 lprops = ubifs_lpt_lookup_dirty(c, data.lnum); 191 ubifs_assert(lprops->lnum 497 int lebs, rsvd_idx_lebs, pick_free = 0, err, lnum, flags; local 676 int lnum = -1, err, flags; local 901 int err, lnum; local 930 int lnum; local [all...] |
H A D | gc.c | 74 * @lnum: LEB number written is returned here 88 wbuf->lnum, wbuf->offs + wbuf->used, gc_lnum, 278 err = ubifs_tnc_has_node(c, &snod->key, 0, sleb->lnum, 324 int err, new_lnum = wbuf->lnum, new_offs = wbuf->offs + wbuf->used; 331 err = ubifs_tnc_replace(c, &snod->key, sleb->lnum, 355 if (wbuf->lnum == -1) { 474 int err = 0, lnum = lp->lnum; local 478 ubifs_assert(c->gc_lnum != lnum); 479 ubifs_assert(wbuf->lnum ! 974 int lnum; local [all...] |
H A D | io.c | 99 int ubifs_leb_read(const struct ubifs_info *c, int lnum, void *buf, int offs, argument 104 err = ubi_read(c->ubi, lnum, buf, offs, len); 111 len, lnum, offs, err); 117 int ubifs_leb_write(struct ubifs_info *c, int lnum, const void *buf, int offs, argument 126 err = ubi_leb_write(c->ubi, lnum, buf, offs, len); 128 err = dbg_leb_write(c, lnum, buf, offs, len); 131 len, lnum, offs, err); 138 int ubifs_leb_change(struct ubifs_info *c, int lnum, const void *buf, int len) argument 146 err = ubi_leb_change(c->ubi, lnum, buf, len); 148 err = dbg_leb_change(c, lnum, bu 158 ubifs_leb_unmap(struct ubifs_info *c, int lnum) argument 177 ubifs_leb_map(struct ubifs_info *c, int lnum) argument 196 ubifs_is_mapped(const struct ubifs_info *c, int lnum) argument 237 ubifs_check_node(const struct ubifs_info *c, const void *buf, int lnum, int offs, int quiet, int must_chk_crc) argument 568 ubifs_wbuf_seek_nolock(struct ubifs_wbuf *wbuf, int lnum, int offs) argument 858 ubifs_write_node(struct ubifs_info *c, void *buf, int len, int lnum, int offs) argument 897 ubifs_read_node_wbuf(struct ubifs_wbuf *wbuf, void *buf, int type, int len, int lnum, int offs) argument 974 ubifs_read_node(const struct ubifs_info *c, void *buf, int type, int len, int lnum, int offs) argument [all...] |
H A D | log.c | 37 * @lnum: logical eraseblock number to search 39 * This function searches bud LEB @lnum. Returns bud description object in case 42 struct ubifs_bud *ubifs_search_bud(struct ubifs_info *c, int lnum) argument 51 if (lnum < bud->lnum) 53 else if (lnum > bud->lnum) 67 * @lnum: logical eraseblock number to search 69 * This functions returns the wbuf for @lnum or %NULL if there is not one. 71 struct ubifs_wbuf *ubifs_get_wbuf(struct ubifs_info *c, int lnum) argument 176 ubifs_add_bud_to_log(struct ubifs_info *c, int jhead, int lnum, int offs) argument 389 int lnum = c->jheads[i].wbuf.lnum; local 509 int lnum, err = 0; local 541 int lnum; member in struct:done_ref 552 done_already(struct rb_root *done_tree, int lnum) argument 602 add_node(struct ubifs_info *c, void *buf, int *lnum, int *offs, void *node) argument 638 int lnum, err, first = 1, write_lnum, offs = 0; local [all...] |
H A D | sb.c | 280 br->lnum = cpu_to_le32(main_first + DEFAULT_DATA_LEB); 661 * @lnum: the LEB number to fix up 664 * This function reads the contents of the given LEB number @lnum, then fixes 669 static int fixup_leb(struct ubifs_info *c, int lnum, int len) argument 678 dbg_mnt("unmap empty LEB %d", lnum); 679 return ubifs_leb_unmap(c, lnum); 682 dbg_mnt("fixup LEB %d, data len %d", lnum, len); 683 err = ubifs_leb_read(c, lnum, c->sbuf, 0, len, 1); 687 return ubifs_leb_change(c, lnum, c->sbuf, len); 699 int lnum, er local [all...] |
H A D | lprops.c | 509 pos = (lprops->lnum - c->main_first) & (UBIFS_LPT_FANOUT - 1); 546 lprops->lnum, free, dirty, flags); 562 lprops = ubifs_lpt_lookup_dirty(c, lprops->lnum); 566 ubifs_assert(lprops == ubifs_lpt_lookup_dirty(c, lprops->lnum)); 651 * @lnum: LEB to change properties for 658 * This function changes properties of LEB @lnum. It is a helper wrapper over 663 int ubifs_change_one_lp(struct ubifs_info *c, int lnum, int free, int dirty, argument 671 lp = ubifs_lpt_lookup_dirty(c, lnum); 686 lnum, err); 693 * @lnum 702 ubifs_update_one_lp(struct ubifs_info *c, int lnum, int free, int dirty, int flags_set, int flags_clean) argument 739 ubifs_read_one_lp(struct ubifs_info *c, int lnum, struct ubifs_lprops *lp) argument 1035 int cat, lnum = lp->lnum, is_idx = 0, used = 0, free, dirty, ret; local [all...] |
H A D | orphan.c | 346 int lnum; local 349 for (lnum = c->ohead_lnum + 1; lnum <= c->orph_last; lnum++) { 350 err = ubifs_leb_unmap(c, lnum); 491 int lnum, err; local 493 for (lnum = c->orph_first; lnum <= c->orph_last; lnum++) { 494 err = ubifs_leb_unmap(c, lnum); 650 int lnum, err = 0, outofdate = 0, last_flagged = 0; local 881 int lnum, err = 0; local [all...] |
H A D | replay.c | 40 * @lnum: logical eraseblock number of the node 56 int lnum; member in struct:replay_entry 104 lp = ubifs_lpt_lookup_dirty(c, b->bud->lnum); 131 dbg_mnt("bud LEB %d was GC'd (%d free, %d dirty)", b->bud->lnum, 133 dbg_gc("bud LEB %d was GC'd (%d free, %d dirty)", b->bud->lnum, 145 b->bud->lnum, lp->free, lp->dirty, b->free, 157 b->bud->lnum, c->leb_size - b->free); 224 r->lnum, r->offs, r->len, r->deletion, r->sqnum); 233 err = ubifs_tnc_add_nm(c, &r->key, r->lnum, r->offs, 253 err = ubifs_tnc_add(c, &r->key, r->lnum, 356 insert_node(struct ubifs_info *c, int lnum, int offs, int len, union ubifs_key *key, unsigned long long sqnum, int deletion, int *used, loff_t old_size, loff_t new_size) argument 404 insert_dent(struct ubifs_info *c, int lnum, int offs, int len, union ubifs_key *key, const char *name, int nlen, unsigned long long sqnum, int deletion, int *used) argument 544 int err = 0, used = 0, lnum = b->bud->lnum, offs = b->bud->start; local 745 add_replay_bud(struct ubifs_info *c, int lnum, int offs, int jhead, unsigned long long sqnum) argument 789 int lnum = le32_to_cpu(ref->lnum); local 826 replay_log_leb(struct ubifs_info *c, int lnum, int offs, void *sbuf) argument 1010 int err, lnum, free; local [all...] |
H A D | tnc_commit.c | 33 * @lnum: LEB number where new index node will be written 38 struct ubifs_znode *znode, int lnum, int offs, int len) 52 br->lnum = cpu_to_le32(zbr->lnum); 55 if (!zbr->lnum || !zbr->len) { 64 znode->lnum = lnum; 76 zbr->lnum = lnum; 80 c->zroot.lnum 37 make_idx_node(struct ubifs_info *c, struct ubifs_idx_node *idx, struct ubifs_znode *znode, int lnum, int offs, int len) argument 111 fill_gap(struct ubifs_info *c, int lnum, int gap_start, int gap_end, int *dirt) argument 168 find_old_idx(struct ubifs_info *c, int lnum, int offs) argument 203 is_idx_node_in_use(struct ubifs_info *c, union ubifs_key *key, int level, int lnum, int offs) argument 233 int lnum, dirt = 0, gap_start, gap_end, err, written, tot_written; local 416 int lnum, offs, len, next_len, buf_len, buf_offs, used, avail; local 667 int i, leb_cnt, lnum; local 701 int i, err = 0, lnum, er; local 810 int i, lnum, offs, len, next_len, buf_len, buf_offs, used; local [all...] |
H A D | journal.c | 117 int err = 0, err1, retries = 0, avail, lnum, offs, squeeze; local 136 if (wbuf->lnum != -1 && avail >= len) 143 lnum = ubifs_find_free_space(c, len, &offs, squeeze); 144 if (lnum >= 0) 147 err = lnum; 159 lnum = ubifs_garbage_collect(c, 0); 160 if (lnum < 0) { 161 err = lnum; 183 dbg_jnl("got LEB %d for jhead %s", lnum, dbg_jhead(jhead)); 186 if (wbuf->lnum ! 255 write_node(struct ubifs_info *c, int jhead, void *node, int len, int *lnum, int *offs) argument 286 write_head(struct ubifs_info *c, int jhead, void *buf, int len, int *lnum, int *offs, int sync) argument 545 int err, dlen, ilen, len, lnum, ino_offs, dent_offs; local 695 int err, lnum, offs, compr_type, out_len; local 781 int err, lnum, offs; local 927 int err, dlen1, dlen2, ilen, lnum, offs, len; local 1146 int err, dlen, len, lnum, offs, bit, sz, sync = IS_SYNC(inode); local 1283 int err, xlen, hlen, len, lnum, xent_offs, aligned_xlen; local 1396 int err, len1, len2, aligned_len, aligned_len1, lnum, offs; local [all...] |
H A D | lpt_commit.c | 136 * @lnum: LEB number 140 static void upd_ltab(struct ubifs_info *c, int lnum, int free, int dirty) argument 143 lnum, c->ltab[lnum - c->lpt_first].free, 144 c->ltab[lnum - c->lpt_first].dirty, free, dirty); 145 ubifs_assert(lnum >= c->lpt_first && lnum <= c->lpt_last); 146 c->ltab[lnum - c->lpt_first].free = free; 147 c->ltab[lnum - c->lpt_first].dirty += dirty; 153 * @lnum 160 alloc_lpt_leb(struct ubifs_info *c, int *lnum) argument 195 int lnum, offs, len, alen, done_lsave, done_ltab, err; local 344 realloc_lpt_leb(struct ubifs_info *c, int *lnum) argument 373 int lnum, offs, len, from, err, wlen, alen, done_ltab, done_lsave; local 903 make_nnode_dirty(struct ubifs_info *c, int node_num, int lnum, int offs) argument 952 make_pnode_dirty(struct ubifs_info *c, int node_num, int lnum, int offs) argument 982 make_ltab_dirty(struct ubifs_info *c, int lnum, int offs) argument 1007 make_lsave_dirty(struct ubifs_info *c, int lnum, int offs) argument 1034 make_node_dirty(struct ubifs_info *c, int node_type, int node_num, int lnum, int offs) argument 1148 lpt_gc_lnum(struct ubifs_info *c, int lnum) argument 1195 int i, lnum = -1, dirty = 0; local 1515 dbg_is_nnode_dirty(struct ubifs_info *c, int lnum, int offs) argument 1550 dbg_is_pnode_dirty(struct ubifs_info *c, int lnum, int offs) argument 1579 dbg_is_ltab_dirty(struct ubifs_info *c, int lnum, int offs) argument 1592 dbg_is_lsave_dirty(struct ubifs_info *c, int lnum, int offs) argument 1606 dbg_is_node_dirty(struct ubifs_info *c, int node_type, int lnum, int offs) argument 1630 dbg_check_ltab_lnum(struct ubifs_info *c, int lnum) argument 1703 int lnum, err, i, cnt; local 1882 dump_lpt_leb(const struct ubifs_info *c, int lnum) argument [all...] |
H A D | recovery.c | 95 * @lnum: LEB number 109 static int get_master_node(const struct ubifs_info *c, int lnum, void **pbuf, argument 120 err = ubifs_leb_read(c, lnum, sbuf, 0, c->leb_size, 0); 144 ret = ubifs_scan_a_node(c, buf, len, lnum, offs, 1); 150 ret = ubifs_scan_a_node(c, buf, len, lnum, offs, 1); 164 dbg_rcvry("found a master node at %d:%d", lnum, offs); 175 dbg_rcvry("found corruption at %d:%d", lnum, offs); 207 int err = 0, lnum = UBIFS_MST_LNUM, sz = c->mst_node_alsz; local 216 err = ubifs_leb_change(c, lnum, mst, sz); 219 err = ubifs_leb_change(c, lnum 440 clean_buf(const struct ubifs_info *c, void **buf, int lnum, int *offs, int *len) argument 470 no_more_nodes(const struct ubifs_info *c, void *buf, int len, int lnum, int offs) argument 506 int lnum = sleb->lnum, endpt = start; local 634 ubifs_recover_leb(struct ubifs_info *c, int lnum, int offs, void *sbuf, int jhead) argument 811 get_cs_sqnum(struct ubifs_info *c, int lnum, int offs, unsigned long long *cs_sqnum) argument 868 ubifs_recover_log_leb(struct ubifs_info *c, int lnum, int offs, void *sbuf) argument 924 recover_head(struct ubifs_info *c, int lnum, int offs, void *sbuf) argument 1000 int err, lnum = ucleb->lnum, offs = 0, len = ucleb->endpt, quiet = 1; local 1121 int lnum, err; local 1426 int err, lnum, offs, len; local [all...] |
H A D | super.c | 624 * @lnum: LEB the write-buffer was synchronized to 636 static int bud_wbuf_callback(struct ubifs_info *c, int lnum, int free, int pad) argument 638 return ubifs_update_one_lp(c, lnum, free, pad, 0, 0); 893 int lnum, err; local 896 for (lnum = 0; lnum < c->leb_cnt; lnum++) { 897 err = ubifs_is_mapped(c, lnum); 1317 int lnum; local 1324 lnum 1546 int err, lnum; local [all...] |
H A D | lpt.c | 394 int lnum = nnode->nbranch[i].lnum; local 396 if (lnum == 0) 397 lnum = c->lpt_last + 1; 398 pack_bits(&addr, &pos, lnum - c->lpt_first, c->lpt_lnum_bits); 459 * @lnum: LEB number to which to add dirty space 462 void ubifs_add_lpt_dirt(struct ubifs_info *c, int lnum, int dirty) argument 464 if (!dirty || !lnum) 467 lnum, dirty, c->ltab[lnum 479 set_ltab(struct ubifs_info *c, int lnum, int free, int dirty) argument 611 int lnum, err = 0, node_sz, iopos, i, j, cnt, len, alen, row; local 875 int lnum = pnode->lprops[i].lnum; local 1012 int lnum; local 1074 int lnum = ubifs_unpack_bits(&addr, &pos, c->lnum_bits); local 1112 int lnum = nnode->nbranch[i].lnum; local 1174 int i, lnum; local 1197 int err, lnum, offs; local 1265 int err, lnum, offs; local 1364 int lnum = c->lsave[i]; local 1445 ubifs_lpt_lookup(struct ubifs_info *c, int lnum) argument 1578 ubifs_lpt_lookup_dirty(struct ubifs_info *c, int lnum) argument 1975 int ret, lnum = lprops->lnum; local 2104 int lnum = (pnode->num << UBIFS_LPT_FANOUT_SHIFT) + i + local [all...] |
H A D | tnc.c | 57 * @lnum: LEB number of obsoleted index node 77 static int insert_old_idx(struct ubifs_info *c, int lnum, int offs) argument 85 old_idx->lnum = lnum; 92 if (lnum < o->lnum) 94 else if (lnum > o->lnum) 125 return insert_old_idx(c, zbr->lnum, zbr->offs); 128 return insert_old_idx(c, c->zroot.lnum, 238 add_idx_dirt(struct ubifs_info *c, int lnum, int dirt) argument 439 try_read_node(const struct ubifs_info *c, void *buf, int type, int len, int lnum, int offs) argument 998 matches_position(struct ubifs_zbranch *zbr, int lnum, int offs) argument 1023 resolve_collision_directly(struct ubifs_info *c, const union ubifs_key *key, struct ubifs_znode **zn, int *n, int lnum, int offs) argument 1391 maybe_leb_gced(struct ubifs_info *c, int lnum, int gc_seq1) argument 1430 ubifs_tnc_locate(struct ubifs_info *c, const union ubifs_key *key, void *node, int *lnum, int *offs) argument 1506 int n, err = 0, lnum = -1, uninitialized_var(offs); local 1636 read_wbuf(struct ubifs_wbuf *wbuf, void *buf, int len, int lnum, int offs) argument 1737 int lnum = bu->zbranch[0].lnum, offs = bu->zbranch[0].offs, len, err, i; local 2150 ubifs_tnc_add(struct ubifs_info *c, const union ubifs_key *key, int lnum, int offs, int len) argument 2199 ubifs_tnc_replace(struct ubifs_info *c, const union ubifs_key *key, int old_lnum, int old_offs, int lnum, int offs, int len) argument 2282 ubifs_tnc_add_nm(struct ubifs_info *c, const union ubifs_key *key, int lnum, int offs, int len, const struct qstr *nm) argument 2972 lookup_znode(struct ubifs_info *c, union ubifs_key *key, int level, int lnum, int offs) argument 3101 is_idx_node_in_tnc(struct ubifs_info *c, union ubifs_key *key, int level, int lnum, int offs) argument 3128 is_leaf_node_in_tnc(struct ubifs_info *c, union ubifs_key *key, int lnum, int offs) argument 3198 ubifs_tnc_has_node(struct ubifs_info *c, union ubifs_key *key, int level, int lnum, int offs, int is_idx) argument 3238 ubifs_dirty_idx_node(struct ubifs_info *c, union ubifs_key *key, int level, int lnum, int offs) argument [all...] |
H A D | debug.c | 410 pr_err("\tlnum %u\n", le32_to_cpu(ref->lnum)); 516 i, le32_to_cpu(br->lnum), le32_to_cpu(br->offs), 621 c->jheads[i].wbuf.lnum); 624 pr_err("\tbud LEB %d\n", bud->lnum); 627 pr_err("\told bud LEB %d\n", bud->lnum); 630 idx_gc->lnum, idx_gc->unmap); 659 lp->lnum, lp->free, lp->dirty, c->leb_size - spc, spc, 663 lp->lnum, lp->free, lp->dirty, c->leb_size - spc, spc, 712 if (bud->lnum == lp->lnum) { 738 int lnum, err; local 812 ubifs_dump_leb(const struct ubifs_info *c, int lnum) argument 2452 power_cut_emulated(struct ubifs_info *c, int lnum, int write) argument 2567 dbg_leb_write(struct ubifs_info *c, int lnum, const void *buf, int offs, int len) argument 2589 dbg_leb_change(struct ubifs_info *c, int lnum, const void *buf, int len) argument 2606 dbg_leb_unmap(struct ubifs_info *c, int lnum) argument 2622 dbg_leb_map(struct ubifs_info *c, int lnum) argument [all...] |
H A D | ubifs-media.h | 721 * @lnum: the referred logical eraseblock number 728 __le32 lnum; member in struct:ubifs_ref_node 736 * @lnum: LEB number of the target node 737 * @offs: offset within @lnum 742 __le32 lnum; member in struct:ubifs_branch
|
H A D | ubifs.h | 274 * @lnum: LEB number of obsoleted index node 279 int lnum; member in struct:ubifs_old_idx 313 * @lnum: logical eraseblock number 320 int lnum; member in struct:ubifs_scan_leb 330 * @lnum: LEB number 339 int lnum; member in struct:ubifs_gced_idx_leb 425 * @lnum: LEB number of recovered LEB 434 int lnum; member in struct:ubifs_unclean_leb 472 * @lnum: LEB number 480 int lnum; member in struct:ubifs_lprops 587 int lnum; member in struct:ubifs_nbranch 687 int lnum; member in struct:ubifs_wbuf 714 int lnum; member in struct:ubifs_bud 749 int lnum; member in struct:ubifs_zbranch 781 int lnum; member in struct:ubifs_znode [all...] |
/fs/reiserfs/ |
H A D | fix_node.c | 205 tb->lnum[h] = cur_free / (DC_SIZE + KEY_SIZE); 213 tb->lnum[h] = 0; 230 tb->lnum[0] = vn->vn_nr_item; 241 tb->lnum[0] = 0; 248 tb->lnum[0]++; 268 tb->lnum[0]++; 611 * lnum number of items from S[h] that must be shifted to L[h]; 623 static void set_parameters(struct tree_balance *tb, int h, int lnum, argument 627 tb->lnum[h] = lnum; [all...] |