Debug information improvements
This commit is contained in:
parent
dc4d4aba24
commit
6e1129cb6b
|
@ -284,7 +284,7 @@ struct ASTNode* ParsePrecedenceASTNode(int PreviousTokenPrecedence) {
|
||||||
RightTemp = NULL;
|
RightTemp = NULL;
|
||||||
LeftTemp = NULL;
|
LeftTemp = NULL;
|
||||||
} else {
|
} else {
|
||||||
printf("\t\tAttempting to handle a %d in Binary Expression parsing\r\n", CurrentFile->CurrentSymbol.type);
|
printf("\t\tAttempting to handle a %s in Binary Expression parsing\r\n", TokenNames[CurrentFile->CurrentSymbol.type]);
|
||||||
LeftNode->RVal = 1;
|
LeftNode->RVal = 1;
|
||||||
RightNode->RVal = 1;
|
RightNode->RVal = 1;
|
||||||
|
|
||||||
|
@ -392,6 +392,7 @@ struct ASTNode* ParseExpressionList(int terminate) {
|
||||||
while (CurrentFile->CurrentSymbol.type != terminate) {
|
while (CurrentFile->CurrentSymbol.type != terminate) {
|
||||||
// TODO: for(int x = 0;
|
// TODO: for(int x = 0;
|
||||||
Child = ParsePrecedenceASTNode(0);
|
Child = ParsePrecedenceASTNode(0);
|
||||||
|
printf("\nFunction parameter %d is type %s.\n", Count, TypeNames(Child->ExprType));
|
||||||
Count++;
|
Count++;
|
||||||
Tree = ConstructASTNode(OP_COMP, PointerTo(RET_VOID), Tree, NULL, Child, NULL, Count);
|
Tree = ConstructASTNode(OP_COMP, PointerTo(RET_VOID), Tree, NULL, Child, NULL, Count);
|
||||||
|
|
||||||
|
|
|
@ -17,7 +17,7 @@
|
||||||
*/
|
*/
|
||||||
|
|
||||||
int TypeIsInt(int Type) {
|
int TypeIsInt(int Type) {
|
||||||
printf("\tComparing type %d.\n", Type);
|
printf("\tComparing type %s.\n", TypeNames(Type));
|
||||||
return ( ((Type & 0xf) == 0) && (Type >= RET_CHAR && Type <= RET_LONG));
|
return ( ((Type & 0xf) == 0) && (Type >= RET_CHAR && Type <= RET_LONG));
|
||||||
}
|
}
|
||||||
|
|
||||||
|
@ -96,7 +96,7 @@ char* TypeNames(int Type) {
|
||||||
break;
|
break;
|
||||||
};
|
};
|
||||||
if (TypeIsPtr(Type)) memcpy((void*) ((size_t) TypeBuffer + 4), "Ptr", 3);
|
if (TypeIsPtr(Type)) memcpy((void*) ((size_t) TypeBuffer + 4), "Ptr", 3);
|
||||||
else memcpy((void*) ((size_t) TypeBuffer + 4), " ", 3);
|
else memcpy((void*) ((size_t) TypeBuffer + 4), "\0", 1);
|
||||||
return TypeBuffer;
|
return TypeBuffer;
|
||||||
|
|
||||||
}
|
}
|
||||||
|
@ -202,7 +202,7 @@ struct ASTNode* MutateType(struct ASTNode* Tree, int RightType, int Operation) {
|
||||||
LeftType = Tree->ExprType;
|
LeftType = Tree->ExprType;
|
||||||
|
|
||||||
|
|
||||||
printf("\tCalculating compatibility between ltype %d and rtype %d\r\n", LeftType, RightType);
|
printf("\tCalculating compatibility between ltype %s and rtype %s\r\n", TypeNames(LeftType), TypeNames(RightType));
|
||||||
if (TypeIsInt(LeftType) && TypeIsInt(RightType)) {
|
if (TypeIsInt(LeftType) && TypeIsInt(RightType)) {
|
||||||
|
|
||||||
// Short-circuit for valid types
|
// Short-circuit for valid types
|
||||||
|
|
Loading…
Reference in New Issue
Block a user