Netlink: Handle alien routes with unsorted nexthops

static inline int nexthop_same(struct nexthop *x, struct nexthop *y)

{ return (x == y) || nexthop__same(x, y); }

struct nexthop *nexthop_merge(struct nexthop *x, struct nexthop *y, int rx, int ry, int max, linpool *lp);

struct nexthop *nexthop_sort(struct nexthop *x);

static inline void nexthop_link(struct rta *a, struct nexthop *from)

{ memcpy(&a->nh, from, nexthop_size(from)); }

void nexthop_insert(struct nexthop **n, struct nexthop *y);

}

static int

nexthop_compare_node(struct nexthop *x, struct nexthop *y)

nexthop_compare_node(const struct nexthop *x, const  struct nexthop *y)

{

  int r;

  *n = x;

}

struct nexthop *

nexthop_sort(struct nexthop *x)

{

  struct nexthop *s = NULL;

  /* Simple insert-sort */

  while (x)

  {

    struct nexthop *n = x;

    x = n->next;

    n->next = NULL;

    nexthop_insert(&s, n);

  }

  return s;

}

int

nexthop_is_sorted(struct nexthop *x)

{

      nh = RTNH_NEXT(nh);

    }

  /* Ensure nexthops are sorted to satisfy nest invariant */

  if (!nexthop_is_sorted(first))

    first = nexthop_sort(first);

  return first;

}