Introduce linux_filter.h and replace #include <linux/filter.h>

sandbox/linux/bpf_dsl/codegen.cc

 // Copyright (c) 2012 The Chromium Authors. All rights reserved.
 // Use of this source code is governed by a BSD-style license that can be
 // found in the LICENSE file.
 
 #include "sandbox/linux/bpf_dsl/codegen.h"
 
-#include <linux/filter.h>
-
 #include <limits>
 #include <utility>
 
 #include "base/logging.h"
+#include "sandbox/linux/system_headers/linux_filter.h"
 
 // This CodeGen implementation strives for simplicity while still
 // generating acceptable BPF programs under typical usage patterns
 // (e.g., by PolicyCompiler).
 //
 // The key to its simplicity is that BPF programs only support forward
 // jumps/branches, which allows constraining the DAG construction API
 // to make instruction nodes immutable. Immutable nodes admits a
 // simple greedy approach of emitting new instructions as needed and
 // then reusing existing ones that have already been emitted. This
@@ skipping 127 matching lines @@
   if (get<1>(lhs) != get<1>(rhs))
     return get<1>(lhs) < get<1>(rhs);
   if (get<2>(lhs) != get<2>(rhs))
     return get<2>(lhs) < get<2>(rhs);
   if (get<3>(lhs) != get<3>(rhs))
     return get<3>(lhs) < get<3>(rhs);
   return false;
 }
 
 }  // namespace sandbox