DynamicModel.cc 291 KB
Newer Older
sebastien's avatar
sebastien committed
1
/*
2
 * Copyright (C) 2003-2018 Dynare Team
sebastien's avatar
sebastien committed
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
 *
 * This file is part of Dynare.
 *
 * Dynare is free software: you can redistribute it and/or modify
 * it under the terms of the GNU General Public License as published by
 * the Free Software Foundation, either version 3 of the License, or
 * (at your option) any later version.
 *
 * Dynare is distributed in the hope that it will be useful,
 * but WITHOUT ANY WARRANTY; without even the implied warranty of
 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
 * GNU General Public License for more details.
 *
 * You should have received a copy of the GNU General Public License
 * along with Dynare.  If not, see <http://www.gnu.org/licenses/>.
 */

20
#include <iostream>
sebastien's avatar
sebastien committed
21
#include <cmath>
22
#include <cstdlib>
23
#include <cassert>
24
25
#include <cstdio>
#include <cerrno>
26
#include <algorithm>
Ferhat Mihoubi's avatar
Ferhat Mihoubi committed
27
#include <iterator>
28
#include <numeric>
sebastien's avatar
sebastien committed
29
30
31
32
33
34
35
36
37
38
39
40
#include "DynamicModel.hh"

// For mkdir() and chdir()
#ifdef _WIN32
# include <direct.h>
#else
# include <unistd.h>
# include <sys/stat.h>
# include <sys/types.h>
#endif

DynamicModel::DynamicModel(SymbolTable &symbol_table_arg,
41
42
43
                           NumericalConstants &num_constants_arg,
                           ExternalFunctionsTable &external_functions_table_arg) :
  ModelTree(symbol_table_arg, num_constants_arg, external_functions_table_arg),
44
45
46
47
  max_lag(0), max_lead(0),
  max_endo_lag(0), max_endo_lead(0),
  max_exo_lag(0), max_exo_lead(0),
  max_exo_det_lag(0), max_exo_det_lead(0),
48
49
50
51
  max_lag_orig(0), max_lead_orig(0),
  max_endo_lag_orig(0), max_endo_lead_orig(0),
  max_exo_lag_orig(0), max_exo_lead_orig(0),
  max_exo_det_lag_orig(0), max_exo_det_lead_orig(0),
52
  dynJacobianColsNbr(0),
53
  global_temporary_terms(true)
sebastien's avatar
sebastien committed
54
55
56
{
}

sebastien's avatar
sebastien committed
57
58
VariableNode *
DynamicModel::AddVariable(int symb_id, int lag)
sebastien's avatar
sebastien committed
59
{
sebastien's avatar
sebastien committed
60
  return AddVariableInternal(symb_id, lag);
sebastien's avatar
sebastien committed
61
62
}

sebastien's avatar
sebastien committed
63
void
64
DynamicModel::compileDerivative(ofstream &code_file, unsigned int &instruction_number, int eq, int symb_id, int lag, const map_idx_t &map_idx) const
65
{
66
  auto it = first_derivatives.find({ eq, getDerivID(symbol_table.getID(eEndogenous, symb_id), lag) });
67
  if (it != first_derivatives.end())
68
    (it->second)->compile(code_file, instruction_number, false, temporary_terms, map_idx, true, false);
69
70
71
  else
    {
      FLDZ_ fldz;
72
      fldz.write(code_file, instruction_number);
73
74
    }
}
75
76

void
77
DynamicModel::compileChainRuleDerivative(ofstream &code_file, unsigned int &instruction_number, int eqr, int varr, int lag, const map_idx_t &map_idx) const
78
{
79
  auto it = first_chain_rule_derivatives.find({ eqr, { varr, lag } });
80
  if (it != first_chain_rule_derivatives.end())
81
    (it->second)->compile(code_file, instruction_number, false, temporary_terms, map_idx, true, false);
82
  else
83
84
    {
      FLDZ_ fldz;
85
      fldz.write(code_file, instruction_number);
86
    }
87
88
}

sebastien's avatar
sebastien committed
89
void
90
DynamicModel::computeTemporaryTermsOrdered()
sebastien's avatar
sebastien committed
91
{
92
  map<expr_t, pair<int, int>> first_occurence;
93
  map<expr_t, int> reference_count;
sebastien's avatar
sebastien committed
94
  BinaryOpNode *eq_node;
95
96
  first_derivatives_t::const_iterator it;
  first_chain_rule_derivatives_t::const_iterator it_chr;
sebastien's avatar
sebastien committed
97
  ostringstream tmp_s;
98
99
  v_temporary_terms.clear();
  map_idx.clear();
sebastien's avatar
sebastien committed
100

101
  unsigned int nb_blocks = getNbBlocks();
102
  v_temporary_terms = vector<vector<temporary_terms_t>>(nb_blocks);
103
  v_temporary_terms_inuse = vector<temporary_terms_inuse_t>(nb_blocks);
sebastien's avatar
sebastien committed
104
  temporary_terms.clear();
105

106
  if (!global_temporary_terms)
107
108
    {
      for (unsigned int block = 0; block < nb_blocks; block++)
sebastien's avatar
sebastien committed
109
        {
110
111
112
113
114
          reference_count.clear();
          temporary_terms.clear();
          unsigned int block_size = getBlockSize(block);
          unsigned int block_nb_mfs = getBlockMfs(block);
          unsigned int block_nb_recursives = block_size - block_nb_mfs;
115
          v_temporary_terms[block] = vector<temporary_terms_t>(block_size);
116
          for (unsigned int i = 0; i < block_size; i++)
sebastien's avatar
sebastien committed
117
            {
118
              if (i < block_nb_recursives && isBlockEquationRenormalized(block, i))
119
                getBlockEquationRenormalizedExpr(block, i)->computeTemporaryTerms(reference_count, temporary_terms, first_occurence, block, v_temporary_terms,  i);
120
              else
sebastien's avatar
sebastien committed
121
                {
122
                  eq_node = (BinaryOpNode *) getBlockEquationExpr(block, i);
123
                  eq_node->computeTemporaryTerms(reference_count, temporary_terms, first_occurence, block, v_temporary_terms,  i);
sebastien's avatar
sebastien committed
124
125
                }
            }
126
          for (block_derivatives_equation_variable_laglead_nodeid_t::const_iterator it = blocks_derivatives[block].begin(); it != (blocks_derivatives[block]).end(); it++)
127
            {
128
              expr_t id = it->second.second;
129
130
              id->computeTemporaryTerms(reference_count, temporary_terms, first_occurence, block, v_temporary_terms,  block_size-1);
            }
131
          for (derivative_t::const_iterator it = derivative_endo[block].begin(); it != derivative_endo[block].end(); it++)
132
            it->second->computeTemporaryTerms(reference_count, temporary_terms, first_occurence, block, v_temporary_terms,  block_size-1);
133
          for (derivative_t::const_iterator it = derivative_other_endo[block].begin(); it != derivative_other_endo[block].end(); it++)
134
135
136
137
            it->second->computeTemporaryTerms(reference_count, temporary_terms, first_occurence, block, v_temporary_terms,  block_size-1);
          set<int> temporary_terms_in_use;
          temporary_terms_in_use.clear();
          v_temporary_terms_inuse[block] = temporary_terms_in_use;
sebastien's avatar
sebastien committed
138
139
        }
    }
140
  else
sebastien's avatar
sebastien committed
141
    {
142
      for (unsigned int block = 0; block < nb_blocks; block++)
sebastien's avatar
sebastien committed
143
        {
144
145
146
147
          // Compute the temporary terms reordered
          unsigned int block_size = getBlockSize(block);
          unsigned int block_nb_mfs = getBlockMfs(block);
          unsigned int block_nb_recursives = block_size - block_nb_mfs;
148
          v_temporary_terms[block] = vector<temporary_terms_t>(block_size);
149
          for (unsigned int i = 0; i < block_size; i++)
150
            {
151
              if (i < block_nb_recursives && isBlockEquationRenormalized(block, i))
152
                getBlockEquationRenormalizedExpr(block, i)->computeTemporaryTerms(reference_count, temporary_terms, first_occurence, block, v_temporary_terms,  i);
153
154
              else
                {
155
                  eq_node = (BinaryOpNode *) getBlockEquationExpr(block, i);
156
157
                  eq_node->computeTemporaryTerms(reference_count, temporary_terms, first_occurence, block, v_temporary_terms, i);
                }
158
            }
159
          for (block_derivatives_equation_variable_laglead_nodeid_t::const_iterator it = blocks_derivatives[block].begin(); it != (blocks_derivatives[block]).end(); it++)
sebastien's avatar
sebastien committed
160
            {
161
              expr_t id = it->second.second;
162
              id->computeTemporaryTerms(reference_count, temporary_terms, first_occurence, block, v_temporary_terms, block_size-1);
sebastien's avatar
sebastien committed
163
            }
164
          for (derivative_t::const_iterator it = derivative_endo[block].begin(); it != derivative_endo[block].end(); it++)
165
            it->second->computeTemporaryTerms(reference_count, temporary_terms, first_occurence, block, v_temporary_terms, block_size-1);
166
          for (derivative_t::const_iterator it = derivative_other_endo[block].begin(); it != derivative_other_endo[block].end(); it++)
167
            it->second->computeTemporaryTerms(reference_count, temporary_terms, first_occurence, block, v_temporary_terms, block_size-1);
168
        }
169
      for (unsigned int block = 0; block < nb_blocks; block++)
170
        {
171
172
173
174
175
176
          // Collect the temporary terms reordered
          unsigned int block_size = getBlockSize(block);
          unsigned int block_nb_mfs = getBlockMfs(block);
          unsigned int block_nb_recursives = block_size - block_nb_mfs;
          set<int> temporary_terms_in_use;
          for (unsigned int i = 0; i < block_size; i++)
sebastien's avatar
sebastien committed
177
            {
178
              if (i < block_nb_recursives && isBlockEquationRenormalized(block, i))
179
                getBlockEquationRenormalizedExpr(block, i)->collectTemporary_terms(temporary_terms, temporary_terms_in_use, block);
180
              else
sebastien's avatar
sebastien committed
181
                {
182
                  eq_node = (BinaryOpNode *) getBlockEquationExpr(block, i);
183
                  eq_node->collectTemporary_terms(temporary_terms, temporary_terms_in_use, block);
sebastien's avatar
sebastien committed
184
185
                }
            }
186
          for (block_derivatives_equation_variable_laglead_nodeid_t::const_iterator it = blocks_derivatives[block].begin(); it != (blocks_derivatives[block]).end(); it++)
187
            {
188
              expr_t id = it->second.second;
189
190
              id->collectTemporary_terms(temporary_terms, temporary_terms_in_use, block);
            }
191
          for (derivative_t::const_iterator it = derivative_endo[block].begin(); it != derivative_endo[block].end(); it++)
192
            it->second->collectTemporary_terms(temporary_terms, temporary_terms_in_use, block);
193
          for (derivative_t::const_iterator it = derivative_other_endo[block].begin(); it != derivative_other_endo[block].end(); it++)
194
            it->second->collectTemporary_terms(temporary_terms, temporary_terms_in_use, block);
195
196
197
198
          for (derivative_t::const_iterator it = derivative_exo[block].begin(); it != derivative_exo[block].end(); it++)
            it->second->collectTemporary_terms(temporary_terms, temporary_terms_in_use, block);
          for (derivative_t::const_iterator it = derivative_exo_det[block].begin(); it != derivative_exo_det[block].end(); it++)
            it->second->collectTemporary_terms(temporary_terms, temporary_terms_in_use, block);
199
          v_temporary_terms_inuse[block] = temporary_terms_in_use;
sebastien's avatar
sebastien committed
200
        }
201
      computeTemporaryTermsMapping();
sebastien's avatar
sebastien committed
202
203
204
    }
}

205
206
207
208
209
void
DynamicModel::computeTemporaryTermsMapping()
{
  // Add a mapping form node ID to temporary terms order
  int j = 0;
210
211
  for (auto temporary_term : temporary_terms)
    map_idx[temporary_term->idx] = j++;
212
213
}

sebastien's avatar
sebastien committed
214
void
215
DynamicModel::writeModelEquationsOrdered_M(const string &dynamic_basename) const
216
217
218
{
  string tmp_s, sps;
  ostringstream tmp_output, tmp1_output, global_output;
219
  expr_t lhs = nullptr, rhs = nullptr;
220
  BinaryOpNode *eq_node;
221
222
  ostringstream Ufoss;
  vector<string> Uf(symbol_table.endo_nbr(), "");
223
  map<expr_t, int> reference_count;
224
  temporary_terms_t local_temporary_terms;
225
  ofstream  output;
226
  int nze, nze_exo, nze_exo_det, nze_other_endo;
227
228
  vector<int> feedback_variables;
  ExprNodeOutputType local_output_type;
229
  Ufoss.str("");
sebastien's avatar
sebastien committed
230

Sébastien Villemot's avatar
Sébastien Villemot committed
231
  local_output_type = oMatlabDynamicModelSparse;
232
  if (global_temporary_terms)
Sébastien Villemot's avatar
Sébastien Villemot committed
233
    local_temporary_terms = temporary_terms;
234
235
236
237
238
239
240
241
242
243
244
245

  //----------------------------------------------------------------------
  //For each block
  for (unsigned int block = 0; block < getNbBlocks(); block++)
    {

      //recursive_variables.clear();
      feedback_variables.clear();
      //For a block composed of a single equation determines wether we have to evaluate or to solve the equation
      nze = derivative_endo[block].size();
      nze_other_endo = derivative_other_endo[block].size();
      nze_exo = derivative_exo[block].size();
246
      nze_exo_det = derivative_exo_det[block].size();
247
248
249
250
      BlockSimulationType simulation_type = getBlockSimulationType(block);
      unsigned int block_size = getBlockSize(block);
      unsigned int block_mfs = getBlockMfs(block);
      unsigned int block_recursive = block_size - block_mfs;
251
      deriv_node_temp_terms_t tef_terms;
Sébastien Villemot's avatar
Sébastien Villemot committed
252
      local_output_type = oMatlabDynamicModelSparse;
253
      if (global_temporary_terms)
Sébastien Villemot's avatar
Sébastien Villemot committed
254
        local_temporary_terms = temporary_terms;
255

256
257
      int prev_lag;
      unsigned int prev_var, count_col, count_col_endo, count_col_exo, count_col_exo_det, count_col_other_endo;
258
      map<pair<int, pair<int, int>>, expr_t> tmp_block_endo_derivative;
259
      for (auto it = blocks_derivatives[block].begin(); it != (blocks_derivatives[block]).end(); it++)
260
        tmp_block_endo_derivative[{ it->second.first, { it->first.second, it->first.first } }] = it->second.second;
261
262
263
      prev_var = 999999999;
      prev_lag = -9999999;
      count_col_endo = 0;
264
      for (map<pair<int, pair<int, int>>, expr_t>::const_iterator it = tmp_block_endo_derivative.begin(); it != tmp_block_endo_derivative.end(); it++)
265
266
267
268
269
270
271
272
273
274
        {
          int lag = it->first.first;
          unsigned int var = it->first.second.first;
          if (var != prev_var || lag != prev_lag)
            {
              prev_var = var;
              prev_lag = lag;
              count_col_endo++;
            }
        }
275
      map<pair<int, pair<int, int>>, expr_t> tmp_block_exo_derivative;
276
      for (auto it = derivative_exo[block].begin(); it != (derivative_exo[block]).end(); it++)
277
        tmp_block_exo_derivative[{ it->first.first, { it->first.second.second, it->first.second.first } }] = it->second;
278
279
280
      prev_var = 999999999;
      prev_lag = -9999999;
      count_col_exo = 0;
281
      for (map<pair<int, pair<int, int>>, expr_t>::const_iterator it = tmp_block_exo_derivative.begin(); it != tmp_block_exo_derivative.end(); it++)
282
283
284
285
286
287
288
289
290
291
        {
          int lag = it->first.first;
          unsigned int var = it->first.second.first;
          if (var != prev_var || lag != prev_lag)
            {
              prev_var = var;
              prev_lag = lag;
              count_col_exo++;
            }
        }
292
      map<pair<int, pair<int, int>>, expr_t> tmp_block_exo_det_derivative;
293
      for (auto it = derivative_exo_det[block].begin(); it != (derivative_exo_det[block]).end(); it++)
294
        tmp_block_exo_det_derivative[{ it->first.first, { it->first.second.second, it->first.second.first } }] = it->second;
295
296
297
      prev_var = 999999999;
      prev_lag = -9999999;
      count_col_exo_det = 0;
298
      for (map<pair<int, pair<int, int>>, expr_t>::const_iterator it = tmp_block_exo_derivative.begin(); it != tmp_block_exo_derivative.end(); it++)
299
300
301
302
303
304
305
306
307
308
        {
          int lag = it->first.first;
          unsigned int var = it->first.second.first;
          if (var != prev_var || lag != prev_lag)
            {
              prev_var = var;
              prev_lag = lag;
              count_col_exo_det++;
            }
        }
309
      map<pair<int, pair<int, int>>, expr_t> tmp_block_other_endo_derivative;
310
      for (auto it = derivative_other_endo[block].begin(); it != (derivative_other_endo[block]).end(); it++)
311
        tmp_block_other_endo_derivative[{ it->first.first, { it->first.second.second, it->first.second.first } }] = it->second;
312
313
314
      prev_var = 999999999;
      prev_lag = -9999999;
      count_col_other_endo = 0;
315
      for (map<pair<int, pair<int, int>>, expr_t>::const_iterator it = tmp_block_other_endo_derivative.begin(); it != tmp_block_other_endo_derivative.end(); it++)
316
317
318
319
320
321
322
323
324
325
326
        {
          int lag = it->first.first;
          unsigned int var = it->first.second.first;
          if (var != prev_var || lag != prev_lag)
            {
              prev_var = var;
              prev_lag = lag;
              count_col_other_endo++;
            }
        }

327
328
329
330
331
332
333
334
335
336
337
      tmp1_output.str("");
      tmp1_output << dynamic_basename << "_" << block+1 << ".m";
      output.open(tmp1_output.str().c_str(), ios::out | ios::binary);
      output << "%\n";
      output << "% " << tmp1_output.str() << " : Computes dynamic model for Dynare\n";
      output << "%\n";
      output << "% Warning : this file is generated automatically by Dynare\n";
      output << "%           from model file (.mod)\n\n";
      output << "%/\n";
      if (simulation_type == EVALUATE_BACKWARD || simulation_type == EVALUATE_FORWARD)
        {
338
          output << "function [y, g1, g2, g3, varargout] = " << dynamic_basename << "_" << block+1 << "(y, x, params, steady_state, jacobian_eval, y_kmin, periods)\n";
339
340
        }
      else if (simulation_type == SOLVE_FORWARD_COMPLETE || simulation_type == SOLVE_BACKWARD_COMPLETE)
341
        output << "function [residual, y, g1, g2, g3, varargout] = " << dynamic_basename << "_" << block+1 << "(y, x, params, steady_state, it_, jacobian_eval)\n";
342
      else if (simulation_type == SOLVE_BACKWARD_SIMPLE || simulation_type == SOLVE_FORWARD_SIMPLE)
343
        output << "function [residual, y, g1, g2, g3, varargout] = " << dynamic_basename << "_" << block+1 << "(y, x, params, steady_state, it_, jacobian_eval)\n";
344
      else
345
        output << "function [residual, y, g1, g2, g3, b, varargout] = " << dynamic_basename << "_" << block+1 << "(y, x, params, steady_state, periods, jacobian_eval, y_kmin, y_size, Periods)\n";
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
      BlockType block_type;
      if (simulation_type == SOLVE_TWO_BOUNDARIES_COMPLETE || simulation_type == SOLVE_TWO_BOUNDARIES_SIMPLE)
        block_type = SIMULTAN;
      else if (simulation_type == SOLVE_FORWARD_COMPLETE || simulation_type == SOLVE_BACKWARD_COMPLETE)
        block_type = SIMULTANS;
      else if ((simulation_type == SOLVE_FORWARD_SIMPLE || simulation_type == SOLVE_BACKWARD_SIMPLE
                || simulation_type == EVALUATE_BACKWARD    || simulation_type == EVALUATE_FORWARD)
               && getBlockFirstEquation(block) < prologue)
        block_type = PROLOGUE;
      else if ((simulation_type == SOLVE_FORWARD_SIMPLE || simulation_type == SOLVE_BACKWARD_SIMPLE
                || simulation_type == EVALUATE_BACKWARD    || simulation_type == EVALUATE_FORWARD)
               && getBlockFirstEquation(block) >= equations.size() - epilogue)
        block_type = EPILOGUE;
      else
        block_type = SIMULTANS;
      output << "  % ////////////////////////////////////////////////////////////////////////" << endl
             << "  % //" << string("                     Block ").substr(int (log10(block + 1))) << block + 1 << " " << BlockType0(block_type)
             << "          //" << endl
             << "  % //                     Simulation type "
             << BlockSim(simulation_type) << "  //" << endl
             << "  % ////////////////////////////////////////////////////////////////////////" << endl;
      //The Temporary terms
      if (simulation_type == EVALUATE_BACKWARD || simulation_type == EVALUATE_FORWARD)
        {
          output << "  if(jacobian_eval)\n";
371
372
          output << "    g1 = spalloc(" << block_mfs  << ", " << count_col_endo << ", " << nze << ");\n";
          output << "    g1_x=spalloc(" << block_size << ", " << count_col_exo  << ", " << nze_exo << ");\n";
373
          output << "    g1_xd=spalloc(" << block_size << ", " << count_col_exo_det  << ", " << nze_exo_det << ");\n";
374
          output << "    g1_o=spalloc(" << block_size << ", " << count_col_other_endo << ", " << nze_other_endo << ");\n";
375
376
377
378
379
          output << "  end;\n";
        }
      else
        {
          output << "  if(jacobian_eval)\n";
380
381
          output << "    g1 = spalloc(" << block_size << ", " << count_col_endo << ", " << nze << ");\n";
          output << "    g1_x=spalloc(" << block_size << ", " << count_col_exo  << ", " << nze_exo << ");\n";
382
          output << "    g1_xd=spalloc(" << block_size << ", " << count_col_exo_det  << ", " << nze_exo_det << ");\n";
383
          output << "    g1_o=spalloc(" << block_size << ", " << count_col_other_endo << ", " << nze_other_endo << ");\n";
384
385
386
          output << "  else\n";
          if (simulation_type == SOLVE_TWO_BOUNDARIES_COMPLETE || simulation_type == SOLVE_TWO_BOUNDARIES_SIMPLE)
            {
387
388
389
              output << "    g1 = spalloc(" << block_mfs << "*Periods, "
                     << block_mfs << "*(Periods+" << max_leadlag_block[block].first+max_leadlag_block[block].second+1 << ")"
                     << ", " << nze << "*Periods);\n";
390
            }
ferhat's avatar
ferhat committed
391
          else
392
393
394
395
396
397
            {
              output << "    g1 = spalloc(" << block_mfs
                     << ", " << block_mfs << ", " << nze << ");\n";
            }
          output << "  end;\n";
        }
398

399
400
401
402
      output << "  g2=0;g3=0;\n";
      if (v_temporary_terms_inuse[block].size())
        {
          tmp_output.str("");
403
404
          for (int it : v_temporary_terms_inuse[block])
            tmp_output << " T" << it;
405
406
407
408
          output << "  global" << tmp_output.str() << ";\n";
        }
      if (simulation_type == SOLVE_TWO_BOUNDARIES_COMPLETE || simulation_type == SOLVE_TWO_BOUNDARIES_SIMPLE)
        {
409
          temporary_terms_t tt2;
410
411
412
413
414
415
416
          tt2.clear();
          for (int i = 0; i < (int) block_size; i++)
            {
              if (v_temporary_terms[block][i].size() && global_temporary_terms)
                {
                  output << "  " << "% //Temporary variables initialization" << endl
                         << "  " << "T_zeros = zeros(y_kmin+periods, 1);" << endl;
417
                  for (auto it : v_temporary_terms[block][i])
418
419
                    {
                      output << "  ";
420
                      // In the following, "Static" is used to avoid getting the "(it_)" subscripting
421
                      it->writeOutput(output, oMatlabStaticModelSparse, local_temporary_terms, {});
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
                      output << " = T_zeros;" << endl;
                    }
                }
            }
        }
      if (simulation_type == SOLVE_BACKWARD_SIMPLE || simulation_type == SOLVE_FORWARD_SIMPLE || simulation_type == SOLVE_BACKWARD_COMPLETE || simulation_type == SOLVE_FORWARD_COMPLETE)
        output << "  residual=zeros(" << block_mfs << ",1);\n";
      else if (simulation_type == SOLVE_TWO_BOUNDARIES_COMPLETE || simulation_type == SOLVE_TWO_BOUNDARIES_SIMPLE)
        output << "  residual=zeros(" << block_mfs << ",y_kmin+periods);\n";
      if (simulation_type == EVALUATE_BACKWARD)
        output << "  for it_ = (y_kmin+periods):y_kmin+1\n";
      if (simulation_type == EVALUATE_FORWARD)
        output << "  for it_ = y_kmin+1:(y_kmin+periods)\n";

      if (simulation_type == SOLVE_TWO_BOUNDARIES_COMPLETE || simulation_type == SOLVE_TWO_BOUNDARIES_SIMPLE)
        {
          output << "  b = zeros(periods*y_size,1);" << endl
                 << "  for it_ = y_kmin+1:(periods+y_kmin)" << endl
                 << "    Per_y_=it_*y_size;" << endl
                 << "    Per_J_=(it_-y_kmin-1)*y_size;" << endl
                 << "    Per_K_=(it_-1)*y_size;" << endl;
          sps = "  ";
        }
      else
        if (simulation_type == EVALUATE_BACKWARD || simulation_type == EVALUATE_FORWARD)
          sps = "  ";
        else
          sps = "";
      // The equations
Houtan Bastani's avatar
Houtan Bastani committed
451
      temporary_terms_idxs_t temporary_terms_idxs;
452
453
      for (unsigned int i = 0; i < block_size; i++)
        {
454
          temporary_terms_t tt2;
455
456
457
458
          tt2.clear();
          if (v_temporary_terms[block].size())
            {
              output << "  " << "% //Temporary variables" << endl;
459
              for (auto it : v_temporary_terms[block][i])
460
                {
461
                  if (dynamic_cast<AbstractExternalFunctionNode *>(it) != nullptr)
462
                    it->writeExternalFunctionOutput(output, local_output_type, tt2, temporary_terms_idxs, tef_terms);
463

464
                  output << "  " <<  sps;
465
                  it->writeOutput(output, local_output_type, local_temporary_terms, {}, tef_terms);
466
                  output << " = ";
467
                  it->writeOutput(output, local_output_type, tt2, {}, tef_terms);
468
                  // Insert current node into tt2
469
                  tt2.insert(it);
470
471
472
473
474
475
476
477
                  output << ";" << endl;
                }
            }

          int variable_ID = getBlockVariableID(block, i);
          int equation_ID = getBlockEquationID(block, i);
          EquationType equ_type = getBlockEquationType(block, i);
          string sModel = symbol_table.getName(symbol_table.getID(eEndogenous, variable_ID));
478
          eq_node = (BinaryOpNode *) getBlockEquationExpr(block, i);
479
480
481
          lhs = eq_node->get_arg1();
          rhs = eq_node->get_arg2();
          tmp_output.str("");
482
          lhs->writeOutput(tmp_output, local_output_type, local_temporary_terms, {});
483
484
485
486
487
488
489
490
491
492
493
494
          switch (simulation_type)
            {
            case EVALUATE_BACKWARD:
            case EVALUATE_FORWARD:
            evaluation:     if (simulation_type == SOLVE_TWO_BOUNDARIES_COMPLETE || simulation_type == SOLVE_TWO_BOUNDARIES_SIMPLE)
                output << "    % equation " << getBlockEquationID(block, i)+1 << " variable : " << sModel
                       << " (" << variable_ID+1 << ") " << c_Equation_Type(equ_type) << endl;
              output << "    ";
              if (equ_type == E_EVALUATE)
                {
                  output << tmp_output.str();
                  output << " = ";
495
                  rhs->writeOutput(output, local_output_type, local_temporary_terms, {});
496
497
498
499
500
501
502
                }
              else if (equ_type == E_EVALUATE_S)
                {
                  output << "%" << tmp_output.str();
                  output << " = ";
                  if (isBlockEquationRenormalized(block, i))
                    {
503
                      rhs->writeOutput(output, local_output_type, local_temporary_terms, {});
504
505
                      output << "\n    ";
                      tmp_output.str("");
506
                      eq_node = (BinaryOpNode *) getBlockEquationRenormalizedExpr(block, i);
507
508
                      lhs = eq_node->get_arg1();
                      rhs = eq_node->get_arg2();
509
                      lhs->writeOutput(output, local_output_type, local_temporary_terms, {});
510
                      output << " = ";
511
                      rhs->writeOutput(output, local_output_type, local_temporary_terms, {});
512
513
514
515
                    }
                }
              else
                {
516
                  cerr << "Type mismatch for equation " << equation_ID+1  << "\n";
517
518
519
520
521
522
523
524
525
526
527
528
                  exit(EXIT_FAILURE);
                }
              output << ";\n";
              break;
            case SOLVE_BACKWARD_SIMPLE:
            case SOLVE_FORWARD_SIMPLE:
            case SOLVE_BACKWARD_COMPLETE:
            case SOLVE_FORWARD_COMPLETE:
              if (i < block_recursive)
                goto evaluation;
              feedback_variables.push_back(variable_ID);
              output << "  % equation " << equation_ID+1 << " variable : " << sModel
529
                     << " (" << variable_ID+1 << ") " << c_Equation_Type(equ_type) << " symb_id=" << symbol_table.getID(eEndogenous, variable_ID) << endl;
530
531
532
533
534
535
536
537
              output << "  " << "residual(" << i+1-block_recursive << ") = (";
              goto end;
            case SOLVE_TWO_BOUNDARIES_COMPLETE:
            case SOLVE_TWO_BOUNDARIES_SIMPLE:
              if (i < block_recursive)
                goto evaluation;
              feedback_variables.push_back(variable_ID);
              output << "    % equation " << equation_ID+1 << " variable : " << sModel
538
                     << " (" << variable_ID+1 << ") " << c_Equation_Type(equ_type) << " symb_id=" << symbol_table.getID(eEndogenous, variable_ID) << endl;
539
              Ufoss << "    b(" << i+1-block_recursive << "+Per_J_) = -residual(" << i+1-block_recursive << ", it_)";
540
              Uf[equation_ID] += Ufoss.str();
541
              Ufoss.str("");
542
543
544
545
546
547
              output << "    residual(" << i+1-block_recursive << ", it_) = (";
              goto end;
            default:
            end:
              output << tmp_output.str();
              output << ") - (";
548
              rhs->writeOutput(output, local_output_type, local_temporary_terms, {});
549
              output << ");\n";
sebastien's avatar
sebastien committed
550
#ifdef CONDITION
551
552
              if (simulation_type == SOLVE_TWO_BOUNDARIES_COMPLETE || simulation_type == SOLVE_TWO_BOUNDARIES_SIMPLE)
                output << "  condition(" << i+1 << ")=0;\n";
sebastien's avatar
sebastien committed
553
#endif
554
555
556
557
            }
        }
      // The Jacobian if we have to solve the block
      if (simulation_type == SOLVE_TWO_BOUNDARIES_SIMPLE || simulation_type == SOLVE_TWO_BOUNDARIES_COMPLETE)
558
        output << "  " << sps << "% Jacobian  " << endl << "    if jacobian_eval" << endl;
559
560
561
562
      else
        if (simulation_type == SOLVE_BACKWARD_SIMPLE   || simulation_type == SOLVE_FORWARD_SIMPLE
            || simulation_type == SOLVE_BACKWARD_COMPLETE || simulation_type == SOLVE_FORWARD_COMPLETE)
          output << "  % Jacobian  " << endl << "  if jacobian_eval" << endl;
sebastien's avatar
sebastien committed
563
        else
564
          output << "    % Jacobian  " << endl << "    if jacobian_eval" << endl;
565
566
567
      prev_var = 999999999;
      prev_lag = -9999999;
      count_col = 0;
568
      for (map<pair<int, pair<int, int>>, expr_t>::const_iterator it = tmp_block_endo_derivative.begin(); it != tmp_block_endo_derivative.end(); it++)
569
        {
570
571
572
          int lag = it->first.first;
          unsigned int var = it->first.second.first;
          unsigned int eq = it->first.second.second;
Ferhat Mihoubi's avatar
Ferhat Mihoubi committed
573
574
          int eqr = getBlockEquationID(block, eq);
          int varr = getBlockVariableID(block, var);
575
          if (var != prev_var || lag != prev_lag)
576
            {
577
578
579
580
              prev_var = var;
              prev_lag = lag;
              count_col++;
            }
581

582
          expr_t id = it->second;
583

584
          output << "      g1(" << eq+1 << ", " << count_col << ") = ";
585
          id->writeOutput(output, local_output_type, local_temporary_terms, {});
Ferhat Mihoubi's avatar
Ferhat Mihoubi committed
586
          output << "; % variable=" << symbol_table.getName(symbol_table.getID(eEndogenous, varr))
587
                 << "(" << lag
Ferhat Mihoubi's avatar
Ferhat Mihoubi committed
588
589
                 << ") " << varr+1 << ", " << var+1
                 << ", equation=" << eqr+1 << ", " << eq+1 << endl;
590
591
592
593
        }
      prev_var = 999999999;
      prev_lag = -9999999;
      count_col = 0;
594
      for (map<pair<int, pair<int, int>>, expr_t>::const_iterator it = tmp_block_exo_derivative.begin(); it != tmp_block_exo_derivative.end(); it++)
595
596
597
598
599
600
        {
          int lag = it->first.first;
          unsigned int var = it->first.second.first;
          unsigned int eq = it->first.second.second;
          int eqr = getBlockInitialEquationID(block, eq);
          if (var != prev_var || lag != prev_lag)
601
            {
602
603
604
              prev_var = var;
              prev_lag = lag;
              count_col++;
605
            }
606
607
          expr_t id = it->second;
          output << "      g1_x(" << eqr+1 << ", " << count_col << ") = ";
608
          id->writeOutput(output, local_output_type, local_temporary_terms, {});
609
610
611
612
613
614
615
616
          output << "; % variable=" << symbol_table.getName(symbol_table.getID(eExogenous, var))
                 << "(" << lag
                 << ") " << var+1
                 << ", equation=" << eq+1 << endl;
        }
      prev_var = 999999999;
      prev_lag = -9999999;
      count_col = 0;
617
      for (map<pair<int, pair<int, int>>, expr_t>::const_iterator it = tmp_block_exo_det_derivative.begin(); it != tmp_block_exo_det_derivative.end(); it++)
618
619
620
621
622
623
        {
          int lag = it->first.first;
          unsigned int var = it->first.second.first;
          unsigned int eq = it->first.second.second;
          int eqr = getBlockInitialEquationID(block, eq);
          if (var != prev_var || lag != prev_lag)
624
            {
625
626
627
              prev_var = var;
              prev_lag = lag;
              count_col++;
628
            }
629
630
          expr_t id = it->second;
          output << "      g1_xd(" << eqr+1 << ", " << count_col << ") = ";
631
          id->writeOutput(output, local_output_type, local_temporary_terms, {});
632
633
634
635
636
637
638
639
          output << "; % variable=" << symbol_table.getName(symbol_table.getID(eExogenous, var))
                 << "(" << lag
                 << ") " << var+1
                 << ", equation=" << eq+1 << endl;
        }
      prev_var = 999999999;
      prev_lag = -9999999;
      count_col = 0;
640
      for (map<pair<int, pair<int, int>>, expr_t>::const_iterator it = tmp_block_other_endo_derivative.begin(); it != tmp_block_other_endo_derivative.end(); it++)
641
642
643
644
645
646
        {
          int lag = it->first.first;
          unsigned int var = it->first.second.first;
          unsigned int eq = it->first.second.second;
          int eqr = getBlockInitialEquationID(block, eq);
          if (var != prev_var || lag != prev_lag)
647
            {
648
649
650
              prev_var = var;
              prev_lag = lag;
              count_col++;
651
            }
652
653
          expr_t id = it->second;

654
          output << "      g1_o(" << eqr+1 << ", " << /*var+1+(lag+block_max_lag)*block_size*/ count_col << ") = ";
655
          id->writeOutput(output, local_output_type, local_temporary_terms, {});
656
657
658
659
660
661
662
663
664
665
666
667
668
          output << "; % variable=" << symbol_table.getName(symbol_table.getID(eEndogenous, var))
                 << "(" << lag
                 << ") " << var+1
                 << ", equation=" << eq+1 << endl;
        }
      output << "      varargout{1}=g1_x;\n";
      output << "      varargout{2}=g1_xd;\n";
      output << "      varargout{3}=g1_o;\n";

      switch (simulation_type)
        {
        case EVALUATE_FORWARD:
        case EVALUATE_BACKWARD:
669
670
671
672
673
674
675
676
          output << "    end;" << endl;
          output << "  end;" << endl;
          break;
        case SOLVE_BACKWARD_SIMPLE:
        case SOLVE_FORWARD_SIMPLE:
        case SOLVE_BACKWARD_COMPLETE:
        case SOLVE_FORWARD_COMPLETE:
          output << "  else" << endl;
677
          for (auto it = blocks_derivatives[block].begin(); it != (blocks_derivatives[block]).end(); it++)
678
679
680
681
682
            {
              unsigned int eq = it->first.first;
              unsigned int var = it->first.second;
              unsigned int eqr = getBlockEquationID(block, eq);
              unsigned int varr = getBlockVariableID(block, var);
683
              expr_t id = it->second.second;
684
              int lag = it->second.first;
685
686
687
              if (lag == 0)
                {
                  output << "    g1(" << eq+1 << ", " << var+1-block_recursive << ") = ";
688
                  id->writeOutput(output, local_output_type, local_temporary_terms, {});
689
690
691
692
693
694
                  output << "; % variable=" << symbol_table.getName(symbol_table.getID(eEndogenous, varr))
                         << "(" << lag
                         << ") " << varr+1
                         << ", equation=" << eqr+1 << endl;
                }

695
696
697
698
699
            }
          output << "  end;\n";
          break;
        case SOLVE_TWO_BOUNDARIES_SIMPLE:
        case SOLVE_TWO_BOUNDARIES_COMPLETE:
700
          output << "    else" << endl;
701
          for (auto it = blocks_derivatives[block].begin(); it != (blocks_derivatives[block]).end(); it++)
702
703
704
705
706
707
            {
              unsigned int eq = it->first.first;
              unsigned int var = it->first.second;
              unsigned int eqr = getBlockEquationID(block, eq);
              unsigned int varr = getBlockVariableID(block, var);
              ostringstream tmp_output;
708
              expr_t id = it->second.second;
709
              int lag = it->second.first;
710
              if (eq >= block_recursive && var >= block_recursive)
711
712
                {
                  if (lag == 0)
713
714
715
                    Ufoss << "+g1(" << eq+1-block_recursive
                          << "+Per_J_, " << var+1-block_recursive
                          << "+Per_K_)*y(it_, " << varr+1 << ")";
716
                  else if (lag == 1)
717
718
719
                    Ufoss << "+g1(" << eq+1-block_recursive
                          << "+Per_J_, " << var+1-block_recursive
                          << "+Per_y_)*y(it_+1, " << varr+1 << ")";
720
                  else if (lag > 0)
721
722
723
                    Ufoss << "+g1(" << eq+1-block_recursive
                          << "+Per_J_, " << var+1-block_recursive
                          << "+y_size*(it_+" << lag-1 << "))*y(it_+" << lag << ", " << varr+1 << ")";
724
                  else
725
726
727
                    Ufoss << "+g1(" << eq+1-block_recursive
                          << "+Per_J_, " << var+1-block_recursive
                          << "+y_size*(it_" << lag-1 << "))*y(it_" << lag << ", " << varr+1 << ")";
728
                  Uf[eqr] += Ufoss.str();
729
730
                  Ufoss.str("");

731
732
733
734
735
736
737
738
739
740
741
742
743
                  if (lag == 0)
                    tmp_output << "     g1(" << eq+1-block_recursive << "+Per_J_, "
                               << var+1-block_recursive << "+Per_K_) = ";
                  else if (lag == 1)
                    tmp_output << "     g1(" << eq+1-block_recursive << "+Per_J_, "
                               << var+1-block_recursive << "+Per_y_) = ";
                  else if (lag > 0)
                    tmp_output << "     g1(" << eq+1-block_recursive << "+Per_J_, "
                               << var+1-block_recursive << "+y_size*(it_+" << lag-1 << ")) = ";
                  else if (lag < 0)
                    tmp_output << "     g1(" << eq+1-block_recursive << "+Per_J_, "
                               << var+1-block_recursive << "+y_size*(it_" << lag-1 << ")) = ";
                  output << " " << tmp_output.str();
744
                  id->writeOutput(output, local_output_type, local_temporary_terms, {});
745
746
747
748
749
                  output << ";";
                  output << " %2 variable=" << symbol_table.getName(symbol_table.getID(eEndogenous, varr))
                         << "(" << lag << ") " << varr+1
                         << ", equation=" << eqr+1 << " (" << eq+1 << ")" << endl;
                }
750

sebastien's avatar
sebastien committed
751
#ifdef CONDITION
752
753
              output << "  if (fabs(condition[" << eqr << "])<fabs(u[" << u << "+Per_u_]))\n";
              output << "    condition(" << eqr << ")=u(" << u << "+Per_u_);\n";
sebastien's avatar
sebastien committed
754
#endif
755
756
757
758
            }
          for (unsigned int i = 0; i < block_size; i++)
            {
              if (i >= block_recursive)
759
                output << "  " << Uf[getBlockEquationID(block, i)] << ";\n";
sebastien's avatar
sebastien committed
760
#ifdef CONDITION
761
762
              output << "  if (fabs(condition(" << i+1 << "))<fabs(u(" << i << "+Per_u_)))\n";
              output << "    condition(" << i+1 << ")=u(" << i+1 << "+Per_u_);\n";
sebastien's avatar
sebastien committed
763
#endif
764
            }
sebastien's avatar
sebastien committed
765
#ifdef CONDITION
766
767
768
769
770
771
772
773
774
775
776
777
778
779
          for (m = 0; m <= ModelBlock->Block_List[block].Max_Lead+ModelBlock->Block_List[block].Max_Lag; m++)
            {
              k = m-ModelBlock->Block_List[block].Max_Lag;
              for (i = 0; i < ModelBlock->Block_List[block].IM_lead_lag[m].size; i++)
                {
                  unsigned int eq = ModelBlock->Block_List[block].IM_lead_lag[m].Equ_Index[i];
                  unsigned int var = ModelBlock->Block_List[block].IM_lead_lag[m].Var_Index[i];
                  unsigned int u = ModelBlock->Block_List[block].IM_lead_lag[m].u[i];
                  unsigned int eqr = ModelBlock->Block_List[block].IM_lead_lag[m].Equ[i];
                  output << "  u(" << u+1 << "+Per_u_) = u(" << u+1 << "+Per_u_) / condition(" << eqr+1 << ");\n";
                }
            }
          for (i = 0; i < ModelBlock->Block_List[block].Size; i++)
            output << "  u(" << i+1 << "+Per_u_) = u(" << i+1 << "+Per_u_) / condition(" << i+1 << ");\n";
sebastien's avatar
sebastien committed
780
#endif
781
782
          output << "    end;" << endl;
          output << "  end;" << endl;
783
784
785
786
          break;
        default:
          break;
        }
787
      output << "end" << endl;
788
789
790
      output.close();
    }
}
sebastien's avatar
sebastien committed
791
792

void
793
DynamicModel::writeModelEquationsCode(string &file_name, const string &bin_basename, const map_idx_t &map_idx) const
794
{
795

796
797
  ostringstream tmp_output;
  ofstream code_file;
798
  unsigned int instruction_number = 0;
799
800
801
802
803
804
805
  bool file_open = false;
  string main_name = file_name;

  main_name += ".cod";
  code_file.open(main_name.c_str(), ios::out | ios::binary | ios::ate);
  if (!code_file.is_open())
    {
806
      cerr << "Error : Can't open file \"" << main_name << "\" for writing" << endl;
807
808
809
810
811
812
813
814
815
816
817
818
819
      exit(EXIT_FAILURE);
    }

  int count_u;
  int u_count_int = 0;
  BlockSimulationType simulation_type;
  if ((max_endo_lag > 0) && (max_endo_lead > 0))
    simulation_type = SOLVE_TWO_BOUNDARIES_COMPLETE;
  else if ((max_endo_lag >= 0) && (max_endo_lead == 0))
    simulation_type = SOLVE_FORWARD_COMPLETE;
  else
    simulation_type = SOLVE_BACKWARD_COMPLETE;

820
  Write_Inf_To_Bin_File(file_name, u_count_int, file_open, simulation_type == SOLVE_TWO_BOUNDARIES_COMPLETE, symbol_table.endo_nbr());
821
822
823
824
  file_open = true;

  //Temporary variables declaration
  FDIMT_ fdimt(temporary_terms.size());
825
826
827
  fdimt.write(code_file, instruction_number);

  vector<unsigned int> exo, exo_det, other_endo;
828

829
  for (int i = 0; i < symbol_table.exo_det_nbr(); i++)
830
    exo_det.push_back(i);
831
  for (int i = 0; i < symbol_table.exo_nbr(); i++)
832
    exo.push_back(i);
833

834
835
  map<pair< int, pair<int, int>>, expr_t> first_derivatives_reordered_endo;
  map<pair< pair<int, int>, pair<int, int>>, expr_t>  first_derivatives_reordered_exo;
836
  for (const auto & first_derivative : first_derivatives)
837
    {
838
839
      int deriv_id = first_derivative.first.second;
      unsigned int eq = first_derivative.first.first;
840
841
842
843
      int symb = getSymbIDByDerivID(deriv_id);
      unsigned int var = symbol_table.getTypeSpecificID(symb);
      int lag = getLagByDerivID(deriv_id);
      if (getTypeByDerivID(deriv_id) == eEndogenous)
844
        first_derivatives_reordered_endo[{ lag, make_pair(var, eq) }] = first_derivative.second;
845
      else if (getTypeByDerivID(deriv_id) == eExogenous || getTypeByDerivID(deriv_id) == eExogenousDet)
846
        first_derivatives_reordered_exo[{ { lag, getTypeByDerivID(deriv_id) }, { var, eq } }] = first_derivative.second;
847
848
849
850
    }
  int prev_var = -1;
  int prev_lag = -999999999;
  int count_col_endo = 0;
851
  for (map<pair< int, pair<int, int>>, expr_t>::const_iterator it = first_derivatives_reordered_endo.begin();
852
853
854
855
       it != first_derivatives_reordered_endo.end(); it++)
    {
      int var = it->first.second.first;
      int lag = it->first.first;
856
      if (prev_var != var || prev_lag != lag)
857
858
859
860
861
862
        {
          prev_var = var;
          prev_lag = lag;
          count_col_endo++;
        }
    }
863
864
  prev_var = -1;
  prev_lag = -999999999;
865
  int prev_type = -1;
866
  int count_col_exo = 0;
867
  int count_col_det_exo = 0;
868

869
  for (map<pair< pair<int, int>, pair<int, int>>, expr_t>::const_iterator it = first_derivatives_reordered_exo.begin();
870
871
872
       it != first_derivatives_reordered_exo.end(); it++)
    {
      int var = it->first.second.first;
873
874
875
      int lag = it->first.first.first;
      int type = it->first.first.second;
      if (prev_var != var || prev_lag != lag || prev_type != type)
876
877
878
        {
          prev_var = var;
          prev_lag = lag;
879
          prev_type = type;
880
881
882
883
          if (type == eExogenous)
            count_col_exo++;
          else if (type == eExogenousDet)
            count_col_det_exo++;
884
885
        }
    }
886

887
888