[fusl] clang-format fusl

fusl/src/math/__polevll.c

 /* origin: OpenBSD /usr/src/lib/libm/src/polevll.c */
 /*
  * Copyright (c) 2008 Stephen L. Moshier <steve@moshier.net>
  *
  * Permission to use, copy, modify, and distribute this software for any
  * purpose with or without fee is hereby granted, provided that the above
  * copyright notice and this permission notice appear in all copies.
  *
  * THE SOFTWARE IS PROVIDED "AS IS" AND THE AUTHOR DISCLAIMS ALL WARRANTIES
  * WITH REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED WARRANTIES OF
@@ skipping 44 matching lines @@
  */
 
 #include "libm.h"
 
 #if LDBL_MANT_DIG == 53 && LDBL_MAX_EXP == 1024
 #else
 /*
  * Polynomial evaluator:
  *  P[0] x^n  +  P[1] x^(n-1)  +  ...  +  P[n]
  */
-long double __polevll(long double x, const long double *P, int n)
-{
-        long double y;
+long double __polevll(long double x, const long double* P, int n) {
+  long double y;
 
-        y = *P++;
-        do {
-                y = y * x + *P++;
-        } while (--n);
+  y = *P++;
+  do {
+    y = y * x + *P++;
+  } while (--n);
 
-        return y;
+  return y;
 }
 
 /*
  * Polynomial evaluator:
  *  x^n  +  P[0] x^(n-1)  +  P[1] x^(n-2)  +  ...  +  P[n]
  */
-long double __p1evll(long double x, const long double *P, int n)
-{
-        long double y;
+long double __p1evll(long double x, const long double* P, int n) {
+  long double y;
 
-        n -= 1;
-        y = x + *P++;
-        do {
-                y = y * x + *P++;
-        } while (--n);
+  n -= 1;
+  y = x + *P++;
+  do {
+    y = y * x + *P++;
+  } while (--n);
 
-        return y;
+  return y;
 }
 #endif