const __u32 *weight, int weight_max,
                               int x, int numrep, int type,
                               int *out, int outpos,
-                              unsigned int attempts,
-                              unsigned int recurse_attempts,
+                              unsigned int tries,
+                              unsigned int recurse_tries,
                               unsigned int local_tries,
                               unsigned int local_fallback_tries,
                               int recurse_to_leaf,
                                                         weight, weight_max,
                                                         x, outpos+1, 0,
                                                         out2, outpos,
-                                                        recurse_attempts, 0,
+                                                        recurse_tries, 0,
                                                         local_tries,
                                                         local_fallback_tries,
                                                         0,
                                                 flocal <= in->size + local_fallback_tries)
                                                /* exhaustive bucket search */
                                                retry_bucket = 1;
-                                       else if (ftotal <= attempts)
+                                       else if (ftotal <= tries)
                                                /* then retry descent */
                                                retry_descent = 1;
                                        else
                               const __u32 *weight, int weight_max,
                               int x, int left, int numrep, int type,
                               int *out, int outpos,
-                              unsigned int attempts,
-                              unsigned int recurse_attempts,
+                              unsigned int tries,
+                              unsigned int recurse_tries,
                               int recurse_to_leaf,
                               int *out2,
                               int parent_r)
                        out2[rep] = CRUSH_ITEM_UNDEF;
        }
 
-       for (ftotal = 0; left > 0 && ftotal < attempts; ftotal++) {
+       for (ftotal = 0; left > 0 && ftotal < tries; ftotal++) {
                for (rep = outpos; rep < endpos; rep++) {
                        if (out[rep] != CRUSH_ITEM_UNDEF)
                                continue;
                                                   weight, weight_max,
                                                   x, 1, numrep, 0,
                                                   out2, rep,
-                                                  recurse_attempts, 0,
+                                                  recurse_tries, 0,
                                                   0, NULL, r);
                                                if (out2[rep] == CRUSH_ITEM_NONE) {
                                                        /* placed nothing; no leaf */