roots 125 drivers/gpu/drm/i915/i915_buddy.c mm->roots = kmalloc_array(mm->n_roots, roots 128 drivers/gpu/drm/i915/i915_buddy.c if (!mm->roots) roots 155 drivers/gpu/drm/i915/i915_buddy.c mm->roots[i] = root; roots 166 drivers/gpu/drm/i915/i915_buddy.c i915_block_free(mm->roots[i]); roots 167 drivers/gpu/drm/i915/i915_buddy.c kfree(mm->roots); roots 178 drivers/gpu/drm/i915/i915_buddy.c GEM_WARN_ON(!i915_buddy_block_is_free(mm->roots[i])); roots 179 drivers/gpu/drm/i915/i915_buddy.c i915_block_free(mm->roots[i]); roots 182 drivers/gpu/drm/i915/i915_buddy.c kfree(mm->roots); roots 358 drivers/gpu/drm/i915/i915_buddy.c list_add_tail(&mm->roots[i]->tmp_link, &dfs); roots 56 drivers/gpu/drm/i915/i915_buddy.h struct i915_buddy_block **roots; roots 206 drivers/gpu/drm/i915/selftests/i915_buddy.c root = mm->roots[i]; roots 50 drivers/md/dm-verity-fec.c for (i = 0; i < v->fec->roots; i++) roots 67 drivers/md/dm-verity-fec.c position = (index + rsb) * v->fec->roots; roots 157 drivers/md/dm-verity-fec.c offset += v->fec->roots; roots 259 drivers/md/dm-verity-fec.c if (neras && *neras <= v->fec->roots) roots 277 drivers/md/dm-verity-fec.c if (neras && *neras <= v->fec->roots && roots 539 drivers/md/dm-verity-fec.c v->fec->roots); roots 573 drivers/md/dm-verity-fec.c return init_rs_gfp(8, 0x11d, 0, 1, v->fec->roots, gfp_mask); roots 642 drivers/md/dm-verity-fec.c v->fec->roots = num_c; roots 711 drivers/md/dm-verity-fec.c if (!f->roots) { roots 715 drivers/md/dm-verity-fec.c f->rsn = DM_VERITY_FEC_RSM - f->roots; roots 755 drivers/md/dm-verity-fec.c ((f->start + f->rounds * f->roots) >> v->data_dev_block_bits)) { roots 43 drivers/md/dm-verity-fec.h unsigned char roots; /* number of parity bytes, M-N of RS(M, N) */ roots 1116 fs/btrfs/backref.c struct ulist *roots, const u64 *extent_item_pos, roots 1266 fs/btrfs/backref.c if (roots && ref->count && ref->root_id && ref->parent == 0) { roots 1274 fs/btrfs/backref.c ret = ulist_add(roots, ref->root_id, 0, GFP_NOFS); roots 1401 fs/btrfs/backref.c u64 time_seq, struct ulist **roots, roots 1412 fs/btrfs/backref.c *roots = ulist_alloc(GFP_NOFS); roots 1413 fs/btrfs/backref.c if (!*roots) { roots 1421 fs/btrfs/backref.c tmp, *roots, NULL, NULL, ignore_offset); roots 1424 fs/btrfs/backref.c ulist_free(*roots); roots 1440 fs/btrfs/backref.c u64 time_seq, struct ulist **roots, roots 1448 fs/btrfs/backref.c time_seq, roots, ignore_offset); roots 1469 fs/btrfs/backref.c struct ulist *roots, struct ulist *tmp) roots 1483 fs/btrfs/backref.c ulist_init(roots); roots 1501 fs/btrfs/backref.c roots, NULL, &shared, false); roots 1525 fs/btrfs/backref.c ulist_release(roots); roots 1903 fs/btrfs/backref.c struct ulist *roots = NULL; roots 1937 fs/btrfs/backref.c tree_mod_seq_elem.seq, &roots, roots 1942 fs/btrfs/backref.c while (!ret && (root_node = ulist_next(roots, &root_uiter))) { roots 1954 fs/btrfs/backref.c ulist_free(roots); roots 45 fs/btrfs/backref.h u64 time_seq, struct ulist **roots, bool ignore_offset); roots 61 fs/btrfs/backref.h struct ulist *roots, struct ulist *tmp_ulist); roots 4654 fs/btrfs/extent_io.c struct ulist *roots; roots 4669 fs/btrfs/extent_io.c roots = ulist_alloc(GFP_KERNEL); roots 4671 fs/btrfs/extent_io.c if (!roots || !tmp_ulist) { roots 4795 fs/btrfs/extent_io.c bytenr, roots, tmp_ulist); roots 4843 fs/btrfs/extent_io.c ulist_free(roots); roots 2209 fs/btrfs/qgroup.c struct ulist *roots, struct ulist *tmp, roots 2219 fs/btrfs/qgroup.c if (!roots) roots 2222 fs/btrfs/qgroup.c while ((unode = ulist_next(roots, &uiter))) { roots 2393 fs/btrfs/qgroup.c static int maybe_fs_roots(struct ulist *roots) roots 2399 fs/btrfs/qgroup.c if (!roots || roots->nnodes == 0) roots 2403 fs/btrfs/qgroup.c unode = ulist_next(roots, &uiter); roots 3055 fs/btrfs/qgroup.c struct ulist *roots = NULL; roots 3113 fs/btrfs/qgroup.c &roots, false); roots 3118 fs/btrfs/qgroup.c num_bytes, NULL, roots); roots 69 fs/btrfs/ref-verify.c struct rb_root roots; roots 239 fs/btrfs/ref-verify.c while ((n = rb_first(&be->roots))) { roots 241 fs/btrfs/ref-verify.c rb_erase(&re->node, &be->roots); roots 286 fs/btrfs/ref-verify.c exist_re = insert_root_entry(&exist->roots, re); roots 297 fs/btrfs/ref-verify.c be->roots = RB_ROOT; roots 301 fs/btrfs/ref-verify.c insert_root_entry(&be->roots, re); roots 338 fs/btrfs/ref-verify.c re = lookup_root_entry(&be->roots, ref_root); roots 416 fs/btrfs/ref-verify.c re = lookup_root_entry(&be->roots, ref_root); roots 651 fs/btrfs/ref-verify.c for (n = rb_first(&be->roots); n; n = rb_next(n)) { roots 809 fs/btrfs/ref-verify.c tmp = insert_root_entry(&be->roots, re); roots 858 fs/btrfs/ref-verify.c re = lookup_root_entry(&be->roots, ref_root); roots 520 lib/bch.c unsigned int *roots) roots 549 lib/bch.c return solve_linear_system(bch, rows, roots, 4); roots 556 lib/bch.c unsigned int *roots) roots 562 lib/bch.c roots[n++] = mod_s(bch, GF_N(bch)-bch->a_log_tab[poly->c[0]]+ roots 571 lib/bch.c unsigned int *roots) roots 600 lib/bch.c roots[n++] = modulo(bch, 2*GF_N(bch)-l1- roots 602 lib/bch.c roots[n++] = modulo(bch, 2*GF_N(bch)-l1- roots 613 lib/bch.c unsigned int *roots) roots 635 lib/bch.c roots[n++] = a_ilog(bch, tmp[i]); roots 646 lib/bch.c unsigned int *roots) roots 695 lib/bch.c if (find_affine4_roots(bch, a2, b2, c2, roots) == 4) { roots 698 lib/bch.c f = a ? gf_inv(bch, roots[i]) : roots[i]; roots 699 lib/bch.c roots[i] = a_ilog(bch, f^e); roots 885 lib/bch.c struct gf_poly *poly, unsigned int *roots) roots 893 lib/bch.c cnt = find_poly_deg1_roots(bch, poly, roots); roots 896 lib/bch.c cnt = find_poly_deg2_roots(bch, poly, roots); roots 899 lib/bch.c cnt = find_poly_deg3_roots(bch, poly, roots); roots 902 lib/bch.c cnt = find_poly_deg4_roots(bch, poly, roots); roots 910 lib/bch.c cnt += find_poly_roots(bch, k+1, f1, roots); roots 912 lib/bch.c cnt += find_poly_roots(bch, k+1, f2, roots+cnt); roots 925 lib/bch.c struct gf_poly *p, unsigned int *roots) roots 944 lib/bch.c roots[count++] = GF_N(bch)-i; roots 1179 lib/bch.c unsigned int i, j, nbits, r, word, *roots; roots 1184 lib/bch.c roots = bch_alloc((bch->n+1)*sizeof(*roots), &err); roots 1194 lib/bch.c memset(roots , 0, (bch->n+1)*sizeof(*roots)); roots 1197 lib/bch.c roots[r] = 1; roots 1205 lib/bch.c if (roots[i]) { roots 1233 lib/bch.c kfree(roots); roots 24 security/selinux/ss/sidtab.c memset(s->roots, 0, sizeof(s->roots)); roots 74 security/selinux/ss/sidtab.c if (!s->roots[0].ptr_leaf) { roots 75 security/selinux/ss/sidtab.c s->roots[0].ptr_leaf = kzalloc(SIDTAB_NODE_ALLOC_SIZE, roots 77 security/selinux/ss/sidtab.c if (!s->roots[0].ptr_leaf) roots 81 security/selinux/ss/sidtab.c if (!s->roots[l].ptr_inner) { roots 82 security/selinux/ss/sidtab.c s->roots[l].ptr_inner = kzalloc(SIDTAB_NODE_ALLOC_SIZE, roots 84 security/selinux/ss/sidtab.c if (!s->roots[l].ptr_inner) roots 86 security/selinux/ss/sidtab.c s->roots[l].ptr_inner->entries[0] = s->roots[l - 1]; roots 105 security/selinux/ss/sidtab.c entry = &s->roots[level]; roots 260 security/selinux/ss/sidtab.c rc = sidtab_find_context(s->roots[level], &pos, count, level, roots 445 security/selinux/ss/sidtab.c rc = sidtab_convert_tree(¶ms->target->roots[level], roots 446 security/selinux/ss/sidtab.c &s->roots[level], &pos, count, level, params); roots 490 security/selinux/ss/sidtab.c while (level && !s->roots[level].ptr_inner) roots 493 security/selinux/ss/sidtab.c sidtab_destroy_tree(s->roots[level], level); roots 76 security/selinux/ss/sidtab.h union sidtab_entry_inner roots[SIDTAB_MAX_LEVEL + 1];