lprops 894 fs/ubifs/debug.c struct ubifs_lprops *lprops = heap->arr[i]; lprops 897 fs/ubifs/debug.c i, lprops->lnum, lprops->hpos, lprops->free, lprops 898 fs/ubifs/debug.c lprops->dirty, lprops->flags); lprops 914 fs/ubifs/debug.c struct ubifs_lprops *lp = &pnode->lprops[i]; lprops 42 fs/ubifs/find.c static int valuable(struct ubifs_info *c, const struct ubifs_lprops *lprops) lprops 44 fs/ubifs/find.c int n, cat = lprops->flags & LPROPS_CAT_MASK; lprops 54 fs/ubifs/find.c if (lprops->free + lprops->dirty >= c->dark_wm) lprops 84 fs/ubifs/find.c const struct ubifs_lprops *lprops, int in_tree, lprops 90 fs/ubifs/find.c if (lprops->flags & LPROPS_TAKEN) lprops 93 fs/ubifs/find.c if (!in_tree && valuable(c, lprops)) lprops 96 fs/ubifs/find.c if (lprops->free + lprops->dirty < data->min_space) lprops 99 fs/ubifs/find.c if (data->exclude_index && lprops->flags & LPROPS_INDEX) lprops 102 fs/ubifs/find.c if (lprops->free + lprops->dirty == c->leb_size) { lprops 106 fs/ubifs/find.c } else if (lprops->dirty < c->dead_wm) lprops 109 fs/ubifs/find.c data->lnum = lprops->lnum; lprops 128 fs/ubifs/find.c const struct ubifs_lprops *lprops; lprops 136 fs/ubifs/find.c lprops = heap->arr[i]; lprops 137 fs/ubifs/find.c if (lprops->free + lprops->dirty < min_space) lprops 139 fs/ubifs/find.c if (lprops->dirty < c->dead_wm) lprops 141 fs/ubifs/find.c return lprops; lprops 150 fs/ubifs/find.c list_for_each_entry(lprops, &c->uncat_list, list) { lprops 151 fs/ubifs/find.c if (lprops->flags & LPROPS_TAKEN) lprops 153 fs/ubifs/find.c if (lprops->free + lprops->dirty < min_space) lprops 155 fs/ubifs/find.c if (exclude_index && (lprops->flags & LPROPS_INDEX)) lprops 157 fs/ubifs/find.c if (lprops->dirty < c->dead_wm) lprops 159 fs/ubifs/find.c return lprops; lprops 176 fs/ubifs/find.c lprops = ubifs_lpt_lookup_dirty(c, data.lnum); lprops 177 fs/ubifs/find.c if (IS_ERR(lprops)) lprops 178 fs/ubifs/find.c return lprops; lprops 179 fs/ubifs/find.c ubifs_assert(c, lprops->lnum == data.lnum); lprops 180 fs/ubifs/find.c ubifs_assert(c, lprops->free + lprops->dirty >= min_space); lprops 181 fs/ubifs/find.c ubifs_assert(c, lprops->dirty >= c->dead_wm || lprops 183 fs/ubifs/find.c lprops->free + lprops->dirty == c->leb_size)); lprops 184 fs/ubifs/find.c ubifs_assert(c, !(lprops->flags & LPROPS_TAKEN)); lprops 185 fs/ubifs/find.c ubifs_assert(c, !exclude_index || !(lprops->flags & LPROPS_INDEX)); lprops 186 fs/ubifs/find.c return lprops; lprops 351 fs/ubifs/find.c const struct ubifs_lprops *lprops, int in_tree, lprops 357 fs/ubifs/find.c if (lprops->flags & LPROPS_TAKEN) lprops 360 fs/ubifs/find.c if (!in_tree && valuable(c, lprops)) lprops 363 fs/ubifs/find.c if (lprops->flags & LPROPS_INDEX) lprops 366 fs/ubifs/find.c if (lprops->free < data->min_space) lprops 369 fs/ubifs/find.c if (!data->pick_free && lprops->free == c->leb_size) lprops 377 fs/ubifs/find.c if (lprops->free + lprops->dirty == c->leb_size && lprops->dirty > 0) lprops 380 fs/ubifs/find.c data->lnum = lprops->lnum; lprops 399 fs/ubifs/find.c const struct ubifs_lprops *lprops; lprops 405 fs/ubifs/find.c lprops = ubifs_fast_find_free(c); lprops 406 fs/ubifs/find.c if (lprops && lprops->free >= min_space) lprops 407 fs/ubifs/find.c return lprops; lprops 410 fs/ubifs/find.c lprops = ubifs_fast_find_empty(c); lprops 411 fs/ubifs/find.c if (lprops) lprops 412 fs/ubifs/find.c return lprops; lprops 415 fs/ubifs/find.c lprops = ubifs_fast_find_free(c); lprops 416 fs/ubifs/find.c if (lprops && lprops->free >= min_space) lprops 417 fs/ubifs/find.c return lprops; lprops 422 fs/ubifs/find.c lprops = heap->arr[i]; lprops 423 fs/ubifs/find.c if (lprops->free >= min_space) lprops 424 fs/ubifs/find.c return lprops; lprops 433 fs/ubifs/find.c list_for_each_entry(lprops, &c->uncat_list, list) { lprops 434 fs/ubifs/find.c if (lprops->flags & LPROPS_TAKEN) lprops 436 fs/ubifs/find.c if (lprops->flags & LPROPS_INDEX) lprops 438 fs/ubifs/find.c if (lprops->free >= min_space) lprops 439 fs/ubifs/find.c return lprops; lprops 455 fs/ubifs/find.c lprops = ubifs_lpt_lookup_dirty(c, data.lnum); lprops 456 fs/ubifs/find.c if (IS_ERR(lprops)) lprops 457 fs/ubifs/find.c return lprops; lprops 458 fs/ubifs/find.c ubifs_assert(c, lprops->lnum == data.lnum); lprops 459 fs/ubifs/find.c ubifs_assert(c, lprops->free >= min_space); lprops 460 fs/ubifs/find.c ubifs_assert(c, !(lprops->flags & LPROPS_TAKEN)); lprops 461 fs/ubifs/find.c ubifs_assert(c, !(lprops->flags & LPROPS_INDEX)); lprops 462 fs/ubifs/find.c return lprops; lprops 484 fs/ubifs/find.c const struct ubifs_lprops *lprops; lprops 528 fs/ubifs/find.c lprops = do_find_free_space(c, min_space, pick_free, squeeze); lprops 529 fs/ubifs/find.c if (IS_ERR(lprops)) { lprops 530 fs/ubifs/find.c err = PTR_ERR(lprops); lprops 534 fs/ubifs/find.c lnum = lprops->lnum; lprops 535 fs/ubifs/find.c flags = lprops->flags | LPROPS_TAKEN; lprops 537 fs/ubifs/find.c lprops = ubifs_change_lp(c, lprops, LPROPS_NC, LPROPS_NC, flags, 0); lprops 538 fs/ubifs/find.c if (IS_ERR(lprops)) { lprops 539 fs/ubifs/find.c err = PTR_ERR(lprops); lprops 549 fs/ubifs/find.c *offs = c->leb_size - lprops->free; lprops 591 fs/ubifs/find.c const struct ubifs_lprops *lprops, int in_tree, lprops 597 fs/ubifs/find.c if (lprops->flags & LPROPS_TAKEN) lprops 600 fs/ubifs/find.c if (!in_tree && valuable(c, lprops)) lprops 603 fs/ubifs/find.c if (lprops->flags & LPROPS_INDEX) lprops 606 fs/ubifs/find.c if (lprops->free + lprops->dirty != c->leb_size) lprops 613 fs/ubifs/find.c data->lnum = lprops->lnum; lprops 623 fs/ubifs/find.c const struct ubifs_lprops *lprops; lprops 635 fs/ubifs/find.c lprops = ubifs_lpt_lookup_dirty(c, data.lnum); lprops 636 fs/ubifs/find.c if (IS_ERR(lprops)) lprops 637 fs/ubifs/find.c return lprops; lprops 638 fs/ubifs/find.c ubifs_assert(c, lprops->lnum == data.lnum); lprops 639 fs/ubifs/find.c ubifs_assert(c, lprops->free + lprops->dirty == c->leb_size); lprops 640 fs/ubifs/find.c ubifs_assert(c, !(lprops->flags & LPROPS_TAKEN)); lprops 641 fs/ubifs/find.c ubifs_assert(c, !(lprops->flags & LPROPS_INDEX)); lprops 642 fs/ubifs/find.c return lprops; lprops 663 fs/ubifs/find.c const struct ubifs_lprops *lprops; lprops 668 fs/ubifs/find.c lprops = ubifs_fast_find_empty(c); lprops 669 fs/ubifs/find.c if (!lprops) { lprops 670 fs/ubifs/find.c lprops = ubifs_fast_find_freeable(c); lprops 671 fs/ubifs/find.c if (!lprops) { lprops 682 fs/ubifs/find.c lprops = scan_for_leb_for_idx(c); lprops 683 fs/ubifs/find.c if (IS_ERR(lprops)) { lprops 684 fs/ubifs/find.c err = PTR_ERR(lprops); lprops 691 fs/ubifs/find.c if (!lprops) { lprops 696 fs/ubifs/find.c lnum = lprops->lnum; lprops 699 fs/ubifs/find.c lnum, lprops->free, lprops->dirty, lprops->flags); lprops 701 fs/ubifs/find.c flags = lprops->flags | LPROPS_TAKEN | LPROPS_INDEX; lprops 702 fs/ubifs/find.c lprops = ubifs_change_lp(c, lprops, c->leb_size, 0, flags, 0); lprops 703 fs/ubifs/find.c if (IS_ERR(lprops)) { lprops 704 fs/ubifs/find.c err = PTR_ERR(lprops); lprops 784 fs/ubifs/find.c const struct ubifs_lprops *lprops, int in_tree, lprops 790 fs/ubifs/find.c if (lprops->flags & LPROPS_TAKEN) lprops 793 fs/ubifs/find.c if (!in_tree && valuable(c, lprops)) lprops 796 fs/ubifs/find.c if (!(lprops->flags & LPROPS_INDEX)) lprops 799 fs/ubifs/find.c if (lprops->free + lprops->dirty < c->min_idx_node_sz) lprops 802 fs/ubifs/find.c data->lnum = lprops->lnum; lprops 818 fs/ubifs/find.c const struct ubifs_lprops *lprops; lprops 827 fs/ubifs/find.c lprops = heap->arr[i]; lprops 828 fs/ubifs/find.c ret = scan_dirty_idx_cb(c, lprops, 1, &data); lprops 832 fs/ubifs/find.c list_for_each_entry(lprops, &c->frdi_idx_list, list) { lprops 833 fs/ubifs/find.c ret = scan_dirty_idx_cb(c, lprops, 1, &data); lprops 837 fs/ubifs/find.c list_for_each_entry(lprops, &c->uncat_list, list) { lprops 838 fs/ubifs/find.c ret = scan_dirty_idx_cb(c, lprops, 1, &data); lprops 853 fs/ubifs/find.c lprops = ubifs_lpt_lookup_dirty(c, data.lnum); lprops 854 fs/ubifs/find.c if (IS_ERR(lprops)) lprops 855 fs/ubifs/find.c return PTR_ERR(lprops); lprops 856 fs/ubifs/find.c ubifs_assert(c, lprops->lnum == data.lnum); lprops 857 fs/ubifs/find.c ubifs_assert(c, lprops->free + lprops->dirty >= c->min_idx_node_sz); lprops 858 fs/ubifs/find.c ubifs_assert(c, !(lprops->flags & LPROPS_TAKEN)); lprops 859 fs/ubifs/find.c ubifs_assert(c, (lprops->flags & LPROPS_INDEX)); lprops 862 fs/ubifs/find.c lprops->lnum, lprops->free, lprops->dirty, lprops->flags); lprops 864 fs/ubifs/find.c lprops = ubifs_change_lp(c, lprops, LPROPS_NC, LPROPS_NC, lprops 865 fs/ubifs/find.c lprops->flags | LPROPS_TAKEN, 0); lprops 866 fs/ubifs/find.c if (IS_ERR(lprops)) lprops 867 fs/ubifs/find.c return PTR_ERR(lprops); lprops 869 fs/ubifs/find.c return lprops->lnum; lprops 26 fs/ubifs/lprops.c static int get_heap_comp_val(struct ubifs_lprops *lprops, int cat) lprops 30 fs/ubifs/lprops.c return lprops->free; lprops 32 fs/ubifs/lprops.c return lprops->free + lprops->dirty; lprops 34 fs/ubifs/lprops.c return lprops->dirty; lprops 51 fs/ubifs/lprops.c struct ubifs_lprops *lprops, int cat) lprops 55 fs/ubifs/lprops.c hpos = lprops->hpos; lprops 58 fs/ubifs/lprops.c val1 = get_heap_comp_val(lprops, cat); lprops 69 fs/ubifs/lprops.c heap->arr[ppos] = lprops; lprops 70 fs/ubifs/lprops.c lprops->hpos = ppos; lprops 88 fs/ubifs/lprops.c struct ubifs_lprops *lprops, int hpos, int cat) lprops 92 fs/ubifs/lprops.c val1 = get_heap_comp_val(lprops, cat); lprops 103 fs/ubifs/lprops.c heap->arr[ppos] = lprops; lprops 104 fs/ubifs/lprops.c lprops->hpos = ppos; lprops 134 fs/ubifs/lprops.c heap->arr[cpos] = lprops; lprops 135 fs/ubifs/lprops.c lprops->hpos = cpos; lprops 148 fs/ubifs/lprops.c heap->arr[cpos] = lprops; lprops 149 fs/ubifs/lprops.c lprops->hpos = cpos; lprops 166 fs/ubifs/lprops.c static int add_to_lpt_heap(struct ubifs_info *c, struct ubifs_lprops *lprops, lprops 177 fs/ubifs/lprops.c cpos = (((size_t)lprops >> 4) & b) + b; lprops 182 fs/ubifs/lprops.c val1 = get_heap_comp_val(lprops, cat); lprops 191 fs/ubifs/lprops.c lprops->hpos = cpos; lprops 192 fs/ubifs/lprops.c heap->arr[cpos] = lprops; lprops 193 fs/ubifs/lprops.c move_up_lpt_heap(c, heap, lprops, cat); lprops 194 fs/ubifs/lprops.c dbg_check_heap(c, heap, cat, lprops->hpos); lprops 200 fs/ubifs/lprops.c lprops->hpos = heap->cnt++; lprops 201 fs/ubifs/lprops.c heap->arr[lprops->hpos] = lprops; lprops 202 fs/ubifs/lprops.c move_up_lpt_heap(c, heap, lprops, cat); lprops 203 fs/ubifs/lprops.c dbg_check_heap(c, heap, cat, lprops->hpos); lprops 215 fs/ubifs/lprops.c struct ubifs_lprops *lprops, int cat) lprops 218 fs/ubifs/lprops.c int hpos = lprops->hpos; lprops 222 fs/ubifs/lprops.c ubifs_assert(c, heap->arr[hpos] == lprops); lprops 261 fs/ubifs/lprops.c void ubifs_add_to_cat(struct ubifs_info *c, struct ubifs_lprops *lprops, lprops 268 fs/ubifs/lprops.c if (add_to_lpt_heap(c, lprops, cat)) lprops 274 fs/ubifs/lprops.c list_add(&lprops->list, &c->uncat_list); lprops 277 fs/ubifs/lprops.c list_add(&lprops->list, &c->empty_list); lprops 280 fs/ubifs/lprops.c list_add(&lprops->list, &c->freeable_list); lprops 284 fs/ubifs/lprops.c list_add(&lprops->list, &c->frdi_idx_list); lprops 290 fs/ubifs/lprops.c lprops->flags &= ~LPROPS_CAT_MASK; lprops 291 fs/ubifs/lprops.c lprops->flags |= cat; lprops 305 fs/ubifs/lprops.c struct ubifs_lprops *lprops, int cat) lprops 311 fs/ubifs/lprops.c remove_from_lpt_heap(c, lprops, cat); lprops 320 fs/ubifs/lprops.c ubifs_assert(c, !list_empty(&lprops->list)); lprops 321 fs/ubifs/lprops.c list_del(&lprops->list); lprops 373 fs/ubifs/lprops.c void ubifs_ensure_cat(struct ubifs_info *c, struct ubifs_lprops *lprops) lprops 375 fs/ubifs/lprops.c int cat = lprops->flags & LPROPS_CAT_MASK; lprops 379 fs/ubifs/lprops.c cat = ubifs_categorize_lprops(c, lprops); lprops 382 fs/ubifs/lprops.c ubifs_remove_from_cat(c, lprops, LPROPS_UNCAT); lprops 383 fs/ubifs/lprops.c ubifs_add_to_cat(c, lprops, cat); lprops 397 fs/ubifs/lprops.c const struct ubifs_lprops *lprops) lprops 399 fs/ubifs/lprops.c if (lprops->flags & LPROPS_TAKEN) lprops 402 fs/ubifs/lprops.c if (lprops->free == c->leb_size) { lprops 403 fs/ubifs/lprops.c ubifs_assert(c, !(lprops->flags & LPROPS_INDEX)); lprops 407 fs/ubifs/lprops.c if (lprops->free + lprops->dirty == c->leb_size) { lprops 408 fs/ubifs/lprops.c if (lprops->flags & LPROPS_INDEX) lprops 414 fs/ubifs/lprops.c if (lprops->flags & LPROPS_INDEX) { lprops 415 fs/ubifs/lprops.c if (lprops->dirty + lprops->free >= c->min_idx_node_sz) lprops 418 fs/ubifs/lprops.c if (lprops->dirty >= c->dead_wm && lprops 419 fs/ubifs/lprops.c lprops->dirty > lprops->free) lprops 421 fs/ubifs/lprops.c if (lprops->free > 0) lprops 436 fs/ubifs/lprops.c static void change_category(struct ubifs_info *c, struct ubifs_lprops *lprops) lprops 438 fs/ubifs/lprops.c int old_cat = lprops->flags & LPROPS_CAT_MASK; lprops 439 fs/ubifs/lprops.c int new_cat = ubifs_categorize_lprops(c, lprops); lprops 448 fs/ubifs/lprops.c adjust_lpt_heap(c, heap, lprops, lprops->hpos, new_cat); lprops 450 fs/ubifs/lprops.c ubifs_remove_from_cat(c, lprops, old_cat); lprops 451 fs/ubifs/lprops.c ubifs_add_to_cat(c, lprops, new_cat); lprops 490 fs/ubifs/lprops.c static int is_lprops_dirty(struct ubifs_info *c, struct ubifs_lprops *lprops) lprops 495 fs/ubifs/lprops.c pos = (lprops->lnum - c->main_first) & (UBIFS_LPT_FANOUT - 1); lprops 496 fs/ubifs/lprops.c pnode = (struct ubifs_pnode *)container_of(lprops - pos, lprops 498 fs/ubifs/lprops.c lprops[0]); lprops 529 fs/ubifs/lprops.c struct ubifs_lprops *lprops = (struct ubifs_lprops *)lp; lprops 532 fs/ubifs/lprops.c lprops->lnum, free, dirty, flags); lprops 547 fs/ubifs/lprops.c if (!is_lprops_dirty(c, lprops)) { lprops 548 fs/ubifs/lprops.c lprops = ubifs_lpt_lookup_dirty(c, lprops->lnum); lprops 549 fs/ubifs/lprops.c if (IS_ERR(lprops)) lprops 550 fs/ubifs/lprops.c return lprops; lprops 552 fs/ubifs/lprops.c ubifs_assert(c, lprops == ubifs_lpt_lookup_dirty(c, lprops->lnum)); lprops 554 fs/ubifs/lprops.c ubifs_assert(c, !(lprops->free & 7) && !(lprops->dirty & 7)); lprops 557 fs/ubifs/lprops.c if ((lprops->flags & LPROPS_TAKEN) && lprops->free == c->leb_size) lprops 560 fs/ubifs/lprops.c if (!(lprops->flags & LPROPS_INDEX)) { lprops 563 fs/ubifs/lprops.c old_spc = lprops->free + lprops->dirty; lprops 574 fs/ubifs/lprops.c c->lst.total_free += free - lprops->free; lprops 578 fs/ubifs/lprops.c if (lprops->free != c->leb_size) lprops 580 fs/ubifs/lprops.c } else if (lprops->free == c->leb_size) lprops 582 fs/ubifs/lprops.c lprops->free = free; lprops 587 fs/ubifs/lprops.c c->lst.total_dirty += dirty - lprops->dirty; lprops 588 fs/ubifs/lprops.c lprops->dirty = dirty; lprops 593 fs/ubifs/lprops.c if ((lprops->flags & LPROPS_INDEX)) { lprops 598 fs/ubifs/lprops.c lprops->flags = flags; lprops 601 fs/ubifs/lprops.c if (!(lprops->flags & LPROPS_INDEX)) { lprops 604 fs/ubifs/lprops.c new_spc = lprops->free + lprops->dirty; lprops 613 fs/ubifs/lprops.c if ((lprops->flags & LPROPS_TAKEN) && lprops->free == c->leb_size) lprops 616 fs/ubifs/lprops.c change_category(c, lprops); lprops 619 fs/ubifs/lprops.c return lprops; lprops 756 fs/ubifs/lprops.c struct ubifs_lprops *lprops; lprops 765 fs/ubifs/lprops.c lprops = heap->arr[0]; lprops 766 fs/ubifs/lprops.c ubifs_assert(c, !(lprops->flags & LPROPS_TAKEN)); lprops 767 fs/ubifs/lprops.c ubifs_assert(c, !(lprops->flags & LPROPS_INDEX)); lprops 768 fs/ubifs/lprops.c return lprops; lprops 780 fs/ubifs/lprops.c struct ubifs_lprops *lprops; lprops 787 fs/ubifs/lprops.c lprops = list_entry(c->empty_list.next, struct ubifs_lprops, list); lprops 788 fs/ubifs/lprops.c ubifs_assert(c, !(lprops->flags & LPROPS_TAKEN)); lprops 789 fs/ubifs/lprops.c ubifs_assert(c, !(lprops->flags & LPROPS_INDEX)); lprops 790 fs/ubifs/lprops.c ubifs_assert(c, lprops->free == c->leb_size); lprops 791 fs/ubifs/lprops.c return lprops; lprops 803 fs/ubifs/lprops.c struct ubifs_lprops *lprops; lprops 810 fs/ubifs/lprops.c lprops = list_entry(c->freeable_list.next, struct ubifs_lprops, list); lprops 811 fs/ubifs/lprops.c ubifs_assert(c, !(lprops->flags & LPROPS_TAKEN)); lprops 812 fs/ubifs/lprops.c ubifs_assert(c, !(lprops->flags & LPROPS_INDEX)); lprops 813 fs/ubifs/lprops.c ubifs_assert(c, lprops->free + lprops->dirty == c->leb_size); lprops 815 fs/ubifs/lprops.c return lprops; lprops 827 fs/ubifs/lprops.c struct ubifs_lprops *lprops; lprops 834 fs/ubifs/lprops.c lprops = list_entry(c->frdi_idx_list.next, struct ubifs_lprops, list); lprops 835 fs/ubifs/lprops.c ubifs_assert(c, !(lprops->flags & LPROPS_TAKEN)); lprops 836 fs/ubifs/lprops.c ubifs_assert(c, (lprops->flags & LPROPS_INDEX)); lprops 837 fs/ubifs/lprops.c ubifs_assert(c, lprops->free + lprops->dirty == c->leb_size); lprops 838 fs/ubifs/lprops.c return lprops; lprops 853 fs/ubifs/lprops.c struct ubifs_lprops *lprops; lprops 860 fs/ubifs/lprops.c list_for_each_entry(lprops, &c->empty_list, list) { lprops 861 fs/ubifs/lprops.c if (lprops->free != c->leb_size) { lprops 863 fs/ubifs/lprops.c lprops->lnum, lprops->free, lprops->dirty, lprops 864 fs/ubifs/lprops.c lprops->flags); lprops 867 fs/ubifs/lprops.c if (lprops->flags & LPROPS_TAKEN) { lprops 869 fs/ubifs/lprops.c lprops->lnum, lprops->free, lprops->dirty, lprops 870 fs/ubifs/lprops.c lprops->flags); lprops 876 fs/ubifs/lprops.c list_for_each_entry(lprops, &c->freeable_list, list) { lprops 877 fs/ubifs/lprops.c if (lprops->free + lprops->dirty != c->leb_size) { lprops 879 fs/ubifs/lprops.c lprops->lnum, lprops->free, lprops->dirty, lprops 880 fs/ubifs/lprops.c lprops->flags); lprops 883 fs/ubifs/lprops.c if (lprops->flags & LPROPS_TAKEN) { lprops 885 fs/ubifs/lprops.c lprops->lnum, lprops->free, lprops->dirty, lprops 886 fs/ubifs/lprops.c lprops->flags); lprops 906 fs/ubifs/lprops.c list_for_each_entry(lprops, &c->frdi_idx_list, list) { lprops 907 fs/ubifs/lprops.c if (lprops->free + lprops->dirty != c->leb_size) { lprops 909 fs/ubifs/lprops.c lprops->lnum, lprops->free, lprops->dirty, lprops 910 fs/ubifs/lprops.c lprops->flags); lprops 913 fs/ubifs/lprops.c if (lprops->flags & LPROPS_TAKEN) { lprops 915 fs/ubifs/lprops.c lprops->lnum, lprops->free, lprops->dirty, lprops 916 fs/ubifs/lprops.c lprops->flags); lprops 919 fs/ubifs/lprops.c if (!(lprops->flags & LPROPS_INDEX)) { lprops 921 fs/ubifs/lprops.c lprops->lnum, lprops->free, lprops->dirty, lprops 922 fs/ubifs/lprops.c lprops->flags); lprops 931 fs/ubifs/lprops.c lprops = heap->arr[i]; lprops 932 fs/ubifs/lprops.c if (!lprops) { lprops 936 fs/ubifs/lprops.c if (lprops->hpos != i) { lprops 940 fs/ubifs/lprops.c if (lprops->flags & LPROPS_TAKEN) { lprops 959 fs/ubifs/lprops.c struct ubifs_lprops *lprops = heap->arr[i]; lprops 963 fs/ubifs/lprops.c if ((lprops->flags & LPROPS_CAT_MASK) != cat) { lprops 967 fs/ubifs/lprops.c if (lprops->hpos != i) { lprops 971 fs/ubifs/lprops.c lp = ubifs_lpt_lookup(c, lprops->lnum); lprops 976 fs/ubifs/lprops.c if (lprops != lp) { lprops 978 fs/ubifs/lprops.c (size_t)lprops, (size_t)lp, lprops->lnum, lprops 985 fs/ubifs/lprops.c if (lp == lprops) { lprops 989 fs/ubifs/lprops.c if (lp->lnum == lprops->lnum) { lprops 1053 fs/ubifs/lprops.c struct ubifs_lprops *lprops; lprops 1056 fs/ubifs/lprops.c list_for_each_entry(lprops, list, list) { lprops 1057 fs/ubifs/lprops.c if (lprops == lp) { lprops 351 fs/ubifs/lpt.c pack_bits(c, &addr, &pos, pnode->lprops[i].free >> 3, lprops 353 fs/ubifs/lpt.c pack_bits(c, &addr, &pos, pnode->lprops[i].dirty >> 3, lprops 355 fs/ubifs/lpt.c if (pnode->lprops[i].flags & LPROPS_INDEX) lprops 660 fs/ubifs/lpt.c pnode->lprops[0].free = c->leb_size - iopos; lprops 661 fs/ubifs/lpt.c pnode->lprops[0].dirty = iopos - node_sz; lprops 662 fs/ubifs/lpt.c pnode->lprops[0].flags = LPROPS_INDEX; lprops 666 fs/ubifs/lpt.c pnode->lprops[1].free = c->leb_size - iopos; lprops 667 fs/ubifs/lpt.c pnode->lprops[1].dirty = iopos - node_sz; lprops 670 fs/ubifs/lpt.c pnode->lprops[i].free = c->leb_size; lprops 683 fs/ubifs/lpt.c pnode->lprops[0].free = c->leb_size; lprops 684 fs/ubifs/lpt.c pnode->lprops[0].dirty = 0; lprops 685 fs/ubifs/lpt.c pnode->lprops[0].flags = 0; lprops 687 fs/ubifs/lpt.c pnode->lprops[1].free = c->leb_size; lprops 688 fs/ubifs/lpt.c pnode->lprops[1].dirty = 0; lprops 884 fs/ubifs/lpt.c int cat = pnode->lprops[i].flags & LPROPS_CAT_MASK; lprops 885 fs/ubifs/lpt.c int lnum = pnode->lprops[i].lnum; lprops 889 fs/ubifs/lpt.c ubifs_add_to_cat(c, &pnode->lprops[i], cat); lprops 909 fs/ubifs/lpt.c if (!new_pnode->lprops[i].lnum) lprops 911 fs/ubifs/lpt.c ubifs_replace_cat(c, &old_pnode->lprops[i], lprops 912 fs/ubifs/lpt.c &new_pnode->lprops[i]); lprops 986 fs/ubifs/lpt.c struct ubifs_lprops * const lprops = &pnode->lprops[i]; lprops 988 fs/ubifs/lpt.c lprops->free = ubifs_unpack_bits(c, &addr, &pos, c->space_bits); lprops 989 fs/ubifs/lpt.c lprops->free <<= 3; lprops 990 fs/ubifs/lpt.c lprops->dirty = ubifs_unpack_bits(c, &addr, &pos, c->space_bits); lprops 991 fs/ubifs/lpt.c lprops->dirty <<= 3; lprops 994 fs/ubifs/lpt.c lprops->flags = LPROPS_INDEX; lprops 996 fs/ubifs/lpt.c lprops->flags = 0; lprops 997 fs/ubifs/lpt.c lprops->flags |= ubifs_categorize_lprops(c, lprops); lprops 1160 fs/ubifs/lpt.c int free = pnode->lprops[i].free; lprops 1161 fs/ubifs/lpt.c int dirty = pnode->lprops[i].dirty; lprops 1191 fs/ubifs/lpt.c pnode->lprops[i].lnum = lnum++; lprops 1296 fs/ubifs/lpt.c struct ubifs_lprops * const lprops = &pnode->lprops[i]; lprops 1298 fs/ubifs/lpt.c lprops->free = c->leb_size; lprops 1299 fs/ubifs/lpt.c lprops->flags = ubifs_categorize_lprops(c, lprops); lprops 1376 fs/ubifs/lpt.c struct ubifs_lprops *lprops; lprops 1384 fs/ubifs/lpt.c lprops = ubifs_lpt_lookup(c, lnum); lprops 1385 fs/ubifs/lpt.c if (IS_ERR(lprops)) { lprops 1386 fs/ubifs/lpt.c err = PTR_ERR(lprops); lprops 1499 fs/ubifs/lpt.c pnode->lprops[iip].free, pnode->lprops[iip].dirty, lprops 1500 fs/ubifs/lpt.c pnode->lprops[iip].flags); lprops 1501 fs/ubifs/lpt.c return &pnode->lprops[iip]; lprops 1639 fs/ubifs/lpt.c pnode->lprops[iip].free, pnode->lprops[iip].dirty, lprops 1640 fs/ubifs/lpt.c pnode->lprops[iip].flags); lprops 1642 fs/ubifs/lpt.c return &pnode->lprops[iip]; lprops 2040 fs/ubifs/lpt.c struct ubifs_lprops * const lprops = &pnode->lprops[i]; lprops 2042 fs/ubifs/lpt.c lprops->free = c->leb_size; lprops 2043 fs/ubifs/lpt.c lprops->flags = ubifs_categorize_lprops(c, lprops); lprops 2132 fs/ubifs/lpt.c struct ubifs_lprops *lprops = &pnode->lprops[iip]; lprops 2133 fs/ubifs/lpt.c int ret, lnum = lprops->lnum; lprops 2135 fs/ubifs/lpt.c ret = scan_cb(c, lprops, path[h].in_tree, data); lprops 2160 fs/ubifs/lpt.c ubifs_ensure_cat(c, lprops); lprops 2261 fs/ubifs/lpt.c struct ubifs_lprops *lp, *lprops = &pnode->lprops[i]; lprops 2264 fs/ubifs/lpt.c int found, cat = lprops->flags & LPROPS_CAT_MASK; lprops 2270 fs/ubifs/lpt.c if (lprops->lnum != lnum) { lprops 2272 fs/ubifs/lpt.c lprops->lnum, lnum); lprops 2275 fs/ubifs/lpt.c if (lprops->flags & LPROPS_TAKEN) { lprops 2278 fs/ubifs/lpt.c lprops->lnum, cat); lprops 2283 fs/ubifs/lpt.c if (lprops->flags & LPROPS_INDEX) { lprops 2291 fs/ubifs/lpt.c lprops->lnum, cat); lprops 2304 fs/ubifs/lpt.c lprops->lnum, cat); lprops 2328 fs/ubifs/lpt.c if (lprops->hpos < heap->cnt && lprops 2329 fs/ubifs/lpt.c heap->arr[lprops->hpos] == lprops) lprops 2337 fs/ubifs/lpt.c if (lprops == lp) { lprops 2345 fs/ubifs/lpt.c lprops->lnum, cat); lprops 2350 fs/ubifs/lpt.c if (lprops->free != c->leb_size) { lprops 2352 fs/ubifs/lpt.c lprops->lnum, cat, lprops->free, lprops 2353 fs/ubifs/lpt.c lprops->dirty); lprops 2359 fs/ubifs/lpt.c if (lprops->free + lprops->dirty != c->leb_size) { lprops 2361 fs/ubifs/lpt.c lprops->lnum, cat, lprops->free, lprops 2362 fs/ubifs/lpt.c lprops->dirty); lprops 763 fs/ubifs/lpt_commit.c struct ubifs_lprops *lprops; lprops 776 fs/ubifs/lpt_commit.c list_for_each_entry(lprops, &c->empty_list, list) { lprops 777 fs/ubifs/lpt_commit.c c->lsave[cnt++] = lprops->lnum; lprops 781 fs/ubifs/lpt_commit.c list_for_each_entry(lprops, &c->freeable_list, list) { lprops 782 fs/ubifs/lpt_commit.c c->lsave[cnt++] = lprops->lnum; lprops 786 fs/ubifs/lpt_commit.c list_for_each_entry(lprops, &c->frdi_idx_list, list) { lprops 787 fs/ubifs/lpt_commit.c c->lsave[cnt++] = lprops->lnum; lprops 1967 fs/ubifs/lpt_commit.c struct ubifs_lprops *lprops; lprops 1979 fs/ubifs/lpt_commit.c list_for_each_entry(lprops, &c->empty_list, list) lprops 1980 fs/ubifs/lpt_commit.c c->lsave[prandom_u32() % c->lsave_cnt] = lprops->lnum; lprops 1981 fs/ubifs/lpt_commit.c list_for_each_entry(lprops, &c->freeable_list, list) lprops 1982 fs/ubifs/lpt_commit.c c->lsave[prandom_u32() % c->lsave_cnt] = lprops->lnum; lprops 1983 fs/ubifs/lpt_commit.c list_for_each_entry(lprops, &c->frdi_idx_list, list) lprops 1984 fs/ubifs/lpt_commit.c c->lsave[prandom_u32() % c->lsave_cnt] = lprops->lnum; lprops 825 fs/ubifs/sb.c struct ubifs_lprops *lprops; lprops 874 fs/ubifs/sb.c lprops = ubifs_lpt_lookup(c, lnum); lprops 875 fs/ubifs/sb.c if (IS_ERR(lprops)) { lprops 876 fs/ubifs/sb.c err = PTR_ERR(lprops); lprops 880 fs/ubifs/sb.c if (lprops->free > 0) { lprops 881 fs/ubifs/sb.c err = fixup_leb(c, lnum, c->leb_size - lprops->free); lprops 575 fs/ubifs/ubifs.h struct ubifs_lprops lprops[UBIFS_LPT_FANOUT]; lprops 647 fs/ubifs/ubifs.h const struct ubifs_lprops *lprops, lprops 1971 fs/ubifs/ubifs.h void ubifs_add_to_cat(struct ubifs_info *c, struct ubifs_lprops *lprops, lprops 1975 fs/ubifs/ubifs.h void ubifs_ensure_cat(struct ubifs_info *c, struct ubifs_lprops *lprops); lprops 1977 fs/ubifs/ubifs.h const struct ubifs_lprops *lprops);