diff options
author | Dan Sinclair <dsinclair@chromium.org> | 2017-05-25 14:04:59 -0400 |
---|---|---|
committer | Chromium commit bot <commit-bot@chromium.org> | 2017-05-25 18:17:31 +0000 |
commit | 5acacd361b15b82a8b30cdd5cb92abb8a2104ecf (patch) | |
tree | f602c78b802f67f41ea2099f8c7051a324060162 /core/fpdfapi/page/cpdf_psfunc.cpp | |
parent | e0e2cd4f8a5634f2878f9b3bf3ce321ffd53a980 (diff) | |
download | pdfium-5acacd361b15b82a8b30cdd5cb92abb8a2104ecf.tar.xz |
Break apart the pageint.h file.
This CL separates pageint.h and the supporting cpp files into indivudal
class files.
Change-Id: Idcadce41976a8cd5f0d916e6a5ebbc283fd36527
Reviewed-on: https://pdfium-review.googlesource.com/5930
Commit-Queue: dsinclair <dsinclair@chromium.org>
Reviewed-by: Tom Sepez <tsepez@chromium.org>
Diffstat (limited to 'core/fpdfapi/page/cpdf_psfunc.cpp')
-rw-r--r-- | core/fpdfapi/page/cpdf_psfunc.cpp | 34 |
1 files changed, 34 insertions, 0 deletions
diff --git a/core/fpdfapi/page/cpdf_psfunc.cpp b/core/fpdfapi/page/cpdf_psfunc.cpp new file mode 100644 index 0000000000..debbbd6e6d --- /dev/null +++ b/core/fpdfapi/page/cpdf_psfunc.cpp @@ -0,0 +1,34 @@ +// Copyright 2017 PDFium Authors. All rights reserved. +// Use of this source code is governed by a BSD-style license that can be +// found in the LICENSE file. + +// Original code copyright 2014 Foxit Software Inc. http://www.foxitsoftware.com + +#include "core/fpdfapi/page/cpdf_psfunc.h" + +#include "core/fpdfapi/parser/cpdf_stream_acc.h" +#include "third_party/base/ptr_util.h" + +CPDF_PSFunc::CPDF_PSFunc() : CPDF_Function(Type::kType4PostScript) {} + +CPDF_PSFunc::~CPDF_PSFunc() {} + +bool CPDF_PSFunc::v_Init(CPDF_Object* pObj) { + auto pAcc = pdfium::MakeRetain<CPDF_StreamAcc>(pObj->AsStream()); + pAcc->LoadAllData(false); + return m_PS.Parse(reinterpret_cast<const char*>(pAcc->GetData()), + pAcc->GetSize()); +} + +bool CPDF_PSFunc::v_Call(float* inputs, float* results) const { + CPDF_PSEngine& PS = const_cast<CPDF_PSEngine&>(m_PS); + PS.Reset(); + for (uint32_t i = 0; i < m_nInputs; i++) + PS.Push(inputs[i]); + PS.Execute(); + if (PS.GetStackSize() < m_nOutputs) + return false; + for (uint32_t i = 0; i < m_nOutputs; i++) + results[m_nOutputs - i - 1] = PS.Pop(); + return true; +} |