diff options
| author | Marcel Hollerbach <marcel@osg.samsung.com> | 2017-10-19 15:19:55 +0200 |
|---|---|---|
| committer | Marcel Hollerbach <marcel@osg.samsung.com> | 2017-10-19 15:20:59 +0200 |
| commit | 5e96d6e37806be1fafae57476048e909a385a6db (patch) | |
| tree | b094c264fc3c84aec5bfc5aa81d3bf45cb960096 | |
| parent | 0c3bec93a1ee64ff26ea1acbc0fc6ae36e625157 (diff) | |
| download | efl-5e96d6e37806be1fafae57476048e909a385a6db.tar.gz | |
efl_ui_focus_manager_calc: really free all direction
i must have been have asleep when i wrote this, we need to iterate all
directions not only to the max id of 4
| -rw-r--r-- | src/lib/elementary/efl_ui_focus_manager_calc.c | 6 |
1 files changed, 3 insertions, 3 deletions
diff --git a/src/lib/elementary/efl_ui_focus_manager_calc.c b/src/lib/elementary/efl_ui_focus_manager_calc.c index 3232ca23ce..44b723bc12 100644 --- a/src/lib/elementary/efl_ui_focus_manager_calc.c +++ b/src/lib/elementary/efl_ui_focus_manager_calc.c @@ -172,7 +172,7 @@ node_item_free(Node *item) Node *n; Eina_List *l; //free the graph items - for(int i = EFL_UI_FOCUS_DIRECTION_UP;i < NODE_DIRECTIONS_COUNT; i++) + for(int i = EFL_UI_FOCUS_DIRECTION_UP;i < EFL_UI_FOCUS_DIRECTION_LAST; i++) { border_partners_set(item, i, NULL); } @@ -845,7 +845,7 @@ _efl_ui_focus_manager_calc_unregister(Eo *obj EINA_UNUSED, Efl_Ui_Focus_Manager_ } //add all neighbors of the node to the dirty list - for(int i = EFL_UI_FOCUS_DIRECTION_UP; i < NODE_DIRECTIONS_COUNT; i++) + for(int i = EFL_UI_FOCUS_DIRECTION_UP; i < EFL_UI_FOCUS_DIRECTION_LAST; i++) { Node *partner; Eina_List *n; @@ -949,7 +949,7 @@ _iterator_next(Border_Elements_Iterator *it, void **data) EINA_ITERATOR_FOREACH(it->real_iterator, node) { - for(int i = EFL_UI_FOCUS_DIRECTION_UP ;i < NODE_DIRECTIONS_COUNT; i++) + for(int i = EFL_UI_FOCUS_DIRECTION_UP ;i < EFL_UI_FOCUS_DIRECTION_LAST; i++) { if (node->type != NODE_TYPE_ONLY_LOGICAL && !DIRECTION_ACCESS(node, i).partners) |