-
Notifications
You must be signed in to change notification settings - Fork 15
/
error.c
210 lines (160 loc) · 4.88 KB
/
error.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
/* Part of SWI-Prolog
Author: Jan Wielemaker
E-mail: [email protected]
WWW: http://www.swi-prolog.org
Copyright (c) 2011-2020, 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 "rdf_db.h"
#include "memory.h"
/*******************************
* ERRORS *
*******************************/
static functor_t FUNCTOR_error2;
static functor_t FUNCTOR_literal1;
static functor_t FUNCTOR_colon2;
int
permission_error(const char *op, const char *type, const char *obj,
const char *msg)
{ term_t ex, ctx;
if ( !(ex = PL_new_term_ref()) ||
!(ctx = PL_new_term_ref()) )
return FALSE;
if ( msg )
{ if ( !PL_unify_term(ctx, PL_FUNCTOR_CHARS, "context", 2,
PL_VARIABLE,
PL_CHARS, msg) )
return FALSE;
}
if ( !PL_unify_term(ex, PL_FUNCTOR_CHARS, "error", 2,
PL_FUNCTOR_CHARS, "permission_error", 3,
PL_CHARS, op,
PL_CHARS, type,
PL_CHARS, obj,
PL_TERM, ctx) )
return FALSE;
return PL_raise_exception(ex);
}
int
is_literal(term_t t)
{ return PL_is_functor(t, FUNCTOR_literal1);
}
typedef struct prefix_cache
{ atom_t local;
atom_t alias;
atom_t uri;
int generation;
unsigned int locked;
} prefix_cache;
#define PREFIX_EXPAND_ENTRIES 4
static prefix_cache cache[PREFIX_EXPAND_ENTRIES] = {{0}};
static int cache_ptr = 0;
static atom_t
cached_expansion(atom_t alias, atom_t local)
{ prefix_cache *c;
int i;
for(i=0, c=cache; i<PREFIX_EXPAND_ENTRIES; i++, c++)
{ int gen0 = c->generation;
atom_t uri = c->uri;
if ( c->local == local && c->alias == alias &&
gen0 == c->generation )
return uri;
}
return (atom_t)0;
}
static void
cache_expansion(atom_t alias, atom_t local, atom_t uri)
{ int i;
for(i=(++cache_ptr%PREFIX_EXPAND_ENTRIES); ; i = (i+1)%PREFIX_EXPAND_ENTRIES)
{ prefix_cache *c = &cache[i];
if ( COMPARE_AND_SWAP_UINT(&c->locked, 0, 1) )
{ atom_t olocal = c->local;
atom_t ouri = c->uri;
c->local = 0;
c->alias = 0;
c->uri = 0;
c->generation++;
c->uri = uri;
c->alias = alias;
c->local = local;
PL_register_atom(local);
PL_register_atom(uri);
if ( olocal) PL_unregister_atom(olocal);
if ( ouri) PL_unregister_atom(ouri);
c->locked = 0;
return;
}
}
}
void
flush_prefix_cache(void)
{ int i;
for( i=0; i<PREFIX_EXPAND_ENTRIES; i++)
{ prefix_cache *c = &cache[i];
while( !COMPARE_AND_SWAP_UINT(&c->locked, 0, 1) )
; /* spin lock */
{ atom_t olocal = c->local;
atom_t ouri = c->uri;
c->local = 0;
c->alias = 0;
c->uri = 0;
c->generation++;
if ( olocal) PL_unregister_atom(olocal);
if ( ouri) PL_unregister_atom(ouri);
c->locked = 0;
}
}
}
int
get_prefixed_iri(rdf_db *db, term_t t, atom_t *ap)
{ if ( PL_is_functor(t, FUNCTOR_colon2) )
{ term_t a = PL_new_term_ref();
atom_t alias, local, uri;
_PL_get_arg(1, t, a);
if ( !PL_get_atom(a, &alias) )
return FALSE;
_PL_get_arg(2, t, a);
if ( !PL_get_atom(a, &local) )
return FALSE;
if ( (uri = cached_expansion(alias, local)) )
{ *ap = uri;
return TRUE;
}
if ( (uri = expand_prefix(db, alias, local)) )
{ cache_expansion(alias, local, uri);
*ap = uri;
return TRUE;
}
}
return FALSE;
}
#define MKFUNCTOR(n, a) \
FUNCTOR_ ## n ## a = PL_new_functor(PL_new_atom(#n), a)
int
init_errors(void)
{ MKFUNCTOR(error, 2);
MKFUNCTOR(literal, 1);
FUNCTOR_colon2 = PL_new_functor(PL_new_atom(":"), 2);
return TRUE;
}