/*
 * Misc utilities
 *
 * (c) Philippe, philippe_44@outlook.com
 *
 * See LICENSE file
 *
 */

#pragma once

#include <stdint.h>
#if __has_include("pthread.h")
#include "pthread.h"
#define HAS_PTHREAD
#else 
#endif

#include "platform.h"

#define NFREE(p) do {	\
	if (p) {			\
		free(p);		\
		p = NULL;		\
	}					\
} while (0)

/*
Queues (N+1 elements in a linked list, pointed item = NULL means last element)
*/
typedef struct {
#ifdef HAS_PTHREAD
	pthread_mutex_t* mutex;
#elif defined(_WIN32)
	HANDLE* mutex;
#else 
	void* mutex;
#endif
	void (*cleanup)(void*);
	struct _cross_queue_s {
		struct _cross_queue_s* next;
		void* item;
	} head, *walker;
	bool walk;
} cross_queue_t;

void	queue_init(cross_queue_t *queue, bool mutex, void (*f)(void*));
void	queue_insert(cross_queue_t *queue, void *item);
void	queue_insert_first(cross_queue_t* queue, void* item);
void	queue_lock(cross_queue_t* queue);
void	queue_unlock(cross_queue_t* queue);
void*	queue_extract(cross_queue_t *queue);
void	queue_flush(cross_queue_t *queue);
void	queue_free_item(cross_queue_t* queue, void* item);
bool	queue_extract_item(cross_queue_t* queue, void* item);
size_t	queue_count(cross_queue_t* queue);

// these are needed if current item is deleted during walk - this is not thread-safe
void*	queue_walk_start(cross_queue_t* queue);
void	queue_walk_end(cross_queue_t* queue);
void*	queue_walk_next(cross_queue_t* queue);
void*   queue_walk_extract(cross_queue_t* queue);


/*
Linked lists (each item can be cast to a list core structure)
*/
typedef struct cross_list_s {
	struct cross_list_s* next;
} cross_list_t;

cross_list_t*	list_push(cross_list_t *item, cross_list_t **list);
cross_list_t*	list_add_tail(cross_list_t *item, cross_list_t **list);
cross_list_t*	list_add_ordered(cross_list_t *item, cross_list_t **list, int (*compare)(void *a, void *b));
cross_list_t*	list_pop(cross_list_t **list);
cross_list_t*   list_remove(cross_list_t *item, cross_list_t **list);
void 			list_clear(cross_list_t **list, void (*free_func)(void *));

/* 
Key-Value tools
*/
typedef struct key_data_s {

	char *key;
	char *data;
} key_data_t;

char*		kd_lookup(key_data_t *kd, char *key);
bool 		kd_add(key_data_t *kd, const char *key, const char *value);
bool 		kd_vadd(key_data_t *kd, const char *key, const char *fmt, ...);
char* 		kd_dump(key_data_t *kd);
void 		kd_free(key_data_t *kd);

/*
String tools
*/
char* strextract(char* s1, char* beg, char* end);
char* strltrim(char* s);
char* strrtrim(char* s);
char* strtrim(char* s);
int   strremovechar(char* str, char c);

/*
WWW tools
*/
char* url_encode(char* str);
char* url_decode(char* str);
char* xml_encode(char* src);

/*
Base64 tools
*/
int base64_encode(const void* data, int size, char** str);
int base64_decode(const char* str, void* data);

/*
Kitchen sink
*/
uint32_t	gettime_ms(void);
uint64_t	gettime_ms64(void);
uint64_t 	gettime_us(void);
uint32_t	hash32(char* str);
int			hex2bytes(char* hex, uint8_t** bytes);
int			bytes2hex(uint8_t* bytes, size_t len, char** hex);
void		touch_memory(uint8_t* buf, size_t size);