![[BACK]](/icons/cvsweb/back.gif){kind=icon}
Return to ox.c CVS log ![[TXT]](/icons/cvsweb/text.gif){kind=icon}
![[DIR]](/icons/cvsweb/dir.gif){kind=icon}
Up to [local] / OpenXM_contrib2 / asir2000 / io|
Return to ox.c CVS log | Up to [local] / OpenXM_contrib2 / asir2000 / io |
1.5 noro 1: /*
2: * Copyright (c) 1994-2000 FUJITSU LABORATORIES LIMITED
3: * All rights reserved.
4: *
5: * FUJITSU LABORATORIES LIMITED ("FLL") hereby grants you a limited,
6: * non-exclusive and royalty-free license to use, copy, modify and
7: * redistribute, solely for non-commercial and non-profit purposes, the
8: * computer program, "Risa/Asir" ("SOFTWARE"), subject to the terms and
9: * conditions of this Agreement. For the avoidance of doubt, you acquire
10: * only a limited right to use the SOFTWARE hereunder, and FLL or any
11: * third party developer retains all rights, including but not limited to
12: * copyrights, in and to the SOFTWARE.
13: *
14: * (1) FLL does not grant you a license in any way for commercial
15: * purposes. You may use the SOFTWARE only for non-commercial and
16: * non-profit purposes only, such as academic, research and internal
17: * business use.
18: * (2) The SOFTWARE is protected by the Copyright Law of Japan and
19: * international copyright treaties. If you make copies of the SOFTWARE,
20: * with or without modification, as permitted hereunder, you shall affix
21: * to all such copies of the SOFTWARE the above copyright notice.
22: * (3) An explicit reference to this SOFTWARE and its copyright owner
23: * shall be made on your publication or presentation in any form of the
24: * results obtained by use of the SOFTWARE.
25: * (4) In the event that you modify the SOFTWARE, you shall notify FLL by
1.6 noro 26: * e-mail at risa-admin@sec.flab.fujitsu.co.jp of the detailed specification
1.5 noro 27: * for such modification or the source code of the modified part of the
28: * SOFTWARE.
29: *
30: * THE SOFTWARE IS PROVIDED AS IS WITHOUT ANY WARRANTY OF ANY KIND. FLL
31: * MAKES ABSOLUTELY NO WARRANTIES, EXPRESSED, IMPLIED OR STATUTORY, AND
32: * EXPRESSLY DISCLAIMS ANY IMPLIED WARRANTY OF MERCHANTABILITY, FITNESS
33: * FOR A PARTICULAR PURPOSE OR NONINFRINGEMENT OF THIRD PARTIES'
34: * RIGHTS. NO FLL DEALER, AGENT, EMPLOYEES IS AUTHORIZED TO MAKE ANY
35: * MODIFICATIONS, EXTENSIONS, OR ADDITIONS TO THIS WARRANTY.
36: * UNDER NO CIRCUMSTANCES AND UNDER NO LEGAL THEORY, TORT, CONTRACT,
37: * OR OTHERWISE, SHALL FLL BE LIABLE TO YOU OR ANY OTHER PERSON FOR ANY
38: * DIRECT, INDIRECT, SPECIAL, INCIDENTAL, PUNITIVE OR CONSEQUENTIAL
39: * DAMAGES OF ANY CHARACTER, INCLUDING, WITHOUT LIMITATION, DAMAGES
40: * ARISING OUT OF OR RELATING TO THE SOFTWARE OR THIS AGREEMENT, DAMAGES
41: * FOR LOSS OF GOODWILL, WORK STOPPAGE, OR LOSS OF DATA, OR FOR ANY
42: * DAMAGES, EVEN IF FLL SHALL HAVE BEEN INFORMED OF THE POSSIBILITY OF
43: * SUCH DAMAGES, OR FOR ANY CLAIM BY ANY OTHER PARTY. EVEN IF A PART
44: * OF THE SOFTWARE HAS BEEN DEVELOPED BY A THIRD PARTY, THE THIRD PARTY
45: * DEVELOPER SHALL HAVE NO LIABILITY IN CONNECTION WITH THE USE,
46: * PERFORMANCE OR NON-PERFORMANCE OF THE SOFTWARE.
1.11 ! noro 47: * $OpenXM: OpenXM_contrib2/asir2000/io/ox.c,v 1.10 2000/11/08 08:02:51 noro Exp $
1.5 noro 48: */
1.1 noro 49: #include "ca.h"
50: #include "parse.h"
1.3 noro 51: #include "signal.h"
1.1 noro 52: #include "wsio.h"
53: #include "ox.h"
54:
55: #define ISIZ sizeof(int)
56:
57: void ox_flush_stream(),ox_write_int(),ox_write_cmo();
58: void ox_read_int(),ox_read_cmo();
59: void mclist_to_mc();
60: void ox_read_local();
61:
62: extern Obj VOIDobj;
63:
64: extern int ox_need_conv;
65: extern int ox_usr1_sent, ox_int_received, critical_when_signal;
66: unsigned int ox_serial;
67: int ox_flushing;
68: int ox_batch;
69: int ox_check=1;
1.2 noro 70: int ox_exchange_mathcap=1;
1.1 noro 71: jmp_buf ox_env;
72:
73: MATHCAP my_mathcap;
74:
75: struct oxcap {
76: unsigned int ox;
77: int ncap;
78: int *cap;
79: };
80:
81: struct mathcap {
82: LIST mc;
83: unsigned int version;
84: char *servername;
85: int nsmcap;
86: unsigned int *smcap;
87: int noxcap;
88: struct oxcap *oxcap;
89: };
90:
91: struct oxcap *my_oxcap;
92:
93: static struct mathcap my_mc;
94: static struct mathcap *remote_mc;
95: static int remote_mc_len;
96:
1.9 noro 97: #if defined(VISUAL)
98: /* XXX : mainly used in engine2000/io.c, but declared here */
99: HANDLE hStreamNotify,hStreamNotify_Ack;
100:
101: void cleanup_events()
102: {
103: /* ox_watch_stream may be waiting for hStreamNotify_Ack to be set */
104:
105: ResetEvent(hStreamNotify);
106: SetEvent(hStreamNotify_Ack);
107: }
108: #endif
109:
1.1 noro 110: void ox_resetenv(s)
111: char *s;
112: {
1.9 noro 113: #if defined(VISUAL)
114: cleanup_events();
115: #endif
1.1 noro 116: fprintf(stderr,"%s\n",s);
117: longjmp(ox_env,1);
118: }
119:
120: static int available_cmo[] = {
121: CMO_NULL, CMO_INT32, CMO_DATUM, CMO_STRING, CMO_MATHCAP,
122: CMO_ERROR, CMO_ERROR2, CMO_LIST, CMO_MONOMIAL32,
123: CMO_ZZ, CMO_QQ, CMO_ZERO,
124: CMO_DMS_GENERIC, CMO_DMS_OF_N_VARIABLES,
125: CMO_RING_BY_NAME, CMO_DISTRIBUTED_POLYNOMIAL,
126: CMO_RECURSIVE_POLYNOMIAL, CMO_UNIVARIATE_POLYNOMIAL,
127: CMO_INDETERMINATE,
1.11 ! noro 128: CMO_TREE,
1.1 noro 129: 0
130: };
131:
132: static int available_sm[] = {
133: SM_dupErrors, SM_getsp, SM_popSerializedLocalObject,
1.7 noro 134: SM_popCMO, SM_popString, SM_pushCMOtag, SM_setName,
1.1 noro 135: SM_evalName, SM_executeStringByLocalParser,
136: SM_executeStringByLocalParserInBatchMode,
137: SM_executeFunction, SM_shutdown, SM_pops,
138: SM_mathcap, SM_setMathcap, SM_nop,
139: SM_beginBlock, SM_endBlock,
140: 0
141: };
142:
143: /*
144: mathcap =
145: [
146: version list,
147: SMlist,
148: [
149: [OX tag,CMO tag list],
150: [OX tag,CMO tag list],
151: ...
152: ]
153: ]
154: */
155:
156: void create_my_mathcap(char *system)
157: {
158: NODE n,n0;
159: int i,k;
160: STRING str;
161: LIST sname,smlist,oxlist,cmolist,asirlist,oxtag,oxasir,r;
162: USINT tag,t,t1;
163:
164: if ( my_mathcap )
165: return;
166: /* version */
167: MKSTR(str,system);
168: MKUSINT(t,OX_VERSION);
169: n0 = mknode(2,t,str); MKLIST(sname,n0);
170:
171: /* cmo tag */
172: for ( n0 = 0, i = 0; k = available_sm[i]; i++ ) {
173: NEXTNODE(n0,n); MKUSINT(t,k); BDY(n) = (pointer)t;
174: }
175: NEXT(n) = 0; MKLIST(smlist,n0);
176:
177: /* creation of [OX_DATA,CMO list] */
178: /* ox tag */
179: MKUSINT(tag,OX_DATA);
180: /* cmo tag */
181: for ( n0 = 0, i = 0; k = available_cmo[i]; i++ ) {
182: NEXTNODE(n0,n); MKUSINT(t,k); BDY(n) = (pointer)t;
183: }
184: NEXT(n) = 0; MKLIST(cmolist,n0);
185: /* [ox tag, cmo list] */
186: n0 = mknode(2,tag,cmolist);
187: MKLIST(oxlist,n0);
188:
189: /* creation of [OX_LOCAL_OBJECT_ASIR,ASIR tag] */
190: /* ox tag */
191: MKUSINT(tag,OX_LOCAL_OBJECT_ASIR);
192: /* local tag */
193: MKUSINT(t,ASIR_VL);
194: MKUSINT(t1,ASIR_OBJ);
195: n0 = mknode(2,t,t1); MKLIST(cmolist,n0);
196: /* [ox tag, local list] */
197: n0 = mknode(2,tag,cmolist);
198: MKLIST(asirlist,n0);
199:
200: /* [oxlist,asirlist] */
201: n0 = mknode(2,oxlist,asirlist); MKLIST(oxasir,n0);
202:
203: /* [version,sm,oxasir] */
204: n0 = mknode(3,sname,smlist,oxasir); MKLIST(r,n0);
205:
206: MKMATHCAP(my_mathcap,r);
207: mclist_to_mc(r,&my_mc);
208: my_oxcap = my_mc.oxcap;
209: }
210:
211: void store_remote_mathcap(int s,MATHCAP mc)
212: {
213: if ( !remote_mc ) {
214: remote_mc_len = 16;
215: remote_mc = (struct mathcap *)
216: CALLOC(remote_mc_len,sizeof(struct mathcap));
217: }
218: if ( s >= remote_mc_len ) {
219: remote_mc_len *= 2;
220: remote_mc = (struct mathcap *)REALLOC(remote_mc,
221: remote_mc_len*sizeof(struct mathcap));
222: }
223: mclist_to_mc(BDY(mc),&remote_mc[s]);
224: }
225:
226: /*
227: mathcap =
228: [
229: version list,
230: SMlist,
231: [
232: [OX tag,CMO tag list],
233: [OX tag,CMO tag list],
234: ...
235: ]
236: ]
237:
238: ===>
239:
240: mathcap
241: | version | &servername | nsmcap | &smcap | noxcap | &oxcap |
242: smcap
243: | SM_xxx | SM_yyy | ... |
244: oxcap
245: | oxcap[0] | oxcap[1] | ... |
246: oxcap[i]
247: | ox | ncap | &cap |
248: cap
249: | CMO_xxx | CMO_yyy | ... |
250: */
251:
252: void mclist_to_mc(LIST mclist,struct mathcap *mc)
253: {
254: int id,l,i,j;
255: NODE n,t,oxcmo,ox,cap;
256: int *ptr;
257:
258: /*
259: [
260: [ version,servername ]
261: [sm1,sm2,...],
262: [
263: [o1,[n11,n12,...]],
264: [o2,[n21,n22,...]],
265: ...
266: ]
267: ]
268: */
269: n = BDY(mclist);
270: mc->mc = mclist;
271: mc->version = BDY((USINT)BDY(BDY((LIST)BDY(n))));
272: mc->servername = BDY((STRING)BDY(NEXT(BDY((LIST)BDY(n)))));
273:
274: /* smcap */
275: n = NEXT(n);
276: t = BDY((LIST)BDY(n));
277: mc->nsmcap = length(t);
278: mc->smcap = (int *)MALLOC_ATOMIC(mc->nsmcap*sizeof(int));
279: for ( j = 0, ptr = mc->smcap; j < mc->nsmcap; j++, t = NEXT(t) )
280: ptr[j] = BDY((USINT)BDY(t));
281:
282: n = NEXT(n);
283: n = BDY((LIST)BDY(n));
284: /* n -> BDY([[OX1,CMOlist1], [OX2,CMOlist2], ...]) */
285: mc->noxcap = length(n);
286: mc->oxcap = (struct oxcap *)MALLOC(mc->noxcap*sizeof(struct oxcap));
287: for ( j = 0; j < mc->noxcap; j++, n = NEXT(n) ) {
288: oxcmo = BDY((LIST)BDY(n));
289: /* oxcmo = BDY([OXj,CMOlistj]) */
290: mc->oxcap[j].ox = BDY((USINT)BDY(oxcmo));
291: cap = BDY((LIST)BDY(NEXT(oxcmo)));
292: /* cap ->BDY(CMOlistj) */
293: l = length(cap);
294: mc->oxcap[j].ncap = l;
295: mc->oxcap[j].cap = (unsigned int *)CALLOC(l+1,sizeof(unsigned int));
296: for ( t = cap, ptr = mc->oxcap[j].cap, i = 0; i < l; t = NEXT(t), i++ )
297: ptr[i] = BDY((USINT)BDY(t));
298: }
299: }
300:
301: int check_sm_by_mc(s,smtag)
302: int s;
303: unsigned int smtag;
304: {
305: struct mathcap *rmc;
306: int nsmcap,i;
307: unsigned int *smcap;
308:
309: /* XXX : return 1 if remote_mc is not available. */
310: if ( !remote_mc )
311: return 1;
312: rmc = &remote_mc[s];
313: nsmcap = rmc->nsmcap;
314: smcap = rmc->smcap;
315: if ( !smcap )
316: return 1;
317: for ( i = 0; i < nsmcap; i++ )
318: if ( smcap[i] == smtag )
319: break;
320: if ( i == nsmcap )
321: return 0;
322: else
323: return 1;
324: }
325:
326: int check_by_mc(s,oxtag,cmotag)
327: int s;
328: unsigned int oxtag,cmotag;
329: {
330: struct mathcap *rmc;
331: int noxcap,ncap,i,j;
332: struct oxcap *oxcap;
333: unsigned int *cap;
334:
335: /* XXX : return 1 if remote_mc is not available. */
336: if ( !remote_mc )
337: return 1;
338: rmc = &remote_mc[s];
339: noxcap = rmc->noxcap;
340: oxcap = rmc->oxcap;
341: if ( !oxcap )
342: return 1;
343: for ( i = 0; i < noxcap; i++ )
344: if ( oxcap[i].ox == oxtag )
345: break;
346: if ( i == noxcap )
347: return 0;
348: ncap = oxcap[i].ncap;
349: cap = oxcap[i].cap;
350: for ( j = 0; j < ncap; j++ )
351: if ( cap[j] == cmotag )
352: break;
353: if ( j == ncap )
354: return 0;
355: else
356: return 1;
357: }
358:
359: void begin_critical() {
360: critical_when_signal = 1;
361: }
362:
363: void end_critical() {
364: critical_when_signal = 0;
365: if ( ox_usr1_sent ) {
366: ox_usr1_sent = 0; ox_usr1_handler();
367: }
368: if ( ox_int_received ) {
369: ox_int_received = 0; int_handler(SIGINT);
370: }
371: }
372:
373: void ox_usr1_handler(sig)
374: int sig;
375: {
376: extern jmp_buf env;
377: unsigned int cmd;
378:
379: #if !defined(VISUAL)
380: signal(SIGUSR1,ox_usr1_handler);
381: #endif
382: if ( critical_when_signal ) {
383: fprintf(stderr,"usr1 : critical\n");
384: ox_usr1_sent = 1;
385: } else {
386: ox_flushing = 1;
387: ox_resetenv("usr1 : return to toplevel by SIGUSR1");
388: }
389: }
390:
391: void clear_readbuffer()
392: {
393: char c;
394: fd_set r,w,e;
395: struct timeval interval;
396: int n,sock;
397:
398: #if defined(linux)
399: iofp[0].in->_IO_read_ptr = iofp[0].in->_IO_read_end;
400: #elif defined(__FreeBSD__)
401: fpurge(iofp[0].in);
402: #endif
403: /*
404: sock = fileno(iofp[0].in);
405: interval.tv_sec = (int)0;
406: interval.tv_usec = (int)0;
407:
408: FD_ZERO(&r); FD_ZERO(&w); FD_ZERO(&e);
409: FD_SET(sock,&r);
410: while ( 1 ) {
411: n = select(FD_SETSIZE,&r,&w,&e,&interval);
412: if ( !n )
413: break;
414: read(sock,&c,1);
415: }
416: */
417: }
418:
419: #if MPI
420: int ox_data_is_available(int s)
421: {
422: return 1;
423: }
424:
425: void wait_for_data(int s)
426: {
427: return;
428: }
429: #else
430: int ox_data_is_available(int s)
431: {
432: return FP_DATA_IS_AVAILABLE(iofp[s].in);
433: }
434:
435: void wait_for_data(int s)
436: {
437: fd_set r;
438: int sock;
439:
440: if ( !FP_DATA_IS_AVAILABLE(iofp[s].in) ) {
441: #if defined(VISUAL)
442: sock = iofp[s].in->fildes;
443: FD_ZERO(&r);
444: FD_SET(sock,&r);
445: select(0,&r,NULL,NULL,NULL);
446: #else
447: sock = fileno(iofp[s].in);
448: FD_ZERO(&r);
449: FD_SET(sock,&r);
450: select(FD_SETSIZE,&r,NULL,NULL,NULL);
451: #endif
452: }
453: }
454: #endif
455:
456: void ox_send_data(int s,pointer p)
457: {
1.8 noro 458: ERR err;
459:
460: if ( ox_check && !ox_check_cmo(s,(Obj)p) ) {
461: create_error(&err,ox_serial,"ox_send_data : Mathcap violation");
462: p = (pointer)err;
463: }
1.1 noro 464: begin_critical();
465: ox_write_int(s,OX_DATA);
466: ox_write_int(s,ox_serial++);
467: ox_write_cmo(s,p);
468: ox_flush_stream(s);
469: end_critical();
470: }
471:
472: void ox_send_cmd(int s,int id)
473: {
474: if ( ox_check && !check_sm_by_mc(s,id) )
475: error("ox_send_cmd : Mathcap violation");
476: begin_critical();
477: ox_write_int(s,OX_COMMAND);
478: ox_write_int(s,ox_serial++);
479: ox_write_int(s,id);
480: ox_flush_stream(s);
481: end_critical();
482: }
483:
484: void ox_send_sync(int s)
485: {
486: begin_critical();
487: ox_write_int(s,OX_SYNC_BALL);
488: ox_write_int(s,ox_serial++);
489: ox_flush_stream(s);
490: end_critical();
491: }
492:
493: void ox_send_local_data(int s,Obj p)
494: {
495: begin_critical();
496: ox_write_int(s,OX_LOCAL_OBJECT_ASIR);
497: ox_write_int(s,ox_serial++);
498: ox_write_int(s,ASIR_OBJ);
499: saveobj(iofp[s].out,p);
500: ox_flush_stream(s);
501: end_critical();
502: }
503:
504: void ox_send_local_ring(int s,VL vl)
505: {
506: begin_critical();
507: ox_write_int(s,OX_LOCAL_OBJECT_ASIR);
508: ox_write_int(s,ox_serial++);
509: ox_write_int(s,ASIR_VL);
510: savevl(iofp[s].out,vl);
511: ox_flush_stream(s);
512: end_critical();
513: }
514:
515: unsigned int ox_recv(int s, int *id, pointer *p)
516: {
517: unsigned int cmd,serial;
518: USINT ui;
519:
520: wait_for_data(s);
521: begin_critical();
522: ox_read_int(s,id);
523: ox_read_int(s,&serial);
524: switch ( *id ) {
525: case OX_COMMAND:
526: ox_read_int(s,&cmd);
527: MKUSINT(ui,cmd);
528: *p = (pointer)ui;
529: break;
530: case OX_DATA:
531: ox_read_cmo(s,p);
532: break;
533: case OX_LOCAL_OBJECT_ASIR:
534: ox_read_local(s,p);
535: break;
536: default:
537: *p = 0;
538: break;
539: }
540: end_critical();
541: return serial;
542: }
543:
544: void ox_get_result(s,rp)
545: int s;
546: Obj *rp;
547: {
548: int id;
549: Obj obj,r;
550: int level;
551:
552: level = 0;
553: r = 0;
554: do {
555: ox_recv(s,&id,(pointer *)&obj);
556: if ( id == OX_COMMAND ) {
557: switch ( ((USINT)obj)->body ) {
558: case SM_beginBlock:
559: level++;
560: break;
561: case SM_endBlock:
562: level--;
563: }
564: } else
565: r = obj;
566: } while ( level );
567: *rp = r;
568: }
569:
570: void ox_read_int(int s, int *n)
571: {
572: ox_need_conv = iofp[s].conv;
573: read_int(iofp[s].in,n);
574: }
575:
576: void ox_read_cmo(int s, Obj *rp)
577: {
578: ox_need_conv = iofp[s].conv;
579: read_cmo(iofp[s].in,rp);
580: }
581:
582: void ox_read_local(int s, Obj *rp)
583: {
584: int id;
585:
586: ox_need_conv = iofp[s].conv;
587: read_int(iofp[s].in,&id);
588: switch ( id ) {
589: case ASIR_VL:
590: loadvl(iofp[s].in);
591: *rp = VOIDobj;
592: break;
593: case ASIR_OBJ:
594: loadobj(iofp[s].in,rp);
595: break;
596: default:
597: error("ox_read_local : unsupported id");
598: break;
599: }
600: }
601:
602: void ox_write_int(int s, int n)
603: {
604: ox_need_conv = iofp[s].conv;
605: write_int(iofp[s].out,&n);
606: }
607:
608: void ox_write_cmo(int s, Obj obj)
609: {
610: ox_need_conv = iofp[s].conv;
611: write_cmo(iofp[s].out,obj);
612: }
613:
614: int ox_check_cmo(int s, Obj obj)
615: {
616: NODE m;
617:
618: if ( !obj )
619: return 1;
620: switch ( OID(obj) ) {
621: case O_MATHCAP: case O_STR: case O_ERR: case O_USINT: case O_VOID:
1.10 noro 622: case O_BYTEARRAY:
1.1 noro 623: return 1;
624: case O_P:
625: if ( !check_by_mc(s,OX_DATA,CMO_RECURSIVE_POLYNOMIAL) )
626: return 0;
627: else
628: return ox_check_cmo_p(s,(P)obj);
629: case O_R:
630: if ( !check_by_mc(s,OX_DATA,CMO_RATIONAL) )
631: return 0;
632: else if ( !check_by_mc(s,OX_DATA,CMO_RECURSIVE_POLYNOMIAL) )
633: return 0;
634: else
635: return ox_check_cmo_p(s,NM((R)obj)) && ox_check_cmo_p(s,DN((R)obj));
636: case O_DP:
637: return ox_check_cmo_dp(s,(DP)obj);
638: case O_N:
1.4 noro 639: switch ( NID((Num)obj) ) {
640: case N_Q:
641: if ( INT((Q)obj) )
642: return check_by_mc(s,OX_DATA,CMO_ZZ);
643: else
644: return check_by_mc(s,OX_DATA,CMO_QQ);
645: case N_R:
646: return 1;
647: default:
648: return 0;
649: }
650: break;
1.1 noro 651: case O_LIST:
652: for ( m = BDY((LIST)obj); m; m = NEXT(m) )
653: if ( !ox_check_cmo(s,(BDY(m))) )
654: return 0;
1.11 ! noro 655: return 1;
! 656: case O_QUOTE: /* XXX */
1.1 noro 657: return 1;
658: default:
659: return 0;
660: }
661: }
662:
663: void ox_get_serverinfo(int s, LIST *rp)
664: {
665: if ( remote_mc )
666: *rp = remote_mc[s].mc;
667: else {
668: MKLIST(*rp,0);
669: }
670: }
671:
672: int ox_check_cmo_p(int s, P p)
673: {
674: DCP dc;
675:
676: if ( NUM(p) )
677: return ox_check_cmo(s,(Obj)p);
678: else {
679: for ( dc = DC(p); dc; dc = NEXT(dc) )
680: if ( !ox_check_cmo_p(s,COEF(dc)) )
681: return 0;
682: return 1;
683: }
684: }
685:
686: int ox_check_cmo_dp(int s, DP p)
687: {
688: MP m;
689:
690: for ( m = BDY(p); m; m = NEXT(m) )
691: if ( !ox_check_cmo(s,(Obj)m->c) )
692: return 0;
693: return 1;
694: }
695:
696: void ox_flush_stream(s)
697: int s;
698: {
699: if ( ox_batch )
700: return;
701: #if defined(VISUAL)
702: if ( _fileno(&iofp[s].out->fp) < 0 )
703: cflush(iofp[s].out);
704: else
705: #elif MPI
706: if ( (char)fileno(&iofp[s].out->fp) < 0 )
707: cflush(iofp[s].out);
708: else
709: #endif
710: fflush(iofp[s].out);
711: }
712:
713: void ox_flush_stream_force(s)
714: int s;
715: {
716: #if defined(VISUAL)
717: if ( _fileno(&iofp[s].out->fp) < 0 )
718: cflush(iofp[s].out);
719: else
720: #elif MPI
721: if ( (char)fileno(&iofp[s].out->fp) < 0 )
722: cflush(iofp[s].out);
723: else
724: #endif
725: fflush(iofp[s].out);
726: }