Data-Heap-Shared
view release on metacpan or search on metacpan
/*
* heap.h -- Shared-memory binary min-heap (priority queue) for Linux
*
* Mutex-protected push/pop with sift-up/sift-down.
* Futex blocking when empty (pop_wait).
* Elements are (int64_t priority, int64_t value) pairs.
* Lowest priority pops first (min-heap).
*/
#ifndef HEAP_H
#define HEAP_H
#include <stdint.h>
#include <stdbool.h>
#include <stdlib.h>
#include <string.h>
#include <unistd.h>
#include <fcntl.h>
#include <errno.h>
#include <time.h>
#include <limits.h>
#include <signal.h>
#include <sys/mman.h>
#include <sys/stat.h>
#include <sys/file.h>
#include <sys/syscall.h>
#include <linux/futex.h>
#include <sys/eventfd.h>
#define HEAP_MAGIC 0x48455031U /* "HEP1" */
#define HEAP_VERSION 1
#define HEAP_ERR_BUFLEN 256
#define HEAP_SPIN_LIMIT 32
#define HEAP_MUTEX_BIT 0x80000000U
#define HEAP_MUTEX_PID 0x7FFFFFFFU
/* Indices into the heap data are uint32_t (sift_up/down). Cap capacity
* to UINT32_MAX so size++ in heap_push cannot wrap and the (uint32_t)
* cast against hdr->capacity in the capacity check cannot truncate. */
#define HEAP_MAX_CAPACITY ((uint64_t)UINT32_MAX)
typedef struct {
int64_t priority;
int64_t value;
} HeapEntry;
/* ================================================================
* Header (128 bytes)
* ================================================================ */
typedef struct {
uint32_t magic;
uint32_t version;
uint64_t capacity;
uint64_t total_size;
uint64_t data_off;
uint8_t _pad0[32];
uint32_t size; /* 64: current element count (futex word for pop) */
uint32_t mutex; /* 68: 0=free, HEAP_MUTEX_BIT|pid=locked */
uint32_t mutex_waiters; /* 72 */
uint32_t waiters_pop; /* 76 */
uint64_t stat_pushes; /* 80 */
uint64_t stat_pops; /* 88 */
uint64_t stat_waits; /* 96 */
uint64_t stat_timeouts; /* 104 */
uint64_t stat_recoveries; /* 112 */
uint8_t _pad1[8]; /* 120-127 */
} HeapHeader;
#if defined(__STDC_VERSION__) && __STDC_VERSION__ >= 201112L
_Static_assert(sizeof(HeapHeader) == 128, "HeapHeader must be 128 bytes");
#endif
typedef struct {
HeapHeader *hdr;
HeapEntry *data;
size_t mmap_size;
uint64_t capacity; /* trusted copy; hdr->capacity is peer-writable */
char *path;
int notify_fd;
int backing_fd;
} HeapHandle;
/* ================================================================
* Mutex (PID-based, stale-recoverable)
* ================================================================ */
static const struct timespec heap_lock_timeout = { 2, 0 };
/* A zombie (dead but not yet reaped) still answers kill(pid,0) as alive, so a
* process that crashed while holding the lock and lingers unreaped would never
* be recovered. Treat /proc/<pid>/stat state 'Z' as dead. Linux-only (as is
* this module); if /proc is unreadable we fall back to "alive" (safe: we never
* force-recover a possibly-live holder). */
static inline int heap_pid_is_zombie(uint32_t pid) {
char path[32], buf[256];
snprintf(path, sizeof(path), "/proc/%u/stat", (unsigned)pid);
int fd = open(path, O_RDONLY | O_CLOEXEC);
if (fd < 0) return 0;
ssize_t n = read(fd, buf, sizeof(buf) - 1);
close(fd);
if (n <= 0) return 0;
buf[n] = '\0';
/* "pid (comm) state ..."; comm may contain ')', so scan to the last one. */
char *rp = strrchr(buf, ')');
if (!rp || rp + 2 >= buf + n) return 0; /* need ") X" within the bytes read */
return rp[1] == ' ' && rp[2] == 'Z';
}
static inline int heap_pid_alive(uint32_t pid) {
if (pid == 0) return 1; /* no owner recorded, assume alive */
if (kill((pid_t)pid, 0) == -1 && errno == ESRCH) return 0; /* definitely dead */
return !heap_pid_is_zombie(pid); /* kill() also succeeds for a zombie -> treat as dead */
}
static inline void heap_mutex_lock(HeapHeader *hdr) {
uint32_t mypid = HEAP_MUTEX_BIT | ((uint32_t)getpid() & HEAP_MUTEX_PID);
for (int spin = 0; ; spin++) {
uint32_t expected = 0;
if (__atomic_compare_exchange_n(&hdr->mutex, &expected, mypid,
( run in 1.627 second using v1.01-cache-2.11-cpan-7f9471e7e0a )