extern void abort(void);
#include <assert.h>
void reach_error() { assert(0); }
/*
 * Create NULL-terminated sll of size 2: 1-1
 * Remove all nodes in a backward traversal. Check result.
 */
#include <stdlib.h>

typedef struct node {
  int data;
  struct node* next;
} *SLL;

void myexit(int s) {
 _EXIT: goto _EXIT;
}

SLL node_create(int data) {
  SLL temp = (SLL) malloc(sizeof(struct node));
  if(NULL == temp) {
    myexit(1);
  }
  temp->next = NULL;
  temp->data = data;
  return temp;
}

SLL sll_create(int len, int data) {
  SLL head = NULL;
  for(; len > 0; len--) {
    SLL new_head = node_create(data);
    new_head->next = head;
    head = new_head;
  }
  return head;
}

void sll_remove_last(SLL* head) {
  if(NULL == (*head)->next) {
    free(*head);
    *head = NULL;
  } else {
    SLL snd_to_last = NULL;
    SLL last = *head;
    while(last->next) {
      snd_to_last = last;
      last = last->next;
    }
    snd_to_last->next = NULL;
    free(last);
  }
}

int main() {
  const int len = 2;
  const int data = 1;
  SLL s = sll_create(len, data);
  int i;
  for(i = len - 1; i >= 0; i--) {
    sll_remove_last(&s);
  }
  if(NULL != s) {
    goto ERROR;
  }
  return 0;
 ERROR: {reach_error();abort();}
  return 1;
}