Hash :
398789b2
Author :
Date :
2019-01-08T21:32:07
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
/*
* Copyright (c) 2019 Stefan Sperling <stsp@openbsd.org>
*
* Permission to use, copy, modify, and distribute this software for any
* purpose with or without fee is hereby granted, provided that the above
* copyright notice and this permission notice appear in all copies.
*
* THE SOFTWARE IS PROVIDED "AS IS" AND THE AUTHOR DISCLAIMS ALL WARRANTIES
* WITH REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED WARRANTIES OF
* MERCHANTABILITY AND FITNESS. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR
* ANY SPECIAL, DIRECT, INDIRECT, OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES
* WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR PROFITS, WHETHER IN AN
* ACTION OF CONTRACT, NEGLIGENCE OR OTHER TORTIOUS ACTION, ARISING OUT OF
* OR IN CONNECTION WITH THE USE OR PERFORMANCE OF THIS SOFTWARE.
*/
#include <sys/tree.h>
#include <stdlib.h>
#include <string.h>
#include <stdio.h>
#include <limits.h>
#include "got_error.h"
#include "got_lib_pathset.h"
#ifndef MIN
#define MIN(_a,_b) ((_a) < (_b) ? (_a) : (_b))
#endif
struct got_pathset_element {
RB_ENTRY(got_pathset_element) entry;
char *path;
void *data; /* API user data */
};
RB_HEAD(got_pathset_tree, got_pathset_element);
static int
cmp_elements(const struct got_pathset_element *e1,
const struct got_pathset_element *e2)
{
size_t len1 = strlen(e1->path);
size_t len2 = strlen(e2->path);
size_t min_len = MIN(len1, len2);
size_t i = 0;
/* Skip over common prefix. */
while (i < min_len && e1->path[i] == e2->path[i])
i++;
/* Are the paths exactly equal? */
if (len1 == len2 && i >= min_len)
return 0;
/* Order children in subdirectories directly after their parents. */
if (e1->path[i] == '/' && e2->path[i] == '\0')
return 1;
if (e2->path[i] == '/' && e1->path[i] == '\0')
return -1;
if (e1->path[i] == '/')
return -1;
if (e2->path[i] == '/')
return 1;
/* Next character following the common prefix determines order. */
return (unsigned char)e1->path[i] < (unsigned char)e2->path[i] ? -1 : 1;
}
RB_PROTOTYPE(got_pathset_tree, got_pathset_element, entry, cmp_elements);
struct got_pathset {
struct got_pathset_tree entries;
int totelem;
#define GOT_PATHSET_MAX_ELEM INT_MAX
};
struct got_pathset *
got_pathset_alloc(void)
{
struct got_pathset *set;
set = malloc(sizeof(*set));
if (set == NULL)
return NULL;
RB_INIT(&set->entries);
set->totelem = 0;
return set;
}
static void
free_element(struct got_pathset_element *entry)
{
free(entry->path);
free(entry);
}
void
got_pathset_free(struct got_pathset *set)
{
struct got_pathset_element *entry;
while ((entry = RB_MIN(got_pathset_tree, &set->entries))) {
RB_REMOVE(got_pathset_tree, &set->entries, entry);
/* User data should be freed by caller. */
free_element(entry);
}
free(set);
}
const struct got_error *
got_pathset_add(struct got_pathset *set, const char *path, void *data)
{
struct got_pathset_element *new;
if (set->totelem >= GOT_PATHSET_MAX_ELEM)
return got_error(GOT_ERR_NO_SPACE);
new = malloc(sizeof(*new));
if (new == NULL)
return got_error_from_errno();
new->path = strdup(path);
if (new->path == NULL)
return got_error_from_errno();
new->data = data;
RB_INSERT(got_pathset_tree, &set->entries, new);
set->totelem++;
return NULL;
}
static struct got_pathset_element *
find_element(struct got_pathset *set, const char *path)
{
struct got_pathset_element key, *entry;
key.path = strdup(path);
entry = RB_FIND(got_pathset_tree, &set->entries, &key);
free(key.path);
return entry;
}
void *
got_pathset_get(struct got_pathset *set, const char *path)
{
struct got_pathset_element *entry = find_element(set, path);
return entry ? entry->data : NULL;
}
const struct got_error *
got_pathset_remove(void **data, struct got_pathset *set, const char *path)
{
struct got_pathset_element *entry;
if (data)
*data = NULL;
if (set->totelem == 0)
return got_error(GOT_ERR_NO_OBJ);
if (path == NULL)
entry = RB_ROOT(&set->entries);
else
entry = find_element(set, path);
if (entry == NULL)
return got_error(GOT_ERR_NO_OBJ);
RB_REMOVE(got_pathset_tree, &set->entries, entry);
if (data)
*data = entry->data;
free_element(entry);
set->totelem--;
return NULL;
}
int
got_pathset_contains(struct got_pathset *set, const char *path)
{
struct got_pathset_element *entry = find_element(set, path);
return entry ? 1 : 0;
}
const struct got_error *
got_pathset_for_each(struct got_pathset *set,
const struct got_error *(*cb)(const char *, void *, void *), void *arg)
{
const struct got_error *err;
struct got_pathset_element *entry, *tmp;
RB_FOREACH_SAFE(entry, got_pathset_tree, &set->entries, tmp) {
err = (*cb)(entry->path, entry->data, arg);
if (err)
return err;
}
return NULL;
}
const struct got_error *
got_pathset_for_each_reverse(struct got_pathset *set,
const struct got_error *(*cb)(const char *, void *, void *), void *arg)
{
const struct got_error *err;
struct got_pathset_element *entry, *tmp;
RB_FOREACH_REVERSE_SAFE(entry, got_pathset_tree, &set->entries, tmp) {
err = (*cb)(entry->path, entry->data, arg);
if (err)
return err;
}
return NULL;
}
int
got_pathset_num_elements(struct got_pathset *set)
{
return set->totelem;
}
RB_GENERATE(got_pathset_tree, got_pathset_element, entry, cmp_elements);