Something went wrong. Try again.
[READ-ONLY] Mirror of https://github.com/VibeDevelopers/Comet.
Something went wrong. Try again.
123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288/* * Copyright (c) 2012 Ariadne Conill <ariadne@dereferenced.org>. * * Permission to use, copy, modify, and/or distribute this software for any * purpose with or without fee is hereby granted, provided that the above * copyright notice and this permission notice is present in all copies. * * THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``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 AUTHOR 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. */
#include "stdinc.h"#include "capability.h"#include "rb_dictionary.h"#include "s_assert.h"#include "s_serv.h"
static rb_dlink_list capability_indexes = { NULL, NULL, 0 };
struct CapabilityEntry *capability_find(struct CapabilityIndex *idx, const char *cap){ s_assert(idx != NULL); if (cap == NULL) return NULL;
return rb_dictionary_retrieve(idx->cap_dict, cap);}
uint64_tcapability_get(struct CapabilityIndex *idx, const char *cap, void **ownerdata){ struct CapabilityEntry *entry;
s_assert(idx != NULL); if (cap == NULL) return 0;
entry = rb_dictionary_retrieve(idx->cap_dict, cap); if (entry != NULL && !(entry->flags & CAP_ORPHANED)) { if (ownerdata != NULL) *ownerdata = entry->ownerdata; return (1ull << entry->value); }
return 0;}
uint64_tcapability_put(struct CapabilityIndex *idx, const char *cap, void *ownerdata){ struct CapabilityEntry *entry;
s_assert(idx != NULL); if (!idx->highest_bit) return 0xFFFFFFFFFFFFFFFFull;
if ((entry = rb_dictionary_retrieve(idx->cap_dict, cap)) != NULL) { entry->flags &= ~CAP_ORPHANED; if (ownerdata != NULL) { s_assert(entry->ownerdata == NULL); entry->ownerdata = ownerdata; }
if (idx == cli_capindex && entry->ownerdata != NULL && (((struct ClientCapability *)entry->ownerdata)->flags & CLICAP_FLAGS_NOPROP) == CLICAP_FLAGS_NOPROP) { serv_clicapmask &= ~(1ull << entry->value); }
return (1ull << entry->value); }
entry = rb_malloc(sizeof(struct CapabilityEntry)); entry->cap = rb_strdup(cap); entry->flags = 0; entry->value = idx->highest_bit; entry->ownerdata = ownerdata;
rb_dictionary_add(idx->cap_dict, entry->cap, entry);
idx->highest_bit++; if (idx->highest_bit % (sizeof(uint64_t) * 8) == 0) idx->highest_bit = 0;
if (idx == cli_capindex && entry->ownerdata != NULL && (((struct ClientCapability *)entry->ownerdata)->flags & CLICAP_FLAGS_NOPROP) == CLICAP_FLAGS_NOPROP) { serv_clicapmask &= ~(1ull << entry->value); }
return (1ull << entry->value);}
uint64_tcapability_put_anonymous(struct CapabilityIndex *idx){ uint64_t value;
s_assert(idx != NULL); if (!idx->highest_bit) return 0xFFFFFFFFFFFFFFFFull; value = 1ull << idx->highest_bit; idx->highest_bit++; if (idx->highest_bit % (sizeof(uint64_t) * 8) == 0) idx->highest_bit = 0; return value;}
voidcapability_orphan(struct CapabilityIndex *idx, const char *cap){ struct CapabilityEntry *entry;
s_assert(idx != NULL);
entry = rb_dictionary_retrieve(idx->cap_dict, cap); if (entry != NULL) { if (idx == cli_capindex && entry->ownerdata != NULL && (((struct ClientCapability *)entry->ownerdata)->flags & CLICAP_FLAGS_NOPROP) == CLICAP_FLAGS_NOPROP) { serv_clicapmask |= 1ull << entry->value; }
entry->flags &= ~CAP_REQUIRED; entry->flags |= CAP_ORPHANED; entry->ownerdata = NULL; }}
voidcapability_require(struct CapabilityIndex *idx, const char *cap){ struct CapabilityEntry *entry;
s_assert(idx != NULL);
entry = rb_dictionary_retrieve(idx->cap_dict, cap); if (entry != NULL) entry->flags |= CAP_REQUIRED;}
static voidcapability_destroy(rb_dictionary_element *delem, void *privdata){ s_assert(delem != NULL);
struct CapabilityEntry *entry = delem->data; rb_free((char *)entry->cap); rb_free(entry);}
struct CapabilityIndex *capability_index_create(const char *name){ struct CapabilityIndex *idx;
idx = rb_malloc(sizeof(struct CapabilityIndex)); idx->name = name; idx->cap_dict = rb_dictionary_create(name, rb_strcasecmp); idx->highest_bit = 1;
rb_dlinkAdd(idx, &idx->node, &capability_indexes);
return idx;}
voidcapability_index_destroy(struct CapabilityIndex *idx){ s_assert(idx != NULL);
rb_dlinkDelete(&idx->node, &capability_indexes);
rb_dictionary_destroy(idx->cap_dict, capability_destroy, NULL); rb_free(idx);}
const char *capability_index_list(struct CapabilityIndex *idx, uint64_t cap_mask){ rb_dictionary_iter iter; struct CapabilityEntry *entry; static char buf[BUFSIZE]; char *t = buf; int tl;
s_assert(idx != NULL);
*t = '\0';
RB_DICTIONARY_FOREACH(entry, &iter, idx->cap_dict) { if ((1ull << entry->value) & cap_mask) { tl = sprintf(t, "%s ", entry->cap); t += tl; } }
t--; *t = '\0';
return buf;}
uint64_tcapability_index_mask(struct CapabilityIndex *idx){ rb_dictionary_iter iter; struct CapabilityEntry *entry; uint64_t mask = 0;
s_assert(idx != NULL);
RB_DICTIONARY_FOREACH(entry, &iter, idx->cap_dict) { if (!(entry->flags & CAP_ORPHANED)) mask |= (1ull << entry->value); }
return mask;}
uint64_tcapability_index_get_required(struct CapabilityIndex *idx){ rb_dictionary_iter iter; struct CapabilityEntry *entry; uint64_t mask = 0;
s_assert(idx != NULL);
RB_DICTIONARY_FOREACH(entry, &iter, idx->cap_dict) { if (!(entry->flags & CAP_ORPHANED) && (entry->flags & CAP_REQUIRED)) mask |= (1ull << entry->value); }
return mask;}
voidcapability_index_stats(void (*cb)(const char *line, void *privdata), void *privdata){ rb_dlink_node *node; char buf[BUFSIZE];
RB_DLINK_FOREACH(node, capability_indexes.head) { struct CapabilityIndex *idx = node->data; rb_dictionary_iter iter; struct CapabilityEntry *entry;
snprintf(buf, sizeof buf, "'%s': allocated bits - %d", idx->name, (idx->highest_bit - 1)); cb(buf, privdata);
RB_DICTIONARY_FOREACH(entry, &iter, idx->cap_dict) { snprintf(buf, sizeof buf, "bit %d: '%s'", entry->value, entry->cap); cb(buf, privdata); }
snprintf(buf, sizeof buf, "'%s': remaining bits - %u", idx->name, (unsigned int)((sizeof(uint64_t) * 8) - (idx->highest_bit - 1))); cb(buf, privdata); }
snprintf(buf, sizeof buf, "%ld capability indexes", rb_dlink_list_length(&capability_indexes)); cb(buf, privdata);}