carray 2.0.1 → 3.0.1

data/ext/carray_kernels_reduce_boolean.c

@@ -0,0 +1,330 @@
+/* ---------------------------------------------------------------------------
+
+   carray_kernels.c -- GENERATED by ext/mkkernel.rb -- DO NOT EDIT
+
+   Kernel definitions live in mkkernel.rb (search for `MkKernel.reduce`).
+   Regenerate by running:
+
+     cd ext && ruby mkkernel.rb > carray_kernels.c
+
+   extconf.rb regenerates automatically when mkkernel.rb is touched.
+
+   --------------------------------------------------------------------------- */
+
+#include "carray.h"
+#include "ca_kernel_iterator.h"
+#include "ca_sort_kernels.h"   /* sort kernels: internal, not via the carray.h umbrella */
+#include "carray_internal.h"   /* ca_lazy_arena_*, ca_is_lazy_view (streaming reduce) */
+#include "ca_obj_face.h"       /* rb_ca_strip_face_value (Face ordering gate) */
+#include <math.h>
+#include <stdint.h>
+#include <stdlib.h>   /* qsort, mergesort (HAVE_MERGESORT) -- for :sort kind */
+
+/* MEMO_REDUCTION_FASTPATH_ENTITY_ONLY_GUARD Tier 2: CAStack identity is
+   probed by operation-table function pointer (obj_type is runtime-
+   assigned, so no CA_OBJ_STACK compile-time constant exists). */
+extern ca_operation_function_t ca_stack_func;
+/* BOOL2VAL: bool -> Ruby (Qtrue/Qfalse).  Used as ruby_scalar wrapper
+   for the all/any flat-reduction Ruby surface so `a.all` / `a.any`
+   return real true/false, not Integer 0/1.  (BOOL2OBJ already exists
+   but returns Integer per CArray's boolean-as-int convention.)  */
+#ifndef CARRAY_BOOL2VAL_DEFINED
+#define CARRAY_BOOL2VAL_DEFINED
+static inline VALUE BOOL2VAL (boolean8_t x) { return x ? Qtrue : Qfalse; }
+#endif
+
+#include "ca_op_powi.h"
+#include "ca_op_cmplx64.h"
+
+/* ===== all_ki ============================================ */
+
+static VALUE
+all_ki_native_bool (VALUE self, CArray *ca, int8_t *slab_axes, int8_t naxes, int keep_axis)
+{
+    /* P.4.5.3b/c streaming chunked reduce: full reduction over lazy unmasked.  */
+    /* P.4.5.3c (N-D): outer-axis chunking, 1-D is the natural sub-case.        */
+    if ( naxes == ca->ndim && ca->ndim >= 1 && !keep_axis &&
+         ca_is_lazy_view(ca) && ! ca_has_mask(ca) ) {
+      ca_size_t __inner = 1;
+      int       __k;
+      for ( __k = 1; __k < ca->ndim; __k++ ) __inner *= ca->dim[__k];
+      ca_size_t __target = 4096;   /* L1d-friendly element budget (32KB for f64) */
+      ca_size_t __rows   = (__inner > 0) ? (__target / __inner) : __target;
+      if ( __rows < 1 ) __rows = 1;       /* at least one row per chunk */
+      ca_size_t __chunk_elems = __rows * __inner;
+      ca_size_t __outer       = ca->dim[0];
+      ca_size_t __starts[CA_RANK_MAX]  = {0};
+      ca_size_t __counts[CA_RANK_MAX];
+      ca_size_t __strides[CA_RANK_MAX];
+      ca_size_t __s = sizeof(boolean8_t);
+      for ( __k = ca->ndim - 1; __k >= 0; __k-- ) {
+        __strides[__k] = __s;
+        __s *= ca->dim[__k];
+      }
+      for ( __k = 1; __k < ca->ndim; __k++ ) __counts[__k] = ca->dim[__k];
+      ca_size_t __outer_off = 0;
+      boolean8_t acc;
+      acc = (1);
+      ca_lazy_arena_enter();
+      boolean8_t *__chunk = (boolean8_t *) ca_lazy_arena_acquire(__chunk_elems * sizeof(boolean8_t));
+      while ( __outer_off < __outer ) {
+        ca_size_t __r = (__outer - __outer_off < __rows) ? (__outer - __outer_off) : __rows;
+        ca_size_t __n = __r * __inner;
+        __starts[0] = __outer_off;
+        __counts[0] = __r;
+        ca_xfer_stride(ca, __starts, __counts, __strides, __chunk, CA_XFER_GET);
+        ca_size_t __i;
+        for ( __i = 0; __i < __n; __i++ ) {
+          boolean8_t v = __chunk[__i];
+          acc &= v;
+        }
+        __outer_off += __r;
+      }
+      ca_lazy_arena_release(__chunk);
+      ca_lazy_arena_exit();
+      return BOOL2VAL((boolean8_t) (acc));
+    }
+VALUE   vout  = rb_ca_new_reduced(self, slab_axes, naxes, CA_BOOLEAN, keep_axis);
+CArray *co;
+GetCArray(vout, co);
+boolean8_t *op = (boolean8_t *) co->ptr;
+ca_iter_state st;
+int rc = ca_iter_state_init_l2(&st, ca, CA_SLAB_AXES,
+                               slab_axes, naxes, 0);
+if ( rc != CA_ITER_OK ) {
+  rb_raise(rb_eRuntimeError,
+           "all_ki: kernel_iterator init failed rc=%d", rc);
+}
+char       *p;
+boolean8_t *m;
+ca_size_t   out_i = 0;
+      while ( ca_iter_state_next_slab_axes(&st, &p, &m) ) {
+      boolean8_t acc;
+      CA_SLAB_REDUCE_T(boolean8_t, st, p, m, acc, 1, acc &= v);
+      op[out_i++] = (boolean8_t) (acc);
+      }
+      ca_iter_state_finish(&st);
+      if ( naxes == ca->ndim && !keep_axis ) return BOOL2VAL(op[0]);
+      return vout;
+    }
+
+VALUE
+rb_ca_all_ki (int argc, VALUE *argv, VALUE self)
+{
+  CArray *src;
+  GetCArray(self, src);
+  volatile VALUE ropt = rb_pop_options(&argc, &argv);
+  volatile VALUE raxis = Qnil, rkeep_axis = Qnil;
+  rb_scan_options(ropt, "axis,keep_axis", &raxis, &rkeep_axis);
+  int keep_axis = RTEST(rkeep_axis);
+  int8_t slab_axes[CA_RANK_MAX];
+  int8_t naxes = rb_ca_parse_reduce_axes_kw(raxis, src, slab_axes);
+  if ( argc > 0 ) {
+    rb_raise(rb_eArgError, "all_ki: positional axis arguments are no longer accepted (got %d); use axis: kwarg, e.g. a.all(axis: 0) or a.all(axis: [0, 1])", argc);
+  }
+  switch ( src->data_type ) {
+    case CA_BOOLEAN: return all_ki_native_bool(self, src, slab_axes, naxes, keep_axis);
+    default:
+      rb_raise(rb_eCADataTypeError, "all_ki: source data_type :%s not supported (expected one of: bool)", ca_type_name[src->data_type]);
+  }
+  return Qnil;  /* unreachable */
+}
+
+/* ===== any_ki ============================================ */
+
+static VALUE
+any_ki_native_bool (VALUE self, CArray *ca, int8_t *slab_axes, int8_t naxes, int keep_axis)
+{
+    /* P.4.5.3b/c streaming chunked reduce: full reduction over lazy unmasked.  */
+    /* P.4.5.3c (N-D): outer-axis chunking, 1-D is the natural sub-case.        */
+    if ( naxes == ca->ndim && ca->ndim >= 1 && !keep_axis &&
+         ca_is_lazy_view(ca) && ! ca_has_mask(ca) ) {
+      ca_size_t __inner = 1;
+      int       __k;
+      for ( __k = 1; __k < ca->ndim; __k++ ) __inner *= ca->dim[__k];
+      ca_size_t __target = 4096;   /* L1d-friendly element budget (32KB for f64) */
+      ca_size_t __rows   = (__inner > 0) ? (__target / __inner) : __target;
+      if ( __rows < 1 ) __rows = 1;       /* at least one row per chunk */
+      ca_size_t __chunk_elems = __rows * __inner;
+      ca_size_t __outer       = ca->dim[0];
+      ca_size_t __starts[CA_RANK_MAX]  = {0};
+      ca_size_t __counts[CA_RANK_MAX];
+      ca_size_t __strides[CA_RANK_MAX];
+      ca_size_t __s = sizeof(boolean8_t);
+      for ( __k = ca->ndim - 1; __k >= 0; __k-- ) {
+        __strides[__k] = __s;
+        __s *= ca->dim[__k];
+      }
+      for ( __k = 1; __k < ca->ndim; __k++ ) __counts[__k] = ca->dim[__k];
+      ca_size_t __outer_off = 0;
+      boolean8_t acc;
+      acc = (0);
+      ca_lazy_arena_enter();
+      boolean8_t *__chunk = (boolean8_t *) ca_lazy_arena_acquire(__chunk_elems * sizeof(boolean8_t));
+      while ( __outer_off < __outer ) {
+        ca_size_t __r = (__outer - __outer_off < __rows) ? (__outer - __outer_off) : __rows;
+        ca_size_t __n = __r * __inner;
+        __starts[0] = __outer_off;
+        __counts[0] = __r;
+        ca_xfer_stride(ca, __starts, __counts, __strides, __chunk, CA_XFER_GET);
+        ca_size_t __i;
+        for ( __i = 0; __i < __n; __i++ ) {
+          boolean8_t v = __chunk[__i];
+          acc |= v;
+        }
+        __outer_off += __r;
+      }
+      ca_lazy_arena_release(__chunk);
+      ca_lazy_arena_exit();
+      return BOOL2VAL((boolean8_t) (acc));
+    }
+VALUE   vout  = rb_ca_new_reduced(self, slab_axes, naxes, CA_BOOLEAN, keep_axis);
+CArray *co;
+GetCArray(vout, co);
+boolean8_t *op = (boolean8_t *) co->ptr;
+ca_iter_state st;
+int rc = ca_iter_state_init_l2(&st, ca, CA_SLAB_AXES,
+                               slab_axes, naxes, 0);
+if ( rc != CA_ITER_OK ) {
+  rb_raise(rb_eRuntimeError,
+           "any_ki: kernel_iterator init failed rc=%d", rc);
+}
+char       *p;
+boolean8_t *m;
+ca_size_t   out_i = 0;
+      while ( ca_iter_state_next_slab_axes(&st, &p, &m) ) {
+      boolean8_t acc;
+      CA_SLAB_REDUCE_T(boolean8_t, st, p, m, acc, 0, acc |= v);
+      op[out_i++] = (boolean8_t) (acc);
+      }
+      ca_iter_state_finish(&st);
+      if ( naxes == ca->ndim && !keep_axis ) return BOOL2VAL(op[0]);
+      return vout;
+    }
+
+VALUE
+rb_ca_any_ki (int argc, VALUE *argv, VALUE self)
+{
+  CArray *src;
+  GetCArray(self, src);
+  volatile VALUE ropt = rb_pop_options(&argc, &argv);
+  volatile VALUE raxis = Qnil, rkeep_axis = Qnil;
+  rb_scan_options(ropt, "axis,keep_axis", &raxis, &rkeep_axis);
+  int keep_axis = RTEST(rkeep_axis);
+  int8_t slab_axes[CA_RANK_MAX];
+  int8_t naxes = rb_ca_parse_reduce_axes_kw(raxis, src, slab_axes);
+  if ( argc > 0 ) {
+    rb_raise(rb_eArgError, "any_ki: positional axis arguments are no longer accepted (got %d); use axis: kwarg, e.g. a.any(axis: 0) or a.any(axis: [0, 1])", argc);
+  }
+  switch ( src->data_type ) {
+    case CA_BOOLEAN: return any_ki_native_bool(self, src, slab_axes, naxes, keep_axis);
+    default:
+      rb_raise(rb_eCADataTypeError, "any_ki: source data_type :%s not supported (expected one of: bool)", ca_type_name[src->data_type]);
+  }
+  return Qnil;  /* unreachable */
+}
+
+/* ===== none_ki ============================================ */
+
+static VALUE
+none_ki_native_bool (VALUE self, CArray *ca, int8_t *slab_axes, int8_t naxes, int keep_axis)
+{
+    /* P.4.5.3b/c streaming chunked reduce: full reduction over lazy unmasked.  */
+    /* P.4.5.3c (N-D): outer-axis chunking, 1-D is the natural sub-case.        */
+    if ( naxes == ca->ndim && ca->ndim >= 1 && !keep_axis &&
+         ca_is_lazy_view(ca) && ! ca_has_mask(ca) ) {
+      ca_size_t __inner = 1;
+      int       __k;
+      for ( __k = 1; __k < ca->ndim; __k++ ) __inner *= ca->dim[__k];
+      ca_size_t __target = 4096;   /* L1d-friendly element budget (32KB for f64) */
+      ca_size_t __rows   = (__inner > 0) ? (__target / __inner) : __target;
+      if ( __rows < 1 ) __rows = 1;       /* at least one row per chunk */
+      ca_size_t __chunk_elems = __rows * __inner;
+      ca_size_t __outer       = ca->dim[0];
+      ca_size_t __starts[CA_RANK_MAX]  = {0};
+      ca_size_t __counts[CA_RANK_MAX];
+      ca_size_t __strides[CA_RANK_MAX];
+      ca_size_t __s = sizeof(boolean8_t);
+      for ( __k = ca->ndim - 1; __k >= 0; __k-- ) {
+        __strides[__k] = __s;
+        __s *= ca->dim[__k];
+      }
+      for ( __k = 1; __k < ca->ndim; __k++ ) __counts[__k] = ca->dim[__k];
+      ca_size_t __outer_off = 0;
+      boolean8_t acc;
+      acc = (1);
+      ca_lazy_arena_enter();
+      boolean8_t *__chunk = (boolean8_t *) ca_lazy_arena_acquire(__chunk_elems * sizeof(boolean8_t));
+      while ( __outer_off < __outer ) {
+        ca_size_t __r = (__outer - __outer_off < __rows) ? (__outer - __outer_off) : __rows;
+        ca_size_t __n = __r * __inner;
+        __starts[0] = __outer_off;
+        __counts[0] = __r;
+        ca_xfer_stride(ca, __starts, __counts, __strides, __chunk, CA_XFER_GET);
+        ca_size_t __i;
+        for ( __i = 0; __i < __n; __i++ ) {
+          boolean8_t v = __chunk[__i];
+          acc &= !v;
+        }
+        __outer_off += __r;
+      }
+      ca_lazy_arena_release(__chunk);
+      ca_lazy_arena_exit();
+      return BOOL2VAL((boolean8_t) (acc));
+    }
+VALUE   vout  = rb_ca_new_reduced(self, slab_axes, naxes, CA_BOOLEAN, keep_axis);
+CArray *co;
+GetCArray(vout, co);
+boolean8_t *op = (boolean8_t *) co->ptr;
+ca_iter_state st;
+int rc = ca_iter_state_init_l2(&st, ca, CA_SLAB_AXES,
+                               slab_axes, naxes, 0);
+if ( rc != CA_ITER_OK ) {
+  rb_raise(rb_eRuntimeError,
+           "none_ki: kernel_iterator init failed rc=%d", rc);
+}
+char       *p;
+boolean8_t *m;
+ca_size_t   out_i = 0;
+      while ( ca_iter_state_next_slab_axes(&st, &p, &m) ) {
+      boolean8_t acc;
+      CA_SLAB_REDUCE_T(boolean8_t, st, p, m, acc, 1, acc &= !v);
+      op[out_i++] = (boolean8_t) (acc);
+      }
+      ca_iter_state_finish(&st);
+      if ( naxes == ca->ndim && !keep_axis ) return BOOL2VAL(op[0]);
+      return vout;
+    }
+
+VALUE
+rb_ca_none_ki (int argc, VALUE *argv, VALUE self)
+{
+  CArray *src;
+  GetCArray(self, src);
+  volatile VALUE ropt = rb_pop_options(&argc, &argv);
+  volatile VALUE raxis = Qnil, rkeep_axis = Qnil;
+  rb_scan_options(ropt, "axis,keep_axis", &raxis, &rkeep_axis);
+  int keep_axis = RTEST(rkeep_axis);
+  int8_t slab_axes[CA_RANK_MAX];
+  int8_t naxes = rb_ca_parse_reduce_axes_kw(raxis, src, slab_axes);
+  if ( argc > 0 ) {
+    rb_raise(rb_eArgError, "none_ki: positional axis arguments are no longer accepted (got %d); use axis: kwarg, e.g. a.none(axis: 0) or a.none(axis: [0, 1])", argc);
+  }
+  switch ( src->data_type ) {
+    case CA_BOOLEAN: return none_ki_native_bool(self, src, slab_axes, naxes, keep_axis);
+    default:
+      rb_raise(rb_eCADataTypeError, "none_ki: source data_type :%s not supported (expected one of: bool)", ca_type_name[src->data_type]);
+  }
+  return Qnil;  /* unreachable */
+}
+
+void
+Init_carray_kernels_reduce_boolean (void)
+{
+  /* Phase E rewire: legacy 'all' now dispatches via all_ki */
+  rb_define_method(rb_cCArray, "all", rb_ca_all_ki, -1);
+  /* Phase E rewire: legacy 'any' now dispatches via any_ki */
+  rb_define_method(rb_cCArray, "any", rb_ca_any_ki, -1);
+  /* Phase E rewire: legacy 'none' now dispatches via none_ki */
+  rb_define_method(rb_cCArray, "none", rb_ca_none_ki, -1);
+}