summaryrefslogtreecommitdiffstats
path: root/src/map.c
blob: efe31ac271c62f0457e8da795dc7949340e69445 (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
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
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
#ifdef HAVE_CONFIG_H
#include "../config.h"
#endif

#include <sys/types.h>
#include <assert.h>
#include <stdlib.h>
#include <string.h>
#include <unistd.h>

#include <rpc/rpc.h>

#include <nspr.h>
#include <secport.h>
#include <plarenas.h>

#include "dispatch.h"
#include "map.h"
#include "portmap.h"

struct {
	struct domain {
		char *name;
		struct map {
			char *name;
			char *search_base;
			int search_scope;
			char *entry_filter;
			char *key_attribute;
			char *value_format;
			time_t last_changed;
			struct entry {
				struct entry *prev, *next;
				char *dn;
				char *key;
				unsigned int key_len;
				char *value;
				unsigned int value_len;
			} *entries;
		} *maps;
		int n_maps;
	} *domains;
	int n_domains;
} map_data;

/* Utility function - find the domain record for the named domain. */
static struct domain *
map_find_domain(struct plugin_state *state, const char *domain_name)
{
	int i;
	for (i = 0; i < map_data.n_domains; i++) {
		if (strcmp(domain_name, map_data.domains[i].name) == 0) {
			return &map_data.domains[i];
		}
	}
	return NULL;
}

/* Utility function - find the map record for the named map in the named
 * domain. */
static struct map *
map_find_map(struct plugin_state *state,
	     const char *domain_name, const char *map_name)
{
	int i;
	struct domain *domain;
	domain = map_find_domain(state, domain_name);
	if (domain != NULL) {
		for (i = 0; i < domain->n_maps; i++) {
			if (strcmp(map_name, domain->maps[i].name) == 0) {
				return &domain->maps[i];
			}
		}
	}
	return NULL;
}

/* Utility function - find a specific entry in the named map in the named
 * domain. */
static struct entry *
map_find_entry(struct plugin_state *state,
	       const char *domain_name, const char *map_name,
	       unsigned int key_len, const char *key)
{
	int i;
	struct map *map;
	struct entry *entry;
	map = map_find_map(state, domain_name, map_name);
	if (map == NULL) {
		return NULL;
	}
	for (entry = map->entries; entry != NULL; entry = entry->next) {
		if ((entry->key_len == key_len) &&
		    (memcmp(entry->key, key, key_len) == 0)) {
			return entry;
		}
	}
	return NULL;
}

/* Query function: check if we have a record for the domain.  Return that
 * information in "supported", and return TRUE unless we ran into internal
 * errors. */
bool_t
map_supports_domain(struct plugin_state *state,
		    const char *domain_name,
		    bool_t *supported)
{
	*supported = (map_find_domain(state, domain_name) != NULL);
	return TRUE;
}

/* Query function: check if we have a record for the map in the domain.  Return
 * that information in "supported", and return TRUE unless we ran into internal
 * errors. */
bool_t
map_supports_map(struct plugin_state *state,
		 const char *domain_name, const char *map_name,
		 bool_t *supported)
{
	*supported = (map_find_map(state, domain_name, map_name) != NULL);
	return TRUE;
}

/* Query function: return an indication of the map's age.  Should never
 * decrease. */
bool_t
map_order(struct plugin_state *state,
	  const char *domain_name, const char *map_name,
	  unsigned int *order)
{
	struct map *map;
	map = map_find_map(state, domain_name, map_name);
	if (map != NULL) {
		*order = map->last_changed & 0xffffffff;
		return TRUE;
	} else {
		return FALSE;
	}
}

/* Query function: return the entry value which matches the key.  Return TRUE
 * if we can find a value which corresponds to the key. */
bool_t
map_match(struct plugin_state *state,
	  const char *domain_name, const char *map_name,
	  unsigned int key_len, char *key,
	  unsigned int *value_len, char **value)
{
	struct entry *entry;
	entry = map_find_entry(state, domain_name, map_name, key_len, key);
	if (entry == NULL) {
		return FALSE;
	}
	*value_len = entry->value_len;
	*value = entry->value;
	return TRUE;
}

/* Query function: return the first entry's key and value for a map.  Return
 * FALSE if there's no domain or map. */
bool_t
map_first(struct plugin_state *state,
	  const char *domain_name, const char *map_name,
	  unsigned int *first_key_len, char **first_key,
	  unsigned int *first_value_len, char **first_value)
{
	struct map *map;
	struct entry *entry;
	map = map_find_map(state, domain_name, map_name);
	if (map == NULL) {
		return FALSE;
	}
	entry = map->entries;
	if (entry == NULL) {
		return FALSE;
	}
	*first_key_len = entry->key_len;
	*first_key = entry->key;
	*first_value_len = entry->value_len;
	*first_value = entry->value;
	return TRUE;
}

/* Query function: return the successor entry's key and value for a map.
 * Return FALSE if there's no domain or map, or if the predecessor was the last
 * key in the map. */
bool_t
map_next(struct plugin_state *state,
	 const char *domain_name, const char *map_name,
	 unsigned int prev_len, const char *prev,
	 unsigned int *next_key_len, char **next_key,
	 unsigned int *next_value_len, char **next_value)
{
	struct entry *entry;
	entry = map_find_entry(state, domain_name, map_name, prev_len, prev);
	if ((entry == NULL) || (entry->next == NULL)) {
		return FALSE;
	}
	*next_key_len = entry->next->key_len;
	*next_key = entry->next->key;
	*next_value_len = entry->next->value_len;
	*next_value = entry->next->value;
	return TRUE;
}

/* Remove a map from the configuration, removing its domain record if the map
 * was the only one that the domain contained. */
static void
map_config_unset_map(struct plugin_state *state,
		     const char *domain_name,
		     const char *map_name)
{
	struct domain *domain;
	struct map map;
	struct entry *entry, *next;
	int i;
	/* Check that we have a domain record that matches. */
	domain = map_find_domain(state, domain_name);
	if (domain == NULL) {
		return;
	}
	/* Locate the map, remove it from the array of maps. */
	memset(&map, 0, sizeof(map));
	for (i = 0; i < domain->n_maps; i++) {
		if (strcmp(domain->maps[i].name, map_name) == 0) {
			/* Save the map's contents. */
			map = domain->maps[i];
			/* Close the hole in the array. */
			domain->n_maps--;
			if (i != domain->n_maps) {
				memcpy(&domain->maps[i], &domain->maps[i + 1],
				       sizeof(map) * (domain->n_maps - i));
			}
			break;
		}
	}
	/* Assuming we didn't fall off the end of the array... */
	if (i < domain->n_maps) {
		/* ... free the map's contents. */
		free(map.name);
		free(map.search_base);
		map.search_scope = -1;
		free(map.entry_filter);
		free(map.key_attribute);
		free(map.value_format);
		map.last_changed = 0;
		for (entry = map.entries; entry != NULL; entry = next) {
			next = entry->next;
			free(entry->dn);
			entry->key_len = 0;
			free(entry->key);
			entry->value_len = 0;
			free(entry->value);
			free(entry);
		}
	}
	/* If the domain now contains no maps, remove it, too .*/
	if (domain->n_maps == 0) {
		/* Find the domain entry. */
		for (i = 0; i < map_data.n_domains; i++) {
			if (strcmp(map_data.domains[i].name,
				   domain_name) == 0) {
				/* Free the components. */
				free(domain->name);
				free(domain->maps);
				/* Fill in the hole in the domains array. */
				map_data.n_domains--;
				if (i != map_data.n_domains) {
					memcpy(&map_data.domains[i],
					       &map_data.domains[i + 1],
					       sizeof(*domain) *
					       (map_data.n_domains - i));
				}
				break;
			}
		}
	}
}

/* Add a map from the configuration, adding a domain for it if necessary. */
static void
map_config_add_map(struct plugin_state *state,
		   const char *domain_name,
		   const char *map_name,
		   const char *search_base,
		   int search_scope,
		   const char *entry_filter,
		   const char *key_attribute,
		   const char *value_format)
{
	struct domain *domain, *domains;
	struct map *map, *maps, map_template;
	struct entry *entry, *next;
	int i;
	/* Locate the domain for this map. */
	domain = NULL;
	for (i = 0; i < map_data.n_domains; i++) {
		if (strcmp(map_data.domains[i].name, domain_name) == 0) {
			domain = &map_data.domains[i];
			break;
		}
	}
	/* If we have to, then add the domain list. */
	if (domain == NULL) {
		/* Allocate space. */
		domains = malloc(sizeof(*domain) * (map_data.n_domains + 1));
		if (domains != NULL) {
			/* Populate the new domain. */
			domain = &domains[map_data.n_domains];
			memset(domain, 0, sizeof(*domain));
			domain->name = strdup(domain_name);
			if (domain->name != NULL) {
				/* Copy in existing data. */
				memcpy(domains, map_data.domains,
				       sizeof(*domain) * map_data.n_domains);
				/* Switcheroo. */
				free(map_data.domains);
				map_data.domains = domains;
				map_data.n_domains++;
			} else {
				free(domains);
				/* XXX */
				return;
			}
		}
	}
	/* Check if the map's already been defined in the domain. */
	map = NULL;
	for (i = 0; i < domain->n_maps; i++) {
		if (strcmp(domain->maps[i].name, map_name) == 0) {
			map = &domain->maps[i];
			break;
		}
	}
	/* We need to either create a new map entry or mess with an old one. */
	if (map != NULL) {
		/* Overwrite map data. */
		memset(&map_template, 0, sizeof(map_template));
		map_template.name = map->name;
		map_template.search_base = strdup(search_base);
		map_template.search_scope = search_scope;
		map_template.entry_filter = strdup(entry_filter);
		map_template.key_attribute = strdup(key_attribute);
		map_template.value_format = strdup(value_format);
		if ((map_template.name != NULL) &&
		    (map_template.search_base != NULL) &&
		    (map_template.entry_filter != NULL) &&
		    (map_template.key_attribute != NULL) &&
		    (map_template.value_format != NULL)) {
			/* Free the old search configuration. */
			free(map->search_base);
			free(map->entry_filter);
			free(map->key_attribute);
			free(map->value_format);
			/* Clear the old entries list. */
			for (entry = map->entries;
			     entry != NULL;
			     entry = next) {
				next = entry->next;
				free(entry->dn);
				entry->key_len = 0;
				free(entry->key);
				entry->value_len = 0;
				free(entry->value);
				free(entry);
			}
			/* Actually overwrite the map data. */
			*map = map_template;
		} else {
			free(map_template.search_base);
			free(map_template.entry_filter);
			free(map_template.key_attribute);
			free(map_template.value_format);
			/* XXX */
			return;
		}
	} else {
		/* Allocate space. */
		maps = malloc(sizeof(*map) * (domain->n_maps + 1));
		if (maps != NULL) {
			/* Populate the new map. */
			map = &maps[domain->n_maps];
			memset(map, 0, sizeof(*map));
			map->name = strdup(map_name);
			map->search_base = strdup(search_base);
			map->search_scope = search_scope;
			map->entry_filter = strdup(entry_filter);
			map->key_attribute = strdup(key_attribute);
			map->value_format = strdup(value_format);
			if ((map->name != NULL) &&
			    (map->search_base != NULL) &&
			    (map->entry_filter != NULL) &&
			    (map->key_attribute != NULL) &&
			    (map->value_format != NULL)) {
				/* Copy in existing data. */
				memcpy(maps, domain->maps,
				       sizeof(*map) * domain->n_maps);
				/* Switcheroo. */
				free(domain->maps);
				domain->maps = maps;
				domain->n_maps++;
			} else {
				free(map->name);
				free(map->search_base);
				free(map->entry_filter);
				free(map->key_attribute);
				free(map->value_format);
				free(maps);
				/* XXX */
				return;
			}
		}
	}
}

void
map_init(struct plugin_state *state)
{
}