-
Notifications
You must be signed in to change notification settings - Fork 48
/
functional_stack.c
86 lines (73 loc) · 1.98 KB
/
functional_stack.c
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
/*
fuse-google-drive: a fuse filesystem wrapper for Google Drive
Copyright (C) 2012 James Cline
This program is free software; you can redistribute it and/or modify
it under the terms of the GNU General Public License version 2 as
published by the Free Software Foundation.
This program is distributed in the hope that it will be useful,
but WITHOUT ANY WARRANTY; without even the implied warranty of
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
GNU General Public License for more details.
You should have received a copy of the GNU General Public License along
with this program; if not, write to the Free Software Foundation, Inc.,
51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA.
*/
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include "stack.h"
#include "functional_stack.h"
int fstack_init(struct stack_t *stack, size_t size)
{
int ret = stack_init(stack, size);
}
void fstack_destroy(struct stack_t *stack)
{
while(stack->size)
free(stack_pop(stack));
stack_destroy(stack);
}
void *fstack_pop(struct stack_t *stack)
{
struct fstack_item_t *item;
item = (struct fstack_item_t*) stack_pop(stack);
if(!item)
return NULL;
switch(item->order)
{
case 1:
item->func->func1(item->data);
break;
case 2:
item->func->func2();
break;
case 3:
item->func->func3(item->data);
break;
case 4:
item->func->func4();
break;
}
void *data = item->data;
free(item->func);
free(item);
return data;
}
int fstack_push(struct stack_t *stack, void *data, union func_u *func, char order)
{
struct fstack_item_t *item;
item = (struct fstack_item_t*) malloc(sizeof(struct fstack_item_t));
if(!item)
return 1;
item->func = (union func_u*) malloc(sizeof(union func_u));
if(!item->func)
return 1;
item->func = memcpy(item->func, func, sizeof(union func_u));
item->data = data;
item->order = order;
return stack_push(stack, item);
}
int fstack_resize(struct stack_t *stack, size_t size)
{
return stack_resize(stack, size);
}