Lines Matching refs:prior
2134 nfs4_ephemeral_t *prior;
2217 prior = mi_parent->mi_ephemeral;
2218 if (prior == NULL) {
2231 if (prior->ne_child == NULL) {
2232 prior->ne_child = eph;
2234 child = prior->ne_child;
2236 prior->ne_child = eph;
2242 eph->ne_prior = prior;
2282 nfs4_ephemeral_t *prior;
2285 prior = e->ne_prior;
2291 if (prior) {
2292 if (prior->ne_child == e) {
2293 prior->ne_child = peer;
2295 prior->ne_peer = peer;
2299 peer->ne_prior = prior;
2319 nfs4_ephemeral_t *prior;
2332 prior = e;
2353 prior = e;
2370 * Note that prior can only be NULL if
2374 prior = e->ne_prior;
2415 ASSERT(prior == NULL);
2420 * Stitch up the prior node. Note that since
2421 * we have handled the root of the tree, prior
2424 ASSERT(prior != NULL);
2425 if (prior->ne_child == e) {
2426 prior->ne_child = NULL;
2428 ASSERT(prior->ne_peer == e);
2430 prior->ne_peer = NULL;
2433 e = prior;
2779 nfs4_ephemeral_t *e, nfs4_ephemeral_t *prior)
2791 if (prior) {
2792 if (prior->ne_child == e)
2793 prior->ne_state |=
2796 prior->ne_state |=
2839 nfs4_ephemeral_t *prior;
2920 prior = e->ne_prior;
2926 * If your prior node is a parent,
2930 * However, if your prior is a sibling,
2933 if (prior) {
2934 if (prior->ne_child == e)
2935 prior->ne_state |=
2938 prior->ne_state |=
2950 e = prior;
2955 prior = e->ne_prior;
2957 if (prior) {
2958 if (prior->ne_child == e)
2959 prior->ne_state =
2962 prior->ne_state =
2974 prior = e->ne_prior;
3003 e, prior);
3006 e = prior;