From 7d7cd2e3a74c89959be36874bb0f3c32558595bb Mon Sep 17 00:00:00 2001
From: augustin64 <me.git@augustin64.fr>
Date: Fri, 10 Mar 2023 18:20:10 +0100
Subject: [PATCH] Fix FLT_MIN misuses

---
 src/cnn/function.c | 2 +-
 src/cnn/make.c     | 4 ++--
 src/cnn/make.cu    | 4 ++--
 3 files changed, 5 insertions(+), 5 deletions(-)

diff --git a/src/cnn/function.c b/src/cnn/function.c
index 5fba576..7168641 100644
--- a/src/cnn/function.c
+++ b/src/cnn/function.c
@@ -62,7 +62,7 @@ float tanh_derivative(float x) {
 
 
 void apply_softmax_input(float ***input, int depth, int rows, int columns) {
-    float m = FLT_MIN;
+    float m = -FLT_MAX;
     float sum=0;
     for (int i=0; i < depth; i++) {
         for (int j=0; j < rows; j++) {
diff --git a/src/cnn/make.c b/src/cnn/make.c
index bdd657f..665655b 100644
--- a/src/cnn/make.c
+++ b/src/cnn/make.c
@@ -99,7 +99,7 @@ __global__ void make_max_pooling_kernel(float*** input, float*** output, int siz
         return;
     }
 
-    float m = FLT_MIN;
+    float m = -FLT_MAX;
     float temp;
 
     for (int a=0; a < size; a++) {
@@ -129,7 +129,7 @@ void make_max_pooling_cpu(float*** input, float*** output, int size, int output_
     for (int i=0; i < output_depth; i++) {
         for (int j=0; j < output_width; j++) {
             for (int k=0; k < output_width; k++) {
-                m = FLT_MIN;
+                m = -FLT_MAX;
                 for (int a=0; a < size; a++) {
                     for (int b=0; b < size; b++) {
                         m = fmaxf(m, input[i][size*j +a][size*k +b]);
diff --git a/src/cnn/make.cu b/src/cnn/make.cu
index bdd657f..665655b 100644
--- a/src/cnn/make.cu
+++ b/src/cnn/make.cu
@@ -99,7 +99,7 @@ __global__ void make_max_pooling_kernel(float*** input, float*** output, int siz
         return;
     }
 
-    float m = FLT_MIN;
+    float m = -FLT_MAX;
     float temp;
 
     for (int a=0; a < size; a++) {
@@ -129,7 +129,7 @@ void make_max_pooling_cpu(float*** input, float*** output, int size, int output_
     for (int i=0; i < output_depth; i++) {
         for (int j=0; j < output_width; j++) {
             for (int k=0; k < output_width; k++) {
-                m = FLT_MIN;
+                m = -FLT_MAX;
                 for (int a=0; a < size; a++) {
                     for (int b=0; b < size; b++) {
                         m = fmaxf(m, input[i][size*j +a][size*k +b]);