Lines Matching defs:new
462 * Allocate a new one, copy the record, re-get the buffers.
473 struct xfs_btree_cur *new; /* new cursor value */
480 * Allocate a new cursor like the old one.
482 new = cur->bc_ops->dup_cursor(cur);
487 new->bc_rec = cur->bc_rec;
492 for (i = 0; i < new->bc_nlevels; i++) {
493 new->bc_levels[i].ptr = cur->bc_levels[i].ptr;
494 new->bc_levels[i].ra = cur->bc_levels[i].ra;
502 xfs_btree_del_cursor(new, error);
507 new->bc_levels[i].bp = bp;
509 *ncur = new;
1065 struct xfs_buf *bp) /* new buffer to set */
1811 * Otherwise throw it away and get a new one.
2285 /* Fill in the new contents and log them. */
2298 /* Pass new key value up to our parent. */
2313 * Update cur to reflect the new path.
2510 * Update cur to reflect the new path.
2597 /* Now put the new data in, and log it. */
2616 /* Now put the new data in, and log it. */
2678 * Return new block number and the key to its first
2718 /* Allocate the new block. If we can't do it, we're toast. Give up. */
2726 /* Set up the new block as "right". */
2731 /* Fill in the btree header for the new right block. */
2735 * Split the entries between the old and the new block evenly.
2737 * each new block will have the same number of entries.
2754 * new block, the right. Update the right block and log the
2775 /* Copy the keys & pointers to the new block. */
2782 /* Stash the keys of the new block for later insertion. */
2792 /* Copy records to the new block. */
2796 /* Stash the keys of the new block for later insertion. */
2813 * If there's a block to the new block's right, make that block
2920 * AGF <> worker queue deadlocks if the BMBT block allocation has to lock new
2984 union xfs_btree_ptr nptr; /* new block addr */
2998 /* Allocate the new block. If we can't do it, we're toast. Give up. */
3073 * Allocate a new root block, fill it in.
3085 struct xfs_buf *nbp; /* new (root) buffer */
3086 struct xfs_btree_block *new; /* new (root) btree block */
3087 int nptr; /* new value for key index, 1 or 2 */
3098 /* Allocate the new block. If we can't do it, we're toast. Give up. */
3106 /* Set up the new block. */
3107 error = xfs_btree_get_buf_block(cur, &lptr, &new, &nbp);
3116 * and the new block generated when it was split. We don't know which
3152 /* Fill in the new block's btree header and log it. */
3158 /* Fill in the key data in the new root. */
3165 xfs_btree_key_addr(cur, 1, new));
3167 xfs_btree_key_addr(cur, 2, new));
3175 xfs_btree_key_addr(cur, 1, new));
3177 xfs_btree_key_addr(cur, 2, new));
3181 /* Fill in the pointer data in the new root. */
3183 xfs_btree_ptr_addr(cur, 1, new), &lptr, 1);
3185 xfs_btree_ptr_addr(cur, 2, new), &rptr, 1);
3208 int *index, /* new tree index */
3209 union xfs_btree_ptr *nptr, /* new btree ptr */
3210 struct xfs_btree_cur **ncur, /* new btree cursor */
3211 union xfs_btree_key *key, /* key of new block */
3279 struct xfs_btree_cur **curp, /* output: new cursor replacing cur */
3284 union xfs_btree_ptr nptr; /* new block ptr */
3285 struct xfs_btree_cur *ncur = NULL; /* new btree cursor */
3286 union xfs_btree_key nkey; /* new block key */
3300 * root level, allocate a new root block and we're done.
3331 /* Check that the new entry is being inserted in the right place. */
3344 * If the block is full, we can't insert the new entry until we
3369 * At this point we know there's room for our new entry in the block
3395 /* Now put the new data in, bump numrecs and log it. */
3416 /* Now put the new data in, bump numrecs and log it. */
3428 /* Log the new number of records in the btree header. */
3432 * If we just inserted into a new tree block, we have to
3436 * some records into the new tree block), so use the regular key
3457 * Return the new block number, if any.
3490 union xfs_btree_ptr nptr; /* new block number (split result) */
3491 struct xfs_btree_cur *ncur; /* new cursor (split result) */
3535 * if ncur is a new cursor or we're about to be done.
3545 /* If we got a new cursor, switch to it. */
3850 * Make it the new root of the btree.