Experiments/libabacus
1
0
Fork 0
Code Issues 4 Pull Requests Releases Wiki Activity

Remove currently unused node types from the tree code.

Browse Source
This commit is contained in:
Danila Fedorin
2018-02-18 19:42:54 -08:00
parent 12660b1e4a
commit 96b2dc234f
2 changed files with 4 additions and 18 deletions
Download Patch File Download Diff File Expand all files Collapse all files

10
src/tree.c
View File

@@ -4,10 +4,7 @@
int _tree_has_vector(libab_tree* tree) {
return tree->variant == BASE || tree->variant == OP ||
tree->variant == UNARY_OP || tree->variant == BLOCK ||
tree->variant == FUN || tree->variant == IF ||
tree->variant == WHILE || tree->variant == DOWHILE ||
tree->variant == FOR || tree->variant == CALL ||
tree->variant == RETURN;
tree->variant == IF;
}
void libab_tree_free(libab_tree* tree) {
@@ -16,9 +13,8 @@ void libab_tree_free(libab_tree* tree) {
if(_tree_has_vector(tree)) {
free_vector = 1;
}
if(tree->variant == ID || tree->variant == STR || tree->variant == NUM ||
tree->variant == KW || tree->variant == OP || tree->variant == UNARY_OP ||
tree->variant == FUN || tree->variant == CALL) {
if(tree->variant == ID || tree->variant == NUM ||
tree->variant == OP || tree->variant == UNARY_OP) {
free_string = 1;
}
if(free_string) free(tree->string_value);