source: doc/theses/mike_brooks_MMath/programs/lst-issues-intrusive.run.c @ a47fe52

#include <sys/queue.h>
#include <stdio.h>



int main() {













// C

struct req {
  int pri, rqr;
  LIST_ENTRY(req) x;
};

LIST_HEAD(reql, req);

struct reql reqs;
LIST_INIT(&reqs);

struct req
  r1 = {1, 42},
  r2 = {2, 42};

LIST_INSERT_HEAD(
  &reqs, &r2, x);
LIST_INSERT_HEAD(
  &reqs, &r1, x);











struct req *cur;
LIST_FOREACH(cur, &reqs, x)
    printf("{%d %d} ", cur->pri, cur->rqr);
printf("\n");

}