- result = IAM_LOOKUP_OK;
- c = iam_leaf_container(l);
-
- p = l->il_entries;
- q = iam_lfix_shift(l, p, count - 1);
- if (lfix_keycmp(c, k, iam_leaf_key_at(p)) < 0) {
- /*
- * @k is less than the least key in the leaf
- */
- l->il_at = p;
- result = IAM_LOOKUP_BEFORE;
- } else if (lfix_keycmp(c, iam_leaf_key_at(q), k) <= 0) {
- l->il_at = q;
- } else {
- /*
- * EWD1293
- */
- while (iam_lfix_shift(l, p, 1) != q) {
- m = iam_lfix_shift(l, p, iam_lfix_diff(l, q, p) / 2);
- assert_corr(p < m && m < q);
- if (lfix_keycmp(c, iam_leaf_key_at(m), k) <= 0)
- p = m;
- else
- q = m;
- }
- assert_corr(lfix_keycmp(c, iam_leaf_key_at(p), k) <= 0 &&
- lfix_keycmp(c, k, iam_leaf_key_at(q)) < 0);
- /*
- * skip over records with duplicate keys.
- */
- while (p > l->il_entries) {
- t = iam_lfix_shift(l, p, -1);
- if (lfix_keycmp(c, iam_leaf_key_at(t), k) == 0)
- p = t;
- else
- break;
- }
- l->il_at = p;
- }
- assert_corr(iam_leaf_at_rec(l));
-
- if (lfix_keycmp(c, iam_leaf_key_at(l->il_at), k) == 0)
+ result = IAM_LOOKUP_OK;
+ c = iam_leaf_container(l);
+
+ p = l->il_entries;
+ q = iam_lfix_shift(l, p, count - 1);
+ if (lfix_keycmp(c, k, iam_leaf_key_at(p)) < 0) {
+ /*
+ * @k is less than the least key in the leaf
+ */
+ l->il_at = p;
+ result = IAM_LOOKUP_BEFORE;
+ } else if (lfix_keycmp(c, iam_leaf_key_at(q), k) <= 0) {
+ l->il_at = q;
+ } else {
+ /*
+ * EWD1293
+ */
+ while (iam_lfix_shift(l, p, 1) != q) {
+ m = iam_lfix_shift(l, p, iam_lfix_diff(l, q, p) / 2);
+ assert_corr(p < m && m < q);
+ if (lfix_keycmp(c, iam_leaf_key_at(m), k) <= 0)
+ p = m;
+ else
+ q = m;
+ }
+ assert_corr(lfix_keycmp(c, iam_leaf_key_at(p), k) <= 0 &&
+ lfix_keycmp(c, k, iam_leaf_key_at(q)) < 0);
+ /*
+ * skip over records with duplicate keys.
+ */
+ while (p > l->il_entries) {
+ t = iam_lfix_shift(l, p, -1);
+ if (lfix_keycmp(c, iam_leaf_key_at(t), k) == 0)
+ p = t;
+ else
+ break;
+ }
+ l->il_at = p;
+ }
+ assert_corr(iam_leaf_at_rec(l));
+
+ if (lfix_keycmp(c, iam_leaf_key_at(l->il_at), k) == 0)