Rev 2787 | Go to most recent revision | Only display areas with differences | Ignore whitespace | Details | Blame | Last modification | View Log | RSS feed
Rev 2787 | Rev 4377 | ||
---|---|---|---|
1 | /* |
1 | /* |
2 | * Copyright (c) 2006 Sergey Bondari |
2 | * Copyright (c) 2006 Sergey Bondari |
3 | * All rights reserved. |
3 | * All rights reserved. |
4 | * |
4 | * |
5 | * Redistribution and use in source and binary forms, with or without |
5 | * Redistribution and use in source and binary forms, with or without |
6 | * modification, are permitted provided that the following conditions |
6 | * modification, are permitted provided that the following conditions |
7 | * are met: |
7 | * are met: |
8 | * |
8 | * |
9 | * - Redistributions of source code must retain the above copyright |
9 | * - Redistributions of source code must retain the above copyright |
10 | * notice, this list of conditions and the following disclaimer. |
10 | * notice, this list of conditions and the following disclaimer. |
11 | * - Redistributions in binary form must reproduce the above copyright |
11 | * - Redistributions in binary form must reproduce the above copyright |
12 | * notice, this list of conditions and the following disclaimer in the |
12 | * notice, this list of conditions and the following disclaimer in the |
13 | * documentation and/or other materials provided with the distribution. |
13 | * documentation and/or other materials provided with the distribution. |
14 | * - The name of the author may not be used to endorse or promote products |
14 | * - The name of the author may not be used to endorse or promote products |
15 | * derived from this software without specific prior written permission. |
15 | * derived from this software without specific prior written permission. |
16 | * |
16 | * |
17 | * THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR |
17 | * THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR |
18 | * IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES |
18 | * IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES |
19 | * OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. |
19 | * OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. |
20 | * IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT, |
20 | * IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT, |
21 | * INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT |
21 | * INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT |
22 | * NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, |
22 | * NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, |
23 | * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY |
23 | * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY |
24 | * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT |
24 | * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT |
25 | * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF |
25 | * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF |
26 | * THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. |
26 | * THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. |
27 | */ |
27 | */ |
28 | 28 | ||
29 | #include <print.h> |
29 | #include <print.h> |
30 | #include <test.h> |
30 | #include <test.h> |
31 | #include <mm/page.h> |
31 | #include <mm/page.h> |
32 | #include <mm/frame.h> |
32 | #include <mm/frame.h> |
33 | #include <mm/slab.h> |
33 | #include <mm/slab.h> |
34 | #include <arch/mm/page.h> |
34 | #include <arch/mm/page.h> |
35 | #include <arch/types.h> |
35 | #include <arch/types.h> |
36 | #include <debug.h> |
36 | #include <debug.h> |
37 | #include <align.h> |
37 | #include <align.h> |
38 | 38 | ||
39 | #define MAX_FRAMES 1024 |
39 | #define MAX_FRAMES 1024 |
40 | #define MAX_ORDER 8 |
40 | #define MAX_ORDER 8 |
41 | #define TEST_RUNS 2 |
41 | #define TEST_RUNS 2 |
42 | 42 | ||
43 | char * test_falloc1(bool quiet) { |
43 | char *test_falloc1(void) { |
- | 44 | uintptr_t *frames |
|
44 | uintptr_t * frames = (uintptr_t *) malloc(MAX_FRAMES * sizeof(uintptr_t), 0); |
45 | = (uintptr_t *) malloc(MAX_FRAMES * sizeof(uintptr_t), 0); |
45 | int results[MAX_ORDER + 1]; |
46 | int results[MAX_ORDER + 1]; |
46 | 47 | ||
47 | int i, order, run; |
48 | int i, order, run; |
48 | int allocated; |
49 | int allocated; |
49 | 50 | ||
50 | if (TEST_RUNS < 2) |
51 | if (TEST_RUNS < 2) |
51 | return "Test is compiled with TEST_RUNS < 2"; |
52 | return "Test is compiled with TEST_RUNS < 2"; |
52 | 53 | ||
53 | if (frames == NULL) |
54 | if (frames == NULL) |
54 | return "Unable to allocate frames"; |
55 | return "Unable to allocate frames"; |
55 | 56 | ||
56 | for (run = 0; run < TEST_RUNS; run++) { |
57 | for (run = 0; run < TEST_RUNS; run++) { |
57 | for (order = 0; order <= MAX_ORDER; order++) { |
58 | for (order = 0; order <= MAX_ORDER; order++) { |
58 | if (!quiet) |
- | |
59 | printf("Allocating %d frames blocks ... ", 1 << order); |
59 | TPRINTF("Allocating %d frames blocks ... ", 1 << order); |
60 | 60 | ||
61 | allocated = 0; |
61 | allocated = 0; |
62 | for (i = 0; i < MAX_FRAMES >> order; i++) { |
62 | for (i = 0; i < MAX_FRAMES >> order; i++) { |
63 | frames[allocated] = (uintptr_t) frame_alloc(order, FRAME_ATOMIC | FRAME_KA); |
63 | frames[allocated] = (uintptr_t) frame_alloc(order, FRAME_ATOMIC | FRAME_KA); |
64 | 64 | ||
65 | if (ALIGN_UP(frames[allocated], FRAME_SIZE << order) != frames[allocated]) { |
65 | if (ALIGN_UP(frames[allocated], FRAME_SIZE << order) != frames[allocated]) { |
66 | if (!quiet) |
- | |
67 | printf("Block at address %p (size %dK) is not aligned\n", frames[allocated], (FRAME_SIZE << order) >> 10); |
66 | TPRINTF("Block at address %p (size %dK) is not aligned\n", frames[allocated], (FRAME_SIZE << order) >> 10); |
68 | return "Test failed"; |
67 | return "Test failed"; |
69 | } |
68 | } |
70 | 69 | ||
71 | if (frames[allocated]) |
70 | if (frames[allocated]) |
72 | allocated++; |
71 | allocated++; |
73 | else { |
72 | else { |
74 | if (!quiet) |
- | |
75 | printf("done. "); |
73 | TPRINTF("done. "); |
76 | break; |
74 | break; |
77 | } |
75 | } |
78 | } |
76 | } |
79 | 77 | ||
80 | if (!quiet) |
- | |
81 | printf("%d blocks allocated.\n", allocated); |
78 | TPRINTF("%d blocks allocated.\n", allocated); |
82 | 79 | ||
83 | if (run) { |
80 | if (run) { |
84 | if (results[order] != allocated) |
81 | if (results[order] != allocated) |
85 | return "Possible frame leak"; |
82 | return "Possible frame leak"; |
86 | } else |
83 | } else |
87 | results[order] = allocated; |
84 | results[order] = allocated; |
88 | 85 | ||
89 | if (!quiet) |
- | |
90 | printf("Deallocating ... "); |
86 | TPRINTF("Deallocating ... "); |
91 | 87 | ||
92 | for (i = 0; i < allocated; i++) |
88 | for (i = 0; i < allocated; i++) |
93 | frame_free(KA2PA(frames[i])); |
89 | frame_free(KA2PA(frames[i])); |
94 | 90 | ||
95 | if (!quiet) |
- | |
96 | printf("done.\n"); |
91 | TPRINTF("done.\n"); |
97 | } |
92 | } |
98 | } |
93 | } |
99 | 94 | ||
100 | free(frames); |
95 | free(frames); |
101 | 96 | ||
102 | return NULL; |
97 | return NULL; |
103 | } |
98 | } |
104 | 99 |