andy/mpc
1
0
Fork 0
Code Issues Pull Requests Actions Packages Projects Releases Wiki Activity

Identation

Browse Source
This commit is contained in:
petermlm
2016-04-19 23:26:20 +01:00
parent e99b35796c
commit 0037648c49
1 changed files with 91 additions and 91 deletions
Download Patch File Download Diff File Expand all files Collapse all files

10
mpc.c
View File

@@ -2893,9 +2893,9 @@ mpc_ast_t *mpc_ast_traverse_next(mpc_ast_trav_t **trav) {
case mpc_ast_trav_order_post:
ret = (*trav)->curr_node;
/* Move up tree to the parent If the parent doesn't have any more
* nodes, then this is the current node. If it does, move down to
* its left most child. Also, free the previous traversal node */
/* Move up tree to the parent If the parent doesn't have any more nodes,
* then this is the current node. If it does, move down to its left most
* child. Also, free the previous traversal node */
to_free = *trav;
*trav = (*trav)->parent;
free(to_free);
@@ -2911,8 +2911,8 @@ mpc_ast_t *mpc_ast_traverse_next(mpc_ast_trav_t **trav) {
break;
}
/* If there are still more children, find the leftmost child from
* this node */
/* If there are still more children, find the leftmost child from this
* node */
while((*trav)->curr_node->children_num > 0) {
n_trav = malloc(sizeof(mpc_ast_trav_t));