blob: 759907e496d281a1072e236e623a87f36b672621 (
plain) (
blame)
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
|
#include "addr_list.h"
#include <stdbool.h>
#include <stddef.h>
#include <stdlib.h>
#include <string.h>
void addr_list_init(struct addr_list* list) {
list->top = NULL;
}
void addr_list_add(struct addr_list* list, unsigned char addr[6]) {
struct addr_list_node* cur = list->top;
struct addr_list_node* prev = NULL;
while (cur != NULL) {
if (!strncmp(cur->value, addr, 6)) {
return;
}
prev = cur;
cur = cur->next;
}
struct addr_list_node* next = (struct addr_list_node*)malloc(sizeof(struct addr_list_node));
next->next = NULL;
memcpy(next->value, addr, 6);
if (prev == NULL) {
list->top = next;
} else {
prev->next = next;
}
}
bool addr_list_contains(struct addr_list* list, unsigned char addr[6]) {
struct addr_list_node* cur = list->top;
while (cur != NULL) {
if (!strncmp(cur->value, addr, 6)) {
return true;
}
cur = cur->next;
}
return false;
}
void addr_list_remove(struct addr_list* list, unsigned char addr[6]) {
struct addr_list_node* cur = list->top;
struct addr_list_node* prev = NULL;
if (cur == NULL) {
return;
}
while (cur != NULL) {
if (!strncmp(cur->value, addr, 6)) {
break;
}
prev = cur;
cur = cur->next;
if (cur == NULL) {
return;
}
}
if (prev == NULL) {
list->top = cur->next;
} else {
prev->next = cur->next;
}
free(cur);
}
void addr_list_free(struct addr_list* list) {
struct addr_list_node* cur = list->top;
while (cur != NULL) {
struct addr_list_node* next = cur->next;
free(cur);
cur = next;
}
list->top = NULL;
}
|
