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
|
/*
* AUTHOR
*
* Rob Mueller <cpan@robm.fastmail.fm>
*
* COPYRIGHT AND LICENSE
*
* Copyright (C) 2003 by FastMail IP Partners
*
* This library is free software; you can redistribute it and/or modify
* it under the same terms as Perl itself.
*
*/
#include <stdlib.h>
#include <stdio.h>
#include <string.h>
#include <time.h>
#include <errno.h>
#include <stdarg.h>
#include "mmap_cache.h"
#include "mmap_cache_internals.h"
/* Global time_override */
MU32 time_override = 0;
void mmc_set_time_override(MU32 set_time) {
time_override = set_time;
}
/* Default values for a new cache */
char * def_share_file = "/tmp/sharefile";
MU32 def_init_file = 0;
MU32 def_test_file = 0;
MU32 def_expire_time = 0;
MU32 def_c_num_pages = 89;
MU32 def_c_page_size = 65536;
MU32 def_start_slots = 89;
/*
* mmap_cache * mmc_new()
*
* Create a new cache object filled with default values. Values may
* be changed and once ready, you should call mmc_init() to actually
* open the cache file and mmap it.
*
*/
mmap_cache * mmc_new() {
mmap_cache * cache = (mmap_cache *)calloc(1, sizeof(mmap_cache));
cache->p_cur = NOPAGE;
cache->c_num_pages = def_c_num_pages;
cache->c_page_size = def_c_page_size;
cache->start_slots = def_start_slots;
cache->expire_time = def_expire_time;
cache->share_file = _mmc_get_def_share_filename(cache);
cache->permissions = 0640;
cache->init_file = def_init_file;
cache->test_file = def_test_file;
return cache;
}
int mmc_set_param(mmap_cache * cache, char * param, char * val) {
if (!strcmp(param, "init_file")) {
cache->init_file = atoi(val);
} else if (!strcmp(param, "test_file")) {
cache->test_file = atoi(val);
} else if (!strcmp(param, "page_size")) {
cache->c_page_size = atoi(val);
} else if (!strcmp(param, "num_pages")) {
cache->c_num_pages = atoi(val);
} else if (!strcmp(param, "expire_time")) {
cache->expire_time = atoi(val);
} else if (!strcmp(param, "share_file")) {
cache->share_file = val;
} else if (!strcmp(param, "permissions")) {
cache->permissions = atoi(val);
} else if (!strcmp(param, "start_slots")) {
cache->start_slots = atoi(val);
} else if (!strcmp(param, "catch_deadlocks")) {
cache->catch_deadlocks = atoi(val);
} else if (!strcmp(param, "enable_stats")) {
cache->enable_stats = atoi(val);
} else {
return _mmc_set_error(cache, 0, "Bad set_param parameter: %s", param);
}
return 0;
}
int mmc_get_param(mmap_cache * cache, char * param) {
if (!strcmp(param, "page_size")) {
return (int)cache->c_page_size;
} else if (!strcmp(param, "num_pages")) {
return (int)cache->c_num_pages;
} else if (!strcmp(param, "expire_time")) {
return (int)cache->expire_time;
} else {
return _mmc_set_error(cache, 0, "Bad set_param parameter: %s", param);
}
}
/*
* int mmc_init(mmap_cache * cache)
*
* Initialise the cache object, opening the share file and mmap'ing any
* memory.
*
*/
int mmc_init(mmap_cache * cache) {
int i, do_init;
MU32 c_num_pages, c_page_size;
MU64 c_size;
/* Need a share file */
if (!cache->share_file) {
return _mmc_set_error(cache, 0, "No share file specified");
}
/* Basic cache params */
c_num_pages = cache->c_num_pages;
ASSERT(c_num_pages >= 1 && c_num_pages <= 1000);
c_page_size = cache->c_page_size;
ASSERT(c_page_size >= 1024 && c_page_size <= 1024*1024*1024);
ASSERT(cache->start_slots >= 10 && cache->start_slots <= 500);
cache->c_size = c_size = (MU64)c_num_pages * c_page_size;
if ( mmc_open_cache_file(cache, &do_init) == -1) return -1;
/* Map file into memory */
if ( mmc_map_memory(cache) == -1) return -1;
/* Initialise pages if new file */
if (do_init) {
_mmc_init_page(cache, -1);
/* Unmap and re-map to stop gtop telling us our memory usage is up */
if ( mmc_unmap_memory(cache) == -1) return -1;
if ( mmc_map_memory(cache) == -1) return -1;
}
/* Test pages in file if asked */
if (cache->test_file) {
for (i = 0; i < cache->c_num_pages; i++) {
int lock_page = 0, bad_page = 0;
/* Need to lock page, which tests header structure */
if (mmc_lock(cache, i)) {
bad_page = 1;
/* If lock succeeded, test page structure */
} else {
lock_page = 1;
if (!_mmc_test_page(cache)) {
bad_page = 1;
}
}
/* If we locked, unlock */
if (lock_page) {
mmc_unlock(cache);
}
/* A bad page, initialise it */
if (bad_page) {
_mmc_init_page(cache, i);
/* Rerun test on this page, potential infinite
loop if init_page is broken, but then things
are really broken anyway */
i--;
}
}
}
return 0;
}
/*
* int mmc_close(mmap_cache * cache)
*
* Close the given cache, unmmap'ing any memory and closing file
* descriptors.
*
*/
int mmc_close(mmap_cache *cache) {
int res;
/* Shouldn't call if not init'ed */
ASSERT(cache->fh);
ASSERT(cache->mm_var);
/* Shouldn't call if page still locked */
ASSERT(cache->p_cur == NOPAGE);
/* Unlock any locked page */
if (cache->p_cur != NOPAGE) {
mmc_unlock(cache);
}
/* Close file */
if (cache->fh) {
mmc_close_fh(cache);
}
/* Unmap memory */
if (cache->mm_var) {
res = mmc_unmap_memory(cache);
if (res == -1) {
return _mmc_set_error(cache, errno, "Mmap of shared file %s failed", cache->share_file);
}
}
free(cache);
return 0;
}
char * mmc_error(mmap_cache * cache) {
if (cache->last_error)
return cache->last_error;
return "Unknown error";
}
/*
* mmc_lock(
* cache_mmap * cache, MU32 p_cur
* )
*
* Lock the given page number using fcntl locking. Setup
* cache->p_* fields with correct values for the given page
*
*/
int mmc_lock(mmap_cache * cache, MU32 p_cur) {
MU64 p_offset;
void * p_ptr;
/* Argument sanity check */
if (p_cur == NOPAGE || p_cur > cache->c_num_pages)
return _mmc_set_error(cache, 0, "page %u is NOPAGE or larger than number of pages", p_cur);
/* Check not already locked */
if (cache->p_cur != NOPAGE)
return _mmc_set_error(cache, 0, "page %u is already locked, can't lock multiple pages", cache->p_cur);
/* Setup page details */
p_offset = (MU64)p_cur * cache->c_page_size;
p_ptr = PTR_ADD(cache->mm_var, p_offset);
if (mmc_lock_page(cache, p_offset) == -1) return -1;
if (!(P_Magic(p_ptr) == 0x92f7e3b1))
return _mmc_set_error(cache, 0, "magic page start marker not found. p_cur is %u, offset is %llu", p_cur, p_offset);
/* Copy to cache structure */
cache->p_num_slots = P_NumSlots(p_ptr);
cache->p_free_slots = P_FreeSlots(p_ptr);
cache->p_old_slots = P_OldSlots(p_ptr);
cache->p_free_data = P_FreeData(p_ptr);
cache->p_free_bytes = P_FreeBytes(p_ptr);
cache->p_n_reads = P_NReads(p_ptr);
cache->p_n_read_hits = P_NReadHits(p_ptr);
/* Reality check */
if (cache->p_num_slots < 89 || cache->p_num_slots > cache->c_page_size)
return _mmc_set_error(cache, 0, "cache num_slots mistmatch");
if (cache->p_free_slots < 0 || cache->p_free_slots > cache->p_num_slots)
return _mmc_set_error(cache, 0, "cache free slots mustmatch");
if (cache->p_old_slots > cache->p_free_slots)
return _mmc_set_error(cache, 0, "cache old slots mistmatch");
if (cache->p_free_data + cache->p_free_bytes != cache->c_page_size)
return _mmc_set_error(cache, 0, "cache free data mistmatch");
/* Check page header */
ASSERT(P_Magic(p_ptr) == 0x92f7e3b1);
ASSERT(P_NumSlots(p_ptr) >= 89 && P_NumSlots(p_ptr) < cache->c_page_size);
ASSERT(P_FreeSlots(p_ptr) >= 0 && P_FreeSlots(p_ptr) <= P_NumSlots(p_ptr));
ASSERT(P_OldSlots(p_ptr) <= P_FreeSlots(p_ptr));
ASSERT(P_FreeData(p_ptr) + P_FreeBytes(p_ptr) == cache->c_page_size);
/* Setup page pointers */
cache->p_cur = p_cur;
cache->p_offset = p_offset;
cache->p_base = p_ptr;
cache->p_base_slots = PTR_ADD(p_ptr, P_HEADERSIZE);
ASSERT(_mmc_test_page(cache));
return 0;
}
/*
* mmc_unlock(
* cache_mmap * cache
* )
*
* Unlock any currently locked page
*
*/
int mmc_unlock(mmap_cache * cache) {
ASSERT(cache->p_cur != NOPAGE);
/* If changed, save page header changes back */
if (cache->p_changed) {
void * p_ptr = cache->p_base;
/* Save any changed information back to page */
P_NumSlots(p_ptr) = cache->p_num_slots;
P_FreeSlots(p_ptr) = cache->p_free_slots;
P_OldSlots(p_ptr) = cache->p_old_slots;
P_FreeData(p_ptr) = cache->p_free_data;
P_FreeBytes(p_ptr) = cache->p_free_bytes;
P_NReads(p_ptr) = cache->p_n_reads;
P_NReadHits(p_ptr) = cache->p_n_read_hits;
}
/* Test before unlocking */
ASSERT(_mmc_test_page(cache));
mmc_unlock_page(cache);
return 0;
}
/*
* mmc_is_locked(
* cache_mmap * cache
* )
*
* Return true if page is locked
*
*/
int mmc_is_locked(mmap_cache * cache) {
return cache->p_cur != NOPAGE ? 1 : 0;
}
/*
* int mmc_hash(
* cache_mmap * cache,
* void *key_ptr, int key_len,
* MU32 *hash_page, MU32 *hash_slot
* )
*
* Hashes the given key, and returns hash value, hash page and hash
* slot part
*
*/
int mmc_hash(
mmap_cache *cache,
void *key_ptr, int key_len,
MU32 *hash_page, MU32 *hash_slot
) {
MU32 h = 0x92f7e3b1;
unsigned char * uc_key_ptr = (unsigned char *)key_ptr;
unsigned char * uc_key_ptr_end = uc_key_ptr + key_len;
while (uc_key_ptr != uc_key_ptr_end) {
h = (h << 4) + (h >> 28) + *uc_key_ptr++;
}
*hash_page = h % cache->c_num_pages;
*hash_slot = h / cache->c_num_pages;
return 0;
}
/*
* int mmc_read(
* cache_mmap * cache, MU32 hash_slot,
* void *key_ptr, int key_len,
* void **val_ptr, int *val_len,
* MU32 *expire_on, MU32 *flags
* )
*
* Read key from current page
*
*/
int mmc_read(
mmap_cache *cache, MU32 hash_slot,
void *key_ptr, int key_len,
void **val_ptr, int *val_len,
MU32 *expire_on_p, MU32 *flags_p
) {
MU32 * slot_ptr;
/* Increase read count for page */
if (cache->enable_stats) {
cache->p_changed = 1;
cache->p_n_reads++;
}
/* Search slots for key */
slot_ptr = _mmc_find_slot(cache, hash_slot, key_ptr, key_len, 0);
/* Did we find a value? */
if (!slot_ptr || *slot_ptr == 0) {
/* Return -1 if not */
return -1;
/* We found it! Check some other things... */
} else {
MU32 * base_det = S_Ptr(cache->p_base, *slot_ptr);
MU32 now = time_override ? time_override : (MU32)time(0);
MU32 expire_on = S_ExpireOn(base_det);
/* Sanity check hash matches */
ASSERT(S_SlotHash(base_det) == hash_slot);
/* Value expired? */
if (expire_on && now >= expire_on) {
/* Return not found, but leave slot. Might need writeback */
return -1;
}
/* Update hit time */
S_LastAccess(base_det) = now;
/* Copy values to pointers */
*flags_p = S_Flags(base_det);
*expire_on_p = expire_on;
*val_len = S_ValLen(base_det);
*val_ptr = S_ValPtr(base_det);
/* Increase read hit count */
if (cache->enable_stats)
cache->p_n_read_hits++;
return 0;
}
}
/*
* int mmc_write(
* cache_mmap * cache, MU32 hash_slot,
* void *key_ptr, int key_len,
* void *val_ptr, int val_len,
* MU32 expire_on, MU32 flags
* )
*
* Write key to current page
*
*/
int mmc_write(
mmap_cache *cache, MU32 hash_slot,
void *key_ptr, int key_len,
void *val_ptr, int val_len,
MU32 expire_on, MU32 flags
) {
int did_store = 0;
MU32 kvlen = KV_SlotLen(key_len, val_len);
/* Search for slot with given key */
MU32 * slot_ptr = _mmc_find_slot(cache, hash_slot, key_ptr, key_len, 1);
/* If all slots full, definitely can't store */
if (!slot_ptr)
return 0;
ROUNDLEN(kvlen);
ASSERT(cache->p_cur != NOPAGE);
/* If found, delete slot for new value */
if (*slot_ptr > 1) {
_mmc_delete_slot(cache, slot_ptr);
ASSERT(*slot_ptr == 1);
}
ASSERT(*slot_ptr <= 1);
/* If there's space, store the key/value in the data section */
if (cache->p_free_bytes >= kvlen) {
MU32 * base_det = PTR_ADD(cache->p_base, cache->p_free_data);
MU32 now = time_override ? time_override : (MU32)time(0);
/* Calculate expiry time */
if (expire_on == (MU32)-1)
expire_on = cache->expire_time ? now + cache->expire_time : 0;
/* Store info into slot */
S_LastAccess(base_det) = now;
S_ExpireOn(base_det) = expire_on;
S_SlotHash(base_det) = hash_slot;
S_Flags(base_det) = flags;
S_KeyLen(base_det) = (MU32)key_len;
S_ValLen(base_det) = (MU32)val_len;
/* Copy key/value to data section */
memcpy(S_KeyPtr(base_det), key_ptr, key_len);
memcpy(S_ValPtr(base_det), val_ptr, val_len);
/* Update used slots/free data info */
cache->p_free_slots--;
if (*slot_ptr == 1) { cache->p_old_slots--; }
/* Save new data offset */
*slot_ptr = cache->p_free_data;
/* Update free space */
cache->p_free_bytes -= kvlen;
cache->p_free_data += kvlen;
/* Ensure changes are saved back */
cache->p_changed = 1;
did_store = 1;
}
return did_store;
}
/*
* int mmc_delete(
* cache_mmap * cache, MU32 hash_slot,
* void *key_ptr, int key_len
* )
*
* Delete key from current page
*
*/
int mmc_delete(
mmap_cache *cache, MU32 hash_slot,
void *key_ptr, int key_len,
MU32 * flags
) {
/* Search slots for key */
MU32 * slot_ptr = _mmc_find_slot(cache, hash_slot, key_ptr, key_len, 2);
/* Did we find a value? */
if (!slot_ptr || *slot_ptr == 0) {
/* Return 0 if not deleted */
return 0;
/* We found it, delete it */
} else {
/* Store flags in output pointer */
MU32 * base_det = S_Ptr(cache->p_base, *slot_ptr);
*flags = S_Flags(base_det);
_mmc_delete_slot(cache, slot_ptr);
return 1;
}
}
int last_access_cmp(const void * a, const void * b) {
MU32 av = S_LastAccess(*(MU32 **)a);
MU32 bv = S_LastAccess(*(MU32 **)b);
if (av < bv) return -1;
if (av > bv) return 1;
return 0;
}
/*
* int mmc_calc_expunge(
* cache_mmap * cache, int mode, int len, MU32 * new_num_slots, MU32 *** to_expunge
* )
*
* Calculate entries to expunge from current page.
*
* If len >= 0
* If space available for len bytes & >30% slots free, nothing is expunged
* If len < 0 or not above
* If mode == 0, only expired items are expunged
* If mode == 1, all entries are expunged
* If mode == 2, entries are expunged till 40% free space is created
*
* If expunged is non-null pointer, result is filled with
* a list of slots to expunge
*
* Return value is number of items to expunge
*
*/
int mmc_calc_expunge(
mmap_cache * cache,
int mode, int len,
MU32 * new_num_slots, MU32 *** to_expunge
) {
double slots_pct;
ASSERT(cache->p_cur != NOPAGE);
/* If len >= 0, and space available for len bytes, nothing is expunged */
if (len >= 0) {
/* Length of key/value data when stored */
MU32 kvlen = KV_SlotLen(len, 0);
ROUNDLEN(kvlen);
slots_pct = (double)(cache->p_free_slots - cache->p_old_slots) / cache->p_num_slots;
/* Nothing to do if hash table more than 30% free slots and enough free space */
if (slots_pct > 0.3 && cache->p_free_bytes >= kvlen)
return 0;
}
{
MU32 num_slots = cache->p_num_slots;
MU32 used_slots = num_slots - cache->p_free_slots;
MU32 * slot_ptr = cache->p_base_slots;
MU32 * slot_end = slot_ptr + num_slots;
/* Store pointers to used slots */
MU32 ** copy_base_det = (MU32 **)calloc(used_slots, sizeof(MU32 *));
MU32 ** copy_base_det_end = copy_base_det + used_slots;
MU32 ** copy_base_det_out = copy_base_det;
MU32 ** copy_base_det_in = copy_base_det + used_slots;
MU32 page_data_size = cache->c_page_size - num_slots * 4 - P_HEADERSIZE;
MU32 in_slots, data_thresh, used_data = 0;
MU32 now = time_override ? time_override : (MU32)time(0);
/* Loop for each existing slot, and store in a list */
for (; slot_ptr != slot_end; slot_ptr++) {
MU32 data_offset = *slot_ptr;
MU32 * base_det = S_Ptr(cache->p_base, data_offset);
MU32 expire_on, kvlen;
/* Ignore if if free slot */
if (data_offset <= 1) {
continue;
}
/* Definitely out if mode == 1 which means expunge all */
if (mode == 1) {
*copy_base_det_out++ = base_det;
continue;
}
/* Definitely out if expired, and not dirty */
expire_on = S_ExpireOn(base_det);
if (expire_on && now >= expire_on) {
*copy_base_det_out++ = base_det;
continue;
}
/* Track used space */
kvlen = S_SlotLen(base_det);
ROUNDLEN(kvlen);
ASSERT(kvlen <= page_data_size);
used_data += kvlen;
ASSERT(used_data <= page_data_size);
/* Potentially in */
*--copy_base_det_in = base_det;
}
/* Check that definitely in and out slots add up to used slots */
ASSERT(copy_base_det_in == copy_base_det_out);
ASSERT(mode != 1 || copy_base_det_out == copy_base_det_end);
/* Increase slot count if free count is low and there's space to increase */
slots_pct = (double)(copy_base_det_end - copy_base_det_out) / num_slots;
if (slots_pct > 0.3 && (page_data_size - used_data > (num_slots + 1) * 4 || mode == 2)) {
num_slots = (num_slots * 2) + 1;
}
page_data_size = cache->c_page_size - num_slots * 4 - P_HEADERSIZE;
/* If mode == 0 or 1, we've just worked out ones to keep and
* which to dispose of, so return results */
if (mode == 0 || mode == 1) {
*to_expunge = copy_base_det;
*new_num_slots = num_slots;
return (copy_base_det_out - copy_base_det);
}
/* mode == 2, sort by last access, and remove till enough free space */
/* Sort those potentially in by last access */
in_slots = copy_base_det_end - copy_base_det_in;
qsort((void *)copy_base_det_in, in_slots, sizeof(MU32 *), &last_access_cmp);
/* Throw out old slots till we have 40% free data space */
data_thresh = (MU32)(0.6 * page_data_size);
while (copy_base_det_in != copy_base_det_end && used_data >= data_thresh) {
MU32 * slot_ptr = *copy_base_det_in;
MU32 kvlen = S_SlotLen(slot_ptr);
ROUNDLEN(kvlen);
ASSERT(kvlen <= page_data_size);
used_data -= kvlen;
ASSERT(used_data >= 0);
copy_base_det_out = ++copy_base_det_in;
}
ASSERT(used_data < page_data_size);
*to_expunge = copy_base_det;
*new_num_slots = num_slots;
return (copy_base_det_out - copy_base_det);
}
}
/*
* int mmc_do_expunge(
* cache_mmap * cache, int num_expunge, MU32 new_num_slots, MU32 ** to_expunge
* )
*
* Expunge given entries from current page.
*
*/
int mmc_do_expunge(
mmap_cache * cache,
int num_expunge, MU32 new_num_slots, MU32 ** to_expunge
) {
MU32 * base_slots = cache->p_base_slots;
MU32 ** to_keep = to_expunge + num_expunge;
MU32 ** to_keep_end = to_expunge + (cache->p_num_slots - cache->p_free_slots);
MU32 new_used_slots = (to_keep_end - to_keep);
/* Build new slots data and KV data */
MU32 slot_data_size = new_num_slots * 4;
MU32 * new_slot_data = (MU32 *)calloc(1, slot_data_size);
MU32 page_data_size = cache->c_page_size - new_num_slots * 4 - P_HEADERSIZE;
void * new_kv_data = calloc(1, page_data_size);
MU32 new_offset = 0;
/* Sanity check underlying fd is still the same file */
if (!mmc_check_fh(cache))
return 0;
/* Start all new slots empty */
memset(new_slot_data, 0, slot_data_size);
/* Copy entries to keep to new slot entires and data sections */
for (;to_keep < to_keep_end; to_keep++) {
MU32 * old_base_det = *to_keep;
MU32 * new_slot_ptr;
MU32 kvlen;
/* Hash key to find starting slot */
MU32 slot = S_SlotHash(old_base_det) % new_num_slots;
#ifdef DEBUG
/* Check hash actually matches stored value */
{
MU32 hash_page_dummy, hash_slot;
mmc_hash(cache, S_KeyPtr(old_base_det), S_KeyLen(old_base_det), &hash_page_dummy, &hash_slot);
ASSERT(hash_slot == S_SlotHash(old_base_det));
}
#endif
/* Find free slot */
new_slot_ptr = new_slot_data + slot;
while (*new_slot_ptr) {
if (++slot >= new_num_slots) { slot = 0; }
new_slot_ptr = new_slot_data + slot;
}
/* Copy slot and KV data */
kvlen = S_SlotLen(old_base_det);
memcpy(PTR_ADD(new_kv_data, new_offset), old_base_det, kvlen);
/* Store slot data and mark as used */
*new_slot_ptr = new_offset + new_num_slots * 4 + P_HEADERSIZE;
ROUNDLEN(kvlen);
new_offset += kvlen;
}
ASSERT(new_offset <= page_data_size);
/* printf("page=%d\n", cache->p_cur);
printf("old_slots=%d, new_slots=%d\n", old_num_slots, new_num_slots);
printf("old_used_slots=%d, new_used_slots=%d\n", old_used_slots, new_used_slots);*/
/* Store back into mmap'ed file space */
memcpy(base_slots, new_slot_data, slot_data_size);
memcpy(base_slots + new_num_slots, new_kv_data, new_offset);
cache->p_num_slots = new_num_slots;
cache->p_free_slots = new_num_slots - new_used_slots;
cache->p_old_slots = 0;
cache->p_free_data = new_offset + new_num_slots * 4 + P_HEADERSIZE;
cache->p_free_bytes = page_data_size - new_offset;
/* Make sure changes are saved back to mmap'ed file */
cache->p_changed = 1;
/* Free allocated memory */
free(new_kv_data);
free(new_slot_data);
free(to_expunge);
ASSERT(_mmc_test_page(cache));
return 1;
}
/*
* void mmc_get_page_details(mmap_cache * cache, MU32 * n_reads, MU32 * n_read_hits)
*
* Return details about the current locked page. Currently just
* number of reads and number of reads that hit
*
*/
void mmc_get_page_details(mmap_cache * cache, MU32 * n_reads, MU32 * n_read_hits) {
*n_reads = cache->p_n_reads;
*n_read_hits = cache->p_n_read_hits;
return;
}
/*
* void mmc_reset_page_details(mmap_cache * cache)
*
* Reset any page details (currently just read hits)
*
*/
void mmc_reset_page_details(mmap_cache * cache) {
cache->p_n_reads = 0;
cache->p_n_read_hits = 0;
cache->p_changed = 1;
return;
}
/*
* mmap_cache_it * mmc_iterate_new(mmap_cache * cache)
*
* Setup a new iterator to iterate over stored items
* in the cache
*
*/
mmap_cache_it * mmc_iterate_new(mmap_cache * cache) {
mmap_cache_it * it = (mmap_cache_it *)calloc(1, sizeof(mmap_cache_it));
it->cache = cache;
it->p_cur = NOPAGE;
return it;
}
/*
* MU32 * mmc_iterate_next(mmap_cache_it * it)
*
* Move iterator to next item in the cache and return
* pointer to details (0 if there is no next).
*
* You can retrieve details with mmc_get_details(...)
*
*/
MU32 * mmc_iterate_next(mmap_cache_it * it) {
mmap_cache * cache = it->cache;
MU32 * slot_ptr = it->slot_ptr;
MU32 * base_det;
MU32 expire_on;
MU32 now = time_override ? time_override : (MU32)time(0);
/* Go until we find a slot or exit */
while (1) {
/* End of page ... */
if (slot_ptr == it->slot_ptr_end) {
if (it->p_cur == NOPAGE) {
it->p_cur = 0;
/* Unlock current page if any */
} else {
mmc_unlock(it->cache);
/* Move to the next page, return 0 if no more pages */
if (++it->p_cur == cache->c_num_pages) {
it->p_cur = NOPAGE;
it->slot_ptr = 0;
return 0;
}
}
/* Lock the new page number */
mmc_lock(it->cache, it->p_cur);
/* Setup new pointers */
slot_ptr = cache->p_base_slots;
it->slot_ptr_end = slot_ptr + cache->p_num_slots;
/* Check again */
continue;
}
/* Slot not used */
if (*slot_ptr <= 1) {
slot_ptr++;
continue;
}
/* Get pointer to details for this entry */
base_det = S_Ptr(cache->p_base, *slot_ptr);
/* Slot expired */
expire_on = S_ExpireOn(base_det);
if (expire_on && now >= expire_on) {
slot_ptr++;
continue;
}
break;
}
/* Move to the next slot for next iteration */
it->slot_ptr = ++slot_ptr;
/* Return that we found the next item */
return base_det;
}
/*
* void mmc_iterate_close(mmap_cache_it * it)
*
* Finish and dispose of iterator memory
*
*/
void mmc_iterate_close(mmap_cache_it * it) {
/* Unlock page if locked */
if (it->p_cur != NOPAGE) {
mmc_unlock(it->cache);
}
/* Free memory */
free(it);
}
/*
* void mmc_get_details(
* mmap_cache * cache,
* MU32 * base_det,
* void ** key_ptr, int * key_len,
* void ** val_ptr, int * val_len,
* MU32 * last_access, MU32 * expire_on, MU32 * flags
* )
*
* Given a base_det pointer to entries details
* (as returned by mmc_iterate_next(...) and
* mmc_calc_expunge(...)) return details of that
* entry in the cache
*
*/
void mmc_get_details(
mmap_cache * cache,
MU32 * base_det,
void ** key_ptr, int * key_len,
void ** val_ptr, int * val_len,
MU32 * last_access, MU32 * expire_on, MU32 * flags
) {
cache = cache;
*key_ptr = S_KeyPtr(base_det);
*key_len = S_KeyLen(base_det);
*val_ptr = S_ValPtr(base_det);
*val_len = S_ValLen(base_det);
*last_access = S_LastAccess(base_det);
*expire_on = S_ExpireOn(base_det);
*flags = S_Flags(base_det);
}
/*
* _mmc_delete_slot(
* mmap_cache * cache, MU32 * slot_ptr
* )
*
* Delete details from the given slot
*
*/
void _mmc_delete_slot(
mmap_cache * cache, MU32 * slot_ptr
) {
ASSERT(*slot_ptr > 1);
ASSERT(cache->p_cur != NOPAGE);
/* Set offset to 1 */
*slot_ptr = 1;
/* Increase slot free counters */
cache->p_free_slots++;
cache->p_old_slots++;
/* Ensure changes are saved back */
cache->p_changed = 1;
}
/*
* MU32 * _mmc_find_slot(
* mmap_cache * cache, MU32 hash_slot,
* void *key_ptr, int key_len,
* int mode
* )
*
* Search current page for a particular 'key'. Use 'hash_slot' to
* calculate starting slot. Return pointer to slot.
*
*/
MU32 * _mmc_find_slot(
mmap_cache * cache, MU32 hash_slot,
void *key_ptr, int key_len,
int mode
) {
MU32 slots_left, * slots_end;
/* Modulo hash_slot to find starting slot */
MU32 * slot_ptr = cache->p_base_slots + (hash_slot % cache->p_num_slots);
MU32 * first_deleted = (MU32 *)0;
/* Total slots and pointer to end of slot data to do wrapping */
slots_left = cache->p_num_slots;
slots_end = cache->p_base_slots + slots_left;
ASSERT(cache->p_cur != NOPAGE);
/* Loop with integer probing till we find or don't */
while (slots_left--) {
MU32 data_offset = *slot_ptr;
ASSERT(data_offset == 0 || data_offset == 1 ||
((data_offset >= P_HEADERSIZE + cache->p_num_slots*4) &&
(data_offset < cache->c_page_size) &&
((data_offset & 3) == 0)));
/* data_offset == 0 means empty slot, and no more beyond */
/* data_offset == 1 means deleted slot, we can reuse if writing */
if (data_offset == 0) {
/* Return pointer to last checked slot */
break;
}
if (data_offset == 1 && mode == 1 && 0 == first_deleted) {
/* Save pointer to first usable slot; if we don't find the key later,
we'll fall back to returning this.
*/
first_deleted = slot_ptr;
}
/* deleted slot, keep looking */
if (data_offset == 1) {
} else {
/* Offset is from start of data area */
MU32 * base_det = S_Ptr(cache->p_base, data_offset);
/* Two longs are key len and data len */
MU32 fkey_len = S_KeyLen(base_det);
/* Key matches? */
if (fkey_len == (MU32)key_len && !memcmp(key_ptr, S_KeyPtr(base_det), key_len)) {
/* Yep, found it! */
return slot_ptr;
}
}
/* Linear probe and wrap at end of slot data... */
if (++slot_ptr == slots_end) { slot_ptr = cache->p_base_slots; }
ASSERT(slot_ptr >= cache->p_base_slots && slot_ptr < slots_end);
}
/* No slot found */
if (++slots_left == 0) slot_ptr = 0;
if (1 == mode && 0 != first_deleted)
return first_deleted;
else
return slot_ptr;
}
/*
* void _mmc_init_page(mmap_cache * cache, int page)
*
* Initialise the given page as empty
*
* If page == -1, init all pages
*
*/
void _mmc_init_page(mmap_cache * cache, MU32 p_cur) {
MU32 start_page = p_cur, end_page = p_cur+1;
if (p_cur == NOPAGE) {
start_page = 0;
end_page = cache->c_num_pages;
}
for (p_cur = start_page; p_cur < end_page; p_cur++) {
/* Setup page details */
MU64 p_offset = (MU64)p_cur * cache->c_page_size;
void * p_ptr = PTR_ADD(cache->mm_var, p_offset);
/* Initialise to all 0's */
memset(p_ptr, 0, cache->c_page_size);
/* Setup header */
P_Magic(p_ptr) = 0x92f7e3b1;
P_NumSlots(p_ptr) = cache->start_slots;
P_FreeSlots(p_ptr) = cache->start_slots;
P_OldSlots(p_ptr) = 0;
P_FreeData(p_ptr) = P_HEADERSIZE + cache->start_slots * 4;
P_FreeBytes(p_ptr) = cache->c_page_size - P_FreeData(p_ptr);
P_NReads(p_ptr) = 0;
P_NReadHits(p_ptr) = 0;
}
}
/*
* int _mmc_test_page(mmap_cache * cache)
*
* Test integrity of current page
*
*/
int _mmc_test_page(mmap_cache * cache) {
MU32 * slot_ptr = cache->p_base_slots;
MU32 count_free = 0, count_old = 0, max_data_offset = 0;
MU32 data_size = cache->c_page_size;
ASSERT(cache->p_cur != NOPAGE);
if (cache->p_cur == NOPAGE) return 0;
for (; slot_ptr < cache->p_base_slots + cache->p_num_slots; slot_ptr++) {
MU32 data_offset = *slot_ptr;
ASSERT(data_offset == 0 || data_offset == 1 ||
(data_offset >= P_HEADERSIZE + cache->p_num_slots * 4 &&
data_offset < cache->c_page_size));
if (!(data_offset == 0 || data_offset == 1 ||
(data_offset >= P_HEADERSIZE + cache->p_num_slots * 4 &&
data_offset < cache->c_page_size))) return 0;
if (data_offset == 1) {
count_old++;
}
if (data_offset <= 1) {
count_free++;
continue;
}
if (data_offset > 1) {
MU32 * base_det = S_Ptr(cache->p_base, data_offset);
MU32 last_access = S_LastAccess(base_det);
MU32 expire_on = S_ExpireOn(base_det);
MU32 key_len = S_KeyLen(base_det);
MU32 val_len = S_ValLen(base_det);
MU32 kvlen = S_SlotLen(base_det);
ROUNDLEN(kvlen);
ASSERT(last_access > 1000000000);
if (!(last_access > 1000000000)) return 0;
ASSERT(expire_on == 0 || (expire_on > 1000000000));
if (!(expire_on == 0 || (expire_on > 1000000000))) return 0;
ASSERT(key_len >= 0 && key_len < data_size);
if (!(key_len >= 0 && key_len < data_size)) return 0;
ASSERT(val_len >= 0 && val_len < data_size);
if (!(val_len >= 0 && val_len < data_size)) return 0;
ASSERT(kvlen >= 4*4 && kvlen < data_size);
if (!(kvlen >= 4*4 && kvlen < data_size)) return 0;
/* Keep track of largest end of data position */
if (data_offset + kvlen > max_data_offset) {
max_data_offset = data_offset + kvlen;
}
/* Check if key lookup finds same thing */
{
MU32 hash_page, hash_slot, * find_slot_ptr;
/* Hash it */
mmc_hash(cache, S_KeyPtr(base_det), (int)key_len,
&hash_page, &hash_slot);
ASSERT(hash_slot == S_SlotHash(base_det));
if (!(hash_slot == S_SlotHash(base_det))) return 0;
find_slot_ptr = _mmc_find_slot(cache, hash_slot, S_KeyPtr(base_det), key_len, 0);
ASSERT(find_slot_ptr == slot_ptr);
if (!(find_slot_ptr == slot_ptr)) return 0;
}
}
}
ASSERT(count_free == cache->p_free_slots);
if (!(count_free == cache->p_free_slots)) return 0;
ASSERT(count_old == cache->p_old_slots);
if (!(count_old == cache->p_old_slots)) return 0;
ASSERT(cache->p_free_data >= max_data_offset);
if (!(cache->p_free_data >= max_data_offset)) return 0;
return 1;
}
/*
* int _mmc_dump_page(mmap_cache * cache)
*
* Dump text version of current page to STDOUT
*
*/
int _mmc_dump_page(mmap_cache * cache) {
MU32 slot;
ASSERT(cache->p_cur != NOPAGE);
printf("PageNum: %d\n", cache->p_cur);
printf("\n");
printf("PageSize: %d\n", cache->c_page_size);
printf("BasePage: %p\n", cache->p_base);
printf("BaseSlots: %p\n", cache->p_base_slots);
printf("\n");
printf("NumSlots: %d\n", cache->p_num_slots);
printf("FreeSlots: %d\n", cache->p_free_slots);
printf("OldSlots: %d\n", cache->p_old_slots);
printf("FreeData: %d\n", cache->p_free_data);
printf("FreeBytes: %d\n", cache->p_free_bytes);
for (slot = 0; slot < cache->p_num_slots; slot++) {
MU32 * slot_ptr = cache->p_base_slots + slot;
printf("Slot: %d; OF=%d; ", slot, *slot_ptr);
if (*slot_ptr > 1) {
MU32 * base_det = S_Ptr(cache->p_base, *slot_ptr);
MU32 key_len = S_KeyLen(base_det);
MU32 val_len = S_ValLen(base_det);
char key[256], val[256];
printf("LA=%d, ET=%d, HS=%d, FL=%d\n",
S_LastAccess(base_det), S_ExpireOn(base_det),
S_SlotHash(base_det), S_Flags(base_det));
/* Get data */
memcpy(key, S_KeyPtr(base_det), key_len > 256 ? 256 : key_len);
key[key_len] = 0;
memcpy(val, S_ValPtr(base_det), val_len > 256 ? 256 : val_len);
val[val_len] = 0;
printf(" K=%s, V=%s\n", key, val);
}
}
return 0;
}
|