Update deps

diff --git a/BSDmakefile b/BSDmakefile
index 6aea46ef781b590be0f573a07b085f598c221671..c33c796916d27dfa22bf9b0122cd40667eb4b1d2 100644 (file)
--- a/BSDmakefile
+++ b/BSDmakefile
@@ -112,7 +112,7 @@ stat.o: gmqcc.h opts.def
 test.o: gmqcc.h opts.def
 main.o: gmqcc.h opts.def lexer.h
 lexer.o: gmqcc.h opts.def lexer.h
-parser.o: parser.h gmqcc.h opts.def lexer.h ast.h ir.h intrin.h
+parser.o: parser.h gmqcc.h opts.def lexer.h ast.h ir.h
 code.o: gmqcc.h opts.def
 ast.o: gmqcc.h opts.def ast.h ir.h parser.h lexer.h
 ir.o: gmqcc.h opts.def ir.h

diff --git a/fold.c b/fold.c
index e41fd526f1207aa3894d191efc3f58c896aab8de..bf48ae4593fec977506c8df71d157fc28d18389d 100644 (file)
--- a/fold.c
+++ b/fold.c
@@ -300,7 +300,7 @@ static GMQCC_INLINE ast_expression *fold_op_mul_vec(fold_t *fold, vec3_t vec, as
      * for creating the elided ast binary expression.
      *
      * Consider 'n 0 0' where y, and z need to be tested for 0, and x is
-     * used as the value in a binary operation generating an INSTR_MUL instruction
+     * used as the value in a binary operation generating an INSTR_MUL instruction,
      * to acomplish the indexing of the correct component value we use set[0], set[1], set[2]
      * as x, y, z, where the values of those operations return 'x', 'y', 'z'. Because
      * of how ASCII works we can easily deliniate: