carray 3.0.3 → 3.0.4

data/ext/carray_kernels_moncmp.c

@@ -0,0 +1,2104 @@
+/* ---------------------------------------------------------------------------
+
+   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;
+/* The square root of a variance: an ε-negative from rounding becomes 0,
+   a NaN stays NaN (fmax(NaN, 0.0) is 0.0). */
+#ifndef CARRAY_SQRT_CLAMP_DEFINED
+#define CARRAY_SQRT_CLAMP_DEFINED
+static inline double ca_sqrt_clamp (double v) { return sqrt(v < 0.0 ? 0.0 : v); }
+#endif
+
+/* 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"
+
+/* ===== moncmp is_nan ============================================ */
+
+static void
+ca_moncmp_is_nan_int8_t (ca_size_t n, boolean8_t *m,
+                                  char *ptr1, ca_size_t i1,
+                                  boolean8_t *ptr2, ca_size_t i2)
+{
+  int8_t *q1 = (int8_t *) ptr1;
+  int8_t *p1 = q1;
+  boolean8_t *q2 = (boolean8_t *) ptr2;
+  boolean8_t *p2 = q2;
+  ca_size_t k;
+  (void) p1;   /* expr may not reference *p1 (e.g. constant predicate) */
+  if ( m ) {
+    boolean8_t *pm;
+    for (k=0; k<n; k++) {
+      pm = m + k;
+      if ( ! *pm ) {
+        p1 = q1 + k*i1;
+        p2 = q2 + k*i2;
+        { (*p2) = 0; }
+      }
+    }
+  } else {
+    for (k=0; k<n; k++) {
+      p1 = q1 + k*i1;
+      p2 = q2 + k*i2;
+      { (*p2) = 0; }
+    }
+  }
+}
+
+static void
+ca_moncmp_is_nan_uint8_t (ca_size_t n, boolean8_t *m,
+                                  char *ptr1, ca_size_t i1,
+                                  boolean8_t *ptr2, ca_size_t i2)
+{
+  uint8_t *q1 = (uint8_t *) ptr1;
+  uint8_t *p1 = q1;
+  boolean8_t *q2 = (boolean8_t *) ptr2;
+  boolean8_t *p2 = q2;
+  ca_size_t k;
+  (void) p1;   /* expr may not reference *p1 (e.g. constant predicate) */
+  if ( m ) {
+    boolean8_t *pm;
+    for (k=0; k<n; k++) {
+      pm = m + k;
+      if ( ! *pm ) {
+        p1 = q1 + k*i1;
+        p2 = q2 + k*i2;
+        { (*p2) = 0; }
+      }
+    }
+  } else {
+    for (k=0; k<n; k++) {
+      p1 = q1 + k*i1;
+      p2 = q2 + k*i2;
+      { (*p2) = 0; }
+    }
+  }
+}
+
+static void
+ca_moncmp_is_nan_int16_t (ca_size_t n, boolean8_t *m,
+                                  char *ptr1, ca_size_t i1,
+                                  boolean8_t *ptr2, ca_size_t i2)
+{
+  int16_t *q1 = (int16_t *) ptr1;
+  int16_t *p1 = q1;
+  boolean8_t *q2 = (boolean8_t *) ptr2;
+  boolean8_t *p2 = q2;
+  ca_size_t k;
+  (void) p1;   /* expr may not reference *p1 (e.g. constant predicate) */
+  if ( m ) {
+    boolean8_t *pm;
+    for (k=0; k<n; k++) {
+      pm = m + k;
+      if ( ! *pm ) {
+        p1 = q1 + k*i1;
+        p2 = q2 + k*i2;
+        { (*p2) = 0; }
+      }
+    }
+  } else {
+    for (k=0; k<n; k++) {
+      p1 = q1 + k*i1;
+      p2 = q2 + k*i2;
+      { (*p2) = 0; }
+    }
+  }
+}
+
+static void
+ca_moncmp_is_nan_uint16_t (ca_size_t n, boolean8_t *m,
+                                  char *ptr1, ca_size_t i1,
+                                  boolean8_t *ptr2, ca_size_t i2)
+{
+  uint16_t *q1 = (uint16_t *) ptr1;
+  uint16_t *p1 = q1;
+  boolean8_t *q2 = (boolean8_t *) ptr2;
+  boolean8_t *p2 = q2;
+  ca_size_t k;
+  (void) p1;   /* expr may not reference *p1 (e.g. constant predicate) */
+  if ( m ) {
+    boolean8_t *pm;
+    for (k=0; k<n; k++) {
+      pm = m + k;
+      if ( ! *pm ) {
+        p1 = q1 + k*i1;
+        p2 = q2 + k*i2;
+        { (*p2) = 0; }
+      }
+    }
+  } else {
+    for (k=0; k<n; k++) {
+      p1 = q1 + k*i1;
+      p2 = q2 + k*i2;
+      { (*p2) = 0; }
+    }
+  }
+}
+
+static void
+ca_moncmp_is_nan_int32_t (ca_size_t n, boolean8_t *m,
+                                  char *ptr1, ca_size_t i1,
+                                  boolean8_t *ptr2, ca_size_t i2)
+{
+  int32_t *q1 = (int32_t *) ptr1;
+  int32_t *p1 = q1;
+  boolean8_t *q2 = (boolean8_t *) ptr2;
+  boolean8_t *p2 = q2;
+  ca_size_t k;
+  (void) p1;   /* expr may not reference *p1 (e.g. constant predicate) */
+  if ( m ) {
+    boolean8_t *pm;
+    for (k=0; k<n; k++) {
+      pm = m + k;
+      if ( ! *pm ) {
+        p1 = q1 + k*i1;
+        p2 = q2 + k*i2;
+        { (*p2) = 0; }
+      }
+    }
+  } else {
+    for (k=0; k<n; k++) {
+      p1 = q1 + k*i1;
+      p2 = q2 + k*i2;
+      { (*p2) = 0; }
+    }
+  }
+}
+
+static void
+ca_moncmp_is_nan_uint32_t (ca_size_t n, boolean8_t *m,
+                                  char *ptr1, ca_size_t i1,
+                                  boolean8_t *ptr2, ca_size_t i2)
+{
+  uint32_t *q1 = (uint32_t *) ptr1;
+  uint32_t *p1 = q1;
+  boolean8_t *q2 = (boolean8_t *) ptr2;
+  boolean8_t *p2 = q2;
+  ca_size_t k;
+  (void) p1;   /* expr may not reference *p1 (e.g. constant predicate) */
+  if ( m ) {
+    boolean8_t *pm;
+    for (k=0; k<n; k++) {
+      pm = m + k;
+      if ( ! *pm ) {
+        p1 = q1 + k*i1;
+        p2 = q2 + k*i2;
+        { (*p2) = 0; }
+      }
+    }
+  } else {
+    for (k=0; k<n; k++) {
+      p1 = q1 + k*i1;
+      p2 = q2 + k*i2;
+      { (*p2) = 0; }
+    }
+  }
+}
+
+static void
+ca_moncmp_is_nan_int64_t (ca_size_t n, boolean8_t *m,
+                                  char *ptr1, ca_size_t i1,
+                                  boolean8_t *ptr2, ca_size_t i2)
+{
+  int64_t *q1 = (int64_t *) ptr1;
+  int64_t *p1 = q1;
+  boolean8_t *q2 = (boolean8_t *) ptr2;
+  boolean8_t *p2 = q2;
+  ca_size_t k;
+  (void) p1;   /* expr may not reference *p1 (e.g. constant predicate) */
+  if ( m ) {
+    boolean8_t *pm;
+    for (k=0; k<n; k++) {
+      pm = m + k;
+      if ( ! *pm ) {
+        p1 = q1 + k*i1;
+        p2 = q2 + k*i2;
+        { (*p2) = 0; }
+      }
+    }
+  } else {
+    for (k=0; k<n; k++) {
+      p1 = q1 + k*i1;
+      p2 = q2 + k*i2;
+      { (*p2) = 0; }
+    }
+  }
+}
+
+static void
+ca_moncmp_is_nan_uint64_t (ca_size_t n, boolean8_t *m,
+                                  char *ptr1, ca_size_t i1,
+                                  boolean8_t *ptr2, ca_size_t i2)
+{
+  uint64_t *q1 = (uint64_t *) ptr1;
+  uint64_t *p1 = q1;
+  boolean8_t *q2 = (boolean8_t *) ptr2;
+  boolean8_t *p2 = q2;
+  ca_size_t k;
+  (void) p1;   /* expr may not reference *p1 (e.g. constant predicate) */
+  if ( m ) {
+    boolean8_t *pm;
+    for (k=0; k<n; k++) {
+      pm = m + k;
+      if ( ! *pm ) {
+        p1 = q1 + k*i1;
+        p2 = q2 + k*i2;
+        { (*p2) = 0; }
+      }
+    }
+  } else {
+    for (k=0; k<n; k++) {
+      p1 = q1 + k*i1;
+      p2 = q2 + k*i2;
+      { (*p2) = 0; }
+    }
+  }
+}
+
+static void
+ca_moncmp_is_nan_float32_t (ca_size_t n, boolean8_t *m,
+                                  char *ptr1, ca_size_t i1,
+                                  boolean8_t *ptr2, ca_size_t i2)
+{
+  float *q1 = (float *) ptr1;
+  float *p1 = q1;
+  boolean8_t *q2 = (boolean8_t *) ptr2;
+  boolean8_t *p2 = q2;
+  ca_size_t k;
+  (void) p1;   /* expr may not reference *p1 (e.g. constant predicate) */
+  if ( m ) {
+    boolean8_t *pm;
+    for (k=0; k<n; k++) {
+      pm = m + k;
+      if ( ! *pm ) {
+        p1 = q1 + k*i1;
+        p2 = q2 + k*i2;
+        { (*p2) = isnan(*p1); }
+      }
+    }
+  } else {
+    for (k=0; k<n; k++) {
+      p1 = q1 + k*i1;
+      p2 = q2 + k*i2;
+      { (*p2) = isnan(*p1); }
+    }
+  }
+}
+
+static void
+ca_moncmp_is_nan_float64_t (ca_size_t n, boolean8_t *m,
+                                  char *ptr1, ca_size_t i1,
+                                  boolean8_t *ptr2, ca_size_t i2)
+{
+  double *q1 = (double *) ptr1;
+  double *p1 = q1;
+  boolean8_t *q2 = (boolean8_t *) ptr2;
+  boolean8_t *p2 = q2;
+  ca_size_t k;
+  (void) p1;   /* expr may not reference *p1 (e.g. constant predicate) */
+  if ( m ) {
+    boolean8_t *pm;
+    for (k=0; k<n; k++) {
+      pm = m + k;
+      if ( ! *pm ) {
+        p1 = q1 + k*i1;
+        p2 = q2 + k*i2;
+        { (*p2) = isnan(*p1); }
+      }
+    }
+  } else {
+    for (k=0; k<n; k++) {
+      p1 = q1 + k*i1;
+      p2 = q2 + k*i2;
+      { (*p2) = isnan(*p1); }
+    }
+  }
+}
+
+static void
+ca_moncmp_is_nan_cmplx64_t (ca_size_t n, boolean8_t *m,
+                                  char *ptr1, ca_size_t i1,
+                                  boolean8_t *ptr2, ca_size_t i2)
+{
+  cmplx64_t *q1 = (cmplx64_t *) ptr1;
+  cmplx64_t *p1 = q1;
+  boolean8_t *q2 = (boolean8_t *) ptr2;
+  boolean8_t *p2 = q2;
+  ca_size_t k;
+  (void) p1;   /* expr may not reference *p1 (e.g. constant predicate) */
+  if ( m ) {
+    boolean8_t *pm;
+    for (k=0; k<n; k++) {
+      pm = m + k;
+      if ( ! *pm ) {
+        p1 = q1 + k*i1;
+        p2 = q2 + k*i2;
+        { (*p2) = (isnan(creal(*p1)) || isnan(cimag(*p1))); }
+      }
+    }
+  } else {
+    for (k=0; k<n; k++) {
+      p1 = q1 + k*i1;
+      p2 = q2 + k*i2;
+      { (*p2) = (isnan(creal(*p1)) || isnan(cimag(*p1))); }
+    }
+  }
+}
+
+static void
+ca_moncmp_is_nan_cmplx128_t (ca_size_t n, boolean8_t *m,
+                                  char *ptr1, ca_size_t i1,
+                                  boolean8_t *ptr2, ca_size_t i2)
+{
+  cmplx128_t *q1 = (cmplx128_t *) ptr1;
+  cmplx128_t *p1 = q1;
+  boolean8_t *q2 = (boolean8_t *) ptr2;
+  boolean8_t *p2 = q2;
+  ca_size_t k;
+  (void) p1;   /* expr may not reference *p1 (e.g. constant predicate) */
+  if ( m ) {
+    boolean8_t *pm;
+    for (k=0; k<n; k++) {
+      pm = m + k;
+      if ( ! *pm ) {
+        p1 = q1 + k*i1;
+        p2 = q2 + k*i2;
+        { (*p2) = (isnan(creal(*p1)) || isnan(cimag(*p1))); }
+      }
+    }
+  } else {
+    for (k=0; k<n; k++) {
+      p1 = q1 + k*i1;
+      p2 = q2 + k*i2;
+      { (*p2) = (isnan(creal(*p1)) || isnan(cimag(*p1))); }
+    }
+  }
+}
+
+static void
+ca_moncmp_is_nan_VALUE (ca_size_t n, boolean8_t *m,
+                                  char *ptr1, ca_size_t i1,
+                                  boolean8_t *ptr2, ca_size_t i2)
+{
+  VALUE *q1 = (VALUE *) ptr1;
+  VALUE *p1 = q1;
+  boolean8_t *q2 = (boolean8_t *) ptr2;
+  boolean8_t *p2 = q2;
+  ca_size_t k;
+  (void) p1;   /* expr may not reference *p1 (e.g. constant predicate) */
+  if ( m ) {
+    boolean8_t *pm;
+    for (k=0; k<n; k++) {
+      pm = m + k;
+      if ( ! *pm ) {
+        p1 = q1 + k*i1;
+        p2 = q2 + k*i2;
+        { (*p2) = RB_FLOAT_TYPE_P(*p1) ? isnan(RFLOAT_VALUE(*p1)) : (RB_INTEGER_TYPE_P(*p1) || RB_TYPE_P((*p1), T_RATIONAL)) ? 0 : RTEST(rb_funcall((*p1), rb_intern("nan?"), 0)); }
+      }
+    }
+  } else {
+    for (k=0; k<n; k++) {
+      p1 = q1 + k*i1;
+      p2 = q2 + k*i2;
+      { (*p2) = RB_FLOAT_TYPE_P(*p1) ? isnan(RFLOAT_VALUE(*p1)) : (RB_INTEGER_TYPE_P(*p1) || RB_TYPE_P((*p1), T_RATIONAL)) ? 0 : RTEST(rb_funcall((*p1), rb_intern("nan?"), 0)); }
+    }
+  }
+}
+
+ca_moncmp_func_t
+ca_moncmp_is_nan[CA_NTYPE] = {
+  ca_moncmp_not_implement,
+  ca_moncmp_not_implement,
+  ca_moncmp_is_nan_int8_t,
+  ca_moncmp_is_nan_uint8_t,
+  ca_moncmp_is_nan_int16_t,
+  ca_moncmp_is_nan_uint16_t,
+  ca_moncmp_is_nan_int32_t,
+  ca_moncmp_is_nan_uint32_t,
+  ca_moncmp_is_nan_int64_t,
+  ca_moncmp_is_nan_uint64_t,
+  ca_moncmp_is_nan_float32_t,
+  ca_moncmp_is_nan_float64_t,
+  ca_moncmp_not_implement,
+  ca_moncmp_is_nan_cmplx64_t,
+  ca_moncmp_is_nan_cmplx128_t,
+  ca_moncmp_not_implement,
+  ca_moncmp_is_nan_VALUE,
+};
+
+VALUE rb_ca_is_nan (VALUE self)
+{ return rb_ca_call_moncmp(self, ca_moncmp_is_nan); }
+
+/* ===== moncmp is_inf ============================================ */
+
+static void
+ca_moncmp_is_inf_int8_t (ca_size_t n, boolean8_t *m,
+                                  char *ptr1, ca_size_t i1,
+                                  boolean8_t *ptr2, ca_size_t i2)
+{
+  int8_t *q1 = (int8_t *) ptr1;
+  int8_t *p1 = q1;
+  boolean8_t *q2 = (boolean8_t *) ptr2;
+  boolean8_t *p2 = q2;
+  ca_size_t k;
+  (void) p1;   /* expr may not reference *p1 (e.g. constant predicate) */
+  if ( m ) {
+    boolean8_t *pm;
+    for (k=0; k<n; k++) {
+      pm = m + k;
+      if ( ! *pm ) {
+        p1 = q1 + k*i1;
+        p2 = q2 + k*i2;
+        { (*p2) = 0; }
+      }
+    }
+  } else {
+    for (k=0; k<n; k++) {
+      p1 = q1 + k*i1;
+      p2 = q2 + k*i2;
+      { (*p2) = 0; }
+    }
+  }
+}
+
+static void
+ca_moncmp_is_inf_uint8_t (ca_size_t n, boolean8_t *m,
+                                  char *ptr1, ca_size_t i1,
+                                  boolean8_t *ptr2, ca_size_t i2)
+{
+  uint8_t *q1 = (uint8_t *) ptr1;
+  uint8_t *p1 = q1;
+  boolean8_t *q2 = (boolean8_t *) ptr2;
+  boolean8_t *p2 = q2;
+  ca_size_t k;
+  (void) p1;   /* expr may not reference *p1 (e.g. constant predicate) */
+  if ( m ) {
+    boolean8_t *pm;
+    for (k=0; k<n; k++) {
+      pm = m + k;
+      if ( ! *pm ) {
+        p1 = q1 + k*i1;
+        p2 = q2 + k*i2;
+        { (*p2) = 0; }
+      }
+    }
+  } else {
+    for (k=0; k<n; k++) {
+      p1 = q1 + k*i1;
+      p2 = q2 + k*i2;
+      { (*p2) = 0; }
+    }
+  }
+}
+
+static void
+ca_moncmp_is_inf_int16_t (ca_size_t n, boolean8_t *m,
+                                  char *ptr1, ca_size_t i1,
+                                  boolean8_t *ptr2, ca_size_t i2)
+{
+  int16_t *q1 = (int16_t *) ptr1;
+  int16_t *p1 = q1;
+  boolean8_t *q2 = (boolean8_t *) ptr2;
+  boolean8_t *p2 = q2;
+  ca_size_t k;
+  (void) p1;   /* expr may not reference *p1 (e.g. constant predicate) */
+  if ( m ) {
+    boolean8_t *pm;
+    for (k=0; k<n; k++) {
+      pm = m + k;
+      if ( ! *pm ) {
+        p1 = q1 + k*i1;
+        p2 = q2 + k*i2;
+        { (*p2) = 0; }
+      }
+    }
+  } else {
+    for (k=0; k<n; k++) {
+      p1 = q1 + k*i1;
+      p2 = q2 + k*i2;
+      { (*p2) = 0; }
+    }
+  }
+}
+
+static void
+ca_moncmp_is_inf_uint16_t (ca_size_t n, boolean8_t *m,
+                                  char *ptr1, ca_size_t i1,
+                                  boolean8_t *ptr2, ca_size_t i2)
+{
+  uint16_t *q1 = (uint16_t *) ptr1;
+  uint16_t *p1 = q1;
+  boolean8_t *q2 = (boolean8_t *) ptr2;
+  boolean8_t *p2 = q2;
+  ca_size_t k;
+  (void) p1;   /* expr may not reference *p1 (e.g. constant predicate) */
+  if ( m ) {
+    boolean8_t *pm;
+    for (k=0; k<n; k++) {
+      pm = m + k;
+      if ( ! *pm ) {
+        p1 = q1 + k*i1;
+        p2 = q2 + k*i2;
+        { (*p2) = 0; }
+      }
+    }
+  } else {
+    for (k=0; k<n; k++) {
+      p1 = q1 + k*i1;
+      p2 = q2 + k*i2;
+      { (*p2) = 0; }
+    }
+  }
+}
+
+static void
+ca_moncmp_is_inf_int32_t (ca_size_t n, boolean8_t *m,
+                                  char *ptr1, ca_size_t i1,
+                                  boolean8_t *ptr2, ca_size_t i2)
+{
+  int32_t *q1 = (int32_t *) ptr1;
+  int32_t *p1 = q1;
+  boolean8_t *q2 = (boolean8_t *) ptr2;
+  boolean8_t *p2 = q2;
+  ca_size_t k;
+  (void) p1;   /* expr may not reference *p1 (e.g. constant predicate) */
+  if ( m ) {
+    boolean8_t *pm;
+    for (k=0; k<n; k++) {
+      pm = m + k;
+      if ( ! *pm ) {
+        p1 = q1 + k*i1;
+        p2 = q2 + k*i2;
+        { (*p2) = 0; }
+      }
+    }
+  } else {
+    for (k=0; k<n; k++) {
+      p1 = q1 + k*i1;
+      p2 = q2 + k*i2;
+      { (*p2) = 0; }
+    }
+  }
+}
+
+static void
+ca_moncmp_is_inf_uint32_t (ca_size_t n, boolean8_t *m,
+                                  char *ptr1, ca_size_t i1,
+                                  boolean8_t *ptr2, ca_size_t i2)
+{
+  uint32_t *q1 = (uint32_t *) ptr1;
+  uint32_t *p1 = q1;
+  boolean8_t *q2 = (boolean8_t *) ptr2;
+  boolean8_t *p2 = q2;
+  ca_size_t k;
+  (void) p1;   /* expr may not reference *p1 (e.g. constant predicate) */
+  if ( m ) {
+    boolean8_t *pm;
+    for (k=0; k<n; k++) {
+      pm = m + k;
+      if ( ! *pm ) {
+        p1 = q1 + k*i1;
+        p2 = q2 + k*i2;
+        { (*p2) = 0; }
+      }
+    }
+  } else {
+    for (k=0; k<n; k++) {
+      p1 = q1 + k*i1;
+      p2 = q2 + k*i2;
+      { (*p2) = 0; }
+    }
+  }
+}
+
+static void
+ca_moncmp_is_inf_int64_t (ca_size_t n, boolean8_t *m,
+                                  char *ptr1, ca_size_t i1,
+                                  boolean8_t *ptr2, ca_size_t i2)
+{
+  int64_t *q1 = (int64_t *) ptr1;
+  int64_t *p1 = q1;
+  boolean8_t *q2 = (boolean8_t *) ptr2;
+  boolean8_t *p2 = q2;
+  ca_size_t k;
+  (void) p1;   /* expr may not reference *p1 (e.g. constant predicate) */
+  if ( m ) {
+    boolean8_t *pm;
+    for (k=0; k<n; k++) {
+      pm = m + k;
+      if ( ! *pm ) {
+        p1 = q1 + k*i1;
+        p2 = q2 + k*i2;
+        { (*p2) = 0; }
+      }
+    }
+  } else {
+    for (k=0; k<n; k++) {
+      p1 = q1 + k*i1;
+      p2 = q2 + k*i2;
+      { (*p2) = 0; }
+    }
+  }
+}
+
+static void
+ca_moncmp_is_inf_uint64_t (ca_size_t n, boolean8_t *m,
+                                  char *ptr1, ca_size_t i1,
+                                  boolean8_t *ptr2, ca_size_t i2)
+{
+  uint64_t *q1 = (uint64_t *) ptr1;
+  uint64_t *p1 = q1;
+  boolean8_t *q2 = (boolean8_t *) ptr2;
+  boolean8_t *p2 = q2;
+  ca_size_t k;
+  (void) p1;   /* expr may not reference *p1 (e.g. constant predicate) */
+  if ( m ) {
+    boolean8_t *pm;
+    for (k=0; k<n; k++) {
+      pm = m + k;
+      if ( ! *pm ) {
+        p1 = q1 + k*i1;
+        p2 = q2 + k*i2;
+        { (*p2) = 0; }
+      }
+    }
+  } else {
+    for (k=0; k<n; k++) {
+      p1 = q1 + k*i1;
+      p2 = q2 + k*i2;
+      { (*p2) = 0; }
+    }
+  }
+}
+
+static void
+ca_moncmp_is_inf_float32_t (ca_size_t n, boolean8_t *m,
+                                  char *ptr1, ca_size_t i1,
+                                  boolean8_t *ptr2, ca_size_t i2)
+{
+  float *q1 = (float *) ptr1;
+  float *p1 = q1;
+  boolean8_t *q2 = (boolean8_t *) ptr2;
+  boolean8_t *p2 = q2;
+  ca_size_t k;
+  (void) p1;   /* expr may not reference *p1 (e.g. constant predicate) */
+  if ( m ) {
+    boolean8_t *pm;
+    for (k=0; k<n; k++) {
+      pm = m + k;
+      if ( ! *pm ) {
+        p1 = q1 + k*i1;
+        p2 = q2 + k*i2;
+        { (*p2) = isinf(*p1); }
+      }
+    }
+  } else {
+    for (k=0; k<n; k++) {
+      p1 = q1 + k*i1;
+      p2 = q2 + k*i2;
+      { (*p2) = isinf(*p1); }
+    }
+  }
+}
+
+static void
+ca_moncmp_is_inf_float64_t (ca_size_t n, boolean8_t *m,
+                                  char *ptr1, ca_size_t i1,
+                                  boolean8_t *ptr2, ca_size_t i2)
+{
+  double *q1 = (double *) ptr1;
+  double *p1 = q1;
+  boolean8_t *q2 = (boolean8_t *) ptr2;
+  boolean8_t *p2 = q2;
+  ca_size_t k;
+  (void) p1;   /* expr may not reference *p1 (e.g. constant predicate) */
+  if ( m ) {
+    boolean8_t *pm;
+    for (k=0; k<n; k++) {
+      pm = m + k;
+      if ( ! *pm ) {
+        p1 = q1 + k*i1;
+        p2 = q2 + k*i2;
+        { (*p2) = isinf(*p1); }
+      }
+    }
+  } else {
+    for (k=0; k<n; k++) {
+      p1 = q1 + k*i1;
+      p2 = q2 + k*i2;
+      { (*p2) = isinf(*p1); }
+    }
+  }
+}
+
+static void
+ca_moncmp_is_inf_cmplx64_t (ca_size_t n, boolean8_t *m,
+                                  char *ptr1, ca_size_t i1,
+                                  boolean8_t *ptr2, ca_size_t i2)
+{
+  cmplx64_t *q1 = (cmplx64_t *) ptr1;
+  cmplx64_t *p1 = q1;
+  boolean8_t *q2 = (boolean8_t *) ptr2;
+  boolean8_t *p2 = q2;
+  ca_size_t k;
+  (void) p1;   /* expr may not reference *p1 (e.g. constant predicate) */
+  if ( m ) {
+    boolean8_t *pm;
+    for (k=0; k<n; k++) {
+      pm = m + k;
+      if ( ! *pm ) {
+        p1 = q1 + k*i1;
+        p2 = q2 + k*i2;
+        { (*p2) = (isinf(creal(*p1)) || isinf(cimag(*p1))); }
+      }
+    }
+  } else {
+    for (k=0; k<n; k++) {
+      p1 = q1 + k*i1;
+      p2 = q2 + k*i2;
+      { (*p2) = (isinf(creal(*p1)) || isinf(cimag(*p1))); }
+    }
+  }
+}
+
+static void
+ca_moncmp_is_inf_cmplx128_t (ca_size_t n, boolean8_t *m,
+                                  char *ptr1, ca_size_t i1,
+                                  boolean8_t *ptr2, ca_size_t i2)
+{
+  cmplx128_t *q1 = (cmplx128_t *) ptr1;
+  cmplx128_t *p1 = q1;
+  boolean8_t *q2 = (boolean8_t *) ptr2;
+  boolean8_t *p2 = q2;
+  ca_size_t k;
+  (void) p1;   /* expr may not reference *p1 (e.g. constant predicate) */
+  if ( m ) {
+    boolean8_t *pm;
+    for (k=0; k<n; k++) {
+      pm = m + k;
+      if ( ! *pm ) {
+        p1 = q1 + k*i1;
+        p2 = q2 + k*i2;
+        { (*p2) = (isinf(creal(*p1)) || isinf(cimag(*p1))); }
+      }
+    }
+  } else {
+    for (k=0; k<n; k++) {
+      p1 = q1 + k*i1;
+      p2 = q2 + k*i2;
+      { (*p2) = (isinf(creal(*p1)) || isinf(cimag(*p1))); }
+    }
+  }
+}
+
+static void
+ca_moncmp_is_inf_VALUE (ca_size_t n, boolean8_t *m,
+                                  char *ptr1, ca_size_t i1,
+                                  boolean8_t *ptr2, ca_size_t i2)
+{
+  VALUE *q1 = (VALUE *) ptr1;
+  VALUE *p1 = q1;
+  boolean8_t *q2 = (boolean8_t *) ptr2;
+  boolean8_t *p2 = q2;
+  ca_size_t k;
+  (void) p1;   /* expr may not reference *p1 (e.g. constant predicate) */
+  if ( m ) {
+    boolean8_t *pm;
+    for (k=0; k<n; k++) {
+      pm = m + k;
+      if ( ! *pm ) {
+        p1 = q1 + k*i1;
+        p2 = q2 + k*i2;
+        { (*p2) = RTEST(rb_funcall((*p1), rb_intern("infinite?"), 0)); }
+      }
+    }
+  } else {
+    for (k=0; k<n; k++) {
+      p1 = q1 + k*i1;
+      p2 = q2 + k*i2;
+      { (*p2) = RTEST(rb_funcall((*p1), rb_intern("infinite?"), 0)); }
+    }
+  }
+}
+
+ca_moncmp_func_t
+ca_moncmp_is_inf[CA_NTYPE] = {
+  ca_moncmp_not_implement,
+  ca_moncmp_not_implement,
+  ca_moncmp_is_inf_int8_t,
+  ca_moncmp_is_inf_uint8_t,
+  ca_moncmp_is_inf_int16_t,
+  ca_moncmp_is_inf_uint16_t,
+  ca_moncmp_is_inf_int32_t,
+  ca_moncmp_is_inf_uint32_t,
+  ca_moncmp_is_inf_int64_t,
+  ca_moncmp_is_inf_uint64_t,
+  ca_moncmp_is_inf_float32_t,
+  ca_moncmp_is_inf_float64_t,
+  ca_moncmp_not_implement,
+  ca_moncmp_is_inf_cmplx64_t,
+  ca_moncmp_is_inf_cmplx128_t,
+  ca_moncmp_not_implement,
+  ca_moncmp_is_inf_VALUE,
+};
+
+VALUE rb_ca_is_inf (VALUE self)
+{ return rb_ca_call_moncmp(self, ca_moncmp_is_inf); }
+
+/* ===== moncmp is_finite ============================================ */
+
+static void
+ca_moncmp_is_finite_int8_t (ca_size_t n, boolean8_t *m,
+                                  char *ptr1, ca_size_t i1,
+                                  boolean8_t *ptr2, ca_size_t i2)
+{
+  int8_t *q1 = (int8_t *) ptr1;
+  int8_t *p1 = q1;
+  boolean8_t *q2 = (boolean8_t *) ptr2;
+  boolean8_t *p2 = q2;
+  ca_size_t k;
+  (void) p1;   /* expr may not reference *p1 (e.g. constant predicate) */
+  if ( m ) {
+    boolean8_t *pm;
+    for (k=0; k<n; k++) {
+      pm = m + k;
+      if ( ! *pm ) {
+        p1 = q1 + k*i1;
+        p2 = q2 + k*i2;
+        { (*p2) = 1; }
+      }
+    }
+  } else {
+    for (k=0; k<n; k++) {
+      p1 = q1 + k*i1;
+      p2 = q2 + k*i2;
+      { (*p2) = 1; }
+    }
+  }
+}
+
+static void
+ca_moncmp_is_finite_uint8_t (ca_size_t n, boolean8_t *m,
+                                  char *ptr1, ca_size_t i1,
+                                  boolean8_t *ptr2, ca_size_t i2)
+{
+  uint8_t *q1 = (uint8_t *) ptr1;
+  uint8_t *p1 = q1;
+  boolean8_t *q2 = (boolean8_t *) ptr2;
+  boolean8_t *p2 = q2;
+  ca_size_t k;
+  (void) p1;   /* expr may not reference *p1 (e.g. constant predicate) */
+  if ( m ) {
+    boolean8_t *pm;
+    for (k=0; k<n; k++) {
+      pm = m + k;
+      if ( ! *pm ) {
+        p1 = q1 + k*i1;
+        p2 = q2 + k*i2;
+        { (*p2) = 1; }
+      }
+    }
+  } else {
+    for (k=0; k<n; k++) {
+      p1 = q1 + k*i1;
+      p2 = q2 + k*i2;
+      { (*p2) = 1; }
+    }
+  }
+}
+
+static void
+ca_moncmp_is_finite_int16_t (ca_size_t n, boolean8_t *m,
+                                  char *ptr1, ca_size_t i1,
+                                  boolean8_t *ptr2, ca_size_t i2)
+{
+  int16_t *q1 = (int16_t *) ptr1;
+  int16_t *p1 = q1;
+  boolean8_t *q2 = (boolean8_t *) ptr2;
+  boolean8_t *p2 = q2;
+  ca_size_t k;
+  (void) p1;   /* expr may not reference *p1 (e.g. constant predicate) */
+  if ( m ) {
+    boolean8_t *pm;
+    for (k=0; k<n; k++) {
+      pm = m + k;
+      if ( ! *pm ) {
+        p1 = q1 + k*i1;
+        p2 = q2 + k*i2;
+        { (*p2) = 1; }
+      }
+    }
+  } else {
+    for (k=0; k<n; k++) {
+      p1 = q1 + k*i1;
+      p2 = q2 + k*i2;
+      { (*p2) = 1; }
+    }
+  }
+}
+
+static void
+ca_moncmp_is_finite_uint16_t (ca_size_t n, boolean8_t *m,
+                                  char *ptr1, ca_size_t i1,
+                                  boolean8_t *ptr2, ca_size_t i2)
+{
+  uint16_t *q1 = (uint16_t *) ptr1;
+  uint16_t *p1 = q1;
+  boolean8_t *q2 = (boolean8_t *) ptr2;
+  boolean8_t *p2 = q2;
+  ca_size_t k;
+  (void) p1;   /* expr may not reference *p1 (e.g. constant predicate) */
+  if ( m ) {
+    boolean8_t *pm;
+    for (k=0; k<n; k++) {
+      pm = m + k;
+      if ( ! *pm ) {
+        p1 = q1 + k*i1;
+        p2 = q2 + k*i2;
+        { (*p2) = 1; }
+      }
+    }
+  } else {
+    for (k=0; k<n; k++) {
+      p1 = q1 + k*i1;
+      p2 = q2 + k*i2;
+      { (*p2) = 1; }
+    }
+  }
+}
+
+static void
+ca_moncmp_is_finite_int32_t (ca_size_t n, boolean8_t *m,
+                                  char *ptr1, ca_size_t i1,
+                                  boolean8_t *ptr2, ca_size_t i2)
+{
+  int32_t *q1 = (int32_t *) ptr1;
+  int32_t *p1 = q1;
+  boolean8_t *q2 = (boolean8_t *) ptr2;
+  boolean8_t *p2 = q2;
+  ca_size_t k;
+  (void) p1;   /* expr may not reference *p1 (e.g. constant predicate) */
+  if ( m ) {
+    boolean8_t *pm;
+    for (k=0; k<n; k++) {
+      pm = m + k;
+      if ( ! *pm ) {
+        p1 = q1 + k*i1;
+        p2 = q2 + k*i2;
+        { (*p2) = 1; }
+      }
+    }
+  } else {
+    for (k=0; k<n; k++) {
+      p1 = q1 + k*i1;
+      p2 = q2 + k*i2;
+      { (*p2) = 1; }
+    }
+  }
+}
+
+static void
+ca_moncmp_is_finite_uint32_t (ca_size_t n, boolean8_t *m,
+                                  char *ptr1, ca_size_t i1,
+                                  boolean8_t *ptr2, ca_size_t i2)
+{
+  uint32_t *q1 = (uint32_t *) ptr1;
+  uint32_t *p1 = q1;
+  boolean8_t *q2 = (boolean8_t *) ptr2;
+  boolean8_t *p2 = q2;
+  ca_size_t k;
+  (void) p1;   /* expr may not reference *p1 (e.g. constant predicate) */
+  if ( m ) {
+    boolean8_t *pm;
+    for (k=0; k<n; k++) {
+      pm = m + k;
+      if ( ! *pm ) {
+        p1 = q1 + k*i1;
+        p2 = q2 + k*i2;
+        { (*p2) = 1; }
+      }
+    }
+  } else {
+    for (k=0; k<n; k++) {
+      p1 = q1 + k*i1;
+      p2 = q2 + k*i2;
+      { (*p2) = 1; }
+    }
+  }
+}
+
+static void
+ca_moncmp_is_finite_int64_t (ca_size_t n, boolean8_t *m,
+                                  char *ptr1, ca_size_t i1,
+                                  boolean8_t *ptr2, ca_size_t i2)
+{
+  int64_t *q1 = (int64_t *) ptr1;
+  int64_t *p1 = q1;
+  boolean8_t *q2 = (boolean8_t *) ptr2;
+  boolean8_t *p2 = q2;
+  ca_size_t k;
+  (void) p1;   /* expr may not reference *p1 (e.g. constant predicate) */
+  if ( m ) {
+    boolean8_t *pm;
+    for (k=0; k<n; k++) {
+      pm = m + k;
+      if ( ! *pm ) {
+        p1 = q1 + k*i1;
+        p2 = q2 + k*i2;
+        { (*p2) = 1; }
+      }
+    }
+  } else {
+    for (k=0; k<n; k++) {
+      p1 = q1 + k*i1;
+      p2 = q2 + k*i2;
+      { (*p2) = 1; }
+    }
+  }
+}
+
+static void
+ca_moncmp_is_finite_uint64_t (ca_size_t n, boolean8_t *m,
+                                  char *ptr1, ca_size_t i1,
+                                  boolean8_t *ptr2, ca_size_t i2)
+{
+  uint64_t *q1 = (uint64_t *) ptr1;
+  uint64_t *p1 = q1;
+  boolean8_t *q2 = (boolean8_t *) ptr2;
+  boolean8_t *p2 = q2;
+  ca_size_t k;
+  (void) p1;   /* expr may not reference *p1 (e.g. constant predicate) */
+  if ( m ) {
+    boolean8_t *pm;
+    for (k=0; k<n; k++) {
+      pm = m + k;
+      if ( ! *pm ) {
+        p1 = q1 + k*i1;
+        p2 = q2 + k*i2;
+        { (*p2) = 1; }
+      }
+    }
+  } else {
+    for (k=0; k<n; k++) {
+      p1 = q1 + k*i1;
+      p2 = q2 + k*i2;
+      { (*p2) = 1; }
+    }
+  }
+}
+
+static void
+ca_moncmp_is_finite_float32_t (ca_size_t n, boolean8_t *m,
+                                  char *ptr1, ca_size_t i1,
+                                  boolean8_t *ptr2, ca_size_t i2)
+{
+  float *q1 = (float *) ptr1;
+  float *p1 = q1;
+  boolean8_t *q2 = (boolean8_t *) ptr2;
+  boolean8_t *p2 = q2;
+  ca_size_t k;
+  (void) p1;   /* expr may not reference *p1 (e.g. constant predicate) */
+  if ( m ) {
+    boolean8_t *pm;
+    for (k=0; k<n; k++) {
+      pm = m + k;
+      if ( ! *pm ) {
+        p1 = q1 + k*i1;
+        p2 = q2 + k*i2;
+        { (*p2) = isfinite(*p1); }
+      }
+    }
+  } else {
+    for (k=0; k<n; k++) {
+      p1 = q1 + k*i1;
+      p2 = q2 + k*i2;
+      { (*p2) = isfinite(*p1); }
+    }
+  }
+}
+
+static void
+ca_moncmp_is_finite_float64_t (ca_size_t n, boolean8_t *m,
+                                  char *ptr1, ca_size_t i1,
+                                  boolean8_t *ptr2, ca_size_t i2)
+{
+  double *q1 = (double *) ptr1;
+  double *p1 = q1;
+  boolean8_t *q2 = (boolean8_t *) ptr2;
+  boolean8_t *p2 = q2;
+  ca_size_t k;
+  (void) p1;   /* expr may not reference *p1 (e.g. constant predicate) */
+  if ( m ) {
+    boolean8_t *pm;
+    for (k=0; k<n; k++) {
+      pm = m + k;
+      if ( ! *pm ) {
+        p1 = q1 + k*i1;
+        p2 = q2 + k*i2;
+        { (*p2) = isfinite(*p1); }
+      }
+    }
+  } else {
+    for (k=0; k<n; k++) {
+      p1 = q1 + k*i1;
+      p2 = q2 + k*i2;
+      { (*p2) = isfinite(*p1); }
+    }
+  }
+}
+
+static void
+ca_moncmp_is_finite_cmplx64_t (ca_size_t n, boolean8_t *m,
+                                  char *ptr1, ca_size_t i1,
+                                  boolean8_t *ptr2, ca_size_t i2)
+{
+  cmplx64_t *q1 = (cmplx64_t *) ptr1;
+  cmplx64_t *p1 = q1;
+  boolean8_t *q2 = (boolean8_t *) ptr2;
+  boolean8_t *p2 = q2;
+  ca_size_t k;
+  (void) p1;   /* expr may not reference *p1 (e.g. constant predicate) */
+  if ( m ) {
+    boolean8_t *pm;
+    for (k=0; k<n; k++) {
+      pm = m + k;
+      if ( ! *pm ) {
+        p1 = q1 + k*i1;
+        p2 = q2 + k*i2;
+        { (*p2) = (isfinite(creal(*p1)) && isfinite(cimag(*p1))); }
+      }
+    }
+  } else {
+    for (k=0; k<n; k++) {
+      p1 = q1 + k*i1;
+      p2 = q2 + k*i2;
+      { (*p2) = (isfinite(creal(*p1)) && isfinite(cimag(*p1))); }
+    }
+  }
+}
+
+static void
+ca_moncmp_is_finite_cmplx128_t (ca_size_t n, boolean8_t *m,
+                                  char *ptr1, ca_size_t i1,
+                                  boolean8_t *ptr2, ca_size_t i2)
+{
+  cmplx128_t *q1 = (cmplx128_t *) ptr1;
+  cmplx128_t *p1 = q1;
+  boolean8_t *q2 = (boolean8_t *) ptr2;
+  boolean8_t *p2 = q2;
+  ca_size_t k;
+  (void) p1;   /* expr may not reference *p1 (e.g. constant predicate) */
+  if ( m ) {
+    boolean8_t *pm;
+    for (k=0; k<n; k++) {
+      pm = m + k;
+      if ( ! *pm ) {
+        p1 = q1 + k*i1;
+        p2 = q2 + k*i2;
+        { (*p2) = (isfinite(creal(*p1)) && isfinite(cimag(*p1))); }
+      }
+    }
+  } else {
+    for (k=0; k<n; k++) {
+      p1 = q1 + k*i1;
+      p2 = q2 + k*i2;
+      { (*p2) = (isfinite(creal(*p1)) && isfinite(cimag(*p1))); }
+    }
+  }
+}
+
+static void
+ca_moncmp_is_finite_VALUE (ca_size_t n, boolean8_t *m,
+                                  char *ptr1, ca_size_t i1,
+                                  boolean8_t *ptr2, ca_size_t i2)
+{
+  VALUE *q1 = (VALUE *) ptr1;
+  VALUE *p1 = q1;
+  boolean8_t *q2 = (boolean8_t *) ptr2;
+  boolean8_t *p2 = q2;
+  ca_size_t k;
+  (void) p1;   /* expr may not reference *p1 (e.g. constant predicate) */
+  if ( m ) {
+    boolean8_t *pm;
+    for (k=0; k<n; k++) {
+      pm = m + k;
+      if ( ! *pm ) {
+        p1 = q1 + k*i1;
+        p2 = q2 + k*i2;
+        { (*p2) = RTEST(rb_funcall((*p1), rb_intern("finite?"), 0)); }
+      }
+    }
+  } else {
+    for (k=0; k<n; k++) {
+      p1 = q1 + k*i1;
+      p2 = q2 + k*i2;
+      { (*p2) = RTEST(rb_funcall((*p1), rb_intern("finite?"), 0)); }
+    }
+  }
+}
+
+ca_moncmp_func_t
+ca_moncmp_is_finite[CA_NTYPE] = {
+  ca_moncmp_not_implement,
+  ca_moncmp_not_implement,
+  ca_moncmp_is_finite_int8_t,
+  ca_moncmp_is_finite_uint8_t,
+  ca_moncmp_is_finite_int16_t,
+  ca_moncmp_is_finite_uint16_t,
+  ca_moncmp_is_finite_int32_t,
+  ca_moncmp_is_finite_uint32_t,
+  ca_moncmp_is_finite_int64_t,
+  ca_moncmp_is_finite_uint64_t,
+  ca_moncmp_is_finite_float32_t,
+  ca_moncmp_is_finite_float64_t,
+  ca_moncmp_not_implement,
+  ca_moncmp_is_finite_cmplx64_t,
+  ca_moncmp_is_finite_cmplx128_t,
+  ca_moncmp_not_implement,
+  ca_moncmp_is_finite_VALUE,
+};
+
+VALUE rb_ca_is_finite (VALUE self)
+{ return rb_ca_call_moncmp(self, ca_moncmp_is_finite); }
+
+/* ===== moncmp is_invalid ============================================ */
+
+static void
+ca_moncmp_is_invalid_boolean8_t (ca_size_t n, boolean8_t *m,
+                                  char *ptr1, ca_size_t i1,
+                                  boolean8_t *ptr2, ca_size_t i2)
+{
+  boolean8_t *q1 = (boolean8_t *) ptr1;
+  boolean8_t *p1 = q1;
+  boolean8_t *q2 = (boolean8_t *) ptr2;
+  boolean8_t *p2 = q2;
+  ca_size_t k;
+  (void) p1;   /* expr may not reference *p1 (e.g. constant predicate) */
+  if ( m ) {
+    boolean8_t *pm;
+    for (k=0; k<n; k++) {
+      pm = m + k;
+      if ( ! *pm ) {
+        p1 = q1 + k*i1;
+        p2 = q2 + k*i2;
+        { (*p2) = 0; }
+      }
+    }
+  } else {
+    for (k=0; k<n; k++) {
+      p1 = q1 + k*i1;
+      p2 = q2 + k*i2;
+      { (*p2) = 0; }
+    }
+  }
+}
+
+static void
+ca_moncmp_is_invalid_int8_t (ca_size_t n, boolean8_t *m,
+                                  char *ptr1, ca_size_t i1,
+                                  boolean8_t *ptr2, ca_size_t i2)
+{
+  int8_t *q1 = (int8_t *) ptr1;
+  int8_t *p1 = q1;
+  boolean8_t *q2 = (boolean8_t *) ptr2;
+  boolean8_t *p2 = q2;
+  ca_size_t k;
+  (void) p1;   /* expr may not reference *p1 (e.g. constant predicate) */
+  if ( m ) {
+    boolean8_t *pm;
+    for (k=0; k<n; k++) {
+      pm = m + k;
+      if ( ! *pm ) {
+        p1 = q1 + k*i1;
+        p2 = q2 + k*i2;
+        { (*p2) = 0; }
+      }
+    }
+  } else {
+    for (k=0; k<n; k++) {
+      p1 = q1 + k*i1;
+      p2 = q2 + k*i2;
+      { (*p2) = 0; }
+    }
+  }
+}
+
+static void
+ca_moncmp_is_invalid_uint8_t (ca_size_t n, boolean8_t *m,
+                                  char *ptr1, ca_size_t i1,
+                                  boolean8_t *ptr2, ca_size_t i2)
+{
+  uint8_t *q1 = (uint8_t *) ptr1;
+  uint8_t *p1 = q1;
+  boolean8_t *q2 = (boolean8_t *) ptr2;
+  boolean8_t *p2 = q2;
+  ca_size_t k;
+  (void) p1;   /* expr may not reference *p1 (e.g. constant predicate) */
+  if ( m ) {
+    boolean8_t *pm;
+    for (k=0; k<n; k++) {
+      pm = m + k;
+      if ( ! *pm ) {
+        p1 = q1 + k*i1;
+        p2 = q2 + k*i2;
+        { (*p2) = 0; }
+      }
+    }
+  } else {
+    for (k=0; k<n; k++) {
+      p1 = q1 + k*i1;
+      p2 = q2 + k*i2;
+      { (*p2) = 0; }
+    }
+  }
+}
+
+static void
+ca_moncmp_is_invalid_int16_t (ca_size_t n, boolean8_t *m,
+                                  char *ptr1, ca_size_t i1,
+                                  boolean8_t *ptr2, ca_size_t i2)
+{
+  int16_t *q1 = (int16_t *) ptr1;
+  int16_t *p1 = q1;
+  boolean8_t *q2 = (boolean8_t *) ptr2;
+  boolean8_t *p2 = q2;
+  ca_size_t k;
+  (void) p1;   /* expr may not reference *p1 (e.g. constant predicate) */
+  if ( m ) {
+    boolean8_t *pm;
+    for (k=0; k<n; k++) {
+      pm = m + k;
+      if ( ! *pm ) {
+        p1 = q1 + k*i1;
+        p2 = q2 + k*i2;
+        { (*p2) = 0; }
+      }
+    }
+  } else {
+    for (k=0; k<n; k++) {
+      p1 = q1 + k*i1;
+      p2 = q2 + k*i2;
+      { (*p2) = 0; }
+    }
+  }
+}
+
+static void
+ca_moncmp_is_invalid_uint16_t (ca_size_t n, boolean8_t *m,
+                                  char *ptr1, ca_size_t i1,
+                                  boolean8_t *ptr2, ca_size_t i2)
+{
+  uint16_t *q1 = (uint16_t *) ptr1;
+  uint16_t *p1 = q1;
+  boolean8_t *q2 = (boolean8_t *) ptr2;
+  boolean8_t *p2 = q2;
+  ca_size_t k;
+  (void) p1;   /* expr may not reference *p1 (e.g. constant predicate) */
+  if ( m ) {
+    boolean8_t *pm;
+    for (k=0; k<n; k++) {
+      pm = m + k;
+      if ( ! *pm ) {
+        p1 = q1 + k*i1;
+        p2 = q2 + k*i2;
+        { (*p2) = 0; }
+      }
+    }
+  } else {
+    for (k=0; k<n; k++) {
+      p1 = q1 + k*i1;
+      p2 = q2 + k*i2;
+      { (*p2) = 0; }
+    }
+  }
+}
+
+static void
+ca_moncmp_is_invalid_int32_t (ca_size_t n, boolean8_t *m,
+                                  char *ptr1, ca_size_t i1,
+                                  boolean8_t *ptr2, ca_size_t i2)
+{
+  int32_t *q1 = (int32_t *) ptr1;
+  int32_t *p1 = q1;
+  boolean8_t *q2 = (boolean8_t *) ptr2;
+  boolean8_t *p2 = q2;
+  ca_size_t k;
+  (void) p1;   /* expr may not reference *p1 (e.g. constant predicate) */
+  if ( m ) {
+    boolean8_t *pm;
+    for (k=0; k<n; k++) {
+      pm = m + k;
+      if ( ! *pm ) {
+        p1 = q1 + k*i1;
+        p2 = q2 + k*i2;
+        { (*p2) = 0; }
+      }
+    }
+  } else {
+    for (k=0; k<n; k++) {
+      p1 = q1 + k*i1;
+      p2 = q2 + k*i2;
+      { (*p2) = 0; }
+    }
+  }
+}
+
+static void
+ca_moncmp_is_invalid_uint32_t (ca_size_t n, boolean8_t *m,
+                                  char *ptr1, ca_size_t i1,
+                                  boolean8_t *ptr2, ca_size_t i2)
+{
+  uint32_t *q1 = (uint32_t *) ptr1;
+  uint32_t *p1 = q1;
+  boolean8_t *q2 = (boolean8_t *) ptr2;
+  boolean8_t *p2 = q2;
+  ca_size_t k;
+  (void) p1;   /* expr may not reference *p1 (e.g. constant predicate) */
+  if ( m ) {
+    boolean8_t *pm;
+    for (k=0; k<n; k++) {
+      pm = m + k;
+      if ( ! *pm ) {
+        p1 = q1 + k*i1;
+        p2 = q2 + k*i2;
+        { (*p2) = 0; }
+      }
+    }
+  } else {
+    for (k=0; k<n; k++) {
+      p1 = q1 + k*i1;
+      p2 = q2 + k*i2;
+      { (*p2) = 0; }
+    }
+  }
+}
+
+static void
+ca_moncmp_is_invalid_int64_t (ca_size_t n, boolean8_t *m,
+                                  char *ptr1, ca_size_t i1,
+                                  boolean8_t *ptr2, ca_size_t i2)
+{
+  int64_t *q1 = (int64_t *) ptr1;
+  int64_t *p1 = q1;
+  boolean8_t *q2 = (boolean8_t *) ptr2;
+  boolean8_t *p2 = q2;
+  ca_size_t k;
+  (void) p1;   /* expr may not reference *p1 (e.g. constant predicate) */
+  if ( m ) {
+    boolean8_t *pm;
+    for (k=0; k<n; k++) {
+      pm = m + k;
+      if ( ! *pm ) {
+        p1 = q1 + k*i1;
+        p2 = q2 + k*i2;
+        { (*p2) = 0; }
+      }
+    }
+  } else {
+    for (k=0; k<n; k++) {
+      p1 = q1 + k*i1;
+      p2 = q2 + k*i2;
+      { (*p2) = 0; }
+    }
+  }
+}
+
+static void
+ca_moncmp_is_invalid_uint64_t (ca_size_t n, boolean8_t *m,
+                                  char *ptr1, ca_size_t i1,
+                                  boolean8_t *ptr2, ca_size_t i2)
+{
+  uint64_t *q1 = (uint64_t *) ptr1;
+  uint64_t *p1 = q1;
+  boolean8_t *q2 = (boolean8_t *) ptr2;
+  boolean8_t *p2 = q2;
+  ca_size_t k;
+  (void) p1;   /* expr may not reference *p1 (e.g. constant predicate) */
+  if ( m ) {
+    boolean8_t *pm;
+    for (k=0; k<n; k++) {
+      pm = m + k;
+      if ( ! *pm ) {
+        p1 = q1 + k*i1;
+        p2 = q2 + k*i2;
+        { (*p2) = 0; }
+      }
+    }
+  } else {
+    for (k=0; k<n; k++) {
+      p1 = q1 + k*i1;
+      p2 = q2 + k*i2;
+      { (*p2) = 0; }
+    }
+  }
+}
+
+static void
+ca_moncmp_is_invalid_float32_t (ca_size_t n, boolean8_t *m,
+                                  char *ptr1, ca_size_t i1,
+                                  boolean8_t *ptr2, ca_size_t i2)
+{
+  float *q1 = (float *) ptr1;
+  float *p1 = q1;
+  boolean8_t *q2 = (boolean8_t *) ptr2;
+  boolean8_t *p2 = q2;
+  ca_size_t k;
+  (void) p1;   /* expr may not reference *p1 (e.g. constant predicate) */
+  if ( m ) {
+    boolean8_t *pm;
+    for (k=0; k<n; k++) {
+      pm = m + k;
+      if ( ! *pm ) {
+        p1 = q1 + k*i1;
+        p2 = q2 + k*i2;
+        { (*p2) = (!isfinite(*p1)); }
+      }
+    }
+  } else {
+    for (k=0; k<n; k++) {
+      p1 = q1 + k*i1;
+      p2 = q2 + k*i2;
+      { (*p2) = (!isfinite(*p1)); }
+    }
+  }
+}
+
+static void
+ca_moncmp_is_invalid_float64_t (ca_size_t n, boolean8_t *m,
+                                  char *ptr1, ca_size_t i1,
+                                  boolean8_t *ptr2, ca_size_t i2)
+{
+  double *q1 = (double *) ptr1;
+  double *p1 = q1;
+  boolean8_t *q2 = (boolean8_t *) ptr2;
+  boolean8_t *p2 = q2;
+  ca_size_t k;
+  (void) p1;   /* expr may not reference *p1 (e.g. constant predicate) */
+  if ( m ) {
+    boolean8_t *pm;
+    for (k=0; k<n; k++) {
+      pm = m + k;
+      if ( ! *pm ) {
+        p1 = q1 + k*i1;
+        p2 = q2 + k*i2;
+        { (*p2) = (!isfinite(*p1)); }
+      }
+    }
+  } else {
+    for (k=0; k<n; k++) {
+      p1 = q1 + k*i1;
+      p2 = q2 + k*i2;
+      { (*p2) = (!isfinite(*p1)); }
+    }
+  }
+}
+
+static void
+ca_moncmp_is_invalid_cmplx64_t (ca_size_t n, boolean8_t *m,
+                                  char *ptr1, ca_size_t i1,
+                                  boolean8_t *ptr2, ca_size_t i2)
+{
+  cmplx64_t *q1 = (cmplx64_t *) ptr1;
+  cmplx64_t *p1 = q1;
+  boolean8_t *q2 = (boolean8_t *) ptr2;
+  boolean8_t *p2 = q2;
+  ca_size_t k;
+  (void) p1;   /* expr may not reference *p1 (e.g. constant predicate) */
+  if ( m ) {
+    boolean8_t *pm;
+    for (k=0; k<n; k++) {
+      pm = m + k;
+      if ( ! *pm ) {
+        p1 = q1 + k*i1;
+        p2 = q2 + k*i2;
+        { (*p2) = (!isfinite(creal(*p1)) || !isfinite(cimag(*p1))); }
+      }
+    }
+  } else {
+    for (k=0; k<n; k++) {
+      p1 = q1 + k*i1;
+      p2 = q2 + k*i2;
+      { (*p2) = (!isfinite(creal(*p1)) || !isfinite(cimag(*p1))); }
+    }
+  }
+}
+
+static void
+ca_moncmp_is_invalid_cmplx128_t (ca_size_t n, boolean8_t *m,
+                                  char *ptr1, ca_size_t i1,
+                                  boolean8_t *ptr2, ca_size_t i2)
+{
+  cmplx128_t *q1 = (cmplx128_t *) ptr1;
+  cmplx128_t *p1 = q1;
+  boolean8_t *q2 = (boolean8_t *) ptr2;
+  boolean8_t *p2 = q2;
+  ca_size_t k;
+  (void) p1;   /* expr may not reference *p1 (e.g. constant predicate) */
+  if ( m ) {
+    boolean8_t *pm;
+    for (k=0; k<n; k++) {
+      pm = m + k;
+      if ( ! *pm ) {
+        p1 = q1 + k*i1;
+        p2 = q2 + k*i2;
+        { (*p2) = (!isfinite(creal(*p1)) || !isfinite(cimag(*p1))); }
+      }
+    }
+  } else {
+    for (k=0; k<n; k++) {
+      p1 = q1 + k*i1;
+      p2 = q2 + k*i2;
+      { (*p2) = (!isfinite(creal(*p1)) || !isfinite(cimag(*p1))); }
+    }
+  }
+}
+
+static void
+ca_moncmp_is_invalid_VALUE (ca_size_t n, boolean8_t *m,
+                                  char *ptr1, ca_size_t i1,
+                                  boolean8_t *ptr2, ca_size_t i2)
+{
+  VALUE *q1 = (VALUE *) ptr1;
+  VALUE *p1 = q1;
+  boolean8_t *q2 = (boolean8_t *) ptr2;
+  boolean8_t *p2 = q2;
+  ca_size_t k;
+  (void) p1;   /* expr may not reference *p1 (e.g. constant predicate) */
+  if ( m ) {
+    boolean8_t *pm;
+    for (k=0; k<n; k++) {
+      pm = m + k;
+      if ( ! *pm ) {
+        p1 = q1 + k*i1;
+        p2 = q2 + k*i2;
+        { (*p2) = (RTEST(rb_funcall((*p1), rb_intern("finite?"), 0)) ? 0 : 1); }
+      }
+    }
+  } else {
+    for (k=0; k<n; k++) {
+      p1 = q1 + k*i1;
+      p2 = q2 + k*i2;
+      { (*p2) = (RTEST(rb_funcall((*p1), rb_intern("finite?"), 0)) ? 0 : 1); }
+    }
+  }
+}
+
+ca_moncmp_func_t
+ca_moncmp_is_invalid[CA_NTYPE] = {
+  ca_moncmp_not_implement,
+  ca_moncmp_is_invalid_boolean8_t,
+  ca_moncmp_is_invalid_int8_t,
+  ca_moncmp_is_invalid_uint8_t,
+  ca_moncmp_is_invalid_int16_t,
+  ca_moncmp_is_invalid_uint16_t,
+  ca_moncmp_is_invalid_int32_t,
+  ca_moncmp_is_invalid_uint32_t,
+  ca_moncmp_is_invalid_int64_t,
+  ca_moncmp_is_invalid_uint64_t,
+  ca_moncmp_is_invalid_float32_t,
+  ca_moncmp_is_invalid_float64_t,
+  ca_moncmp_not_implement,
+  ca_moncmp_is_invalid_cmplx64_t,
+  ca_moncmp_is_invalid_cmplx128_t,
+  ca_moncmp_not_implement,
+  ca_moncmp_is_invalid_VALUE,
+};
+
+VALUE rb_ca_is_invalid (VALUE self)
+{ return rb_ca_call_moncmp(self, ca_moncmp_is_invalid); }
+
+/* ===== moncmp signbit ============================================ */
+
+static void
+ca_moncmp_signbit_int8_t (ca_size_t n, boolean8_t *m,
+                                  char *ptr1, ca_size_t i1,
+                                  boolean8_t *ptr2, ca_size_t i2)
+{
+  int8_t *q1 = (int8_t *) ptr1;
+  int8_t *p1 = q1;
+  boolean8_t *q2 = (boolean8_t *) ptr2;
+  boolean8_t *p2 = q2;
+  ca_size_t k;
+  (void) p1;   /* expr may not reference *p1 (e.g. constant predicate) */
+  if ( m ) {
+    boolean8_t *pm;
+    for (k=0; k<n; k++) {
+      pm = m + k;
+      if ( ! *pm ) {
+        p1 = q1 + k*i1;
+        p2 = q2 + k*i2;
+        { (*p2) = ((*p1) < 0); }
+      }
+    }
+  } else {
+    for (k=0; k<n; k++) {
+      p1 = q1 + k*i1;
+      p2 = q2 + k*i2;
+      { (*p2) = ((*p1) < 0); }
+    }
+  }
+}
+
+static void
+ca_moncmp_signbit_int16_t (ca_size_t n, boolean8_t *m,
+                                  char *ptr1, ca_size_t i1,
+                                  boolean8_t *ptr2, ca_size_t i2)
+{
+  int16_t *q1 = (int16_t *) ptr1;
+  int16_t *p1 = q1;
+  boolean8_t *q2 = (boolean8_t *) ptr2;
+  boolean8_t *p2 = q2;
+  ca_size_t k;
+  (void) p1;   /* expr may not reference *p1 (e.g. constant predicate) */
+  if ( m ) {
+    boolean8_t *pm;
+    for (k=0; k<n; k++) {
+      pm = m + k;
+      if ( ! *pm ) {
+        p1 = q1 + k*i1;
+        p2 = q2 + k*i2;
+        { (*p2) = ((*p1) < 0); }
+      }
+    }
+  } else {
+    for (k=0; k<n; k++) {
+      p1 = q1 + k*i1;
+      p2 = q2 + k*i2;
+      { (*p2) = ((*p1) < 0); }
+    }
+  }
+}
+
+static void
+ca_moncmp_signbit_int32_t (ca_size_t n, boolean8_t *m,
+                                  char *ptr1, ca_size_t i1,
+                                  boolean8_t *ptr2, ca_size_t i2)
+{
+  int32_t *q1 = (int32_t *) ptr1;
+  int32_t *p1 = q1;
+  boolean8_t *q2 = (boolean8_t *) ptr2;
+  boolean8_t *p2 = q2;
+  ca_size_t k;
+  (void) p1;   /* expr may not reference *p1 (e.g. constant predicate) */
+  if ( m ) {
+    boolean8_t *pm;
+    for (k=0; k<n; k++) {
+      pm = m + k;
+      if ( ! *pm ) {
+        p1 = q1 + k*i1;
+        p2 = q2 + k*i2;
+        { (*p2) = ((*p1) < 0); }
+      }
+    }
+  } else {
+    for (k=0; k<n; k++) {
+      p1 = q1 + k*i1;
+      p2 = q2 + k*i2;
+      { (*p2) = ((*p1) < 0); }
+    }
+  }
+}
+
+static void
+ca_moncmp_signbit_int64_t (ca_size_t n, boolean8_t *m,
+                                  char *ptr1, ca_size_t i1,
+                                  boolean8_t *ptr2, ca_size_t i2)
+{
+  int64_t *q1 = (int64_t *) ptr1;
+  int64_t *p1 = q1;
+  boolean8_t *q2 = (boolean8_t *) ptr2;
+  boolean8_t *p2 = q2;
+  ca_size_t k;
+  (void) p1;   /* expr may not reference *p1 (e.g. constant predicate) */
+  if ( m ) {
+    boolean8_t *pm;
+    for (k=0; k<n; k++) {
+      pm = m + k;
+      if ( ! *pm ) {
+        p1 = q1 + k*i1;
+        p2 = q2 + k*i2;
+        { (*p2) = ((*p1) < 0); }
+      }
+    }
+  } else {
+    for (k=0; k<n; k++) {
+      p1 = q1 + k*i1;
+      p2 = q2 + k*i2;
+      { (*p2) = ((*p1) < 0); }
+    }
+  }
+}
+
+static void
+ca_moncmp_signbit_uint8_t (ca_size_t n, boolean8_t *m,
+                                  char *ptr1, ca_size_t i1,
+                                  boolean8_t *ptr2, ca_size_t i2)
+{
+  uint8_t *q1 = (uint8_t *) ptr1;
+  uint8_t *p1 = q1;
+  boolean8_t *q2 = (boolean8_t *) ptr2;
+  boolean8_t *p2 = q2;
+  ca_size_t k;
+  (void) p1;   /* expr may not reference *p1 (e.g. constant predicate) */
+  if ( m ) {
+    boolean8_t *pm;
+    for (k=0; k<n; k++) {
+      pm = m + k;
+      if ( ! *pm ) {
+        p1 = q1 + k*i1;
+        p2 = q2 + k*i2;
+        { (*p2) = 0; }
+      }
+    }
+  } else {
+    for (k=0; k<n; k++) {
+      p1 = q1 + k*i1;
+      p2 = q2 + k*i2;
+      { (*p2) = 0; }
+    }
+  }
+}
+
+static void
+ca_moncmp_signbit_uint16_t (ca_size_t n, boolean8_t *m,
+                                  char *ptr1, ca_size_t i1,
+                                  boolean8_t *ptr2, ca_size_t i2)
+{
+  uint16_t *q1 = (uint16_t *) ptr1;
+  uint16_t *p1 = q1;
+  boolean8_t *q2 = (boolean8_t *) ptr2;
+  boolean8_t *p2 = q2;
+  ca_size_t k;
+  (void) p1;   /* expr may not reference *p1 (e.g. constant predicate) */
+  if ( m ) {
+    boolean8_t *pm;
+    for (k=0; k<n; k++) {
+      pm = m + k;
+      if ( ! *pm ) {
+        p1 = q1 + k*i1;
+        p2 = q2 + k*i2;
+        { (*p2) = 0; }
+      }
+    }
+  } else {
+    for (k=0; k<n; k++) {
+      p1 = q1 + k*i1;
+      p2 = q2 + k*i2;
+      { (*p2) = 0; }
+    }
+  }
+}
+
+static void
+ca_moncmp_signbit_uint32_t (ca_size_t n, boolean8_t *m,
+                                  char *ptr1, ca_size_t i1,
+                                  boolean8_t *ptr2, ca_size_t i2)
+{
+  uint32_t *q1 = (uint32_t *) ptr1;
+  uint32_t *p1 = q1;
+  boolean8_t *q2 = (boolean8_t *) ptr2;
+  boolean8_t *p2 = q2;
+  ca_size_t k;
+  (void) p1;   /* expr may not reference *p1 (e.g. constant predicate) */
+  if ( m ) {
+    boolean8_t *pm;
+    for (k=0; k<n; k++) {
+      pm = m + k;
+      if ( ! *pm ) {
+        p1 = q1 + k*i1;
+        p2 = q2 + k*i2;
+        { (*p2) = 0; }
+      }
+    }
+  } else {
+    for (k=0; k<n; k++) {
+      p1 = q1 + k*i1;
+      p2 = q2 + k*i2;
+      { (*p2) = 0; }
+    }
+  }
+}
+
+static void
+ca_moncmp_signbit_uint64_t (ca_size_t n, boolean8_t *m,
+                                  char *ptr1, ca_size_t i1,
+                                  boolean8_t *ptr2, ca_size_t i2)
+{
+  uint64_t *q1 = (uint64_t *) ptr1;
+  uint64_t *p1 = q1;
+  boolean8_t *q2 = (boolean8_t *) ptr2;
+  boolean8_t *p2 = q2;
+  ca_size_t k;
+  (void) p1;   /* expr may not reference *p1 (e.g. constant predicate) */
+  if ( m ) {
+    boolean8_t *pm;
+    for (k=0; k<n; k++) {
+      pm = m + k;
+      if ( ! *pm ) {
+        p1 = q1 + k*i1;
+        p2 = q2 + k*i2;
+        { (*p2) = 0; }
+      }
+    }
+  } else {
+    for (k=0; k<n; k++) {
+      p1 = q1 + k*i1;
+      p2 = q2 + k*i2;
+      { (*p2) = 0; }
+    }
+  }
+}
+
+static void
+ca_moncmp_signbit_float32_t (ca_size_t n, boolean8_t *m,
+                                  char *ptr1, ca_size_t i1,
+                                  boolean8_t *ptr2, ca_size_t i2)
+{
+  float *q1 = (float *) ptr1;
+  float *p1 = q1;
+  boolean8_t *q2 = (boolean8_t *) ptr2;
+  boolean8_t *p2 = q2;
+  ca_size_t k;
+  (void) p1;   /* expr may not reference *p1 (e.g. constant predicate) */
+  if ( m ) {
+    boolean8_t *pm;
+    for (k=0; k<n; k++) {
+      pm = m + k;
+      if ( ! *pm ) {
+        p1 = q1 + k*i1;
+        p2 = q2 + k*i2;
+        { (*p2) = signbit(*p1); }
+      }
+    }
+  } else {
+    for (k=0; k<n; k++) {
+      p1 = q1 + k*i1;
+      p2 = q2 + k*i2;
+      { (*p2) = signbit(*p1); }
+    }
+  }
+}
+
+static void
+ca_moncmp_signbit_float64_t (ca_size_t n, boolean8_t *m,
+                                  char *ptr1, ca_size_t i1,
+                                  boolean8_t *ptr2, ca_size_t i2)
+{
+  double *q1 = (double *) ptr1;
+  double *p1 = q1;
+  boolean8_t *q2 = (boolean8_t *) ptr2;
+  boolean8_t *p2 = q2;
+  ca_size_t k;
+  (void) p1;   /* expr may not reference *p1 (e.g. constant predicate) */
+  if ( m ) {
+    boolean8_t *pm;
+    for (k=0; k<n; k++) {
+      pm = m + k;
+      if ( ! *pm ) {
+        p1 = q1 + k*i1;
+        p2 = q2 + k*i2;
+        { (*p2) = signbit(*p1); }
+      }
+    }
+  } else {
+    for (k=0; k<n; k++) {
+      p1 = q1 + k*i1;
+      p2 = q2 + k*i2;
+      { (*p2) = signbit(*p1); }
+    }
+  }
+}
+
+static void
+ca_moncmp_signbit_VALUE (ca_size_t n, boolean8_t *m,
+                                  char *ptr1, ca_size_t i1,
+                                  boolean8_t *ptr2, ca_size_t i2)
+{
+  VALUE *q1 = (VALUE *) ptr1;
+  VALUE *p1 = q1;
+  boolean8_t *q2 = (boolean8_t *) ptr2;
+  boolean8_t *p2 = q2;
+  ca_size_t k;
+  (void) p1;   /* expr may not reference *p1 (e.g. constant predicate) */
+  if ( m ) {
+    boolean8_t *pm;
+    for (k=0; k<n; k++) {
+      pm = m + k;
+      if ( ! *pm ) {
+        p1 = q1 + k*i1;
+        p2 = q2 + k*i2;
+        { (*p2) = RB_FLOAT_TYPE_P(*p1) ? (signbit(RFLOAT_VALUE(*p1)) != 0) : (RTEST(rb_funcall((*p1), rb_intern("negative?"), 0)) ? 1 : 0); }
+      }
+    }
+  } else {
+    for (k=0; k<n; k++) {
+      p1 = q1 + k*i1;
+      p2 = q2 + k*i2;
+      { (*p2) = RB_FLOAT_TYPE_P(*p1) ? (signbit(RFLOAT_VALUE(*p1)) != 0) : (RTEST(rb_funcall((*p1), rb_intern("negative?"), 0)) ? 1 : 0); }
+    }
+  }
+}
+
+ca_moncmp_func_t
+ca_moncmp_signbit[CA_NTYPE] = {
+  ca_moncmp_not_implement,
+  ca_moncmp_not_implement,
+  ca_moncmp_signbit_int8_t,
+  ca_moncmp_signbit_uint8_t,
+  ca_moncmp_signbit_int16_t,
+  ca_moncmp_signbit_uint16_t,
+  ca_moncmp_signbit_int32_t,
+  ca_moncmp_signbit_uint32_t,
+  ca_moncmp_signbit_int64_t,
+  ca_moncmp_signbit_uint64_t,
+  ca_moncmp_signbit_float32_t,
+  ca_moncmp_signbit_float64_t,
+  ca_moncmp_not_implement,
+  ca_moncmp_not_implement,
+  ca_moncmp_not_implement,
+  ca_moncmp_not_implement,
+  ca_moncmp_signbit_VALUE,
+};
+
+VALUE rb_ca_signbit (VALUE self)
+{ return rb_ca_call_moncmp(self, ca_moncmp_signbit); }
+
+void
+Init_carray_kernels_moncmp (void)
+{
+  rb_define_method(rb_cCArray, "is_nan", rb_ca_is_nan, 0);
+  rb_define_method(rb_cCArray, "is_inf", rb_ca_is_inf, 0);
+  rb_define_method(rb_cCArray, "is_finite", rb_ca_is_finite, 0);
+  rb_define_method(rb_cCArray, "is_invalid", rb_ca_is_invalid, 0);
+  rb_define_method(rb_cCArray, "signbit", rb_ca_signbit, 0);
+}