Lines Matching defs:new
1620 * @new: The new gap value.
1626 unsigned long new)
1645 pgaps[offset] = new;
1647 if (meta_gap == new)
1651 if (meta_gap > new)
1655 } else if (new < meta_gap) {
1656 new = ma_max_gap(pnode, pgaps, pmt, &meta_offset);
1722 * mas_put_in_tree() - Put a new node in the tree, smp_wmb(), and mark the old
1724 * @mas - the maple state with the new node
1753 * @mas - the ma_state with @mas->node pointing to the new node.
2129 /* Store the new entry. */
2138 /* Handle new range ending before old range ends */
2346 * data already in the new tree (@mast->l and @mast->r).
2373 * mas_new_ma_node() - Create and return a new maple node. Helper function.
2377 * Use the node type from the maple_big_node to allocate a new node from the
2380 * Return: A new maple encoded node
2562 * mas_topiary_replace() - Replace the data with new data, then repair the
2563 * parent links within the new tree. Iterate over the dead sub-tree and collect
2566 * The new tree will have up to three children with the correct parent. Keep
2567 * track of the new entries as they need to be followed to find the next level
2568 * of new entries.
2574 * @mas: The maple state pointing at the new data
2677 /* Insert the new data in the tree */
2856 * to account of what has been copied into the new sub-tree. The update of
2859 * the new sub-tree in case the sub-tree becomes the full tree.
2894 * rippling up the tree to limit the amount of churn. Once a new sub-section of
2895 * the tree is created, there may be a mix of new and old nodes. The old nodes
2897 * original tree and the partially new tree. To remedy the parent pointers in
2898 * the old tree, the new data is swapped into the active tree and a walk down
2940 /* May be a new root stored in mast->bn */
2987 * Rebalance two nodes into a single node or two new nodes that are sufficient.
3011 * entire range of the tree, then that node is used as a new root node.
3168 * @height: The height of the tree in case it's a new root.
3201 * @skip: The number of entries to skip for new nodes insertion.
3543 /* swap the new root into the tree */
3767 * mas_new_root() - Create a new root node that only contains the entry passed
3815 * and new nodes where necessary, then place the sub-tree in the actual tree.
3853 * Node rebalancing may occur due to this store, so there may be three new
3854 * entries per level plus a new root.
3960 /* Handle insert of new range starting after old range */
3966 /* Store the new entry and range end. */
4047 * Only update gap when the new entry is empty or there is an empty
4286 * Inserting a new range inserts either 0, 1, or 2 pivots within the
4288 * of NULL, then the slot only needs to be written with the new value.
4291 * the new range is within a gap but does not touch any other ranges,
4293 * usual, the entry must be written. Most operations require a new node
5615 * Sometimes it is necessary to duplicate a tree to a new tree, such as
5616 * forking a process and duplicating the VMAs from one tree to a new
5617 * tree. When such a situation arises, it is known that the new tree is
5640 /* Add working room for split (2 nodes) + new parents */