|
3990
|
1 /* |
|
|
2 |
|
|
3 Copyright (C) 2002 John W. Eaton |
|
|
4 |
|
|
5 This file is part of Octave. |
|
|
6 |
|
|
7 Octave is free software; you can redistribute it and/or modify it |
|
|
8 under the terms of the GNU General Public License as published by the |
|
|
9 Free Software Foundation; either version 2, or (at your option) any |
|
|
10 later version. |
|
|
11 |
|
|
12 Octave is distributed in the hope that it will be useful, but WITHOUT |
|
|
13 ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or |
|
|
14 FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License |
|
|
15 for more details. |
|
|
16 |
|
|
17 You should have received a copy of the GNU General Public License |
|
|
18 along with Octave; see the file COPYING. If not, write to the Free |
|
|
19 Software Foundation, 59 Temple Place - Suite 330, Boston, MA 02111-1307, USA. |
|
|
20 |
|
|
21 */ |
|
|
22 |
|
|
23 #if defined (__GNUG__) |
|
|
24 #pragma implementation |
|
|
25 #endif |
|
|
26 |
|
|
27 #ifdef HAVE_CONFIG_H |
|
|
28 #include <config.h> |
|
|
29 #endif |
|
|
30 |
|
|
31 #include <iostream.h> |
|
|
32 #include <fstream.h> |
|
|
33 |
|
|
34 #include <cstdlib> |
|
|
35 #include <cfloat> |
|
|
36 #include <cmath> |
|
|
37 #include "defun-dld.h" |
|
|
38 #include "error.h" |
|
|
39 #include "gripes.h" |
|
|
40 #include "oct-obj.h" |
|
|
41 #include "ov-fcn.h" |
|
|
42 #include "pager.h" |
|
|
43 #include "parse.h" |
|
|
44 #include "unwind-prot.h" |
|
|
45 #include "utils.h" |
|
|
46 #include "variables.h" |
|
|
47 |
|
|
48 #include "DASRT.h" |
|
|
49 #include "f77-fcn.h" |
|
|
50 #include "lo-error.h" |
|
|
51 |
|
|
52 #ifndef F77_FUNC |
|
|
53 #define F77_FUNC(x, X) F77_FCN (x, X) |
|
|
54 #endif |
|
|
55 |
|
3991
|
56 typedef int (*dasrt_fcn_ptr) (const double&, const double*, const double*, |
|
|
57 double*, int&, double*, int*); |
|
|
58 |
|
|
59 typedef int (*dasrt_jac_ptr) (const double&, const double*, const double*, |
|
|
60 double*, const double&, double*, int*); |
|
|
61 |
|
|
62 typedef int (*dasrt_constr_ptr) (const int&, const double&, const double*, |
|
|
63 const int&, double*, double*, int*); |
|
|
64 |
|
3990
|
65 extern "C" |
|
3991
|
66 int F77_FUNC (ddasrt, DASRT) (dasrt_fcn_ptr, const int&, double&, |
|
|
67 double*, double*, const double&, int*, |
|
|
68 double*, double*, int&, double*, |
|
|
69 const int&, int*, const int&, double*, |
|
|
70 int*, dasrt_jac_ptr, dasrt_constr_ptr, |
|
|
71 const int&, int*); |
|
3990
|
72 |
|
|
73 static DAEFunc::DAERHSFunc user_fsub; |
|
|
74 static DAEFunc::DAEJacFunc user_jsub; |
|
|
75 static DAERTFunc::DAERTConstrFunc user_csub; |
|
3993
|
76 |
|
3990
|
77 static int nn; |
|
|
78 |
|
|
79 static int |
|
3991
|
80 ddasrt_f (const double& t, const double *state, const double *deriv, |
|
|
81 double *delta, int& ires, double *rpar, int *ipar) |
|
3990
|
82 { |
|
|
83 ColumnVector tmp_state (nn); |
|
|
84 for (int i = 0; i < nn; i++) |
|
|
85 tmp_state(i) = state[i]; |
|
|
86 |
|
|
87 ColumnVector tmp_deriv (nn); |
|
|
88 for (int i = 0; i < nn; i++) |
|
|
89 tmp_deriv(i) = deriv[i]; |
|
|
90 |
|
3994
|
91 ColumnVector tmp_fval = (*user_fsub) (tmp_state, tmp_deriv, t, ires); |
|
3990
|
92 |
|
|
93 if (tmp_fval.length () == 0) |
|
|
94 ires = -2; |
|
|
95 else |
|
|
96 { |
|
|
97 for (int i = 0; i < nn; i++) |
|
|
98 delta[i] = tmp_fval(i); |
|
|
99 } |
|
|
100 |
|
|
101 return 0; |
|
|
102 } |
|
|
103 |
|
3991
|
104 int |
|
|
105 ddasrt_j (const double& time, const double *state, const double *deriv, |
|
|
106 double *pd, const double& cj, double *, int *) |
|
3990
|
107 { |
|
3991
|
108 // XXX FIXME XXX -- would be nice to avoid copying the data. |
|
3990
|
109 |
|
3991
|
110 ColumnVector tmp_state (nn); |
|
|
111 ColumnVector tmp_deriv (nn); |
|
3990
|
112 |
|
3991
|
113 for (int i = 0; i < nn; i++) |
|
|
114 { |
|
|
115 tmp_deriv.elem (i) = deriv [i]; |
|
|
116 tmp_state.elem (i) = state [i]; |
|
|
117 } |
|
3990
|
118 |
|
3994
|
119 Matrix tmp_pd = (*user_jsub) (tmp_state, tmp_deriv, time, cj); |
|
3990
|
120 |
|
|
121 for (int j = 0; j < nn; j++) |
|
|
122 for (int i = 0; i < nn; i++) |
|
3991
|
123 pd [nn * j + i] = tmp_pd.elem (i, j); |
|
3990
|
124 |
|
|
125 return 0; |
|
|
126 } |
|
|
127 |
|
|
128 static int |
|
3991
|
129 ddasrt_g (const int& neq, const double& t, const double *state, |
|
|
130 const int& ng, double *gout, double *rpar, int *ipar) |
|
3990
|
131 { |
|
|
132 int n = neq; |
|
|
133 |
|
|
134 ColumnVector tmp_state (n); |
|
|
135 for (int i = 0; i < n; i++) |
|
|
136 tmp_state(i) = state[i]; |
|
|
137 |
|
3994
|
138 ColumnVector tmp_fval = (*user_csub) (tmp_state, t); |
|
3990
|
139 |
|
|
140 for (int i = 0; i < ng; i++) |
|
|
141 gout[i] = tmp_fval(i); |
|
|
142 |
|
|
143 return 0; |
|
|
144 } |
|
|
145 |
|
|
146 DASRT::DASRT (void) |
|
|
147 : DAERT () |
|
|
148 { |
|
|
149 initialized = false; |
|
|
150 |
|
|
151 sanity_checked = false; |
|
|
152 |
|
|
153 info.resize (30, 0); |
|
|
154 |
|
3992
|
155 ng = 0; |
|
3990
|
156 |
|
|
157 liw = 0; |
|
|
158 lrw = 0; |
|
|
159 } |
|
|
160 |
|
3994
|
161 DASRT::DASRT (const ColumnVector& state, double time, DAERTFunc& f) |
|
|
162 : DAERT (state, time, f) |
|
|
163 { |
|
|
164 n = size (); |
|
|
165 |
|
|
166 initialized = false; |
|
|
167 |
|
|
168 liw = 20 + n; |
|
|
169 lrw = 50 + 9*n + n*n; |
|
|
170 |
|
|
171 sanity_checked = false; |
|
|
172 |
|
|
173 info.resize (15, 0); |
|
|
174 |
|
|
175 DAERTFunc::DAERTConstrFunc tmp_csub = DAERTFunc::constraint_function (); |
|
|
176 |
|
|
177 if (tmp_csub) |
|
|
178 { |
|
|
179 ColumnVector tmp = tmp_csub (state, time); |
|
|
180 ng = tmp.length (); |
|
|
181 } |
|
|
182 else |
|
|
183 ng = 0; |
|
|
184 |
|
|
185 jroot.resize (ng, 1); |
|
|
186 } |
|
|
187 |
|
3992
|
188 DASRT::DASRT (const ColumnVector& state, const ColumnVector& deriv, |
|
|
189 double time, DAERTFunc& f) |
|
3990
|
190 : DAERT (state, deriv, time, f) |
|
|
191 { |
|
|
192 n = size (); |
|
|
193 |
|
|
194 initialized = false; |
|
|
195 |
|
|
196 sanity_checked = false; |
|
|
197 |
|
|
198 info.resize (30, 0); |
|
|
199 |
|
3992
|
200 DAERTFunc::DAERTConstrFunc tmp_csub = DAERTFunc::constraint_function (); |
|
|
201 |
|
|
202 if (tmp_csub) |
|
|
203 { |
|
|
204 ColumnVector tmp = tmp_csub (state, time); |
|
|
205 ng = tmp.length (); |
|
|
206 } |
|
|
207 else |
|
|
208 ng = 0; |
|
|
209 |
|
3994
|
210 liw = 20 + n + 1000; |
|
|
211 lrw = 50 + 9*n + n*n + 1000; |
|
3990
|
212 |
|
3994
|
213 jroot.resize (ng, 1); |
|
3990
|
214 } |
|
|
215 |
|
|
216 void |
|
|
217 DASRT::integrate (double tout) |
|
|
218 { |
|
|
219 DASRT_result retval; |
|
|
220 |
|
|
221 if (! initialized) |
|
|
222 { |
|
|
223 info(0) = 0; |
|
|
224 |
|
|
225 integration_error = false; |
|
|
226 |
|
|
227 user_fsub = DAEFunc::function (); |
|
|
228 user_jsub = DAEFunc::jacobian_function (); |
|
|
229 user_csub = DAERTFunc::constraint_function (); |
|
|
230 |
|
|
231 if (user_jsub) |
|
|
232 info(4) = 1; |
|
|
233 else |
|
|
234 info(4) = 0; |
|
|
235 |
|
3994
|
236 px = x.fortran_vec (); |
|
|
237 pxdot = xdot.fortran_vec (); |
|
|
238 |
|
|
239 nn = n; |
|
|
240 |
|
3990
|
241 if (! sanity_checked) |
|
|
242 { |
|
|
243 int ires = 0; |
|
|
244 |
|
3994
|
245 ColumnVector fval = (*user_fsub) (x, xdot, t, ires); |
|
3990
|
246 |
|
|
247 if (fval.length () != x.length ()) |
|
|
248 { |
|
|
249 (*current_liboctave_error_handler) |
|
|
250 ("dassl: inconsistent sizes for state and residual vectors"); |
|
|
251 |
|
|
252 integration_error = true; |
|
|
253 return; |
|
|
254 } |
|
|
255 |
|
|
256 sanity_checked = true; |
|
|
257 } |
|
|
258 |
|
|
259 if (iwork.length () != liw) |
|
|
260 iwork.resize (liw); |
|
|
261 |
|
|
262 if (rwork.length () != lrw) |
|
|
263 rwork.resize (lrw); |
|
|
264 |
|
|
265 abs_tol = absolute_tolerance (); |
|
|
266 rel_tol = relative_tolerance (); |
|
|
267 |
|
|
268 if (initial_step_size () >= 0.0) |
|
|
269 { |
|
|
270 rwork(2) = initial_step_size (); |
|
|
271 info(7) = 1; |
|
|
272 } |
|
|
273 else |
|
|
274 info(7) = 0; |
|
|
275 |
|
|
276 if (step_limit () >= 0) |
|
|
277 { |
|
|
278 info(11) = 1; |
|
|
279 iwork(18) = step_limit (); |
|
|
280 } |
|
|
281 else |
|
|
282 info(11) = 0; |
|
|
283 |
|
|
284 if (maximum_step_size () >= 0.0) |
|
|
285 { |
|
|
286 rwork(1) = maximum_step_size (); |
|
|
287 info(6) = 1; |
|
|
288 } |
|
|
289 else |
|
|
290 info(6) = 0; |
|
|
291 |
|
|
292 pinfo = info.fortran_vec (); |
|
|
293 piwork = iwork.fortran_vec (); |
|
|
294 prwork = rwork.fortran_vec (); |
|
|
295 pjroot = jroot.fortran_vec (); |
|
|
296 |
|
|
297 info(5) = 0; |
|
|
298 info(8) = 0; |
|
|
299 initialized = true; |
|
|
300 } |
|
|
301 |
|
|
302 if (restart) |
|
|
303 { |
|
|
304 info(0) = 0; |
|
|
305 |
|
|
306 if (stop_time_set) |
|
|
307 { |
|
|
308 info(3) = 1; |
|
|
309 rwork(0) = stop_time; |
|
|
310 } |
|
|
311 else |
|
|
312 info(3) = 0; |
|
|
313 } |
|
|
314 |
|
3994
|
315 double *dummy = 0; |
|
|
316 int *idummy = 0; |
|
|
317 |
|
|
318 F77_XFCN (ddasrt, DASRT, (ddasrt_f, n, t, px, pxdot, tout, pinfo, |
|
3997
|
319 &rel_tol, &abs_tol, istate, prwork, lrw, |
|
3994
|
320 piwork, liw, dummy, idummy, ddasrt_j, |
|
3990
|
321 ddasrt_g, ng, pjroot)); |
|
|
322 |
|
|
323 if (f77_exception_encountered) |
|
|
324 { |
|
|
325 integration_error = true; |
|
|
326 (*current_liboctave_error_handler) ("unrecoverable error in dassl"); |
|
|
327 } |
|
|
328 else |
|
|
329 { |
|
3997
|
330 switch (istate) |
|
3990
|
331 { |
|
|
332 case 1: // A step was successfully taken in intermediate-output |
|
|
333 // mode. The code has not yet reached TOUT. |
|
|
334 case 2: // The integration to TOUT was successfully completed |
|
|
335 // (T=TOUT) by stepping exactly to TOUT. |
|
|
336 case 3: // The integration to TOUT was successfully completed |
|
|
337 // (T=TOUT) by stepping past TOUT. Y(*) is obtained by |
|
|
338 // interpolation. YPRIME(*) is obtained by interpolation. |
|
|
339 t = tout; |
|
|
340 break; |
|
|
341 |
|
3996
|
342 case 4: // The integration was successfully completed |
|
|
343 // by finding one or more roots of G at T. |
|
3990
|
344 break; |
|
|
345 |
|
3996
|
346 case -1: // A large amount of work has been expended. |
|
3990
|
347 case -2: // The error tolerances are too stringent. |
|
|
348 case -3: // The local error test cannot be satisfied because you |
|
|
349 // specified a zero component in ATOL and the |
|
|
350 // corresponding computed solution component is zero. |
|
|
351 // Thus, a pure relative error test is impossible for |
|
|
352 // this component. |
|
|
353 case -6: // DDASRT had repeated error test failures on the last |
|
|
354 // attempted step. |
|
|
355 case -7: // The corrector could not converge. |
|
|
356 case -8: // The matrix of partial derivatives is singular. |
|
|
357 case -9: // The corrector could not converge. There were repeated |
|
|
358 // error test failures in this step. |
|
|
359 case -10: // The corrector could not converge because IRES was |
|
|
360 // equal to minus one. |
|
|
361 case -11: // IRES equal to -2 was encountered and control is being |
|
|
362 // returned to the calling program. |
|
|
363 case -12: // DASSL failed to compute the initial YPRIME. |
|
|
364 case -33: // The code has encountered trouble from which it cannot |
|
|
365 // recover. A message is printed explaining the trouble |
|
|
366 // and control is returned to the calling program. For |
|
|
367 // example, this occurs when invalid input is detected. |
|
3996
|
368 integration_error = true; |
|
|
369 break; |
|
|
370 |
|
3990
|
371 default: |
|
|
372 integration_error = true; |
|
|
373 (*current_liboctave_error_handler) |
|
3997
|
374 ("unrecognized value of istate (= %d) returned from ddasrt", |
|
|
375 istate); |
|
3990
|
376 break; |
|
|
377 } |
|
|
378 } |
|
|
379 } |
|
|
380 |
|
|
381 DASRT_result |
|
|
382 DASRT::integrate (const ColumnVector& tout) |
|
|
383 { |
|
|
384 DASRT_result retval; |
|
|
385 |
|
|
386 Matrix x_out; |
|
|
387 Matrix xdot_out; |
|
3994
|
388 ColumnVector t_out = tout; |
|
3990
|
389 |
|
|
390 int n_out = tout.capacity (); |
|
|
391 |
|
|
392 if (n_out > 0 && n > 0) |
|
|
393 { |
|
|
394 x_out.resize (n_out, n); |
|
|
395 xdot_out.resize (n_out, n); |
|
|
396 |
|
3994
|
397 for (int i = 0; i < n; i++) |
|
|
398 { |
|
|
399 x_out(0,i) = x(i); |
|
|
400 xdot_out(0,i) = xdot(i); |
|
|
401 } |
|
|
402 |
|
|
403 for (int j = 1; j < n_out; j++) |
|
3990
|
404 { |
|
|
405 integrate (tout(j)); |
|
3994
|
406 |
|
3990
|
407 if (integration_error) |
|
|
408 { |
|
|
409 retval = DASRT_result (x_out, xdot_out, t_out); |
|
|
410 return retval; |
|
|
411 } |
|
3992
|
412 |
|
3997
|
413 if (istate == 4) |
|
3990
|
414 t_out(j) = t; |
|
|
415 else |
|
|
416 t_out(j) = tout(j); |
|
|
417 |
|
|
418 for (int i = 0; i < n; i++) |
|
|
419 { |
|
3994
|
420 x_out(j,i) = x(i); |
|
|
421 xdot_out(j,i) = xdot(i); |
|
3990
|
422 } |
|
3992
|
423 |
|
3997
|
424 if (istate == 4) |
|
3992
|
425 { |
|
3994
|
426 x_out.resize (j+1, n); |
|
|
427 xdot_out.resize (j+1, n); |
|
|
428 t_out.resize (j+1); |
|
|
429 break; |
|
3992
|
430 } |
|
3990
|
431 } |
|
|
432 } |
|
|
433 |
|
|
434 retval = DASRT_result (x_out, xdot_out, t_out); |
|
|
435 |
|
|
436 return retval; |
|
|
437 } |
|
|
438 |
|
|
439 DASRT_result |
|
|
440 DASRT::integrate (const ColumnVector& tout, const ColumnVector& tcrit) |
|
|
441 { |
|
|
442 DASRT_result retval; |
|
|
443 |
|
|
444 Matrix x_out; |
|
|
445 Matrix xdot_out; |
|
3994
|
446 ColumnVector t_outs = tout; |
|
3990
|
447 |
|
|
448 int n_out = tout.capacity (); |
|
|
449 |
|
|
450 if (n_out > 0 && n > 0) |
|
|
451 { |
|
|
452 x_out.resize (n_out, n); |
|
|
453 xdot_out.resize (n_out, n); |
|
|
454 |
|
|
455 int n_crit = tcrit.capacity (); |
|
|
456 |
|
|
457 if (n_crit > 0) |
|
|
458 { |
|
|
459 int i_crit = 0; |
|
3994
|
460 int i_out = 1; |
|
3990
|
461 double next_crit = tcrit(0); |
|
|
462 double next_out; |
|
|
463 while (i_out < n_out) |
|
|
464 { |
|
|
465 bool do_restart = false; |
|
|
466 |
|
|
467 next_out = tout(i_out); |
|
|
468 if (i_crit < n_crit) |
|
|
469 next_crit = tcrit(i_crit); |
|
|
470 |
|
|
471 int save_output; |
|
|
472 double t_out; |
|
|
473 |
|
|
474 if (next_crit == next_out) |
|
|
475 { |
|
|
476 set_stop_time (next_crit); |
|
|
477 t_out = next_out; |
|
|
478 save_output = 1; |
|
|
479 i_out++; |
|
|
480 i_crit++; |
|
|
481 do_restart = true; |
|
|
482 } |
|
|
483 else if (next_crit < next_out) |
|
|
484 { |
|
|
485 if (i_crit < n_crit) |
|
|
486 { |
|
|
487 set_stop_time (next_crit); |
|
|
488 t_out = next_crit; |
|
|
489 save_output = 0; |
|
|
490 i_crit++; |
|
|
491 do_restart = true; |
|
|
492 } |
|
|
493 else |
|
|
494 { |
|
|
495 clear_stop_time (); |
|
|
496 t_out = next_out; |
|
|
497 save_output = 1; |
|
|
498 i_out++; |
|
|
499 } |
|
|
500 } |
|
|
501 else |
|
|
502 { |
|
|
503 set_stop_time (next_crit); |
|
|
504 t_out = next_out; |
|
|
505 save_output = 1; |
|
|
506 i_out++; |
|
|
507 } |
|
|
508 |
|
|
509 integrate (t_out); |
|
|
510 |
|
|
511 if (integration_error) |
|
|
512 { |
|
|
513 retval = DASRT_result (x_out, xdot_out, t_outs); |
|
|
514 return retval; |
|
|
515 } |
|
3992
|
516 |
|
3997
|
517 if (istate == 4) |
|
3990
|
518 t_out = t; |
|
|
519 |
|
|
520 if (save_output) |
|
|
521 { |
|
|
522 for (int i = 0; i < n; i++) |
|
|
523 { |
|
3994
|
524 x_out(i_out-1,i) = x(i); |
|
|
525 xdot_out(i_out-1,i) = xdot(i); |
|
3990
|
526 } |
|
3994
|
527 |
|
3990
|
528 t_outs(i_out-1) = t_out; |
|
3994
|
529 |
|
3997
|
530 if (istate == 4) |
|
3990
|
531 { |
|
|
532 x_out.resize (i_out, n); |
|
|
533 xdot_out.resize (i_out, n); |
|
|
534 t_outs.resize (i_out); |
|
|
535 i_out = n_out; |
|
|
536 } |
|
|
537 } |
|
|
538 |
|
|
539 if (do_restart) |
|
|
540 force_restart (); |
|
|
541 } |
|
|
542 |
|
|
543 retval = DASRT_result (x_out, xdot_out, t_outs); |
|
|
544 } |
|
|
545 else |
|
|
546 { |
|
|
547 retval = integrate (tout); |
|
|
548 |
|
|
549 if (integration_error) |
|
|
550 return retval; |
|
|
551 } |
|
|
552 } |
|
|
553 |
|
|
554 return retval; |
|
|
555 } |
|
|
556 |
|
3995
|
557 std::string |
|
|
558 DASRT::error_message (void) const |
|
|
559 { |
|
|
560 std::string retval; |
|
|
561 |
|
3997
|
562 switch (istate) |
|
3995
|
563 { |
|
3996
|
564 case 1: |
|
|
565 retval = "a step was successfully taken in intermediate-output mode."; |
|
|
566 break; |
|
|
567 |
|
|
568 case 2: |
|
|
569 retval = "integration completed by stepping exactly to TOUT"; |
|
|
570 break; |
|
|
571 |
|
|
572 case 3: |
|
|
573 retval = "integration to tout completed by stepping past TOUT"; |
|
|
574 break; |
|
|
575 |
|
|
576 case 4: |
|
|
577 retval = "integration completed by finding one or more roots of G at T"; |
|
|
578 break; |
|
|
579 |
|
|
580 case -1: |
|
|
581 retval = "a large amount of work has been expended"; |
|
|
582 break; |
|
|
583 |
|
|
584 case -2: |
|
|
585 retval = "the error tolerances are too stringent"; |
|
|
586 break; |
|
|
587 |
|
|
588 case -3: |
|
|
589 retval = "error weight became zero during problem.\ |
|
|
590 (solution component i vanished, and atol or atol(i) == 0)"; |
|
|
591 break; |
|
|
592 |
|
|
593 case -6: |
|
|
594 retval = "repeated error test failures on the last attempted step"; |
|
|
595 break; |
|
|
596 |
|
|
597 case -7: |
|
|
598 retval = "the corrector could not converge"; |
|
|
599 break; |
|
|
600 |
|
|
601 case -8: |
|
|
602 retval = "the matrix of partial derivatives is singular"; |
|
|
603 break; |
|
|
604 |
|
|
605 case -9: |
|
|
606 retval = "the corrector could not converge (repeated test failures)"; |
|
|
607 break; |
|
|
608 |
|
|
609 case -10: |
|
|
610 retval = "corrector could not converge because IRES was -1"; |
|
|
611 break; |
|
|
612 |
|
|
613 case -11: |
|
|
614 retval = "return requested in user-supplied function"; |
|
|
615 break; |
|
|
616 |
|
|
617 case -12: |
|
|
618 retval = "failed to compute consistent initial conditions"; |
|
|
619 break; |
|
|
620 |
|
|
621 case -33: |
|
|
622 retval = "unrecoverable error (see printed message)"; |
|
|
623 break; |
|
|
624 |
|
3995
|
625 default: |
|
|
626 retval = "unknown error state"; |
|
|
627 break; |
|
|
628 } |
|
|
629 |
|
|
630 return retval; |
|
|
631 } |
|
|
632 |
|
3990
|
633 /* |
|
|
634 ;;; Local Variables: *** |
|
|
635 ;;; mode: C++ *** |
|
|
636 ;;; End: *** |
|
|
637 */ |
