OLD | NEW |
---|---|
(Empty) | |
1 /* | |
2 * Copyright (c) 2014 The Native Client Authors. All rights reserved. | |
3 * Use of this source code is governed by a BSD-style license that can be | |
4 * found in the LICENSE file. | |
5 */ | |
6 | |
7 #include "native_client/src/include/minsfi.h" | |
8 #include "native_client/src/include/minsfi_priv.h" | |
9 #include "native_client/src/include/nacl_assert.h" | |
10 | |
11 static const unsigned page_size = 0x1000; | |
12 MinsfiMemoryLayout mem; | |
13 | |
14 MinsfiManifest InitManifest(void) { | |
15 MinsfiManifest sb; | |
16 sb.ptr_size = 24; | |
17 sb.dataseg_offset = 0x1000; | |
18 sb.dataseg_size = 0x2400; /* intentionally not page-aligned and larger than | |
19 page_size to test rounding up */ | |
20 | |
21 ASSERT_EQ(true, MinsfiGenerateMemoryLayout(&sb, page_size, &mem)); | |
22 return sb; | |
23 } | |
24 | |
25 void test_valid_layout(void) { | |
26 MinsfiManifest sb = InitManifest(); | |
27 | |
28 ASSERT_EQ(true, MinsfiGenerateMemoryLayout(&sb, page_size, &mem)); | |
29 | |
30 ASSERT_EQ( 0x1000, mem.dataseg.offset); | |
31 ASSERT_EQ( 0x4000, mem.dataseg.offset + mem.dataseg.length); | |
32 ASSERT_EQ( 0x5000, mem.heap.offset); | |
33 ASSERT_EQ( 0xFDF000, mem.heap.offset + mem.heap.length); | |
34 ASSERT_EQ( 0xFE0000, mem.stack.offset); | |
35 ASSERT_EQ(0x1000000, mem.stack.offset + mem.stack.length); | |
36 } | |
37 | |
38 void test_page_size_not_pow2(void) { | |
39 MinsfiManifest sb = InitManifest(); | |
40 ASSERT_EQ(false, MinsfiGenerateMemoryLayout(&sb, 1234, &mem)); | |
41 } | |
42 | |
43 void test_ptrsize_invalid(void) { | |
44 MinsfiManifest sb = InitManifest(); | |
45 | |
46 sb.ptr_size = 0; | |
47 ASSERT_EQ(false, MinsfiGenerateMemoryLayout(&sb, page_size, &mem)); | |
48 | |
49 sb.ptr_size = 19; | |
50 ASSERT_EQ(false, MinsfiGenerateMemoryLayout(&sb, page_size, &mem)); | |
51 | |
jvoung (off chromium)
2014/09/08 23:18:48
Might be good to have a 32-bit one, to show that 3
dbrazdil
2014/09/09 00:57:53
Done.
| |
52 sb.ptr_size = 33; | |
53 ASSERT_EQ(false, MinsfiGenerateMemoryLayout(&sb, page_size, &mem)); | |
54 } | |
55 | |
56 void test_dataseg_offset_invalid(void) { | |
57 MinsfiManifest sb = InitManifest(); | |
58 | |
59 /* offset not page-aligned */ | |
60 sb.dataseg_offset = page_size + 7; | |
61 ASSERT_EQ(false, MinsfiGenerateMemoryLayout(&sb, page_size, &mem)); | |
62 | |
63 /* offset out of bounds */ | |
64 sb.dataseg_offset = (1 << (sb.ptr_size + 1)); | |
65 ASSERT_EQ(false, MinsfiGenerateMemoryLayout(&sb, page_size, &mem)); | |
66 } | |
67 | |
68 void test_dataseg_size_invalid(void) { | |
69 MinsfiManifest sb = InitManifest(); | |
70 | |
71 /* end of the region out of bounds; size gets rounded up and fails */ | |
72 sb.dataseg_size = (1 << sb.ptr_size) - (page_size + 1); | |
73 ASSERT_EQ(false, MinsfiGenerateMemoryLayout(&sb, page_size, &mem)); | |
74 } | |
75 | |
76 void test_no_space_for_heap(void) { | |
77 MinsfiManifest sb = InitManifest(); | |
78 bool ret; | |
79 | |
80 /* heap size exactly one page */ | |
81 sb.dataseg_size = (1 << sb.ptr_size) - sb.dataseg_offset - 35 * page_size; | |
82 ret = MinsfiGenerateMemoryLayout(&sb, page_size, &mem); | |
83 ASSERT_EQ(true, ret); | |
84 ASSERT_EQ(page_size, mem.heap.length); | |
85 | |
86 /* heap size less than one page. */ | |
87 sb.dataseg_size += 1; | |
88 ASSERT_EQ(false, MinsfiGenerateMemoryLayout(&sb, page_size, &mem)); | |
89 | |
90 /* heap size negative */ | |
91 sb.dataseg_size += page_size; | |
92 ASSERT_EQ(false, MinsfiGenerateMemoryLayout(&sb, page_size, &mem)); | |
93 } | |
94 | |
95 int main(void) { | |
96 test_valid_layout(); | |
97 test_page_size_not_pow2(); | |
98 test_ptrsize_invalid(); | |
99 test_dataseg_offset_invalid(); | |
100 test_dataseg_size_invalid(); | |
101 test_no_space_for_heap(); | |
102 return 0; | |
103 } | |
OLD | NEW |