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

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



int main() {













// C

struct req {
        int pri, rqr;
        LIST_ENTRY(req) d;
};
LIST_HEAD(reql, req);

struct reql reqs;
LIST_INIT(&reqs);

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

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











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

}