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
|
/* Sequential list data type implemented by a linked list.
Copyright (C) 2006-2018 Free Software Foundation, Inc.
Written by Bruno Haible <bruno@clisp.org>, 2006.
This program is free software: you can redistribute it and/or modify
it under the terms of the GNU General Public License as published by
the Free Software Foundation; either version 3 of the License, or
(at your option) any later version.
This program is distributed in the hope that it will be useful,
but WITHOUT ANY WARRANTY; without even the implied warranty of
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
GNU General Public License for more details.
You should have received a copy of the GNU General Public License
along with this program. If not, see <https://www.gnu.org/licenses/>. */
/* Common code of gl_linked_list.c and gl_linkedhash_list.c. */
/* If the symbol SIGNAL_SAFE_LIST is defined, the code is compiled in such
a way that a gl_list_t data structure may be used from within a signal
handler. The operations allowed in the signal handler are:
gl_list_iterator, gl_list_iterator_next, gl_list_iterator_free.
The list and node fields that are therefore accessed from the signal handler
are:
list->root, node->next, node->value.
We are careful to make modifications to these fields only in an order
that maintains the consistency of the list data structure at any moment,
and we use 'volatile' assignments to prevent the compiler from reordering
such assignments. */
#ifdef SIGNAL_SAFE_LIST
# define ASYNCSAFE(type) *(type volatile *)&
#else
# define ASYNCSAFE(type)
#endif
/* -------------------------- gl_list_t Data Type -------------------------- */
static gl_list_t
gl_linked_nx_create_empty (gl_list_implementation_t implementation,
gl_listelement_equals_fn equals_fn,
gl_listelement_hashcode_fn hashcode_fn,
gl_listelement_dispose_fn dispose_fn,
bool allow_duplicates)
{
struct gl_list_impl *list =
(struct gl_list_impl *) malloc (sizeof (struct gl_list_impl));
if (list == NULL)
return NULL;
list->base.vtable = implementation;
list->base.equals_fn = equals_fn;
list->base.hashcode_fn = hashcode_fn;
list->base.dispose_fn = dispose_fn;
list->base.allow_duplicates = allow_duplicates;
#if WITH_HASHTABLE
list->table_size = 11;
list->table =
(gl_hash_entry_t *) calloc (list->table_size, sizeof (gl_hash_entry_t));
if (list->table == NULL)
goto fail;
#endif
list->root.next = &list->root;
list->root.prev = &list->root;
list->count = 0;
return list;
#if WITH_HASHTABLE
fail:
free (list);
return NULL;
#endif
}
static gl_list_t
gl_linked_nx_create (gl_list_implementation_t implementation,
gl_listelement_equals_fn equals_fn,
gl_listelement_hashcode_fn hashcode_fn,
gl_listelement_dispose_fn dispose_fn,
bool allow_duplicates,
size_t count, const void **contents)
{
struct gl_list_impl *list =
(struct gl_list_impl *) malloc (sizeof (struct gl_list_impl));
gl_list_node_t tail;
if (list == NULL)
return NULL;
list->base.vtable = implementation;
list->base.equals_fn = equals_fn;
list->base.hashcode_fn = hashcode_fn;
list->base.dispose_fn = dispose_fn;
list->base.allow_duplicates = allow_duplicates;
#if WITH_HASHTABLE
{
size_t estimate = xsum (count, count / 2); /* 1.5 * count */
if (estimate < 10)
estimate = 10;
list->table_size = next_prime (estimate);
if (size_overflow_p (xtimes (list->table_size, sizeof (gl_hash_entry_t))))
goto fail1;
list->table =
(gl_hash_entry_t *) calloc (list->table_size, sizeof (gl_hash_entry_t));
if (list->table == NULL)
goto fail1;
}
#endif
list->count = count;
tail = &list->root;
for (; count > 0; contents++, count--)
{
gl_list_node_t node =
(struct gl_list_node_impl *) malloc (sizeof (struct gl_list_node_impl));
if (node == NULL)
goto fail2;
node->value = *contents;
#if WITH_HASHTABLE
node->h.hashcode =
(list->base.hashcode_fn != NULL
? list->base.hashcode_fn (node->value)
: (size_t)(uintptr_t) node->value);
/* Add node to the hash table. */
if (add_to_bucket (list, node) < 0)
{
free (node);
goto fail2;
}
#endif
/* Add node to the list. */
node->prev = tail;
tail->next = node;
tail = node;
}
tail->next = &list->root;
list->root.prev = tail;
return list;
fail2:
{
gl_list_node_t node;
for (node = tail; node != &list->root; )
{
gl_list_node_t prev = node->prev;
free (node);
node = prev;
}
}
#if WITH_HASHTABLE
free (list->table);
fail1:
#endif
free (list);
return NULL;
}
static size_t _GL_ATTRIBUTE_PURE
gl_linked_size (gl_list_t list)
{
return list->count;
}
static const void * _GL_ATTRIBUTE_PURE
gl_linked_node_value (gl_list_t list, gl_list_node_t node)
{
return node->value;
}
static int
gl_linked_node_nx_set_value (gl_list_t list, gl_list_node_t node,
const void *elt)
{
#if WITH_HASHTABLE
if (elt != node->value)
{
size_t new_hashcode =
(list->base.hashcode_fn != NULL
? list->base.hashcode_fn (elt)
: (size_t)(uintptr_t) elt);
if (new_hashcode != node->h.hashcode)
{
remove_from_bucket (list, node);
node->value = elt;
node->h.hashcode = new_hashcode;
if (add_to_bucket (list, node) < 0)
{
/* Out of memory. We removed node from a bucket but cannot add
it to another bucket. In order to avoid inconsistencies, we
must remove node entirely from the list. */
gl_list_node_t before_removed = node->prev;
gl_list_node_t after_removed = node->next;
ASYNCSAFE(gl_list_node_t) before_removed->next = after_removed;
after_removed->prev = before_removed;
list->count--;
free (node);
return -1;
}
}
else
node->value = elt;
}
#else
node->value = elt;
#endif
return 0;
}
static gl_list_node_t _GL_ATTRIBUTE_PURE
gl_linked_next_node (gl_list_t list, gl_list_node_t node)
{
return (node->next != &list->root ? node->next : NULL);
}
static gl_list_node_t _GL_ATTRIBUTE_PURE
gl_linked_previous_node (gl_list_t list, gl_list_node_t node)
{
return (node->prev != &list->root ? node->prev : NULL);
}
static const void * _GL_ATTRIBUTE_PURE
gl_linked_get_at (gl_list_t list, size_t position)
{
size_t count = list->count;
gl_list_node_t node;
if (!(position < count))
/* Invalid argument. */
abort ();
/* Here we know count > 0. */
if (position <= ((count - 1) / 2))
{
node = list->root.next;
for (; position > 0; position--)
node = node->next;
}
else
{
position = count - 1 - position;
node = list->root.prev;
for (; position > 0; position--)
node = node->prev;
}
return node->value;
}
static gl_list_node_t
gl_linked_nx_set_at (gl_list_t list, size_t position, const void *elt)
{
size_t count = list->count;
gl_list_node_t node;
if (!(position < count))
/* Invalid argument. */
abort ();
/* Here we know count > 0. */
if (position <= ((count - 1) / 2))
{
node = list->root.next;
for (; position > 0; position--)
node = node->next;
}
else
{
position = count - 1 - position;
node = list->root.prev;
for (; position > 0; position--)
node = node->prev;
}
#if WITH_HASHTABLE
if (elt != node->value)
{
size_t new_hashcode =
(list->base.hashcode_fn != NULL
? list->base.hashcode_fn (elt)
: (size_t)(uintptr_t) elt);
if (new_hashcode != node->h.hashcode)
{
remove_from_bucket (list, node);
node->value = elt;
node->h.hashcode = new_hashcode;
if (add_to_bucket (list, node) < 0)
{
/* Out of memory. We removed node from a bucket but cannot add
it to another bucket. In order to avoid inconsistencies, we
must remove node entirely from the list. */
gl_list_node_t before_removed = node->prev;
gl_list_node_t after_removed = node->next;
ASYNCSAFE(gl_list_node_t) before_removed->next = after_removed;
after_removed->prev = before_removed;
list->count--;
free (node);
return NULL;
}
}
else
node->value = elt;
}
#else
node->value = elt;
#endif
return node;
}
static gl_list_node_t _GL_ATTRIBUTE_PURE
gl_linked_search_from_to (gl_list_t list, size_t start_index, size_t end_index,
const void *elt)
{
size_t count = list->count;
if (!(start_index <= end_index && end_index <= count))
/* Invalid arguments. */
abort ();
{
#if WITH_HASHTABLE
size_t hashcode =
(list->base.hashcode_fn != NULL
? list->base.hashcode_fn (elt)
: (size_t)(uintptr_t) elt);
size_t bucket = hashcode % list->table_size;
gl_listelement_equals_fn equals = list->base.equals_fn;
if (!list->base.allow_duplicates)
{
/* Look for the first match in the hash bucket. */
gl_list_node_t found = NULL;
gl_list_node_t node;
for (node = (gl_list_node_t) list->table[bucket];
node != NULL;
node = (gl_list_node_t) node->h.hash_next)
if (node->h.hashcode == hashcode
&& (equals != NULL
? equals (elt, node->value)
: elt == node->value))
{
found = node;
break;
}
if (start_index > 0)
/* Look whether found's index is < start_index. */
for (node = list->root.next; ; node = node->next)
{
if (node == found)
return NULL;
if (--start_index == 0)
break;
}
if (end_index < count)
/* Look whether found's index is >= end_index. */
{
end_index = count - end_index;
for (node = list->root.prev; ; node = node->prev)
{
if (node == found)
return NULL;
if (--end_index == 0)
break;
}
}
return found;
}
else
{
/* Look whether there is more than one match in the hash bucket. */
bool multiple_matches = false;
gl_list_node_t first_match = NULL;
gl_list_node_t node;
for (node = (gl_list_node_t) list->table[bucket];
node != NULL;
node = (gl_list_node_t) node->h.hash_next)
if (node->h.hashcode == hashcode
&& (equals != NULL
? equals (elt, node->value)
: elt == node->value))
{
if (first_match == NULL)
first_match = node;
else
{
multiple_matches = true;
break;
}
}
if (multiple_matches)
{
/* We need the match with the smallest index. But we don't have
a fast mapping node -> index. So we have to walk the list. */
end_index -= start_index;
node = list->root.next;
for (; start_index > 0; start_index--)
node = node->next;
for (;
end_index > 0;
node = node->next, end_index--)
if (node->h.hashcode == hashcode
&& (equals != NULL
? equals (elt, node->value)
: elt == node->value))
return node;
/* The matches must have all been at indices < start_index or
>= end_index. */
return NULL;
}
else
{
if (start_index > 0)
/* Look whether first_match's index is < start_index. */
for (node = list->root.next; node != &list->root; node = node->next)
{
if (node == first_match)
return NULL;
if (--start_index == 0)
break;
}
if (end_index < list->count)
/* Look whether first_match's index is >= end_index. */
{
end_index = list->count - end_index;
for (node = list->root.prev; ; node = node->prev)
{
if (node == first_match)
return NULL;
if (--end_index == 0)
break;
}
}
return first_match;
}
}
#else
gl_listelement_equals_fn equals = list->base.equals_fn;
gl_list_node_t node = list->root.next;
end_index -= start_index;
for (; start_index > 0; start_index--)
node = node->next;
if (equals != NULL)
{
for (; end_index > 0; node = node->next, end_index--)
if (equals (elt, node->value))
return node;
}
else
{
for (; end_index > 0; node = node->next, end_index--)
if (elt == node->value)
return node;
}
return NULL;
#endif
}
}
static size_t _GL_ATTRIBUTE_PURE
gl_linked_indexof_from_to (gl_list_t list, size_t start_index, size_t end_index,
const void *elt)
{
size_t count = list->count;
if (!(start_index <= end_index && end_index <= count))
/* Invalid arguments. */
abort ();
{
#if WITH_HASHTABLE
/* Here the hash table doesn't help much. It only allows us to minimize
the number of equals() calls, by looking up first the node and then
its index. */
size_t hashcode =
(list->base.hashcode_fn != NULL
? list->base.hashcode_fn (elt)
: (size_t)(uintptr_t) elt);
size_t bucket = hashcode % list->table_size;
gl_listelement_equals_fn equals = list->base.equals_fn;
gl_list_node_t node;
/* First step: Look up the node. */
if (!list->base.allow_duplicates)
{
/* Look for the first match in the hash bucket. */
for (node = (gl_list_node_t) list->table[bucket];
node != NULL;
node = (gl_list_node_t) node->h.hash_next)
if (node->h.hashcode == hashcode
&& (equals != NULL
? equals (elt, node->value)
: elt == node->value))
break;
}
else
{
/* Look whether there is more than one match in the hash bucket. */
bool multiple_matches = false;
gl_list_node_t first_match = NULL;
for (node = (gl_list_node_t) list->table[bucket];
node != NULL;
node = (gl_list_node_t) node->h.hash_next)
if (node->h.hashcode == hashcode
&& (equals != NULL
? equals (elt, node->value)
: elt == node->value))
{
if (first_match == NULL)
first_match = node;
else
{
multiple_matches = true;
break;
}
}
if (multiple_matches)
{
/* We need the match with the smallest index. But we don't have
a fast mapping node -> index. So we have to walk the list. */
size_t index;
index = start_index;
node = list->root.next;
for (; start_index > 0; start_index--)
node = node->next;
for (;
index < end_index;
node = node->next, index++)
if (node->h.hashcode == hashcode
&& (equals != NULL
? equals (elt, node->value)
: elt == node->value))
return index;
/* The matches must have all been at indices < start_index or
>= end_index. */
return (size_t)(-1);
}
node = first_match;
}
/* Second step: Look up the index of the node. */
if (node == NULL)
return (size_t)(-1);
else
{
size_t index = 0;
for (; node->prev != &list->root; node = node->prev)
index++;
if (index >= start_index && index < end_index)
return index;
else
return (size_t)(-1);
}
#else
gl_listelement_equals_fn equals = list->base.equals_fn;
size_t index = start_index;
gl_list_node_t node = list->root.next;
for (; start_index > 0; start_index--)
node = node->next;
if (equals != NULL)
{
for (;
index < end_index;
node = node->next, index++)
if (equals (elt, node->value))
return index;
}
else
{
for (;
index < end_index;
node = node->next, index++)
if (elt == node->value)
return index;
}
return (size_t)(-1);
#endif
}
}
static gl_list_node_t
gl_linked_nx_add_first (gl_list_t list, const void *elt)
{
gl_list_node_t node =
(struct gl_list_node_impl *) malloc (sizeof (struct gl_list_node_impl));
if (node == NULL)
return NULL;
ASYNCSAFE(const void *) node->value = elt;
#if WITH_HASHTABLE
node->h.hashcode =
(list->base.hashcode_fn != NULL
? list->base.hashcode_fn (node->value)
: (size_t)(uintptr_t) node->value);
/* Add node to the hash table. */
if (add_to_bucket (list, node) < 0)
{
free (node);
return NULL;
}
#endif
/* Add node to the list. */
node->prev = &list->root;
ASYNCSAFE(gl_list_node_t) node->next = list->root.next;
node->next->prev = node;
ASYNCSAFE(gl_list_node_t) list->root.next = node;
list->count++;
#if WITH_HASHTABLE
hash_resize_after_add (list);
#endif
return node;
}
static gl_list_node_t
gl_linked_nx_add_last (gl_list_t list, const void *elt)
{
gl_list_node_t node =
(struct gl_list_node_impl *) malloc (sizeof (struct gl_list_node_impl));
if (node == NULL)
return NULL;
ASYNCSAFE(const void *) node->value = elt;
#if WITH_HASHTABLE
node->h.hashcode =
(list->base.hashcode_fn != NULL
? list->base.hashcode_fn (node->value)
: (size_t)(uintptr_t) node->value);
/* Add node to the hash table. */
if (add_to_bucket (list, node) < 0)
{
free (node);
return NULL;
}
#endif
/* Add node to the list. */
ASYNCSAFE(gl_list_node_t) node->next = &list->root;
node->prev = list->root.prev;
ASYNCSAFE(gl_list_node_t) node->prev->next = node;
list->root.prev = node;
list->count++;
#if WITH_HASHTABLE
hash_resize_after_add (list);
#endif
return node;
}
static gl_list_node_t
gl_linked_nx_add_before (gl_list_t list, gl_list_node_t node, const void *elt)
{
gl_list_node_t new_node =
(struct gl_list_node_impl *) malloc (sizeof (struct gl_list_node_impl));
if (new_node == NULL)
return NULL;
ASYNCSAFE(const void *) new_node->value = elt;
#if WITH_HASHTABLE
new_node->h.hashcode =
(list->base.hashcode_fn != NULL
? list->base.hashcode_fn (new_node->value)
: (size_t)(uintptr_t) new_node->value);
/* Add new_node to the hash table. */
if (add_to_bucket (list, new_node) < 0)
{
free (new_node);
return NULL;
}
#endif
/* Add new_node to the list. */
ASYNCSAFE(gl_list_node_t) new_node->next = node;
new_node->prev = node->prev;
ASYNCSAFE(gl_list_node_t) new_node->prev->next = new_node;
node->prev = new_node;
list->count++;
#if WITH_HASHTABLE
hash_resize_after_add (list);
#endif
return new_node;
}
static gl_list_node_t
gl_linked_nx_add_after (gl_list_t list, gl_list_node_t node, const void *elt)
{
gl_list_node_t new_node =
(struct gl_list_node_impl *) malloc (sizeof (struct gl_list_node_impl));
if (new_node == NULL)
return NULL;
ASYNCSAFE(const void *) new_node->value = elt;
#if WITH_HASHTABLE
new_node->h.hashcode =
(list->base.hashcode_fn != NULL
? list->base.hashcode_fn (new_node->value)
: (size_t)(uintptr_t) new_node->value);
/* Add new_node to the hash table. */
if (add_to_bucket (list, new_node) < 0)
{
free (new_node);
return NULL;
}
#endif
/* Add new_node to the list. */
new_node->prev = node;
ASYNCSAFE(gl_list_node_t) new_node->next = node->next;
new_node->next->prev = new_node;
ASYNCSAFE(gl_list_node_t) node->next = new_node;
list->count++;
#if WITH_HASHTABLE
hash_resize_after_add (list);
#endif
return new_node;
}
static gl_list_node_t
gl_linked_nx_add_at (gl_list_t list, size_t position, const void *elt)
{
size_t count = list->count;
gl_list_node_t new_node;
if (!(position <= count))
/* Invalid argument. */
abort ();
new_node = (struct gl_list_node_impl *) malloc (sizeof (struct gl_list_node_impl));
if (new_node == NULL)
return NULL;
ASYNCSAFE(const void *) new_node->value = elt;
#if WITH_HASHTABLE
new_node->h.hashcode =
(list->base.hashcode_fn != NULL
? list->base.hashcode_fn (new_node->value)
: (size_t)(uintptr_t) new_node->value);
/* Add new_node to the hash table. */
if (add_to_bucket (list, new_node) < 0)
{
free (new_node);
return NULL;
}
#endif
/* Add new_node to the list. */
if (position <= (count / 2))
{
gl_list_node_t node;
node = &list->root;
for (; position > 0; position--)
node = node->next;
new_node->prev = node;
ASYNCSAFE(gl_list_node_t) new_node->next = node->next;
new_node->next->prev = new_node;
ASYNCSAFE(gl_list_node_t) node->next = new_node;
}
else
{
gl_list_node_t node;
position = count - position;
node = &list->root;
for (; position > 0; position--)
node = node->prev;
ASYNCSAFE(gl_list_node_t) new_node->next = node;
new_node->prev = node->prev;
ASYNCSAFE(gl_list_node_t) new_node->prev->next = new_node;
node->prev = new_node;
}
list->count++;
#if WITH_HASHTABLE
hash_resize_after_add (list);
#endif
return new_node;
}
static bool
gl_linked_remove_node (gl_list_t list, gl_list_node_t node)
{
gl_list_node_t prev;
gl_list_node_t next;
#if WITH_HASHTABLE
/* Remove node from the hash table. */
remove_from_bucket (list, node);
#endif
/* Remove node from the list. */
prev = node->prev;
next = node->next;
ASYNCSAFE(gl_list_node_t) prev->next = next;
next->prev = prev;
list->count--;
if (list->base.dispose_fn != NULL)
list->base.dispose_fn (node->value);
free (node);
return true;
}
static bool
gl_linked_remove_at (gl_list_t list, size_t position)
{
size_t count = list->count;
gl_list_node_t removed_node;
if (!(position < count))
/* Invalid argument. */
abort ();
/* Here we know count > 0. */
if (position <= ((count - 1) / 2))
{
gl_list_node_t node;
gl_list_node_t after_removed;
node = &list->root;
for (; position > 0; position--)
node = node->next;
removed_node = node->next;
after_removed = node->next->next;
ASYNCSAFE(gl_list_node_t) node->next = after_removed;
after_removed->prev = node;
}
else
{
gl_list_node_t node;
gl_list_node_t before_removed;
position = count - 1 - position;
node = &list->root;
for (; position > 0; position--)
node = node->prev;
removed_node = node->prev;
before_removed = node->prev->prev;
node->prev = before_removed;
ASYNCSAFE(gl_list_node_t) before_removed->next = node;
}
#if WITH_HASHTABLE
remove_from_bucket (list, removed_node);
#endif
list->count--;
if (list->base.dispose_fn != NULL)
list->base.dispose_fn (removed_node->value);
free (removed_node);
return true;
}
static bool
gl_linked_remove (gl_list_t list, const void *elt)
{
gl_list_node_t node = gl_linked_search_from_to (list, 0, list->count, elt);
if (node != NULL)
return gl_linked_remove_node (list, node);
else
return false;
}
static void
gl_linked_list_free (gl_list_t list)
{
gl_listelement_dispose_fn dispose = list->base.dispose_fn;
gl_list_node_t node;
for (node = list->root.next; node != &list->root; )
{
gl_list_node_t next = node->next;
if (dispose != NULL)
dispose (node->value);
free (node);
node = next;
}
#if WITH_HASHTABLE
free (list->table);
#endif
free (list);
}
/* --------------------- gl_list_iterator_t Data Type --------------------- */
static gl_list_iterator_t
gl_linked_iterator (gl_list_t list)
{
gl_list_iterator_t result;
result.vtable = list->base.vtable;
result.list = list;
result.p = list->root.next;
result.q = &list->root;
#if defined GCC_LINT || defined lint
result.i = 0;
result.j = 0;
result.count = 0;
#endif
return result;
}
static gl_list_iterator_t
gl_linked_iterator_from_to (gl_list_t list,
size_t start_index, size_t end_index)
{
gl_list_iterator_t result;
size_t n1, n2, n3;
if (!(start_index <= end_index && end_index <= list->count))
/* Invalid arguments. */
abort ();
result.vtable = list->base.vtable;
result.list = list;
n1 = start_index;
n2 = end_index - start_index;
n3 = list->count - end_index;
/* Find the maximum among n1, n2, n3, so as to reduce the number of
loop iterations to n1 + n2 + n3 - max(n1,n2,n3). */
if (n1 > n2 && n1 > n3)
{
/* n1 is the maximum, use n2 and n3. */
gl_list_node_t node;
size_t i;
node = &list->root;
for (i = n3; i > 0; i--)
node = node->prev;
result.q = node;
for (i = n2; i > 0; i--)
node = node->prev;
result.p = node;
}
else if (n2 > n3)
{
/* n2 is the maximum, use n1 and n3. */
gl_list_node_t node;
size_t i;
node = list->root.next;
for (i = n1; i > 0; i--)
node = node->next;
result.p = node;
node = &list->root;
for (i = n3; i > 0; i--)
node = node->prev;
result.q = node;
}
else
{
/* n3 is the maximum, use n1 and n2. */
gl_list_node_t node;
size_t i;
node = list->root.next;
for (i = n1; i > 0; i--)
node = node->next;
result.p = node;
for (i = n2; i > 0; i--)
node = node->next;
result.q = node;
}
#if defined GCC_LINT || defined lint
result.i = 0;
result.j = 0;
result.count = 0;
#endif
return result;
}
static bool
gl_linked_iterator_next (gl_list_iterator_t *iterator,
const void **eltp, gl_list_node_t *nodep)
{
if (iterator->p != iterator->q)
{
gl_list_node_t node = (gl_list_node_t) iterator->p;
*eltp = node->value;
if (nodep != NULL)
*nodep = node;
iterator->p = node->next;
return true;
}
else
return false;
}
static void
gl_linked_iterator_free (gl_list_iterator_t *iterator)
{
}
/* ---------------------- Sorted gl_list_t Data Type ---------------------- */
static gl_list_node_t _GL_ATTRIBUTE_PURE
gl_linked_sortedlist_search (gl_list_t list, gl_listelement_compar_fn compar,
const void *elt)
{
gl_list_node_t node;
for (node = list->root.next; node != &list->root; node = node->next)
{
int cmp = compar (node->value, elt);
if (cmp > 0)
break;
if (cmp == 0)
return node;
}
return NULL;
}
static gl_list_node_t _GL_ATTRIBUTE_PURE
gl_linked_sortedlist_search_from_to (gl_list_t list,
gl_listelement_compar_fn compar,
size_t low, size_t high,
const void *elt)
{
size_t count = list->count;
if (!(low <= high && high <= list->count))
/* Invalid arguments. */
abort ();
high -= low;
if (high > 0)
{
/* Here we know low < count. */
size_t position = low;
gl_list_node_t node;
if (position <= ((count - 1) / 2))
{
node = list->root.next;
for (; position > 0; position--)
node = node->next;
}
else
{
position = count - 1 - position;
node = list->root.prev;
for (; position > 0; position--)
node = node->prev;
}
do
{
int cmp = compar (node->value, elt);
if (cmp > 0)
break;
if (cmp == 0)
return node;
node = node->next;
}
while (--high > 0);
}
return NULL;
}
static size_t _GL_ATTRIBUTE_PURE
gl_linked_sortedlist_indexof (gl_list_t list, gl_listelement_compar_fn compar,
const void *elt)
{
gl_list_node_t node;
size_t index;
for (node = list->root.next, index = 0;
node != &list->root;
node = node->next, index++)
{
int cmp = compar (node->value, elt);
if (cmp > 0)
break;
if (cmp == 0)
return index;
}
return (size_t)(-1);
}
static size_t _GL_ATTRIBUTE_PURE
gl_linked_sortedlist_indexof_from_to (gl_list_t list,
gl_listelement_compar_fn compar,
size_t low, size_t high,
const void *elt)
{
size_t count = list->count;
if (!(low <= high && high <= list->count))
/* Invalid arguments. */
abort ();
high -= low;
if (high > 0)
{
/* Here we know low < count. */
size_t index = low;
size_t position = low;
gl_list_node_t node;
if (position <= ((count - 1) / 2))
{
node = list->root.next;
for (; position > 0; position--)
node = node->next;
}
else
{
position = count - 1 - position;
node = list->root.prev;
for (; position > 0; position--)
node = node->prev;
}
do
{
int cmp = compar (node->value, elt);
if (cmp > 0)
break;
if (cmp == 0)
return index;
node = node->next;
index++;
}
while (--high > 0);
}
return (size_t)(-1);
}
static gl_list_node_t
gl_linked_sortedlist_nx_add (gl_list_t list, gl_listelement_compar_fn compar,
const void *elt)
{
gl_list_node_t node;
for (node = list->root.next; node != &list->root; node = node->next)
if (compar (node->value, elt) >= 0)
return gl_linked_nx_add_before (list, node, elt);
return gl_linked_nx_add_last (list, elt);
}
static bool
gl_linked_sortedlist_remove (gl_list_t list, gl_listelement_compar_fn compar,
const void *elt)
{
gl_list_node_t node;
for (node = list->root.next; node != &list->root; node = node->next)
{
int cmp = compar (node->value, elt);
if (cmp > 0)
break;
if (cmp == 0)
return gl_linked_remove_node (list, node);
}
return false;
}
|