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
|
/*******************************************************************************
*
* MODULE: util.c
*
********************************************************************************
*
* DESCRIPTION: C::B::C utilities
*
********************************************************************************
*
* $Project: /Convert-Binary-C $
* $Author: mhx $
* $Date: 2011/04/10 12:32:17 +0200 $
* $Revision: 23 $
* $Source: /cbc/util.c $
*
********************************************************************************
*
* Copyright (c) 2002-2011 Marcus Holland-Moritz. All rights reserved.
* This program is free software; you can redistribute it and/or modify
* it under the same terms as Perl itself.
*
*******************************************************************************/
/*===== GLOBAL INCLUDES ======================================================*/
#define PERL_NO_GET_CONTEXT
#include <EXTERN.h>
#include <perl.h>
#include <XSUB.h>
#include "ppport.h"
/*===== LOCAL INCLUDES =======================================================*/
#include "cbc/util.h"
/*===== DEFINES ==============================================================*/
/*===== TYPEDEFS =============================================================*/
/*===== STATIC FUNCTION PROTOTYPES ===========================================*/
static int load_indexed_hash_module_ex(pTHX_ CBC *THIS, const char **modlist, int num);
/*===== EXTERNAL VARIABLES ===================================================*/
/*===== GLOBAL VARIABLES =====================================================*/
/*===== STATIC VARIABLES =====================================================*/
#define NUM_IX_HASH_MODS (sizeof(gs_IxHashMods)/sizeof(gs_IxHashMods[0]))
static const char *gs_IxHashMods[] = {
NULL, /* custom preferred module */
"Tie::Hash::Indexed",
"Tie::IxHash"
};
/*===== STATIC FUNCTIONS =====================================================*/
/*******************************************************************************
*
* ROUTINE: load_indexed_hash_module_ex
*
* WRITTEN BY: Marcus Holland-Moritz ON: Oct 2003
* CHANGED BY: ON:
*
********************************************************************************
*
* DESCRIPTION:
*
* ARGUMENTS:
*
* RETURNS:
*
*******************************************************************************/
static int load_indexed_hash_module_ex(pTHX_ CBC *THIS, const char **modlist, int num)
{
const char *p = NULL;
int i;
if (THIS->ixhash != NULL)
{
/* a module has already been loaded */
return 1;
}
for (i = 0; i < num; i++)
{
if (modlist[i])
{
SV *sv = newSVpvn("require ", 8);
sv_catpv(sv, CONST_CHAR(modlist[i]));
CT_DEBUG(MAIN, ("trying to require \"%s\"", modlist[i]));
(void) eval_sv(sv, G_DISCARD);
SvREFCNT_dec(sv);
if ((sv = get_sv("@", 0)) != NULL && strEQ(SvPV_nolen(sv), ""))
{
p = modlist[i];
break;
}
if (i == 0)
{
Perl_warn(aTHX_ "Couldn't load %s for member ordering, "
"trying default modules", modlist[i]);
}
CT_DEBUG(MAIN, ("failed: \"%s\"", sv ? SvPV_nolen(sv) : "[NULL]"));
}
}
if (p == NULL)
{
SV *sv = newSVpvn("", 0);
for (i = 1; i < num; i++)
{
if (i > 1)
{
if (i == num-1)
sv_catpvn(sv, " or ", 4);
else
sv_catpvn(sv, ", ", 2);
}
sv_catpv(sv, CONST_CHAR(modlist[i]));
}
Perl_warn(aTHX_ "Couldn't load a module for member ordering "
"(consider installing %s)", SvPV_nolen(sv));
return 0;
}
CT_DEBUG(MAIN, ("using \"%s\" for member ordering", p));
THIS->ixhash = p;
return 1;
}
/*===== FUNCTIONS ============================================================*/
/*******************************************************************************
*
* ROUTINE: fatal
*
* WRITTEN BY: Marcus Holland-Moritz ON: Mar 2002
* CHANGED BY: ON:
*
********************************************************************************
*
* DESCRIPTION: Write fatal error to standard error and abort().
*
* ARGUMENTS:
*
* RETURNS:
*
*******************************************************************************/
void fatal(const char *f, ...)
{
dTHX;
va_list l;
SV *sv = newSVpvn("", 0);
va_start(l, f);
sv_catpv(sv,
"============================================\n"
" FATAL ERROR in " XSCLASS "!\n"
"--------------------------------------------\n"
);
sv_vcatpvf(sv, f, &l);
sv_catpv(sv,
"\n"
"--------------------------------------------\n"
" please report this error to mhx@cpan.org\n"
"============================================\n"
);
va_end(l);
fprintf(stderr, "%s", SvPVX(sv));
SvREFCNT_dec(sv);
abort();
}
/*******************************************************************************
*
* ROUTINE: newHV_indexed
*
* WRITTEN BY: Marcus Holland-Moritz ON: Oct 2003
* CHANGED BY: ON:
*
********************************************************************************
*
* DESCRIPTION:
*
* ARGUMENTS:
*
* RETURNS:
*
*******************************************************************************/
HV *newHV_indexed(pTHX_ const CBC *THIS)
{
dSP;
HV *hv, *stash;
GV *gv;
SV *sv;
int count;
hv = newHV();
sv = newSVpv(CONST_CHAR(THIS->ixhash), 0);
stash = gv_stashpv(CONST_CHAR(THIS->ixhash), 0);
gv = gv_fetchmethod(stash, "TIEHASH");
ENTER;
SAVETMPS;
PUSHMARK(SP);
XPUSHs(sv_2mortal(sv));
PUTBACK;
count = call_sv((SV*)GvCV(gv), G_SCALAR);
SPAGAIN;
if (count != 1)
fatal("%s::TIEHASH returned %d elements instead of 1",
THIS->ixhash, count);
sv = POPs;
PUTBACK;
hv_magic(hv, (GV *)sv, PERL_MAGIC_tied);
FREETMPS;
LEAVE;
return hv;
}
/*******************************************************************************
*
* ROUTINE: croak_gti
*
* WRITTEN BY: Marcus Holland-Moritz ON: Mar 2002
* CHANGED BY: ON:
*
********************************************************************************
*
* DESCRIPTION:
*
* ARGUMENTS:
*
* RETURNS:
*
*******************************************************************************/
void croak_gti(pTHX_ ErrorGTI error, const char *name, int warnOnly)
{
char *errstr = NULL;
switch (error)
{
case GTI_NO_ERROR:
return;
case GTI_NO_STRUCT_DECL:
errstr = "Got no struct declarations";
break;
default:
if( name )
fatal("Unknown error %d in resolution of '%s'", error, name);
else
fatal("Unknown error %d in resolution of typedef", error);
break;
}
if (warnOnly)
{
if (name)
WARN((aTHX_ "%s in resolution of '%s'", errstr, name));
else
WARN((aTHX_ "%s in resolution of typedef", errstr));
}
else
{
if (name)
Perl_croak(aTHX_ "%s in resolution of '%s'", errstr, name);
else
Perl_croak(aTHX_ "%s in resolution of typedef", errstr);
}
}
/*******************************************************************************
*
* ROUTINE: get_basic_type_spec_string
*
* WRITTEN BY: Marcus Holland-Moritz ON: Sep 2002
* CHANGED BY: ON:
*
********************************************************************************
*
* DESCRIPTION:
*
* ARGUMENTS:
*
* RETURNS:
*
*******************************************************************************/
void get_basic_type_spec_string(pTHX_ SV **sv, u_32 flags)
{
struct { u_32 flag; const char *str; } *pSpec, spec[] = {
{T_SIGNED, "signed" },
{T_UNSIGNED, "unsigned"},
{T_SHORT, "short" },
{T_LONGLONG, "long" },
{T_LONG, "long" },
{T_VOID, "void" },
{T_CHAR, "char" },
{T_INT , "int" },
{T_FLOAT , "float" },
{T_DOUBLE , "double" },
{0, NULL }
};
int first = 1;
CT_DEBUG(MAIN, (XSCLASS "::get_basic_type_spec_string( sv=%p, flags=0x%08lX )",
sv, (unsigned long) flags));
for (pSpec = spec; pSpec->flag; ++pSpec)
{
if (pSpec->flag & flags)
{
if (*sv)
sv_catpvf(*sv, first ? "%s" : " %s", pSpec->str);
else
*sv = newSVpv(CONST_CHAR(pSpec->str), 0);
first = 0;
}
}
}
/*******************************************************************************
*
* ROUTINE: add_indent
*
* WRITTEN BY: Marcus Holland-Moritz ON: Oct 2002
* CHANGED BY: ON:
*
********************************************************************************
*
* DESCRIPTION:
*
* ARGUMENTS:
*
* RETURNS:
*
*******************************************************************************/
void add_indent(pTHX_ SV *s, int level)
{
#define MAXINDENT 16
static const char tab[MAXINDENT] = "\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t";
#ifndef CBC_DONT_CLAMP_TO_MAXINDENT
if (level > MAXINDENT)
level = MAXINDENT;
#else
while (level > MAXINDENT)
{
sv_catpvn( s, tab, MAXINDENT );
level -= MAXINDENT;
}
#endif
sv_catpvn(s, CONST_CHAR(tab), level);
#undef MAXINDENT
}
/*******************************************************************************
*
* ROUTINE: load_indexed_hash_module
*
* WRITTEN BY: Marcus Holland-Moritz ON: Oct 2003
* CHANGED BY: ON:
*
********************************************************************************
*
* DESCRIPTION:
*
* ARGUMENTS:
*
* RETURNS:
*
*******************************************************************************/
int load_indexed_hash_module(pTHX_ CBC *THIS)
{
return load_indexed_hash_module_ex(aTHX_ THIS, gs_IxHashMods, NUM_IX_HASH_MODS);
}
/*******************************************************************************
*
* ROUTINE: set_preferred_indexed_hash_module
*
* WRITTEN BY: Marcus Holland-Moritz ON: Dec 2004
* CHANGED BY: ON:
*
********************************************************************************
*
* DESCRIPTION:
*
* ARGUMENTS:
*
* RETURNS:
*
*******************************************************************************/
void set_preferred_indexed_hash_module(const char *module)
{
gs_IxHashMods[0] = module;
}
/*******************************************************************************
*
* ROUTINE: string_new
*
* WRITTEN BY: Marcus Holland-Moritz ON: Oct 2002
* CHANGED BY: ON:
*
********************************************************************************
*
* DESCRIPTION:
*
* ARGUMENTS:
*
* RETURNS:
*
*******************************************************************************/
char *string_new(const char *str)
{
char *cpy = NULL;
if (str != NULL)
{
size_t len = strlen(str) + 1;
New(0, cpy, len, char);
Copy(str, cpy, len, char);
}
return cpy;
}
/*******************************************************************************
*
* ROUTINE: string_new_fromSV
*
* WRITTEN BY: Marcus Holland-Moritz ON: May 2002
* CHANGED BY: ON:
*
********************************************************************************
*
* DESCRIPTION:
*
* ARGUMENTS:
*
* RETURNS:
*
*******************************************************************************/
char *string_new_fromSV(pTHX_ SV *sv)
{
char *cpy = NULL;
if (sv != NULL)
{
char *str;
STRLEN len;
str = SvPV(sv, len);
len++;
New(0, cpy, len, char);
Copy(str, cpy, len, char);
}
return cpy;
}
/*******************************************************************************
*
* ROUTINE: string_delete
*
* WRITTEN BY: Marcus Holland-Moritz ON: May 2002
* CHANGED BY: ON:
*
********************************************************************************
*
* DESCRIPTION:
*
* ARGUMENTS:
*
* RETURNS:
*
*******************************************************************************/
void string_delete(char *str)
{
Safefree(str);
}
/*******************************************************************************
*
* ROUTINE: clone_string_list
*
* WRITTEN BY: Marcus Holland-Moritz ON: Oct 2002
* CHANGED BY: ON:
*
********************************************************************************
*
* DESCRIPTION:
*
* ARGUMENTS:
*
* RETURNS:
*
*******************************************************************************/
LinkedList clone_string_list(LinkedList list)
{
ListIterator li;
const char *str;
LinkedList clone;
clone = LL_new();
LL_foreach(str, li, list)
LL_push(clone, string_new(str));
return clone;
}
/*******************************************************************************
*
* ROUTINE: dump_sv
*
* WRITTEN BY: Marcus Holland-Moritz ON: Mar 2002
* CHANGED BY: ON:
*
********************************************************************************
*
* DESCRIPTION: Dumps an SV similar to (but a lot simpler than) Devel::Peek's
* Dump function, but instead of writing to the debug output, it
* returns a Perl string that can be used for further processing.
* Currently, the only useful information is the reference count.
*
* ARGUMENTS:
*
* RETURNS:
*
*******************************************************************************/
#define DUMP_INDENT \
STMT_START { \
if (level > 0) \
add_indent(aTHX_ buf, level); \
} STMT_END
void dump_sv(pTHX_ SV *buf, int level, SV *sv)
{
char *str;
svtype type = SvTYPE(sv);
if (SvROK(sv))
{
str = "RV";
}
else
{
switch (type)
{
case SVt_NULL: str = "NULL"; break;
case SVt_IV: str = "IV"; break;
case SVt_NV: str = "NV"; break;
case SVt_PV: str = "PV"; break;
case SVt_PVIV: str = "PVIV"; break;
case SVt_PVNV: str = "PVNV"; break;
case SVt_PVMG: str = "PVMG"; break;
case SVt_PVLV: str = "PVLV"; break;
case SVt_PVAV: str = "PVAV"; break;
case SVt_PVHV: str = "PVHV"; break;
case SVt_PVCV: str = "PVCV"; break;
case SVt_PVGV: str = "PVGV"; break;
case SVt_PVFM: str = "PVFM"; break;
case SVt_PVIO: str = "PVIO"; break;
default : str = "UNKNOWN";
}
}
CT_DEBUG(MAIN, (XSCLASS "::dump_sv( level=%d, sv=\"%s\" )", level, str));
#ifndef CBC_USE_LESS_MEMORY
/*
* This speeds up dump at the cost of memory,
* as it prevents a lot of realloc()s.
* Actually, it was only inserted to make valgrind
* run at acceptable speed... ;-)
*/
{
STRLEN cur, len;
cur = SvCUR(buf) + 64; /* estimated new string length */
if (cur > 1024) /* do nothing for small strings */
{
len = SvLEN(buf); /* buffer size */
if (cur > len)
{
len = (len/1024)*2048; /* double buffer size */
(void) sv_grow(buf, len);
}
}
}
#endif
DUMP_INDENT; level++;
sv_catpvf(buf, "SV = %s @ %p (REFCNT = %lu)\n",
str, sv, (unsigned long) SvREFCNT(sv));
if (SvROK(sv))
{
dump_sv(aTHX_ buf, level, SvRV(sv));
return;
}
switch (type)
{
case SVt_PVAV:
{
AV *av = (AV *) sv;
I32 c, n;
for (c = 0, n = av_len(av); c <= n; ++c)
{
SV **p = av_fetch(av, c, 0);
if (p)
{
DUMP_INDENT;
sv_catpvf(buf, "index = %ld\n", (long) c);
dump_sv(aTHX_ buf, level, *p);
}
}
}
break;
case SVt_PVHV:
{
HV *hv = (HV *) sv;
SV *v; I32 len;
hv_iterinit(hv);
while ((v = hv_iternextsv(hv, &str, &len)) != 0)
{
DUMP_INDENT;
sv_catpv(buf, "key = \"");
sv_catpvn(buf, str, len);
sv_catpv(buf, "\"\n");
dump_sv(aTHX_ buf, level, v);
}
}
break;
default:
/* nothing */
break;
}
}
/*******************************************************************************
*
* ROUTINE: identify_sv
*
* WRITTEN BY: Marcus Holland-Moritz ON: Mar 2006
* CHANGED BY: ON:
*
********************************************************************************
*
* DESCRIPTION: Identify an SV and return a string describing its type.
*
* ARGUMENTS:
*
* RETURNS:
*
*******************************************************************************/
const char *identify_sv(SV *sv)
{
if (sv == NULL || !SvOK(sv)) return "an undefined value";
if (SvROK(sv))
{
switch (SvTYPE(SvRV(sv)))
{
case SVt_PVAV: return "an array reference";
case SVt_PVHV: return "a hash reference";
case SVt_PVCV: return "a code reference";
default: return "a reference";
}
}
if (SvIOK(sv)) return "an integer value";
if (SvNOK(sv)) return "a numeric value";
if (SvPOK(sv)) return "a string value";
return "an unknown value";
}
|