sx_function.hpp
1 /*
2  * This file is part of CasADi.
3  *
4  * CasADi -- A symbolic framework for dynamic optimization.
5  * Copyright (C) 2010-2023 Joel Andersson, Joris Gillis, Moritz Diehl,
6  * KU Leuven. All rights reserved.
7  * Copyright (C) 2011-2014 Greg Horn
8  *
9  * CasADi is free software; you can redistribute it and/or
10  * modify it under the terms of the GNU Lesser General Public
11  * License as published by the Free Software Foundation; either
12  * version 3 of the License, or (at your option) any later version.
13  *
14  * CasADi is distributed in the hope that it will be useful,
15  * but WITHOUT ANY WARRANTY; without even the implied warranty of
16  * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
17  * Lesser General Public License for more details.
18  *
19  * You should have received a copy of the GNU Lesser General Public
20  * License along with CasADi; if not, write to the Free Software
21  * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA
22  *
23  */
24 
25 
26 #ifndef CASADI_SX_FUNCTION_HPP
27 #define CASADI_SX_FUNCTION_HPP
28 
29 #include "x_function.hpp"
30 
32 
33 namespace casadi {
37  struct ScalarAtomic {
38  int op;
39  int i0;
40  union {
41  double d;
42  struct { int i1, i2; };
43  };
44  };
45 
53 class CASADI_EXPORT SXFunction :
54  public XFunction<SXFunction, Matrix<SXElem>, SXNode>{
55  public:
59  SXFunction(const std::string& name,
60  const std::vector<Matrix<SXElem> >& inputv,
61  const std::vector<Matrix<SXElem> >& outputv,
62  const std::vector<std::string>& name_in,
63  const std::vector<std::string>& name_out);
64 
68  ~SXFunction() override;
69 
73  int eval(const double** arg, double** res, casadi_int* iw, double* w, void* mem) const override;
74 
78  int eval_sx(const SXElem** arg, SXElem** res,
79  casadi_int* iw, SXElem* w, void* mem,
80  bool always_inline, bool never_inline) const override;
81 
85  void eval_mx(const MXVector& arg, MXVector& res,
86  bool always_inline, bool never_inline) const override;
87 
89  bool should_inline(bool with_sx, bool always_inline, bool never_inline) const override;
90 
94  void ad_forward(const std::vector<std::vector<SX> >& fseed,
95  std::vector<std::vector<SX> >& fsens) const;
96 
100  void ad_reverse(const std::vector<std::vector<SX> >& aseed,
101  std::vector<std::vector<SX> >& asens) const;
102 
106  bool is_smooth() const;
107 
108  // print an element of an algorithm
109  std::string print(const ScalarAtomic& a) const;
110 
111  // Print the input arguments of an instruction
112  void print_arg(std::ostream &stream, casadi_int k, const ScalarAtomic& el,
113  const double* w) const;
114 
115  // Print the input arguments of an instruction
116  void print_arg(CodeGenerator& g, casadi_int k, const ScalarAtomic& el) const;
117 
118  // Print the output arguments of an instruction
119  void print_res(std::ostream &stream, casadi_int k, const ScalarAtomic& el,
120  const double* w) const;
121 
122  // Print the output arguments of an instruction
123  void print_res(CodeGenerator& g, casadi_int k, const ScalarAtomic& el) const;
124 
128  void disp_more(std::ostream& stream) const override;
129 
133  std::string class_name() const override {return "SXFunction";}
134 
138  bool is_a(const std::string& type, bool recursive) const override;
139 
141 
144  const SX sx_in(casadi_int ind) const override;
145  const std::vector<SX> sx_in() const override;
147 
149  std::vector<SX> free_sx() const override {
150  std::vector<SX> ret(free_vars_.size());
151  std::copy(free_vars_.begin(), free_vars_.end(), ret.begin());
152  return ret;
153  }
154 
158  bool has_free() const override { return !free_vars_.empty();}
159 
163  std::vector<std::string> get_free() const override {
164  std::vector<std::string> ret;
165  for (auto&& e : free_vars_) ret.push_back(e.name());
166  return ret;
167  }
168 
172  std::vector<std::string> get_function() const override;
173 
177  const Function& get_function(const std::string &name) const override;
178 
182  SX hess(casadi_int iind=0, casadi_int oind=0);
183 
187  casadi_int n_instructions() const override { return algorithm_.size();}
188 
192  casadi_int instruction_id(casadi_int k) const override { return algorithm_.at(k).op;}
193 
197  std::vector<casadi_int> instruction_input(casadi_int k) const override {
198  auto e = algorithm_.at(k);
199  if (e.op==OP_CALL) {
200  const ExtendedAlgEl& m = call_.el[e.i1];
201  return vector_static_cast<casadi_int>(m.dep);
202  } else if (casadi_math<double>::ndeps(e.op)==2 || e.op==OP_INPUT) {
203  return {e.i1, e.i2};
204  } else if (casadi_math<double>::ndeps(e.op)==1) {
205  return {e.i1};
206  } else {
207  return {};
208  }
209  }
210 
214  double instruction_constant(casadi_int k) const override {
215  return algorithm_.at(k).d;
216  }
217 
221  std::vector<casadi_int> instruction_output(casadi_int k) const override {
222  auto e = algorithm_.at(k);
223  if (e.op==OP_CALL) {
224  const ExtendedAlgEl& m = call_.el[e.i1];
225  return vector_static_cast<casadi_int>(m.res);
226  } else if (e.op==OP_OUTPUT) {
227  return {e.i0, e.i2};
228  } else {
229  return {e.i0};
230  }
231  }
232 
236  casadi_int n_nodes() const override { return algorithm_.size() - nnz_out();}
237 
245  typedef ScalarAtomic AlgEl;
246 
250  template<typename T>
251  struct TapeEl {
252  T d[2];
253  };
254 
258  std::vector<AlgEl> algorithm_;
259 
260  // Work vector size
261  size_t worksize_;
262 
264  std::vector<SXElem> free_vars_;
265 
267  std::vector<SXElem> operations_;
268 
270  std::vector<SXElem> constants_;
271 
273  std::vector<double> default_in_;
274 
276  std::vector<bool> copy_elision_;
277 
279  bool print_instructions_;
280 
284  void serialize_body(SerializingStream &s) const override;
285 
286  // call node information that won't fit into AlgEl
287  struct ExtendedAlgEl {
288  ExtendedAlgEl(const Function& fun);
289  Function f;
290  // Work vector indices of the arguments (cfr AlgEl::arg)
291  std::vector<int> dep;
292  // Work vector indices of the results (cfr AlgEl::res)
293  std::vector<int> res;
294 
295  std::vector<int> copy_elision_arg;
296  std::vector<int> copy_elision_offset;
297 
298  // Following fields are redundant but will increase eval speed
299  casadi_int n_dep;
300  casadi_int n_res;
301  casadi_int f_n_in;
302  casadi_int f_n_out;
303  std::vector<int> f_nnz_in;
304  std::vector<int> f_nnz_out;
305  };
306 
308  struct CallInfo {
309  // Maximum memory requirements across all call nodes
310  size_t sz_arg = 0, sz_res = 0, sz_iw = 0, sz_w = 0;
311  size_t sz_w_arg = 0, sz_w_res = 0;
312  std::vector<ExtendedAlgEl> el;
313  } call_;
314 
318  static ProtoFunction* deserialize(DeserializingStream& s);
319 
320  static std::vector<SX> order(const std::vector<SX>& expr);
321 
323 
326  static const Options options_;
327  const Options& get_options() const override { return options_;}
329 
331  Dict generate_options(const std::string& target="clone") const override;
332 
336  void init(const Dict& opts) override;
337 
341  void init_copy_elision();
342 
346  size_t codegen_sz_w(const CodeGenerator& g) const override;
347 
351  void codegen_declarations(CodeGenerator& g) const override;
352 
356  void codegen_body(CodeGenerator& g) const override;
357 
361  int sp_forward(const bvec_t** arg, bvec_t** res,
362  casadi_int* iw, bvec_t* w, void* mem) const override;
363 
367  int eval_activity(const bvec_t** arg, bvec_t** res,
368  casadi_int* iw, bvec_t* w, void* mem) const override;
369 
373  int sp_reverse(bvec_t** arg, bvec_t** res, casadi_int* iw, bvec_t* w, void* mem) const override;
374 
378  SX instructions_sx() const override;
379 
380  // Get all embedded functions, recursively
381  void find(std::map<FunctionInternal*, std::pair<Function, size_t> >& all_fun,
382  casadi_int max_depth) const override;
383 
387  void change_option(const std::string& option_name, const GenericType& option_value) override;
388 
392  double get_default_in(casadi_int ind) const override { return default_in_.at(ind);}
393 
397  void export_code_body(const std::string& lang,
398  std::ostream &stream, const Dict& options) const override;
399 
401  bool just_in_time_opencl_;
402 
404  bool just_in_time_sparsity_;
405 
407  bool live_variables_;
408 
409 protected:
410  template<typename T>
411  void call_fwd(const AlgEl& e, const T** arg, T** res, casadi_int* iw, T* w) const;
412 
413  // Activity propagation through a call node
414  void call_activity(const AlgEl& e, const bvec_t** arg, bvec_t** res,
415  casadi_int* iw, bvec_t* w) const;
416 
417  template<typename T>
418  void call_rev(const AlgEl& e, T** arg, T** res, casadi_int* iw, T* w) const;
419 
420  template<typename T, typename CT>
421  void call_setup(const ExtendedAlgEl& m,
422  CT*** call_arg, T*** call_res, casadi_int** call_iw, T** call_w, T** nz_in, T** nz_out) const;
423 
427  explicit SXFunction(DeserializingStream& s);
428 };
429 
430 
431 } // namespace casadi
432 
434 #endif // CASADI_SX_FUNCTION_HPP
The casadi namespace.
Definition: archiver.hpp:32
std::vector< MX > MXVector
Definition: mx.hpp:1107
Matrix< SXElem > SX
Definition: sx_fwd.hpp:32
GenericType::Dict Dict
C++ equivalent of Python's dict or MATLAB's struct.