HomeSort by: relevance | last modified time | path
    Searched defs:uvm_rb_gap (Results 1 - 2 of 2) sorted by relevancy

  /src/sys/uvm/
uvm_map.c 371 * uvm_rb_gap: return the gap size between our entry and next entry.
374 uvm_rb_gap(const struct vm_map_entry *entry) function in typeref:typename:vsize_t
408 KASSERT(entry->gap == uvm_rb_gap(entry));
416 KDASSERT(parent->gap == uvm_rb_gap(parent));
427 KDASSERT(brother->gap == uvm_rb_gap(brother));
443 entry->gap = entry->maxgap = uvm_rb_gap(entry);
445 entry->prev->gap = uvm_rb_gap(entry->prev);
487 entry->prev->gap = uvm_rb_gap(entry->prev);
573 if (tmp->gap != uvm_rb_gap(tmp)) {
576 (ulong)tmp->gap, (ulong)uvm_rb_gap(tmp)
    [all...]
uvm_map.c 371 * uvm_rb_gap: return the gap size between our entry and next entry.
374 uvm_rb_gap(const struct vm_map_entry *entry) function in typeref:typename:vsize_t
408 KASSERT(entry->gap == uvm_rb_gap(entry));
416 KDASSERT(parent->gap == uvm_rb_gap(parent));
427 KDASSERT(brother->gap == uvm_rb_gap(brother));
443 entry->gap = entry->maxgap = uvm_rb_gap(entry);
445 entry->prev->gap = uvm_rb_gap(entry->prev);
487 entry->prev->gap = uvm_rb_gap(entry->prev);
573 if (tmp->gap != uvm_rb_gap(tmp)) {
576 (ulong)tmp->gap, (ulong)uvm_rb_gap(tmp)
    [all...]

Completed in 22 milliseconds