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
|
/* Part of SWI-Prolog
Author: Jan Wielemaker
E-mail: J.Wielemaker@vu.nl
WWW: http://www.swi-prolog.org
Copyright (c) 1985-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 "pl-incl.h"
#include "os/pl-ctype.h"
#include "os/pl-utf8.h"
static bool isUserSystemPredicate(Definition def);
/* - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - -
These functions return a user-printable name of a predicate as
name/arity or module:name/arity. The result is stored in the foreign
buffer ring, so we are thread-safe, but the result needs to be copied
before the ring is exhausted. See buffer_string() for details. For wide
character versions, we use UTF-8 encoding. This isn't very elegant, but
these functions are for debugging only.
- - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - */
char *
procedureName(Procedure proc)
{ return predicateName(proc->definition);
}
#define fetch_text(s, i) \
((s)->encoding == ENC_ISO_LATIN_1 ? (s)->text.t[i]&0xff \
: (s)->text.w[i])
const char *
text_summary(PL_chars_t *txt, char q, unsigned int maxlen)
{ Buffer b;
size_t i;
if ( txt->encoding == ENC_ISO_LATIN_1 && txt->length < maxlen && !q )
{ const unsigned char *s = (const unsigned char*) txt->text.t;
const unsigned char *e = &s[txt->length];
for( ; s<e; s++ )
{ if ( *s >= 0x80 )
break;
}
if ( s == e )
return txt->text.t;
}
b = findBuffer(BUF_RING);
if ( q )
{ maxlen -= 2;
addBuffer(b, q, char);
}
for(i=0; i<txt->length; i++)
{ char buf[6];
char *e;
e = utf8_put_char(buf, fetch_text(txt, i));
addMultipleBuffer(b, buf, e-buf, char);
if ( i == maxlen - 6 )
{ addMultipleBuffer(b, "...", 3, char);
i = txt->length - 4;
maxlen = 0; /* make sure not to trap again */
}
}
if ( q )
addBuffer(b, q, char);
addBuffer(b, 0, char);
return baseBuffer(b, char);
}
const char *
atom_summary(atom_t name, unsigned int maxlen)
{ PL_chars_t txt;
if ( !get_atom_text(name, &txt) )
{ if ( isNil(name) )
return "[]";
return "<blob>";
}
return text_summary(&txt, 0, maxlen);
}
const char *
string_summary(word string, unsigned int maxlen)
{ GET_LD
PL_chars_t txt;
if ( !get_string_text(string, &txt PASS_LD) )
return NULL;
return text_summary(&txt, '"', maxlen);
}
/* - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - -
predicateName() returns an UTF-8 representation of the name of the
predicate. Note that we need for the buffer 6*max summary length,
- - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - */
char *
predicateName(Definition def)
{ char tmp[650];
char *e = tmp;
if ( !def )
return "(nil)";
if ( def->module != MODULE_user && !isUserSystemPredicate(def) )
{ if ( def->module )
strcpy(e, atom_summary(def->module->name, 50));
else
strcpy(e, "(nil)");
e += strlen(e);
*e++ = ':';
}
strcpy(e, atom_summary(def->functor->name, 50));
e += strlen(e);
*e++ = '/';
Ssprintf(e, "%d", def->functor->arity);
return buffer_string(tmp, BUF_RING);
}
char *
functorName(functor_t f)
{ char tmp[650];
char *e = tmp;
FunctorDef fd;
if ( tagex(f) != (TAG_ATOM|STG_GLOBAL) )
return "<not-a-functor>";
fd = valueFunctor(f);
strcpy(e, atom_summary(fd->name, 50));
e += strlen(e);
*e++ = '/';
Ssprintf(e, "%d", fd->arity);
return buffer_string(tmp, BUF_RING);
}
char *
keyName(word key)
{ if ( tagex(key) == (TAG_ATOM|STG_GLOBAL) )
{ return functorName(key);
} else
{ char tmp[650];
if ( !key )
{ strcpy(tmp, "<nil>");
} else
{ switch(tag(key))
{ case TAG_INTEGER:
case TAG_FLOAT:
{ GET_LD
number n;
get_number(key, &n PASS_LD);
switch(n.type)
{ case V_INTEGER:
Ssprintf(tmp, "%lld", n.value.i);
break;
case V_FLOAT:
Ssprintf(tmp, "%f", n.value.f);
break;
default:
strcpy(tmp, "<number>");
}
break;
}
case TAG_ATOM:
strcpy(tmp, atom_summary(key, 30));
break;
case TAG_STRING:
strcpy(tmp, string_summary(key, 30));
break;
default:
assert(0);
}
}
return buffer_string(tmp, BUF_RING);
}
}
char *
sourceFileName(SourceFile sf)
{ char tmp[650];
strcpy(tmp, atom_summary(sf->name, 50));
return buffer_string(tmp, BUF_RING);
}
char *
generationName(gen_t gen)
{ char tmp[256];
if ( gen == GEN_MAX )
return "GEN_MAX";
Ssprintf(tmp, "%lld", (int64_t)gen);
return buffer_string(tmp, BUF_RING);
}
/* - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - -
clauseNo() returns the clause index of the given clause at the given
generation. Use the current generation if gen is 0;
- - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - */
int
clauseNo(Clause cl, gen_t gen)
{ GET_LD
int i;
ClauseRef cref;
Definition def = cl->predicate;
if ( !gen )
gen = global_generation();
acquire_def(def);
for(i=1, cref=def->impl.clauses.first_clause; cref; cref=cref->next)
{ Clause c = cref->value.clause;
if ( visibleClause(c, gen) )
{ if ( c == cl )
{ release_def(def);
return i;
}
}
i++;
}
release_def(def);
return -1;
}
/* succeeds if proc is a system predicate exported to the public module.
** Fri Sep 2 17:03:43 1988 jan@swivax.UUCP (Jan Wielemaker) */
static bool
isUserSystemPredicate(Definition def)
{ GET_LD
if ( true(def, P_LOCKED) &&
isCurrentProcedure(def->functor->functor, MODULE_user) )
succeed;
fail;
}
int
notImplemented(char *name, int arity)
{ return PL_error(NULL, 0, NULL, ERR_NOT_IMPLEMENTED_PROC, name, arity);
}
word
setBoolean(int *flag, term_t old, term_t new)
{ if ( !PL_unify_bool_ex(old, *flag) ||
!PL_get_bool_ex(new, flag) )
fail;
succeed;
}
word
setInteger(int *flag, term_t old, term_t new)
{ GET_LD
if ( !PL_unify_integer(old, *flag) ||
!PL_get_integer_ex(new, flag) )
fail;
succeed;
}
|