* vm_map_entry_{pred,succ}: * * Find the {predecessor, successor} of the entry by taking one step * in the appropriate direction and backtracking as much as necessary. * vm_map_entry_succ is defined in vm_map.h. */
| 1045 | * vm_map_entry_succ is defined in vm_map.h. |
| 1046 | */ |
| 1047 | static inline vm_map_entry_t |
| 1048 | vm_map_entry_pred(vm_map_entry_t entry) |
| 1049 | { |
| 1050 | vm_map_entry_t prior; |
| 1051 | |
| 1052 | prior = entry->left; |
| 1053 | if (prior->right->start < entry->start) { |
| 1054 | do |
| 1055 | prior = prior->right; |
| 1056 | while (prior->right != entry); |
| 1057 | } |
| 1058 | return (prior); |
| 1059 | } |
| 1060 | |
| 1061 | static inline vm_size_t |
| 1062 | vm_size_max(vm_size_t a, vm_size_t b) |
no outgoing calls
no test coverage detected