From 638d5ce396c25c7f735e665e9306d7be9e9f5b7c Mon Sep 17 00:00:00 2001
From: pjc97uv2f <1291955673@qq.com>
Date: Sat, 23 Nov 2024 11:18:29 +0800
Subject: [PATCH] Add 4

---
 4 | 81 +++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++
 1 file changed, 81 insertions(+)
 create mode 100644 4

diff --git a/4 b/4
new file mode 100644
index 0000000..8879b47
--- /dev/null
+++ b/4
@@ -0,0 +1,81 @@
+#include <stdio.h>
+#include <stdlib.h>
+#include <ctime>
+
+#include <arm_neon.h>
+
+
+#define SIZE 1024
+
+
+void matmul_optimized(float** A, float** B, float** C, int n) {
+    for (int i = 0; i < n; i++) {
+        for (int j = 0; j < n; j++) {
+            float32x4_t vecC = vdupq_n_f32(0);  
+            for (int k = 0; k < n; k += 4) {
+                
+                float32x4_t vecA = vld1q_f32(&A[i][k]);
+              
+                float32x4_t vecB = vld1q_f32(&B[k][j]);
+
+                
+                vecC = vmlaq_f32(vecC, vecA, vecB);
+            }
+           
+            C[i][j] = vgetq_lane_f32(vecC, 0) + vgetq_lane_f32(vecC, 1) +
+                      vgetq_lane_f32(vecC, 2) + vgetq_lane_f32(vecC, 3);
+        }
+    }
+}
+
+int main() {
+    
+    float** A = (float**)malloc(SIZE * sizeof(float*));
+    for (int i = 0; i < SIZE; i++) {
+        A[i] = (float*)malloc(SIZE * sizeof(float));
+    }
+
+    float** B = (float**)malloc(SIZE * sizeof(float*));
+    for (int i = 0; i < SIZE; i++) {
+        B[i] = (float*)malloc(SIZE * sizeof(float));
+    }
+
+    float** C = (float**)malloc(SIZE * sizeof(float*));
+    for (int i = 0; i < SIZE; i++) {
+        C[i] = (float*)malloc(SIZE * sizeof(float));
+    }
+
+    
+    for (int i = 0; i < SIZE; i++) {
+        for (int j = 0; j < SIZE; j++) {
+            A[i][j] = (float)(rand() % 100);
+            B[i][j] = (float)(rand() % 100);
+        }
+    }
+
+    clock_t start_time, end_time;
+    
+    start_time = clock();
+
+    
+    matmul_optimized(A, B, C, SIZE);
+
+    
+    end_time = clock();
+
+    
+    double elapsed_time = ((double)(end_time - start_time)) / CLOCKS_PER_SEC;
+    printf("NEON优化矩阵乘法的运行时间：%f 秒\n", elapsed_time);
+
+    
+    for (int i = 0; i < SIZE; i++) {
+        free(A[i]);
+        free(B[i]);
+        free(C[i]);
+    }
+    free(A);
+    free(B);
+    free(C);
+
+    return 0;
+}
\ No newline at end of file