simplify this code by using the updated API

diff --git a/src/lib/util/pair_legacy.c b/src/lib/util/pair_legacy.c
index 465d9195631deb6de7b4aaf311c6d26ac25fa9ee..92e48d08114f5ecd0d43d64dc6cefd5280ab7933 100644 (file)
--- a/src/lib/util/pair_legacy.c
+++ b/src/lib/util/pair_legacy.c
@@ -519,20 +519,9 @@ redo:
                        goto leaf;
                } else {
                leaf:
-                       /*
-                        *      In the common case, we jump ahead one level.
-                        *
-                        *      But for ALIAS, we may jump ahead multiple levels.
-                        */
-                       if ((relative->da->depth + 1) == da->depth) {
-                               if (fr_pair_append_by_da(relative->ctx, &vp, relative->list, da) < 0) {
-                                       return fr_sbuff_error(&our_in);
-                               }
-                       } else {
-                               vp = fr_pair_afrom_da_depth_nested(relative->ctx, relative->list, da,
-                                                                  relative->da->depth);
-                               if (!vp) return fr_sbuff_error(&our_in);
-                       }
+                       vp = fr_pair_afrom_da_depth_nested(relative->ctx, relative->list, da,
+                                                          relative->da->depth);
+                       if (!vp) return fr_sbuff_error(&our_in);
                }
 
                fr_assert(vp != NULL);