Function ecall_reducemax_zero_grad

sgx_tf_ops/Enclave/Enclave.cpp:5266–5345

    }

void ecall_reducemax_zero_grad(float *input,float *grad,int N,int M,int C,int L,float *output){
    float *x = (float*)malloc(sizeof(float)*N);
    memset(x, 0, sizeof(float)*N);
    for(int j=0;j<N;j++){
        x[j] = 0.0f;
        float sum = input[insert*N+j];
        float c = 0.0f;
        for(int i=0;i<Nt;i++){
            float y = input[indexs[i]*N+j] - c;
            float t = sum + y;
            c = (t - sum) - y;
            sum = t;
        }
        x[j] = sum;
        
    }
    float *x1 = (float*)malloc(sizeof(float)*C*L);
    memset(x1, 0, sizeof(float)*C*L);
    
    for (int i = 0; i < C; i++) {
        for (int j = 0; j < L; j++) {
            float max_val = x[i*L+j];
            for (int k = 1; k < M; k++) {
                max_val = fmaxf(max_val, x[i*L+j+k*C*L]);
            }
            x1[i*L+j] = max_val;
        }
    }

    for (int i = 0; i < C; i++) {
        for (int j = 0; j < L; j++) {
            for (int k = 0; k < M; k++) {
                if(fabs(x[i*L+j+k*C*L]-x1[i*L+j]) < 1e-7f){
                    x[i*L+j+k*C*L] = grad[i*L+j];
		        for(int kk = k+1; kk < M; kk++){
			        x[i*L+j+kk*C*L] = 0.0f;		
		        }
		        break;
                }
                else{
                    x[i*L+j+k*C*L] = 0.0f;
                }
            }
        }
    }
    float mean = 0.0f, std, mean_sqr = 0.0f;
    float c_mean = 0.0f, c_mean_sqr = 0.0f;

    for (int j = 0; j < N; j++) {
        float y = (x[j]/static_cast<float>(N)) - c_mean;
        float t = mean + y;
        c_mean = (t - mean) - y;
        mean = t;

        float y2 = (x[j]*x[j]/static_cast<float>(N)) - c_mean_sqr;
        float t2 = mean_sqr + y2;
        c_mean_sqr = (t2 - mean_sqr) - y2;
        mean_sqr = t2;