KNF

SCCS-vsn: lib/libc/db/btree/bt_utils.c 5.11

diff --git a/usr/src/lib/libc/db/btree/bt_utils.c b/usr/src/lib/libc/db/btree/bt_utils.c
index 2f715ae..a2fcdbe 100644 (file)
--- a/usr/src/lib/libc/db/btree/bt_utils.c
+++ b/usr/src/lib/libc/db/btree/bt_utils.c
@@ -9,7 +9,7 @@
  */
 
 #if defined(LIBC_SCCS) && !defined(lint)
  */
 
 #if defined(LIBC_SCCS) && !defined(lint)

-static char sccsid[] = "@(#)bt_utils.c 5.10 (Berkeley) %G%";
+static char sccsid[] = "@(#)bt_utils.c 5.11 (Berkeley) %G%";

 #endif /* LIBC_SCCS and not lint */
 
 #include <sys/param.h>
 #endif /* LIBC_SCCS and not lint */
 
 #include <sys/param.h>


@@ -143,7 +143,7 @@ __bt_cmp(t, k1, e)
                        return (RET_ERROR);
                k2.data = t->bt_dbuf;
        }
                        return (RET_ERROR);
                k2.data = t->bt_dbuf;
        }

-       return((*t->bt_cmp)(k1, &k2));
+       return ((*t->bt_cmp)(k1, &k2));

 }
 
 /*
 }
 
 /*


@@ -168,8 +168,8 @@ __bt_defcmp(a, b)
        len = MIN(a->size, b->size);
        for (p1 = a->data, p2 = b->data; len--; ++p1, ++p2)
                if (diff = *p1 - *p2)
        len = MIN(a->size, b->size);
        for (p1 = a->data, p2 = b->data; len--; ++p1, ++p2)
                if (diff = *p1 - *p2)

-                       return(diff);
-       return(a->size - b->size);
+                       return (diff);
+       return (a->size - b->size);

 }
 
 /*
 }
 
 /*


@@ -194,7 +194,7 @@ __bt_defpfx(a, b)
        len = MIN(a->size, b->size);
        for (p1 = a->data, p2 = b->data; len--; ++p1, ++p2, ++cnt)
                if (*p1 != *p2)
        len = MIN(a->size, b->size);
        for (p1 = a->data, p2 = b->data; len--; ++p1, ++p2, ++cnt)
                if (*p1 != *p2)

-                       return(cnt);
+                       return (cnt);

 
        /* a->size must be <= b->size, or they wouldn't be in this order. */
        return (a->size < b->size ? a->size + 1 : a->size);
 
        /* a->size must be <= b->size, or they wouldn't be in this order. */
        return (a->size < b->size ? a->size + 1 : a->size);