Change Details

RB_INSERT_AT is the last part of RB_INSERT that happens after the search for where to insert the new node is complete. If someone has completed that search already, RB_INSERT_AT allows them to insert without duplicate search. The searches for free gaps in iommu_gas_*match offer such an opportunity, so RB_INSERT_AT is used for those insertions.

When the node to insert in the rb_tree is known to precede or follow a particular node, new methods RB_INSERT_PREV and RB_INSERT_NEXT, defined here, allow the search for where to insert the new node begin with that particular node, rather than at the root, to save a bit of time. Using those methods, instead of RB_INSERT, in managing a tree in iommu_gas.c, saves a wee bit of time.

RB_INSERT_AT is the last part of RB_INSERT that happens afterWhen the node to insert in the rb_tree is known to precede or follow a particular node, new methods RB_INSERT_PREV and RB_INSERT_NEXT, defined here, allow the search for where to insert the new node is complete. If someone has completed that search alreadybegin with that particular node, rather than at the root, to save a bit of time. Using those methods, RB_INSERT_AT allows them to insert without duplicate search. The searches for free gaps in iommu_gas_*match offer such an opportunityinstead of RB_INSERT, in managing a tree in iommu_gas.c, so RB_INSERT_AT is used for those insertionssaves a wee bit of time.