Преглед изворни кода

Malloc test: tabs -> spaces, fix description

Jeroen Domburg пре 9 година
родитељ
комит
ab5bbfa74b
1 измењених фајлова са 24 додато и 24 уклоњено
  1. 24 24
      components/freertos/test/test_malloc.c

+ 24 - 24
components/freertos/test/test_malloc.c

@@ -1,5 +1,5 @@
 /*
- Test for multicore FreeRTOS. This test spins up threads, fiddles with queues etc.
+ Generic test for malloc/free
 */
 
 #include <esp_types.h>
@@ -17,33 +17,33 @@
 #include "soc/io_mux_reg.h"
 
 static int tryAllocMem() {
-	int **mem;
-	int i, noAllocated, j;
-	mem=malloc(sizeof(int)*1024);
-	if (!mem) return 0;
-	for (i=0; i<1024; i++) {
-		mem[i]=malloc(1024);
-		if (mem[i]==NULL) break;
-		for (j=0; j<1024/4; j++) mem[i][j]=(0xdeadbeef);
-	}
-	noAllocated=i;
-	for (i=0; i<noAllocated; i++) {
-		for (j=0; j<1024/4; j++) {
-			TEST_ASSERT(mem[i][j]==(0xdeadbeef));
-		}
-		free(mem[i]);
-	}
-	free(mem);
-	return noAllocated;
+    int **mem;
+    int i, noAllocated, j;
+    mem=malloc(sizeof(int)*1024);
+    if (!mem) return 0;
+    for (i=0; i<1024; i++) {
+        mem[i]=malloc(1024);
+        if (mem[i]==NULL) break;
+        for (j=0; j<1024/4; j++) mem[i][j]=(0xdeadbeef);
+    }
+    noAllocated=i;
+    for (i=0; i<noAllocated; i++) {
+        for (j=0; j<1024/4; j++) {
+            TEST_ASSERT(mem[i][j]==(0xdeadbeef));
+        }
+        free(mem[i]);
+    }
+    free(mem);
+    return noAllocated;
 }
 
 
 TEST_CASE("Malloc/overwrite, then free all available DRAM", "[freertos]")
 {
-	int m1=0, m2=0;
-	m1=tryAllocMem();
-	m2=tryAllocMem();
-	printf("Could allocate %dK on first try, %dK on 2nd try.\n", m1, m2);
-	TEST_ASSERT(m1==m2);
+    int m1=0, m2=0;
+    m1=tryAllocMem();
+    m2=tryAllocMem();
+    printf("Could allocate %dK on first try, %dK on 2nd try.\n", m1, m2);
+    TEST_ASSERT(m1==m2);
 }