Data-RadixTree-Shared
view release on metacpan or search on metacpan
RETVAL
SV *
new_memfd(class, name = &PL_sv_undef, node_capacity = 4096, arena_capacity = 65536)
const char *class
SV *name
UV node_capacity
UV arena_capacity
PREINIT:
char errbuf[RDX_ERR_BUFLEN];
CODE:
const char *nm = SvOK(name) ? SvPV_nolen(name) : NULL; /* undef -> default label */
RdxHandle *h = rdx_create_memfd(nm, (uint64_t)node_capacity, (uint64_t)arena_capacity, errbuf); /* validates args into errbuf */
if (!h) croak("Data::RadixTree::Shared->new_memfd: %s", errbuf);
MAKE_OBJ(class, h);
OUTPUT:
RETVAL
SV *
new_from_fd(class, fd)
const char *class
int fd
PREINIT:
char errbuf[RDX_ERR_BUFLEN];
CODE:
RdxHandle *h = rdx_open_fd(fd, errbuf);
if (!h) croak("Data::RadixTree::Shared->new_from_fd: %s", errbuf);
MAKE_OBJ(class, h);
OUTPUT:
RETVAL
void
DESTROY(self)
SV *self
CODE:
if (sv_isobject(self) && sv_derived_from(self, "Data::RadixTree::Shared")) {
RdxHandle *h = INT2PTR(RdxHandle*, SvIV(SvRV(self)));
if (h) { sv_setiv(SvRV(self), 0); rdx_destroy(h); } /* null first: activates EXTRACT's use-after-destroy croak + makes a double DESTROY a no-op */
}
IV
insert(self, key, value = 1)
SV *self
SV *key
UV value
PREINIT:
EXTRACT(self);
STRLEN klen;
const char *kp;
int isnew;
CODE:
/* Resolve key bytes BEFORE locking: SvPVbyte croaks on wide chars, and a
croak must never happen while holding the lock. */
kp = SvPVbyte(key, klen);
rdx_rwlock_wrlock(h);
if (!rdx_insert_has_room(h, (uint32_t)klen)) {
rdx_rwlock_wrunlock(h); /* release BEFORE croak */
croak("Data::RadixTree::Shared->insert: capacity exhausted "
"(node pool or label arena full; grow node/arena capacity)");
}
isnew = rdx_insert_locked(h, (const uint8_t *)kp, (uint32_t)klen, (uint64_t)value);
__atomic_fetch_add(&h->hdr->stat_ops, 1, __ATOMIC_RELAXED);
rdx_rwlock_wrunlock(h);
RETVAL = (IV)isnew;
OUTPUT:
RETVAL
SV *
lookup(self, key)
SV *self
SV *key
PREINIT:
EXTRACT(self);
STRLEN klen;
const char *kp;
uint64_t val;
int found;
CODE:
kp = SvPVbyte(key, klen); /* before the lock */
rdx_rwlock_rdlock(h);
found = rdx_lookup_locked(h, (const uint8_t *)kp, (uint32_t)klen, &val);
rdx_rwlock_rdunlock(h);
RETVAL = found ? newSVuv((UV)val) : &PL_sv_undef;
OUTPUT:
RETVAL
bool
exists(self, key)
SV *self
SV *key
PREINIT:
EXTRACT(self);
STRLEN klen;
const char *kp;
CODE:
kp = SvPVbyte(key, klen); /* before the lock */
rdx_rwlock_rdlock(h);
RETVAL = rdx_lookup_locked(h, (const uint8_t *)kp, (uint32_t)klen, NULL) ? 1 : 0;
rdx_rwlock_rdunlock(h);
OUTPUT:
RETVAL
SV *
longest_prefix(self, key)
SV *self
SV *key
PREINIT:
EXTRACT(self);
STRLEN klen;
const char *kp;
uint64_t val;
int found;
CODE:
kp = SvPVbyte(key, klen); /* before the lock */
rdx_rwlock_rdlock(h);
found = rdx_longest_prefix_locked(h, (const uint8_t *)kp, (uint32_t)klen, &val);
rdx_rwlock_rdunlock(h);
RETVAL = found ? newSVuv((UV)val) : &PL_sv_undef;
OUTPUT:
RETVAL
IV
delete(self, key)
SV *self
SV *key
PREINIT:
EXTRACT(self);
STRLEN klen;
const char *kp;
int removed;
CODE:
kp = SvPVbyte(key, klen); /* before the lock */
rdx_rwlock_wrlock(h);
removed = rdx_delete_locked(h, (const uint8_t *)kp, (uint32_t)klen);
__atomic_fetch_add(&h->hdr->stat_ops, 1, __ATOMIC_RELAXED);
rdx_rwlock_wrunlock(h);
RETVAL = (IV)removed;
OUTPUT:
RETVAL
void
clear(self)
SV *self
PREINIT:
EXTRACT(self);
CODE:
rdx_rwlock_wrlock(h);
rdx_clear_locked(h);
__atomic_fetch_add(&h->hdr->stat_ops, 1, __ATOMIC_RELAXED);
rdx_rwlock_wrunlock(h);
UV
count(self)
SV *self
PREINIT:
EXTRACT(self);
CODE:
rdx_rwlock_rdlock(h);
RETVAL = (UV)h->hdr->keys;
rdx_rwlock_rdunlock(h);
OUTPUT:
RETVAL
SV *
stats(self)
SV *self
PREINIT:
EXTRACT(self);
CODE:
{
uint64_t keys, ops;
uint32_t node_used, node_cap, arena_used, arena_cap;
/* Snapshot under the lock; do all (croak-capable) Perl allocation after
releasing it -- so an OOM in newHV/newSV* can never strand the lock. */
rdx_rwlock_rdlock(h);
keys = h->hdr->keys;
node_used = h->hdr->node_used;
node_cap = h->hdr->node_cap;
arena_used = h->hdr->arena_used;
arena_cap = h->hdr->arena_cap;
ops = h->hdr->stat_ops;
rdx_rwlock_rdunlock(h);
HV *hv = newHV();
hv_stores(hv, "keys", newSVuv((UV)keys));
hv_stores(hv, "nodes_used", newSVuv((UV)node_used));
hv_stores(hv, "nodes_capacity", newSVuv((UV)node_cap));
hv_stores(hv, "arena_used", newSVuv((UV)arena_used));
hv_stores(hv, "arena_capacity", newSVuv((UV)arena_cap));
hv_stores(hv, "ops", newSVuv((UV)ops));
hv_stores(hv, "mmap_size", newSVuv((UV)h->mmap_size));
RETVAL = newRV_noinc((SV *)hv);
}
OUTPUT:
RETVAL
SV *
path(self)
SV *self
PREINIT:
EXTRACT(self);
CODE:
RETVAL = h->path ? newSVpv(h->path, 0) : &PL_sv_undef;
OUTPUT:
RETVAL
int
memfd(self)
( run in 0.848 second using v1.01-cache-2.11-cpan-bbe5e583499 )