#include <stdio.h>
#include <stdlib.h>
#include <stdbool.h>
#include <assert.h>

typedef struct _Node { // 12+ bytes
    int value;          // 4 bytes
    struct _Node* next; // 8 bytes
} Node;

#define log_int(n) printf("%s == %d\n", #n, n)

void print_list(const Node* head) {
    const Node* node = head;
    // not great code quality, we could write this better
    while (node != NULL) {
        printf("[%d]->", node->value);
        node = node->next;
    }
    printf("NULL\n");
}

void destroy_list(Node* head) {
    Node* node = head;
    while (node != NULL) {
        Node* next = node->next;
        free(node);
        node = next;
    }

}

int get_size_of_list(const Node* head) {
    int size = 0;
    for (const Node* node = head; node != NULL; node = node->next) {
        size += 1;
    }
    return size;
}

int main(int argc, char* argv[]) {
    Node* head = NULL;
    print_list(head);

    Node* new_node = malloc(sizeof(*new_node));
    *new_node = (Node) { .value = 1, .next = NULL };
    head = new_node;
    print_list(head);

    new_node = malloc(sizeof(*new_node));
    *new_node = (Node) { .value = 2, .next = NULL };
    head->next = new_node;
    print_list(head);
    print_list(new_node);

    new_node = malloc(sizeof(*new_node));
    *new_node = (Node) { .value = 3, .next = NULL };
    head->next->next = new_node;
    print_list(head);
    print_list(head->next);

    log_int(head->value);
    log_int(head->next->value);
    log_int(head->next->next->value);
    log_int(get_size_of_list(head));
    log_int(get_size_of_list(head->next));

    destroy_list(head);

    return EXIT_SUCCESS;
}
/* vim: set tabstop=4 shiftwidth=4 fileencoding=utf-8 noexpandtab: */