OLD | NEW |
1 // Copyright (c) 2006-2008 The Chromium Authors. All rights reserved. | 1 // Copyright (c) 2006-2008 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/win/src/policy_engine_processor.h" | 5 #include "sandbox/win/src/policy_engine_processor.h" |
6 | 6 |
7 namespace sandbox { | 7 namespace sandbox { |
8 | 8 |
9 void PolicyProcessor::SetInternalState(size_t index, EvalResult result) { | 9 void PolicyProcessor::SetInternalState(size_t index, EvalResult result) { |
10 state_.current_index_ = index; | 10 state_.current_index_ = index; |
11 state_.current_result_ = result; | 11 state_.current_result_ = result; |
12 } | 12 } |
13 | 13 |
14 EvalResult PolicyProcessor::GetAction() const { | 14 EvalResult PolicyProcessor::GetAction() const { |
15 return state_.current_result_; | 15 return state_.current_result_; |
16 } | 16 } |
17 | 17 |
18 // Decides if an opcode can be skipped (not evaluated) or not. The function | 18 // Decides if an opcode can be skipped (not evaluated) or not. The function |
19 // takes as inputs the opcode and the current evaluation context and returns | 19 // takes as inputs the opcode and the current evaluation context and returns |
20 // true if the opcode should be skipped or not and also can set keep_skipping | 20 // true if the opcode should be skipped or not and also can set keep_skipping |
21 // to false to signal that the current instruction should be skipped but not | 21 // to false to signal that the current instruction should be skipped but not |
22 // the next after the current one. | 22 // the next after the current one. |
23 bool SkipOpcode(PolicyOpcode& opcode, MatchContext* context, | 23 bool SkipOpcode(const PolicyOpcode& opcode, MatchContext* context, |
24 bool* keep_skipping) { | 24 bool* keep_skipping) { |
25 if (opcode.IsAction()) { | 25 if (opcode.IsAction()) { |
26 uint32 options = context->options; | 26 uint32 options = context->options; |
27 context->Clear(); | 27 context->Clear(); |
28 *keep_skipping = false; | 28 *keep_skipping = false; |
29 return (kPolUseOREval == options)? false : true; | 29 return (kPolUseOREval != options); |
30 } | 30 } |
31 *keep_skipping = true; | 31 *keep_skipping = true; |
32 return true; | 32 return true; |
33 } | 33 } |
34 | 34 |
35 PolicyResult PolicyProcessor::Evaluate(uint32 options, | 35 PolicyResult PolicyProcessor::Evaluate(uint32 options, |
36 ParameterSet* parameters, | 36 ParameterSet* parameters, |
37 size_t param_count) { | 37 size_t param_count) { |
38 if (NULL == policy_) { | 38 if (NULL == policy_) { |
39 return NO_POLICY_MATCH; | 39 return NO_POLICY_MATCH; |
(...skipping 58 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
98 if (evaluation) { | 98 if (evaluation) { |
99 // Reaching the end of the policy with a positive evaluation is probably | 99 // Reaching the end of the policy with a positive evaluation is probably |
100 // an error: we did not find a final action opcode? | 100 // an error: we did not find a final action opcode? |
101 return POLICY_ERROR; | 101 return POLICY_ERROR; |
102 } | 102 } |
103 return NO_POLICY_MATCH; | 103 return NO_POLICY_MATCH; |
104 } | 104 } |
105 | 105 |
106 | 106 |
107 } // namespace sandbox | 107 } // namespace sandbox |
OLD | NEW |