OLD | NEW |
1 // Copyright 2014 PDFium Authors. All rights reserved. | 1 // Copyright 2014 PDFium 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 // Original code copyright 2014 Foxit Software Inc. http://www.foxitsoftware.com | 5 // Original code copyright 2014 Foxit Software Inc. http://www.foxitsoftware.com |
6 | 6 |
7 #include "core/fpdfapi/fpdf_page/pageint.h" | 7 #include "core/fpdfapi/fpdf_page/pageint.h" |
8 | 8 |
9 #include <limits.h> | 9 #include <limits.h> |
10 | 10 |
11 #include <memory> | 11 #include <memory> |
12 #include <utility> | 12 #include <utility> |
13 #include <vector> | 13 #include <vector> |
14 | 14 |
15 #include "core/include/fpdfapi/cpdf_array.h" | 15 #include "core/fpdfapi/fpdf_parser/include/cpdf_array.h" |
16 #include "core/include/fpdfapi/cpdf_dictionary.h" | 16 #include "core/fpdfapi/fpdf_parser/include/cpdf_dictionary.h" |
17 #include "core/include/fpdfapi/cpdf_simple_parser.h" | 17 #include "core/fpdfapi/fpdf_parser/include/cpdf_simple_parser.h" |
18 #include "core/include/fpdfapi/fpdf_module.h" | |
19 #include "core/include/fpdfapi/fpdf_page.h" | 18 #include "core/include/fpdfapi/fpdf_page.h" |
20 #include "core/include/fxcrt/fx_safe_types.h" | 19 #include "core/include/fxcrt/fx_safe_types.h" |
21 #include "third_party/base/numerics/safe_conversions_impl.h" | 20 #include "third_party/base/numerics/safe_conversions_impl.h" |
22 | 21 |
23 namespace { | 22 namespace { |
24 | 23 |
25 enum PDF_PSOP { | 24 enum PDF_PSOP { |
26 PSOP_ADD, | 25 PSOP_ADD, |
27 PSOP_SUB, | 26 PSOP_SUB, |
28 PSOP_MUL, | 27 PSOP_MUL, |
(...skipping 928 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
957 for (int i = 0; i < m_nOutputs; i++) { | 956 for (int i = 0; i < m_nOutputs; i++) { |
958 if (results[i] < m_pRanges[i * 2]) { | 957 if (results[i] < m_pRanges[i * 2]) { |
959 results[i] = m_pRanges[i * 2]; | 958 results[i] = m_pRanges[i * 2]; |
960 } else if (results[i] > m_pRanges[i * 2 + 1]) { | 959 } else if (results[i] > m_pRanges[i * 2 + 1]) { |
961 results[i] = m_pRanges[i * 2 + 1]; | 960 results[i] = m_pRanges[i * 2 + 1]; |
962 } | 961 } |
963 } | 962 } |
964 } | 963 } |
965 return TRUE; | 964 return TRUE; |
966 } | 965 } |
OLD | NEW |