wmii

git clone git://oldgit.suckless.org/wmii/
Log | Files | Refs | README | LICENSE

commit df708da914d06b3043db473244586ae65bc17d69
parent 3b9fb4494c92bc998b82ffb58fa62c7d188c59cf
Author: garbeam <garbeam@localhost.localdomain>
Date:   Thu,  8 Dec 2005 18:38:01 +0200

removed annoying debug output from container.c


Diffstat:
libcext/container.c | 16----------------
1 file changed, 0 insertions(+), 16 deletions(-)

diff --git a/libcext/container.c b/libcext/container.c @@ -5,7 +5,6 @@ #include <assert.h> #include <stdlib.h> -#include <stdio.h> #include "cext.h" @@ -16,7 +15,6 @@ static int comp_ptr(void *p1, void *p2) static void detach_from_stack(Container *c, CItem *i) { - fprintf(stderr, "XX %s\n", "detach_from_stack()"); /* remove from stack */ if (i == c->stack) { c->stack = i->down; @@ -35,7 +33,6 @@ static void detach_from_stack(Container *c, CItem *i) static void attach_to_stack(Container *c, CItem *i) { - fprintf(stderr, "XX %s\n", "attach_to_stack()"); i->up = 0; i->down = 0; if (!c->stack) @@ -50,7 +47,6 @@ static void attach_to_stack(Container *c, CItem *i) void cext_attach_item(Container *c, void *item) { CItem *i, *new = cext_emallocz(sizeof(CItem)); - fprintf(stderr, "XX %s\n", "cext_attach_item()"); new->item = item; if (!c->list) c->list = new; @@ -64,7 +60,6 @@ void cext_attach_item(Container *c, void *item) void cext_detach_item(Container *c, void *item) { CItem *i = c->list; - fprintf(stderr, "XX %s\n", "cext_detach_item()"); if (!i) return; @@ -87,7 +82,6 @@ void cext_detach_item(Container *c, void *item) static CItem *cext_find_citem(Container *c, void *pattern, int (*comp)(void *pattern, void *item)) { CItem *i; - fprintf(stderr, "XX %s\n", "cext_find_citem()"); for (i = c->list; i && !comp(pattern, i->item); i = i->next); return i; } @@ -95,14 +89,12 @@ static CItem *cext_find_citem(Container *c, void *pattern, int (*comp)(void *pat void *cext_find_item(Container *c, void *pattern, int (*comp)(void *pattern, void *item)) { CItem *i = cext_find_citem(c, pattern, comp); - fprintf(stderr, "XX %s\n", "cext_find_item()"); return i ? i->item : nil; } void cext_iterate(Container *c, void *aux, void (*iter)(void *, void *aux)) { CItem *i; - fprintf(stderr, "XX %s\n", "cext_iterate()"); for (i = c->list; i; i = i->next) { assert(c); @@ -116,7 +108,6 @@ size_t cext_sizeof(Container *c) size_t idx = 0; CItem *i; - fprintf(stderr, "XX %s\n", "cext_sizeof()"); for (i = c->list; i; i = i->next) idx++; @@ -127,7 +118,6 @@ void cext_swap_items(Container *c, void *item1, void *item2) { CItem *i1 = cext_find_citem(c, item1, comp_ptr); CItem *i2 = cext_find_citem(c, item2, comp_ptr); - fprintf(stderr, "XX %s\n", "cext_swap_items()"); i1->item = item2; i2->item = item1; @@ -136,7 +126,6 @@ void cext_swap_items(Container *c, void *item1, void *item2) void cext_stack_top_item(Container *c, void *item) { CItem *i = cext_find_citem(c, item, comp_ptr); - fprintf(stderr, "XX %s\n", "cext_top_item()"); if (!i) return; detach_from_stack(c, i); @@ -145,14 +134,12 @@ void cext_stack_top_item(Container *c, void *item) void *cext_stack_get_top_item(Container *c) { - fprintf(stderr, "XX %s\n", "cext_get_top_item()"); return c->stack ? c->stack->item : nil; } void *cext_stack_get_down_item(Container *c, void *item) { CItem *i = cext_find_citem(c, item, comp_ptr); - fprintf(stderr, "XX %s\n", "cext_get_down_item()"); if (!i) return nil; return i->down ? i->down->item : c->stack->item; @@ -162,7 +149,6 @@ void *cext_stack_get_up_item(Container *c, void *item) { CItem *i = cext_find_citem(c, item, comp_ptr); CItem *bottom; - fprintf(stderr, "XX %s\n", "cext_get_up_item()"); if (!i) return nil; for (bottom = c->stack; bottom && bottom->down; bottom = bottom->down); @@ -174,7 +160,6 @@ void *cext_list_get_item(Container *c, size_t index) size_t idx = 0; CItem *i; - fprintf(stderr, "XX %s\n", "cext_get_item()"); for (i = c->list; i && index != idx; i = i->next) idx++; @@ -186,7 +171,6 @@ int cext_list_get_item_index(Container *c, void *item) int idx = 0; CItem *i; - fprintf(stderr, "XX %s\n", "cext_get_item_index()"); for (i = c->list; i && i->item != item; i = i->next) idx++;