- Timestamp:
- May 6, 2024, 1:16:32 PM (6 months ago)
- Branches:
- master
- Children:
- ac16a55
- Parents:
- 123e8b9
- File:
-
- 1 edited
Legend:
- Unmodified
- Added
- Removed
-
doc/theses/mike_brooks_MMath/programs/lst-issues-intrusive.run.c
r123e8b9 r1379c96e 22 22 struct req { 23 23 int pri, rqr; 24 LIST_ENTRY(req) x;24 LIST_ENTRY(req) d; 25 25 }; 26 27 26 LIST_HEAD(reql, req); 28 27 … … 30 29 LIST_INIT(&reqs); 31 30 32 struct req 33 r1 = {1, 42}, 34 r2 = {2, 42}; 31 struct req r1 = {1, 42}, r2 = {2, 42}; 35 32 36 LIST_INSERT_HEAD( 37 &reqs, &r2, x); 38 LIST_INSERT_HEAD( 39 &reqs, &r1, x); 33 LIST_INSERT_HEAD(&reqs, &r2, d); 34 LIST_INSERT_HEAD(&reqs, &r1, d); 40 35 41 36 … … 50 45 51 46 struct req *cur; 52 LIST_FOREACH(cur, &reqs, x)47 LIST_FOREACH(cur, &reqs, d) 53 48 printf("{%d %d} ", cur->pri, cur->rqr); 54 49 printf("\n");
Note: See TracChangeset
for help on using the changeset viewer.