blob: 87aad7833239ff0b20b4f8d211f2db62404475b6 (
plain)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
|
/*
* cleanup.c
*
* Description:
* This translation unit implements routines associated cleaning up
* threads.
*/
#include "pthread.h"
#include "implement.h"
int
_pthread_handler_push(int stack,
int poporder,
void (*routine)(void *),
void *arg)
{
/* Place the new handler into the list so that handlers are
popped off in the order given by poporder. */
_pthread_handler_node_t * new_thread;
_pthread_handler_node_t * next;
_pthread_handler_node_t ** stacktop;
stacktop = _PTHREAD_STACK(stack);
new_thread =
(_pthread_handler_node_t *) malloc(sizeof(_pthread_handler_node_t));
if (new_thread == NULL)
{
return ENOMEM;
}
new_thread->routine = routine;
new_thread->arg = arg;
if (poporder == _PTHREAD_HANDLER_POP_LIFO)
{
/* Add the new node to the start of the list. */
new_thread->next = *stacktop;
*stacktop = next;
}
else
{
/* Add the new node to the end of the list. */
new_thread->next = NULL;
if (*stacktop == NULL)
{
*stacktop = new_thread;
}
else
{
next = *stacktop;
while (next != NULL)
{
next = next->next;
}
next = new_thread;
}
}
return 0;
}
void
_pthread_handler_pop(int stack, int execute)
{
_pthread_handler_node_t ** stacktop;
_pthread_handler_node_t * next;
void (* func)(void *);
void * arg;
stacktop = _PTHREAD_STACK(stack);
if (*stacktop != NULL)
{
func = (*stacktop)->routine;
arg = (*stacktop)->arg;
next = (*stacktop)->next;
free(*stacktop);
*stacktop = next;
if (execute != 0 && func != NULL)
{
(void) func(arg);
}
}
}
void
_pthread_handler_pop_all(int stack, int execute)
{
/* Pop and possibly run all handlers on the given stack. */
_pthread_handler_node_t ** stacktop;
_pthread_handler_node_t * next;
void (* func)(void *);
void * arg;
stacktop = _PTHREAD_STACK(stack);
while (*stacktop != NULL)
{
func = (*stacktop)->routine;
arg = (*stacktop)->arg;
next = (*stacktop)->next;
free(*stacktop);
*stacktop = next;
if (execute != 0 && func != NULL)
{
(void) func(arg);
}
}
}
|
