Dogcows Code - chaz/openbox/blob - openbox/keytree.c

   1 /* -*- indent-tabs-mode: nil; tab-width: 4; c-basic-offset: 4; -*-
   2
   3    keytree.c for the Openbox window manager
   4    Copyright (c) 2006        Mikael Magnusson
   5    Copyright (c) 2003        Ben Jansens
   6
   7    This program is free software; you can redistribute it and/or modify
   8    it under the terms of the GNU General Public License as published by
   9    the Free Software Foundation; either version 2 of the License, or
  10    (at your option) any later version.
  11
  12    This program is distributed in the hope that it will be useful,
  13    but WITHOUT ANY WARRANTY; without even the implied warranty of
  14    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
  15    GNU General Public License for more details.
  16
  17    See the COPYING file for a copy of the GNU General Public License.
  18 */
  19
  20 #include "keyboard.h"
  21 #include "translate.h"
  22 #include <glib.h>
  23
  24 void tree_destroy(KeyBindingTree *tree)
  25 {
  26     KeyBindingTree *c;
  27
  28     while (tree) {
  29         tree_destroy(tree->next_sibling);
  30         c = tree->first_child;
  31         if (c == NULL) {
  32             GList *it;
  33             GSList *sit;
  34             for (it = tree->keylist; it != NULL; it = it->next)
  35                 g_free(it->data);
  36             g_list_free(tree->keylist);
  37             for (sit = tree->actions; sit != NULL; sit = sit->next)
  38                 action_unref(sit->data);
  39             g_slist_free(tree->actions);
  40         }
  41         g_free(tree);
  42         tree = c;
  43     }
  44 }
  45
  46 KeyBindingTree *tree_build(GList *keylist)
  47 {
  48     GList *it;
  49     KeyBindingTree *ret = NULL, *p;
  50
  51     if (g_list_length(keylist) <= 0)
  52         return NULL; /* nothing in the list.. */
  53
  54     for (it = g_list_last(keylist); it; it = g_list_previous(it)) {
  55         p = ret;
  56         ret = g_new0(KeyBindingTree, 1);
  57         if (p == NULL) {
  58             GList *it;
  59
  60             /* this is the first built node, the bottom node of the tree */
  61             ret->keylist = g_list_copy(keylist); /* shallow copy */
  62             for (it = ret->keylist; it; it = g_list_next(it)) /* deep copy */
  63                 it->data = g_strdup(it->data);
  64         }
  65         ret->first_child = p;
  66         if (!translate_key(it->data, &ret->state, &ret->key)) {
  67             tree_destroy(ret);
  68             return NULL;
  69         }
  70     }
  71     return ret;
  72 }
  73
  74 void tree_assimilate(KeyBindingTree *node)
  75 {
  76     KeyBindingTree *a, *b, *tmp, *last;
  77
  78     if (keyboard_firstnode == NULL) {
  79         /* there are no nodes at this level yet */
  80         keyboard_firstnode = node;
  81     } else {
  82         a = keyboard_firstnode;
  83         last = a;
  84         b = node;
  85         while (a) {
  86             last = a;
  87             if (!(a->state == b->state && a->key == b->key)) {
  88                 a = a->next_sibling;
  89             } else {
  90                 tmp = b;
  91                 b = b->first_child;
  92                 g_free(tmp);
  93                 a = a->first_child;
  94             }
  95         }
  96         if (!(last->state == b->state && last->key == b->key))
  97             last->next_sibling = b;
  98         else {
  99             last->first_child = b->first_child;
 100             g_free(b);
 101         }
 102     }
 103 }
 104
 105 KeyBindingTree *tree_find(KeyBindingTree *search, gboolean *conflict)
 106 {
 107     KeyBindingTree *a, *b;
 108
 109     *conflict = FALSE;
 110
 111     a = keyboard_firstnode;
 112     b = search;
 113     while (a && b) {
 114         if (!(a->state == b->state && a->key == b->key)) {
 115             a = a->next_sibling;
 116         } else {
 117             if ((a->first_child == NULL) == (b->first_child == NULL)) {
 118                 if (a->first_child == NULL) {
 119                     /* found it! (return the actual node, not the search's) */
 120                     return a;
 121                 }
 122             } else {
 123                 *conflict = TRUE;
 124                 return NULL; /* the chain status' don't match (conflict!) */
 125             }
 126             b = b->first_child;
 127             a = a->first_child;
 128         }
 129     }
 130     return NULL; /* it just isn't in here */
 131 }