Run clang-format over the kron changes

Co-Authored-By: Claude Fable 5 <noreply@anthropic.com>

Author: Transurgeon

include/subexpr.h

@@ -185,10 +185,13 @@ typedef struct convolve_expr
 typedef struct kron_expr
 {
     expr base;
-    expr *param_source; /* the constant/parameter operand node (re-evaluated each solve) */
+    expr *param_source; /* the constant/parameter operand node (re-evaluated each
+                           solve) */
     int p, q, r, s;     /* A is p x q, B is r x s */
-    int *child_row;     /* size_out: child entry each output row gathers; -1 if inactive */
-    int *coeff_idx;     /* size_out: index into param_source->value (valid where child_row >= 0) */
+    int *child_row; /* size_out: child entry each output row gathers; -1 if inactive
+                     */
+    int *coeff_idx; /* size_out: index into param_source->value (valid where
+                       child_row >= 0) */
 } kron_expr;
 
 /* Bivariate matrix multiplication: Z = f(u) @ g(u) where both children

src/atoms/affine/kron.c

@@ -91,8 +91,7 @@ static void jacobian_init_impl(expr *node)
     for (int out = 0; out < node->size; out++)
     {
         int cr = knode->child_row[out];
-        if (cr >= 0)
-            total += Jc->p[cr + 1] - Jc->p[cr];
+        if (cr >= 0) total += Jc->p[cr + 1] - Jc->p[cr];
     }
 
     CSR_matrix *Jk = new_CSR_matrix(node->size, node->n_vars, total);
@@ -130,8 +129,7 @@ static void eval_jacobian(expr *node)
     for (int out = 0; out < node->size; out++)
     {
         int cr = knode->child_row[out];
-        if (cr < 0)
-            continue;
+        if (cr < 0) continue;
         double scale = a[knode->coeff_idx[out]];
         for (int t = Jc->p[cr]; t < Jc->p[cr + 1]; t++)
         {
@@ -164,8 +162,7 @@ static void eval_wsum_hess(expr *node, const double *w)
     for (int out = 0; out < node->size; out++)
     {
         int cr = knode->child_row[out];
-        if (cr >= 0)
-            w_prime[cr] += a[knode->coeff_idx[out]] * w[out];
+        if (cr >= 0) w_prime[cr] += a[knode->coeff_idx[out]] * w[out];
     }
 
     child->eval_wsum_hess(child, w_prime);
@@ -192,8 +189,8 @@ static void free_type_data(expr *node)
 
 /* Allocate a kron node and its (all-inactive) index arrays. The left/right
    constructors then fill the active rows. */
-static kron_expr *new_kron_common(expr *param_node, expr *child, int p, int q,
-                                  int r, int s)
+static kron_expr *new_kron_common(expr *param_node, expr *child, int p, int q, int r,
+                                  int s)
 {
     int size_out = (p * r) * (q * s);
 

tests/forward_pass/affine/test_kron.h

@@ -95,8 +95,7 @@ const char *test_kron_forward_sparse(void)
     double expected[36] = {0};
     int pos[12] = {0, 1, 6, 7, 14, 15, 20, 21, 28, 29, 34, 35};
     double vals[12] = {1, 3, 2, 4, 1, 3, 2, 4, 1, 3, 2, 4};
-    for (int t = 0; t < 12; t++)
-        expected[pos[t]] = vals[t];
+    for (int t = 0; t < 12; t++) expected[pos[t]] = vals[t];
 
     mu_assert("kron sparse d1=6", Z->d1 == 6);
     mu_assert("kron sparse d2=6", Z->d2 == 6);