Loading...
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 | /* * Copyright (c) 2000-2013 Apple Inc. All rights reserved. * * @APPLE_OSREFERENCE_LICENSE_HEADER_START@ * * This file contains Original Code and/or Modifications of Original Code * as defined in and that are subject to the Apple Public Source License * Version 2.0 (the 'License'). You may not use this file except in * compliance with the License. The rights granted to you under the License * may not be used to create, or enable the creation or redistribution of, * unlawful or unlicensed copies of an Apple operating system, or to * circumvent, violate, or enable the circumvention or violation of, any * terms of an Apple operating system software license agreement. * * Please obtain a copy of the License at * http://www.opensource.apple.com/apsl/ and read it before using this file. * * The Original Code and all software distributed under the License are * distributed on an 'AS IS' basis, WITHOUT WARRANTY OF ANY KIND, EITHER * EXPRESS OR IMPLIED, AND APPLE HEREBY DISCLAIMS ALL SUCH WARRANTIES, * INCLUDING WITHOUT LIMITATION, ANY WARRANTIES OF MERCHANTABILITY, * FITNESS FOR A PARTICULAR PURPOSE, QUIET ENJOYMENT OR NON-INFRINGEMENT. * Please see the License for the specific language governing rights and * limitations under the License. * * @APPLE_OSREFERENCE_LICENSE_HEADER_END@ */ #include <vm/vm_page.h> #include <vm/vm_object.h> #include <vm/vm_kern.h> #include <vm/vm_pageout.h> #include <vm/vm_phantom_cache.h> #include <vm/vm_compressor.h> uint32_t phantom_cache_eval_period_in_msecs = 250; uint32_t phantom_cache_thrashing_threshold_ssd = 1000; uint32_t phantom_cache_thrashing_threshold = 100; /* * Number of consecutive thrashing periods required before * vm_phantom_cache_check_pressure() returns true. */ unsigned phantom_cache_contiguous_periods = 2; clock_sec_t pc_start_of_eval_period_sec = 0; clock_nsec_t pc_start_of_eval_period_nsec = 0; boolean_t pc_need_eval_reset = FALSE; /* One bit per recent sampling period. Bit 0 = current period. */ uint32_t pc_history = 0; uint32_t sample_period_ghost_added_count = 0; uint32_t sample_period_ghost_added_count_ssd = 0; uint32_t sample_period_ghost_found_count = 0; uint32_t sample_period_ghost_found_count_ssd = 0; uint32_t vm_phantom_object_id = 1; #define VM_PHANTOM_OBJECT_ID_AFTER_WRAP 1000000 vm_ghost_t vm_phantom_cache; uint32_t vm_phantom_cache_nindx = 1; uint32_t vm_phantom_cache_num_entries = 0; uint32_t vm_phantom_cache_size; typedef uint32_t vm_phantom_hash_entry_t; vm_phantom_hash_entry_t *vm_phantom_cache_hash; uint32_t vm_phantom_cache_hash_size; uint32_t vm_ghost_hash_mask; /* Mask for hash function */ uint32_t vm_ghost_bucket_hash; /* Basic bucket hash */ int pg_masks[4] = { 0x1, 0x2, 0x4, 0x8 }; #define vm_phantom_hash(obj_id, offset) (\ ( (natural_t)((uintptr_t)obj_id * vm_ghost_bucket_hash) + (offset ^ vm_ghost_bucket_hash)) & vm_ghost_hash_mask) struct phantom_cache_stats { uint32_t pcs_wrapped; uint32_t pcs_added_page_to_entry; uint32_t pcs_added_new_entry; uint32_t pcs_replaced_entry; uint32_t pcs_lookup_found_page_in_cache; uint32_t pcs_lookup_entry_not_in_cache; uint32_t pcs_lookup_page_not_in_entry; uint32_t pcs_updated_phantom_state; } phantom_cache_stats; void vm_phantom_cache_init() { unsigned int num_entries; unsigned int log1; unsigned int size; if ( !VM_CONFIG_COMPRESSOR_IS_ACTIVE) return; num_entries = (uint32_t)(((max_mem / PAGE_SIZE) / 4) / VM_GHOST_PAGES_PER_ENTRY); vm_phantom_cache_num_entries = 1; while (vm_phantom_cache_num_entries < num_entries) vm_phantom_cache_num_entries <<= 1; vm_phantom_cache_size = sizeof(struct vm_ghost) * vm_phantom_cache_num_entries; vm_phantom_cache_hash_size = sizeof(vm_phantom_hash_entry_t) * vm_phantom_cache_num_entries; if (kernel_memory_allocate(kernel_map, (vm_offset_t *)(&vm_phantom_cache), vm_phantom_cache_size, 0, KMA_KOBJECT | KMA_PERMANENT, VM_KERN_MEMORY_PHANTOM_CACHE) != KERN_SUCCESS) panic("vm_phantom_cache_init: kernel_memory_allocate failed\n"); bzero(vm_phantom_cache, vm_phantom_cache_size); if (kernel_memory_allocate(kernel_map, (vm_offset_t *)(&vm_phantom_cache_hash), vm_phantom_cache_hash_size, 0, KMA_KOBJECT | KMA_PERMANENT, VM_KERN_MEMORY_PHANTOM_CACHE) != KERN_SUCCESS) panic("vm_phantom_cache_init: kernel_memory_allocate failed\n"); bzero(vm_phantom_cache_hash, vm_phantom_cache_hash_size); vm_ghost_hash_mask = vm_phantom_cache_num_entries - 1; /* * Calculate object_id shift value for hashing algorithm: * O = log2(sizeof(struct vm_object)) * B = log2(vm_page_bucket_count) * hash shifts the object_id left by * B/2 - O */ size = vm_phantom_cache_num_entries; for (log1 = 0; size > 1; log1++) size /= 2; vm_ghost_bucket_hash = 1 << ((log1 + 1) >> 1); /* Get (ceiling of sqrt of table size) */ vm_ghost_bucket_hash |= 1 << ((log1 + 1) >> 2); /* Get (ceiling of quadroot of table size) */ vm_ghost_bucket_hash |= 1; /* Set bit and add 1 - always must be 1 to insure unique series */ if (vm_ghost_hash_mask & vm_phantom_cache_num_entries) printf("vm_phantom_cache_init: WARNING -- strange page hash\n"); } void vm_phantom_cache_add_ghost(vm_page_t m) { vm_ghost_t vpce; vm_object_t object; int ghost_index; int pg_mask; boolean_t isSSD = FALSE; vm_phantom_hash_entry_t ghost_hash_index; object = VM_PAGE_OBJECT(m); LCK_MTX_ASSERT(&vm_page_queue_lock, LCK_MTX_ASSERT_OWNED); vm_object_lock_assert_exclusive(object); if (vm_phantom_cache_num_entries == 0) return; pg_mask = pg_masks[(m->offset >> PAGE_SHIFT) & VM_GHOST_PAGE_MASK]; if (object->phantom_object_id == 0) { vnode_pager_get_isSSD(object->pager, &isSSD); if (isSSD == TRUE) object->phantom_isssd = TRUE; object->phantom_object_id = vm_phantom_object_id++; if (vm_phantom_object_id == 0) vm_phantom_object_id = VM_PHANTOM_OBJECT_ID_AFTER_WRAP; } else { if ( (vpce = vm_phantom_cache_lookup_ghost(m, 0)) ) { vpce->g_pages_held |= pg_mask; phantom_cache_stats.pcs_added_page_to_entry++; goto done; } } /* * if we're here then the vm_ghost_t of this vm_page_t * is not present in the phantom cache... take the next * available entry in the LRU first evicting the existing * entry if we've wrapped the ring */ ghost_index = vm_phantom_cache_nindx++; if (vm_phantom_cache_nindx == vm_phantom_cache_num_entries) { vm_phantom_cache_nindx = 1; phantom_cache_stats.pcs_wrapped++; } vpce = &vm_phantom_cache[ghost_index]; if (vpce->g_obj_id) { /* * we're going to replace an existing entry * so first remove it from the hash */ vm_ghost_t nvpce; ghost_hash_index = vm_phantom_hash(vpce->g_obj_id, vpce->g_obj_offset); nvpce = &vm_phantom_cache[vm_phantom_cache_hash[ghost_hash_index]]; if (nvpce == vpce) { vm_phantom_cache_hash[ghost_hash_index] = vpce->g_next_index; } else { for (;;) { if (nvpce->g_next_index == 0) panic("didn't find ghost in hash\n"); if (&vm_phantom_cache[nvpce->g_next_index] == vpce) { nvpce->g_next_index = vpce->g_next_index; break; } nvpce = &vm_phantom_cache[nvpce->g_next_index]; } } phantom_cache_stats.pcs_replaced_entry++; } else phantom_cache_stats.pcs_added_new_entry++; vpce->g_pages_held = pg_mask; vpce->g_obj_offset = (m->offset >> (PAGE_SHIFT + VM_GHOST_PAGE_SHIFT)) & VM_GHOST_OFFSET_MASK; vpce->g_obj_id = object->phantom_object_id; ghost_hash_index = vm_phantom_hash(vpce->g_obj_id, vpce->g_obj_offset); vpce->g_next_index = vm_phantom_cache_hash[ghost_hash_index]; vm_phantom_cache_hash[ghost_hash_index] = ghost_index; done: if (object->phantom_isssd) OSAddAtomic(1, &sample_period_ghost_added_count_ssd); else OSAddAtomic(1, &sample_period_ghost_added_count); } vm_ghost_t vm_phantom_cache_lookup_ghost(vm_page_t m, uint32_t pg_mask) { uint64_t g_obj_offset; uint32_t g_obj_id; uint32_t ghost_index; vm_object_t object; object = VM_PAGE_OBJECT(m); if ((g_obj_id = object->phantom_object_id) == 0) { /* * no entries in phantom cache for this object */ return (NULL); } g_obj_offset = (m->offset >> (PAGE_SHIFT + VM_GHOST_PAGE_SHIFT)) & VM_GHOST_OFFSET_MASK; ghost_index = vm_phantom_cache_hash[vm_phantom_hash(g_obj_id, g_obj_offset)]; while (ghost_index) { vm_ghost_t vpce; vpce = &vm_phantom_cache[ghost_index]; if (vpce->g_obj_id == g_obj_id && vpce->g_obj_offset == g_obj_offset) { if (pg_mask == 0 || (vpce->g_pages_held & pg_mask)) { phantom_cache_stats.pcs_lookup_found_page_in_cache++; return (vpce); } phantom_cache_stats.pcs_lookup_page_not_in_entry++; return (NULL); } ghost_index = vpce->g_next_index; } phantom_cache_stats.pcs_lookup_entry_not_in_cache++; return (NULL); } void vm_phantom_cache_update(vm_page_t m) { int pg_mask; vm_ghost_t vpce; vm_object_t object; object = VM_PAGE_OBJECT(m); LCK_MTX_ASSERT(&vm_page_queue_lock, LCK_MTX_ASSERT_OWNED); vm_object_lock_assert_exclusive(object); if (vm_phantom_cache_num_entries == 0) return; pg_mask = pg_masks[(m->offset >> PAGE_SHIFT) & VM_GHOST_PAGE_MASK]; if ( (vpce = vm_phantom_cache_lookup_ghost(m, pg_mask)) ) { vpce->g_pages_held &= ~pg_mask; phantom_cache_stats.pcs_updated_phantom_state++; if (object->phantom_isssd) OSAddAtomic(1, &sample_period_ghost_found_count_ssd); else OSAddAtomic(1, &sample_period_ghost_found_count); } } #define PHANTOM_CACHE_DEBUG 1 #if PHANTOM_CACHE_DEBUG int sample_period_ghost_counts_indx = 0; struct { uint32_t added; uint32_t found; uint32_t added_ssd; uint32_t found_ssd; uint32_t elapsed_ms; boolean_t pressure_detected; } sample_period_ghost_counts[256]; #endif /* * Determine if the file cache is thrashing from sampling interval statistics. * * Pages added to the phantom cache = pages evicted from the file cache. * Pages found in the phantom cache = reads of pages that were recently evicted. * Threshold is the latency-dependent number of reads we consider thrashing. */ static boolean_t is_thrashing(uint32_t added, uint32_t found, uint32_t threshold) { /* Ignore normal activity below the threshold. */ if (added < threshold || found < threshold) return FALSE; /* * When thrashing in a way that we can mitigate, most of the pages read * into the file cache were recently evicted, and 'found' will be close * to 'added'. * * When replacing the current working set because a new app is * launched, we see very high read traffic with sporadic phantom cache * hits. * * This is not thrashing, or freeing up memory wouldn't help much * anyway. */ if (found < added / 2) return FALSE; return TRUE; } /* * the following function is never called * from multiple threads simultaneously due * to a condition variable used to serialize * at the compressor level... thus no need * to provide locking for the sample processing */ boolean_t vm_phantom_cache_check_pressure() { clock_sec_t cur_ts_sec; clock_nsec_t cur_ts_nsec; uint64_t elapsed_msecs_in_eval; boolean_t pressure_detected = FALSE; clock_get_system_nanotime(&cur_ts_sec, &cur_ts_nsec); elapsed_msecs_in_eval = vm_compressor_compute_elapsed_msecs(cur_ts_sec, cur_ts_nsec, pc_start_of_eval_period_sec, pc_start_of_eval_period_nsec); /* * Reset evaluation period after phantom_cache_eval_period_in_msecs or * whenever vm_phantom_cache_restart_sample has been called. */ if (elapsed_msecs_in_eval >= phantom_cache_eval_period_in_msecs) { pc_need_eval_reset = TRUE; } if (pc_need_eval_reset == TRUE) { #if PHANTOM_CACHE_DEBUG /* * maintain some info about the last 256 sample periods */ sample_period_ghost_counts[sample_period_ghost_counts_indx].added = sample_period_ghost_added_count; sample_period_ghost_counts[sample_period_ghost_counts_indx].found = sample_period_ghost_found_count; sample_period_ghost_counts[sample_period_ghost_counts_indx].added_ssd = sample_period_ghost_added_count_ssd; sample_period_ghost_counts[sample_period_ghost_counts_indx].found_ssd = sample_period_ghost_found_count_ssd; sample_period_ghost_counts[sample_period_ghost_counts_indx].elapsed_ms = (uint32_t)elapsed_msecs_in_eval; sample_period_ghost_counts_indx++; if (sample_period_ghost_counts_indx >= 256) sample_period_ghost_counts_indx = 0; #endif sample_period_ghost_added_count = 0; sample_period_ghost_found_count = 0; sample_period_ghost_added_count_ssd = 0; sample_period_ghost_found_count_ssd = 0; pc_start_of_eval_period_sec = cur_ts_sec; pc_start_of_eval_period_nsec = cur_ts_nsec; pc_history <<= 1; pc_need_eval_reset = FALSE; } else { /* * Since the trashing rate is really a function of the read latency of the disk * we have to consider both the SSD and spinning disk case since the file cache * could be backed by either or even both flavors. When the object is first * assigned a phantom_object_id, we query the pager to determine if the backing * backing media is an SSD and remember that answer in the vm_object. We use * that info to maintains counts for both the SSD and spinning disk cases. */ if (is_thrashing(sample_period_ghost_added_count, sample_period_ghost_found_count, phantom_cache_thrashing_threshold) || is_thrashing(sample_period_ghost_added_count_ssd, sample_period_ghost_found_count_ssd, phantom_cache_thrashing_threshold_ssd)) { /* Thrashing in the current period: Set bit 0. */ pc_history |= 1; } } /* * Declare pressure_detected after phantom_cache_contiguous_periods. * * Create a bitmask with the N low bits set. These bits must all be set * in pc_history. The high bits of pc_history are ignored. */ uint32_t bitmask = (1u << phantom_cache_contiguous_periods) - 1; if ((pc_history & bitmask) == bitmask) pressure_detected = TRUE; if (vm_page_external_count > ((AVAILABLE_MEMORY) * 50) / 100) pressure_detected = FALSE; #if PHANTOM_CACHE_DEBUG sample_period_ghost_counts[sample_period_ghost_counts_indx].pressure_detected = pressure_detected; #endif return (pressure_detected); } /* * Restart the current sampling because conditions have changed significantly, * and we don't want to react to old data. * * This function can be called from any thread. */ void vm_phantom_cache_restart_sample(void) { pc_need_eval_reset = TRUE; } |