-
Notifications
You must be signed in to change notification settings - Fork 5
/
plregtry.c
735 lines (607 loc) · 19 KB
/
plregtry.c
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
/* Part of SWI-Prolog
Author: Jan Wielemaker
E-mail: [email protected]
WWW: http://www.swi-prolog.org
Copyright (c) 2011-2015, University of Amsterdam
VU University Amsterdam
All rights reserved.
Redistribution and use in source and binary forms, with or without
modification, are permitted provided that the following conditions
are met:
1. Redistributions of source code must retain the above copyright
notice, this list of conditions and the following disclaimer.
2. Redistributions in binary form must reproduce the above copyright
notice, this list of conditions and the following disclaimer in
the documentation and/or other materials provided with the
distribution.
THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
"AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS
FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE
COPYRIGHT OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT,
INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING,
BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;
LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER
CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN
ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
POSSIBILITY OF SUCH DAMAGE.
*/
#include <SWI-Prolog.h>
#include <windows.h>
#include <shlobj.h>
#include <malloc.h>
#include <assert.h>
#include <limits.h>
/* - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - -
This file serves two purposes. It both provides a reasonable set of
examples for using the SWI-Prolog foreign (C) interface, and it provides
access to the Win32 registry database. The library(registry) uses this
file to register .PL files as Prolog SourceFiles and allow you for
consulting and editing Prolog files immediately from the Windows 95
explorer.
- - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - */
/* - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - -
These atoms and functors (handles to a name/arity identifier are used
throughout the code. We look them up at initialisation and store them in
global variables. Though this module isn't very time critical, in
general it provides an enormous speedup to avoid excessive lookup of
atoms and functors.
- - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - */
static atom_t ATOM_classes_root;
static atom_t ATOM_current_user;
static atom_t ATOM_local_machine;
static atom_t ATOM_users;
static atom_t ATOM_all_access;
static atom_t ATOM_create_link;
static atom_t ATOM_create_sub_key;
static atom_t ATOM_enumerate_sub_keys;
static atom_t ATOM_execute;
static atom_t ATOM_notify;
static atom_t ATOM_query_value;
static atom_t ATOM_read;
static atom_t ATOM_set_value;
static atom_t ATOM_write;
static atom_t ATOM_volatile;
static functor_t FUNCTOR_binary1;
static functor_t FUNCTOR_link1;
static functor_t FUNCTOR_expand1;
static void
init_constants()
{ ATOM_classes_root = PL_new_atom("classes_root");
ATOM_current_user = PL_new_atom("current_user");
ATOM_local_machine = PL_new_atom("local_machine");
ATOM_users = PL_new_atom("users");
ATOM_all_access = PL_new_atom("all_access");
ATOM_create_link = PL_new_atom("create_link");
ATOM_create_sub_key = PL_new_atom("create_sub_key");
ATOM_enumerate_sub_keys = PL_new_atom("enumerate_sub_keys");
ATOM_execute = PL_new_atom("execute");
ATOM_notify = PL_new_atom("notify");
ATOM_query_value = PL_new_atom("query_value");
ATOM_read = PL_new_atom("read");
ATOM_set_value = PL_new_atom("set_value");
ATOM_write = PL_new_atom("write");
ATOM_volatile = PL_new_atom("volatile");
FUNCTOR_binary1 = PL_new_functor(PL_new_atom("binary"), 1);
FUNCTOR_link1 = PL_new_functor(PL_new_atom("link"), 1);
FUNCTOR_expand1 = PL_new_functor(PL_new_atom("expand"), 1);
}
/* - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - -
Just a function to translate a Windows error code to a message. It
exploits the static nature of Prolog atoms to avoid storing multiple
copies of the same message.
- - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - */
static const char *
APIError(DWORD id)
{ char *msg;
static WORD lang;
static int lang_initialised = 0;
if ( !lang_initialised )
lang = MAKELANGID(LANG_ENGLISH, SUBLANG_ENGLISH_UK);
again:
if ( FormatMessage(FORMAT_MESSAGE_ALLOCATE_BUFFER|
FORMAT_MESSAGE_IGNORE_INSERTS|
FORMAT_MESSAGE_FROM_SYSTEM,
NULL, /* source */
id, /* identifier */
lang,
(LPTSTR) &msg,
0, /* size */
NULL) ) /* arguments */
{ atom_t a = PL_new_atom(msg);
LocalFree(msg);
lang_initialised = 1;
return PL_atom_chars(a);
} else
{ if ( lang_initialised == 0 )
{ lang = MAKELANGID(LANG_NEUTRAL, SUBLANG_DEFAULT);
lang_initialised = 1;
goto again;
}
return "Unknown Windows error";
}
}
/* - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - -
- - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - */
#define CompoundArg(name, arity) \
PL_FUNCTOR, PL_new_functor(PL_new_atom(name), (arity))
#define AtomArg(name) \
PL_CHARS, name
#define IntArg(i) \
PL_INTEGER, (i)
#define TermArg(t) \
PL_TERM, (t)
#include <winerror.h>
static int
api_exception(DWORD err, const char *action, term_t key)
{ term_t except = PL_new_term_ref();
term_t formal = PL_new_term_ref();
term_t swi = PL_new_term_ref();
const char *msg = NULL;
int rc;
switch(err)
{ case ERROR_ACCESS_DENIED:
{ rc = PL_unify_term(formal,
CompoundArg("permission_error", 3),
AtomArg(action),
AtomArg("key"),
TermArg(key));
break;
}
default:
rc = PL_unify_atom_chars(formal, "system_error");
msg = APIError(err);
break;
}
if ( rc && msg )
{ term_t msgterm = PL_new_term_ref();
if ( msg )
{ PL_put_atom_chars(msgterm, msg);
}
rc = PL_unify_term(swi,
CompoundArg("context", 2),
PL_VARIABLE,
PL_TERM, msgterm);
}
if ( rc )
{ rc = PL_unify_term(except,
CompoundArg("error", 2),
PL_TERM, formal,
PL_TERM, swi);
}
if ( rc )
return PL_raise_exception(except);
return rc;
}
/* - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - -
Translate a term, that is either an atom, indicating one of the
predefined roots of the registry, or an integer that is an open registry
handle. Integers are 32-bit wide, so it is generally ok to store handles
in Prolog integers. Note however that Prolog integers above
max_tagged_integer require considerably more space.
- - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - */
static HKEY
to_key(term_t h)
{ atom_t n;
int k;
if ( PL_get_atom(h, &n) ) /* named key */
{ if ( n == ATOM_classes_root )
return HKEY_CLASSES_ROOT;
if ( n == ATOM_current_user )
return HKEY_CURRENT_USER;
if ( n == ATOM_local_machine )
return HKEY_LOCAL_MACHINE;
if ( n == ATOM_users )
return HKEY_USERS;
}
if ( PL_get_integer(h, &k) )
return (HKEY)(intptr_t)k; /* integer key */
return 0; /* invalid key */
}
/* - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - -
reg_subkeys(+Super, -Subs)
Return list of keys below Super. The list of keys is of the
form key(KeyName, KeyClass).
****
This predicate illustrates returning a list of atoms. First, the
argument reference is copied into the `tail' reference. This is not
strictly necessary, but if you don't do this, the tracer will always
think this predicate succeeded with the empty list. `head' is just a new
term reference, used for handling the various cells.
- - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - */
foreign_t
pl_reg_subkeys(term_t h, term_t l)
{ HKEY k = to_key(h);
int i;
term_t tail = PL_copy_term_ref(l);
term_t head = PL_new_term_ref();
if ( !k )
PL_fail;
for(i=0;;i++)
{ long rval;
char kname[256];
size_t sk = sizeof(kname);
char cname[256];
size_t sc = sizeof(cname);
FILETIME t;
rval = RegEnumKeyEx(k, i, kname, (LPDWORD)&sk, NULL, cname, (LPDWORD)&sc, &t);
if ( rval == ERROR_SUCCESS )
{ if ( PL_unify_list(tail, head, tail) &&
PL_unify_atom_chars(head, kname) )
continue;
else
PL_fail; /* close key? */
} else if ( rval == ERROR_NO_MORE_ITEMS )
{ return PL_unify_nil(tail);
} else
{ return api_exception(rval, "enum_subkeys", h);
}
}
}
/* - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - -
Maybe better in a table ...
- - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - */
static REGSAM
access_code(atom_t name)
{ if ( name == ATOM_all_access )
return KEY_ALL_ACCESS;
if ( name == ATOM_create_link )
return KEY_CREATE_LINK;
if ( name == ATOM_create_sub_key )
return KEY_CREATE_SUB_KEY;
if ( name == ATOM_enumerate_sub_keys )
return KEY_ENUMERATE_SUB_KEYS;
if ( name == ATOM_execute )
return KEY_EXECUTE;
if ( name == ATOM_notify )
return KEY_NOTIFY;
if ( name == ATOM_query_value )
return KEY_QUERY_VALUE;
if ( name == ATOM_read )
return KEY_READ;
if ( name == ATOM_set_value )
return KEY_SET_VALUE;
if ( name == ATOM_write )
return KEY_WRITE;
return 0; /* bad key */
}
/* - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - -
Read a list. Instead of PL_unify_list(), this uses PL_get_list(), which
fails if the argument is not instantiated to a list.
- - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - */
static int
get_access(term_t access, REGSAM *mode)
{ atom_t a;
if ( PL_get_atom(access, &a) )
*mode = access_code(a);
else
{ term_t tail = PL_copy_term_ref(access);
term_t head = PL_new_term_ref();
*mode = 0;
while(PL_get_list(tail, head, tail))
{ if ( PL_get_atom(head, &a) )
*mode |= access_code(a);
else
return FALSE;
}
if ( !PL_get_nil(tail) )
return FALSE;
}
return TRUE;
}
foreign_t
pl_reg_open_key(term_t parent, term_t name, term_t access, term_t handle)
{ HKEY kp;
char *s;
REGSAM mode;
HKEY rk;
long rval;
if ( !(kp = to_key(parent)) ||
!PL_get_atom_chars(name, &s) ||
!get_access(access, &mode) )
PL_fail;
rval = RegOpenKeyEx(kp, s, 0L, mode, &rk);
if ( rval == ERROR_SUCCESS )
return PL_unify_integer(handle, (int)(intptr_t)rk);
if ( rval == ERROR_FILE_NOT_FOUND )
PL_fail;
return api_exception(rval, "open", name);
}
foreign_t
pl_reg_close_key(term_t h)
{ HKEY k;
if ( PL_is_integer(h) && (k = to_key(h)) )
{ RegCloseKey(k);
}
PL_succeed;
}
/* - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - -
reg_delete_key(+ParentHandle, +Name)
Delete key from parent.
- - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - */
foreign_t
pl_reg_delete_key(term_t h, term_t sub)
{ HKEY k;
char *s;
DWORD rval;
if ( !(k = to_key(h)) ||
!PL_get_atom_chars(sub, &s) )
PL_fail;
if ( (rval = RegDeleteKey(k, s)) == ERROR_SUCCESS )
PL_succeed;
return api_exception(rval, "delete", sub);
}
/*******************************
* VALUE *
*******************************/
foreign_t
pl_reg_value_names(term_t h, term_t names)
{ HKEY k;
DWORD rval;
term_t tail = PL_copy_term_ref(names);
term_t head = PL_new_term_ref();
DWORD i;
if ( !(k = to_key(h)) )
PL_fail;
for(i=0;;i++)
{ char name[256];
DWORD sizen = sizeof(name);
rval = RegEnumValue(k, i, name, &sizen, NULL, NULL, NULL, NULL);
if ( rval == ERROR_SUCCESS )
{ if ( PL_unify_list(tail, head, tail) &&
PL_unify_atom_chars(head, name) )
continue;
} else if ( rval == ERROR_NO_MORE_ITEMS )
{ return PL_unify_nil(tail);
} else
return api_exception(rval, "names", h);
}
}
foreign_t
pl_reg_value(term_t h, term_t name, term_t value)
{ HKEY k;
char *vname;
DWORD rval;
BYTE databuf[1024];
LPBYTE data = databuf;
DWORD sizedata = sizeof(databuf);
DWORD type;
if ( !(k = to_key(h)) || !PL_get_atom_chars(name, &vname) )
PL_fail;
rval = RegQueryValueEx(k, vname, NULL, &type, data, &sizedata);
if ( rval == ERROR_MORE_DATA )
{ data = alloca(sizedata);
rval = RegQueryValueEx(k, vname, NULL, &type, data, &sizedata);
}
if ( rval == ERROR_SUCCESS )
{ switch(type)
{ case REG_BINARY:
{ term_t head = PL_new_term_ref();
term_t tail = PL_new_term_ref();
if ( PL_unify_term(value, PL_FUNCTOR, FUNCTOR_binary1,
PL_TERM, tail) )
{ DWORD i;
for(i=0; i<sizedata; i++)
{ if ( !PL_unify_list(tail, head, tail) ||
!PL_unify_integer(head, data[i]) )
PL_fail;
}
return PL_unify_nil(tail);
}
PL_fail;
}
{ DWORD v;
case REG_DWORD_BIG_ENDIAN:
{ DWORD v0 = *((DWORD *)data);
v = ((v0 >> 0) % 0xff) << 24 |
((v0 >> 8) % 0xff) << 16 |
((v0 >> 16) % 0xff) << 8 |
((v0 >> 24) % 0xff) << 0;
goto case_dword;
}
/* case REG_DWORD: */
case REG_DWORD_LITTLE_ENDIAN:
v = *((DWORD *)data);
case_dword:
return PL_unify_integer(value, v);
}
/* case REG_QWORD: */
case REG_QWORD_LITTLE_ENDIAN:
{ DWORD64 v = *((DWORD64 *)data);
return PL_unify_integer(value, v);
}
case REG_EXPAND_SZ:
{ return PL_unify_term(value, PL_FUNCTOR, FUNCTOR_expand1,
PL_CHARS, (char *)data);
}
case REG_LINK:
{ return PL_unify_term(value, PL_FUNCTOR, FUNCTOR_link1,
PL_CHARS, (char *)data);
}
case REG_MULTI_SZ:
{ term_t tail = PL_copy_term_ref(value);
term_t head = PL_new_term_ref();
char *s = (char *)data;
while(*s)
{ if ( !PL_unify_list(tail, head, tail) ||
!PL_unify_atom_chars(head, s) )
PL_fail;
s += strlen(s) + 1;
}
return PL_unify_nil(tail);
}
case REG_NONE:
return PL_unify_atom_chars(value, "<none>");
case REG_RESOURCE_LIST:
return PL_unify_atom_chars(value, "<resource_list>");
case REG_SZ:
return PL_unify_atom_chars(value, (char *)data);
}
} else
return api_exception(rval, "write", h);
assert(0);
return FALSE;
}
foreign_t
pl_reg_set_value(term_t h, term_t name, term_t value)
{ HKEY k;
char *vname;
DWORD rval, type;
int64_t intval;
size_t len;
BYTE *data;
if ( !(k = to_key(h)) || !PL_get_atom_chars(name, &vname) )
PL_fail;
switch(PL_term_type(value))
{ case PL_ATOM:
{ if ( !PL_get_atom_chars(value, (char**)&data) )
goto instantiation_error;
len = strlen((char*)data) + 1;
type = REG_SZ;
break;
}
case PL_STRING:
{ size_t l;
if ( !PL_get_string(value, (char**)&data, &l) )
goto instantiation_error;
len = l;
type = REG_SZ;
break;
}
case PL_INTEGER:
{ if ( !PL_get_int64(value, &intval) )
goto instantiation_error;
data = (BYTE *) &intval;
if ( intval > INT_MAX || intval < INT_MIN )
{ len = sizeof(DWORD64);
type = REG_QWORD;
}
else
{ len = sizeof(DWORD);
type = REG_DWORD;
}
break;
}
case PL_TERM:
{ if ( PL_is_functor(value, FUNCTOR_link1) )
{ type = REG_LINK;
goto argdata;
} else if ( PL_is_functor(value, FUNCTOR_expand1) )
{ term_t a;
type = REG_EXPAND_SZ;
argdata:
a = PL_new_term_ref();
if ( !(PL_get_arg(1, value, a) &&
PL_get_atom_chars(a, (char**)&data)) )
goto instantiation_error;
len = strlen((char*)data) + 1;
break;
} else { /* TBD: MULTI_SZ (list) */
goto domain_error;
}
}
case PL_VARIABLE:
instantiation_error:
{ return PL_instantiation_error(value);
}
default:
domain_error:
{ return PL_domain_error("registry_value", value);
}
}
rval = RegSetValueEx(k, vname, 0L, type, data, (DWORD)len);
if ( rval == ERROR_SUCCESS )
PL_succeed;
return api_exception(rval, "write", h);
}
foreign_t
pl_reg_delete_value(term_t h, term_t name)
{ HKEY k;
char *vname;
LONG rval;
if ( !(k = to_key(h)) || !PL_get_atom_chars(name, &vname) )
PL_fail;
if ( (rval = RegDeleteValue(k, vname)) == ERROR_SUCCESS )
PL_succeed;
return api_exception(rval, "delete", name);
}
foreign_t
pl_reg_flush(term_t h)
{ HKEY k;
if ( (k = to_key(h)) )
{ DWORD rval;
if ( (rval = RegFlushKey(k)) == ERROR_SUCCESS )
PL_succeed;
return api_exception(rval, "flush", h);
}
PL_fail;
}
foreign_t
pl_reg_create_key(term_t h, term_t name,
term_t class, term_t options, term_t access,
term_t key)
{ HKEY k, skey;
char *kname; /* key-name */
char *cname; /* class-name */
REGSAM mode;
DWORD ops = REG_OPTION_NON_VOLATILE;
term_t tail = PL_copy_term_ref(options);
term_t head = PL_new_term_ref();
DWORD rval;
DWORD disp;
if ( !(k = to_key(h)) ||
!PL_get_atom_chars(name, &kname) ||
!PL_get_atom_chars(class, &cname) ||
!get_access(access, &mode) )
PL_fail;
while(PL_get_list(tail, head, tail))
{ atom_t a;
if ( PL_get_atom(head, &a) )
{ if ( a == ATOM_volatile )
{ ops &= ~REG_OPTION_NON_VOLATILE;
ops |= REG_OPTION_VOLATILE;
continue;
}
}
PL_fail;
}
if ( !PL_get_nil(tail) )
PL_fail;
rval = RegCreateKeyEx(k, kname, 0L, cname, ops, mode, NULL, &skey, &disp);
if ( rval == ERROR_SUCCESS )
return PL_unify_integer(key, (int)(intptr_t)skey);
else
return api_exception(rval, "create", name);
}
/*******************************
* FLUSH SHELL *
*******************************/
static foreign_t
win_flush_filetypes()
{ SHChangeNotify(SHCNE_ASSOCCHANGED, SHCNF_FLUSHNOWAIT, NULL, NULL);
return TRUE;
}
/*******************************
* INSTALL *
*******************************/
/* - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - -
Finally, register the predicates. Simply calling
?- load_foreign_library(plregtry).
will makes these available in the calling context module.
- - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - */
install_t
install_plregtry()
{ init_constants();
PL_register_foreign("reg_subkeys", 2, pl_reg_subkeys, 0);
PL_register_foreign("reg_open_key", 4, pl_reg_open_key, 0);
PL_register_foreign("reg_close_key", 1, pl_reg_close_key, 0);
PL_register_foreign("reg_delete_key", 2, pl_reg_delete_key, 0);
PL_register_foreign("reg_value_names", 2, pl_reg_value_names, 0);
PL_register_foreign("reg_value", 3, pl_reg_value, 0);
PL_register_foreign("reg_set_value", 3, pl_reg_set_value, 0);
PL_register_foreign("reg_delete_value",2, pl_reg_delete_value,0);
PL_register_foreign("reg_flush", 1, pl_reg_flush, 0);
PL_register_foreign("reg_create_key", 6, pl_reg_create_key, 0);
PL_register_foreign("win_flush_filetypes", 0, win_flush_filetypes, 0);
}