pike.git/src/stralloc.c:f44553884d05e0dd9033c52d03c1368467795a20

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 /*\ ||| This file a part of Pike, and is copyright by Fredrik Hubinette ||| Pike is distributed as GPL (General Public License) ||| See the files COPYING and DISCLAIMER for more information. \*/ #include "global.h" #include "stralloc.h" #include "pike_macros.h" #include "dynamic_buffer.h" #include "pike_macros.h" #include "pike_memory.h" #include "error.h" #include "gc.h" #include "stuff.h" #include <ctype.h> RCSID("$Id: stralloc.c,v 1.39 1998/10/09 17:56:33 hubbe Exp $"); #define BEGIN_HASH_SIZE 997 #define MAX_AVG_LINK_LENGTH 3 #define HASH_PREFIX 64 unsigned INT32 htable_size=0; static unsigned int hashprimes_entry=0; static struct pike_string **base_table=0; static unsigned INT32 full_hash_value; unsigned INT32 num_strings=0; /*** Main string hash function ***/ #define StrHash(s,len) low_do_hash(s,len,0) static unsigned int low_do_hash(const void *s, int len, int size_shift) { full_hash_value=hashmem(s,len<<size_shift,HASH_PREFIX<<size_shift); return full_hash_value % htable_size; } static INLINE unsigned int do_hash(struct pike_string *s) { return low_do_hash(s->str,s->len,s->size_shift); } static INLINE int find_magnitude1(const unsigned INT16 *s, int len) { while(--len>=0) if(s[len]>=256) return 1; return 0; } static INLINE int find_magnitude2(const unsigned INT32 *s, int len) { while(--len>=0) { if(s[len]>=256) { do { if(s[len]>=65536) return 2; }while(--len>=0); return 1; } } return 0; } static INLINE int min_magnitude(const unsigned INT32 c) { if(c<256) return 0; if(c<65536) return 1; return 2; } static INLINE unsigned INT32 generic_extract (const void *str, int size, int pos) { switch(size) { case 0: return ((unsigned char *)str)[pos]; case 1: return ((unsigned INT16 *)str)[pos]; case 2: return ((unsigned INT32 *)str)[pos]; default: fatal("Illegal shift size!\n"); } } INLINE unsigned INT32 index_shared_string(struct pike_string *s, int pos) { #ifdef DEBUG if(pos > s->len || pos<0) fatal("string index out of range!\n"); #endif return generic_extract(s->str,s->size_shift,pos); } static INLINE void low_set_index(struct pike_string *s, int pos, int value) { #ifdef DEBUG if(pos > s->len || pos<0) fatal("string index out of range!\n"); if(pos == s->len && value) fatal("string zero termination foul!\n"); #endif switch(s->size_shift) { case 0: STR0(s)[pos]=value; break; case 1: STR1(s)[pos]=value; break; case 2: STR2(s)[pos]=value; break; default: fatal("Illegal shift size!\n"); } } #ifdef DEBUG struct INLINE pike_string *debug_check_size_shift(struct pike_string *a,int shift) { if(a->size_shift != shift) fatal("Wrong STRX macro used!\n"); return a; } #endif int generic_compare_strings(const void *a,int alen, int asize, const void *b,int blen, int bsize) { #define TWO_SIZES(X,Y) (((X)<<2)+(Y)) if(alen != blen) return 0; if(asize==bsize) { return !MEMCPY(a,b,alen<<asize); }else{ INT32 pos; for(pos=0;pos< alen ;pos++) if(generic_extract(a,asize,pos) != generic_extract(b,bsize,pos)) return 0; return 1; } } #define CONVERT(NAME,FROM,TO) \ static INLINE void PIKE_CONCAT(convert_,NAME)(unsigned TO *to, const unsigned FROM *from, int len) \ { \ while(--len>=0) *(to++)=*(from++); \ } \ CONVERT(1_to_0,INT16,char) CONVERT(2_to_0,INT32,char) CONVERT(2_to_1,INT32,INT16) CONVERT(0_to_1,char,INT16) CONVERT(0_to_2,char,INT32) CONVERT(1_to_2,INT16,INT32) #define convert_0_to_0(X,Y,Z) MEMCPY((char *)(X),(char *)(Y),(Z)) #define convert_1_to_1(X,Y,Z) MEMCPY((char *)(X),(char *)(Y),(Z)<<1) #define convert_2_to_2(X,Y,Z) MEMCPY((char *)(X),(char *)(Y),(Z)<<2) #ifdef DEBUG #ifdef DEBUG_MALLOC #define DM(X) X #else #define DM(X) #endif static void pike_string_cpy(void *to, int to_shift, struct pike_string *from) { switch(TWO_SIZES(from->size_shift,to_shift)) { case TWO_SIZES(0,0): convert_0_to_0((p_wchar0 *)to,STR0(from),from->len); break; case TWO_SIZES(0,1): convert_0_to_1((p_wchar1 *)to,STR0(from),from->len); break; case TWO_SIZES(0,2): convert_0_to_2((p_wchar2 *)to,STR0(from),from->len); break; case TWO_SIZES(1,0): convert_1_to_0((p_wchar0 *)to,STR1(from),from->len); break; case TWO_SIZES(1,1): convert_1_to_1((p_wchar1 *)to,STR1(from),from->len); break; case TWO_SIZES(1,2): convert_1_to_2((p_wchar2 *)to,STR1(from),from->len); break; case TWO_SIZES(2,0): convert_2_to_0((p_wchar0 *)to,STR2(from),from->len); break; case TWO_SIZES(2,1): convert_2_to_1((p_wchar1 *)to,STR2(from),from->len); break; case TWO_SIZES(2,2): convert_2_to_2((p_wchar2 *)to,STR2(from),from->len); break; } } static void locate_problem(int (*isproblem)(struct pike_string *)) { unsigned INT32 e; struct pike_string *s; DM(struct memhdr *yes=alloc_memhdr()); DM(struct memhdr *no=alloc_memhdr()); for(e=0;e<htable_size;e++) { for(s=base_table[e];s;s=s->next) { if(isproblem(s)) { fprintf(stderr,"***Guilty string:\n"); debug_dump_pike_string(s, 70); DM(add_marks_to_memhdr(yes,s)); }else{ DM(add_marks_to_memhdr(no,s)); } } } DM(fprintf(stderr,"Plausible problem location(s):\n")); DM(dump_memhdr_locations(yes,0)); DM(fprintf(stderr,"More Plausible problem location(s):\n")); DM(dump_memhdr_locations(yes,no)); } static int has_zero_refs(struct pike_string *s) { return s->refs<=0; } static int wrong_hash(struct pike_string *s) { return (s->hval % htable_size) != do_hash(s); } static int improper_zero_termination(struct pike_string *s) { return index_shared_string(s,s->len); } #else #define locate_problem(X) #endif /*\ find a string in the shared string table. ||| This assumes that the string is minimized!!!! \*/ static struct pike_string *internal_findstring(const char *s, int len, int size_shift, int h) { struct pike_string *curr,**prev, **base; for(base = prev = base_table + h;( curr=*prev ); prev=&curr->next) { #ifdef DEBUG if(curr->refs<1) { debug_dump_pike_string(curr, 70); locate_problem(has_zero_refs); fatal("String with no references.\n"); } #endif if (full_hash_value == curr->hval && len==curr->len && size_shift==curr->size_shift && !MEMCMP(curr->str, s,len)) /* found it */ { *prev = curr->next; curr->next = *base; *base = curr; return curr; /* pointer to string */ } } return 0; /* not found */ } struct pike_string *binary_findstring(const char *foo, INT32 l) { return internal_findstring(foo, l, 0, StrHash(foo,l)); } struct pike_string *findstring(const char *foo) { return binary_findstring(foo, strlen(foo)); } /* * find a string that is already shared and move it to the head * of that list in the hastable */ static struct pike_string *propagate_shared_string(const struct pike_string *s, int h) { struct pike_string *curr, **prev, **base; for(base = prev = base_table + h;( curr=*prev ); prev=&curr->next) { if (curr == s) /* found it */ { *prev=curr->next; curr->next=*base; *base=curr; return curr; } #ifdef DEBUG if(curr->refs<1) { debug_dump_pike_string(curr, 70); locate_problem(has_zero_refs); fatal("String with no references.\n"); } #endif } return 0; /* not found */ } /*** rehash ***/ static void rehash_string_backwards(struct pike_string *s) { int h; if(!s) return; rehash_string_backwards(s->next); h=s->hval % htable_size; s->next=base_table[h]; base_table[h]=s; } static void rehash(void) { int h,old; struct pike_string **old_base; old=htable_size; old_base=base_table; htable_size=hashprimes[++hashprimes_entry]; base_table=(struct pike_string **)xalloc(sizeof(struct pike_string *)*htable_size); MEMSET((char *)base_table,0,sizeof(struct pike_string *)*htable_size); for(h=0;h<old;h++) rehash_string_backwards(old_base[h]); if(old_base) free((char *)old_base); } /*** Make new strings ***/ /* note that begin_shared_string expects the _exact_ size of the string, * not the maximum size */ struct pike_string *debug_begin_shared_string(int len) { struct pike_string *t; #ifdef DEBUG extern int d_flag; if(d_flag>10) verify_shared_strings_tables(); #endif t=(struct pike_string *)xalloc(len + sizeof(struct pike_string)); t->str[len]=0; t->len=len; t->size_shift=0; return t; } static void link_pike_string(struct pike_string *s, int h) { s->refs = 0; s->next = base_table[h]; base_table[h] = s; s->hval=full_hash_value; num_strings++; if(num_strings > MAX_AVG_LINK_LENGTH * htable_size) rehash(); } struct pike_string *debug_begin_wide_shared_string(int len, int shift) { struct pike_string *t; #ifdef DEBUG extern int d_flag; if(d_flag>10) verify_shared_strings_tables(); #endif t=(struct pike_string *)xalloc((len<<shift) + sizeof(struct pike_string)); t->len=len; t->size_shift=shift; low_set_index(t,len,0); return t; } struct pike_string *end_shared_string(struct pike_string *s) { int len,h; struct pike_string *s2; switch(s->size_shift) { default: fatal("ARGHEL!\n"); case 2: switch(find_magnitude2(STR2(s),s->len)) { case 0: s2=begin_shared_string(s->len); convert_2_to_0(STR0(s2),STR2(s),s->len); free((char *)s); s=s2; break; case 1: s2=begin_wide_shared_string(s->len,2); convert_2_to_1(STR1(s2),STR2(s),s->len); free((char *)s); s=s2; /* Fall though */ } break; case 1: if(!find_magnitude1(STR1(s),s->len)) { s2=begin_shared_string(s->len); convert_1_to_0(STR0(s2),STR1(s),s->len); free((char *)s); s=s2; } break; case 0: break; } len=s->len; h=do_hash(s); s2=internal_findstring(s->str,len,s->size_shift,h); #ifdef DEBUG if(s2==s) fatal("end_shared_string called twice! (or something like that)\n"); #endif if(s2) { free((char *)s); s=s2; }else{ link_pike_string(s, h); } add_ref(s); return s; } struct pike_string * debug_make_shared_binary_string(const char *str,int len) { struct pike_string *s; int h=StrHash(str,len); s = internal_findstring(str,len,0,h); if (!s) { s=begin_shared_string(len); MEMCPY(s->str, str, len); link_pike_string(s, h); } add_ref(s); return s; } struct pike_string * debug_make_shared_binary_string1(const INT16 *str,int len) { struct pike_string *s; int h; if(!find_magnitude1(str,len)) { /* Wrong size, convert */ s=begin_shared_string(len); convert_1_to_0(s->str,str,len); return end_shared_string(s); } h=low_do_hash(str, len<<1, 1); s = internal_findstring((char *)str,len,1,h); if (!s) { s=begin_wide_shared_string(len,1); MEMCPY(s->str, str, len<<1); link_pike_string(s, h); } add_ref(s); return s; } struct pike_string * debug_make_shared_binary_string2(const INT32 *str,int len) { struct pike_string *s; int h; switch(find_magnitude2(str,len)) { case 0: /* Wrong size, convert */ s=begin_shared_string(len); convert_2_to_0(s->str,str,len); return end_shared_string(s); case 1: /* Wrong size, convert */ s=begin_wide_shared_string(len,1); convert_2_to_1(STR1(s),str,len); return end_shared_string(s); /* not entirely optimal */ } h=low_do_hash(str, len<<2, 2); s = internal_findstring((char *)str,len,2,h); if (!s) { s=begin_wide_shared_string(len,2); MEMCPY(s->str, str, len<<2); link_pike_string(s, h); } add_ref(s); return s; } struct pike_string *debug_make_shared_string(const char *str) { return make_shared_binary_string(str, strlen(str)); } struct pike_string *make_shared_string1(const INT16 *str) { INT32 len; for(len=0;str[len];len++); return debug_make_shared_binary_string1(str,len); } struct pike_string *make_shared_string2(const INT32 *str) { INT32 len; for(len=0;str[len];len++); return debug_make_shared_binary_string2(str,len); } /*** Free strings ***/ void unlink_pike_string(struct pike_string *s) { int h; h=do_hash(s); propagate_shared_string(s,h); base_table[h]=s->next; #ifdef DEBUG s->next=(struct pike_string *)-1; #endif num_strings--; } void really_free_string(struct pike_string *s) { #ifdef DEBUG extern int d_flag; if(d_flag > 2) { if(s->next == (struct pike_string *)-1) fatal("Freeing shared string again!\n"); if(((long)s->next) & 1) fatal("Freeing shared string again, memory corrupt or other bug!\n"); } #endif unlink_pike_string(s); free((char *)s); } void debug_free_string(struct pike_string *s) { if(--s->refs<=0) really_free_string(s); } /* * String table status */ struct pike_string *add_string_status(int verbose) { char b[200]; init_buf(); if (verbose) { int allocd_strings=0; int allocd_bytes=0; int num_distinct_strings=0; int bytes_distinct_strings=0; int overhead_bytes=0; unsigned INT32 e; struct pike_string *p; for(e=0;e<htable_size;e++) { for(p=base_table[e];p;p=p->next) { num_distinct_strings++; bytes_distinct_strings+=MY_ALIGN(p->len); allocd_strings+=p->refs; allocd_bytes+=p->refs*MY_ALIGN(p->len+3); } } overhead_bytes=(sizeof(struct pike_string)-1)*num_distinct_strings; my_strcat("\nShared string hash table:\n"); my_strcat("-------------------------\t Strings Bytes\n"); sprintf(b,"Total asked for\t\t\t%8ld %8ld\n", (long)allocd_strings, (long)allocd_bytes); my_strcat(b); sprintf(b,"Strings malloced\t\t%8ld %8ld + %ld overhead\n", (long)num_distinct_strings, (long)bytes_distinct_strings, (long)overhead_bytes); my_strcat(b); sprintf(b,"Space actually required/total string bytes %d%%\n", (bytes_distinct_strings + overhead_bytes)*100 / allocd_bytes); my_strcat(b); } /* sprintf(b,"Searches: %ld Average search length: %6.3f\n", (long)num_str_searches, (double)search_len / num_str_searches); my_strcat(b); */ return free_buf(); } /*** DEBUG ***/ #ifdef DEBUG void check_string(struct pike_string *s) { do_hash(s); if(full_hash_value != s->hval) { locate_problem(wrong_hash); fatal("Hash value changed?\n"); } if(debug_findstring(s) !=s) fatal("Shared string not shared.\n"); if(index_shared_string(s,s->len)) { locate_problem(improper_zero_termination); fatal("Shared string is not zero terminated properly.\n"); } } void verify_shared_strings_tables(void) { unsigned INT32 e, h, num=0; unsigned INT32 orig_full_hash = full_hash_value; struct pike_string *s; for(e=0;e<htable_size;e++) { h=0; for(s=base_table[e];s;s=s->next) { num++; h++; if(s->len < 0) fatal("Shared string shorter than zero bytes.\n"); if(s->refs <= 0) { locate_problem(has_zero_refs); fatal("Shared string had too few references.\n"); } if(s->str[s->len]) { locate_problem(improper_zero_termination); fatal("Shared string didn't end with a zero.\n"); } if(do_hash(s) != e) { locate_problem(wrong_hash); fatal("Shared string hashed to wrong place.\n"); } if(s->hval != full_hash_value) fatal("Shared string hashed to other number.\n"); if(h>10000) { struct pike_string *s2; for(s2=s;s2;s2=s2->next) if(s2 == s) fatal("Shared string table is cyclic.\n"); h=0; } } } if(num != num_strings) fatal("Num strings is wrong %d!=%d\n",num,num_strings); full_hash_value = orig_full_hash; } int safe_debug_findstring(struct pike_string *foo) { unsigned INT32 e; if(!base_table) return 0; for(e=0;e<htable_size;e++) { struct pike_string *p; for(p=base_table[e];p;p=p->next) if(p==foo) return 1; } return 0; } struct pike_string *debug_findstring(const struct pike_string *foo) { struct pike_string *tmp; tmp=propagate_shared_string(foo, foo->hval % htable_size); #if 0 if(!tmp) { unsigned INT32 e; struct pike_string *tmp2; fprintf(stderr,"String %p %ld %ld %s\n", foo, (long)foo->hval, (long)foo->len, foo->str); StrHash(foo->str,foo->len); fprintf(stderr,"------ %p %ld\n", base_table[foo->hval %htable_size], (long)full_hash_value); for(tmp2=base_table[foo->hval % htable_size];tmp2;tmp2=tmp2->next) { if(tmp2 == tmp) fprintf(stderr,"!!%p!!->",tmp2); else fprintf(stderr,"%p->",tmp2); } fprintf(stderr,"0\n"); for(e=0;e<htable_size;e++) { for(tmp2=base_table[e];tmp2;tmp2=tmp2->next) { if(tmp2 == tmp) fprintf(stderr,"String found in hashbin %ld (not %ld)\n", (long)e, (long)(foo->hval % htable_size)); } } } #endif return tmp; } void debug_dump_pike_string(struct pike_string *s, INT32 max) { INT32 e; fprintf(stderr,"0x%p: %ld refs, len=%ld, hval=%lux (%lx)\n", s, (long)s->refs, (long)s->len, (unsigned long)s->hval, (unsigned long)StrHash(s->str, s->len)); fprintf(stderr," \""); for(e=0;e<s->len && max>0;e++) { int c=EXTRACT_UCHAR(s->str+e); switch(c) { case '\t': fprintf(stderr,"\\t"); max-=2; break; case '\n': fprintf(stderr,"\\n"); max-=2; break; case '\r': fprintf(stderr,"\\r"); max-=2; break; case '\b': fprintf(stderr,"\\b"); max-=2; break; default: if(is8bitalnum(c) || c==' ' || isgraph(c)) { putc(c,stderr); max--; }else{ fprintf(stderr,"\\%03o",c); max-=4; } } } if(!max) fprintf(stderr,"...\n"); else fprintf(stderr,"\"\n"); } void dump_stralloc_strings(void) { unsigned INT32 e; struct pike_string *p; for(e=0;e<htable_size;e++) for(p=base_table[e];p;p=p->next) debug_dump_pike_string(p, 70); } #endif /*** String compare functions ***/ /* does not take locale into account */ int low_quick_binary_strcmp(char *a,INT32 alen, char *b,INT32 blen) { int tmp; if(alen > blen) { tmp=MEMCMP(a, b, blen); if(tmp) return tmp; return 1; }else if(alen < blen){ tmp=MEMCMP(a, b, alen); if(tmp) return tmp; return -1; }else{ return MEMCMP(a, b, alen); } } #ifndef HAVE_STRCOLL /* No locale function available */ static int low_binary_strcmp(char *a,INT32 alen, char *b,INT32 blen) { low_quick_binary_strcmp(a,alen,b,blen); } #else /* takes locale into account */ static int low_binary_strcmp(char *a,INT32 alen, char *b,INT32 blen) { INT32 tmp; while(alen>0 && blen>0) { tmp=strcoll(a,b); if(tmp) return (int)tmp; tmp=strlen(a)+1; a+=tmp; b+=tmp; alen-=tmp; blen-=tmp; } if(alen==blen) return 0; if(alen > blen) return 1; return -1; } #endif /* Does not take locale into account */ int my_quick_strcmp(struct pike_string *a,struct pike_string *b) { if(a==b) return 0; return low_quick_binary_strcmp(a->str,a->len,b->str,b->len); } /* Does take locale into account */ int my_strcmp(struct pike_string *a,struct pike_string *b) { if(a==b) return 0; return low_binary_strcmp(a->str,a->len,b->str,b->len); } struct pike_string *realloc_unlinked_string(struct pike_string *a, INT32 size) { struct pike_string *r; r=(struct pike_string *)realloc((char *)a, sizeof(struct pike_string)+((size+1)<<a->size_shift)); /* FIXME !! */ if(!r) { r=begin_shared_string(size); MEMCPY(r->str, a->str, a->len<<a->size_shift); free((char *)a); } r->len=size; low_set_index(r,size,0); return r; } /* Returns an unlinked string ready for end_shared_string */ struct pike_string *realloc_shared_string(struct pike_string *a, INT32 size) { struct pike_string *r; if(a->refs==1) { unlink_pike_string(a); return realloc_unlinked_string(a, size); }else{ r=begin_wide_shared_string(size,a->size_shift); MEMCPY(r->str, a->str, a->len<<a->size_shift); free_string(a); return r; } } /* Modify one index in a shared string * Not suitable for building new strings or changing multiple characters * within a string! * * Phew, this function become complicated when I inserted magic for wide * characters... */ struct pike_string *modify_shared_string(struct pike_string *a, INT32 index, INT32 c) { INT32 old_value; #ifdef DEBUG if(index<0 || index>=a->len) fatal("Index out of range in modify_shared_string()\n"); #endif old_value=index_shared_string(a,index); if(old_value==c) return a; /* First test if the string needs to be grown: * ie; the new value does not fit in the char size of * the old string */ if(min_magnitude(c) > a->size_shift) { /* String must be grown */ struct pike_string *b; switch(TWO_SIZES(min_magnitude(c),a->size_shift)) { case TWO_SIZES(1,0): b=begin_wide_shared_string(a->len,1); convert_0_to_1(STR1(b),a->str,a->len); STR1(b)[index]=c; return end_shared_string(b); case TWO_SIZES(2,0): b=begin_wide_shared_string(a->len,2); convert_0_to_2(STR2(b),a->str,a->len); STR2(b)[index]=c; return end_shared_string(b); case TWO_SIZES(2,1): b=begin_wide_shared_string(a->len,2); convert_1_to_2(STR2(b),STR1(a),a->len); STR2(b)[index]=c; return end_shared_string(b); default: fatal("Odd wide string conversion!\n"); } } /* Next we test if the new string can be shrunk * if all characters in the new string can fit in a string * of a lower magnitude, it must be shrunk */ if(min_magnitude(old_value) == a->size_shift && min_magnitude(c) < min_magnitude(old_value)) { /* We *might* need to shrink the string */ struct pike_string *b; int size,tmp; switch(a->size_shift) { case 0: fatal("Unshrinkable!\n"); case 1: /* Test if we *actually* can shrink it.. */ if(find_magnitude1(STR1(a),index)) break; if(find_magnitude1(STR1(a)+index+1,a->len-index-1)) break; b=begin_shared_string(a->len); convert_1_to_0(b->str,STR1(a),a->len); b->str[index]=c; free_string(a); return end_shared_string(b); case 2: /* Test if we *actually* can shrink it.. */ size=find_magnitude2(STR2(a),index); if(size==2) break; /* nope */ tmp=find_magnitude2(STR2(a)+index+1,a->len-index-1); if(tmp==2) break; /* nope */ size=MAXIMUM(MAXIMUM(size,tmp),min_magnitude(c)); switch(size) { case 0: b=begin_shared_string(a->len); convert_2_to_0(b->str,STR2(a),a->len); b->str[index]=c; free_string(a); return end_shared_string(b); case 1: b=begin_wide_shared_string(a->len,1); convert_2_to_1((unsigned INT16 *)b->str,STR2(a),a->len); STR1(b)[index]=c; free_string(a); return end_shared_string(b); } } } /* We now know that the string has the right character size */ if(a->refs==1) { /* One ref - destructive mode */ if(index>=HASH_PREFIX && index<a->len-8) { /* Doesn't change hash value - sneak it in there */ low_set_index(a,index,c); return a; }else{ unlink_pike_string(a); low_set_index(a,index,c); return end_shared_string(a); } }else{ struct pike_string *r; r=begin_wide_shared_string(a->len,a->size_shift); MEMCPY(r->str, a->str, a->len << a->size_shift); low_set_index(r,index,c); free_string(a); return end_shared_string(r); } } /*** Add strings ***/ struct pike_string *add_shared_strings(struct pike_string *a, struct pike_string *b) { struct pike_string *ret; int target_size=MAXIMUM(a->size_shift,b->size_shift); ret=begin_wide_shared_string(a->len+b->len,target_size); pike_string_cpy(ret->str,ret->size_shift,a); pike_string_cpy(ret->str+(a->len<<target_size),ret->size_shift,b); return end_shared_string(ret); } struct pike_string *add_and_free_shared_strings(struct pike_string *a, struct pike_string *b) { INT32 alen=a->len; if(a->size_shift == b->size_shift) { a=realloc_shared_string(a,alen + b->len); MEMCPY(a->str+(alen<<a->size_shift),b->str,b->len<<b->size_shift); free_string(b); return end_shared_string(a); }else{ struct pike_string *ret=add_shared_strings(a,b); free_string(a); free_string(b); return ret; } } int string_search(struct pike_string *haystack, struct pike_string *needle, int start) { struct generic_mem_searcher s; char *r; if(needle->size_shift > haystack->size_shift) return -1; init_generic_memsearcher(&s, needle->str, needle->len, needle->size_shift, haystack->len, haystack->size_shift); r=(char *)generic_memory_search(&s, haystack->str, haystack->len, haystack->size_shift); if(!r) return -1; return (r-haystack->str)>>haystack->size_shift; } /* WORK MARKER */ /*** replace function ***/ struct pike_string *string_replace(struct pike_string *str, struct pike_string *del, struct pike_string *to) { struct pike_string *ret; char *s,*tmp,*r,*end; struct mem_searcher searcher; if(!str->len) { add_ref(str); return str; } if(!del->len) { int e; ret=begin_shared_string(str->len + to->len * (str->len -1)); s=ret->str; *(s++)=str->str[0]; for(e=1;e<str->len;e++) { MEMCPY(s,to->str,to->len); s+=to->len; *(s++)=str->str[e]; } return end_shared_string(ret); } s=str->str; end=s+str->len; if(del->len == to->len) { init_memsearch(&searcher, del->str, del->len, str->len); ret=begin_shared_string(str->len); }else{ INT32 delimeters=0; init_memsearch(&searcher, del->str, del->len, str->len*2); while((s=memory_search(&searcher,s,end-s))) { delimeters++; s+=del->len; } if(!delimeters) { add_ref(str); return str; } ret=begin_shared_string(str->len + (to->len-del->len)*delimeters); } s=str->str; r=ret->str; while((tmp=memory_search(&searcher,s,end-s))) { MEMCPY(r,s,tmp-s); r+=tmp-s; MEMCPY(r,to->str,to->len); r+=to->len; s=tmp+del->len; } MEMCPY(r,s,end-s); return end_shared_string(ret); } /*** init/exit memory ***/ void init_shared_string_table(void) { for(hashprimes_entry=0;hashprimes[hashprimes_entry]<BEGIN_HASH_SIZE;hashprimes_entry++); htable_size=hashprimes[hashprimes_entry]; base_table=(struct pike_string **)xalloc(sizeof(struct pike_string *)*htable_size); MEMSET((char *)base_table,0,sizeof(struct pike_string *)*htable_size); } #ifdef DEBUG_MALLOC struct shared_string_location *all_shared_string_locations; #endif void cleanup_shared_string_table(void) { unsigned INT32 e; struct pike_string *s,*next; #if defined(DEBUG) && defined(DEBUG_MALLOC) while(all_shared_string_locations) { struct shared_string_location *x=all_shared_string_locations; all_shared_string_locations=x->next; free_string(x->s); x->s=0; } if(verbose_debug_exit) { INT32 num,size; count_memory_in_strings(&num,&size); if(num) { fprintf(stderr,"Strings left: %d (%d bytes) (zapped)\n",num,size); dump_stralloc_strings(); } } #endif for(e=0;e<htable_size;e++) { for(s=base_table[e];s;s=next) { next=s->next; #ifdef REALLY_FREE free((char *)s); #else s->next=0; #endif } base_table[e]=0; } free((char *)base_table); base_table=0; num_strings=0; } void count_memory_in_strings(INT32 *num, INT32 *size) { unsigned INT32 e, num_=0, size_=0; if(!base_table) { *num=*size=0; return; } size_+=htable_size * sizeof(struct pike_string *); for(e=0;e<htable_size;e++) { struct pike_string *p; for(p=base_table[e];p;p=p->next) { num_++; size_+=sizeof(struct pike_string)+(p->len<<p->size_shift); } } #ifdef DEBUG if(num_strings != num_) fatal("Num strings is wrong! %d!=%d.\n",num_strings, num_); #endif num[0]=num_; size[0]=size_; } void gc_mark_all_strings(void) { unsigned INT32 e; if(!base_table) return; for(e=0;e<htable_size;e++) { struct pike_string *p; for(p=base_table[e];p;p=p->next) gc_is_referenced(p); } } void init_string_builder(struct string_builder *s, int mag) { s->malloced=256; s->s=begin_wide_shared_string(256,mag); s->s->len=0; } void string_build_mkspace(struct string_builder *s, int chars, int mag) { if(mag > s->s->size_shift) { struct pike_string *n; int l=s->s->len+chars+s->malloced; n=begin_wide_shared_string(l,mag); pike_string_cpy(n->str,mag,s->s); n->len=s->s->len; s->malloced=l; free((char *)s->s); s->s=n; } else if(s->s->len+chars > s->malloced) { int newlen=MAXIMUM(s->malloced*2,s->s->len+chars); s->s=(struct pike_string *)realloc((char *)s->s, sizeof(struct pike_string)+ ((newlen+1)<<s->s->size_shift)); if(!s->s) fatal("Out of memory.\n"); s->malloced=newlen; } } void string_builder_putchar(struct string_builder *s, int ch) { INT32 i; string_build_mkspace(s,1,min_magnitude(ch)); i=s->s->len++; low_set_index(s->s,i,ch); } void string_builder_binary_strcat(struct string_builder *s, char *str, INT32 len) { string_build_mkspace(s,len,1); switch(s->s->size_shift) { case 0: convert_0_to_0(STR0(s->s)+s->s->len,str,len); break; case 1: convert_0_to_1(STR1(s->s)+s->s->len,str,len); break; case 2: convert_0_to_2(STR2(s->s)+s->s->len,str,len); break; default: fatal("Illegal magnitude!\n"); } s->s->len+=len; } void string_builder_strcat(struct string_builder *s, char *str) { string_builder_binary_strcat(s,str,strlen(str)); } void string_builder_shared_strcat(struct string_builder *s, struct pike_string *str) { string_build_mkspace(s,str->len,s->s->size_shift); pike_string_cpy(s->s->str + (s->s->len << s->s->size_shift), s->s->size_shift, str); s->s->len+=str->len; } struct pike_string *finish_string_builder(struct string_builder *s) { low_set_index(s->s,s->s->len,0); return end_shared_string(s->s); }

pike.git/ src/ stralloc.c > f44553884d05e0dd9033c52d03c1368467795a20 [Annotate]