#include <stddef.h>
#include <stdlib.h>
+#include <stdint.h>
#include <limits.h>
#include "libc.h"
static struct fl
{
struct fl *next;
- void (*f[COUNT])(void);
+ void (*f[COUNT])(void *);
+ void *a[COUNT];
} builtin, *head;
+static int lock[2];
+
void __funcs_on_exit()
{
int i;
- for (; head; head=head->next) {
- for (i=COUNT-1; i>=0 && !head->f[i]; i--);
- for (; i>=0; i--) head->f[i]();
+ void (*func)(void *), *arg;
+ LOCK(lock);
+ for (; head; head=head->next) for (i=COUNT-1; i>=0; i--) {
+ if (!head->f[i]) continue;
+ func = head->f[i];
+ arg = head->a[i];
+ head->f[i] = 0;
+ UNLOCK(lock);
+ func(arg);
+ LOCK(lock);
}
}
-int atexit(void (*func)(void))
+void __cxa_finalize(void *dso)
{
- static int lock;
- int i;
+}
- /* Hook for atexit extensions */
- if (libc.atexit) return libc.atexit(func);
+int __cxa_atexit(void (*func)(void *), void *arg, void *dso)
+{
+ int i;
- LOCK(&lock);
+ LOCK(lock);
/* Defer initialization of head so it can be in BSS */
if (!head) head = &builtin;
if (head->f[COUNT-1]) {
struct fl *new_fl = calloc(sizeof(struct fl), 1);
if (!new_fl) {
- UNLOCK(&lock);
+ UNLOCK(lock);
return -1;
}
new_fl->next = head;
/* Append function to the list. */
for (i=0; i<COUNT && head->f[i]; i++);
head->f[i] = func;
+ head->a[i] = arg;
- UNLOCK(&lock);
+ UNLOCK(lock);
return 0;
}
+
+static void call(void *p)
+{
+ ((void (*)(void))(uintptr_t)p)();
+}
+
+int atexit(void (*func)(void))
+{
+ return __cxa_atexit(call, (void *)(uintptr_t)func, 0);
+}