nixo
/
gri3-wm
1
0
Fork 0
Code Issues Pull Requests Releases Wiki Activity

remove some debug messages

This commit is contained in:
Michael Stapelberg 2010-11-27 18:05:45 +01:00
parent 2c3e5dbc65
commit 0cfebcb5b6
4 changed files with 0 additions and 13 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

3
src/con.c
View File

@ -232,7 +232,6 @@ struct bfs_entry {
Con *con_get_fullscreen_con(Con *con) { Con *con_get_fullscreen_con(Con *con) {
Con *current, *child; Con *current, *child;
LOG("looking for fullscreen node\n");
/* TODO: is breadth-first-search really appropriate? (check as soon as /* TODO: is breadth-first-search really appropriate? (check as soon as
* fullscreen levels and fullscreen for containers is implemented) */ * fullscreen levels and fullscreen for containers is implemented) */
TAILQ_HEAD(bfs_head, bfs_entry) bfs_head = TAILQ_HEAD_INITIALIZER(bfs_head); TAILQ_HEAD(bfs_head, bfs_entry) bfs_head = TAILQ_HEAD_INITIALIZER(bfs_head);
@ -243,7 +242,6 @@ Con *con_get_fullscreen_con(Con *con) {
while (!TAILQ_EMPTY(&bfs_head)) { while (!TAILQ_EMPTY(&bfs_head)) {
entry = TAILQ_FIRST(&bfs_head); entry = TAILQ_FIRST(&bfs_head);
current = entry->con; current = entry->con;
LOG("checking %p\n", current);
if (current != con && current->fullscreen_mode != CF_NONE) { if (current != con && current->fullscreen_mode != CF_NONE) {
/* empty the queue */ /* empty the queue */
while (!TAILQ_EMPTY(&bfs_head)) { while (!TAILQ_EMPTY(&bfs_head)) {
@ -254,7 +252,6 @@ Con *con_get_fullscreen_con(Con *con) {
return current; return current;
} }
LOG("deleting from queue\n");
TAILQ_REMOVE(&bfs_head, entry, entries); TAILQ_REMOVE(&bfs_head, entry, entries);
free(entry); free(entry);

1
src/render.c
View File

@ -40,7 +40,6 @@ void render_con(Con *con, bool render_fullscreen) {
int i = 0; int i = 0;
printf("mapped = true\n");
con->mapped = true; con->mapped = true;
/* if this container contains a window, set the coordinates */ /* if this container contains a window, set the coordinates */

4
src/tree.c
View File

@ -298,21 +298,17 @@ void level_down() {
static void mark_unmapped(Con *con) { static void mark_unmapped(Con *con) {
Con *current; Con *current;
DLOG("marking container %p unmapped\n", con);
con->mapped = false; con->mapped = false;
TAILQ_FOREACH(current, &(con->nodes_head), nodes) TAILQ_FOREACH(current, &(con->nodes_head), nodes)
mark_unmapped(current); mark_unmapped(current);
if (con->type == CT_WORKSPACE) { if (con->type == CT_WORKSPACE) {
TAILQ_FOREACH(current, &(con->floating_head), floating_windows) { TAILQ_FOREACH(current, &(con->floating_head), floating_windows) {
DLOG("Marking unmapped for floating %p\n", current);
current->mapped = false; current->mapped = false;
Con *child = TAILQ_FIRST(&(current->nodes_head)); Con *child = TAILQ_FIRST(&(current->nodes_head));
DLOG(" unmapping floating child %p\n", child);
child->mapped = false; child->mapped = false;
} }
} }
DLOG("mark_unmapped done\n");
} }
/* /*

5
src/x.c
View File

@ -391,16 +391,12 @@ static void x_push_node(Con *con) {
* this frame. */ * this frame. */
uint32_t max_y = 0, max_height = 0; uint32_t max_y = 0, max_height = 0;
TAILQ_FOREACH(current, &(con->nodes_head), nodes) { TAILQ_FOREACH(current, &(con->nodes_head), nodes) {
DLOG("Child's decoration is %d x %d, from (%d, %d)\n",
current->deco_rect.width, current->deco_rect.height,
current->deco_rect.x, current->deco_rect.y);
Rect *dr = &(current->deco_rect); Rect *dr = &(current->deco_rect);
if (dr->y >= max_y && dr->height >= max_height) { if (dr->y >= max_y && dr->height >= max_height) {
max_y = dr->y; max_y = dr->y;
max_height = dr->height; max_height = dr->height;
} }
} }
DLOG("bottom of decorations is %d\n", max_y + max_height);
rect.height = max_y + max_height; rect.height = max_y + max_height;
if (rect.height == 0) { if (rect.height == 0) {
DLOG("Unmapping container because it does not contain anything atm.\n"); DLOG("Unmapping container because it does not contain anything atm.\n");
@ -618,7 +614,6 @@ void x_raise_con(Con *con) {
LOG("raising in new stack: %p / %s\n", con, con->name); LOG("raising in new stack: %p / %s\n", con, con->name);
state = state_for_frame(con->frame); state = state_for_frame(con->frame);
LOG("found state entry, moving to top\n");
CIRCLEQ_REMOVE(&state_head, state, state); CIRCLEQ_REMOVE(&state_head, state, state);
CIRCLEQ_INSERT_HEAD(&state_head, state, state); CIRCLEQ_INSERT_HEAD(&state_head, state, state);
} }