Fix compiler warnings introduced by gcc 13

diff --git a/source/core/bufferable.h b/source/core/bufferable.h
index 6c9832a99f6b49796efb9c0ee032557fdd07096a..b3ebcdd7f6bac3dee4e26ccdc4ca8570c6e75479 100644 (file)
--- a/source/core/bufferable.h
+++ b/source/core/bufferable.h
@@ -2,6 +2,7 @@
 #define MSP_GL_BUFFERABLE_H_
 
 #include <cstddef>
+#include <cstdint>
 #include <msp/core/noncopyable.h>
 #include "buffer.h"
 #include "mspgl_api.h"

diff --git a/source/glsl/resolve.h b/source/glsl/resolve.h
index d592e4efd5a60ddaea72b0533db48474abfe8df8..c014891aff3f11facc490e867b4a028994ec1ca9 100644 (file)
--- a/source/glsl/resolve.h
+++ b/source/glsl/resolve.h
@@ -134,6 +134,7 @@ private:
        virtual void visit(VariableDeclaration &);
        virtual void visit(FunctionDeclaration &);
        virtual void visit(Return &);
+       using TraversingVisitor::visit;
 };
 
 /** Resolves function declarations and calls. */

diff --git a/source/glsl/validate.h b/source/glsl/validate.h
index 3166c39bf9bd304c15067c77984e089fd417b22a..c90a9d757887387fc8b189364f7541abc1771221 100644 (file)
--- a/source/glsl/validate.h
+++ b/source/glsl/validate.h
@@ -91,6 +91,7 @@ private:
        virtual void visit(StructDeclaration &);
        virtual void visit(VariableDeclaration &);
        virtual void visit(FunctionDeclaration &);
+       using Validator::visit;
 };
 
 /** Verifies that there are no unresolved references. */

diff --git a/source/glsl/visitor.h b/source/glsl/visitor.h
index 2503a15e79e33c67c233574270b527ecd9a50e26..0b561b8d1d496032d8e351c1bf6b0f3573f8e3e1 100644 (file)
--- a/source/glsl/visitor.h
+++ b/source/glsl/visitor.h
@@ -72,6 +72,7 @@ public:
        virtual void visit(Iteration &);
        virtual void visit(Passthrough &);
        virtual void visit(Return &);
+       using NodeVisitor::visit;
 };
 
 /** Removes a set of nodes from the syntax tree. */
@@ -96,6 +97,7 @@ private:
        virtual void visit(VariableDeclaration &);
        virtual void visit(FunctionDeclaration &);
        virtual void visit(Iteration &);
+       using TraversingVisitor::visit;
 };
 
 /** Reorders a set of nodes so they appear before another node.  Only nodes