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 #ifndef SANDBOX_LINUX_SECCOMP_BPF_BASICBLOCK_H__ | 5 #ifndef SANDBOX_LINUX_SECCOMP_BPF_BASICBLOCK_H__ |
6 #define SANDBOX_LINUX_SECCOMP_BPF_BASICBLOCK_H__ | 6 #define SANDBOX_LINUX_SECCOMP_BPF_BASICBLOCK_H__ |
7 | 7 |
8 #include <vector> | 8 #include <vector> |
9 | 9 |
10 #include "sandbox/linux/seccomp-bpf/instruction.h" | 10 #include "sandbox/linux/seccomp-bpf/instruction.h" |
11 | 11 |
12 | |
13 namespace playground2 { | 12 namespace playground2 { |
14 | 13 |
15 struct BasicBlock { | 14 struct BasicBlock { |
16 BasicBlock(); | 15 BasicBlock(); |
17 ~BasicBlock(); | 16 ~BasicBlock(); |
18 | 17 |
19 // Our implementation of the code generator uses a "Less" operator to | 18 // Our implementation of the code generator uses a "Less" operator to |
20 // identify common sequences of basic blocks. This would normally be | 19 // identify common sequences of basic blocks. This would normally be |
21 // really easy to do, but STL requires us to wrap the comparator into | 20 // really easy to do, but STL requires us to wrap the comparator into |
22 // a class. We begrudgingly add some code here that provides this wrapping. | 21 // a class. We begrudgingly add some code here that provides this wrapping. |
23 template<class T> class Less { | 22 template <class T> |
| 23 class Less { |
24 public: | 24 public: |
25 Less(const T& data, int (*cmp)(const BasicBlock *, const BasicBlock *, | 25 Less(const T& data, |
26 const T& data)) | 26 int (*cmp)(const BasicBlock*, const BasicBlock*, const T& data)) |
27 : data_(data), | 27 : data_(data), cmp_(cmp) {} |
28 cmp_(cmp) { | |
29 } | |
30 | 28 |
31 bool operator() (const BasicBlock *a, const BasicBlock *b) const { | 29 bool operator()(const BasicBlock* a, const BasicBlock* b) const { |
32 return cmp_(a, b, data_) < 0; | 30 return cmp_(a, b, data_) < 0; |
33 } | 31 } |
34 | 32 |
35 private: | 33 private: |
36 const T& data_; | 34 const T& data_; |
37 int (*cmp_)(const BasicBlock *, const BasicBlock *, const T&); | 35 int (*cmp_)(const BasicBlock*, const BasicBlock*, const T&); |
38 }; | 36 }; |
39 | 37 |
40 // Basic blocks are essentially nothing more than a set of instructions. | 38 // Basic blocks are essentially nothing more than a set of instructions. |
41 std::vector<Instruction *> instructions; | 39 std::vector<Instruction*> instructions; |
42 | 40 |
43 // In order to compute relative branch offsets we need to keep track of | 41 // In order to compute relative branch offsets we need to keep track of |
44 // how far our block is away from the very last basic block. The "offset_" | 42 // how far our block is away from the very last basic block. The "offset_" |
45 // is measured in number of BPF instructions. | 43 // is measured in number of BPF instructions. |
46 int offset; | 44 int offset; |
47 }; | 45 }; |
48 | 46 |
49 } // namespace playground2 | 47 } // namespace playground2 |
50 | 48 |
51 #endif // SANDBOX_LINUX_SECCOMP_BPF_BASICBLOCK_H__ | 49 #endif // SANDBOX_LINUX_SECCOMP_BPF_BASICBLOCK_H__ |
OLD | NEW |