Chromium Code Reviews
chromiumcodereview-hr@appspot.gserviceaccount.com (chromiumcodereview-hr) | Please choose your nickname with Settings | Help | Chromium Project | Gerrit Changes | Sign out
(261)

Side by Side Diff: sandbox/linux/seccomp-bpf/syscall_iterator_unittest.cc

Issue 659723002: SyscallIterator: support C++11 range-based for loops (Closed) Base URL: https://chromium.googlesource.com/chromium/src.git@master
Patch Set: Sync and fix style Created 6 years, 2 months ago
Use n/p to move between diff chunks; N/P to move between comments. Draft comments are only viewable by you.
Jump to:
View unified diff | Download patch
OLDNEW
1 // Copyright (c) 2012 The Chromium Authors. All rights reserved. 1 // Copyright (c) 2012 The Chromium Authors. All rights reserved.
2 // Use of this source code is governed by a BSD-style license that can be 2 // Use of this source code is governed by a BSD-style license that can be
3 // found in the LICENSE file. 3 // found in the LICENSE file.
4 4
5 #include "sandbox/linux/seccomp-bpf/syscall_iterator.h" 5 #include "sandbox/linux/seccomp-bpf/syscall_iterator.h"
6 6
7 #include <stdint.h> 7 #include <stdint.h>
8 8
9 #include "sandbox/linux/seccomp-bpf/linux_seccomp.h" 9 #include "sandbox/linux/seccomp-bpf/linux_seccomp.h"
10 #include "sandbox/linux/tests/unit_tests.h" 10 #include "sandbox/linux/tests/unit_tests.h"
11 11
12 namespace sandbox { 12 namespace sandbox {
13 13
14 namespace { 14 namespace {
15 15
16 const bool kFalseTrue[] = {false, true}; 16 const SyscallSet kSyscallSets[] = {SyscallSet::ALL, SyscallSet::INVALID_ONLY};
17 17
18 SANDBOX_TEST(SyscallIterator, Monotonous) { 18 SANDBOX_TEST(SyscallIterator, Monotonous) {
19 for (bool invalid_only : kFalseTrue) { 19 for (const SyscallSet& set : kSyscallSets) {
20 uint32_t prev = 0; 20 uint32_t prev = 0;
21 bool have_prev = false; 21 bool have_prev = false;
22 for (SyscallIterator iter(invalid_only); !iter.Done();) { 22 for (uint32_t sysnum : set) {
23 uint32_t sysnum = iter.Next();
24
25 if (have_prev) { 23 if (have_prev) {
26 SANDBOX_ASSERT(sysnum > prev); 24 SANDBOX_ASSERT(sysnum > prev);
27 } else if (!invalid_only) { 25 } else if (set == SyscallSet::ALL) {
28 // The iterator should start at 0. 26 // The iterator should start at 0.
29 SANDBOX_ASSERT(sysnum == 0); 27 SANDBOX_ASSERT(sysnum == 0);
30 } 28 }
31 29
32 prev = sysnum; 30 prev = sysnum;
33 have_prev = true; 31 have_prev = true;
34 } 32 }
35 33
36 // The iterator should always return 0xFFFFFFFFu as the last value. 34 // The iterator should always return 0xFFFFFFFFu as the last value.
37 SANDBOX_ASSERT(have_prev); 35 SANDBOX_ASSERT(have_prev);
38 SANDBOX_ASSERT(prev == 0xFFFFFFFFu); 36 SANDBOX_ASSERT(prev == 0xFFFFFFFFu);
39 } 37 }
40 } 38 }
41 39
42 // AssertRange checks that SyscallIterator produces all system call 40 // AssertRange checks that SyscallIterator produces all system call
43 // numbers in the inclusive range [min, max]. 41 // numbers in the inclusive range [min, max].
44 void AssertRange(uint32_t min, uint32_t max) { 42 void AssertRange(uint32_t min, uint32_t max) {
45 SANDBOX_ASSERT(min < max); 43 SANDBOX_ASSERT(min < max);
46 uint32_t prev = min - 1; 44 uint32_t prev = min - 1;
47 for (SyscallIterator iter(false); !iter.Done();) { 45 for (uint32_t sysnum : SyscallSet::ALL) {
48 uint32_t sysnum = iter.Next();
49 if (sysnum >= min && sysnum <= max) { 46 if (sysnum >= min && sysnum <= max) {
50 SANDBOX_ASSERT(prev == sysnum - 1); 47 SANDBOX_ASSERT(prev == sysnum - 1);
51 prev = sysnum; 48 prev = sysnum;
52 } 49 }
53 } 50 }
54 SANDBOX_ASSERT(prev == max); 51 SANDBOX_ASSERT(prev == max);
55 } 52 }
56 53
57 SANDBOX_TEST(SyscallIterator, ValidSyscallRanges) { 54 SANDBOX_TEST(SyscallIterator, ValidSyscallRanges) {
58 AssertRange(MIN_SYSCALL, MAX_PUBLIC_SYSCALL); 55 AssertRange(MIN_SYSCALL, MAX_PUBLIC_SYSCALL);
(...skipping 14 matching lines...) Expand all
73 MIN_PRIVATE_SYSCALL - 1, 70 MIN_PRIVATE_SYSCALL - 1,
74 MAX_PRIVATE_SYSCALL + 1, 71 MAX_PRIVATE_SYSCALL + 1,
75 MIN_GHOST_SYSCALL - 1, 72 MIN_GHOST_SYSCALL - 1,
76 MAX_SYSCALL + 1, 73 MAX_SYSCALL + 1,
77 #endif 74 #endif
78 0x7FFFFFFFu, 75 0x7FFFFFFFu,
79 0x80000000u, 76 0x80000000u,
80 0xFFFFFFFFu, 77 0xFFFFFFFFu,
81 }; 78 };
82 79
83 for (bool invalid_only : kFalseTrue) { 80 for (const SyscallSet& set : kSyscallSets) {
84 size_t i = 0; 81 size_t i = 0;
85 for (SyscallIterator iter(invalid_only); !iter.Done();) { 82 for (uint32_t sysnum : set) {
86 uint32_t sysnum = iter.Next();
87 if (!SyscallIterator::IsValid(sysnum)) { 83 if (!SyscallIterator::IsValid(sysnum)) {
88 SANDBOX_ASSERT(i < arraysize(kExpected)); 84 SANDBOX_ASSERT(i < arraysize(kExpected));
89 SANDBOX_ASSERT(kExpected[i] == sysnum); 85 SANDBOX_ASSERT(kExpected[i] == sysnum);
90 ++i; 86 ++i;
91 } 87 }
92 } 88 }
93 SANDBOX_ASSERT(i == arraysize(kExpected)); 89 SANDBOX_ASSERT(i == arraysize(kExpected));
94 } 90 }
95 } 91 }
96 92
93 SANDBOX_TEST(SyscallIterator, InvalidOnlyIsOnlyInvalid) {
94 for (uint32_t sysnum : SyscallSet::INVALID_ONLY) {
95 SANDBOX_ASSERT(!SyscallIterator::IsValid(sysnum));
96 }
97 }
98
97 } // namespace 99 } // namespace
98 100
99 } // namespace sandbox 101 } // namespace sandbox
OLDNEW

Powered by Google App Engine
This is Rietveld 408576698