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/codegen.h" | 5 #include "sandbox/linux/bpf_dsl/codegen.h" |
6 | 6 |
7 #include <linux/filter.h> | 7 #include <linux/filter.h> |
8 | 8 |
9 #include <map> | 9 #include <map> |
10 #include <utility> | 10 #include <utility> |
11 #include <vector> | 11 #include <vector> |
12 | 12 |
13 #include "base/macros.h" | 13 #include "base/macros.h" |
14 #include "base/md5.h" | 14 #include "base/md5.h" |
15 #include "base/strings/string_piece.h" | 15 #include "base/strings/string_piece.h" |
(...skipping 378 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
394 // Branching again to the same target nodes should require only one | 394 // Branching again to the same target nodes should require only one |
395 // new instruction, as we can reuse the previous branch's jumps. | 395 // new instruction, as we can reuse the previous branch's jumps. |
396 CodeGen::Node two = | 396 CodeGen::Node two = |
397 MakeInstruction(BPF_JMP + BPF_JEQ + BPF_K, 1, nodes[0], nodes[1]); | 397 MakeInstruction(BPF_JMP + BPF_JEQ + BPF_K, 1, nodes[0], nodes[1]); |
398 EXPECT_EQ(one + 1, two); // XXX: Implementation detail! | 398 EXPECT_EQ(one + 1, two); // XXX: Implementation detail! |
399 RunTest(two); | 399 RunTest(two); |
400 } | 400 } |
401 | 401 |
402 } // namespace | 402 } // namespace |
403 } // namespace sandbox | 403 } // namespace sandbox |
OLD | NEW |