summaryrefslogtreecommitdiff
diff options
context:
space:
mode:
Diffstat
-rw-r--r--Makefile4
-rw-r--r--code/main.felan48
-rw-r--r--src/compiler/ast-tree.c145
-rw-r--r--src/compiler/ast-tree.h9
-rw-r--r--src/runner/runner.c61
5 files changed, 155 insertions, 112 deletions
diff --git a/Makefile b/Makefile
index 3a5a9a6..a1af4d8 100644
--- a/Makefile
+++ b/Makefile
@@ -19,9 +19,9 @@ NC := \033[0m
INC_DIRS := $(SRC_DIR)
INC_FLAGS := $(addprefix -I,$(INC_DIRS))
-CFLAGS := $(INC_FLAGS) -Wall -Wextra -std=gnu23 -O3
+# CFLAGS := $(INC_FLAGS) -Wall -Wextra -std=gnu23 -O3
# CFLAGS := $(INC_FLAGS) -Wall -Wextra -std=gnu23 -Oz
-# CFLAGS := $(INC_FLAGS) -Wall -Wextra -std=gnu23 -g
+CFLAGS := $(INC_FLAGS) -Wall -Wextra -std=gnu23 -g
EXEC_FILE := $(BUILD_DIR)/$(PROJECT_NAME)
diff --git a/code/main.felan b/code/main.felan
index 583c05d..79a7dd2 100644
--- a/code/main.felan
+++ b/code/main.felan
@@ -17,33 +17,9 @@ long_double :: f128;
usize :: u64;
-t :: f(7);
-
-f :: (a:i64)->i64{
- if a == 0 || a == 1
- return 0;
- else
- return f(a-1)+f(a-2);
-};
-
main :: () -> void {
- a :i64 = 12;
- b :u64 = 34;
- print_rev(t);
- print_rev(a);
- print_rev(b);
- print_rev();
- c : ()->void = a;
- c();
- a();
-};
-
-a :: () -> void {
- putc 'x';
-};
-
-print_rev :: ()-> void {
- putc 'c';
+ a := 2;
+ println(@typeOf(a) == i64);
};
print_rev :: (value:u64) -> void {
@@ -65,3 +41,23 @@ print_rev :: (value:i64) -> void {
value != 0;
} {}
};
+
+print :: (value:bool) -> void {
+ if value {
+ putc 't';
+ putc 'r';
+ putc 'u';
+ putc 'e';
+ } else {
+ putc 'f';
+ putc 'a';
+ putc 'l';
+ putc 's';
+ putc 'e';
+ }
+};
+
+println :: (value:bool) -> void {
+ print(value);
+ putc '\n';
+};
diff --git a/src/compiler/ast-tree.c b/src/compiler/ast-tree.c
index 4956ec0..04f8d54 100644
--- a/src/compiler/ast-tree.c
+++ b/src/compiler/ast-tree.c
@@ -174,6 +174,7 @@ const char *AST_TREE_TOKEN_STRINGS[] = {
const char *AST_TREE_BUILTIN_TOKEN_STRINGS[] = {
"cast",
+ "typeOf",
};
void astTreePrint(const AstTree *tree, int indent) {
@@ -391,12 +392,12 @@ void astTreePrint(const AstTree *tree, int indent) {
for (int i = 0; i < indent; ++i)
printf(" ");
printf("left=\n");
- astTreePrint(&metadata->left, indent + 1);
+ astTreePrint(metadata->left, indent + 1);
printf(",\n");
for (int i = 0; i < indent; ++i)
printf(" ");
printf("right=\n");
- astTreePrint(&metadata->right, indent + 1);
+ astTreePrint(metadata->right, indent + 1);
printf("\n");
for (int i = 0; i < indent; ++i)
printf(" ");
@@ -492,7 +493,6 @@ void astTreePrint(const AstTree *tree, int indent) {
goto RETURN_SUCCESS;
case AST_TREE_TOKEN_NONE:
}
-
UNREACHABLE;
RETURN_SUCCESS:
@@ -680,8 +680,8 @@ void astTreeDestroy(AstTree tree) {
case AST_TREE_TOKEN_OPERATOR_GREATER_OR_EQUAL:
case AST_TREE_TOKEN_OPERATOR_SMALLER_OR_EQUAL: {
AstTreeInfix *metadata = tree.metadata;
- astTreeDestroy(metadata->left);
- astTreeDestroy(metadata->right);
+ astTreeDelete(metadata->left);
+ astTreeDelete(metadata->right);
free(metadata);
}
return;
@@ -904,14 +904,11 @@ AstTree *copyAstTreeBack(AstTree *tree, AstTreeVariables oldVariables[],
case AST_TREE_TOKEN_OPERATOR_SMALLER_OR_EQUAL: {
AstTreeInfix *metadata = tree->metadata;
AstTreeInfix *new_metadata = a404m_malloc(sizeof(*new_metadata));
- AstTree *left = copyAstTreeBack(&metadata->left, oldVariables, newVariables,
- variables_size);
- AstTree *right = copyAstTreeBack(&metadata->right, oldVariables,
- newVariables, variables_size);
- new_metadata->left = *left;
- new_metadata->right = *right;
- free(left);
- free(right);
+
+ new_metadata->left = copyAstTreeBack(
+ metadata->left, oldVariables, newVariables, variables_size);
+ new_metadata->right = copyAstTreeBack(metadata->right, oldVariables,
+ newVariables, variables_size);
return newAstTree(
tree->token, new_metadata,
copyAstTreeBack(tree->type, oldVariables, newVariables, variables_size),
@@ -1985,11 +1982,8 @@ AstTree *astTreeParseBinaryOperator(ParserNode *parserNode,
AstTreeInfix *metadata = a404m_malloc(sizeof(*metadata));
- metadata->left = *left;
- metadata->right = *right;
-
- free(left);
- free(right);
+ metadata->left = left;
+ metadata->right = right;
return newAstTree(token, metadata, NULL, parserNode->str_begin,
parserNode->str_end);
@@ -2024,11 +2018,8 @@ AstTree *astTreeParseOperateAssignOperator(ParserNode *parserNode,
AstTreeInfix *metadata = a404m_malloc(sizeof(*metadata));
- metadata->left = *left;
- metadata->right = *right;
-
- free(left);
- free(right);
+ metadata->left = left;
+ metadata->right = right;
AstTreeInfix *assignMetadata = a404m_malloc(sizeof(*assignMetadata));
@@ -2036,11 +2027,8 @@ AstTree *astTreeParseOperateAssignOperator(ParserNode *parserNode,
AstTree *assignRight = newAstTree(token, metadata, NULL,
parserNode->str_begin, parserNode->str_end);
- assignMetadata->left = *assignLeft;
- assignMetadata->right = *assignRight;
-
- free(assignLeft);
- free(assignRight);
+ assignMetadata->left = assignLeft;
+ assignMetadata->right = assignRight;
return newAstTree(AST_TREE_TOKEN_OPERATOR_ASSIGN, assignMetadata, NULL,
parserNode->str_begin, parserNode->str_end);
@@ -2743,7 +2731,7 @@ AstTree *makeTypeOf(AstTree *value) {
case AST_TREE_TOKEN_OPERATOR_DIVIDE:
case AST_TREE_TOKEN_OPERATOR_MODULO: {
AstTreeInfix *metadata = value->metadata;
- return copyAstTree(metadata->left.type);
+ return copyAstTree(metadata->left->type);
}
case AST_TREE_TOKEN_OPERATOR_LOGICAL_NOT:
case AST_TREE_TOKEN_OPERATOR_LOGICAL_AND:
@@ -3354,7 +3342,8 @@ bool setTypesFunction(AstTree *tree, AstTreeSetTypesHelper helper) {
}
for (size_t i = 0; i < metadata->scope.expressions_size; ++i) {
- if (!setAllTypes(metadata->scope.expressions[i], newHelper, metadata, NULL)) {
+ if (!setAllTypes(metadata->scope.expressions[i], newHelper, metadata,
+ NULL)) {
return false;
}
}
@@ -3548,7 +3537,7 @@ bool setTypesVariable(AstTree *tree, AstTreeSetTypesHelper helper,
continue;
} else if (variable != NULL && variable_index == index) {
printError(tree->str_begin, tree->str_end,
- "Multiple candidate found");
+ "Multiple candidates found");
goto RETURN_ERROR;
}
}
@@ -3570,7 +3559,7 @@ bool setTypesVariable(AstTree *tree, AstTreeSetTypesHelper helper,
continue;
} else if (variable != NULL && variable_index == index) {
printError(tree->str_begin, tree->str_end,
- "Multiple candidate found");
+ "Multiple candidates found");
goto RETURN_ERROR;
}
}
@@ -3648,7 +3637,7 @@ bool setTypesVariable(AstTree *tree, AstTreeSetTypesHelper helper,
continue;
} else if (variable != NULL && variable_index == index) {
printError(tree->str_begin, tree->str_end,
- "Multiple candidate found");
+ "Multiple candidates found");
goto RETURN_ERROR;
}
}
@@ -3685,14 +3674,14 @@ bool setTypesOperatorAssign(AstTree *tree, AstTreeSetTypesHelper helper) {
// TODO: check left one for being left value
if (!setTypesAstInfix(infix, helper)) {
return false;
- } else if (!typeIsEqual(infix->left.type, infix->right.type)) {
+ } else if (!typeIsEqual(infix->left->type, infix->right->type)) {
printError(tree->str_begin, tree->str_end, "Type mismatch");
return false;
- } else if (isConst(&infix->left)) {
+ } else if (isConst(infix->left)) {
printError(tree->str_begin, tree->str_end, "Constants can't be assigned");
return false;
} else {
- tree->type = copyAstTree(infix->left.type);
+ tree->type = copyAstTree(infix->left->type);
return true;
}
}
@@ -3701,11 +3690,11 @@ bool setTypesOperatorInfix(AstTree *tree, AstTreeSetTypesHelper helper) {
AstTreeInfix *infix = tree->metadata;
if (!setTypesAstInfix(infix, helper)) {
return false;
- } else if (!typeIsEqual(infix->left.type, infix->right.type)) {
+ } else if (!typeIsEqual(infix->left->type, infix->right->type)) {
printError(tree->str_begin, tree->str_end, "Type mismatch");
return false;
} else {
- tree->type = copyAstTree(infix->left.type);
+ tree->type = copyAstTree(infix->left->type);
return true;
}
}
@@ -3715,7 +3704,7 @@ bool setTypesOperatorInfixWithRet(AstTree *tree, AstTree *retType,
AstTreeInfix *infix = tree->metadata;
if (!setTypesAstInfix(infix, helper)) {
return false;
- } else if (!typeIsEqual(infix->left.type, infix->right.type)) {
+ } else if (!typeIsEqual(infix->left->type, infix->right->type)) {
printError(tree->str_begin, tree->str_end, "Type mismatch");
return false;
} else {
@@ -3731,16 +3720,7 @@ bool setTypesOperatorInfixWithRetAndLooking(AstTree *tree, AstTree *lookingType,
.lookingType = lookingType,
.dependencies = _helper.dependencies,
};
- AstTreeInfix *infix = tree->metadata;
- if (!setTypesAstInfix(infix, helper)) {
- return false;
- } else if (!typeIsEqual(infix->left.type, infix->right.type)) {
- printError(tree->str_begin, tree->str_end, "Type mismatch");
- return false;
- } else {
- tree->type = retType;
- return true;
- }
+ return setTypesOperatorInfixWithRet(tree, retType, helper);
}
bool setTypesOperatorUnary(AstTree *tree, AstTreeSetTypesHelper helper) {
@@ -4123,6 +4103,67 @@ bool setTypesBuiltin(AstTree *tree, AstTreeSetTypesHelper helper,
}
return false;
}
+ case AST_TREE_BUILTIN_TOKEN_TYPE_OF: {
+ if (functionCall->parameters_size == 1) {
+ AstTree *variable = NULL;
+
+ static char VARIABLE_STR[] = "variable";
+ static const size_t VARIABLE_STR_SIZE =
+ sizeof(VARIABLE_STR) / sizeof(*VARIABLE_STR) - sizeof(*VARIABLE_STR);
+
+ for (size_t i = 0; i < functionCall->parameters_size; ++i) {
+ AstTreeFunctionCallParam param = functionCall->parameters[i];
+ const size_t param_name_size = param.nameEnd - param.nameBegin;
+
+ if (param_name_size == 0) {
+ if (variable == NULL) {
+ variable = param.value;
+ } else {
+ printError(param.value->str_begin, param.value->str_end,
+ "Bad paramter");
+ return false;
+ }
+ } else if (param_name_size == VARIABLE_STR_SIZE &&
+ strncmp(param.nameBegin, VARIABLE_STR, VARIABLE_STR_SIZE) ==
+ 0 &&
+ variable == NULL) {
+ variable = param.value;
+ } else {
+ printError(param.value->str_begin, param.value->str_end,
+ "Bad paramter");
+ return false;
+ }
+ }
+
+ if (variable == NULL) {
+ return false;
+ }
+
+ AstTreeTypeFunction *type_metadata = a404m_malloc(sizeof(*type_metadata));
+ type_metadata->arguments_size = 1;
+ type_metadata->arguments = a404m_malloc(
+ type_metadata->arguments_size * sizeof(*type_metadata->arguments));
+
+ type_metadata->returnType = copyAstTree(&AST_TREE_TYPE_TYPE);
+
+ type_metadata->arguments[0] = (AstTreeTypeFunctionArgument){
+ .type = copyAstTree(variable->type),
+ .name_begin = VARIABLE_STR,
+ .name_end = VARIABLE_STR + VARIABLE_STR_SIZE,
+ .str_begin = NULL,
+ .str_end = NULL,
+ };
+
+ tree->type = newAstTree(AST_TREE_TOKEN_TYPE_FUNCTION, type_metadata,
+ &AST_TREE_TYPE_TYPE, NULL, NULL);
+ return true;
+ } else {
+ printError(tree->str_begin, tree->str_end,
+ "Too many or too few arguments");
+ return false;
+ }
+ return false;
+ }
case AST_TREE_BUILTIN_TOKEN__SIZE__:
}
UNREACHABLE;
@@ -4134,11 +4175,11 @@ bool setTypesAstInfix(AstTreeInfix *infix, AstTreeSetTypesHelper _helper) {
.dependencies = _helper.dependencies,
};
- if (!setAllTypes(&infix->left, helper, NULL, NULL)) {
+ if (!setAllTypes(infix->left, helper, NULL, NULL)) {
return false;
}
- helper.lookingType = infix->left.type;
+ helper.lookingType = infix->left->type;
- return setAllTypes(&infix->right, helper, NULL, NULL);
+ return setAllTypes(infix->right, helper, NULL, NULL);
}
diff --git a/src/compiler/ast-tree.h b/src/compiler/ast-tree.h
index e03405e..1605328 100644
--- a/src/compiler/ast-tree.h
+++ b/src/compiler/ast-tree.h
@@ -188,8 +188,8 @@ typedef struct AstTreeObject {
typedef AstTree AstTreeSingleChild;
typedef struct AstTreeInfix {
- AstTree left;
- AstTree right;
+ AstTree *left;
+ AstTree *right;
} AstTreeInfix;
typedef struct AstTreeReturn {
@@ -237,6 +237,7 @@ typedef struct AstTreeAccess {
typedef enum AstTreeBuiltinToken {
AST_TREE_BUILTIN_TOKEN_CAST,
+ AST_TREE_BUILTIN_TOKEN_TYPE_OF,
AST_TREE_BUILTIN_TOKEN__SIZE__,
} AstTreeBuiltinToken;
@@ -272,8 +273,8 @@ AstTreeRoot *makeAstTree(ParserNode *parsedRoot);
bool pushVariable(AstTreeHelper *helper, AstTreeVariables *variables,
AstTreeVariable *variable);
-AstTreeVariableCandidates *getAllVariables(AstTreeHelper *helper, char *name_begin,
- char *name_end);
+AstTreeVariableCandidates *getAllVariables(AstTreeHelper *helper,
+ char *name_begin, char *name_end);
AstTree *astTreeParse(ParserNode *parserNode, AstTreeHelper *helper);
AstTree *astTreeParseFunction(ParserNode *parserNode, AstTreeHelper *helper);
diff --git a/src/runner/runner.c b/src/runner/runner.c
index 57d10fa..2f4b32f 100644
--- a/src/runner/runner.c
+++ b/src/runner/runner.c
@@ -344,6 +344,11 @@ AstTree *runAstTreeBuiltin(AstTree *tree, AstTreeFunctionCallParam *arguments,
}
goto RETURN;
}
+ case AST_TREE_BUILTIN_TOKEN_TYPE_OF: {
+ AstTree *variable = args.data[0];
+ ret = copyAstTree(variable->type);
+ }
+ goto RETURN;
case AST_TREE_BUILTIN_TOKEN__SIZE__:
}
UNREACHABLE;
@@ -384,13 +389,13 @@ AstTree *runExpression(AstTree *expr, bool *shouldRet, bool isLeft) {
}
case AST_TREE_TOKEN_OPERATOR_ASSIGN: {
AstTreeInfix *metadata = expr->metadata;
- AstTree *l = runExpression(&metadata->left, shouldRet, true);
+ AstTree *l = runExpression(metadata->left, shouldRet, true);
if (l->token != AST_TREE_TOKEN_VARIABLE) {
UNREACHABLE;
}
AstTreeVariable *left = l->metadata;
runnerVariableSetValue(left,
- runExpression(&metadata->right, shouldRet, false));
+ runExpression(metadata->right, shouldRet, false));
astTreeDelete(l);
return copyAstTree(left->value);
}
@@ -531,8 +536,8 @@ AstTree *runExpression(AstTree *expr, bool *shouldRet, bool isLeft) {
}
case AST_TREE_TOKEN_OPERATOR_SUM: {
AstTreeInfix *metadata = expr->metadata;
- AstTree *left = runExpression(&metadata->left, shouldRet, false);
- AstTree *right = runExpression(&metadata->right, shouldRet, false);
+ AstTree *left = runExpression(metadata->left, shouldRet, false);
+ AstTree *right = runExpression(metadata->right, shouldRet, false);
if (left->type == &AST_TREE_U64_TYPE && right->type == &AST_TREE_U64_TYPE) {
doOperation(left, right, +, AstTreeInt, u64);
@@ -580,8 +585,8 @@ AstTree *runExpression(AstTree *expr, bool *shouldRet, bool isLeft) {
}
case AST_TREE_TOKEN_OPERATOR_SUB: {
AstTreeInfix *metadata = expr->metadata;
- AstTree *left = runExpression(&metadata->left, shouldRet, false);
- AstTree *right = runExpression(&metadata->right, shouldRet, false);
+ AstTree *left = runExpression(metadata->left, shouldRet, false);
+ AstTree *right = runExpression(metadata->right, shouldRet, false);
if (left->type == &AST_TREE_U64_TYPE && right->type == &AST_TREE_U64_TYPE) {
doOperation(left, right, -, AstTreeInt, u64);
@@ -629,8 +634,8 @@ AstTree *runExpression(AstTree *expr, bool *shouldRet, bool isLeft) {
}
case AST_TREE_TOKEN_OPERATOR_MULTIPLY: {
AstTreeInfix *metadata = expr->metadata;
- AstTree *left = runExpression(&metadata->left, shouldRet, false);
- AstTree *right = runExpression(&metadata->right, shouldRet, false);
+ AstTree *left = runExpression(metadata->left, shouldRet, false);
+ AstTree *right = runExpression(metadata->right, shouldRet, false);
if (left->type == &AST_TREE_U64_TYPE && right->type == &AST_TREE_U64_TYPE) {
doOperation(left, right, *, AstTreeInt, u64);
@@ -678,8 +683,8 @@ AstTree *runExpression(AstTree *expr, bool *shouldRet, bool isLeft) {
}
case AST_TREE_TOKEN_OPERATOR_DIVIDE: {
AstTreeInfix *metadata = expr->metadata;
- AstTree *left = runExpression(&metadata->left, shouldRet, false);
- AstTree *right = runExpression(&metadata->right, shouldRet, false);
+ AstTree *left = runExpression(metadata->left, shouldRet, false);
+ AstTree *right = runExpression(metadata->right, shouldRet, false);
if (left->type == &AST_TREE_U64_TYPE && right->type == &AST_TREE_U64_TYPE) {
doOperation(left, right, /, AstTreeInt, u64);
@@ -727,8 +732,8 @@ AstTree *runExpression(AstTree *expr, bool *shouldRet, bool isLeft) {
}
case AST_TREE_TOKEN_OPERATOR_MODULO: {
AstTreeInfix *metadata = expr->metadata;
- AstTree *left = runExpression(&metadata->left, shouldRet, false);
- AstTree *right = runExpression(&metadata->right, shouldRet, false);
+ AstTree *left = runExpression(metadata->left, shouldRet, false);
+ AstTree *right = runExpression(metadata->right, shouldRet, false);
if (left->type == &AST_TREE_U64_TYPE && right->type == &AST_TREE_U64_TYPE) {
doOperation(left, right, %, AstTreeInt, u64);
@@ -763,8 +768,8 @@ AstTree *runExpression(AstTree *expr, bool *shouldRet, bool isLeft) {
}
case AST_TREE_TOKEN_OPERATOR_EQUAL: {
AstTreeInfix *metadata = expr->metadata;
- AstTree *left = runExpression(&metadata->left, shouldRet, false);
- AstTree *right = runExpression(&metadata->right, shouldRet, false);
+ AstTree *left = runExpression(metadata->left, shouldRet, false);
+ AstTree *right = runExpression(metadata->right, shouldRet, false);
if (left->type == &AST_TREE_U64_TYPE && right->type == &AST_TREE_U64_TYPE) {
doLogicalOperation(left, right, ==, AstTreeInt, u64);
@@ -818,8 +823,8 @@ AstTree *runExpression(AstTree *expr, bool *shouldRet, bool isLeft) {
}
case AST_TREE_TOKEN_OPERATOR_NOT_EQUAL: {
AstTreeInfix *metadata = expr->metadata;
- AstTree *left = runExpression(&metadata->left, shouldRet, false);
- AstTree *right = runExpression(&metadata->right, shouldRet, false);
+ AstTree *left = runExpression(metadata->left, shouldRet, false);
+ AstTree *right = runExpression(metadata->right, shouldRet, false);
if (left->type == &AST_TREE_U64_TYPE && right->type == &AST_TREE_U64_TYPE) {
doLogicalOperation(left, right, !=, AstTreeInt, u64);
@@ -873,8 +878,8 @@ AstTree *runExpression(AstTree *expr, bool *shouldRet, bool isLeft) {
}
case AST_TREE_TOKEN_OPERATOR_GREATER: {
AstTreeInfix *metadata = expr->metadata;
- AstTree *left = runExpression(&metadata->left, shouldRet, false);
- AstTree *right = runExpression(&metadata->right, shouldRet, false);
+ AstTree *left = runExpression(metadata->left, shouldRet, false);
+ AstTree *right = runExpression(metadata->right, shouldRet, false);
if (left->type == &AST_TREE_U64_TYPE && right->type == &AST_TREE_U64_TYPE) {
doLogicalOperation(left, right, >, AstTreeInt, u64);
@@ -922,8 +927,8 @@ AstTree *runExpression(AstTree *expr, bool *shouldRet, bool isLeft) {
}
case AST_TREE_TOKEN_OPERATOR_SMALLER: {
AstTreeInfix *metadata = expr->metadata;
- AstTree *left = runExpression(&metadata->left, shouldRet, false);
- AstTree *right = runExpression(&metadata->right, shouldRet, false);
+ AstTree *left = runExpression(metadata->left, shouldRet, false);
+ AstTree *right = runExpression(metadata->right, shouldRet, false);
if (left->type == &AST_TREE_U64_TYPE && right->type == &AST_TREE_U64_TYPE) {
doLogicalOperation(left, right, <, AstTreeInt, u64);
@@ -971,8 +976,8 @@ AstTree *runExpression(AstTree *expr, bool *shouldRet, bool isLeft) {
}
case AST_TREE_TOKEN_OPERATOR_GREATER_OR_EQUAL: {
AstTreeInfix *metadata = expr->metadata;
- AstTree *left = runExpression(&metadata->left, shouldRet, false);
- AstTree *right = runExpression(&metadata->right, shouldRet, false);
+ AstTree *left = runExpression(metadata->left, shouldRet, false);
+ AstTree *right = runExpression(metadata->right, shouldRet, false);
if (left->type == &AST_TREE_U64_TYPE && right->type == &AST_TREE_U64_TYPE) {
doLogicalOperation(left, right, >=, AstTreeInt, u64);
@@ -1020,8 +1025,8 @@ AstTree *runExpression(AstTree *expr, bool *shouldRet, bool isLeft) {
}
case AST_TREE_TOKEN_OPERATOR_SMALLER_OR_EQUAL: {
AstTreeInfix *metadata = expr->metadata;
- AstTree *left = runExpression(&metadata->left, shouldRet, false);
- AstTree *right = runExpression(&metadata->right, shouldRet, false);
+ AstTree *left = runExpression(metadata->left, shouldRet, false);
+ AstTree *right = runExpression(metadata->right, shouldRet, false);
if (left->type == &AST_TREE_U64_TYPE && right->type == &AST_TREE_U64_TYPE) {
doLogicalOperation(left, right, <=, AstTreeInt, u64);
@@ -1069,8 +1074,8 @@ AstTree *runExpression(AstTree *expr, bool *shouldRet, bool isLeft) {
}
case AST_TREE_TOKEN_OPERATOR_LOGICAL_AND: {
AstTreeInfix *metadata = expr->metadata;
- AstTree *left = runExpression(&metadata->left, shouldRet, false);
- AstTree *right = runExpression(&metadata->right, shouldRet, false);
+ AstTree *left = runExpression(metadata->left, shouldRet, false);
+ AstTree *right = runExpression(metadata->right, shouldRet, false);
*(AstTreeBool *)left->metadata =
*(AstTreeBool *)left->metadata && *(AstTreeBool *)right->metadata;
@@ -1080,8 +1085,8 @@ AstTree *runExpression(AstTree *expr, bool *shouldRet, bool isLeft) {
}
case AST_TREE_TOKEN_OPERATOR_LOGICAL_OR: {
AstTreeInfix *metadata = expr->metadata;
- AstTree *left = runExpression(&metadata->left, shouldRet, false);
- AstTree *right = runExpression(&metadata->right, shouldRet, false);
+ AstTree *left = runExpression(metadata->left, shouldRet, false);
+ AstTree *right = runExpression(metadata->right, shouldRet, false);
*(AstTreeBool *)left->metadata =
*(AstTreeBool *)left->metadata || *(AstTreeBool *)right->metadata;
generated by cgit v1.2.3 (git 2.39.1) at 2025-04-29 15:57:00 +0000