Lines Matching defs:new
457 struct xfs_iext_node *new = kmem_zalloc(NODE_SIZE, KM_NOFS);
462 /* for sequential append operations just spill over into the new node */
464 *nodep = new;
472 new->keys[i] = node->keys[nr_keep + i];
473 new->ptrs[i] = node->ptrs[nr_keep + i];
480 *nodep = new;
488 new->keys[i] = XFS_IEXT_KEY_INVALID;
489 return new;
499 struct xfs_iext_node *node, *new;
506 new = NULL;
515 new = xfs_iext_split_node(&node, &pos, &nr_entries);
521 if (node != new && pos == 0 && nr_entries > 0)
531 if (new) {
532 offset = new->keys[0];
533 ptr = new;
545 struct xfs_iext_leaf *new = kmem_zalloc(NODE_SIZE, KM_NOFS);
550 /* for sequential append operations just spill over into the new node */
552 cur->leaf = new;
559 new->recs[i] = leaf->recs[nr_keep + i];
564 cur->leaf = new;
572 leaf->next->prev = new;
573 new->next = leaf->next;
574 new->prev = leaf;
575 leaf->next = new;
576 return new;
600 void *new;
606 new = krealloc(ifp->if_u1.if_root, new_size, GFP_NOFS | __GFP_NOFAIL);
607 memset(new + ifp->if_bytes, 0, new_size - ifp->if_bytes);
608 ifp->if_u1.if_root = new;
609 cur->leaf = new;
633 struct xfs_iext_leaf *new = NULL;
649 new = xfs_iext_split_leaf(cur, &nr_entries);
655 if (cur->leaf != new && cur->pos == 0 && nr_entries > 0) {
667 if (new)
668 xfs_iext_insert_node(ifp, xfs_iext_leaf_key(new, 0), new, 2);
982 struct xfs_bmbt_irec *new)
992 if (new->br_startoff != old.br_startoff) {
994 new->br_startoff, 1, cur->leaf);
999 xfs_iext_set(cur_rec(cur), new);