#ifndef RUST_UTIL_H #define RUST_UTIL_H // Reference counted objects template rc_base::rc_base() : ref_count(1) { } template rc_base::~rc_base() { } // Utility type: pointer-vector. template ptr_vec::ptr_vec(rust_dom *dom) : dom(dom), alloc(INIT_SIZE), fill(0), data(new (dom) T*[alloc]) { I(dom, data); DLOG(dom, mem, "new ptr_vec(data=0x%" PRIxPTR ") -> 0x%" PRIxPTR, (uintptr_t)data, (uintptr_t)this); } template ptr_vec::~ptr_vec() { I(dom, data); DLOG(dom, mem, "~ptr_vec 0x%" PRIxPTR ", data=0x%" PRIxPTR, (uintptr_t)this, (uintptr_t)data); I(dom, fill == 0); dom->free(data); } template T *& ptr_vec::operator[](size_t offset) { I(dom, data[offset]->idx == offset); return data[offset]; } template void ptr_vec::push(T *p) { I(dom, data); I(dom, fill <= alloc); if (fill == alloc) { alloc *= 2; data = (T **)dom->realloc(data, alloc * sizeof(T*)); I(dom, data); } I(dom, fill < alloc); p->idx = fill; data[fill++] = p; } template T * ptr_vec::pop() { return data[--fill]; } template T * ptr_vec::peek() { return data[fill - 1]; } template void ptr_vec::trim(size_t sz) { I(dom, data); if (sz <= (alloc / 4) && (alloc / 2) >= INIT_SIZE) { alloc /= 2; I(dom, alloc >= fill); data = (T **)dom->realloc(data, alloc * sizeof(T*)); I(dom, data); } } template void ptr_vec::swap_delete(T *item) { /* Swap the endpoint into i and decr fill. */ I(dom, data); I(dom, fill > 0); I(dom, item->idx < fill); fill--; if (fill > 0) { T *subst = data[fill]; size_t idx = item->idx; data[idx] = subst; subst->idx = idx; } } // Inline fn used regularly elsewhere. static inline size_t next_power_of_two(size_t s) { size_t tmp = s - 1; tmp |= tmp >> 1; tmp |= tmp >> 2; tmp |= tmp >> 4; tmp |= tmp >> 8; tmp |= tmp >> 16; #if SIZE_MAX == UINT64_MAX tmp |= tmp >> 32; #endif return tmp + 1; } // Initialization helper for ISAAC RNG static inline void isaac_init(rust_dom *dom, randctx *rctx) { memset(rctx, 0, sizeof(randctx)); #ifdef __WIN32__ { HCRYPTPROV hProv; dom->win32_require (_T("CryptAcquireContext"), CryptAcquireContext(&hProv, NULL, NULL, PROV_RSA_FULL, CRYPT_VERIFYCONTEXT|CRYPT_SILENT)); dom->win32_require (_T("CryptGenRandom"), CryptGenRandom(hProv, sizeof(rctx->randrsl), (BYTE*)(&rctx->randrsl))); dom->win32_require (_T("CryptReleaseContext"), CryptReleaseContext(hProv, 0)); } #else char *rust_seed = getenv("RUST_SEED"); if (rust_seed != NULL) { ub4 seed = (ub4) atoi(rust_seed); for (size_t i = 0; i < RANDSIZ; i ++) { memcpy(&rctx->randrsl[i], &seed, sizeof(ub4)); seed = (seed + 0x7ed55d16) + (seed << 12); } } else { int fd = open("/dev/urandom", O_RDONLY); I(dom, fd > 0); I(dom, read(fd, (void*) &rctx->randrsl, sizeof(rctx->randrsl)) == sizeof(rctx->randrsl)); I(dom, close(fd) == 0); } #endif randinit(rctx, 1); } // Vectors (rust-user-code level). struct rust_vec : public rc_base { size_t alloc; size_t fill; size_t pad; // Pad to align data[0] to 16 bytes. uint8_t data[]; rust_vec(rust_dom *dom, size_t alloc, size_t fill, uint8_t const *d) : alloc(alloc), fill(fill) { if (d) memcpy(&data[0], d, fill); } ~rust_vec() {} }; // Rust types vec and str look identical from our perspective. typedef rust_vec rust_str; // Interior vectors (rust-user-code level). struct rust_ivec_heap { size_t fill; uint8_t data[]; }; union rust_ivec_payload { rust_ivec_heap *ptr; // if on heap uint8_t data[]; // if on stack }; struct rust_ivec { size_t fill; // in bytes; if zero, heapified size_t alloc; // in bytes rust_ivec_payload payload; }; // // Local Variables: // mode: C++ // fill-column: 78; // indent-tabs-mode: nil // c-basic-offset: 4 // buffer-file-coding-system: utf-8-unix // compile-command: "make -k -C .. 2>&1 | sed -e 's/\\/x\\//x:\\//g'"; // End: // #endif