pike.git/src/mapping.c:d5fdfa2b41f543fa12c0e62231dc07b95355e609

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 /*\ ||| 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" RCSID("$Id: mapping.c,v 1.16 1997/03/17 03:04:41 hubbe Exp $"); #include "main.h" #include "types.h" #include "object.h" #include "mapping.h" #include "svalue.h" #include "array.h" #include "pike_macros.h" #include "language.h" #include "error.h" #include "memory.h" #include "dynamic_buffer.h" #include "interpret.h" #include "las.h" #include "gc.h" #define AVG_LINK_LENGTH 4 #define MIN_LINK_LENGTH 1 #define MAP_SLOTS(X) ((X)?((X)+((X)>>4)+8):0) #define LOOP(m) for(e=0;e<m->hashsize;e++) for(k=m->hash[e];k;k=k->next) struct keypair { struct keypair *next; struct svalue ind, val; }; struct mapping *first_mapping; #ifdef DEBUG /* This function checks that the type field isn't lacking any bits. * It is used for debugging purposes only. */ static void check_mapping_type_fields(struct mapping *m) { INT32 e; struct keypair *k,**prev; TYPE_FIELD ind_types, val_types; ind_types=val_types=0; LOOP(m) { val_types |= 1 << k->val.type; ind_types |= 1 << k->ind.type; } if(val_types & ~(m->val_types)) fatal("Mapping value types out of order!\n"); if(ind_types & ~(m->ind_types)) fatal("Mapping indices types out of order!\n"); } #endif /* This function allocates the hash table and svalue space for a mapping * struct. The size is the max number of indices that can fit in the * allocated space. */ static void init_mapping(struct mapping *m, INT32 size) { char *tmp; INT32 e; INT32 hashsize,hashspace; #ifdef DEBUG if(size < 0) fatal("init_mapping with negative value.\n"); #endif if(size) { hashsize=size / AVG_LINK_LENGTH + 1; if(!(hashsize & 1)) hashsize++; hashspace=hashsize+1; e=sizeof(struct keypair)*size+ sizeof(struct keypair *)*hashspace; tmp=(char *)xalloc(e); m->hash=(struct keypair **) tmp; m->hashsize=hashsize; tmp+=sizeof(struct keypair *)*hashspace; MEMSET((char *)m->hash, 0, sizeof(struct keypair *) * m->hashsize); m->free_list=(struct keypair *) tmp; for(e=1;e<size;e++) m->free_list[e-1].next = m->free_list + e; m->free_list[e-1].next=0; }else{ m->hashsize=0; m->hash=0; m->free_list=0; } m->ind_types = 0; m->val_types = 0; m->size = 0; } /* This function allocates an empty mapping with room for 'size' values */ struct mapping *allocate_mapping(int size) { struct mapping *m; GC_ALLOC(); m=ALLOC_STRUCT(mapping); init_mapping(m,size); m->next = first_mapping; m->prev = 0; m->refs = 1; if(first_mapping) first_mapping->prev = m; first_mapping=m; return m; } /* This function should only be called by the free_mapping() macro. * It frees the storate used by the mapping. */ void really_free_mapping(struct mapping *m) { INT32 e; struct keypair *k; #ifdef DEBUG if(m->refs) fatal("really free mapping on mapping with nonzero refs.\n"); #endif LOOP(m) { free_svalue(& k->val); free_svalue(& k->ind); } if(m->prev) m->prev->next = m->next; else first_mapping = m->next; if(m->next) m->next->prev = m->prev; if(m->hash) free((char *)m->hash); free((char *)m); GC_FREE(); } /* This function is used to rehash a mapping without loosing the internal * order in each hash chain. This is to prevent mappings from becoming * very inefficient just after being rehashed. */ static void mapping_rehash_backwards(struct mapping *m, struct keypair *p) { unsigned INT32 h; struct keypair *tmp; if(!p) return; mapping_rehash_backwards(m,p->next); h=hash_svalue(& p->ind) % m->hashsize; tmp=m->free_list; m->free_list=tmp->next; tmp->next=m->hash[h]; m->hash[h]=tmp; tmp->ind=p->ind; tmp->val=p->val; m->size++; m->ind_types |= 1 << p->ind.type; m->val_types |= 1 << p->val.type; } /* This function re-allocates a mapping. It adjusts the max no. of * values can be fitted into the mapping. It takes a bit of time to * run, but is used seldom enough not to degrade preformance significantly. */ static struct mapping *rehash(struct mapping *m, int new_size) { #ifdef DEBUG INT32 tmp=m->size; #endif INT32 e,hashsize; struct keypair *k,**hash; hashsize=m->hashsize; hash=m->hash; init_mapping(m, new_size); if(hash) { for(e=0;e<hashsize;e++) mapping_rehash_backwards(m, hash[e]); free((char *)hash); } #ifdef DEBUG if(m->size != tmp) fatal("Rehash failed, size not same any more.\n"); #endif #ifdef DEBUG if(d_flag > 1) check_mapping_type_fields(m); #endif return m; } /* This function brings the type fields in the mapping up to speed. * I only use it when the type fields MUST be correct, which is not * very often. */ void mapping_fix_type_field(struct mapping *m) { INT32 e; struct keypair *k; TYPE_FIELD ind_types, val_types; val_types = ind_types = 0; LOOP(m) { val_types |= 1 << k->val.type; ind_types |= 1 << k->ind.type; } #ifdef DEBUG if(val_types & ~(m->val_types)) fatal("Mapping value types out of order!\n"); if(ind_types & ~(m->ind_types)) fatal("Mapping indices types out of order!\n"); #endif m->val_types = val_types; m->ind_types = ind_types; } /* This function inserts key:val into the mapping m. * Same as doing m[key]=val; in pike. */ void mapping_insert(struct mapping *m, struct svalue *key, struct svalue *val) { unsigned INT32 h,h2; struct keypair *k, **prev; h2=hash_svalue(key); if(m->hashsize) { h=h2 % m->hashsize; #ifdef DEBUG if(d_flag > 1) check_mapping_type_fields(m); #endif if(m->ind_types & (1 << key->type)) { for(prev= m->hash + h;k=*prev;prev=&k->next) { if(is_eq(& k->ind, key)) { *prev=k->next; k->next=m->hash[h]; m->hash[h]=k; m->val_types |= 1 << val->type; assign_svalue(& k->val, val); #ifdef DEBUG if(d_flag > 1) check_mapping_type_fields(m); #endif return; } } } }else{ h=0; } if(!(k=m->free_list)) { rehash(m, m->size * 2 + 2); h=h2 % m->hashsize; k=m->free_list; } m->free_list=k->next; k->next=m->hash[h]; m->hash[h]=k; m->ind_types |= 1 << key->type; m->val_types |= 1 << val->type; assign_svalue_no_free(& k->ind, key); assign_svalue_no_free(& k->val, val); m->size++; #ifdef DEBUG if(d_flag > 1) check_mapping_type_fields(m); #endif } union anything *mapping_get_item_ptr(struct mapping *m, struct svalue *key, TYPE_T t) { unsigned INT32 h, h2; struct keypair *k, **prev; h2=hash_svalue(key); if(m->hashsize) { h=h2 % m->hashsize; #ifdef DEBUG if(d_flag > 1) check_mapping_type_fields(m); #endif for(prev= m->hash + h;k=*prev;prev=&k->next) { if(is_eq(& k->ind, key)) { *prev=k->next; k->next=m->hash[h]; m->hash[h]=k; if(k->val.type == t) return & ( k->val.u ); #ifdef DEBUG if(d_flag > 1) check_mapping_type_fields(m); #endif return 0; } } }else{ h=0; } if(!(k=m->free_list)) { rehash(m, m->size * 2 + 2); h=h2 % m->hashsize; k=m->free_list; } m->free_list=k->next; k->next=m->hash[h]; m->hash[h]=k; assign_svalue_no_free(& k->ind, key); k->val.type=T_INT; k->val.subtype=NUMBER_NUMBER; k->val.u.integer=0; m->ind_types |= 1 << key->type; m->val_types |= BIT_INT; m->size++; if(t != T_INT) return 0; #ifdef DEBUG if(d_flag > 1) check_mapping_type_fields(m); #endif return & ( k->val.u ); } void map_delete(struct mapping *m, struct svalue *key) { unsigned INT32 h; struct keypair *k, **prev; if(!m->size) return; h=hash_svalue(key) % m->hashsize; for(prev= m->hash + h;k=*prev;prev=&k->next) { if(is_eq(& k->ind, key)) { *prev=k->next; free_svalue(& k->ind); free_svalue(& k->val); k->next=m->free_list; m->free_list=k; m->size--; if(m->size < (m->hashsize + 1) * MIN_LINK_LENGTH) rehash(m, MAP_SLOTS(m->size)); #ifdef DEBUG if(d_flag > 1) check_mapping_type_fields(m); #endif return; } } } void check_mapping_for_destruct(struct mapping *m) { INT32 e; struct keypair *k, **prev; TYPE_FIELD ind_types, val_types; #ifdef DEBUG if(d_flag > 1) check_mapping_type_fields(m); #endif if(!m->size) return; if((m->ind_types | m->val_types) & (BIT_OBJECT | BIT_FUNCTION)) { val_types = ind_types = 0; m->val_types |= BIT_INT; for(e=0;e<m->hashsize;e++) { for(prev= m->hash + e;k=*prev;) { check_destructed(& k->val); if((k->ind.type == T_OBJECT || k->ind.type == T_FUNCTION) && !k->ind.u.object->prog) { *prev=k->next; free_svalue(& k->ind); free_svalue(& k->val); k->next=m->free_list; m->free_list=k; m->size--; }else{ val_types |= 1 << k->val.type; ind_types |= 1 << k->ind.type; prev=&k->next; } } } if(MAP_SLOTS(m->size) < m->hashsize * MIN_LINK_LENGTH) rehash(m, MAP_SLOTS(m->size)); m->val_types = val_types; m->ind_types = ind_types; #ifdef DEBUG if(d_flag > 1) check_mapping_type_fields(m); #endif } } struct svalue *low_mapping_lookup(struct mapping *m, struct svalue *key) { unsigned INT32 h; struct keypair *k, **prev; #ifdef DEBUG if(d_flag > 1) check_mapping_type_fields(m); #endif if(!m->size) return 0; if((1 << key->type) & m->ind_types) { h=hash_svalue(key) % m->hashsize; for(prev= m->hash + h;k=*prev;prev=&k->next) { if(is_eq(& k->ind, key)) { *prev=k->next; k->next=m->hash[h]; m->hash[h]=k; return &k->val; } } } return 0; } struct svalue *low_mapping_string_lookup(struct mapping *m, struct pike_string *p) { struct svalue tmp; tmp.type=T_STRING; tmp.u.string=p; return low_mapping_lookup(m, &tmp); } void mapping_index_no_free(struct svalue *dest, struct mapping *m, struct svalue *key) { struct svalue *p; if(p=low_mapping_lookup(m,key)) { if(p->type==T_INT) p->subtype=NUMBER_NUMBER; assign_svalue_no_free(dest, p); }else{ dest->type=T_INT; dest->u.integer=0; dest->subtype=NUMBER_UNDEFINED; } } struct array *mapping_indices(struct mapping *m) { INT32 e; struct array *a; struct svalue *s; struct keypair *k; a=allocate_array(m->size); s=ITEM(a); LOOP(m) assign_svalue(s++, & k->ind); a->type_field = m->ind_types; #ifdef DEBUG if(d_flag > 1) check_mapping_type_fields(m); #endif return a; } struct array *mapping_values(struct mapping *m) { INT32 e; struct keypair *k; struct array *a; struct svalue *s; a=allocate_array(m->size); s=ITEM(a); LOOP(m) assign_svalue(s++, & k->val); a->type_field = m->val_types; #ifdef DEBUG if(d_flag > 1) check_mapping_type_fields(m); #endif return a; } void mapping_replace(struct mapping *m,struct svalue *from, struct svalue *to) { INT32 e; struct keypair *k; LOOP(m) if(is_eq(& k->val, from)) assign_svalue(& k->val, to); m->val_types |= 1 << to->type; #ifdef DEBUG if(d_flag > 1) check_mapping_type_fields(m); #endif } struct mapping *mkmapping(struct array *ind, struct array *val) { struct mapping *m; struct svalue *i,*v; INT32 e; #ifdef DEBUG if(ind->size != val->size) fatal("mkmapping on different sized arrays.\n"); #endif m=allocate_mapping(MAP_SLOTS(ind->size)); i=ITEM(ind); v=ITEM(val); for(e=0;e<ind->size;e++) mapping_insert(m, i++, v++); return m; } struct mapping *copy_mapping(struct mapping *m) { INT32 e; struct mapping *n; struct keypair *k; n=allocate_mapping(MAP_SLOTS(m->size)); LOOP(m) mapping_insert(n, &k->ind, &k->val); return n; } struct mapping *merge_mappings(struct mapping *a, struct mapping *b, INT32 op) { struct array *ai, *av; struct array *bi, *bv; struct array *ci, *cv; INT32 *zipper; struct mapping *m; ai=mapping_indices(a); av=mapping_values(a); zipper=get_set_order(ai); order_array(ai, zipper); order_array(av, zipper); free((char *)zipper); bi=mapping_indices(b); bv=mapping_values(b); zipper=get_set_order(bi); order_array(bi, zipper); order_array(bv, zipper); free((char *)zipper); zipper=merge(ai,bi,op); ci=array_zip(ai,bi,zipper); free_array(ai); free_array(bi); cv=array_zip(av,bv,zipper); free_array(av); free_array(bv); free((char *)zipper); m=mkmapping(ci, cv); free_array(ci); free_array(cv); return m; } struct mapping *add_mappings(struct svalue *argp, INT32 args) { struct mapping *ret,*a,*b; switch(args) { case 0: return allocate_mapping(0); case 1: return copy_mapping(argp->u.mapping); case 2: return merge_mappings(argp[0].u.mapping, argp[1].u.mapping, OP_ADD); case 3: a=merge_mappings(argp[0].u.mapping,argp[1].u.mapping,OP_ADD); ret=merge_mappings(a,argp[2].u.mapping,OP_ADD); free_mapping(a); return ret; default: a=add_mappings(argp,args/2); b=add_mappings(argp+args/2,args-args/2); ret=merge_mappings(a,b,OP_ADD); free_mapping(a); free_mapping(b); return ret; } } int mapping_equal_p(struct mapping *a, struct mapping *b, struct processing *p) { struct processing curr; struct keypair *k; INT32 e; if(a==b) return 1; if(a->size != b->size) return 0; curr.pointer_a = a; curr.pointer_b = b; curr.next = p; for( ;p ;p=p->next) if(p->pointer_a == (void *)a && p->pointer_b == (void *)b) return 1; check_mapping_for_destruct(a); check_mapping_for_destruct(b); LOOP(a) { struct svalue *s; if(s=low_mapping_lookup(b, & k->ind)) { if(!low_is_equal(s, &k->val, &curr)) return 0; }else{ return 0; } } return 1; } void describe_mapping(struct mapping *m,struct processing *p,int indent) { struct processing doing; INT32 e,d; struct keypair *k; char buf[40]; if(! m->size) { my_strcat("([ ])"); return; } doing.next=p; doing.pointer_a=(void *)m; for(e=0;p;e++,p=p->next) { if(p->pointer_a == (void *)m) { sprintf(buf,"@%ld",(long)e); my_strcat(buf); return; } } sprintf(buf,"([ /* %ld elements */\n",(long) m->size); my_strcat(buf); d=0; LOOP(m) { if(d) { my_strcat(",\n"); } else { d=1; } for(d=0; d<indent; d++) my_putchar(' '); describe_svalue(& k->ind, indent+2, p); my_putchar(':'); describe_svalue(& k->val, indent+2, p); } my_putchar('\n'); for(e=2; e<indent; e++) my_putchar(' '); my_strcat("])"); } node * make_node_from_mapping(struct mapping *m) { struct keypair *k; INT32 e; mapping_fix_type_field(m); if((m->ind_types | m->val_types) & (BIT_FUNCTION | BIT_OBJECT)) { struct array *ind, *val; node *n; ind=mapping_indices(m); val=mapping_indices(m); n=mkefuncallnode("mkmapping", mknode(F_ARG_LIST, make_node_from_array(ind), make_node_from_array(val))); free_array(ind); free_array(val); return n; }else{ struct svalue s; if(!m->size) return mkefuncallnode("aggregate_mapping",0); s.type=T_MAPPING; s.subtype=0; s.u.mapping=m; return mkconstantsvaluenode(&s); } } void f_m_delete(INT32 args) { if(args < 2) error("Too few arguments to m_delete.\n"); if(sp[-args].type != T_MAPPING) error("Bad argument to to m_delete.\n"); map_delete(sp[-args].u.mapping,sp+1-args); pop_n_elems(args-1); } void f_aggregate_mapping(INT32 args) { INT32 e; struct keypair *k; struct mapping *m; if(args & 1) error("Uneven number of arguments to aggregate_mapping.\n"); m=allocate_mapping(MAP_SLOTS(args / 2)); for(e=-args;e<0;e+=2) mapping_insert(m, sp+e, sp+e+1); pop_n_elems(args); push_mapping(m); } struct mapping *copy_mapping_recursively(struct mapping *m, struct processing *p) { struct processing doing; struct mapping *ret; INT32 e; struct keypair *k; doing.next=p; doing.pointer_a=(void *)m; for(;p;p=p->next) { if(p->pointer_a == (void *)m) { ret=(struct mapping *)p->pointer_b; ret->refs++; return ret; } } ret=allocate_mapping(MAP_SLOTS(m->size)); doing.pointer_b=ret; check_stack(2); LOOP(m) { copy_svalues_recursively_no_free(sp,&k->ind, 1, p); sp++; copy_svalues_recursively_no_free(sp,&k->val, 1, p); sp++; mapping_insert(ret, sp-2, sp-1); pop_n_elems(2); } return ret; } void mapping_search_no_free(struct svalue *to, struct mapping *m, struct svalue *look_for, struct svalue *start) { unsigned INT32 h; struct keypair *k; if(m->size) { h=0; k=m->hash[h]; if(start) { h=hash_svalue(start) % m->hashsize; for(k=m->hash[h];k;k=k->next) if(is_eq(&k->ind, start)) break; if(!k) { to->type=T_INT; to->subtype=NUMBER_UNDEFINED; to->u.integer=0; return; } k=k->next; } while(h < (unsigned INT32)m->hashsize) { while(k) { if(is_eq(look_for, &k->val)) { assign_svalue_no_free(to,&k->ind); return; } k=k->next; } k=m->hash[++h]; } } to->type=T_INT; to->subtype=NUMBER_UNDEFINED; to->u.integer=0; } #ifdef DEBUG void check_mapping(struct mapping *m) { if(m->refs <=0) fatal("Mapping has zero refs.\n"); if(m->next && m->next->prev != m) fatal("Mapping ->next->prev != mapping.\n"); if(m->prev) { if(m->prev->next != m) fatal("Mapping ->prev->next != mapping.\n"); }else{ if(first_mapping != m) fatal("Mapping ->prev == 0 but first_mapping != mapping.\n"); } if(m->hashsize < 0) fatal("Assert: I don't think he's going to make it Jim.\n"); if(m->size < 0) fatal("Core breach, evacuate ship!\n"); if(m->size > (m->hashsize + 3) * AVG_LINK_LENGTH) fatal("Pretty mean hashtable there buster!.\n"); if(m->size < (m->hashsize - 3) * MIN_LINK_LENGTH) fatal("Hashsize is too small for mapping.\n"); if(m->size > 0 && (!m->ind_types || !m->val_types)) fatal("Mapping type fields are... wrong.\n"); if(!m->hash && m->size) fatal("Hey! where did my hashtable go??\n"); } void check_all_mappings() { struct mapping *m; for(m=first_mapping;m;m=m->next) check_mapping(m); } #endif #ifdef GC2 void gc_mark_mapping_as_referenced(struct mapping *m) { INT32 e; struct keypair *k; if(gc_mark(m)) { if((m->ind_types | m->val_types) & BIT_COMPLEX) { LOOP(m) { /* We do not want to count this key:index pair if * the index is a destructed object or function */ if(((1 << k->ind.type) & (BIT_OBJECT | BIT_FUNCTION)) && !(k->ind.u.object->prog)) continue; gc_mark_svalues(&k->ind, 1); gc_mark_svalues(&k->val, 1); } } } } void gc_check_all_mappings() { INT32 e; struct keypair *k; struct mapping *m; for(m=first_mapping;m;m=m->next) { if((m->ind_types | m->val_types) & BIT_COMPLEX) { LOOP(m) { /* We do not want to count this key:index pair if * the index is a destructed object or function */ if(((1 << k->ind.type) & (BIT_OBJECT | BIT_FUNCTION)) && !(k->ind.u.object->prog)) continue; gc_check_svalues(&k->ind, 1); m->val_types |= gc_check_svalues(&k->val, 1); } #ifdef DEBUG if(d_flag > 1) check_mapping_type_fields(m); #endif } } } void gc_mark_all_mappings() { struct mapping *m; for(m=first_mapping;m;m=m->next) if(gc_is_referenced(m)) gc_mark_mapping_as_referenced(m); } void gc_free_all_unreferenced_mappings() { INT32 e; struct keypair *k; struct mapping *m,*next; for(m=first_mapping;m;m=next) { check_mapping_for_destruct(m); if(gc_do_free(m)) { m->refs++; for(e=0;e<m->hashsize;e++) { k=m->hash[e]; while(k) { free_svalue(&k->ind); free_svalue(&k->val); if(k->next) { k = k->next; } else { k->next=m->free_list; m->free_list=m->hash[e]; m->hash[e]=0; break; } } } m->size=0; next=m->next; free_mapping(m); }else{ next=m->next; } } } #endif /* GC2 */ void zap_all_mappings() { INT32 e; struct keypair *k; struct mapping *m,*next; for(m=first_mapping;m;m=next) { m->refs++; for(e=0;e<m->hashsize;e++) { while(k=m->hash[e]) { m->hash[e]=k->next; k->next=m->free_list; m->free_list=k; free_svalue(&k->ind); free_svalue(&k->val); } } m->size=0; next=m->next; /* free_mapping(m); */ } } void count_memory_in_mappings(INT32 *num_, INT32 *size_) { INT32 num=0, size=0; struct mapping *m; for(m=first_mapping;m;m=m->next) { struct keypair *k; num++; size+=sizeof(struct mapping)+ sizeof(struct keypair *) * m->hashsize+ sizeof(struct keypair) * m->size; for(k=m->free_list;k;k=k->next) size+=sizeof(struct keypair); } *num_=num; *size_=size; }

pike.git/ src/ mapping.c > d5fdfa2b41f543fa12c0e62231dc07b95355e609 [Annotate]