File: swi.c

package info (click to toggle)
swi-prolog 5.2.13-1
  • links: PTS
  • area: main
  • in suites: sarge
  • size: 55,032 kB
  • ctags: 29,741
  • sloc: ansic: 215,187; perl: 110,995; cpp: 7,687; sh: 3,235; makefile: 3,227; yacc: 843; xml: 31; awk: 14; sed: 12
file content (1478 lines) | stat: -rw-r--r-- 29,585 bytes parent folder | download | duplicates (2)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
577
578
579
580
581
582
583
584
585
586
587
588
589
590
591
592
593
594
595
596
597
598
599
600
601
602
603
604
605
606
607
608
609
610
611
612
613
614
615
616
617
618
619
620
621
622
623
624
625
626
627
628
629
630
631
632
633
634
635
636
637
638
639
640
641
642
643
644
645
646
647
648
649
650
651
652
653
654
655
656
657
658
659
660
661
662
663
664
665
666
667
668
669
670
671
672
673
674
675
676
677
678
679
680
681
682
683
684
685
686
687
688
689
690
691
692
693
694
695
696
697
698
699
700
701
702
703
704
705
706
707
708
709
710
711
712
713
714
715
716
717
718
719
720
721
722
723
724
725
726
727
728
729
730
731
732
733
734
735
736
737
738
739
740
741
742
743
744
745
746
747
748
749
750
751
752
753
754
755
756
757
758
759
760
761
762
763
764
765
766
767
768
769
770
771
772
773
774
775
776
777
778
779
780
781
782
783
784
785
786
787
788
789
790
791
792
793
794
795
796
797
798
799
800
801
802
803
804
805
806
807
808
809
810
811
812
813
814
815
816
817
818
819
820
821
822
823
824
825
826
827
828
829
830
831
832
833
834
835
836
837
838
839
840
841
842
843
844
845
846
847
848
849
850
851
852
853
854
855
856
857
858
859
860
861
862
863
864
865
866
867
868
869
870
871
872
873
874
875
876
877
878
879
880
881
882
883
884
885
886
887
888
889
890
891
892
893
894
895
896
897
898
899
900
901
902
903
904
905
906
907
908
909
910
911
912
913
914
915
916
917
918
919
920
921
922
923
924
925
926
927
928
929
930
931
932
933
934
935
936
937
938
939
940
941
942
943
944
945
946
947
948
949
950
951
952
953
954
955
956
957
958
959
960
961
962
963
964
965
966
967
968
969
970
971
972
973
974
975
976
977
978
979
980
981
982
983
984
985
986
987
988
989
990
991
992
993
994
995
996
997
998
999
1000
1001
1002
1003
1004
1005
1006
1007
1008
1009
1010
1011
1012
1013
1014
1015
1016
1017
1018
1019
1020
1021
1022
1023
1024
1025
1026
1027
1028
1029
1030
1031
1032
1033
1034
1035
1036
1037
1038
1039
1040
1041
1042
1043
1044
1045
1046
1047
1048
1049
1050
1051
1052
1053
1054
1055
1056
1057
1058
1059
1060
1061
1062
1063
1064
1065
1066
1067
1068
1069
1070
1071
1072
1073
1074
1075
1076
1077
1078
1079
1080
1081
1082
1083
1084
1085
1086
1087
1088
1089
1090
1091
1092
1093
1094
1095
1096
1097
1098
1099
1100
1101
1102
1103
1104
1105
1106
1107
1108
1109
1110
1111
1112
1113
1114
1115
1116
1117
1118
1119
1120
1121
1122
1123
1124
1125
1126
1127
1128
1129
1130
1131
1132
1133
1134
1135
1136
1137
1138
1139
1140
1141
1142
1143
1144
1145
1146
1147
1148
1149
1150
1151
1152
1153
1154
1155
1156
1157
1158
1159
1160
1161
1162
1163
1164
1165
1166
1167
1168
1169
1170
1171
1172
1173
1174
1175
1176
1177
1178
1179
1180
1181
1182
1183
1184
1185
1186
1187
1188
1189
1190
1191
1192
1193
1194
1195
1196
1197
1198
1199
1200
1201
1202
1203
1204
1205
1206
1207
1208
1209
1210
1211
1212
1213
1214
1215
1216
1217
1218
1219
1220
1221
1222
1223
1224
1225
1226
1227
1228
1229
1230
1231
1232
1233
1234
1235
1236
1237
1238
1239
1240
1241
1242
1243
1244
1245
1246
1247
1248
1249
1250
1251
1252
1253
1254
1255
1256
1257
1258
1259
1260
1261
1262
1263
1264
1265
1266
1267
1268
1269
1270
1271
1272
1273
1274
1275
1276
1277
1278
1279
1280
1281
1282
1283
1284
1285
1286
1287
1288
1289
1290
1291
1292
1293
1294
1295
1296
1297
1298
1299
1300
1301
1302
1303
1304
1305
1306
1307
1308
1309
1310
1311
1312
1313
1314
1315
1316
1317
1318
1319
1320
1321
1322
1323
1324
1325
1326
1327
1328
1329
1330
1331
1332
1333
1334
1335
1336
1337
1338
1339
1340
1341
1342
1343
1344
1345
1346
1347
1348
1349
1350
1351
1352
1353
1354
1355
1356
1357
1358
1359
1360
1361
1362
1363
1364
1365
1366
1367
1368
1369
1370
1371
1372
1373
1374
1375
1376
1377
1378
1379
1380
1381
1382
1383
1384
1385
1386
1387
1388
1389
1390
1391
1392
1393
1394
1395
1396
1397
1398
1399
1400
1401
1402
1403
1404
1405
1406
1407
1408
1409
1410
1411
1412
1413
1414
1415
1416
1417
1418
1419
1420
1421
1422
1423
1424
1425
1426
1427
1428
1429
1430
1431
1432
1433
1434
1435
1436
1437
1438
1439
1440
1441
1442
1443
1444
1445
1446
1447
1448
1449
1450
1451
1452
1453
1454
1455
1456
1457
1458
1459
1460
1461
1462
1463
1464
1465
1466
1467
1468
1469
1470
1471
1472
1473
1474
1475
1476
1477
1478
/*  $Id: swi.c,v 1.2 2001/01/27 17:33:42 jan Exp $

    Part of XPCE
    Designed and implemented by Anjo Anjewierden and Jan Wielemaker
    E-mail: jan@swi.psy.uva.nl

    Copyright (C) 1999 University of Amsterdam. All rights reserved.
*/

#define _PL_INLINE
#include "SWI-Stream.h"
#include "swi.h"

#ifdef HAVE_CONFIG_H
#include <config.h>
#endif

#include <stdio.h>
#include <stdlib.h>
#include <assert.h>
#include <errno.h>

#ifdef HAVE_MALLOC_H
#include <malloc.h>
#endif

		 /*******************************
		 *	       ATOMS		*
		 *******************************/
static atom_t
_SP_atom_nil()
{ static atom_t nil = 0;

  if ( !nil )
  { nil = SP_atom_from_string("[]");
    SP_register_atom(nil);
  }

  return nil;
}

atom_t
_SP_atom_user()
{ static atom_t user = 0;

  if ( !user )
  { user = SP_atom_from_string("user");
    SP_register_atom(user);
  }

  return user;
}

static atom_t
_SP_atom_module()
{ static atom_t module = 0;

  if ( !module )
  { module = SP_atom_from_string(":");
    SP_register_atom(module);
  }

  return module;
}

atom_t
_SP_atom_record()
{ static atom_t record = 0;

  if ( !record )
  { record = SP_atom_from_string("PL_record");
    SP_register_atom(record);
  }

  return record;
}

#define ATOM_nil    _SP_atom_nil()
#define ATOM_module _SP_atom_module()
#define ATOM_record _SP_atom_record()
#define ATOM_user   _SP_atom_user()

		 /*******************************
		 *	      FUNCTORS		*
		 *******************************/

/* - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - -
Functors are unique in SWI-Prolog and don't exist in SICStus. This layer
guarantees full emulation, but at a certain  price. Probably not too bad
if you are concerned with calling the best functions.

For example, one should use PL_is_functor() rather then PL_get_fucntor()
and compare the result.
- - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - */

#define FUNCTOR_HASHSIZE 512

static functor_t functor_table[FUNCTOR_HASHSIZE];

static int
functor_hash_key(atom_t name, int arity)
{ return (name + arity) % (FUNCTOR_HASHSIZE-1);
}


functor_t
PL_new_functor(atom_t name, int arity)
{ int k = functor_hash_key(name, arity);
  functor_t l, n;

  for( l = functor_table[k]; l; l = l->next )
  { if ( l->name == name && l->arity == arity )
      return l;
  }

  n = SP_malloc(sizeof(*n));
  n->name = name;
  n->arity = arity;
  n->next = functor_table[k];
  functor_table[k] = n;
  
  return n;
}

		 /*******************************
		 *	      BUFFERS		*
		 *******************************/

#define BUFFER_RING_SIZE 	4	/* foreign buffer ring (pl-fli.c) */

typedef struct
{ char *	base;			/* allocated base */
  char *	top;			/* pointer to top */
  char *	max;			/* current location */
  char		static_buffer[sizeof(char *)];
} buffer, *Buffer;

#define initBuffer(b)            ((b)->base = (b)->top = (b)->static_buffer, \
				  (b)->max = (b)->base + \
				  sizeof((b)->static_buffer))
#define emptyBuffer(b)           ((b)->top  = (b)->base)
#define baseBuffer(b, type)	 ((type *) (b)->base)
#define addMultipleBuffer(b, ptr, times, type) \
	do \
	{ int len = sizeof(type) * (times); \
	  if ( (b)->top + len > (b)->max ) \
	    growBuffer((Buffer)b, len); \
	  memcpy((b)->top, ptr, len); \
          (b)->top += len; \
	} while(0)

static void
outOfCore()
{ SP_fprintf(SP_stderr, "FATAL ERROR: Out of memory\n");
  exit(1);
}


void
growBuffer(Buffer b, long int minfree)
{ long osz = b->max - b->base, sz = osz;
  long top = b->top - b->base;

  while( top + minfree > sz )
    sz *= 2;

  if ( b->base != b->static_buffer )
  { b->base = SP_realloc(b->base, sz);
    if ( !b->base )
      outOfCore();
  } else
  { char *old = b->base;
    b->base = SP_malloc(sz);
    if ( !b->base )
      outOfCore();
    memcpy(b->base, old, osz);
  }

  b->top = b->base + top;
  b->max = b->base + sz;
}


static buffer	discardable_buffer;	/* PL_*() character buffers */
static buffer	buffer_ring[BUFFER_RING_SIZE];
static int	current_buffer_id;


static Buffer
findBuffer(int flags)
{ Buffer b;

  if ( flags & BUF_RING )
  { if ( ++current_buffer_id == BUFFER_RING_SIZE )
      current_buffer_id = 0;
    b = &buffer_ring[current_buffer_id];
  } else
    b = &discardable_buffer;

  if ( !b->base )
    initBuffer(b);

  emptyBuffer(b);
  return b;
}


		 /*******************************
		 *	       ANALYSIS		*
		 *******************************/

#define	DOBUF_SOMETIMES	0
#define	DOBUF_NEVER	1
#define	DOBUF_ALWAYS	2

int
PL_get_chars(term_t t, char **s, unsigned flags)
{ char tmp[100];
  char *r;
  int type;
  int dobuffer = DOBUF_SOMETIMES;

  if ( (flags & CVT_ATOM) && SP_get_string(t, &r) )
  { type = DOBUF_NEVER;
  } else if ( (flags & CVT_INTEGER) && SP_is_integer(t) )
  { long l;

    SP_get_integer(t, &l);
    sprintf(tmp, "%ld", l);
    r = tmp;
  } else if ( (flags & CVT_FLOAT) && SP_is_float(t) )
  { double d;
    
    SP_get_float(t, &d);
    sprintf(tmp, "%g", d);
    r = tmp;
  } else if ( (flags & CVT_LIST) && SP_get_list_chars(t, &r) )
  { type = DOBUF_ALWAYS;
  } else if ( (flags & CVT_VARIABLE) )
  { strcpy(tmp, "_");			/* TBD: identify them? */
    r = tmp;
  } else
    return FALSE;
    
  if ( flags & BUF_MALLOC )
  { *s = SP_malloc(strlen(r)+1);

    strcpy(*s, r);
  } else if ( ((flags & BUF_RING) && dobuffer != DOBUF_NEVER) ||
	      (dobuffer == DOBUF_ALWAYS) ||	/* always buffer strings */
	      r == tmp )			/* always buffer tmp */
  { Buffer b = findBuffer(flags);
    int l = strlen(r) + 1;

    addMultipleBuffer(b, r, l, char);
    *s = baseBuffer(b, char);
  } else
    *s = r;

  return TRUE;
}


int
PL_get_list_chars(term_t t, char **s, unsigned flags)
{ return PL_get_chars(t, s, CVT_LIST|flags);
}


/* - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - -
SWI-Prolog does not silently truncate floats to longs as SICStus does.
- - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - */

int
PL_get_long(term_t t, long *v)
{ double f;

  if ( SP_is_integer(t) )
    return SP_get_integer(t, v);

  if ( SP_get_float(t, &f) )
  { long l;

#ifdef DOUBLE_TO_LONG_CAST_RAISES_SIGFPE
    if ( !((f >= LONG_MIN) && (f <= LONG_MIN)) )
      fail;
#endif

    l = (long)f;
    if ( (double)l == f )
    { *v = l;
      return TRUE;
    }
  }

  return FALSE;
}


#ifndef INT_MIN
#define INT_MIN (int)(1<<(sizeof(int)*8-1))
#define INT_MAX (int)~(1<<(sizeof(int)*8-1))
#endif

int
PL_get_integer(term_t t, int *v)
{ long l;

  if ( PL_get_long(t, &l) &&
       l >= INT_MIN && l <= INT_MAX )
  { *v = (int)l;
    return TRUE;
  }

  return FALSE;
}


int
PL_get_functor(term_t t, functor_t *f)
{ atom_t name;
  int arity;

  if ( SP_get_functor(t, &name, &arity) )
  { *f = PL_new_functor(name, arity);
  
    return TRUE;
  }

  return FALSE;
}


int
PL_get_head(term_t l, term_t h)
{ int rval;

  term_t t = SP_new_term_ref();
  rval = SP_get_list(l, h, t);
  SP_reset_term_refs(t);
  
  return rval;
}


int
PL_get_tail(term_t l, term_t t)
{ int rval;

  term_t h = SP_new_term_ref();
  rval = SP_get_list(l, h, t);
  SP_reset_term_refs(h);
  
  return rval;
}


int
PL_get_nil(term_t l)
{ atom_t a;

  if ( SP_get_atom(l, &a) && a == ATOM_nil )
    return TRUE;

  return FALSE;
}


int
PL_get_term_value(term_t t, term_value_t *val)
{ int rval = PL_term_type(t);

  switch(rval)
  { case PL_VARIABLE:
      break;
    case PL_INTEGER:
      SP_get_integer(t, &val->i);
      break;
    case PL_FLOAT:
      SP_get_float(t, &val->f);
      break;
    case PL_ATOM:
      SP_get_atom(t, &val->a);
      break;
    case PL_TERM:
    { SP_get_functor(t, &val->t.name, &val->t.arity);
      break;
    }
    default:
      assert(0);
  }

  return rval;
}


		 /*******************************
		 *	   CONSTRUCTING		*
		 *******************************/

/* - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - -
SICStus says: top 4-bit should share with malloc(), bottom 2-bit should be
zero.
- - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - */

void
PL_put_pointer(term_t t, void *ptr)
{ static unsigned long maddr = 0L;
  static unsigned long mask;

  if ( !maddr )
  { mask = (0xf << (sizeof(void *)*8-4)) | 0x3;
    maddr = (unsigned long)SP_malloc(sizeof(int)) & mask;
  }

  assert(((unsigned long)ptr & mask) == maddr);

  SP_put_address(t, ptr);
}


/* - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - -
If it doesn't prove  necessary,  we   don't  want  to add initialisation
functions.
- - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - */

void
PL_put_nil(term_t in)
{ SP_put_atom(in, ATOM_nil);
}


/* - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - -
Note: these functions should assing to the result *after* reading the
term-arguments to allow for:

	PL_cons_functor(t, PL_new_functor(PL_new_atom("@"), 1), t)
- - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - */

void
PL_cons_functor(term_t t, functor_t f, ...)
{ if ( f->arity == 0 )
    SP_put_atom(t, f->name);
  else
  { va_list args;
    int i;
    term_t a = SP_new_term_ref();
    term_t r = SP_new_term_ref();

    va_start(args, f);
    SP_put_functor(r, f->name, f->arity);
    for(i=0; i<f->arity; i++)
    { term_t next = va_arg(args, term_t);

      SP_get_arg(i+1, r, a);
      SP_unify(a, next);
    }
    SP_put_term(t, r);
    SP_reset_term_refs(a);
    va_end(args);
  }
}


void
PL_cons_functor_v(term_t t, functor_t f, term_t a0)
{ if ( f->arity == 0 )
    SP_put_atom(t, f->name);
  else
  { int i;
    term_t a = SP_new_term_ref();
    term_t r = SP_new_term_ref();

    SP_put_functor(r, f->name, f->arity);
    for(i=0; i<f->arity; i++)
    { SP_get_arg(i+1, r, a);
      SP_unify(a, a0+i);
    }
    SP_put_term(t, r);
    SP_reset_term_refs(a);
    va_end(args);
  }
}


		 /*******************************
		 *	      UNIFYING		*
		 *******************************/

int
PL_unify_atom(term_t t, atom_t a)
{ term_t tmp = SP_new_term_ref();
  int rval;

  SP_put_atom(tmp, a);
  rval = SP_unify(t, tmp);
  SP_reset_term_refs(tmp);

  return rval;
}


int
PL_unify_atom_chars(term_t t, const char *chars)
{ term_t tmp = SP_new_term_ref();
  int rval;

  SP_put_string(tmp, (char *)chars);
  rval = SP_unify(t, tmp);
  SP_reset_term_refs(tmp);

  return rval;
}


int
PL_unify_list_chars(term_t t, const char *chars)
{ term_t tmp = SP_new_term_ref();
  term_t tail = SP_new_term_ref();
  int rval;

  SP_put_atom(tail, ATOM_nil);
  SP_put_list_chars(tmp, tail, (char *)chars);
  rval = SP_unify(t, tmp);
  SP_reset_term_refs(tmp);

  return rval;
}


int
PL_unify_integer(term_t t, long i)
{ term_t tmp = SP_new_term_ref();
  int rval;

  SP_put_integer(tmp, i);
  rval = SP_unify(t, tmp);
  SP_reset_term_refs(tmp);

  return rval;
}


int
PL_unify_float(term_t t, double i)
{ term_t tmp = SP_new_term_ref();
  int rval;

  SP_put_float(tmp, i);
  rval = SP_unify(t, tmp);
  SP_reset_term_refs(tmp);

  return rval;
}


int
PL_unify_functor(term_t t, functor_t f)
{ term_t tmp = SP_new_term_ref();
  int rval;

  SP_put_functor(tmp, f->name, f->arity);
  rval = SP_unify(t, tmp);
  SP_reset_term_refs(tmp);

  return rval;
}


int
PL_unify_pointer(term_t t, void *ptr)
{ term_t tmp = SP_new_term_ref();
  int rval;

  PL_put_pointer(tmp, ptr);
  rval = SP_unify(t, tmp);
  SP_reset_term_refs(tmp);

  return rval;
}

/* PL_unify_list(+l, -h, -t) */

int
PL_unify_list(term_t l, term_t h, term_t t)
{ if ( SP_is_variable(l) )
  { term_t tmp = SP_new_term_ref();
  
    SP_put_list(tmp);
    SP_unify(l, tmp);

    SP_reset_term_refs(tmp);
  }

  return SP_get_list(l, h, t) ? TRUE : FALSE;
}


int
PL_unify_nil(term_t t)
{ term_t tmp = SP_new_term_ref();
  int rval;

  SP_put_atom(tmp, ATOM_nil);
  rval = SP_unify(t, tmp);
  SP_reset_term_refs(tmp);

  return rval;
}


int
PL_unify_arg(int index, term_t t, term_t a)
{ term_t tmp = SP_new_term_ref();
  int rval;

  if ( SP_get_arg(index, t, tmp) && SP_unify(tmp, a) )
    rval = TRUE;
  else
    rval = FALSE;

  SP_reset_term_refs(tmp);

  return rval;
}


/* - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - -
PL_unify_term(term_t t, ...)
	Unify a term with a term-description.  Thi is taken directly from
	the SWI-Prolog native implementation.  This function is there to
	allow for short and readable source-code, not for speed.
- - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - */

typedef struct va_list_rec {
  va_list v;
} va_list_rec;

#define args argsRec.v

static int
unify_termVP(term_t t, va_list_rec *argsRecP)
{ va_list_rec argsRec = *argsRecP;
  int rval;

  switch(va_arg(args, int))
  { case PL_VARIABLE:
      rval = TRUE;
      break;
    case PL_ATOM:
      rval = PL_unify_atom(t, va_arg(args, atom_t));
      break;
    case PL_INTEGER:
      rval = PL_unify_integer(t, va_arg(args, long));
      break;
    case PL_POINTER:
      rval = PL_unify_pointer(t, va_arg(args, void *));
      break;
    case PL_FLOAT:
      rval = PL_unify_float(t, va_arg(args, double));
      break;
    case PL_TERM:
      rval = PL_unify(t, va_arg(args, term_t));
      break;
    case PL_CHARS:
      rval = PL_unify_atom_chars(t, va_arg(args, const char *));
      break;
    case PL_FUNCTOR:
    { functor_t ft = va_arg(args, functor_t);
      int arity = ft->arity;
      term_t tmp = PL_new_term_ref();
      int n;

      if ( !PL_unify_functor(t, ft) )
	goto failout;

      for(n=1; n<=arity; n++)
      {	_PL_get_arg(n, t, tmp);
	
	rval = unify_termVP(tmp, &argsRec);
	if ( !rval )
	  goto failout;
      }

      rval = TRUE;
      PL_reset_term_refs(tmp);
      break;
    failout:
      rval = FALSE;
      PL_reset_term_refs(tmp);
      break;
    }
    case PL_LIST:
    { int length = va_arg(args, int);
      term_t tmp = PL_copy_term_ref(t);
      term_t h   = PL_new_term_ref();

      for( ; length-- > 0; )
      { PL_unify_list(tmp, h, tmp);
	rval = unify_termVP(h, &argsRec);
	if ( !rval )
	  goto listfailout;
      }

      rval = PL_unify_nil(tmp);
      PL_reset_term_refs(tmp);
      break;
    listfailout:
      PL_reset_term_refs(tmp);
      break;
    }
    default:
      PL_warning("Format error in PL_unify_term()");
      rval = FALSE;
  }

  *argsRecP = argsRec;
  return rval;
}

int
PL_unify_term(term_t t, ...)
{
  va_list_rec argsRec;
  int rval;

  va_start(args, t);
  rval = unify_termVP(t, &argsRec);
  va_end(args);

  return rval;
}

#undef args


		 /*******************************
		 *	       MODULES		*
		 *******************************/

int
PL_strip_module(term_t raw, module_t *m, term_t plain)
{ term_t a = SP_new_term_ref();
  atom_t name;
  int arity;

  SP_put_term(plain, raw);
  while( SP_get_functor(plain, &name, &arity) &&
	 name == ATOM_module && arity == 2 )
  { SP_get_arg(1, plain, a);

    if ( SP_get_atom(a, &name) )
    { *m = name;
      SP_get_arg(2, plain, plain);
    } else
      break;
  }

  return TRUE;
}


		 /*******************************
		 *	     PREDICATES		*
		 *******************************/

#define PREDICATE_HASHSIZE 512

static predicate_t predicate_table[PREDICATE_HASHSIZE];

static int
predicate_hash_key(atom_t name, int arity, module_t module)
{ unsigned int k = arity;

  k ^= name;
  k ^= module;

  return k % (FUNCTOR_HASHSIZE-1);
}


static predicate_t
PL_pred3(atom_t name, int arity, module_t module)
{ int k = predicate_hash_key(name, arity, module);
  predicate_t l, n;

  for( l = predicate_table[k]; l; l = l->next )
  { if ( l->name == name && l->arity == arity && l->module == module )
      return l;
  }

  n = SP_malloc(sizeof(*n));
  n->name = name;
  n->arity = arity;
  n->module = module;
  n->predicate = SP_pred(name, arity, module);
  n->next = predicate_table[k];
  predicate_table[k] = n;
  
  return n;
}


predicate_t
PL_pred(functor_t f, module_t m)
{ return PL_pred3(f->name, f->arity, m);
}


predicate_t
PL_predicate(const char *name, int arity, const char *module)
{ return PL_pred3(SP_atom_from_string((char *)name), arity,
		  PL_new_module(SP_atom_from_string((char *)module)));
}


void
PL_predicate_info(predicate_t p, atom_t *n, int *a, module_t *m)
{ *n = p->name;
  *a = p->arity;
  *m = p->module;
}


		 /*******************************
		 *	     CALLING		*
		 *******************************/

qid_t
PL_open_query(module_t ctx, int flags, predicate_t p, term_t t0)
{ qid_t qid = SP_malloc(sizeof(*qid));
  qid->flags = flags;

  if ( !p->predicate )
  { if ( !(p->predicate = SP_pred(p->name, p->arity, p->module)) )
    { PL_warning("Undefined predicate: %s:%s/%d",
		 PL_atom_chars(p->module),
		 PL_atom_chars(p->name),
		 p->arity);
      qid->flags |= _PL_Q_UNDEFINED_PRED;
					/* TBD: raise exception */
      return qid;
    }
  }

#if 0
  switch(p->arity)
  { case 0:
      qid->query = SP_open_query(p->predicate);
      return qid;
    case 1:
      qid->query = SP_open_query(p->predicate, t0);
      return qid;
  }
#endif

  { SP_term_ref *args = alloca(p->arity * sizeof(SP_term_ref));
    int i;

    for(i=0; i<p->arity; i++)
      args[i] = t0+i;

    qid->query = SP_open_query_array(p->predicate, args);

    return qid;
  }
}


void
PL_cut_query(qid_t qid)
{ SP_cut_query(qid->query);

  if ( qid->flags & _PL_Q_PENDING_EXCEPTION &&
       qid->flags & PL_Q_PASS_EXCEPTION )
  { term_t t = PL_new_term_ref();
    SP_exception_term(t);

    SP_free(qid);
    SP_raise_exception(t);
  } else
    SP_free(qid);
}


void
PL_close_query(qid_t qid)
{ SP_close_query(qid->query);

  if ( qid->flags & _PL_Q_PENDING_EXCEPTION &&
       qid->flags & PL_Q_PASS_EXCEPTION )
  { term_t t = PL_new_term_ref();
    SP_exception_term(t);

    SP_free(qid);
    SP_raise_exception(t);
  } else
    SP_free(qid);
}


int
PL_next_solution(qid_t qid)
{ if ( qid->flags & _PL_Q_UNDEFINED_PRED )
    return FALSE;

  switch(SP_next_solution(qid->query))
  { case SP_SUCCESS:
      return TRUE;
    case SP_FAILURE:
      return FALSE;
    case SP_ERROR:
      qid->flags |= _PL_Q_PENDING_EXCEPTION;
      return FALSE;
    default:
      assert(0);
  }
}


term_t
PL_exception(qid_t qid)
{ if ( qid->flags & _PL_Q_PENDING_EXCEPTION )
  { term_t t = PL_new_term_ref();
    SP_exception_term(t);
    return t;
  }

  return 0;
}


int
PL_call(term_t goal, module_t context)
{ SP_pred_ref call = 0;

  if ( !call )
    call = SP_predicate("call", 1, "user");

  switch(SP_query(call, goal))
  { case SP_SUCCESS:
      return TRUE;
    case SP_FAILURE:
    case SP_ERROR:
      return FALSE;
    default:
      assert(0);
  }
}


/* - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - -
This could be optimised a bit to avoid the malloc/free.
- - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - */

int
PL_call_predicate(module_t ctx, int flags, predicate_t pred, term_t h0)
{ int rval;

  qid_t qid = PL_open_query(ctx, flags, pred, h0);
  rval = PL_next_solution(qid);
  PL_cut_query(qid);

  return rval;
}


		 /*******************************
		 *	      RECORDS  		*
		 *******************************/

static long current_key = 0;

record_t
PL_record(term_t t)
{ static SP_pred_ref bbput = 0;
  SP_term_ref k = SP_new_term_ref();
  SP_term_ref m = SP_new_term_ref();

  if ( !bbput )
    bbput = SP_predicate("bb_put", 2, "user");

  current_key += 2;			/* XPCE assumes low-order bit 0 */
  SP_put_integer(k, current_key);
  SP_put_atom(m, ATOM_record);
  SP_cons_functor(k, ATOM_module, 2, m, k);
  SP_query(bbput, k, t);

  return (record_t)current_key;
}


void
PL_recorded(record_t record, term_t t)
{ static SP_pred_ref bbget = 0;
  SP_term_ref k = SP_new_term_ref();
  SP_term_ref m = SP_new_term_ref();

  if ( !bbget )
    bbget = SP_predicate("bb_get", 2, "user");
  
  SP_put_integer(k, (long)record);
  SP_put_atom(m, ATOM_record);
  SP_cons_functor(k, ATOM_module, 2, m, k);
  SP_query(bbget, k, t);
}


void
PL_erase(record_t record)
{ static SP_pred_ref bbdel = 0;
  SP_term_ref k = SP_new_term_ref();
  SP_term_ref t = SP_new_term_ref();
  SP_term_ref m = SP_new_term_ref();

  if ( !bbdel )
    bbdel = SP_predicate("bb_delete", 2, "user");
  
  SP_put_variable(t);
  SP_put_integer(k, (long)record);
  SP_put_atom(m, ATOM_record);
  SP_cons_functor(k, ATOM_module, 2, m, k);

  SP_query(bbdel, k, t);
}

		 /*******************************
		 *	     STREAMS		*
		 *******************************/

static int
dummy_close(void *handle)
{ return 0;
}


static int
open_stream(term_t t, IOSTREAM *s, SP_stream **spstream)
{ SP_term_ref scode = SP_new_term_ref();
  static SP_pred_ref stream_code;

  if ( s->flags & SIO_INPUT )
  { SP_make_stream(s,
		   Sfgetc,
		   NULL,
		   NULL,
		   Sfeof,
		   Sclearerr,
		   Sclose,
		   spstream);
  } else
  { SP_make_stream(s,
		   NULL,
		   Sputc,
		   Sflush,
		   Sfeof,
		   Sclearerr,
		   Sclose,
		   spstream);
  }

  SP_put_address(scode, *spstream);
  if ( !stream_code )
    stream_code = SP_predicate("stream_code", 2, "user");
  
  switch(SP_query(stream_code, t, scode))
  { case SP_SUCCESS:
      return TRUE;
    default:
      assert(0);
      return FALSE;
  }
}


int
PL_open_stream(term_t t, IOSTREAM *s)
{ SP_stream *spstream;

  return open_stream(t, s, &spstream);
}


int
PL_get_stream_handle(term_t t, IOSTREAM **s)
{ PL_warning("PL_get_stream_handle(): Not yet implemented");

  return FALSE;
}


		 /*******************************
		 *	       WRITE		*
		 *******************************/

/* - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - -
Complicated, but complete except for the   context  precedence, which is
ignored. 
- - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - */

#define FUNCT(n, a) PL_new_functor(PL_new_atom(n), a)

int
PL_write_term(IOSTREAM *s,
	      term_t term,
	      int precedence,
	      int flags)
{ term_t stream = PL_new_term_ref();
  term_t options = PL_new_term_ref();
  term_t optlist = PL_copy_term_ref(options);
  term_t opt     = PL_new_term_ref();
  static SP_pred_ref write_term, close;
  SP_stream *spstream;

  if ( flags & PL_WRT_QUOTED )
  { PL_unify_term(opt,
		  PL_FUNCTOR, FUNCT("quoted", 1),
		    PL_CHARS, "true");
    PL_unify_list(optlist, opt, optlist);
    PL_put_variable(opt);
  }
  if ( flags & PL_WRT_IGNOREOPS )
  { PL_unify_term(opt,
		  PL_FUNCTOR, FUNCT("ignore_ops", 1),
		    PL_CHARS, "true");
    PL_unify_list(optlist, opt, optlist);
    PL_put_variable(opt);
  }
  if ( flags & PL_WRT_NUMBERVARS )
  { PL_unify_term(opt,
		  PL_FUNCTOR, FUNCT("numbervars", 1),
		    PL_CHARS, "true");
    PL_unify_list(optlist, opt, optlist);
    PL_put_variable(opt);
  }
  if ( flags & PL_WRT_PORTRAY )
  { PL_unify_term(opt,
		  PL_FUNCTOR, FUNCT("portrayed", 1),
		    PL_CHARS, "true");
    PL_unify_list(optlist, opt, optlist);
  }
  PL_unify_nil(optlist);

  if ( !write_term )
    write_term = SP_predicate("write_term", 3, "user");
  if ( !close )
    close = SP_predicate("close", 1, "user");

  open_stream(stream, s, &spstream);
  spstream->sclose = dummy_close;
  SP_query(write_term, stream, term, options);
  SP_query(close, stream);
  SP_reset_term_refs(stream);

  return TRUE;
}


		 /*******************************
		 *	    RESOURCES		*
		 *******************************/

IOSTREAM *
PL_open_resource(module_t m,
		 const char *name,
		 const char *rc_class,
		 const char *mode)
{ static SP_pred_ref locate = NULL;
  term_t a1 = SP_new_term_ref();
  term_t a2 = SP_new_term_ref();
  term_t a3 = SP_new_term_ref();
  term_t a4 = SP_new_term_ref();
  term_t a5 = SP_new_term_ref();

  if ( !locate )
  { if ( !(locate = SP_predicate("locate_resource", 5, "swi_")) )
    { PL_warning("Cannot find pce_host:locate_resource/4");
      return NULL;
    }
  }

  if ( m )
    SP_put_atom(a1, m);
  else
    SP_put_atom(a1, ATOM_user);
  SP_put_string(a2, (char *)name);
  if ( rc_class )
    SP_put_string(a3, (char *)rc_class);
  else
    SP_put_variable(a3);
  SP_put_string(a4, (char *)mode);
  SP_put_variable(a5);

  if ( SP_query(locate, a1, a2, a3, a4, a5) )
  { char *fname;

    if ( SP_get_string(a5, &fname) )
      return Sopen_file(fname, mode);
  }

  errno = ENOENT;

  return NULL;
}

		 /*******************************
		 *	TOPLEVEL CONTROL	*
		 *******************************/

typedef void (*halt_function)(int, void *);
typedef struct on_halt *OnHalt;

struct on_halt
{ halt_function	function;
  void *	argument;
  OnHalt	next;
};

static int halting = FALSE;
static OnHalt on_halt_list = NULL;

void
PL_on_halt(halt_function f, void *arg)
{ if ( !halting )
  { OnHalt h = SP_malloc(sizeof(struct on_halt));

    h->function = f;
    h->argument = arg;
    h->next = on_halt_list;
    on_halt_list = h;
  }
}


void
PL_deinit(int exitcode)
{ if ( !halting )
  { OnHalt h;

    halting = TRUE;

    for(h = on_halt_list; h; h = h->next)
      (*h->function)(exitcode, h->argument);
  }
}


int
PL_action(int action, ...)
{ int rval = TRUE;
  va_list args;

  va_start(args, action);

  switch(action)
  { case PL_ACTION_TRACE:
      SP_action(SP_ACTION_TRACE, 0);
      break;
    case PL_ACTION_DEBUG:
      SP_action(SP_ACTION_DEBUG, 0);
      break;
    case PL_ACTION_HALT:
    { int a = va_arg(args, int);

      PL_deinit(a);
      SP_action(SP_ACTION_HALT, 0);
      rval = FALSE;			/* appearently, we failed */
      break;
    }
    case PL_ACTION_ABORT:
      SP_action(SP_ACTION_ABORT, 0);
      break;
    case PL_ACTION_BREAK:
    { SP_pred_ref brk = SP_predicate("break", 0, "user");

      SP_query(brk);
      break;
    }
    case PL_ACTION_WRITE:
    { char *s = va_arg(args, char *);

      SP_puts(s);
      break;
    }
    case PL_ACTION_FLUSH:
    { SP_fflush(SP_curout);
      break;
    }
    case PL_ACTION_BACKTRACE:
    case PL_ACTION_SYMBOLFILE:
    case PL_ACTION_GUIAPP:
      PL_warning("PL_action(%d): Unkown action", action);
      rval = FALSE;
  }

  va_end(args);

  return rval;
}


#ifndef LONG_MIN
#define LONG_MIN (int)(1<<(sizeof(long)*8-1))
#define LONG_MAX (int)~(1<<(sizeof(long)*8-1))
#endif


long
PL_query(int query)
{ switch(query)
  { case PL_QUERY_ARGC:
      return 0;
    case PL_QUERY_ARGV:
      return 0;
    case PL_QUERY_SYMBOLFILE:
    case PL_QUERY_ORGSYMBOLFILE:
      return 0L;
    case PL_QUERY_GETC:
      return SP_getc();
    case PL_QUERY_MAX_INTEGER:
    case PL_QUERY_MAX_TAGGED_INT:	/* Is there a difference? */
      return LONG_MAX;
    case PL_QUERY_MIN_INTEGER:
    case PL_QUERY_MIN_TAGGED_INT:
      return LONG_MIN;
    case PL_QUERY_VERSION:
      return 30701;			/* 3.7.1 (how to get it?) */
    default:
      PL_warning("PL_query(%d): Unkown query", query);
  }

  return -1;
}

		 /*******************************
		 *	       HOOKS		*
		 *******************************/

typedef int (*SP_getc_t)(void *handle);

static PL_dispatch_hook_t dispatch_events;
static SP_ReadHookProc *org_read_hook;

int
PL_dispatch(int fd, int wait)
{ int rval;

  if ( wait == PL_DISPATCH_INSTALLED )
    return dispatch_events ? TRUE : FALSE;

  if ( dispatch_events )
  { do
    { rval = (*dispatch_events)(fd);
    } while( wait == PL_DISPATCH_WAIT && rval == PL_DISPATCH_TIMEOUT );
  } else
    rval = PL_DISPATCH_INPUT;

  return rval;
}


static int
SP_dispatch(int fd)
{ if ( PL_dispatch(fd, PL_DISPATCH_WAIT) == PL_DISPATCH_INPUT )
    return 1;

  return 0;
}


PL_dispatch_hook_t
PL_dispatch_hook(PL_dispatch_hook_t hook)
{ PL_dispatch_hook_t old = dispatch_events;

  if ( hook )
  { org_read_hook = SP_set_read_hook(SP_dispatch);
  } else
  { SP_set_read_hook(org_read_hook);
  }

  dispatch_events = hook;
  return old;
}


		 /*******************************
		 *	      ABORTS		*
		 *******************************/

typedef struct abort_handle *AbortHandle;

struct abort_handle
{ AbortHandle	  next;			/* Next handle */
  PL_abort_hook_t function;		/* The handle itself */
};

static AbortHandle abort_head;
static AbortHandle abort_tail;

void
PL_abort_hook(PL_abort_hook_t func)
{ AbortHandle h = (AbortHandle) SP_malloc(sizeof(struct abort_handle));
  h->next = NULL;
  h->function = func;

  if ( abort_head == NULL )
  { abort_head = abort_tail = h;
  } else
  { abort_tail->next = h;
    abort_tail = h;
  }
}


int
PL_abort_unhook(PL_abort_hook_t func)
{ AbortHandle h = abort_head;

  for(; h; h = h->next)
  { if ( h->function == func )
    { h->function = NULL;
      return TRUE;
    }
  }

  return FALSE;
}


void
PL_call_abort_handlers()
{ AbortHandle h = abort_head;

  for(; h; h = h->next)
  { if ( h->function )
    { (*h->function)();
    }
  }
}


		 /*******************************
		 *            MISC		*
		 *******************************/

/* - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - -
Should use SP_vfprintf, but this doesn't exists!
- - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - */

int
PL_warning(const char *fmt, ...)
{ char msg[2048];
  va_list args;

  va_start(args, fmt);
  vsprintf(msg, fmt, args);
  va_end(args);

  SP_fprintf(SP_stderr, "[WARNING: %s]\n", msg);

  return FALSE;
}

/* - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - -
Hack to deal with the stat functions when compiled without -O for gcc and
glibc 2.0.7.  Delete if problems arise!
- - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - */

#ifdef __linux__
#include <sys/stat.h>
int stat (__const char *__path, struct stat *__statbuf)
{ return __xstat (_STAT_VER, __path, __statbuf);
}

int fstat (int __fd, struct stat *__statbuf)
{ return __fxstat (_STAT_VER, __fd, __statbuf);
}
#endif