Compile with -Wstrict-prototypes and -std=c99

Makefile

 CC = $(CROSS)$(TARGET)gcc
 LINK = $(CROSS)$(TARGET)ld -o
 LIBRARY_LINK_OPTS =  -L. -r
-CFLAGS = -ggdb -Wall -Wextra -Wshadow -Wformat-security -O2
+CFLAGS = -O2 -ggdb -std=c99 -D_GNU_SOURCE
+CFLAGS += -Wall -Wextra -Wshadow -Wformat-security -Wstrict-prototypes
 RM = /bin/rm -f
 Q=@
 
-OBJS = queue.o list.o cbuf.o io.o log.o http_response.o asyncdns.o server.o misc.o
+OBJS = queue.o list.o cbuf.o io.o log.o http_response.o asyncdns.o \
+       server.o misc.o
+
 PROG = libfuncs.a
 
 all: $(PROG)

cbuf.c

 	}
 }
 
-void cbuf_test() {
+void cbuf_test(void) {
 	CBUF *in;
 
 	CBUF *out;

io.c

  * See LICENSE-MIT.txt for license terms.
  */
 
-/* Needed for POLLRDHUP */
-#define _GNU_SOURCE 1;
-
 #include <stdio.h>
 #include <stdlib.h>
 #include <stdarg.h>

list.c

 	return list;
 }
 
-void list_free(LIST **plist, void (*free_func)(), void (*freep_func)()) {
+void list_free(LIST **plist, void (*free_func)(void *), void (*freep_func)(void **)) {
 	LIST *list = *plist;
 	if (!list)
 		return;

list.h

 	for (elem = (list)->head->prev; elem != (list)->head && elem->data; elem = elem->prev)
 
 LIST *list_new			(char *listname);
-void list_free			(LIST **l, void (*l_free)(), void (*l_freep)());
+void list_free			(LIST **l, void (*l_free)(void *), void (*l_freep)(void **));
 
 void list_lock			(LIST *l);
 void list_unlock		(LIST *l);

log.c

 	OUT_FD = new_out_fd;
 }
 
-void log_close() {
+void log_close(void) {
 	logger->dying = 1;
 	int count = 0;
 	while (logger->queue->items && count++ < 250)

log.h

 #include <stdio.h>
 
 void log_init  (char *host_ident, int use_syslog, int use_stderr, char *log_host, int log_port);
-void log_close ();
+void log_close (void);
 
 void LOG (const char *msg);
 

queue.c

 #include "libfuncs.h"
 #include "queue.h"
 
-QUEUE *queue_new() {
+QUEUE *queue_new(void) {
 	pthread_mutex_t *mutex = malloc(sizeof(pthread_mutex_t));
 	if (pthread_mutex_init(mutex,NULL) != 0) {
 		perror("queue_new: mutex_init");

queue.h

 	int items;				// number of messages in queue
 } QUEUE;
 
-QUEUE *queue_new		();
+QUEUE *queue_new		(void);
 void queue_free			(QUEUE **q);
 
 void queue_add			(QUEUE *q, void *data);