1 files changed, 49 insertions, 0 deletions
diff --git a/math/aarch64/experimental/sve/powif.c b/math/aarch64/experimental/sve/powif.c
new file mode 100644
index 000000000000..fd74acf12df7
--- /dev/null
+++ b/math/aarch64/experimental/sve/powif.c
@@ -0,0 +1,49 @@
+/*
+ * Single-precision SVE powi(x, n) function.
+ *
+ * Copyright (c) 2020-2024, Arm Limited.
+ * SPDX-License-Identifier: MIT OR Apache-2.0 WITH LLVM-exception
+ */
+
+#include "sv_math.h"
+
+/* Optimized single-precision vector powi (float base, integer power).
+   powi is developed for environments in which accuracy is of much less
+   importance than performance, hence we provide no estimate for worst-case
+   error.  */
+svfloat32_t
+_ZGVsMxvv_powi (svfloat32_t as, svint32_t ns, svbool_t p)
+{
+  /* Compute powi by successive squaring, right to left.  */
+  svfloat32_t acc = sv_f32 (1.f);
+  svbool_t want_recip = svcmplt (p, ns, 0);
+  svuint32_t ns_abs = svreinterpret_u32 (svabs_x (p, ns));
+
+  /* We use a max to avoid needing to check whether any lane != 0 on each
+     iteration.  */
+  uint32_t max_n = svmaxv (p, ns_abs);
+
+  svfloat32_t c = as;
+  /* Successively square c, and use merging predication (_m) to determine
+     whether or not to perform the multiplication or keep the previous
+     iteration.  */
+  while (true)
+    {
+      svbool_t px = svcmpeq (p, svand_x (p, ns_abs, 1), 1);
+      acc = svmul_m (px, acc, c);
+      max_n >>= 1;
+      if (max_n == 0)
+	break;
+
+      ns_abs = svlsr_x (p, ns_abs, 1);
+      c = svmul_x (p, c, c);
+    }
+
+  /* Negative powers are handled by computing the abs(n) version and then
+     taking the reciprocal.  */
+  if (svptest_any (want_recip, want_recip))
+    acc = svdivr_m (want_recip, acc, 1.0f);
+
+  return acc;
+}
+CLOSE_SVE_ATTR