-
Notifications
You must be signed in to change notification settings - Fork 7
Expand file tree
/
Copy pathdirectory.c
More file actions
183 lines (130 loc) · 4.67 KB
/
directory.c
File metadata and controls
183 lines (130 loc) · 4.67 KB
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
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
/**
* Copyright (c) 2011-2012, Regents of the University of California
* All rights reserved.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions are met:
*
* - Redistributions of source code must retain the above copyright notice,
* this list of conditions and the following disclaimer.
* - Redistributions in binary form must reproduce the above copyright notice,
* this list of conditions and the following disclaimer in the documentation
* and/or other materials provided with the distribution.
* - Neither the name of the University of California, Berkeley nor the names
* of its contributors may be used to endorse or promote products derived
* from this software without specific prior written permission.
*
* THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
* AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
* ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE
* LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
* CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
* SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
* INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
* CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
* ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
* POSSIBILITY OF SUCH DAMAGE.
*
*
* Network Directory
*
* by Humphrey Hu
*
* v.beta
*
* Revisions:
* Humphrey Hu 2011-09-03 Initial implementation
*
* Notes:
*/
#include "directory.h"
#include "larray.h"
#include <stdlib.h>
// ==== Static Variables =======================================================
static unsigned char is_ready = 0;
static LinArray dir;
// ==== Function Stubs =========================================================
DirEntry dirCreateEntry(void);
void dirDeleteEntry(DirEntry entry);
unsigned int searchAddress(DirEntry entry, void* args);
unsigned int searchID(DirEntry entry, void* args);
unsigned int searchValid(DirEntry entry, void* args);
// ==== Function Bodies ========================================================
void dirInit(unsigned int size) {
dir = larrayCreate(size);
is_ready = 1;
}
unsigned int dirQuery(DirEntryTest comp, void *args, DirEntry *entry) {
unsigned int i;
return larrayFindFirst(dir, (LinArrayItemTest)comp, args,
&i, (LinArrayItem*) entry);
}
unsigned int dirQueryN(DirEntryTest comp, void *args, DirEntry *entries,
unsigned int N) {
unsigned int i[N];
return larrayFindN(dir, (LinArrayItemTest)comp, args, i,
(LinArrayItem*) entries, N);
}
DirEntry dirQueryAddress(unsigned int addr, unsigned int pan) {
unsigned int args[2];
DirEntry entry;
args[0] = addr;
args[1] = pan;
// If search successful, return item
if(dirQuery(&searchAddress, args, &entry)) {
return entry;
}
return NULL;
}
DirEntry dirQueryID(unsigned long long id) {
DirEntry entry;
// If search successful, return item
if(dirQuery(&searchID, &id, &entry)) {
return entry;
}
return NULL;
}
DirEntry dirAddNew(void) {
DirEntry entry;
unsigned int i;
// Allocate new entry
entry = dirCreateEntry();
if(entry == NULL) { return NULL; }
// Find space
if(larrayFindEmpty(dir, &i) == 0) {
dirDeleteEntry(entry);
return NULL;
}
larrayReplace(dir, i, entry);
return entry;
}
unsigned int dirGetSize(void) {
return larrayGetSize(dir);
}
unsigned int dirGetEntries(DirEntry *entries) {
return dirQueryN(&searchValid, NULL, entries, larrayGetMaxSize(dir));
}
// ==== Private Functions ======================================================
unsigned int searchAddress(DirEntry entry, void *args) {
if(entry == NULL) { return 0; }
return entry->address == ((unsigned int*)args)[0] &&
entry->pan_id == ((unsigned int*)args)[1];
}
unsigned int searchID(DirEntry entry, void *args) {
if(entry == NULL) { return 0; }
return entry->uuid == *((unsigned long long *)args);
}
unsigned int searchValid(DirEntry entry, void *args) {
return entry != NULL;
}
DirEntry dirCreateEntry(void) {
DirEntry entry;
entry = (DirEntry) calloc(sizeof(DirEntryStruct), 1);
if(entry == NULL) { return NULL; }
return entry;
}
void dirDeleteEntry(DirEntry entry) {
if(entry == NULL) { return; }
free(entry);
}