List<Integer> ls = [2, 1, 5, 8, 4, 9]
List<Integer> ls_asc = Arrays.sort(ls, new Comparator<Integer>() {
  public int compare(Integer a, Integer b) { return b - a; }
});

#include "gt-passes.h"

char *pass_type_names[] = {"GIMPLE_PASS", "RTL_PASS", "SIMPLE_IPA_PASS", "IPA_PASS"};

void dump_opt_pass(FILE *fp, struct opt_pass *pass, int indent) {
  int i; struct opt_pass *p = pass;

  while (p != NULL) {
    for (i = 0; i < indent; i++) {
      if (i % 4 == 0) fprintf(fp, "|");
      else if (i == indent - 1) fprintf(fp, ">");
      else if (i == indent - 2) fprintf(fp, "-");
      else if (i == indent - 3) fprintf(fp, "-");
      else fprintf(fp, " ");
    }
    fprintf(fp, "  %-16s [%s]\n", p->name, pass_type_names[p->type]);

    if (p->sub != NULL) dump_opt_pass(fp, p->sub, indent + 4);
    p = p->next;
  }
}

a: ds fds e
b: a
c: b a

a: ds fds e
b: $a
c: $b $a

a {
  b {
    c
  }
  d
}

self: a
next:
  self: b
  next:
    self: c
    next: null

{
  a
  {
    b
    c
  }
  d
  {}
}

inline int llist_add(linked_list *list, void *obj);
inline void llist_remove(linked_list *list, int idx);
inline void llist_travse(linked_list *list, void (*)(void *));
inline void llist_deep_travse(linked_list *list, void (*)(void *));
inline int llist_find(linked_list *list, void *obj);
inline void *llist_shift(linked_list *list);
inline size_t llist_len(linked_list *list);

struct item_st {
  _Bool is_list;
  union {
    linked_list *ls;
    size_t ptr;
  };
}

typedef struct lnode_st {
  void *self; lnode_st *sub; lnode_st *next;
} lnode;

nodea {
  a
  b
  c {
   d {
   }
  }
}

node b {

}

c
d
e