2010-10-27 19:51:49 +02:00
|
|
|
/*
|
2011-03-05 13:44:21 +01:00
|
|
|
* This software is licensed under the terms of the MIT-License
|
2017-02-11 04:52:08 +01:00
|
|
|
* See COPYING for further information.
|
2011-03-05 13:44:21 +01:00
|
|
|
* ---
|
|
|
|
* Copyright (C) 2011, Lukas Weber <laochailan@web.de>
|
2010-10-27 19:51:49 +02:00
|
|
|
*/
|
|
|
|
|
|
|
|
#include "list.h"
|
|
|
|
|
|
|
|
#include <stdlib.h>
|
2010-11-28 12:54:13 +01:00
|
|
|
#include <stdio.h>
|
2011-05-13 19:03:02 +02:00
|
|
|
#include "global.h"
|
2010-10-27 19:51:49 +02:00
|
|
|
|
|
|
|
typedef struct {
|
|
|
|
void *next;
|
|
|
|
void *prev;
|
|
|
|
} List;
|
|
|
|
|
2011-05-13 19:03:02 +02:00
|
|
|
void *_FREEREF;
|
|
|
|
|
2010-10-27 19:51:49 +02:00
|
|
|
void *create_element(void **dest, int size) {
|
2012-08-17 15:37:09 +02:00
|
|
|
List *e = malloc(size);
|
|
|
|
List **d = (List **)dest;
|
2012-08-17 16:20:05 +02:00
|
|
|
|
2012-08-17 15:59:31 +02:00
|
|
|
e->next = NULL;
|
|
|
|
e->prev = *d;
|
2012-08-17 16:20:05 +02:00
|
|
|
|
2012-08-17 15:37:09 +02:00
|
|
|
if(*d != NULL) {
|
2012-08-17 15:59:31 +02:00
|
|
|
e->next = (*d)->next;
|
|
|
|
if((*d)->next)
|
|
|
|
((List *)(*d)->next)->prev = e;
|
2017-02-11 04:52:08 +01:00
|
|
|
|
|
|
|
(*d)->next = e;
|
2012-08-17 15:59:31 +02:00
|
|
|
} else {
|
|
|
|
*d = e;
|
2012-08-17 15:37:09 +02:00
|
|
|
}
|
2017-02-11 04:52:08 +01:00
|
|
|
|
2010-10-27 19:51:49 +02:00
|
|
|
return e;
|
|
|
|
}
|
|
|
|
|
2017-02-11 04:52:08 +01:00
|
|
|
void delete_element(void **dest, void *e) {
|
2010-10-27 19:51:49 +02:00
|
|
|
if(((List *)e)->prev != NULL)
|
|
|
|
((List *)((List *)e)->prev)->next = ((List *)e)->next;
|
|
|
|
if(((List *)e)->next != NULL)
|
2017-02-11 04:52:08 +01:00
|
|
|
((List *)((List *)e)->next)->prev = ((List *)e)->prev;
|
2010-10-27 19:51:49 +02:00
|
|
|
if(*dest == e)
|
|
|
|
*dest = ((List *)e)->next;
|
2017-02-11 04:52:08 +01:00
|
|
|
|
2010-10-27 19:51:49 +02:00
|
|
|
free(e);
|
|
|
|
}
|
|
|
|
|
2011-05-08 13:48:25 +02:00
|
|
|
void delete_all_elements(void **dest, void (callback)(void **, void *)) {
|
2010-10-27 19:51:49 +02:00
|
|
|
void *e = *dest;
|
|
|
|
void *tmp;
|
2017-02-11 04:52:08 +01:00
|
|
|
|
2010-10-27 19:51:49 +02:00
|
|
|
while(e != 0) {
|
|
|
|
tmp = e;
|
|
|
|
e = ((List *)e)->next;
|
2011-04-26 22:39:50 +02:00
|
|
|
callback(dest, tmp);
|
2011-05-13 19:03:02 +02:00
|
|
|
}
|
2017-02-11 04:52:08 +01:00
|
|
|
|
2010-10-27 19:51:49 +02:00
|
|
|
*dest = NULL;
|
2010-11-14 13:24:56 +01:00
|
|
|
}
|
2011-05-13 19:03:02 +02:00
|
|
|
|
2017-02-28 18:16:38 +01:00
|
|
|
void delete_all_elements_witharg(void **dest, void (callback)(void **, void *, void *), void *arg) {
|
|
|
|
void *e = *dest;
|
|
|
|
void *tmp;
|
|
|
|
|
|
|
|
while(e != 0) {
|
|
|
|
tmp = e;
|
|
|
|
e = ((List *)e)->next;
|
|
|
|
callback(dest, tmp, arg);
|
|
|
|
}
|
|
|
|
|
|
|
|
*dest = NULL;
|
|
|
|
}
|
|
|
|
|
2017-02-28 15:38:02 +01:00
|
|
|
#ifdef DEBUG
|
|
|
|
// #define DEBUG_REFS
|
|
|
|
#endif
|
|
|
|
|
|
|
|
#ifdef DEBUG_REFS
|
|
|
|
#define REFLOG(...) fprintf(stderr, __VA_ARGS__);
|
|
|
|
#else
|
|
|
|
#define REFLOG(...)
|
|
|
|
#endif
|
|
|
|
|
2011-05-13 19:03:02 +02:00
|
|
|
int add_ref(void *ptr) {
|
2017-02-28 15:38:02 +01:00
|
|
|
int i, firstfree = -1;
|
2017-02-11 04:52:08 +01:00
|
|
|
|
2011-05-13 19:03:02 +02:00
|
|
|
for(i = 0; i < global.refs.count; i++) {
|
2011-07-07 14:34:30 +02:00
|
|
|
if(global.refs.ptrs[i].ptr == ptr) {
|
|
|
|
global.refs.ptrs[i].refs++;
|
2017-02-28 15:38:02 +01:00
|
|
|
REFLOG("increased refcount for %p (ref %i): %i\n", ptr, i, global.refs.ptrs[i].refs);
|
2011-05-13 19:03:02 +02:00
|
|
|
return i;
|
2017-02-28 15:38:02 +01:00
|
|
|
} else if(firstfree < 0 && global.refs.ptrs[i].ptr == FREEREF) {
|
|
|
|
firstfree = i;
|
2011-05-13 19:03:02 +02:00
|
|
|
}
|
|
|
|
}
|
2017-02-11 04:52:08 +01:00
|
|
|
|
2017-02-28 15:38:02 +01:00
|
|
|
if(firstfree >= 0) {
|
|
|
|
global.refs.ptrs[firstfree].ptr = ptr;
|
|
|
|
global.refs.ptrs[firstfree].refs = 1;
|
|
|
|
REFLOG("found free ref for %p: %i\n", ptr, firstfree);
|
|
|
|
return firstfree;
|
2011-07-07 14:34:30 +02:00
|
|
|
}
|
2017-02-11 04:52:08 +01:00
|
|
|
|
2011-07-07 14:34:30 +02:00
|
|
|
global.refs.ptrs = realloc(global.refs.ptrs, (++global.refs.count)*sizeof(Reference));
|
|
|
|
global.refs.ptrs[global.refs.count - 1].ptr = ptr;
|
|
|
|
global.refs.ptrs[global.refs.count - 1].refs = 1;
|
2017-02-28 15:38:02 +01:00
|
|
|
REFLOG("new ref for %p: %i\n", ptr, global.refs.count - 1);
|
2017-02-11 04:52:08 +01:00
|
|
|
|
2011-05-13 19:03:02 +02:00
|
|
|
return global.refs.count - 1;
|
|
|
|
}
|
|
|
|
|
|
|
|
void del_ref(void *ptr) {
|
|
|
|
int i;
|
2017-02-11 04:52:08 +01:00
|
|
|
|
2011-05-13 19:03:02 +02:00
|
|
|
for(i = 0; i < global.refs.count; i++)
|
2011-07-07 14:34:30 +02:00
|
|
|
if(global.refs.ptrs[i].ptr == ptr)
|
|
|
|
global.refs.ptrs[i].ptr = NULL;
|
2011-05-13 19:03:02 +02:00
|
|
|
}
|
|
|
|
|
|
|
|
void free_ref(int i) {
|
2011-07-07 14:34:30 +02:00
|
|
|
if(i < 0)
|
|
|
|
return;
|
2017-02-11 04:52:08 +01:00
|
|
|
|
2011-07-07 14:34:30 +02:00
|
|
|
global.refs.ptrs[i].refs--;
|
2017-02-28 15:38:02 +01:00
|
|
|
REFLOG("decreased refcount for %p (ref %i): %i\n", global.refs.ptrs[i].ptr, i, global.refs.ptrs[i].refs);
|
|
|
|
|
2011-07-07 14:34:30 +02:00
|
|
|
if(global.refs.ptrs[i].refs <= 0) {
|
|
|
|
global.refs.ptrs[i].ptr = FREEREF;
|
|
|
|
global.refs.ptrs[i].refs = 0;
|
2017-02-28 15:38:02 +01:00
|
|
|
REFLOG("ref %i is now free\n", i);
|
2011-07-07 14:34:30 +02:00
|
|
|
}
|
2017-02-23 11:43:45 +01:00
|
|
|
}
|
2017-02-28 15:38:02 +01:00
|
|
|
|
|
|
|
void free_all_refs(void) {
|
|
|
|
int inuse = 0;
|
|
|
|
int inuse_unique = 0;
|
|
|
|
|
|
|
|
for(int i = 0; i < global.refs.count; i++) {
|
|
|
|
if(global.refs.ptrs[i].refs) {
|
|
|
|
inuse += global.refs.ptrs[i].refs;
|
|
|
|
inuse_unique += 1;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
if(inuse) {
|
|
|
|
warnx("free_all_refs(): %i refs were still in use (%i unique, %i total allocated)", inuse, inuse_unique, global.refs.count);
|
|
|
|
}
|
|
|
|
|
|
|
|
free(global.refs.ptrs);
|
|
|
|
memset(&global.refs, 0, sizeof(RefArray));
|
|
|
|
}
|