| OLD | NEW |
| 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/errorcode.h" | 5 #include "sandbox/linux/seccomp-bpf/errorcode.h" |
| 6 | 6 |
| 7 #include <errno.h> | 7 #include <errno.h> |
| 8 | 8 |
| 9 #include "base/macros.h" | 9 #include "base/macros.h" |
| 10 #include "sandbox/linux/bpf_dsl/bpf_dsl.h" | 10 #include "sandbox/linux/bpf_dsl/bpf_dsl.h" |
| (...skipping 25 matching lines...) Expand all Loading... |
| 36 SANDBOX_ASSERT(e0.err() == SECCOMP_RET_INVALID); | 36 SANDBOX_ASSERT(e0.err() == SECCOMP_RET_INVALID); |
| 37 | 37 |
| 38 ErrorCode e1(ErrorCode::ERR_ALLOWED); | 38 ErrorCode e1(ErrorCode::ERR_ALLOWED); |
| 39 SANDBOX_ASSERT(e1.err() == SECCOMP_RET_ALLOW); | 39 SANDBOX_ASSERT(e1.err() == SECCOMP_RET_ALLOW); |
| 40 | 40 |
| 41 ErrorCode e2(EPERM); | 41 ErrorCode e2(EPERM); |
| 42 SANDBOX_ASSERT(e2.err() == SECCOMP_RET_ERRNO + EPERM); | 42 SANDBOX_ASSERT(e2.err() == SECCOMP_RET_ERRNO + EPERM); |
| 43 | 43 |
| 44 DummyPolicy dummy_policy; | 44 DummyPolicy dummy_policy; |
| 45 bpf_dsl::PolicyCompiler compiler(&dummy_policy, Trap::Registry()); | 45 bpf_dsl::PolicyCompiler compiler(&dummy_policy, Trap::Registry()); |
| 46 ErrorCode e3 = compiler.Trap(NULL, NULL); | 46 ErrorCode e3 = compiler.Trap(NULL, NULL, true /* safe */); |
| 47 SANDBOX_ASSERT((e3.err() & SECCOMP_RET_ACTION) == SECCOMP_RET_TRAP); | 47 SANDBOX_ASSERT((e3.err() & SECCOMP_RET_ACTION) == SECCOMP_RET_TRAP); |
| 48 | 48 |
| 49 uint16_t data = 0xdead; | 49 uint16_t data = 0xdead; |
| 50 ErrorCode e4(ErrorCode::ERR_TRACE + data); | 50 ErrorCode e4(ErrorCode::ERR_TRACE + data); |
| 51 SANDBOX_ASSERT(e4.err() == SECCOMP_RET_TRACE + data); | 51 SANDBOX_ASSERT(e4.err() == SECCOMP_RET_TRACE + data); |
| 52 } | 52 } |
| 53 | 53 |
| 54 SANDBOX_DEATH_TEST(ErrorCode, | 54 SANDBOX_DEATH_TEST(ErrorCode, |
| 55 InvalidSeccompRetTrace, | 55 InvalidSeccompRetTrace, |
| 56 DEATH_MESSAGE("Invalid use of ErrorCode object")) { | 56 DEATH_MESSAGE("Invalid use of ErrorCode object")) { |
| 57 // Should die if the trace data does not fit in 16 bits. | 57 // Should die if the trace data does not fit in 16 bits. |
| 58 ErrorCode e(ErrorCode::ERR_TRACE + (1 << 16)); | 58 ErrorCode e(ErrorCode::ERR_TRACE + (1 << 16)); |
| 59 } | 59 } |
| 60 | 60 |
| 61 SANDBOX_TEST(ErrorCode, Trap) { | 61 SANDBOX_TEST(ErrorCode, Trap) { |
| 62 DummyPolicy dummy_policy; | 62 DummyPolicy dummy_policy; |
| 63 bpf_dsl::PolicyCompiler compiler(&dummy_policy, Trap::Registry()); | 63 bpf_dsl::PolicyCompiler compiler(&dummy_policy, Trap::Registry()); |
| 64 ErrorCode e0 = compiler.Trap(NULL, "a"); | 64 ErrorCode e0 = compiler.Trap(NULL, "a", true /* safe */); |
| 65 ErrorCode e1 = compiler.Trap(NULL, "b"); | 65 ErrorCode e1 = compiler.Trap(NULL, "b", true /* safe */); |
| 66 SANDBOX_ASSERT((e0.err() & SECCOMP_RET_DATA) + 1 == | 66 SANDBOX_ASSERT((e0.err() & SECCOMP_RET_DATA) + 1 == |
| 67 (e1.err() & SECCOMP_RET_DATA)); | 67 (e1.err() & SECCOMP_RET_DATA)); |
| 68 | 68 |
| 69 ErrorCode e2 = compiler.Trap(NULL, "a"); | 69 ErrorCode e2 = compiler.Trap(NULL, "a", true /* safe */); |
| 70 SANDBOX_ASSERT((e0.err() & SECCOMP_RET_DATA) == | 70 SANDBOX_ASSERT((e0.err() & SECCOMP_RET_DATA) == |
| 71 (e2.err() & SECCOMP_RET_DATA)); | 71 (e2.err() & SECCOMP_RET_DATA)); |
| 72 } | 72 } |
| 73 | 73 |
| 74 SANDBOX_TEST(ErrorCode, Equals) { | 74 SANDBOX_TEST(ErrorCode, Equals) { |
| 75 ErrorCode e1(ErrorCode::ERR_ALLOWED); | 75 ErrorCode e1(ErrorCode::ERR_ALLOWED); |
| 76 ErrorCode e2(ErrorCode::ERR_ALLOWED); | 76 ErrorCode e2(ErrorCode::ERR_ALLOWED); |
| 77 SANDBOX_ASSERT(e1.Equals(e1)); | 77 SANDBOX_ASSERT(e1.Equals(e1)); |
| 78 SANDBOX_ASSERT(e1.Equals(e2)); | 78 SANDBOX_ASSERT(e1.Equals(e2)); |
| 79 SANDBOX_ASSERT(e2.Equals(e1)); | 79 SANDBOX_ASSERT(e2.Equals(e1)); |
| 80 | 80 |
| 81 ErrorCode e3(EPERM); | 81 ErrorCode e3(EPERM); |
| 82 SANDBOX_ASSERT(!e1.Equals(e3)); | 82 SANDBOX_ASSERT(!e1.Equals(e3)); |
| 83 | 83 |
| 84 DummyPolicy dummy_policy; | 84 DummyPolicy dummy_policy; |
| 85 bpf_dsl::PolicyCompiler compiler(&dummy_policy, Trap::Registry()); | 85 bpf_dsl::PolicyCompiler compiler(&dummy_policy, Trap::Registry()); |
| 86 ErrorCode e4 = compiler.Trap(NULL, "a"); | 86 ErrorCode e4 = compiler.Trap(NULL, "a", true /* safe */); |
| 87 ErrorCode e5 = compiler.Trap(NULL, "b"); | 87 ErrorCode e5 = compiler.Trap(NULL, "b", true /* safe */); |
| 88 ErrorCode e6 = compiler.Trap(NULL, "a"); | 88 ErrorCode e6 = compiler.Trap(NULL, "a", true /* safe */); |
| 89 SANDBOX_ASSERT(!e1.Equals(e4)); | 89 SANDBOX_ASSERT(!e1.Equals(e4)); |
| 90 SANDBOX_ASSERT(!e3.Equals(e4)); | 90 SANDBOX_ASSERT(!e3.Equals(e4)); |
| 91 SANDBOX_ASSERT(!e5.Equals(e4)); | 91 SANDBOX_ASSERT(!e5.Equals(e4)); |
| 92 SANDBOX_ASSERT( e6.Equals(e4)); | 92 SANDBOX_ASSERT( e6.Equals(e4)); |
| 93 } | 93 } |
| 94 | 94 |
| 95 SANDBOX_TEST(ErrorCode, LessThan) { | 95 SANDBOX_TEST(ErrorCode, LessThan) { |
| 96 ErrorCode e1(ErrorCode::ERR_ALLOWED); | 96 ErrorCode e1(ErrorCode::ERR_ALLOWED); |
| 97 ErrorCode e2(ErrorCode::ERR_ALLOWED); | 97 ErrorCode e2(ErrorCode::ERR_ALLOWED); |
| 98 SANDBOX_ASSERT(!e1.LessThan(e1)); | 98 SANDBOX_ASSERT(!e1.LessThan(e1)); |
| 99 SANDBOX_ASSERT(!e1.LessThan(e2)); | 99 SANDBOX_ASSERT(!e1.LessThan(e2)); |
| 100 SANDBOX_ASSERT(!e2.LessThan(e1)); | 100 SANDBOX_ASSERT(!e2.LessThan(e1)); |
| 101 | 101 |
| 102 ErrorCode e3(EPERM); | 102 ErrorCode e3(EPERM); |
| 103 SANDBOX_ASSERT(!e1.LessThan(e3)); | 103 SANDBOX_ASSERT(!e1.LessThan(e3)); |
| 104 SANDBOX_ASSERT( e3.LessThan(e1)); | 104 SANDBOX_ASSERT( e3.LessThan(e1)); |
| 105 | 105 |
| 106 DummyPolicy dummy_policy; | 106 DummyPolicy dummy_policy; |
| 107 bpf_dsl::PolicyCompiler compiler(&dummy_policy, Trap::Registry()); | 107 bpf_dsl::PolicyCompiler compiler(&dummy_policy, Trap::Registry()); |
| 108 ErrorCode e4 = compiler.Trap(NULL, "a"); | 108 ErrorCode e4 = compiler.Trap(NULL, "a", true /* safe */); |
| 109 ErrorCode e5 = compiler.Trap(NULL, "b"); | 109 ErrorCode e5 = compiler.Trap(NULL, "b", true /* safe */); |
| 110 ErrorCode e6 = compiler.Trap(NULL, "a"); | 110 ErrorCode e6 = compiler.Trap(NULL, "a", true /* safe */); |
| 111 SANDBOX_ASSERT(e1.LessThan(e4)); | 111 SANDBOX_ASSERT(e1.LessThan(e4)); |
| 112 SANDBOX_ASSERT(e3.LessThan(e4)); | 112 SANDBOX_ASSERT(e3.LessThan(e4)); |
| 113 SANDBOX_ASSERT(e4.LessThan(e5)); | 113 SANDBOX_ASSERT(e4.LessThan(e5)); |
| 114 SANDBOX_ASSERT(!e4.LessThan(e6)); | 114 SANDBOX_ASSERT(!e4.LessThan(e6)); |
| 115 SANDBOX_ASSERT(!e6.LessThan(e4)); | 115 SANDBOX_ASSERT(!e6.LessThan(e4)); |
| 116 } | 116 } |
| 117 | 117 |
| 118 } // namespace | 118 } // namespace |
| 119 | 119 |
| 120 } // namespace sandbox | 120 } // namespace sandbox |
| OLD | NEW |