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