| vm_radix.h (226876) | vm_radix.h (226930) |
|---|---|
| 1/* 2 * Copyright (c) 2008 Mayur Shardul <mayur.shardul@gmail.com> 3 * All rights reserved. 4 * 5 * Redistribution and use in source and binary forms, with or without 6 * modification, are permitted provided that the following conditions 7 * are met: 8 * 1. Redistributions of source code must retain the above copyright --- 21 unchanged lines hidden (view full) --- 30 31#include <sys/queue.h> 32 33/* Default values of the tree parameters */ 34#define VM_RADIX_WIDTH 5 35#define VM_RADIX_COUNT (1 << VM_RADIX_WIDTH) 36#define VM_RADIX_MASK (VM_RADIX_COUNT - 1) 37#define VM_RADIX_LIMIT howmany((sizeof(vm_pindex_t) * NBBY), VM_RADIX_WIDTH) | 1/* 2 * Copyright (c) 2008 Mayur Shardul <mayur.shardul@gmail.com> 3 * All rights reserved. 4 * 5 * Redistribution and use in source and binary forms, with or without 6 * modification, are permitted provided that the following conditions 7 * are met: 8 * 1. Redistributions of source code must retain the above copyright --- 21 unchanged lines hidden (view full) --- 30 31#include <sys/queue.h> 32 33/* Default values of the tree parameters */ 34#define VM_RADIX_WIDTH 5 35#define VM_RADIX_COUNT (1 << VM_RADIX_WIDTH) 36#define VM_RADIX_MASK (VM_RADIX_COUNT - 1) 37#define VM_RADIX_LIMIT howmany((sizeof(vm_pindex_t) * NBBY), VM_RADIX_WIDTH) |
| 38#define VM_RADIX_HEIGHT 0xf /* Bits of height in root */ | 38#define VM_RADIX_FLAGS 0x3 /* Flag bits stored in node pointers. */ 39#define VM_RADIX_BLACK 0x1 /* Black node. (leaf only) */ 40#define VM_RADIX_RED 0x2 /* Red node. (leaf only) */ 41#define VM_RADIX_ANY (VM_RADIX_RED | VM_RADIX_BLACK) 42#define VM_RADIX_EMPTY 0x1 /* Empty hint. (internal only) */ 43#define VM_RADIX_HEIGHT 0xf /* Bits of height in root */ 44#define VM_RADIX_STACK 8 /* Nodes to store on stack. */ |
| 39 40CTASSERT(VM_RADIX_HEIGHT >= VM_RADIX_LIMIT); 41 42/* Calculates maximum value for a tree of height h. */ 43#define VM_RADIX_MAX(h) \ 44 ((h) == VM_RADIX_LIMIT ? ((vm_pindex_t)-1) : \ 45 (((vm_pindex_t)1 << ((h) * VM_RADIX_WIDTH)) - 1)) 46 47struct vm_radix_node { | 45 46CTASSERT(VM_RADIX_HEIGHT >= VM_RADIX_LIMIT); 47 48/* Calculates maximum value for a tree of height h. */ 49#define VM_RADIX_MAX(h) \ 50 ((h) == VM_RADIX_LIMIT ? ((vm_pindex_t)-1) : \ 51 (((vm_pindex_t)1 << ((h) * VM_RADIX_WIDTH)) - 1)) 52 53struct vm_radix_node { |
| 48 void *rn_child[VM_RADIX_COUNT]; /* child nodes. */ | 54 void *rn_child[VM_RADIX_COUNT]; /* child nodes. */ |
| 49 uint16_t rn_count; /* Valid children. */ 50}; 51 52/* 53 * Radix tree root. The height and pointer are set together to permit 54 * coherent lookups while the root is modified. 55 */ 56struct vm_radix { 57 uintptr_t rt_root; /* root + height */ 58}; 59 60void vm_radix_init(void); | 55 uint16_t rn_count; /* Valid children. */ 56}; 57 58/* 59 * Radix tree root. The height and pointer are set together to permit 60 * coherent lookups while the root is modified. 61 */ 62struct vm_radix { 63 uintptr_t rt_root; /* root + height */ 64}; 65 66void vm_radix_init(void); |
| 67 68/* 69 * Functions which only work with black nodes. (object lock) 70 */ |
|
| 61int vm_radix_insert(struct vm_radix *, vm_pindex_t, void *); | 71int vm_radix_insert(struct vm_radix *, vm_pindex_t, void *); |
| 62void *vm_radix_remove(struct vm_radix *, vm_pindex_t); 63void *vm_radix_lookup(struct vm_radix *, vm_pindex_t); 64int vm_radix_lookupn(struct vm_radix *rtree, vm_pindex_t start, 65 vm_pindex_t end, void **out, int cnt, vm_pindex_t *next); 66void *vm_radix_lookup_le(struct vm_radix *, vm_pindex_t); | |
| 67void vm_radix_shrink(struct vm_radix *); 68 69/* | 72void vm_radix_shrink(struct vm_radix *); 73 74/* |
| 75 * Functions which work on specified colors. (object, vm_page_queue_free locks) 76 */ 77void *vm_radix_color(struct vm_radix *, vm_pindex_t, int color); 78void *vm_radix_lookup(struct vm_radix *, vm_pindex_t, int color); 79int vm_radix_lookupn(struct vm_radix *rtree, vm_pindex_t start, 80 vm_pindex_t end, int color, void **out, int cnt, vm_pindex_t *next); 81void *vm_radix_lookup_le(struct vm_radix *, vm_pindex_t, int color); 82void *vm_radix_remove(struct vm_radix *, vm_pindex_t, int color); 83 84/* |
|
| 70 * Look up any entry at a position greater or equal to index. 71 */ 72static inline void * | 85 * Look up any entry at a position greater or equal to index. 86 */ 87static inline void * |
| 73vm_radix_lookup_ge(struct vm_radix *rtree, vm_pindex_t index) | 88vm_radix_lookup_ge(struct vm_radix *rtree, vm_pindex_t index, int color) |
| 74{ | 89{ |
| 75 vm_pindex_t unused; | |
| 76 void *val; 77 | 90 void *val; 91 |
| 78 if (vm_radix_lookupn(rtree, index, 0, &val, 1, &unused)) | 92 if (vm_radix_lookupn(rtree, index, 0, color, &val, 1, &index)) |
| 79 return (val); 80 return (NULL); 81} 82 83#endif /* !_VM_RADIX_H_ */ | 93 return (val); 94 return (NULL); 95} 96 97#endif /* !_VM_RADIX_H_ */ |