blob: 3cf04ca4e1261e1a1b33e132b5bb41d44143ad84 (
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
|
/* This file is part of Nekopack.
Copyright (C) 2017 Jakob Tsar-Fox, All Rights Reserved.
Nekopack is free software: you can redistribute it and/or modify it
under the terms of the GNU General Public License as published by the
Free Software Foundation, either version 3 of the License, or (at
your option) any later version.
Nekopack 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 Nekopack. If not, see <http://www.gnu.org/licenses/>. */
#include <inttypes.h>
#include <stddef.h>
#include <stdint.h>
#include <stdlib.h>
#include "write.h"
/* Document */
char *pop_file_name(uint32_t key, node *root) {
/* The root node shouldn't contain anything. */
if (root->next == NULL)
return NULL;
const char *file_name = NULL;
node *current = root->next, *last = root;
for (;;) {
if (current->key == key) {
file_name = current->file_name;
last->next = current->next;
free(current->file_name);
free(current);
break;
} else if (current->next == NULL) {
break;
} else {
last = current;
current = current->next;
}
}
return file_name;
}
/* Document */
void defer_node(node *new, node *root) {
node *current = root;
for (;;) {
if (current->next == NULL) {
current->next = new;
break;
} else {
current = current->next;
}
}
}
void test_linked_list(node *root) {
for (node *current = root; current != NULL; current = current->next) {
printf("NODE\n----\n");
printf("KEY: %" PRIx32 "\n", current->key);
printf("FILE_NAME: %s\n\n", current->file_name);
}
}
/* Document */
void free_node(node *base) {
if (base->next != NULL) {
free_node(base->next);
return;
}
free(base);
}
|
