// A linked list on the heap: built, reversed, summed. `list_done` gets the // finished list, the place for a tracer to look at it. #include #include struct node { long value; struct node *next; }; __attribute__((noinline)) static struct node *push(struct node *head, long value) { struct node *n = malloc(sizeof *n); n->value = value; n->next = head; return n; } __attribute__((noinline)) static struct node *reverse(struct node *head) { struct node *prev = NULL; while (head) { struct node *next = head->next; head->next = prev; prev = head; head = next; } return prev; } __attribute__((noinline)) long list_done(struct node *head) { long sum = 0; for (; head; head = head->next) sum += head->value; return sum; } int main(int argc, char **argv) { int n = argc > 1 ? atoi(argv[1]) : 6; struct node *head = NULL; for (int i = n; i >= 1; i--) head = push(head, i * i); head = reverse(head); printf("sum = %ld\n", list_done(head)); return 0; }