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_CODEGEN_H__ | 5 #ifndef SANDBOX_LINUX_BPF_DSL_CODEGEN_H__ |
6 #define SANDBOX_LINUX_SECCOMP_BPF_CODEGEN_H__ | 6 #define SANDBOX_LINUX_BPF_DSL_CODEGEN_H__ |
7 | 7 |
8 #include <stddef.h> | 8 #include <stddef.h> |
9 #include <stdint.h> | 9 #include <stdint.h> |
10 | 10 |
11 #include <map> | 11 #include <map> |
12 #include <vector> | 12 #include <vector> |
13 | 13 |
14 #include "base/macros.h" | 14 #include "base/macros.h" |
15 #include "base/tuple.h" | 15 #include "base/tuple.h" |
16 #include "sandbox/sandbox_export.h" | 16 #include "sandbox/sandbox_export.h" |
(...skipping 96 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
113 // if it's an unconditional jump to a node semantically-equivalent to N. | 113 // if it's an unconditional jump to a node semantically-equivalent to N. |
114 std::vector<Node> equivalent_; | 114 std::vector<Node> equivalent_; |
115 | 115 |
116 std::map<MemoKey, Node, MemoKeyLess> memos_; | 116 std::map<MemoKey, Node, MemoKeyLess> memos_; |
117 | 117 |
118 DISALLOW_COPY_AND_ASSIGN(CodeGen); | 118 DISALLOW_COPY_AND_ASSIGN(CodeGen); |
119 }; | 119 }; |
120 | 120 |
121 } // namespace sandbox | 121 } // namespace sandbox |
122 | 122 |
123 #endif // SANDBOX_LINUX_SECCOMP_BPF_CODEGEN_H__ | 123 #endif // SANDBOX_LINUX_BPF_DSL_CODEGEN_H__ |
OLD | NEW |