|
1
|
1 // g-builtins.cc -*- C++ -*- |
|
|
2 /* |
|
|
3 |
|
|
4 Copyright (C) 1992, 1993 John W. Eaton |
|
|
5 |
|
|
6 This file is part of Octave. |
|
|
7 |
|
|
8 Octave is free software; you can redistribute it and/or modify it |
|
|
9 under the terms of the GNU General Public License as published by the |
|
|
10 Free Software Foundation; either version 2, or (at your option) any |
|
|
11 later version. |
|
|
12 |
|
|
13 Octave is distributed in the hope that it will be useful, but WITHOUT |
|
|
14 ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or |
|
|
15 FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License |
|
|
16 for more details. |
|
|
17 |
|
|
18 You should have received a copy of the GNU General Public License |
|
|
19 along with Octave; see the file COPYING. If not, write to the Free |
|
|
20 Software Foundation, 675 Mass Ave, Cambridge, MA 02139, USA. |
|
|
21 |
|
|
22 */ |
|
|
23 |
|
|
24 /* |
|
|
25 |
|
|
26 The function builtin_pwd adapted from a similar function from GNU |
|
|
27 Bash, the Bourne Again SHell, copyright (C) 1987, 1989, 1991 Free |
|
|
28 Software Foundation, Inc. |
|
|
29 |
|
|
30 */ |
|
|
31 |
|
|
32 #ifdef __GNUG__ |
|
|
33 #pragma implementation |
|
|
34 #endif |
|
|
35 |
|
|
36 #include <sys/types.h> |
|
|
37 #ifdef HAVE_UNISTD_H |
|
|
38 #include <unistd.h> |
|
|
39 #endif |
|
|
40 #include <strstream.h> |
|
|
41 #include <iostream.h> |
|
|
42 #include <fstream.h> |
|
|
43 #include <stdio.h> |
|
|
44 #include <sys/wait.h> |
|
|
45 #include <sys/param.h> |
|
|
46 #include <signal.h> |
|
|
47 #include <math.h> |
|
|
48 |
|
35
|
49 #include "f-balance.h" |
|
9
|
50 #include "f-colloc.h" |
|
|
51 #include "f-dassl.h" |
|
|
52 #include "f-det.h" |
|
|
53 #include "f-eig.h" |
|
|
54 #include "f-fft.h" |
|
|
55 #include "f-fsolve.h" |
|
|
56 #include "f-fsqp.h" |
|
35
|
57 #include "f-givens.h" |
|
9
|
58 #include "f-hess.h" |
|
|
59 #include "f-ifft.h" |
|
|
60 #include "f-inv.h" |
|
|
61 #include "f-lpsolve.h" |
|
|
62 #include "f-lsode.h" |
|
|
63 #include "f-lu.h" |
|
|
64 #include "f-npsol.h" |
|
|
65 #include "f-qpsol.h" |
|
|
66 #include "f-qr.h" |
|
|
67 #include "f-quad.h" |
|
46
|
68 #include "f-qzval.h" |
|
9
|
69 #include "f-rand.h" |
|
|
70 #include "f-schur.h" |
|
|
71 #include "f-svd.h" |
|
38
|
72 #include "f-syl.h" |
|
9
|
73 |
|
1
|
74 #include "procstream.h" |
|
|
75 #include "error.h" |
|
|
76 #include "variables.h" |
|
|
77 #include "builtins.h" |
|
|
78 #include "g-builtins.h" |
|
|
79 #include "user-prefs.h" |
|
|
80 #include "utils.h" |
|
|
81 #include "tree.h" |
|
9
|
82 #include "tree-const.h" |
|
1
|
83 #include "input.h" |
|
|
84 #include "pager.h" |
|
|
85 #include "octave.h" |
|
|
86 #include "version.h" |
|
|
87 #include "file-io.h" |
|
|
88 |
|
|
89 extern "C" |
|
|
90 { |
|
|
91 #include <readline/readline.h> |
|
|
92 } |
|
|
93 |
|
|
94 #ifndef MAXPATHLEN |
|
|
95 #define MAXPATHLEN 1024 |
|
|
96 #endif |
|
|
97 |
|
|
98 #ifdef WITH_DLD |
|
|
99 #include "dynamic-ld.h" |
|
|
100 #define Q_STR(name) #name |
|
|
101 #define DLD_FCN(name) Q_STR (builtin_##name##_2) |
|
|
102 #define DLD_OBJ(name) Q_STR (tc-##name##.o) |
|
|
103 #define DLD_BUILTIN(args,n_in,n_out,name,code) \ |
|
|
104 return octave_dld_tc2_and_go (args, n_in, n_out, Q_STR (name), \ |
|
|
105 DLD_FCN (name), DLD_OBJ (name)); |
|
|
106 |
|
|
107 #else |
|
|
108 #define DLD_BUILTIN(name,args,n_in,n_out,code) code |
|
|
109 #endif |
|
|
110 |
|
|
111 // Non-zero means that pwd always give verbatim directory, regardless |
|
|
112 // of symbolic link following. |
|
|
113 static int verbatim_pwd = 1; |
|
|
114 |
|
|
115 // Signal handler return type. |
|
|
116 #ifndef RETSIGTYPE |
|
|
117 #define RETSIGTYPE void |
|
|
118 #endif |
|
|
119 #ifndef BADSIG |
|
|
120 #define BADSIG (RETSIGTYPE (*)())-1 |
|
|
121 #endif |
|
|
122 |
|
|
123 typedef RETSIGTYPE sig_handler (...); |
|
|
124 |
|
|
125 /* |
|
|
126 * Are all elements of a constant nonzero? |
|
|
127 */ |
|
|
128 tree_constant * |
|
|
129 builtin_all (tree_constant *args, int nargin, int nargout) |
|
|
130 { |
|
|
131 tree_constant *retval = NULL_TREE_CONST; |
|
|
132 if (nargin != 2) |
|
|
133 usage ("all (M)"); |
|
|
134 else |
|
|
135 { |
|
|
136 if (args != NULL_TREE_CONST && args[1].is_defined ()) |
|
|
137 { |
|
|
138 retval = new tree_constant [2]; |
|
|
139 retval[0] = args[1].all (); |
|
|
140 } |
|
|
141 } |
|
|
142 return retval; |
|
|
143 } |
|
|
144 |
|
|
145 /* |
|
|
146 * Are any elements of a constant nonzero? |
|
|
147 */ |
|
|
148 tree_constant * |
|
|
149 builtin_any (tree_constant *args, int nargin, int nargout) |
|
|
150 { |
|
|
151 tree_constant *retval = NULL_TREE_CONST; |
|
|
152 if (nargin != 2) |
|
|
153 usage ("any (M)"); |
|
|
154 else |
|
|
155 { |
|
|
156 if (args != NULL_TREE_CONST && args[1].is_defined ()) |
|
|
157 { |
|
|
158 retval = new tree_constant [2]; |
|
|
159 retval[0] = args[1].any (); |
|
|
160 } |
|
|
161 } |
|
|
162 return retval; |
|
|
163 } |
|
|
164 |
|
|
165 /* |
|
18
|
166 * Balancing for eigenvalue problems |
|
|
167 */ |
|
|
168 tree_constant * |
|
|
169 builtin_balance (tree_constant *args, int nargin, int nargout) |
|
|
170 { |
|
|
171 tree_constant *retval = NULL_TREE_CONST; |
|
|
172 if (nargin <= 1 || nargin > 4 || nargout < 1 || nargout > 4) |
|
30
|
173 usage ("[{dd,} aa] = balance (a, {opt}) or \n\ |
|
|
174 [{cc, dd,} aa, bb] = balance (a, b {,opt}), opt = 'P' or 'S'"); |
|
18
|
175 else |
|
|
176 { |
|
|
177 DLD_BUILTIN (args, nargin, nargout, balance, |
|
|
178 retval = balance (args, nargin, nargout)); |
|
|
179 } |
|
|
180 return retval; |
|
|
181 } |
|
|
182 |
|
|
183 /* |
|
1
|
184 * Clear the screen? |
|
|
185 */ |
|
|
186 tree_constant * |
|
|
187 builtin_clc (tree_constant *args, int nargin, int nargout) |
|
|
188 { |
|
|
189 rl_beg_of_line (); |
|
|
190 rl_kill_line (1); |
|
|
191 rl_clear_screen (); |
|
|
192 return NULL_TREE_CONST; |
|
|
193 } |
|
|
194 |
|
|
195 /* |
|
|
196 * Time in a vector. |
|
|
197 */ |
|
|
198 tree_constant * |
|
|
199 builtin_clock (tree_constant *args, int nargin, int nargout) |
|
|
200 { |
|
|
201 tree_constant *retval = NULL_TREE_CONST; |
|
|
202 |
|
|
203 time_t now; |
|
|
204 struct tm *tm; |
|
|
205 |
|
|
206 time (&now); |
|
|
207 tm = localtime (&now); |
|
|
208 |
|
|
209 Matrix m (1, 6); |
|
|
210 m.elem (0, 0) = tm->tm_year + 1900; |
|
|
211 m.elem (0, 1) = tm->tm_mon + 1; |
|
|
212 m.elem (0, 2) = tm->tm_mday; |
|
|
213 m.elem (0, 3) = tm->tm_hour; |
|
|
214 m.elem (0, 4) = tm->tm_min; |
|
|
215 m.elem (0, 5) = tm->tm_sec; |
|
|
216 |
|
|
217 retval = new tree_constant [2]; |
|
|
218 retval[0] = tree_constant (m); |
|
|
219 |
|
|
220 return retval; |
|
|
221 } |
|
|
222 |
|
|
223 /* |
|
|
224 * Close the stream to the plotter. |
|
|
225 */ |
|
|
226 tree_constant * |
|
|
227 builtin_closeplot (tree_constant *args, int nargin, int nargout) |
|
|
228 { |
|
|
229 tree_constant *retval = NULL_TREE_CONST; |
|
|
230 close_plot_stream (); |
|
|
231 return retval; |
|
|
232 } |
|
|
233 |
|
|
234 /* |
|
|
235 * Collocation roots and weights. |
|
|
236 */ |
|
|
237 tree_constant * |
|
|
238 builtin_colloc (tree_constant *args, int nargin, int nargout) |
|
|
239 { |
|
|
240 tree_constant *retval = NULL_TREE_CONST; |
|
|
241 |
|
|
242 if (nargin < 2 || nargin > 4) |
|
|
243 usage ("[r, A, B, q] = colloc (n [, \"left\"] [, \"right\"])"); |
|
|
244 else |
|
|
245 DLD_BUILTIN (args, nargin, nargout, colloc, |
|
|
246 retval = collocation_weights (args, nargin);) |
|
|
247 |
|
|
248 return retval; |
|
|
249 } |
|
|
250 |
|
|
251 /* |
|
|
252 * Cumulative sums and products. |
|
|
253 */ |
|
|
254 tree_constant * |
|
|
255 builtin_cumprod (tree_constant *args, int nargin, int nargout) |
|
|
256 { |
|
|
257 tree_constant *retval = NULL_TREE_CONST; |
|
|
258 if (nargin != 2) |
|
|
259 usage ("cumprod (M)"); |
|
|
260 else |
|
|
261 { |
|
|
262 if (args != NULL_TREE_CONST && args[1].is_defined ()) |
|
|
263 { |
|
|
264 retval = new tree_constant [2]; |
|
|
265 retval[0] = args[1].cumprod (); |
|
|
266 } |
|
|
267 } |
|
|
268 return retval; |
|
|
269 } |
|
|
270 |
|
|
271 tree_constant * |
|
|
272 builtin_cumsum (tree_constant *args, int nargin, int nargout) |
|
|
273 { |
|
|
274 tree_constant *retval = NULL_TREE_CONST; |
|
|
275 if (nargin != 2) |
|
|
276 usage ("cumsum (M)"); |
|
|
277 else |
|
|
278 { |
|
|
279 if (args != NULL_TREE_CONST && args[1].is_defined ()) |
|
|
280 { |
|
|
281 retval = new tree_constant [2]; |
|
|
282 retval[0] = args[1].cumsum (); |
|
|
283 } |
|
|
284 } |
|
|
285 return retval; |
|
|
286 } |
|
|
287 |
|
|
288 /* |
|
|
289 * DAEs. |
|
|
290 */ |
|
|
291 static void |
|
|
292 dassl_usage (void) |
|
|
293 { |
|
|
294 usage ("dassl (\"function_name\", x_0, xdot_0, t_out\n\ |
|
|
295 dassl (\"function_name\", x_0, xdot_0, t_out, t_crit)\n\ |
|
|
296 \n\ |
|
|
297 The first argument is the name of the function to call to\n\ |
|
|
298 compute the vector of residuals. It must have the form\n\ |
|
|
299 \n\ |
|
|
300 res = f (x, xdot, t)\n\ |
|
|
301 \n\ |
|
|
302 where x, xdot, and res are vectors, and t is a scalar."); |
|
|
303 } |
|
|
304 |
|
|
305 tree_constant * |
|
|
306 builtin_dassl (tree_constant *args, int nargin, int nargout) |
|
|
307 { |
|
|
308 tree_constant *retval = new tree_constant [2]; |
|
|
309 |
|
|
310 if ((nargin == 5 || nargin == 6) && nargout > 0) |
|
|
311 DLD_BUILTIN (args, nargin, nargout, dassl, |
|
|
312 retval = dassl (args, nargin, nargout);) |
|
|
313 else |
|
|
314 dassl_usage (); |
|
|
315 |
|
|
316 return retval; |
|
|
317 } |
|
|
318 |
|
|
319 /* |
|
|
320 * Time in a string. |
|
|
321 */ |
|
|
322 tree_constant * |
|
|
323 builtin_date (tree_constant *args, int nargin, int nargout) |
|
|
324 { |
|
|
325 tree_constant *retval = NULL_TREE_CONST; |
|
|
326 |
|
|
327 time_t now; |
|
|
328 struct tm *tm; |
|
|
329 |
|
|
330 time (&now); |
|
|
331 tm = localtime (&now); |
|
|
332 char date[32]; |
|
|
333 int len = strftime (date, 31, "%d-%b-%y", tm); |
|
|
334 if (len > 0) |
|
|
335 { |
|
|
336 retval = new tree_constant [2]; |
|
|
337 retval[0] = tree_constant (date); |
|
|
338 } |
|
|
339 |
|
|
340 return retval; |
|
|
341 } |
|
|
342 |
|
|
343 /* |
|
|
344 * Determinant of a matrix. |
|
|
345 */ |
|
|
346 tree_constant * |
|
|
347 builtin_det (tree_constant *args, int nargin, int nargout) |
|
|
348 { |
|
|
349 tree_constant *retval = NULL_TREE_CONST; |
|
|
350 |
|
|
351 if (nargin == 2) |
|
|
352 DLD_BUILTIN (args, nargin, nargout, det, |
|
|
353 { |
|
|
354 retval = new tree_constant [2]; |
|
|
355 retval[0] = determinant (args[1]); |
|
|
356 }) |
|
|
357 else |
|
|
358 usage ("det (a)"); |
|
|
359 |
|
|
360 return retval; |
|
|
361 } |
|
|
362 |
|
|
363 /* |
|
|
364 * Diagonal elements of a matrix. |
|
|
365 */ |
|
|
366 tree_constant * |
|
|
367 builtin_diag (tree_constant *args, int nargin, int nargout) |
|
|
368 { |
|
|
369 tree_constant *retval = NULL_TREE_CONST; |
|
|
370 |
|
|
371 if (nargin == 2) |
|
|
372 { |
|
|
373 retval = new tree_constant [2]; |
|
|
374 retval[0] = args[1].diag (); |
|
|
375 } |
|
|
376 else if (nargin == 3) |
|
|
377 { |
|
|
378 retval = new tree_constant [2]; |
|
|
379 retval[0] = args[1].diag (args[2]); |
|
|
380 } |
|
|
381 else |
|
|
382 usage ("diag (X [, k])"); |
|
|
383 |
|
|
384 return retval; |
|
|
385 } |
|
|
386 |
|
|
387 /* |
|
|
388 * Display value without trimmings. |
|
|
389 */ |
|
|
390 tree_constant * |
|
|
391 builtin_disp (tree_constant *args, int nargin, int nargout) |
|
|
392 { |
|
|
393 tree_constant *retval = NULL_TREE_CONST; |
|
|
394 |
|
|
395 if (nargin == 2) |
|
|
396 args[1].eval (1); |
|
|
397 else |
|
|
398 usage ("disp (X)"); |
|
|
399 |
|
|
400 return retval; |
|
|
401 } |
|
|
402 |
|
|
403 /* |
|
|
404 * Compute eigenvalues and eigenvectors. |
|
|
405 */ |
|
|
406 tree_constant * |
|
|
407 builtin_eig (tree_constant *args, int nargin, int nargout) |
|
|
408 { |
|
|
409 tree_constant *retval = NULL_TREE_CONST; |
|
|
410 |
|
|
411 if (nargin == 2 && (nargout == 1 || nargout == 2)) |
|
|
412 DLD_BUILTIN (args, nargin, nargout, eig, |
|
|
413 retval = eig (args, nargin, nargout);) |
|
|
414 else |
|
|
415 usage ("lambda = eig (A)\n\ |
|
|
416 [v, d] = eig (A); d == diag (lambda)"); |
|
|
417 |
|
|
418 return retval; |
|
|
419 } |
|
|
420 |
|
|
421 /* |
|
|
422 * Print error message and jump to top level. |
|
|
423 */ |
|
|
424 tree_constant * |
|
|
425 builtin_error (tree_constant *args, int nargin, int nargout) |
|
|
426 { |
|
|
427 tree_constant *retval = NULL_TREE_CONST; |
|
|
428 |
|
|
429 if (nargin == 2 && args != NULL_TREE_CONST && args[1].is_defined ()) |
|
|
430 args[1].print_if_string (cerr, 1); |
|
|
431 else |
|
|
432 message ((char *) NULL, "unspecified error, jumping to top level..."); |
|
|
433 |
|
|
434 jump_to_top_level (); |
|
|
435 |
|
|
436 return retval; |
|
|
437 } |
|
|
438 |
|
|
439 /* |
|
|
440 * Evaluate text argument as octave source. |
|
|
441 */ |
|
|
442 tree_constant * |
|
|
443 builtin_eval (tree_constant *args, int nargin, int nargout) |
|
|
444 { |
|
|
445 tree_constant *retval = NULL_TREE_CONST; |
|
|
446 if (nargin == 2) |
|
|
447 { |
|
|
448 int parse_status = 0; |
|
|
449 retval = new tree_constant [2]; |
|
|
450 retval[0] = eval_string (args[1], parse_status); |
|
|
451 } |
|
|
452 else |
|
|
453 usage ("eval (\"string\")"); |
|
|
454 return retval; |
|
|
455 } |
|
|
456 |
|
|
457 /* |
|
|
458 * Check if variable or file exists. |
|
|
459 */ |
|
|
460 tree_constant * |
|
|
461 builtin_exist (tree_constant *args, int nargin, int nargout) |
|
|
462 { |
|
|
463 tree_constant *retval = NULL_TREE_CONST; |
|
|
464 if (nargin == 2 && args[1].is_string_type ()) |
|
|
465 { |
|
|
466 int status = identifier_exists (args[1].string_value ()); |
|
|
467 retval = new tree_constant [2]; |
|
|
468 retval[0] = tree_constant ((double) status); |
|
|
469 } |
|
|
470 else |
|
|
471 usage ("exist (\"string\")"); |
|
|
472 return retval; |
|
|
473 } |
|
|
474 |
|
|
475 /* |
|
|
476 * Matrix exponential. |
|
|
477 */ |
|
|
478 tree_constant * |
|
|
479 builtin_expm (tree_constant *args, int nargin, int nargout) |
|
|
480 { |
|
|
481 tree_constant *retval = NULL_TREE_CONST; |
|
|
482 |
|
|
483 if (nargin == 2) |
|
|
484 retval = matrix_exp (args[1]); |
|
|
485 else |
|
|
486 usage ("expm (A)"); |
|
|
487 |
|
|
488 return retval; |
|
|
489 } |
|
|
490 |
|
|
491 /* |
|
|
492 * Identity matrix. |
|
|
493 */ |
|
|
494 tree_constant * |
|
|
495 builtin_eye (tree_constant *args, int nargin, int nargout) |
|
|
496 { |
|
|
497 tree_constant *retval = NULL_TREE_CONST; |
|
|
498 |
|
|
499 switch (nargin) |
|
|
500 { |
|
|
501 case 2: |
|
|
502 retval = new tree_constant [2]; |
|
|
503 retval[0] = identity_matrix (args[1]); |
|
|
504 break; |
|
|
505 case 3: |
|
|
506 retval = new tree_constant [2]; |
|
|
507 retval[0] = identity_matrix (args[1], args[2]); |
|
|
508 break; |
|
|
509 default: |
|
|
510 usage ("eye (n)\n eye (A)\n eye (n, m)"); |
|
|
511 break; |
|
|
512 } |
|
|
513 return retval; |
|
|
514 } |
|
|
515 |
|
|
516 |
|
|
517 /* |
|
|
518 * Closing a file |
|
|
519 */ |
|
|
520 tree_constant * |
|
|
521 builtin_fclose (tree_constant *args, int nargin, int nargout) |
|
|
522 { |
|
|
523 tree_constant *retval = NULL_TREE_CONST; |
|
|
524 if (nargin != 2) |
|
|
525 usage ("success = fclose (\"filename\" or filenum)"); |
|
|
526 else |
|
|
527 retval = fclose_internal (args); |
|
|
528 return retval; |
|
|
529 } |
|
|
530 |
|
|
531 /* |
|
|
532 * Evaluate first argument as a function. |
|
|
533 */ |
|
|
534 tree_constant * |
|
|
535 builtin_feval (tree_constant *args, int nargin, int nargout) |
|
|
536 { |
|
|
537 tree_constant *retval = NULL_TREE_CONST; |
|
|
538 if (nargin > 1) |
|
|
539 retval = feval (args, nargin, nargout); |
|
|
540 else |
|
|
541 usage ("feval (\"function_name\" [, ...])"); |
|
|
542 return retval; |
|
|
543 } |
|
|
544 |
|
|
545 /* |
|
|
546 * Flushing output to a file |
|
|
547 */ |
|
|
548 tree_constant * |
|
|
549 builtin_fflush (tree_constant *args, int nargin, int nargout) |
|
|
550 { |
|
|
551 tree_constant *retval = NULL_TREE_CONST; |
|
|
552 if (nargin != 2) |
|
|
553 usage ("success = fflush (\"filename\" or filenum)"); |
|
|
554 else |
|
|
555 retval = fflush_internal (args); |
|
|
556 return retval; |
|
|
557 } |
|
|
558 |
|
|
559 /* |
|
|
560 * Fast Fourier Transform |
|
|
561 */ |
|
|
562 tree_constant * |
|
|
563 builtin_fft (tree_constant *args, int nargin, int nargout) |
|
|
564 { |
|
|
565 tree_constant *retval = NULL_TREE_CONST; |
|
|
566 |
|
|
567 if (nargin == 2) |
|
|
568 DLD_BUILTIN (args, nargin, nargout, fft, |
|
|
569 { |
|
|
570 retval = new tree_constant [2]; |
|
|
571 retval[0] = fft (args[1]); |
|
|
572 }) |
|
|
573 else |
|
|
574 usage ("fft (a)"); |
|
|
575 |
|
|
576 return retval; |
|
|
577 } |
|
|
578 |
|
|
579 /* |
|
|
580 * get a string from a file |
|
|
581 */ |
|
|
582 tree_constant * |
|
|
583 builtin_fgets (tree_constant *args, int nargin, int nargout) |
|
|
584 { |
|
|
585 tree_constant *retval = NULL_TREE_CONST; |
|
|
586 if (nargin != 3 && nargout < 3) |
|
|
587 usage ("string = fgets (\"filename\" or filenum, length)"); |
|
|
588 else |
|
|
589 retval = fgets_internal (args, nargout); |
|
|
590 return retval; |
|
|
591 } |
|
|
592 |
|
|
593 /* |
|
|
594 * Find nonzero elements. This should probably only work if |
|
|
595 * do_fortran_indexing is true... |
|
|
596 */ |
|
|
597 tree_constant * |
|
|
598 builtin_find (tree_constant *args, int nargin, int nargout) |
|
|
599 { |
|
|
600 tree_constant *retval = NULL_TREE_CONST; |
|
|
601 if (nargin == 2) |
|
|
602 { |
|
|
603 retval = new tree_constant [2]; |
|
|
604 retval[0] = find_nonzero_elem_idx (args[1]); |
|
|
605 } |
|
|
606 else |
|
|
607 usage ("find (x)"); |
|
|
608 return retval; |
|
|
609 } |
|
|
610 |
|
|
611 /* |
|
|
612 * Don\'t really count floating point operations. |
|
|
613 */ |
|
|
614 tree_constant * |
|
|
615 builtin_flops (tree_constant *args, int nargin, int nargout) |
|
|
616 { |
|
|
617 tree_constant *retval = NULL_TREE_CONST; |
|
|
618 if (nargin > 2) |
|
|
619 usage ("flops\n flops (0)"); |
|
|
620 |
|
|
621 warning ("flops always returns zero"); |
|
|
622 retval = new tree_constant [2]; |
|
|
623 retval[0] = tree_constant (0.0); |
|
|
624 return retval; |
|
|
625 } |
|
|
626 |
|
|
627 /* |
|
|
628 * Opening a file. |
|
|
629 */ |
|
|
630 tree_constant * |
|
|
631 builtin_fopen (tree_constant *args, int nargin, int nargout) |
|
|
632 { |
|
|
633 tree_constant *retval = NULL_TREE_CONST; |
|
|
634 if (nargin != 3) |
|
|
635 { |
|
|
636 usage ("filenum = fopen (\"file\", \"mode\")\n\n\ |
|
|
637 Legal values for mode include:\n\n\ |
|
|
638 r : open text file for reading\n\ |
|
|
639 w : open text file for writing; discard previous contents if any\n\ |
|
|
640 a : append; open or create text file for writing at end of file\n\ |
|
|
641 r+ : open text file for update (i.e., reading and writing)\n\ |
|
|
642 w+ : create text file for update; discard previous contents if any\n\ |
|
|
643 a+ : append; open or create text file for update, writing at end\n\n\ |
|
|
644 Update mode permits reading from and writing to the same file.\n"); |
|
|
645 } |
|
|
646 else |
|
|
647 retval = fopen_internal (args); |
|
|
648 return retval; |
|
|
649 } |
|
|
650 |
|
|
651 /* |
|
|
652 * Formatted printing to a file. |
|
|
653 */ |
|
|
654 tree_constant * |
|
|
655 builtin_fprintf (tree_constant *args, int nargin, int nargout) |
|
|
656 { |
|
|
657 tree_constant *retval = NULL_TREE_CONST; |
|
|
658 if (nargin < 3) |
|
|
659 usage ("fprintf (\"filename\" or filenum, \"fmt\" [, ...])"); |
|
|
660 else |
|
|
661 retval = do_printf ("fprintf", args, nargin, nargout); |
|
|
662 return retval; |
|
|
663 } |
|
|
664 |
|
|
665 /* |
|
|
666 * rewind a file |
|
|
667 */ |
|
|
668 tree_constant * |
|
|
669 builtin_frewind (tree_constant *args, int nargin, int nargout) |
|
|
670 { |
|
|
671 tree_constant *retval = NULL_TREE_CONST; |
|
|
672 if (nargin != 2) |
|
|
673 usage ("success = frewind (\"filename\" or filenum)"); |
|
|
674 else |
|
|
675 retval = frewind_internal (args); |
|
|
676 return retval; |
|
|
677 } |
|
|
678 |
|
|
679 /* |
|
|
680 * report on open files |
|
|
681 */ |
|
|
682 tree_constant * |
|
|
683 builtin_freport (tree_constant *args, int nargin, int nargout) |
|
|
684 { |
|
|
685 tree_constant *retval = NULL_TREE_CONST; |
|
|
686 if (nargin > 1) |
|
|
687 warning ("replot: ignoring extra arguments"); |
|
|
688 retval = freport_internal (); |
|
|
689 return retval; |
|
|
690 } |
|
|
691 |
|
|
692 /* |
|
|
693 * Formatted reading from a file. |
|
|
694 */ |
|
|
695 tree_constant * |
|
|
696 builtin_fscanf (tree_constant *args, int nargin, int nargout) |
|
|
697 { |
|
|
698 tree_constant *retval = NULL_TREE_CONST; |
|
|
699 if (nargin != 2 && nargin != 3) |
|
|
700 usage ("[...] = fscanf (\"file\", \"fmt\")"); |
|
|
701 else |
|
|
702 retval = do_scanf ("fscanf", args, nargin, nargout); |
|
|
703 return retval; |
|
|
704 } |
|
|
705 |
|
|
706 /* |
|
|
707 * seek a point in a file for reading and/or writing |
|
|
708 */ |
|
|
709 tree_constant * |
|
|
710 builtin_fseek (tree_constant *args, int nargin, int nargout) |
|
|
711 { |
|
|
712 tree_constant *retval = NULL_TREE_CONST; |
|
|
713 if (nargin != 3 && nargin != 4) |
|
|
714 usage ("success = fseek (\"filename\" or filenum, offset [,origin])"); |
|
|
715 else |
|
|
716 retval = fseek_internal (args, nargin); |
|
|
717 return retval; |
|
|
718 } |
|
|
719 |
|
|
720 /* |
|
|
721 * Nonlinear algebraic equations. |
|
|
722 */ |
|
|
723 static void |
|
|
724 fsolve_usage (void) |
|
|
725 { |
|
|
726 // usage ("[x, status, path] = fsolve (\"f\", x0 [, opts] [, par] [, \"jac\"] [, scale])"); |
|
|
727 |
|
|
728 usage ("[x, info] = fsolve (\"f\", x0)"); |
|
|
729 } |
|
|
730 |
|
|
731 tree_constant * |
|
|
732 builtin_fsolve (tree_constant *args, int nargin, int nargout) |
|
|
733 { |
|
|
734 tree_constant *retval = NULL_TREE_CONST; |
|
|
735 |
|
|
736 if (nargin >= 3 && nargin <= 7 && nargout >= 1 && nargout <= 3) |
|
|
737 DLD_BUILTIN (args, nargin, nargout, fsolve, |
|
|
738 retval = fsolve (args, nargin, nargout);) |
|
|
739 else |
|
|
740 fsolve_usage (); |
|
|
741 |
|
|
742 return retval; |
|
|
743 } |
|
|
744 |
|
|
745 /* |
|
|
746 * NLPs. |
|
|
747 */ |
|
|
748 static void |
|
|
749 fsqp_usage (void) |
|
|
750 { |
|
|
751 #if defined (FSQP_MISSING) |
|
|
752 message ("fsqp", "this function requires FSQP, which is not freely\n\ |
|
|
753 redistributable. For more information, read the file\n\ |
|
|
754 libcruft/fsqp/README.MISSING in the source distribution."); |
|
|
755 #else |
|
|
756 usage ("[x, phi] = fsqp (x, \"phi\" [, lb, ub] [, lb, A, ub] [, lb, \"g\", ub])\n\n\ |
|
|
757 Groups of arguments surrounded in `[]' are optional, but\n\ |
|
|
758 must appear in the same relative order shown above."); |
|
|
759 #endif |
|
|
760 } |
|
|
761 |
|
|
762 tree_constant * |
|
|
763 builtin_fsqp (tree_constant *args, int nargin, int nargout) |
|
|
764 { |
|
|
765 tree_constant *retval = NULL_TREE_CONST; |
|
|
766 |
|
|
767 #if defined (FSQP_MISSING) |
|
|
768 fsqp_usage (); |
|
|
769 #else |
|
|
770 if ((nargin == 3 || nargin == 5 || nargin == 6 || nargin == 8 |
|
|
771 || nargin == 9 || nargin == 11) |
|
|
772 && (nargout >= 1 && nargout <= 3)) |
|
|
773 DLD_BUILTIN (args, nargin, nargout, fsqp, |
|
|
774 retval = fsqp (args, nargin, nargout);) |
|
|
775 else |
|
|
776 fsqp_usage (); |
|
|
777 #endif |
|
|
778 |
|
|
779 return retval; |
|
|
780 } |
|
|
781 |
|
|
782 /* |
|
|
783 * tell current position of file |
|
|
784 */ |
|
|
785 tree_constant * |
|
|
786 builtin_ftell (tree_constant *args, int nargin, int nargout) |
|
|
787 { |
|
|
788 tree_constant *retval = NULL_TREE_CONST; |
|
|
789 if (nargin != 2) |
|
|
790 usage ("position = ftell (\"filename\" or filenumber)"); |
|
|
791 else |
|
|
792 retval = ftell_internal (args); |
|
|
793 return retval; |
|
|
794 } |
|
|
795 |
|
|
796 /* |
|
|
797 * Get the value of an environment variable. |
|
|
798 */ |
|
|
799 tree_constant * |
|
|
800 builtin_getenv (tree_constant *args, int nargin, int nargout) |
|
|
801 { |
|
|
802 tree_constant *retval = NULL_TREE_CONST; |
|
|
803 if (nargin == 2 && args[1].is_string_type ()) |
|
|
804 { |
|
|
805 retval = new tree_constant [2]; |
|
|
806 char *value = getenv (args[1].string_value ()); |
|
|
807 if (value != (char *) NULL) |
|
|
808 retval[0] = tree_constant (value); |
|
|
809 else |
|
|
810 retval[0] = tree_constant (""); |
|
|
811 } |
|
|
812 else |
|
|
813 usage ("getenv (\"string\")"); |
|
|
814 return retval; |
|
|
815 } |
|
|
816 |
|
|
817 /* |
|
|
818 * Inverse Fast Fourier Transform |
|
|
819 */ |
|
|
820 tree_constant * |
|
|
821 builtin_ifft (tree_constant *args, int nargin, int nargout) |
|
|
822 { |
|
|
823 tree_constant *retval = NULL_TREE_CONST; |
|
|
824 |
|
|
825 if (nargin == 2) |
|
|
826 DLD_BUILTIN (args, nargin, nargout, ifft, |
|
|
827 { |
|
|
828 retval = new tree_constant [2]; |
|
|
829 retval[0] = ifft (args[1]); |
|
|
830 }) |
|
|
831 else |
|
|
832 usage ("ifft (a)"); |
|
|
833 |
|
|
834 return retval; |
|
|
835 } |
|
|
836 |
|
|
837 /* |
|
|
838 * Inverse of a square matrix. |
|
|
839 */ |
|
|
840 tree_constant * |
|
|
841 builtin_inv (tree_constant *args, int nargin, int nargout) |
|
|
842 { |
|
|
843 tree_constant *retval = NULL_TREE_CONST; |
|
|
844 |
|
|
845 if (nargin == 2) |
|
|
846 DLD_BUILTIN (args, nargin, nargout, inv, |
|
|
847 { |
|
|
848 retval = new tree_constant [2]; |
|
|
849 retval[0] = inverse (args[1]); |
|
|
850 }) |
|
|
851 else |
|
|
852 usage ("inv (A)"); |
|
|
853 |
|
|
854 return retval; |
|
|
855 } |
|
|
856 |
|
|
857 /* |
|
|
858 * Prompt user for input. |
|
|
859 */ |
|
|
860 tree_constant * |
|
|
861 builtin_input (tree_constant *args, int nargin, int nargout) |
|
|
862 { |
|
|
863 tree_constant *retval = NULL_TREE_CONST; |
|
|
864 |
|
|
865 if (nargin == 2 || nargin == 3) |
|
|
866 { |
|
|
867 retval = new tree_constant [2]; |
|
|
868 retval[0] = get_user_input (args, nargin, nargout); |
|
|
869 } |
|
|
870 else |
|
|
871 usage ("input (\"prompt\" [, \"s\"])"); |
|
|
872 |
|
|
873 return retval; |
|
|
874 } |
|
|
875 |
|
|
876 /* |
|
|
877 * Is the argument a string? |
|
|
878 */ |
|
|
879 tree_constant * |
|
|
880 builtin_isstr (tree_constant *args, int nargin, int nargout) |
|
|
881 { |
|
|
882 tree_constant *retval = NULL_TREE_CONST; |
|
|
883 if (nargin != 2) |
|
|
884 usage ("isstr (value)"); |
|
|
885 else |
|
|
886 { |
|
|
887 if (args != NULL_TREE_CONST && args[1].is_defined ()) |
|
|
888 { |
|
|
889 retval = new tree_constant [2]; |
|
|
890 retval[0] = args[1].isstr (); |
|
|
891 } |
|
|
892 } |
|
|
893 return retval; |
|
|
894 } |
|
|
895 |
|
|
896 /* |
|
|
897 * Maybe help in debugging. |
|
|
898 */ |
|
|
899 tree_constant * |
|
|
900 builtin_keyboard (tree_constant *args, int nargin, int nargout) |
|
|
901 { |
|
|
902 tree_constant *retval = NULL_TREE_CONST; |
|
|
903 |
|
|
904 if (nargin == 1 || nargin == 2) |
|
|
905 { |
|
|
906 retval = new tree_constant [2]; |
|
|
907 retval[0] = get_user_input (args, nargin, nargout, 1); |
|
|
908 } |
|
|
909 else |
|
|
910 usage ("keyboard (\"prompt\")"); |
|
|
911 |
|
|
912 return retval; |
|
|
913 } |
|
|
914 |
|
|
915 /* |
|
|
916 * Matrix logarithm. |
|
|
917 */ |
|
|
918 tree_constant * |
|
|
919 builtin_logm (tree_constant *args, int nargin, int nargout) |
|
|
920 { |
|
|
921 tree_constant *retval = NULL_TREE_CONST; |
|
|
922 |
|
|
923 if (nargin == 2) |
|
|
924 retval = matrix_log (args[1]); |
|
|
925 else |
|
|
926 usage ("logm (A)"); |
|
|
927 |
|
|
928 return retval; |
|
|
929 } |
|
|
930 |
|
|
931 /* |
|
|
932 * LPs. |
|
|
933 */ |
|
|
934 static void |
|
|
935 lpsolve_usage (void) |
|
|
936 { |
|
|
937 usage ("[x, obj, info] = lpsolve (XXX FIXME XXX)"); |
|
|
938 } |
|
|
939 |
|
|
940 tree_constant * |
|
|
941 builtin_lpsolve (tree_constant *args, int nargin, int nargout) |
|
|
942 { |
|
|
943 tree_constant *retval = NULL_TREE_CONST; |
|
|
944 |
|
|
945 // Force a bad value of inform, and empty matrices for x and phi. |
|
|
946 retval = new tree_constant [4]; |
|
|
947 Matrix m; |
|
|
948 retval[0] = tree_constant (m); |
|
|
949 retval[1] = tree_constant (m); |
|
|
950 retval[2] = tree_constant (-1.0); |
|
|
951 |
|
|
952 if (nargin == 0) |
|
|
953 DLD_BUILTIN (args, nargin, nargout, lpsolve, |
|
|
954 retval = lpsolve (args, nargin, nargout);) |
|
|
955 else |
|
|
956 lpsolve_usage (); |
|
|
957 |
|
|
958 return retval; |
|
|
959 } |
|
|
960 |
|
|
961 /* |
|
|
962 * ODEs. |
|
|
963 */ |
|
|
964 static void |
|
|
965 lsode_usage (void) |
|
|
966 { |
|
|
967 usage ("lsode (\"function_name\", x0, t_out\n\ |
|
|
968 lsode (\"function_name\", x0, t_out, t_crit)\n\ |
|
|
969 \n\ |
|
|
970 The first argument is the name of the function to call to\n\ |
|
|
971 compute the vector of right hand sides. It must have the form\n\ |
|
|
972 \n\ |
|
|
973 xdot = f (x, t)\n\ |
|
|
974 \n\ |
|
|
975 where xdot and x are vectors and t is a scalar."); |
|
|
976 } |
|
|
977 |
|
|
978 tree_constant * |
|
|
979 builtin_lsode (tree_constant *args, int nargin, int nargout) |
|
|
980 { |
|
|
981 tree_constant *retval = NULL_TREE_CONST; |
|
|
982 |
|
|
983 if ((nargin == 4 || nargin == 5) && nargout == 1) |
|
|
984 DLD_BUILTIN (args, nargin, nargout, lsode, |
|
|
985 retval = lsode (args, nargin, nargout);) |
|
|
986 else |
|
|
987 lsode_usage (); |
|
|
988 |
|
|
989 return retval; |
|
|
990 } |
|
|
991 |
|
|
992 /* |
|
|
993 * LU factorization. |
|
|
994 */ |
|
|
995 tree_constant * |
|
|
996 builtin_lu (tree_constant *args, int nargin, int nargout) |
|
|
997 { |
|
|
998 tree_constant *retval = NULL_TREE_CONST; |
|
|
999 |
|
|
1000 if (nargin == 2 && nargout < 4) |
|
|
1001 DLD_BUILTIN (args, nargin, nargout, lu, |
|
|
1002 retval = lu (args[1], nargout);) |
|
|
1003 else |
|
|
1004 usage ("[L, U, P] = lu (A)"); |
|
|
1005 |
|
|
1006 return retval; |
|
|
1007 } |
|
|
1008 |
|
|
1009 /* |
|
|
1010 * Max values. |
|
|
1011 */ |
|
|
1012 tree_constant * |
|
|
1013 builtin_max (tree_constant *args, int nargin, int nargout) |
|
|
1014 { |
|
|
1015 tree_constant *retval = NULL_TREE_CONST; |
|
|
1016 |
|
|
1017 if ((nargin == 2 && (nargout == 1 || nargout == 2)) |
|
|
1018 || (nargin == 3 && nargout == 1)) |
|
|
1019 retval = column_max (args, nargin, nargout); |
|
|
1020 else |
|
|
1021 usage ("[X, I] = max (A)\n X = max (A)\n X = max (A, B)"); |
|
|
1022 |
|
|
1023 return retval; |
|
|
1024 } |
|
|
1025 |
|
|
1026 /* |
|
|
1027 * Min values. |
|
|
1028 */ |
|
|
1029 tree_constant * |
|
|
1030 builtin_min (tree_constant *args, int nargin, int nargout) |
|
|
1031 { |
|
|
1032 tree_constant *retval = NULL_TREE_CONST; |
|
|
1033 |
|
|
1034 if ((nargin == 2 && (nargout == 1 || nargout == 2)) |
|
|
1035 || (nargin == 3 && nargout == 1)) |
|
|
1036 retval = column_min (args, nargin, nargout); |
|
|
1037 else |
|
|
1038 usage ("[X, I] = min (A)\n X = min (A)\n X = min (A, B)"); |
|
|
1039 |
|
|
1040 return retval; |
|
|
1041 } |
|
|
1042 |
|
|
1043 /* |
|
|
1044 * NLPs. |
|
|
1045 */ |
|
|
1046 static void |
|
|
1047 npsol_usage (void) |
|
|
1048 { |
|
|
1049 #if defined (NPSOL_MISSING) |
|
|
1050 message ("npsol", "this function requires NPSOL, which is not freely\n\ |
|
|
1051 redistributable. For more information, read the file\n\ |
|
|
1052 libcruft/npsol/README.MISSING in the source distribution."); |
|
|
1053 #else |
|
|
1054 usage ("\n\n\ |
|
|
1055 [x, obj, info, lambda] = npsol (x, \"phi\" [, lb, ub] [, lb, A, ub] [, lb, \"g\", ub])\n\n\ |
|
|
1056 Groups of arguments surrounded in `[]' are optional, but\n\ |
|
|
1057 must appear in the same relative order shown above.\n\ |
|
|
1058 \n\ |
|
|
1059 The second argument is a string containing the name of the objective\n\ |
|
|
1060 function to call. The objective function must be of the form\n\ |
|
|
1061 \n\ |
|
|
1062 y = phi (x)\n\ |
|
|
1063 \n\ |
|
|
1064 where x is a vector and y is a scalar."); |
|
|
1065 #endif |
|
|
1066 } |
|
|
1067 |
|
|
1068 tree_constant * |
|
|
1069 builtin_npsol (tree_constant *args, int nargin, int nargout) |
|
|
1070 { |
|
|
1071 tree_constant *retval = NULL_TREE_CONST; |
|
|
1072 |
|
|
1073 #if defined (NPSOL_MISSING) |
|
|
1074 // Force a bad value of inform, and empty matrices for x, phi, and lambda. |
|
|
1075 retval = new tree_constant [4]; |
|
|
1076 Matrix m; |
|
|
1077 retval[0] = tree_constant (m); |
|
|
1078 retval[1] = tree_constant (m); |
|
|
1079 retval[2] = tree_constant (-1.0); |
|
|
1080 retval[3] = tree_constant (m); |
|
|
1081 npsol_usage (); |
|
|
1082 #else |
|
|
1083 if ((nargin == 3 || nargin == 5 || nargin == 6 || nargin == 8 |
|
|
1084 || nargin == 9 || nargin == 11) |
|
|
1085 && (nargout >= 1 && nargout <= 4)) |
|
|
1086 DLD_BUILTIN (args, nargin, nargout, npsol, |
|
|
1087 retval = npsol (args, nargin, nargout);) |
|
|
1088 else |
|
|
1089 npsol_usage (); |
|
|
1090 #endif |
|
|
1091 |
|
|
1092 return retval; |
|
|
1093 } |
|
|
1094 |
|
|
1095 /* |
|
|
1096 * A matrix of ones. |
|
|
1097 */ |
|
|
1098 tree_constant * |
|
|
1099 builtin_ones (tree_constant *args, int nargin, int nargout) |
|
|
1100 { |
|
|
1101 tree_constant *retval = NULL_TREE_CONST; |
|
|
1102 |
|
|
1103 switch (nargin) |
|
|
1104 { |
|
|
1105 case 2: |
|
|
1106 retval = new tree_constant [2]; |
|
|
1107 retval[0] = fill_matrix (args[1], 1.0, "ones"); |
|
|
1108 break; |
|
|
1109 case 3: |
|
|
1110 retval = new tree_constant [2]; |
|
|
1111 retval[0] = fill_matrix (args[1], args[2], 1.0, "ones"); |
|
|
1112 break; |
|
|
1113 default: |
|
|
1114 usage ("ones (n)\n ones (A)\n ones (n, m)"); |
|
|
1115 break; |
|
|
1116 } |
|
|
1117 return retval; |
|
|
1118 } |
|
|
1119 |
|
|
1120 /* |
|
|
1121 * You guessed it. |
|
|
1122 */ |
|
|
1123 tree_constant * |
|
|
1124 builtin_pause (tree_constant *args, int nargin, int nargout) |
|
|
1125 { |
|
|
1126 if (! (nargin == 1 || nargin == 2)) |
|
|
1127 { |
|
|
1128 usage ("pause ([delay])"); |
|
|
1129 return NULL_TREE_CONST; |
|
|
1130 } |
|
|
1131 |
|
|
1132 if (interactive) |
|
|
1133 { |
|
|
1134 if (nargin == 2) |
|
|
1135 sleep (NINT (args[1].double_value ())); |
|
|
1136 else if (kbhit () == EOF) |
|
|
1137 clean_up_and_exit (0); |
|
|
1138 } |
|
|
1139 return NULL_TREE_CONST; |
|
|
1140 } |
|
|
1141 |
|
|
1142 /* |
|
|
1143 * Delete turds from /tmp. |
|
|
1144 */ |
|
|
1145 tree_constant * |
|
|
1146 builtin_purge_tmp_files (tree_constant *, int, int) |
|
|
1147 { |
|
|
1148 cleanup_tmp_files (); |
|
|
1149 return NULL_TREE_CONST; |
|
|
1150 } |
|
|
1151 |
|
|
1152 /* |
|
|
1153 * Formatted printing. |
|
|
1154 */ |
|
|
1155 tree_constant * |
|
|
1156 builtin_printf (tree_constant *args, int nargin, int nargout) |
|
|
1157 { |
|
|
1158 tree_constant *retval = NULL_TREE_CONST; |
|
|
1159 if (nargin < 2) |
|
|
1160 usage ("printf (\"fmt\" [, ...])"); |
|
|
1161 else |
|
|
1162 retval = do_printf ("printf", args, nargin, nargout); |
|
|
1163 return retval; |
|
|
1164 } |
|
|
1165 |
|
|
1166 /* |
|
|
1167 * Product. |
|
|
1168 */ |
|
|
1169 tree_constant * |
|
|
1170 builtin_prod (tree_constant *args, int nargin, int nargout) |
|
|
1171 { |
|
|
1172 tree_constant *retval = NULL_TREE_CONST; |
|
|
1173 if (nargin != 2) |
|
|
1174 usage ("prod (M)"); |
|
|
1175 else |
|
|
1176 { |
|
|
1177 if (args != NULL_TREE_CONST && args[1].is_defined ()) |
|
|
1178 { |
|
|
1179 retval = new tree_constant [2]; |
|
|
1180 retval[0] = args[1].prod (); |
|
|
1181 } |
|
|
1182 } |
|
|
1183 return retval; |
|
|
1184 } |
|
|
1185 |
|
|
1186 /* |
|
|
1187 * Print name of current working directory. |
|
|
1188 */ |
|
|
1189 tree_constant * |
|
|
1190 builtin_pwd (tree_constant *args, int nargin, int nargout) |
|
|
1191 { |
|
|
1192 tree_constant *retval = NULL_TREE_CONST; |
|
|
1193 char *directory; |
|
|
1194 |
|
|
1195 if (verbatim_pwd) |
|
|
1196 { |
|
|
1197 char *buffer = new char [MAXPATHLEN]; |
|
|
1198 directory = getcwd (buffer, MAXPATHLEN); |
|
|
1199 |
|
|
1200 if (!directory) |
|
|
1201 { |
|
|
1202 message ("pwd", "can't find working directory!"); |
|
|
1203 delete buffer; |
|
|
1204 } |
|
|
1205 } |
|
|
1206 else |
|
|
1207 { |
|
|
1208 directory = get_working_directory ("pwd"); |
|
|
1209 } |
|
|
1210 |
|
|
1211 if (directory) |
|
|
1212 { |
|
|
1213 char *s = strconcat (directory, "\n"); |
|
|
1214 retval = new tree_constant [2]; |
|
|
1215 retval[0] = tree_constant (s); |
|
|
1216 delete [] s; |
|
|
1217 } |
|
|
1218 return retval; |
|
|
1219 } |
|
|
1220 |
|
|
1221 /* |
|
|
1222 * QPs. |
|
|
1223 */ |
|
|
1224 static void |
|
|
1225 qpsol_usage (void) |
|
|
1226 { |
|
|
1227 #if defined (QPSOL_MISSING) |
|
|
1228 message ("qpsol", "this function requires QPSOL, which is not freely\n\ |
|
|
1229 redistributable. For more information, read the file\n\ |
|
|
1230 libcruft/qpsol/README.MISSING in the source distribution."); |
|
|
1231 #else |
|
|
1232 usage ("[x, obj, info, lambda] = qpsol (x, H, c [, lb, ub] [, lb, A, ub])\n\ |
|
|
1233 \n\ |
|
|
1234 Groups of arguments surrounded in `[]' are optional, but\n\ |
|
|
1235 must appear in the same relative order shown above."); |
|
|
1236 #endif |
|
|
1237 } |
|
|
1238 |
|
|
1239 tree_constant * |
|
|
1240 builtin_qpsol (tree_constant *args, int nargin, int nargout) |
|
|
1241 { |
|
|
1242 tree_constant *retval = NULL_TREE_CONST; |
|
|
1243 |
|
|
1244 #if defined (QPSOL_MISSING) |
|
|
1245 // Force a bad value of inform, and empty matrices for x, phi, and lambda. |
|
|
1246 retval = new tree_constant [5]; |
|
|
1247 Matrix m; |
|
|
1248 retval[0] = tree_constant (m); |
|
|
1249 retval[1] = tree_constant (m); |
|
|
1250 retval[2] = tree_constant (-1.0); |
|
|
1251 retval[3] = tree_constant (m); |
|
|
1252 qpsol_usage (); |
|
|
1253 #else |
|
|
1254 if ((nargin == 4 || nargin == 6 || nargin == 7 || nargin == 9) |
|
|
1255 && (nargout >= 1 && nargout <= 4)) |
|
|
1256 DLD_BUILTIN (args, nargin, nargout, qpsol, |
|
|
1257 retval = qpsol (args, nargin, nargout);) |
|
|
1258 else |
|
|
1259 qpsol_usage (); |
|
|
1260 #endif |
|
|
1261 |
|
|
1262 return retval; |
|
|
1263 } |
|
|
1264 |
|
|
1265 /* |
|
|
1266 * QR factorization. |
|
|
1267 */ |
|
|
1268 tree_constant * |
|
|
1269 builtin_qr (tree_constant *args, int nargin, int nargout) |
|
|
1270 { |
|
|
1271 tree_constant *retval = NULL_TREE_CONST; |
|
|
1272 |
|
|
1273 if (nargin == 2 && nargout < 3) |
|
|
1274 DLD_BUILTIN (args, nargin, nargout, qr, |
|
|
1275 retval = qr (args[1], nargout);) |
|
|
1276 else |
|
|
1277 usage ("[Q, R] = qr (A)"); |
|
|
1278 |
|
|
1279 return retval; |
|
|
1280 } |
|
|
1281 |
|
|
1282 /* |
|
45
|
1283 * generalized eigenvalues via qz |
|
|
1284 */ |
|
|
1285 tree_constant * |
|
|
1286 builtin_qzval (tree_constant *args, int nargin, int nargout) |
|
|
1287 { |
|
|
1288 tree_constant *retval = NULL_TREE_CONST; |
|
|
1289 |
|
|
1290 if (nargin == 3 && nargout < 2) |
|
|
1291 DLD_BUILTIN (args, nargin, nargout, qzvalue, |
|
|
1292 retval = qzvalue (args, nargin, nargout);) |
|
|
1293 else |
|
|
1294 usage ("x = qzval (A,B): compute generalized eigenvalues of \n\ |
|
|
1295 the matrix pencil (A - lambda B). A and B must be real matrices.\n"); |
|
|
1296 |
|
|
1297 return retval; |
|
|
1298 } |
|
|
1299 |
|
|
1300 /* |
|
1
|
1301 * Random numbers. |
|
|
1302 */ |
|
|
1303 tree_constant * |
|
|
1304 builtin_quad (tree_constant *args, int nargin, int nargout) |
|
|
1305 { |
|
|
1306 tree_constant *retval = NULL_TREE_CONST; |
|
|
1307 |
|
|
1308 if ((nargin > 3 && nargin < 7) && (nargout > 0 && nargout < 5)) |
|
|
1309 DLD_BUILTIN (args, nargin, nargout, quad, |
|
|
1310 retval = do_quad (args, nargin, nargout);) |
|
|
1311 else |
|
|
1312 usage ("[v, ier, nfun, err] = quad (\"f\", a, b)\n\ |
|
|
1313 = quad (\"f\", a, b, tol)\n\ |
|
|
1314 = quad (\"f\", a, b, tol, sing)"); |
|
|
1315 |
|
|
1316 return retval; |
|
|
1317 } |
|
|
1318 |
|
|
1319 /* |
|
|
1320 * I'm outta here. |
|
|
1321 */ |
|
|
1322 tree_constant * |
|
|
1323 builtin_quit (tree_constant *args, int nargin, int nargout) |
|
|
1324 { |
|
|
1325 quitting_gracefully = 1; |
|
|
1326 clean_up_and_exit (0); |
|
|
1327 return NULL_TREE_CONST; |
|
|
1328 } |
|
|
1329 |
|
|
1330 /* |
|
|
1331 * Random numbers. |
|
|
1332 */ |
|
|
1333 tree_constant * |
|
|
1334 builtin_rand (tree_constant *args, int nargin, int nargout) |
|
|
1335 { |
|
|
1336 tree_constant *retval = NULL_TREE_CONST; |
|
|
1337 |
|
|
1338 if ((nargin > 0 && nargin < 4) && nargout == 1) |
|
|
1339 DLD_BUILTIN (args, nargin, nargout, rand, |
|
|
1340 retval = rand_internal (args, nargin, nargout);) |
|
|
1341 else |
|
|
1342 usage ("rand -- generate a random value\n\ |
|
|
1343 rand (n) -- generate N x N matrix\n\ |
|
|
1344 rand (A) -- generate matrix the size of A\n\ |
|
|
1345 rand (n, m) -- generate N x M matrix\n\ |
|
|
1346 rand (\"dist\") -- get current distribution\n\ |
|
|
1347 rand (\"distribution\") -- set distribution\n\ |
|
|
1348 rand (\"seed\") -- get current seed\n\ |
|
|
1349 rand (\"seed\", n) -- set seed"); |
|
|
1350 |
|
|
1351 return retval; |
|
|
1352 } |
|
|
1353 |
|
|
1354 /* |
|
|
1355 * Replot current plot. |
|
|
1356 */ |
|
|
1357 tree_constant * |
|
|
1358 builtin_replot (tree_constant *args, int nargin, int nargout) |
|
|
1359 { |
|
|
1360 tree_constant *retval = NULL_TREE_CONST; |
|
|
1361 |
|
|
1362 if (nargin > 1) |
|
|
1363 warning ("replot: ignoring extra arguments"); |
|
|
1364 |
|
|
1365 send_to_plot_stream ("replot\n"); |
|
|
1366 |
|
|
1367 return retval; |
|
|
1368 } |
|
|
1369 |
|
|
1370 /* |
|
|
1371 * Formatted reading. |
|
|
1372 */ |
|
|
1373 tree_constant * |
|
|
1374 builtin_scanf (tree_constant *args, int nargin, int nargout) |
|
|
1375 { |
|
|
1376 tree_constant *retval = NULL_TREE_CONST; |
|
|
1377 if (nargin != 2) |
|
|
1378 usage ("[...] = scanf (\"fmt\")"); |
|
|
1379 else |
|
|
1380 retval = do_scanf ("scanf", args, nargin, nargout); |
|
|
1381 return retval; |
|
|
1382 } |
|
|
1383 |
|
|
1384 /* |
|
|
1385 * Convert a vector to a string. |
|
|
1386 */ |
|
|
1387 tree_constant * |
|
|
1388 builtin_setstr (tree_constant *args, int nargin, int nargout) |
|
|
1389 { |
|
|
1390 tree_constant *retval = NULL_TREE_CONST; |
|
|
1391 |
|
|
1392 if (nargin == 2) |
|
|
1393 { |
|
|
1394 retval = new tree_constant [2]; |
|
|
1395 retval[0] = args[1].convert_to_str (); |
|
|
1396 } |
|
|
1397 else |
|
|
1398 usage ("setstr (v)"); |
|
|
1399 |
|
|
1400 return retval; |
|
|
1401 } |
|
|
1402 |
|
|
1403 /* |
|
|
1404 * Execute a shell command. |
|
|
1405 */ |
|
|
1406 tree_constant * |
|
|
1407 builtin_shell_command (tree_constant *args, int nargin, int nargout) |
|
|
1408 { |
|
|
1409 tree_constant *retval = NULL_TREE_CONST; |
|
|
1410 |
|
|
1411 if (nargin == 2 || nargin == 3) |
|
|
1412 { |
|
|
1413 if (args[1].is_string_type ()) |
|
|
1414 { |
|
|
1415 iprocstream cmd (args[1].string_value ()); |
|
|
1416 char ch; |
|
|
1417 ostrstream output_buf; |
|
|
1418 while (cmd.get (ch)) |
|
|
1419 output_buf.put (ch); |
|
|
1420 |
|
|
1421 output_buf << ends; |
|
|
1422 if (nargin == 2) |
|
|
1423 { |
|
|
1424 maybe_page_output (output_buf); |
|
|
1425 } |
|
|
1426 else |
|
|
1427 { |
|
|
1428 retval = new tree_constant [2]; |
|
|
1429 retval[0] = tree_constant (output_buf.str ()); |
|
|
1430 } |
|
|
1431 } |
|
|
1432 else |
|
|
1433 error ("shell_cmd: first argument must be a string"); |
|
|
1434 } |
|
|
1435 else |
|
|
1436 usage ("shell_cmd (string [, return_output])"); |
|
|
1437 |
|
|
1438 return retval; |
|
|
1439 } |
|
|
1440 |
|
|
1441 /* |
|
|
1442 * Report rows and columns. |
|
|
1443 */ |
|
|
1444 tree_constant * |
|
|
1445 builtin_size (tree_constant *args, int nargin, int nargout) |
|
|
1446 { |
|
|
1447 tree_constant *retval = NULL_TREE_CONST; |
|
|
1448 |
|
|
1449 if (nargin != 2) |
|
|
1450 usage ("size (x)"); |
|
|
1451 else |
|
|
1452 { |
|
|
1453 if (args != NULL_TREE_CONST && args[1].is_defined ()) |
|
|
1454 { |
|
|
1455 int nr = args[1].rows (); |
|
|
1456 int nc = args[1].columns (); |
|
|
1457 if (nargout == 1) |
|
|
1458 { |
|
|
1459 Matrix m (1, 2); |
|
|
1460 m.elem (0, 0) = nr; |
|
|
1461 m.elem (0, 1) = nc; |
|
|
1462 retval = new tree_constant [2]; |
|
|
1463 retval[0] = tree_constant (m); |
|
|
1464 } |
|
|
1465 else if (nargout == 2) |
|
|
1466 { |
|
|
1467 retval = new tree_constant [3]; |
|
|
1468 retval[0] = tree_constant ((double) nr); |
|
|
1469 retval[1] = tree_constant ((double) nc); |
|
|
1470 } |
|
|
1471 else |
|
|
1472 usage ("[n, m] = size (A)\n size (A)"); |
|
|
1473 } |
|
|
1474 } |
|
|
1475 return retval; |
|
|
1476 } |
|
|
1477 |
|
|
1478 /* |
|
|
1479 * Sort columns. |
|
|
1480 */ |
|
|
1481 tree_constant * |
|
|
1482 builtin_sort (tree_constant *args, int nargin, int nargout) |
|
|
1483 { |
|
|
1484 tree_constant *retval = NULL_TREE_CONST; |
|
|
1485 |
|
|
1486 if (nargin == 2) |
|
|
1487 retval = sort (args, nargin, nargout); |
|
|
1488 else |
|
|
1489 usage ("[s, i] = sort (x)"); |
|
|
1490 |
|
|
1491 return retval; |
|
|
1492 } |
|
|
1493 |
|
|
1494 /* |
|
|
1495 * Formatted printing to a string. |
|
|
1496 */ |
|
|
1497 tree_constant * |
|
|
1498 builtin_sprintf (tree_constant *args, int nargin, int nargout) |
|
|
1499 { |
|
|
1500 tree_constant *retval = NULL_TREE_CONST; |
|
|
1501 if (nargin < 2) |
|
|
1502 usage ("string = sprintf (\"fmt\" [, ...])"); |
|
|
1503 else |
|
|
1504 retval = do_printf ("sprintf", args, nargin, nargout); |
|
|
1505 return retval; |
|
|
1506 } |
|
|
1507 |
|
|
1508 /* |
|
|
1509 * Matrix sqrt. |
|
|
1510 */ |
|
|
1511 tree_constant * |
|
|
1512 builtin_sqrtm (tree_constant *args, int nargin, int nargout) |
|
|
1513 { |
|
|
1514 tree_constant *retval = NULL_TREE_CONST; |
|
|
1515 |
|
|
1516 if (nargin == 2) |
|
|
1517 retval = matrix_sqrt (args[1]); |
|
|
1518 else |
|
|
1519 usage ("sqrtm (A)"); |
|
|
1520 |
|
|
1521 return retval; |
|
|
1522 } |
|
|
1523 |
|
|
1524 /* |
|
|
1525 * Formatted reading from a string. |
|
|
1526 */ |
|
|
1527 tree_constant * |
|
|
1528 builtin_sscanf (tree_constant *args, int nargin, int nargout) |
|
|
1529 { |
|
|
1530 tree_constant *retval = NULL_TREE_CONST; |
|
|
1531 if (nargin != 3) |
|
|
1532 usage ("[...] = sscanf (string, \"fmt\")"); |
|
|
1533 else |
|
|
1534 retval = do_scanf ("sscanf", args, nargin, nargout); |
|
|
1535 return retval; |
|
|
1536 } |
|
|
1537 |
|
|
1538 /* |
|
|
1539 * Sum. |
|
|
1540 */ |
|
|
1541 tree_constant * |
|
|
1542 builtin_sum (tree_constant *args, int nargin, int nargout) |
|
|
1543 { |
|
|
1544 tree_constant *retval = NULL_TREE_CONST; |
|
|
1545 if (nargin != 2) |
|
|
1546 usage ("sum (M)"); |
|
|
1547 else |
|
|
1548 { |
|
|
1549 if (args != NULL_TREE_CONST && args[1].is_defined ()) |
|
|
1550 { |
|
|
1551 retval = new tree_constant [2]; |
|
|
1552 retval[0] = args[1].sum (); |
|
|
1553 } |
|
|
1554 } |
|
|
1555 return retval; |
|
|
1556 } |
|
|
1557 |
|
|
1558 /* |
|
|
1559 * Sum of squares. |
|
|
1560 */ |
|
|
1561 tree_constant * |
|
|
1562 builtin_sumsq (tree_constant *args, int nargin, int nargout) |
|
|
1563 { |
|
|
1564 tree_constant *retval = NULL_TREE_CONST; |
|
|
1565 if (nargin != 2) |
|
|
1566 usage ("sumsq (M)"); |
|
|
1567 else |
|
|
1568 { |
|
|
1569 if (args != NULL_TREE_CONST && args[1].is_defined ()) |
|
|
1570 { |
|
|
1571 retval = new tree_constant [2]; |
|
|
1572 retval[0] = args[1].sumsq (); |
|
|
1573 } |
|
|
1574 } |
|
|
1575 return retval; |
|
|
1576 } |
|
|
1577 |
|
|
1578 /* |
|
|
1579 * Singluar value decomposition. |
|
|
1580 */ |
|
|
1581 tree_constant * |
|
|
1582 builtin_svd (tree_constant *args, int nargin, int nargout) |
|
|
1583 { |
|
|
1584 tree_constant *retval = NULL_TREE_CONST; |
|
|
1585 |
|
|
1586 if (nargin == 2 && (nargout == 1 || nargout == 3)) |
|
|
1587 DLD_BUILTIN (args, nargin, nargout, svd, |
|
|
1588 retval = svd (args, nargin, nargout);) |
|
|
1589 else |
|
|
1590 usage ("[U, S, V] = svd (A)\n S = svd (A)"); |
|
|
1591 |
|
|
1592 return retval; |
|
|
1593 } |
|
|
1594 |
|
|
1595 /* |
|
38
|
1596 * Sylvester equation solver. |
|
|
1597 */ |
|
|
1598 tree_constant * |
|
|
1599 builtin_syl (tree_constant *args, int nargin, int nargout) |
|
|
1600 { |
|
|
1601 tree_constant *retval = NULL_TREE_CONST; |
|
|
1602 |
|
|
1603 if ((nargin == 4) && (nargout == 1)) |
|
|
1604 DLD_BUILTIN (args, nargin, nargout, syl, |
|
|
1605 retval = syl (args, nargin, nargout);) |
|
|
1606 else |
|
|
1607 usage ("X = syl (A,B,C)"); |
|
|
1608 |
|
|
1609 return retval; |
|
|
1610 } |
|
|
1611 |
|
|
1612 /* |
|
1
|
1613 * Schur Decomposition |
|
|
1614 */ |
|
|
1615 tree_constant * |
|
|
1616 builtin_schur (tree_constant *args, int nargin, int nargout) |
|
|
1617 { |
|
|
1618 tree_constant *retval = NULL_TREE_CONST; |
|
|
1619 |
|
|
1620 if ((nargin == 3 || nargin == 2) && (nargout == 1 || nargout == 2)) |
|
|
1621 DLD_BUILTIN (args, nargin, nargout, hess, |
|
|
1622 retval = schur (args, nargin, nargout);) |
|
|
1623 else |
|
|
1624 usage ("[U, S] = schur (A)\n\ |
|
|
1625 S = schur (A)\n\n\ |
|
|
1626 or, for ordered Schur:\n\n\ |
|
|
1627 [U, S] = schur (A, \"A, D, or U\")\n\ |
|
|
1628 S = schur (A, \"A, D, or U\")\n\ |
|
|
1629 where:\n\n\ |
|
|
1630 A = continuous time poles\n\ |
|
|
1631 D = discrete time poles\n\ |
|
|
1632 U = unordered schur (default)"); |
|
|
1633 |
|
|
1634 return retval; |
|
|
1635 } |
|
|
1636 |
|
|
1637 /* |
|
30
|
1638 * Givens rotation |
|
|
1639 */ |
|
|
1640 tree_constant * |
|
|
1641 builtin_givens (tree_constant *args, int nargin, int nargout) |
|
|
1642 { |
|
|
1643 tree_constant *retval = NULL_TREE_CONST; |
|
|
1644 |
|
|
1645 if (nargin == 3 && (nargout == 1 || nargout == 2 )) |
|
|
1646 retval = givens (args, nargin, nargout); |
|
|
1647 else |
|
|
1648 usage ("[c, s] = givens (x,y)\n G = givens (x,y)"); |
|
|
1649 |
|
|
1650 return retval; |
|
|
1651 } |
|
|
1652 |
|
|
1653 /* |
|
|
1654 * Hessenberg Decomposition |
|
1
|
1655 */ |
|
|
1656 tree_constant * |
|
|
1657 builtin_hess (tree_constant *args, int nargin, int nargout) |
|
|
1658 { |
|
|
1659 tree_constant *retval = NULL_TREE_CONST; |
|
|
1660 |
|
|
1661 if (nargin == 2 && (nargout == 1 || nargout == 2)) |
|
|
1662 DLD_BUILTIN (args, nargin, nargout, hess, |
|
|
1663 retval = hess (args, nargin, nargout);) |
|
|
1664 else |
|
|
1665 usage ("[P, H] = hess (A)\n H = hess (A)"); |
|
|
1666 |
|
|
1667 return retval; |
|
|
1668 } |
|
|
1669 |
|
|
1670 /* |
|
|
1671 * Copying information. |
|
|
1672 */ |
|
|
1673 tree_constant * |
|
|
1674 builtin_warranty (tree_constant *args, int nargin, int nargout) |
|
|
1675 { |
|
|
1676 ostrstream output_buf; |
|
|
1677 output_buf << "\n Octave, version " << version_string |
|
|
1678 << ". Copyright (C) 1992, 1993, John W. Eaton\n" |
|
|
1679 << "\n\ |
|
|
1680 This program is free software; you can redistribute it and/or modify\n\ |
|
|
1681 it under the terms of the GNU General Public License as published by\n\ |
|
|
1682 the Free Software Foundation; either version 2 of the License, or\n\ |
|
|
1683 (at your option) any later version.\n\n\ |
|
|
1684 This program is distributed in the hope that it will be useful,\n\ |
|
|
1685 but WITHOUT ANY WARRANTY; without even the implied warranty of\n\ |
|
|
1686 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the\n\ |
|
|
1687 GNU General Public License for more details.\n\n\ |
|
|
1688 You should have received a copy of the GNU General Public License\n\ |
|
|
1689 along with this program. If not, write to the Free Software\n\ |
|
|
1690 Foundation, 675 Mass Ave, Cambridge, MA 02139, USA.\n\n"; |
|
|
1691 |
|
|
1692 output_buf << ends; |
|
|
1693 maybe_page_output (output_buf); |
|
|
1694 |
|
|
1695 return NULL_TREE_CONST; |
|
|
1696 } |
|
|
1697 |
|
|
1698 /* |
|
|
1699 * A matrix of zeros. |
|
|
1700 */ |
|
|
1701 tree_constant * |
|
|
1702 builtin_zeros (tree_constant *args, int nargin, int nargout) |
|
|
1703 { |
|
|
1704 tree_constant *retval = NULL_TREE_CONST; |
|
|
1705 |
|
|
1706 switch (nargin) |
|
|
1707 { |
|
|
1708 case 2: |
|
|
1709 retval = new tree_constant [2]; |
|
|
1710 retval[0] = fill_matrix (args[1], 0.0, "zeros"); |
|
|
1711 break; |
|
|
1712 case 3: |
|
|
1713 retval = new tree_constant [2]; |
|
|
1714 retval[0] = fill_matrix (args[1], args[2], 0.0, "zeros"); |
|
|
1715 break; |
|
|
1716 default: |
|
|
1717 usage ("zeros (n)\n zeros (A)\n zeros (n, m)"); |
|
|
1718 break; |
|
|
1719 } |
|
|
1720 return retval; |
|
|
1721 } |
|
|
1722 |
|
|
1723 /* |
|
|
1724 ;;; Local Variables: *** |
|
|
1725 ;;; mode: C++ *** |
|
|
1726 ;;; page-delimiter: "^/\\*" *** |
|
|
1727 ;;; End: *** |
|
|
1728 */ |
