#include <stdlib.h>
#include <stdio.h>
#include <math.h>
#include <float.h> // Is it used ?

#include "include/initialisation.h"
#include "include/function.h"
#include "include/creation.h"
#include "include/make.h"

#include "../include/colors.h"
#include "include/cnn.h"

// Augmente les dimensions de l'image d'entrée
#define PADDING_INPUT 2

int will_be_drop(int dropout_prob) {
    return (rand() % 100) < dropout_prob;
}

void write_image_in_network_32(int** image, int height, int width, float** input) {
    int padding = (32 - height)/2;
    for (int i=0; i < padding; i++) {
        for (int j=0; j < 32; j++) {
            input[i][j] = 0.;
            input[31-i][j] = 0.;
            input[j][i] = 0.;
            input[j][31-i] = 0.;
        }
    }

    for (int i=0; i < width; i++) {
        for (int j=0; j < height; j++) {
            input[i+2][j+2] = (float)image[i][j] / 255.0f;
        }
    }
}

void forward_propagation(Network* network) {
    int activation, input_depth, input_width, output_depth, output_width;
    int n = network->size;
    float*** input;
    float*** output;
    float*** output_a;
    Kernel* k_i;
    for (int i=0; i < n-1; i++) {
        // Transférer les informations de 'input' à 'output'
        k_i = network->kernel[i];
        output_a = network->input_z[i+1];
        input = network->input[i];
        input_depth = network->depth[i];
        input_width = network->width[i];
        output = network->input[i+1];
        output_depth = network->depth[i+1];
        output_width = network->width[i+1];
        activation = k_i->activation;

        if (k_i->cnn) { // Convolution
            make_convolution(k_i->cnn, input, output, output_width);
            copy_input_to_input_z(output, output_a, output_depth, output_width, output_width);
            choose_apply_function_matrix(activation, output, output_depth, output_width);
        }
        else if (k_i->nn) { // Full connection
            if (input_depth==1) { // Vecteur -> Vecteur
                make_dense(k_i->nn, input[0][0], output[0][0], input_width, output_width);
            } else { // Matrice -> Vecteur
                make_dense_linearised(k_i->nn, input, output[0][0], input_depth, input_width, output_width);
            }
            copy_input_to_input_z(output, output_a, 1, 1, output_width);
            choose_apply_function_vector(activation, output, output_width);
        }
        else { // Pooling
            if (n-2==i) {
                printf("Le réseau ne peut pas finir par une pooling layer\n");
                return;
            } else { // Pooling sur une matrice
                make_average_pooling(input, output, activation/100, output_depth, output_width);
            }
            copy_input_to_input_z(output, output_a, output_depth, output_width, output_width);
        }
    }
}

void backward_propagation(Network* network, float wanted_number) {
    printf_warning("Appel de backward_propagation, incomplet\n");
    float* wanted_output = generate_wanted_output(wanted_number);
    int n = network->size;
    int activation, input_depth, input_width, output_depth, output_width;
    float*** input;
    float*** output;
    Kernel* k_i;
    Kernel* k_i_1;
    // rms_backward(network->input[n-1][0][0], wanted_output); // Backward sur la dernière colonne

    for (int i=n-3; i >= 0; i--) {
        // Modifie 'k_i' à partir d'une comparaison d'informations entre 'input' et 'output'
        k_i = network->kernel[i];
        k_i_1 = network->kernel[i+1];
        input = network->input[i];
        input_depth = network->depth[i];
        input_width = network->width[i];
        output = network->input[i+1];
        output_depth = network->depth[i+1];
        output_width = network->width[i+1];
        activation = k_i->activation;

        
        if (k_i->cnn) { // Convolution

        } else if (k_i->nn) { // Full connection
            if (input_depth==1) { // Vecteur -> Vecteur

            } else { // Matrice -> vecteur

            }
        } else { // Pooling
            // backward_2d_pooling(input, output, input_width, output_width, input_depth) // Depth pour input et output a la même valeur
        }
    }
    free(wanted_output);
}

void copy_input_to_input_z(float*** output, float*** output_a, int output_depth, int output_rows, int output_columns) {
    for (int i=0; i<output_depth; i++) {
        for (int j=0; j<output_rows; j++) {
            for (int k=0; k<output_columns; k++) {
                output_a[i][j][k] = output[i][j][k];
            }
        }
    }
}

void update_weights(Network* network) {
    int n = network->size;
    int input_depth, input_width, output_depth, output_width;
    Kernel* k_i;
    Kernel* k_i_1;
    for (int i=0; i<(n-1); i++) {
        k_i = network->kernel[i];
        k_i_1 = network->kernel[i+1];
        input_depth = network->depth[i];
        input_width = network->width[i];
        output_depth = network->depth[i+1];
        output_width = network->width[i+1];

        if (k_i->cnn) { // Convolution
            Kernel_cnn* cnn = k_i_1->cnn;
            int k_size = cnn->k_size;
            for (int a=0; a<input_depth; a++) {
                for (int b=0; b<output_depth; b++) {
                    for (int c=0; c<k_size; c++) {
                        for (int d=0; d<k_size; d++) {
                            cnn->w[a][b][c][d] += cnn->d_w[a][b][c][d];
                        }
                    }
                }
            }
        } else if (k_i->nn) { // Full connection
            if (input_depth==1) { // Vecteur -> Vecteur
                Kernel_nn* nn = k_i_1->nn;
                for (int a=0; a<input_width; a++) {
                    for (int b=0; b<output_width; b++) {
                        nn->weights[a][b] += nn->d_weights[a][b];
                    }
                }
            } else { // Matrice -> vecteur
                Kernel_nn* nn = k_i_1->nn;
                int input_size = input_width*input_width*input_depth;
                for (int a=0; a<input_size; a++) {
                    for (int b=0; b<output_width; b++) {
                        nn->weights[a][b] += nn->d_weights[a][b];
                    }
                }
            }
        } else { // Pooling
            (void)0; // Ne rien faire pour la couche pooling
        }
    }
}

void update_bias(Network* network) {
    int n = network->size;
    int output_width, output_depth;
    Kernel* k_i;
    Kernel* k_i_1;
    for (int i=0; i<(n-1); i++) {
        k_i = network->kernel[i];
        k_i_1 = network->kernel[i+1];
        output_width = network->width[i+1];
        output_depth = network->depth[i+1];

        if (k_i->cnn) { // Convolution
            Kernel_cnn* cnn = k_i_1->cnn;
            for (int a=0; a<output_depth; a++) {
                for (int b=0; b<output_width; b++) {
                    for (int c=0; c<output_width; c++) {
                        cnn->bias[a][b][c] += cnn->d_bias[a][b][c];
                    }
                }
            }
        } else if (k_i->nn) { // Full connection
            Kernel_nn* nn = k_i_1->nn;
            for (int a=0; a<output_width; a++) {
                nn->bias[a] += nn->d_bias[a];
            }
        } else { // Pooling
            (void)0; // Ne rien faire pour la couche pooling
        }
    }
}

float compute_mean_squared_error(float* output, float* wanted_output, int len) {
    if (len==0) {
        printf("Erreur MSE: la longueur de la sortie est de 0 -> division par 0 impossible\n");
        return 0.;
    }
    float loss=0.;
    for (int i=0; i < len ; i++) {
        loss += (output[i]-wanted_output[i])*(output[i]-wanted_output[i]);
    }
    return loss/len;
}

float compute_cross_entropy_loss(float* output, float* wanted_output, int len) {
    float loss=0.;
    for (int i=0; i < len ; i++) {
        if (wanted_output[i]==1) {
            if (output[i]==0.) {
                loss -= log(FLT_EPSILON);
            }
            else {
                loss -= log(output[i]);
            }
        }
    }
    return loss;
}
                
float* generate_wanted_output(float wanted_number) {
    float* wanted_output = (float*)malloc(sizeof(float)*10);
    for (int i=0; i < 10; i++) {
        if (i==wanted_number) {
            wanted_output[i]=1;
        }
        else {
            wanted_output[i]=0;
        }
    }
    return wanted_output;
}