common.h

Go to the documentation of this file.

 
#ifndef __COMMON_H
#define __COMMON_H
 
/*
 * DEPENDENCIES
 */
 
#include <inttypes.h>
#include <regex.h>
#include <setjmp.h>
#include <stdarg.h>
#include <stdbool.h>
#include <stdint.h>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
 
#define MAX_FILE_SIZE 65536
 
#define MAX_LINE_LEN    256
 
#define MAX_TOKEN_LEN   256
 
#define MAX_ERROR_LEN   256
 
#define MAX_ID_LEN      256
 
typedef enum DecafType{
    UNKNOWN, INT, BOOL, VOID, STR
} DecafType;
 
const char* DecafType_to_string(DecafType type);
 
void print_escaped_string(const char* string, FILE* output);
 
void Error_throw_printf (const char* format, ...);
 
#define CHECK_MALLOC_PTR(P) \
    if (P == NULL) { \
        printf("Out of memory!\n"); \
        exit(EXIT_FAILURE); \
    }
 
#define DECL_LIST_TYPE(NAME, ELEMTYPE) \
  \
    typedef struct NAME ## List { \
        ELEMTYPE head;  \
        ELEMTYPE tail;  \
        int size;       \
    } NAME ## List; \
    \
 \
    NAME ## List* NAME ## List_new (); \
    \
 \
    void NAME ## List_add (NAME ## List* list, ELEMTYPE item); \
    \
 \
    int NAME ## List_size (NAME ## List* list); \
    \
 \
    bool NAME ## List_is_empty (NAME ## List* list); \
    \
 \
    void NAME ## List_free (NAME ## List* list);
 
#define DEF_LIST_IMPL(NAME, ELEMTYPE, FREEFUNC) \
    NAME ## List* NAME ## List_new () \
    { \
        NAME ## List* list = (NAME ## List*)calloc(1, sizeof(NAME ## List)); \
        CHECK_MALLOC_PTR(list); \
        list->head = NULL; \
        list->tail = NULL; \
        list->size = 0; \
        return list; \
    } \
    void NAME ## List_add (NAME ## List* list, ELEMTYPE item) \
    { \
        if (list->head == NULL) { \
            list->head = item; \
            list->tail = item; \
        } else { \
            list->tail->next = item; \
            list->tail = item; \
        } \
        list->size++; \
    } \
    int NAME ## List_size (NAME ## List* list) \
    { \
        return list->size; \
    } \
    bool NAME ## List_is_empty (NAME ## List* list) \
    { \
        return (list->size == 0); \
    } \
    void NAME ## List_free (NAME ## List* list) \
    { \
        ELEMTYPE next = list->head; \
        while (next != NULL) { \
            ELEMTYPE cur = next; \
            next = cur->next; \
            FREEFUNC(cur); \
        } \
        free(list); \
    }
 
#define FOR_EACH(TYPE, VARIABLE, CONTAINER) \
    for (TYPE VARIABLE = (CONTAINER)->head; \
         VARIABLE != NULL; \
         VARIABLE = VARIABLE->next)
 
#endif