#include "alloc.h" #include #include #include /* Sequence-capacity growth policy for the forward-pass workspaces: * For new growth: * - never allocate less than the minimum required size. * - round up to the granularity so small length changes do not trigger a realloc on every call. * - keep existing capacity if it is already larger. */ #define LANGDET_MIN_WORKSPACE_SEQ_CAP 16 #define LANGDET_WORKSPACE_SEQ_GRANULARITY 16 int mul_size(size_t a, size_t b, size_t *out) { if (a != 0 && b > SIZE_MAX / a) return -1; *out = a * b; return 0; } int grow_cap(int current, int needed, int *out) { if (current < 0 || needed <= 0) return -1; int cap = needed; if (cap < LANGDET_MIN_WORKSPACE_SEQ_CAP) cap = LANGDET_MIN_WORKSPACE_SEQ_CAP; int rem = cap % LANGDET_WORKSPACE_SEQ_GRANULARITY; if (rem != 0) { int pad = LANGDET_WORKSPACE_SEQ_GRANULARITY - rem; if (cap > INT_MAX - pad) return -1; cap += pad; } if (cap < current) cap = current; *out = cap; return 0; } int realloc_floats(float **ptr, size_t count) { size_t bytes; if (mul_size(count, sizeof(float), &bytes) != 0) return -1; void *p = realloc(*ptr, bytes); if (!p && bytes != 0) return -1; *ptr = (float *)p; return 0; } int realloc_floats_2d(float **ptr, int rows, int cols) { if (rows < 0 || cols < 0) return -1; size_t count; if (mul_size((size_t)rows, (size_t)cols, &count) != 0) return -1; return realloc_floats(ptr, count); }