函数接受结构指针和返回结构指针有奇怪的行为？(代码片段)

我的代码我调用了insert函数，它传递一个指向struct（table）的指针，insert函数接收一个指针并执行一些操作并再次返回它。但是运行代码会导致分段错误。当我尝试使用传递的指针访问struct数组中的值。

#include <stdio.h>
#include <stdlib.h>
#include <ctype.h>
#define __USE_BSD
#include <string.h>

#include "speller.h"
#include "dict.h"

typedef struct 
 // hash-table entry
  Key_Type element; // only data is the key itself
  enum empty, in_use, deleted state;
 cell;

typedef unsigned int Table_size; // type for size-of or index-into hash table

struct table 

  cell *cells; Table_size table_size; // cell cells [table_size];
  Table_size num_entries; // number of cells in_use
  // add anything else that you need
;

int hashfunc(Key_Type k, Table_size size)

    printf("enterd
");
    char * d = k;
    int hash = 0;
    int c;
    printf("%s
", d);
    printf("wtf??
");
    while (c = *d++)
    
        printf("maybehere??
");
        hash = hash + c;
    
    hash = hash%size;
    printf("%d
", hash);
    return hash;


Table initialize_table (Table_size size) 

    Table t = malloc(sizeof(struct table));
    t->table_size = size;
    cell hash_table[size];
    for (int i=0; i<size; i++)
    
        hash_table[i].state = empty;
        hash_table[i].element = "-";
        //printf("initialised
");
    
    t->num_entries = 0;
    t->cells = hash_table;
    /*for (int i = 0; i < t->table_size; i++)
    
        printf("%d %s
", i, (t->cells + i)->element);
    */
    return t;


int a = 0;
Table insert (Key_Type k, Table t) 

    //printf("insert called %d
", a);
    printf("%d
", t->table_size);
    //printf("%s
", (t->cells + 2)->element);
    // as soon as program reaches here i get output like - 1 (NULL) 
    2 (NULL) and then segmentation fault
    for (int i = 0; i < t->table_size; i++)
    
        printf("%d %s
", i, (t->cells + i)->element);
    
    a++;
    printf("%s
", k);
    int hash_code = hashfunc(k, t->table_size);
    // Linear Probing
    printf("im here
");
    while(strcmp((t->cells + hash_code)->element,"-") != 0)
    
        if (strcmp((t->cells + hash_code)->element,k) == 0)
        
            printf("return at if
");
            return t;
        
        else if (hash_code == (t->table_size - 1))
            hash_code = 0;
        else
            hash_code++;
    
    (t->cells + hash_code)->element = k;
    (t->cells + hash_code)->state = in_use;
    t->num_entries += 1;
    printf("return at end with value %s
", k);
    printf("inserted value %s
", (t->cells + hash_code)->element);
    return t;



Boolean find (Key_Type k, Table t) 

    return FALSE;


void print_table (Table t) 

    Table_size size = t->table_size;
    for (int i = 0; i<size; i++)
    
        if (strcmp((t->cells + i)->element,"-") != 0)
            printf("%d %s
", i, (t->cells + i)->element);
    


void print_stats (Table t) 



void main()


    Table table;
    Table_size table_size = 19;
    int a = 5;
    Key_Type input[5] = "a","b","ab","abc","abcd";
    table= initialize_table (table_size);
    //printf("%s
", input[1]);
    while (a)
    
        table= insert("a",table);
        a--;
    
    printf("printing table
");
    print_table(table);

这是dict.h代码

typedef char* Key_Type;
typedef struct table* Table;    // allows different definitions of struct table

Table initialize_table ();      // allows different parameters
Table insert (Key_Type, Table);
Boolean find (Key_Type, Table);
void print_table (Table);
void print_stats (Table);

这是speller.h代码

typedef enum FALSE, TRUE Boolean;

extern int verbose; // used to control monitoring output
extern int mode;    // used to control your algorithm

extern char *prog_name; // used by check

void check (void *memory) ; // check result from strdup, malloc etc.

我相信我不明白指针在这个程序中是如何工作的。