-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathnodes_1.c
109 lines (98 loc) · 2.26 KB
/
nodes_1.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
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
/* ************************************************************************** */
/* */
/* ::: :::::::: */
/* nodes_1.c :+: :+: :+: */
/* +:+ +:+ +:+ */
/* By: abuzdin <[email protected]> +#+ +:+ +#+ */
/* +#+#+#+#+#+ +#+ */
/* Created: 2022/07/20 09:31:10 by abuzdin #+# #+# */
/* Updated: 2022/08/04 10:25:56 by abuzdin ### ########.fr */
/* */
/* ************************************************************************** */
#include "minishell.h"
t_node *ms_token_new(int type, char *value, t_input *data)
{
t_node *node;
node = ms_malloc(sizeof(t_node), data);
node->type = type;
node->value = value;
node->next = NULL;
node->prev = NULL;
return (node);
}
void ms_token_back(t_node **node, t_node *new)
{
t_node *tmp;
tmp = NULL;
if (!node || !new)
return ;
if (!*node)
*node = new;
else
{
tmp = *node;
while (tmp->next)
tmp = tmp->next;
tmp->next = new;
new->prev = tmp;
new->next = NULL;
}
}
t_node *ms_token_del(t_node *node)
{
t_node *tmp;
if (!node)
return (NULL);
tmp = node;
if (tmp->prev && tmp->next)
{
node = node->prev;
node->next = tmp->next;
node->next->prev = node;
}
else if (tmp->prev)
{
node = node->prev;
node->next = NULL;
}
else if (tmp->next)
{
node = node->next;
node->prev = NULL;
}
free(tmp->value);
free(tmp);
return (node);
}
void ms_token_print(t_node *node)
{
int i;
if (!node)
{
printf("There are no nodes in the list\n");
return ;
}
i = 0;
printf("===== NODE =====\n");
while (node)
{
printf("type for node[%d] is %d\n", i, node->type);
printf("value for node[%d] is %s\n", i, node->value);
printf("flag for node[%d] is %d\n", i, node->flag);
node = node->next;
++i;
}
}
int ms_token_size(t_node *node)
{
int i;
if (!node)
return (0);
i = 1;
while (node->next)
{
++i;
node = node->next;
}
return (i);
}