code: mafs

Info  •  Files  •  Log

fixed extents to use dprint for debug printing

--- a/all.h

+++ b/all.h

@@ -134,7 +134,6 @@

 void	datestr(char*, long);

 Qid	dentryqid(Dentry*);

 void	dofilter(Filter*);

-int		dprint(char *fmt, ...);

 void	exit(void);

 /*Float	famd(Float, int, int, int);*/

 int	fchar(void);

--- a/extents.c

+++ b/extents.c

@@ -20,10 +20,6 @@

  * When freed, adjacent extents are coalesced to create larger extents when

  * possible.

  */

-/*

- * Verbosity induces the dumping of the pool via p->print at each lock operation.

- * By default, only one line is logged for each alloc, free, and realloc.

- */

 Extent *sortbysize(Extents *es, Extent *e);

 void	showextent(char *pre, Extent *e);

@@ -82,7 +78,7 @@

 	Extent *dsmall, *fbig, *f, *d;

 	if(chatty9p > 5)

-		print("	+size %llud .. %llud\n", e->blkno, e->blkno+e->len-1);

+		dprint("	+size %llud .. %llud\n", e->blkno, e->blkno+e->len-1);

 	for(f = d = smallest(es);

 		f != nil;

@@ -123,7 +119,7 @@

 	c->len = len;

 	es->n++;

 	if(chatty9p > 5)

-		print("	+%llud .. %llud\n", blkno, blkno+len-1);

+		dprint("	+%llud .. %llud\n", blkno, blkno+len-1);

 	if(blkno < e->blkno){

 		/* e->low e

@@ -147,7 +143,7 @@

 		c->low = e;

 		return addsize(es, c);

 	}

-	print("addextent: should not be here e->blkno"

+	dprint("addextent: should not be here e->blkno"

 			" %llud .. %llud blkno %llud len %llud\n",

 			e->blkno, e->blkno+e->len-1, blkno, len);

 	abort();

@@ -256,7 +252,7 @@

 		e->len += len;

 		return sortbysize(es, mergenext(es, e));

 	}

-	print("increment: should not be here"

+	dprint("increment: should not be here"

 		" e->blkno %llud .. %llud blkno %llud len %llud\n",

 		e->blkno, e->blkno+e->len-1, blkno, len);

 	abort();

@@ -279,7 +275,7 @@

 }

 /*

-print("between e->prev %llud .. %llud and e %llud .. %llud\n",

+dprint("between e->prev %llud .. %llud and e %llud .. %llud\n",

 	 e->prev->blkno, e->prev->blkno+e->prev->n-1,

 	 e->blkno, e->blkno+e->len-1);

  */

@@ -305,7 +301,7 @@

 	e = es->lru;

 	dir = belongs(es->lru, blkno, len);

 	if(chatty9p > 5){

-		print(" 	belongs(e %llud %llud blkno %llud .. %llud) %d\n",

+		dprint(" 	belongs(e %llud %llud blkno %llud .. %llud) %d\n",

 			 e->blkno, e->blkno+e->len-1, blkno, blkno+len-1, dir);

 	}

 	if(dir == 0)

@@ -355,7 +351,7 @@

 	if(chatty9p > 5){

 		showextents("		before\n", es);

-		print(" +%llud %llud\n", blkno, len);

+		dprint(" +%llud %llud\n", blkno, len);

 	}

 	e = doadd(es, blkno, len);

 	es->lru = e;

@@ -685,7 +681,7 @@

 void

 showextent(char *pre, Extent *e)

 {

-	print("%s small %8#p	low %8#p	e %8#p %llud %llud	high %8#p	big %8#p",

+	dprint("%s small %8#p	low %8#p	e %8#p %llud %llud	high %8#p	big %8#p",

 			pre, e->small, e->low, e, e->blkno, e->len, e->high, e->big);

 }

@@ -694,17 +690,17 @@

 {

 	Extent *e;

-	print("%s", msg);

+	dprint("%s", msg);

 	for(e = lowest(es); e != nil; e = e->high){

-		print("	%llud .. %llud", e->blkno, e->blkno+e->len-1);

+		dprint("	%llud .. %llud", e->blkno, e->blkno+e->len-1);

 //		showextent("	", e);

-		print("\n");

+		dprint("\n");

 	}

-	print("			ordered by size\n");

+	dprint("			ordered by size\n");

 	for(e = smallest(es); e != nil; e = e->big){

-		print("	%llud .. %llud has %llud blocks", e->blkno, e->blkno+e->len-1, e->len);

+		dprint("	%llud .. %llud has %llud blocks", e->blkno, e->blkno+e->len-1, e->len);

 //		showextent("	", e);

-		print("\n");

+		dprint("\n");

 	}

 }

@@ -716,7 +712,7 @@

 	for(e = lowest(es); e != nil; e = e->high)

 		for(i = e->blkno; i<e->blkno+e->len; i++)

-			print("%llud\n", i);

+			dprint("%llud\n", i);

 }

 void *

--- a/fns.h

+++ b/fns.h

@@ -25,3 +25,4 @@

 void	panic(char*, ...);

 int	fprint(int, char*, ...);

+int		dprint(char *fmt, ...);