ref: e387915a8f408ad8d40ea93f6a72a7a782e58899
parent: d094b7faa1151c60d829a3988bae819f76be75d3
author: BurnZeZ <[email protected]>
date: Sat Mar 19 13:35:36 EDT 2016
libc: trailing whitespace cleanup
--- a/sys/src/libc/386/vlrt.c
+++ b/sys/src/libc/386/vlrt.c
@@ -728,7 +728,7 @@
int
_ltv(Vlong lv, Vlong rv)
{
- return (long)lv.hi < (long)rv.hi ||
+ return (long)lv.hi < (long)rv.hi ||
(lv.hi == rv.hi && lv.lo < rv.lo);
}
@@ -735,7 +735,7 @@
int
_lev(Vlong lv, Vlong rv)
{
- return (long)lv.hi < (long)rv.hi ||
+ return (long)lv.hi < (long)rv.hi ||
(lv.hi == rv.hi && lv.lo <= rv.lo);
}
@@ -742,7 +742,7 @@
int
_gtv(Vlong lv, Vlong rv)
{
- return (long)lv.hi > (long)rv.hi ||
+ return (long)lv.hi > (long)rv.hi ||
(lv.hi == rv.hi && lv.lo > rv.lo);
}
@@ -749,7 +749,7 @@
int
_gev(Vlong lv, Vlong rv)
{
- return (long)lv.hi > (long)rv.hi ||
+ return (long)lv.hi > (long)rv.hi ||
(lv.hi == rv.hi && lv.lo >= rv.lo);
}
@@ -756,7 +756,7 @@
int
_lov(Vlong lv, Vlong rv)
{
- return lv.hi < rv.hi ||
+ return lv.hi < rv.hi ||
(lv.hi == rv.hi && lv.lo < rv.lo);
}
@@ -763,7 +763,7 @@
int
_lsv(Vlong lv, Vlong rv)
{
- return lv.hi < rv.hi ||
+ return lv.hi < rv.hi ||
(lv.hi == rv.hi && lv.lo <= rv.lo);
}
@@ -770,7 +770,7 @@
int
_hiv(Vlong lv, Vlong rv)
{
- return lv.hi > rv.hi ||
+ return lv.hi > rv.hi ||
(lv.hi == rv.hi && lv.lo > rv.lo);
}
@@ -777,6 +777,6 @@
int
_hsv(Vlong lv, Vlong rv)
{
- return lv.hi > rv.hi ||
+ return lv.hi > rv.hi ||
(lv.hi == rv.hi && lv.lo >= rv.lo);
}
--- a/sys/src/libc/68000/vlrt.c
+++ b/sys/src/libc/68000/vlrt.c
@@ -676,7 +676,7 @@
int
_ltv(Vlong lv, Vlong rv)
{
- return (long)lv.hi < (long)rv.hi ||
+ return (long)lv.hi < (long)rv.hi ||
(lv.hi == rv.hi && lv.lo < rv.lo);
}
@@ -683,7 +683,7 @@
int
_lev(Vlong lv, Vlong rv)
{
- return (long)lv.hi < (long)rv.hi ||
+ return (long)lv.hi < (long)rv.hi ||
(lv.hi == rv.hi && lv.lo <= rv.lo);
}
@@ -690,7 +690,7 @@
int
_gtv(Vlong lv, Vlong rv)
{
- return (long)lv.hi > (long)rv.hi ||
+ return (long)lv.hi > (long)rv.hi ||
(lv.hi == rv.hi && lv.lo > rv.lo);
}
@@ -697,7 +697,7 @@
int
_gev(Vlong lv, Vlong rv)
{
- return (long)lv.hi > (long)rv.hi ||
+ return (long)lv.hi > (long)rv.hi ||
(lv.hi == rv.hi && lv.lo >= rv.lo);
}
@@ -704,7 +704,7 @@
int
_lov(Vlong lv, Vlong rv)
{
- return lv.hi < rv.hi ||
+ return lv.hi < rv.hi ||
(lv.hi == rv.hi && lv.lo < rv.lo);
}
@@ -711,7 +711,7 @@
int
_lsv(Vlong lv, Vlong rv)
{
- return lv.hi < rv.hi ||
+ return lv.hi < rv.hi ||
(lv.hi == rv.hi && lv.lo <= rv.lo);
}
@@ -718,7 +718,7 @@
int
_hiv(Vlong lv, Vlong rv)
{
- return lv.hi > rv.hi ||
+ return lv.hi > rv.hi ||
(lv.hi == rv.hi && lv.lo > rv.lo);
}
@@ -725,7 +725,7 @@
int
_hsv(Vlong lv, Vlong rv)
{
- return lv.hi > rv.hi ||
+ return lv.hi > rv.hi ||
(lv.hi == rv.hi && lv.lo >= rv.lo);
}
--- a/sys/src/libc/68020/vlrt.c
+++ b/sys/src/libc/68020/vlrt.c
@@ -676,7 +676,7 @@
int
_ltv(Vlong lv, Vlong rv)
{
- return (long)lv.hi < (long)rv.hi ||
+ return (long)lv.hi < (long)rv.hi ||
(lv.hi == rv.hi && lv.lo < rv.lo);
}
@@ -683,7 +683,7 @@
int
_lev(Vlong lv, Vlong rv)
{
- return (long)lv.hi < (long)rv.hi ||
+ return (long)lv.hi < (long)rv.hi ||
(lv.hi == rv.hi && lv.lo <= rv.lo);
}
@@ -690,7 +690,7 @@
int
_gtv(Vlong lv, Vlong rv)
{
- return (long)lv.hi > (long)rv.hi ||
+ return (long)lv.hi > (long)rv.hi ||
(lv.hi == rv.hi && lv.lo > rv.lo);
}
@@ -697,7 +697,7 @@
int
_gev(Vlong lv, Vlong rv)
{
- return (long)lv.hi > (long)rv.hi ||
+ return (long)lv.hi > (long)rv.hi ||
(lv.hi == rv.hi && lv.lo >= rv.lo);
}
@@ -704,7 +704,7 @@
int
_lov(Vlong lv, Vlong rv)
{
- return lv.hi < rv.hi ||
+ return lv.hi < rv.hi ||
(lv.hi == rv.hi && lv.lo < rv.lo);
}
@@ -711,7 +711,7 @@
int
_lsv(Vlong lv, Vlong rv)
{
- return lv.hi < rv.hi ||
+ return lv.hi < rv.hi ||
(lv.hi == rv.hi && lv.lo <= rv.lo);
}
@@ -718,7 +718,7 @@
int
_hiv(Vlong lv, Vlong rv)
{
- return lv.hi > rv.hi ||
+ return lv.hi > rv.hi ||
(lv.hi == rv.hi && lv.lo > rv.lo);
}
@@ -725,6 +725,6 @@
int
_hsv(Vlong lv, Vlong rv)
{
- return lv.hi > rv.hi ||
+ return lv.hi > rv.hi ||
(lv.hi == rv.hi && lv.lo >= rv.lo);
}
--- a/sys/src/libc/9sys/announce.c
+++ b/sys/src/libc/9sys/announce.c
@@ -266,7 +266,7 @@
p = strchr(buf+1, '/');
if(p == nil)
p = buf;
- else
+ else
p++;
}
snprint(file, nf, "%s/%s", netdir, p);
--- a/sys/src/libc/9sys/convM2D.c
+++ b/sys/src/libc/9sys/convM2D.c
@@ -37,7 +37,7 @@
int i, ns;
if(nbuf < STATFIXLEN)
- return 0;
+ return 0;
p = buf;
ebuf = buf + nbuf;
@@ -89,6 +89,6 @@
d->gid = nullstring;
d->muid = nullstring;
}
-
+
return p - buf;
}
--- a/sys/src/libc/9sys/dial.c
+++ b/sys/src/libc/9sys/dial.c
@@ -134,7 +134,7 @@
p = strchr(clone+1, '/');
if(p == nil)
p = clone;
- else
+ else
p++;
} else
p = clone;
--- a/sys/src/libc/9sys/qlock.c
+++ b/sys/src/libc/9sys/qlock.c
@@ -325,7 +325,7 @@
* take off wait and put on front of queue
* put on front so guys that have been waiting will not get starved
*/
-
+
if(!r->l)
abort();
lock(&r->l->lock);
--- a/sys/src/libc/alpha/memmove.s
+++ b/sys/src/libc/alpha/memmove.s
@@ -27,7 +27,7 @@
MOVB R2, (R6)
ADDL $-1, R7, R7
JMP _balign
-
+
_baligned:
AND $(QUAD-1), R7, R1 /* is the source quad-aligned */
BNE R1, _bunaligned
--- a/sys/src/libc/arm/memmove.s
+++ b/sys/src/libc/arm/memmove.s
@@ -85,9 +85,9 @@
CMP R(TMP), R(TS)
BHS _f4tail
- MOVM.IA.W (R(FROM)), [R4-R7]
+ MOVM.IA.W (R(FROM)), [R4-R7]
MOVM.IA.W [R4-R7], (R(TS))
- MOVM.IA.W (R(FROM)), [R4-R7]
+ MOVM.IA.W (R(FROM)), [R4-R7]
MOVM.IA.W [R4-R7], (R(TS))
B _f32loop
--- a/sys/src/libc/arm/vlrt.c
+++ b/sys/src/libc/arm/vlrt.c
@@ -694,7 +694,7 @@
int
_ltv(Vlong lv, Vlong rv)
{
- return (long)lv.hi < (long)rv.hi ||
+ return (long)lv.hi < (long)rv.hi ||
(lv.hi == rv.hi && lv.lo < rv.lo);
}
@@ -701,7 +701,7 @@
int
_lev(Vlong lv, Vlong rv)
{
- return (long)lv.hi < (long)rv.hi ||
+ return (long)lv.hi < (long)rv.hi ||
(lv.hi == rv.hi && lv.lo <= rv.lo);
}
@@ -708,7 +708,7 @@
int
_gtv(Vlong lv, Vlong rv)
{
- return (long)lv.hi > (long)rv.hi ||
+ return (long)lv.hi > (long)rv.hi ||
(lv.hi == rv.hi && lv.lo > rv.lo);
}
@@ -715,7 +715,7 @@
int
_gev(Vlong lv, Vlong rv)
{
- return (long)lv.hi > (long)rv.hi ||
+ return (long)lv.hi > (long)rv.hi ||
(lv.hi == rv.hi && lv.lo >= rv.lo);
}
@@ -722,7 +722,7 @@
int
_lov(Vlong lv, Vlong rv)
{
- return lv.hi < rv.hi ||
+ return lv.hi < rv.hi ||
(lv.hi == rv.hi && lv.lo < rv.lo);
}
@@ -729,7 +729,7 @@
int
_lsv(Vlong lv, Vlong rv)
{
- return lv.hi < rv.hi ||
+ return lv.hi < rv.hi ||
(lv.hi == rv.hi && lv.lo <= rv.lo);
}
@@ -736,7 +736,7 @@
int
_hiv(Vlong lv, Vlong rv)
{
- return lv.hi > rv.hi ||
+ return lv.hi > rv.hi ||
(lv.hi == rv.hi && lv.lo > rv.lo);
}
@@ -743,6 +743,6 @@
int
_hsv(Vlong lv, Vlong rv)
{
- return lv.hi > rv.hi ||
+ return lv.hi > rv.hi ||
(lv.hi == rv.hi && lv.lo >= rv.lo);
}
--- a/sys/src/libc/fmt/fltfmt.c
+++ b/sys/src/libc/fmt/fltfmt.c
@@ -303,7 +303,7 @@
* The max length of a %f string is
* '[+-]'+"max exponent"+'.'+"max precision"+'\0'
* which is 341 currently.
- */
+ */
xdtoa(fmt, s, f);
fmt->flags &= FmtWidth|FmtLeft;
_fmtcpy(fmt, s, strlen(s), strlen(s));
--- a/sys/src/libc/mips/sqrt.c
+++ b/sys/src/libc/mips/sqrt.c
@@ -76,7 +76,7 @@
/*
* this is the program that generated the table.
* it calls sqrt by some other means.
- *
+ *
* void
* main(void)
* {
@@ -90,7 +90,7 @@
* long ls;
* };
* } u;
- *
+ *
* for(i=0; i<64; i++) {
* u.ms = (i<<15) | 0x3fe04000;
* u.ls = 0;
--- a/sys/src/libc/mips/vlrt.c
+++ b/sys/src/libc/mips/vlrt.c
@@ -705,7 +705,7 @@
int
_ltv(Vlong lv, Vlong rv)
{
- return (long)lv.hi < (long)rv.hi ||
+ return (long)lv.hi < (long)rv.hi ||
(lv.hi == rv.hi && lv.lo < rv.lo);
}
@@ -712,7 +712,7 @@
int
_lev(Vlong lv, Vlong rv)
{
- return (long)lv.hi < (long)rv.hi ||
+ return (long)lv.hi < (long)rv.hi ||
(lv.hi == rv.hi && lv.lo <= rv.lo);
}
@@ -719,7 +719,7 @@
int
_gtv(Vlong lv, Vlong rv)
{
- return (long)lv.hi > (long)rv.hi ||
+ return (long)lv.hi > (long)rv.hi ||
(lv.hi == rv.hi && lv.lo > rv.lo);
}
@@ -726,7 +726,7 @@
int
_gev(Vlong lv, Vlong rv)
{
- return (long)lv.hi > (long)rv.hi ||
+ return (long)lv.hi > (long)rv.hi ||
(lv.hi == rv.hi && lv.lo >= rv.lo);
}
@@ -733,7 +733,7 @@
int
_lov(Vlong lv, Vlong rv)
{
- return lv.hi < rv.hi ||
+ return lv.hi < rv.hi ||
(lv.hi == rv.hi && lv.lo < rv.lo);
}
@@ -740,7 +740,7 @@
int
_lsv(Vlong lv, Vlong rv)
{
- return lv.hi < rv.hi ||
+ return lv.hi < rv.hi ||
(lv.hi == rv.hi && lv.lo <= rv.lo);
}
@@ -747,7 +747,7 @@
int
_hiv(Vlong lv, Vlong rv)
{
- return lv.hi > rv.hi ||
+ return lv.hi > rv.hi ||
(lv.hi == rv.hi && lv.lo > rv.lo);
}
@@ -754,6 +754,6 @@
int
_hsv(Vlong lv, Vlong rv)
{
- return lv.hi > rv.hi ||
+ return lv.hi > rv.hi ||
(lv.hi == rv.hi && lv.lo >= rv.lo);
}
--- a/sys/src/libc/port/cleanname.c
+++ b/sys/src/libc/port/cleanname.c
@@ -53,7 +53,7 @@
if(q == name) /* empty string is really ``.'' */
*q++ = '.';
*q = '\0';
- if(erasedprefix && name[0] == '#'){
+ if(erasedprefix && name[0] == '#'){
/* this was not a #x device path originally - make it not one now */
memmove(name+2, name, strlen(name)+1);
name[0] = '.';
--- a/sys/src/libc/port/malloc.c
+++ b/sys/src/libc/port/malloc.c
@@ -135,7 +135,7 @@
static char panicbuf[256];
static void
-ppanic(Pool *p, char *fmt, ...)
+ppanic(Pool *p, char *fmt, ...)
{
va_list v;
int n;
@@ -170,7 +170,7 @@
/* - except the code for malloc(), which alternately doesn't clear or does. - */
/*
- * Npadlong is the number of ulongs's to leave at the beginning of
+ * Npadlong is the number of ulongs's to leave at the beginning of
* each allocated buffer for our own bookkeeping. We return to the callers
* a pointer that points immediately after our bookkeeping area. Incoming pointers
* must be decremented by that much, and outgoing pointers incremented.
@@ -269,7 +269,7 @@
setrealloctag(nv, getcallerpc(&v));
if(v == nil)
setmalloctag(nv, getcallerpc(&v));
- }
+ }
return nv;
}
--- a/sys/src/libc/port/pool.c
+++ b/sys/src/libc/port/pool.c
@@ -1,7 +1,7 @@
/*
* This allocator takes blocks from a coarser allocator (p->alloc) and
* uses them as arenas.
- *
+ *
* An arena is split into a sequence of blocks of variable size. The
* blocks begin with a Bhdr that denotes the length (including the Bhdr)
* of the block. An arena begins with an Arena header block (Arena,
@@ -9,7 +9,7 @@
* size 0. Intermediate blocks are either allocated or free. At the end
* of each intermediate block is a Btail, which contains information
* about where the block starts. This is useful for walking backwards.
- *
+ *
* Free blocks (Free*) have a magic value of FREE_MAGIC in their Bhdr
* headers. They are kept in a binary tree (p->freeroot) traversible by
* walking ->left and ->right. Each node of the binary tree is a pointer
@@ -16,10 +16,10 @@
* to a circular doubly-linked list (next, prev) of blocks of identical
* size. Blocks are added to this ``tree of lists'' by pooladd(), and
* removed by pooldel().
- *
+ *
* When freed, adjacent blocks are coalesced to create larger blocks when
* possible.
- *
+ *
* Allocated blocks (Alloc*) have one of two magic values: ALLOC_MAGIC or
* UNALLOC_MAGIC. When blocks are released from the pool, they have
* magic value UNALLOC_MAGIC. Once the block has been trimmed by trim()
@@ -27,11 +27,11 @@
* datasize field of the tail, the magic value is changed to ALLOC_MAGIC.
* All blocks returned to callers should be of type ALLOC_MAGIC, as
* should all blocks passed to us by callers. The amount of data the user
- * asked us for can be found by subtracting the short in tail->datasize
+ * asked us for can be found by subtracting the short in tail->datasize
* from header->size. Further, the up to at most four bytes between the
* end of the user-requested data block and the actual Btail structure are
* marked with a magic value, which is checked to detect user overflow.
- *
+ *
* The arenas returned by p->alloc are kept in a doubly-linked list
* (p->arenalist) running through the arena headers, sorted by descending
* base address (prev, next). When a new arena is allocated, we attempt
@@ -159,12 +159,12 @@
/*
* Debugging
- *
+ *
* Antagonism causes blocks to always be filled with garbage if their
* contents are undefined. This tickles both programs and the library.
* It's a linear time hit but not so noticeable during nondegenerate use.
* It would be worth leaving in except that it negates the benefits of the
- * kernel's demand-paging. The tail magic and end-of-data magic
+ * kernel's demand-paging. The tail magic and end-of-data magic
* provide most of the user-visible benefit that antagonism does anyway.
*
* Paranoia causes the library to recheck the entire pool on each lock
@@ -220,7 +220,7 @@
checktree(t->left, a, t->size);
if(t->right)
checktree(t->right, t->size, b);
-
+
}
/* treelookupgt: find smallest node in tree with size >= size */
@@ -379,7 +379,7 @@
}
/*
- * Block maintenance
+ * Block maintenance
*/
/* block allocation */
static ulong
@@ -527,7 +527,7 @@
pooladd(p, b);
return bb;
}
- return b;
+ return b;
}
/*
@@ -656,7 +656,7 @@
bot->aup->down = bot;
else
p->arenalist = bot;
-
+
/* save ptrs to last block in bot, first block in top */
t = B2PT(A2TB(bot));
bbot = T2HDR(t);
@@ -848,7 +848,7 @@
pooladd(p, (Alloc*)wb);
}
- return compacted;
+ return compacted;
}
/*
@@ -1033,7 +1033,7 @@
/* enough cleverness */
memmove(nv, v, odsize);
- antagonism {
+ antagonism {
memset((char*)nv+odsize, 0xDE, ndsize-odsize);
}
poolfreel(p, v);
@@ -1078,7 +1078,7 @@
*
* to satisfy alignment, just allocate an extra
* align bytes and then shift appropriately.
- *
+ *
* to satisfy span, try once and see if we're
* lucky. the second time, allocate 2x asize
* so that we definitely get one not crossing
@@ -1133,7 +1133,7 @@
trim(p, b, skip+dsize);
p->curalloc += b->size;
assert(D2B(p, c) == b);
- antagonism {
+ antagonism {
memset(c, 0xDD, dsize);
}
return c;
@@ -1159,7 +1159,7 @@
n = getdsize(ab)-8;
if(n > 0)
memset((uchar*)v+8, 0xDA, n);
- return;
+ return;
}
p->nfree++;
@@ -1297,7 +1297,7 @@
}
/*
- * Return the real size of a block, and let the user use it.
+ * Return the real size of a block, and let the user use it.
*/
ulong
poolmsize(Pool *p, void *v)
@@ -1333,7 +1333,7 @@
}
/*
- * Debugging
+ * Debugging
*/
static void
--- a/sys/src/libc/port/pow10.c
+++ b/sys/src/libc/port/pow10.c
@@ -12,16 +12,16 @@
static
double tab[] =
{
- 1.0e0, 1.0e1, 1.0e2, 1.0e3, 1.0e4, 1.0e5, 1.0e6, 1.0e7, 1.0e8, 1.0e9,
- 1.0e10, 1.0e11, 1.0e12, 1.0e13, 1.0e14, 1.0e15, 1.0e16, 1.0e17, 1.0e18, 1.0e19,
- 1.0e20, 1.0e21, 1.0e22, 1.0e23, 1.0e24, 1.0e25, 1.0e26, 1.0e27, 1.0e28, 1.0e29,
- 1.0e30, 1.0e31, 1.0e32, 1.0e33, 1.0e34, 1.0e35, 1.0e36, 1.0e37, 1.0e38, 1.0e39,
- 1.0e40, 1.0e41, 1.0e42, 1.0e43, 1.0e44, 1.0e45, 1.0e46, 1.0e47, 1.0e48, 1.0e49,
- 1.0e50, 1.0e51, 1.0e52, 1.0e53, 1.0e54, 1.0e55, 1.0e56, 1.0e57, 1.0e58, 1.0e59,
- 1.0e60, 1.0e61, 1.0e62, 1.0e63, 1.0e64, 1.0e65, 1.0e66, 1.0e67, 1.0e68, 1.0e69,
- 1.0e70, 1.0e71, 1.0e72, 1.0e73, 1.0e74, 1.0e75, 1.0e76, 1.0e77, 1.0e78, 1.0e79,
- 1.0e80, 1.0e81, 1.0e82, 1.0e83, 1.0e84, 1.0e85, 1.0e86, 1.0e87, 1.0e88, 1.0e89,
- 1.0e90, 1.0e91, 1.0e92, 1.0e93, 1.0e94, 1.0e95, 1.0e96, 1.0e97, 1.0e98, 1.0e99,
+ 1.0e0, 1.0e1, 1.0e2, 1.0e3, 1.0e4, 1.0e5, 1.0e6, 1.0e7, 1.0e8, 1.0e9,
+ 1.0e10, 1.0e11, 1.0e12, 1.0e13, 1.0e14, 1.0e15, 1.0e16, 1.0e17, 1.0e18, 1.0e19,
+ 1.0e20, 1.0e21, 1.0e22, 1.0e23, 1.0e24, 1.0e25, 1.0e26, 1.0e27, 1.0e28, 1.0e29,
+ 1.0e30, 1.0e31, 1.0e32, 1.0e33, 1.0e34, 1.0e35, 1.0e36, 1.0e37, 1.0e38, 1.0e39,
+ 1.0e40, 1.0e41, 1.0e42, 1.0e43, 1.0e44, 1.0e45, 1.0e46, 1.0e47, 1.0e48, 1.0e49,
+ 1.0e50, 1.0e51, 1.0e52, 1.0e53, 1.0e54, 1.0e55, 1.0e56, 1.0e57, 1.0e58, 1.0e59,
+ 1.0e60, 1.0e61, 1.0e62, 1.0e63, 1.0e64, 1.0e65, 1.0e66, 1.0e67, 1.0e68, 1.0e69,
+ 1.0e70, 1.0e71, 1.0e72, 1.0e73, 1.0e74, 1.0e75, 1.0e76, 1.0e77, 1.0e78, 1.0e79,
+ 1.0e80, 1.0e81, 1.0e82, 1.0e83, 1.0e84, 1.0e85, 1.0e86, 1.0e87, 1.0e88, 1.0e89,
+ 1.0e90, 1.0e91, 1.0e92, 1.0e93, 1.0e94, 1.0e95, 1.0e96, 1.0e97, 1.0e98, 1.0e99,
1.0e100,1.0e101,1.0e102,1.0e103,1.0e104,1.0e105,1.0e106,1.0e107,1.0e108,1.0e109,
1.0e110,1.0e111,1.0e112,1.0e113,1.0e114,1.0e115,1.0e116,1.0e117,1.0e118,1.0e119,
1.0e120,1.0e121,1.0e122,1.0e123,1.0e124,1.0e125,1.0e126,1.0e127,1.0e128,1.0e129,
--- a/sys/src/libc/port/profile.c
+++ b/sys/src/libc/port/profile.c
@@ -73,7 +73,7 @@
/* Add kernel cycles on proc entry */
p->time = p->time + _tos->kcycles;
/* fall through */
- case Proftime:
+ case Proftime:
proftime: /* Subtract cycle counter on proc entry */
cycles((uvlong*)&t);
p->time = p->time - t;
@@ -104,7 +104,7 @@
case Profuser: /* Subtract kernel cycles on proc entry */
p->time = p->time - _tos->kcycles;
/* fall through */
- case Proftime:
+ case Proftime:
proftime: /* Add cycle counter on proc entry */
cycles((uvlong*)&t);
p->time = p->time + t;
--- a/sys/src/libc/port/quote.c
+++ b/sys/src/libc/port/quote.c
@@ -91,7 +91,7 @@
if(_needsquotes(s, "elen) == 0)
return strdup(s);
-
+
ret = malloc(quotelen+1);
if(ret == nil)
return nil;
@@ -117,7 +117,7 @@
if(_runeneedsquotes(s, "elen) == 0)
return runestrdup(s);
-
+
ret = malloc((quotelen+1)*sizeof(Rune));
if(ret == nil)
return nil;
--- a/sys/src/libc/port/runestrdup.c
+++ b/sys/src/libc/port/runestrdup.c
@@ -2,8 +2,8 @@
#include <libc.h>
Rune*
-runestrdup(Rune *s)
-{
+runestrdup(Rune *s)
+{
Rune *ns;
ns = malloc(sizeof(Rune)*(runestrlen(s) + 1));
--- a/sys/src/libc/port/strdup.c
+++ b/sys/src/libc/port/strdup.c
@@ -2,8 +2,8 @@
#include <libc.h>
char*
-strdup(char *s)
-{
+strdup(char *s)
+{
char *ns;
ns = malloc(strlen(s) + 1);
--- a/sys/src/libc/port/u64.c
+++ b/sys/src/libc/port/u64.c
@@ -36,7 +36,7 @@
b24 = 0;
i = 0;
while(n-- > 0){
-
+
c = t64d[*(uchar*)in++];
if(c == INVAL)
continue;
--- a/sys/src/libc/power/sqrt.c
+++ b/sys/src/libc/power/sqrt.c
@@ -76,7 +76,7 @@
/*
* this is the program that generated the table.
* it calls sqrt by some other means.
- *
+ *
* void
* main(void)
* {
@@ -90,7 +90,7 @@
* long ls;
* };
* } u;
- *
+ *
* for(i=0; i<64; i++) {
* u.ms = (i<<15) | 0x3fe04000;
* u.ls = 0;
--- a/sys/src/libc/sparc/memmove.s
+++ b/sys/src/libc/sparc/memmove.s
@@ -110,7 +110,7 @@
* whole thing repeated for backwards
*/
back:
- SUBCC $8,R9, R0
+ SUBCC $8,R9, R0
BL bout
XOR R12,R13, R7
--- a/sys/src/libc/sparc/sqrt.c
+++ b/sys/src/libc/sparc/sqrt.c
@@ -76,7 +76,7 @@
/*
* this is the program that generated the table.
* it calls sqrt by some other means.
- *
+ *
* void
* main(void)
* {
@@ -90,7 +90,7 @@
* long ls;
* };
* } u;
- *
+ *
* for(i=0; i<64; i++) {
* u.ms = (i<<15) | 0x3fe04000;
* u.ls = 0;
--- a/sys/src/libc/sparc/vlop.s
+++ b/sys/src/libc/sparc/vlop.s
@@ -109,4 +109,4 @@
nomul2:
MOVW R9, 0(R7)
- RETURN
+ RETURN
--- a/sys/src/libc/sparc/vlrt.c
+++ b/sys/src/libc/sparc/vlrt.c
@@ -705,7 +705,7 @@
int
_ltv(Vlong lv, Vlong rv)
{
- return (long)lv.hi < (long)rv.hi ||
+ return (long)lv.hi < (long)rv.hi ||
(lv.hi == rv.hi && lv.lo < rv.lo);
}
@@ -712,7 +712,7 @@
int
_lev(Vlong lv, Vlong rv)
{
- return (long)lv.hi < (long)rv.hi ||
+ return (long)lv.hi < (long)rv.hi ||
(lv.hi == rv.hi && lv.lo <= rv.lo);
}
@@ -719,7 +719,7 @@
int
_gtv(Vlong lv, Vlong rv)
{
- return (long)lv.hi > (long)rv.hi ||
+ return (long)lv.hi > (long)rv.hi ||
(lv.hi == rv.hi && lv.lo > rv.lo);
}
@@ -726,7 +726,7 @@
int
_gev(Vlong lv, Vlong rv)
{
- return (long)lv.hi > (long)rv.hi ||
+ return (long)lv.hi > (long)rv.hi ||
(lv.hi == rv.hi && lv.lo >= rv.lo);
}
@@ -733,7 +733,7 @@
int
_lov(Vlong lv, Vlong rv)
{
- return lv.hi < rv.hi ||
+ return lv.hi < rv.hi ||
(lv.hi == rv.hi && lv.lo < rv.lo);
}
@@ -740,7 +740,7 @@
int
_lsv(Vlong lv, Vlong rv)
{
- return lv.hi < rv.hi ||
+ return lv.hi < rv.hi ||
(lv.hi == rv.hi && lv.lo <= rv.lo);
}
@@ -747,7 +747,7 @@
int
_hiv(Vlong lv, Vlong rv)
{
- return lv.hi > rv.hi ||
+ return lv.hi > rv.hi ||
(lv.hi == rv.hi && lv.lo > rv.lo);
}
@@ -754,6 +754,6 @@
int
_hsv(Vlong lv, Vlong rv)
{
- return lv.hi > rv.hi ||
+ return lv.hi > rv.hi ||
(lv.hi == rv.hi && lv.lo >= rv.lo);
}
--- a/sys/src/libc/spim/sqrt.c
+++ b/sys/src/libc/spim/sqrt.c
@@ -76,7 +76,7 @@
/*
* this is the program that generated the table.
* it calls sqrt by some other means.
- *
+ *
* void
* main(void)
* {
@@ -90,7 +90,7 @@
* long ls;
* };
* } u;
- *
+ *
* for(i=0; i<64; i++) {
* u.ms = (i<<15) | 0x3fe04000;
* u.ls = 0;
--- a/sys/src/libc/spim/vlrt.c
+++ b/sys/src/libc/spim/vlrt.c
@@ -705,7 +705,7 @@
int
_ltv(Vlong lv, Vlong rv)
{
- return (long)lv.hi < (long)rv.hi ||
+ return (long)lv.hi < (long)rv.hi ||
(lv.hi == rv.hi && lv.lo < rv.lo);
}
@@ -712,7 +712,7 @@
int
_lev(Vlong lv, Vlong rv)
{
- return (long)lv.hi < (long)rv.hi ||
+ return (long)lv.hi < (long)rv.hi ||
(lv.hi == rv.hi && lv.lo <= rv.lo);
}
@@ -719,7 +719,7 @@
int
_gtv(Vlong lv, Vlong rv)
{
- return (long)lv.hi > (long)rv.hi ||
+ return (long)lv.hi > (long)rv.hi ||
(lv.hi == rv.hi && lv.lo > rv.lo);
}
@@ -726,7 +726,7 @@
int
_gev(Vlong lv, Vlong rv)
{
- return (long)lv.hi > (long)rv.hi ||
+ return (long)lv.hi > (long)rv.hi ||
(lv.hi == rv.hi && lv.lo >= rv.lo);
}
@@ -733,7 +733,7 @@
int
_lov(Vlong lv, Vlong rv)
{
- return lv.hi < rv.hi ||
+ return lv.hi < rv.hi ||
(lv.hi == rv.hi && lv.lo < rv.lo);
}
@@ -740,7 +740,7 @@
int
_lsv(Vlong lv, Vlong rv)
{
- return lv.hi < rv.hi ||
+ return lv.hi < rv.hi ||
(lv.hi == rv.hi && lv.lo <= rv.lo);
}
@@ -747,7 +747,7 @@
int
_hiv(Vlong lv, Vlong rv)
{
- return lv.hi > rv.hi ||
+ return lv.hi > rv.hi ||
(lv.hi == rv.hi && lv.lo > rv.lo);
}
@@ -754,6 +754,6 @@
int
_hsv(Vlong lv, Vlong rv)
{
- return lv.hi > rv.hi ||
+ return lv.hi > rv.hi ||
(lv.hi == rv.hi && lv.lo >= rv.lo);
}