HomeSort by: relevance | last modified time | path
    Searched defs:inactive (Results 1 - 25 of 36) sorted by relevancy

1 2

  /src/sys/uvm/
uvm_stat.c 59 int active, inactive; local in function:uvmexp_print
62 uvm_estimatepageable(&active, &inactive);
81 (*pr)(" %d VM pages: %d active, %d inactive, %d wired, %d free\n",
82 uvmexp.npages, active, inactive, uvmexp.wired, freepg);
uvm_stat.c 59 int active, inactive; local in function:uvmexp_print
62 uvm_estimatepageable(&active, &inactive);
81 (*pr)(" %d VM pages: %d active, %d inactive, %d wired, %d free\n",
82 uvmexp.npages, active, inactive, uvmexp.wired, freepg);
uvm_stat.c 59 int active, inactive; local in function:uvmexp_print
62 uvm_estimatepageable(&active, &inactive);
81 (*pr)(" %d VM pages: %d active, %d inactive, %d wired, %d free\n",
82 uvmexp.npages, active, inactive, uvmexp.wired, freepg);
uvm_stat.c 59 int active, inactive; local in function:uvmexp_print
62 uvm_estimatepageable(&active, &inactive);
81 (*pr)(" %d VM pages: %d active, %d inactive, %d wired, %d free\n",
82 uvmexp.npages, active, inactive, uvmexp.wired, freepg);
uvm_meter.c 98 int active, inactive; local in function:sysctl_vm_uvmexp2
100 uvm_estimatepageable(&active, &inactive);
111 u.inactive = inactive;
uvm_meter.c 98 int active, inactive; local in function:sysctl_vm_uvmexp2
100 uvm_estimatepageable(&active, &inactive);
111 u.inactive = inactive;
uvm_meter.c 98 int active, inactive; local in function:sysctl_vm_uvmexp2
100 uvm_estimatepageable(&active, &inactive);
111 u.inactive = inactive;
uvm_meter.c 98 int active, inactive; local in function:sysctl_vm_uvmexp2
100 uvm_estimatepageable(&active, &inactive);
111 u.inactive = inactive;
uvm_bio.c 84 (&ubc_object.inactive[(((u_long)(offset)) >> ubc_winshift) & \
104 TAILQ_ENTRY(ubc_map) inactive; /* inactive queue */
117 struct ubc_inactive_head *inactive; member in struct:ubc_object
118 /* inactive queues for ubc_map's */
176 * init inactive queues.
196 ubc_object.inactive = kmem_alloc(UBC_NQUEUES *
199 TAILQ_INIT(&ubc_object.inactive[i]);
204 TAILQ_INSERT_TAIL(&ubc_object.inactive[i & (UBC_NQUEUES - 1)],
205 umap, inactive);
    [all...]
uvm_pdaemon.c 100 * in a pass thru the inactive list when swap is full. the value should be
101 * "small"... if it's too large we'll cycle the active pages thru the inactive
292 * now recompute inactive count
638 * => we work on meeting our free target by converting inactive pages
826 * inactive queue.
909 * by converting inactive pages into free pages. then we work on
910 * meeting our inactive target by converting active pages to
911 * inactive ones.
959 int active, inactive; local in function:uvm_reclaimable
984 uvm_estimatepageable(&active, &inactive);
    [all...]
uvm_bio.c 84 (&ubc_object.inactive[(((u_long)(offset)) >> ubc_winshift) & \
104 TAILQ_ENTRY(ubc_map) inactive; /* inactive queue */
117 struct ubc_inactive_head *inactive; member in struct:ubc_object
118 /* inactive queues for ubc_map's */
176 * init inactive queues.
196 ubc_object.inactive = kmem_alloc(UBC_NQUEUES *
199 TAILQ_INIT(&ubc_object.inactive[i]);
204 TAILQ_INSERT_TAIL(&ubc_object.inactive[i & (UBC_NQUEUES - 1)],
205 umap, inactive);
    [all...]
uvm_pdaemon.c 100 * in a pass thru the inactive list when swap is full. the value should be
101 * "small"... if it's too large we'll cycle the active pages thru the inactive
292 * now recompute inactive count
638 * => we work on meeting our free target by converting inactive pages
826 * inactive queue.
909 * by converting inactive pages into free pages. then we work on
910 * meeting our inactive target by converting active pages to
911 * inactive ones.
959 int active, inactive; local in function:uvm_reclaimable
984 uvm_estimatepageable(&active, &inactive);
    [all...]
uvm_bio.c 84 (&ubc_object.inactive[(((u_long)(offset)) >> ubc_winshift) & \
104 TAILQ_ENTRY(ubc_map) inactive; /* inactive queue */
117 struct ubc_inactive_head *inactive; member in struct:ubc_object
118 /* inactive queues for ubc_map's */
176 * init inactive queues.
196 ubc_object.inactive = kmem_alloc(UBC_NQUEUES *
199 TAILQ_INIT(&ubc_object.inactive[i]);
204 TAILQ_INSERT_TAIL(&ubc_object.inactive[i & (UBC_NQUEUES - 1)],
205 umap, inactive);
    [all...]
uvm_pdaemon.c 100 * in a pass thru the inactive list when swap is full. the value should be
101 * "small"... if it's too large we'll cycle the active pages thru the inactive
292 * now recompute inactive count
638 * => we work on meeting our free target by converting inactive pages
826 * inactive queue.
909 * by converting inactive pages into free pages. then we work on
910 * meeting our inactive target by converting active pages to
911 * inactive ones.
959 int active, inactive; local in function:uvm_reclaimable
984 uvm_estimatepageable(&active, &inactive);
    [all...]
uvm_bio.c 84 (&ubc_object.inactive[(((u_long)(offset)) >> ubc_winshift) & \
104 TAILQ_ENTRY(ubc_map) inactive; /* inactive queue */
117 struct ubc_inactive_head *inactive; member in struct:ubc_object
118 /* inactive queues for ubc_map's */
176 * init inactive queues.
196 ubc_object.inactive = kmem_alloc(UBC_NQUEUES *
199 TAILQ_INIT(&ubc_object.inactive[i]);
204 TAILQ_INSERT_TAIL(&ubc_object.inactive[i & (UBC_NQUEUES - 1)],
205 umap, inactive);
    [all...]
uvm_pdaemon.c 100 * in a pass thru the inactive list when swap is full. the value should be
101 * "small"... if it's too large we'll cycle the active pages thru the inactive
292 * now recompute inactive count
638 * => we work on meeting our free target by converting inactive pages
826 * inactive queue.
909 * by converting inactive pages into free pages. then we work on
910 * meeting our inactive target by converting active pages to
911 * inactive ones.
959 int active, inactive; local in function:uvm_reclaimable
984 uvm_estimatepageable(&active, &inactive);
    [all...]
uvm_extern.h 269 * Value representing inactive emap.
432 int64_t inactive; member in struct:uvmexp_sysctl
uvm_extern.h 269 * Value representing inactive emap.
432 int64_t inactive; member in struct:uvmexp_sysctl
  /src/sys/ufs/lfs/
lfs_bio.c 780 int active, inactive; local in function:lfs_wait_pages
782 uvm_estimatepageable(&active, &inactive);
783 return LFS_WAIT_RESOURCE(active + inactive + uvm_availmem(false), 1);
789 int active, inactive; local in function:lfs_max_pages
791 uvm_estimatepageable(&active, &inactive);
792 return LFS_MAX_RESOURCE(active + inactive + uvm_availmem(false), 1);
lfs_bio.c 780 int active, inactive; local in function:lfs_wait_pages
782 uvm_estimatepageable(&active, &inactive);
783 return LFS_WAIT_RESOURCE(active + inactive + uvm_availmem(false), 1);
789 int active, inactive; local in function:lfs_max_pages
791 uvm_estimatepageable(&active, &inactive);
792 return LFS_MAX_RESOURCE(active + inactive + uvm_availmem(false), 1);
lfs_bio.c 780 int active, inactive; local in function:lfs_wait_pages
782 uvm_estimatepageable(&active, &inactive);
783 return LFS_WAIT_RESOURCE(active + inactive + uvm_availmem(false), 1);
789 int active, inactive; local in function:lfs_max_pages
791 uvm_estimatepageable(&active, &inactive);
792 return LFS_MAX_RESOURCE(active + inactive + uvm_availmem(false), 1);
lfs_bio.c 780 int active, inactive; local in function:lfs_wait_pages
782 uvm_estimatepageable(&active, &inactive);
783 return LFS_WAIT_RESOURCE(active + inactive + uvm_availmem(false), 1);
789 int active, inactive; local in function:lfs_max_pages
791 uvm_estimatepageable(&active, &inactive);
792 return LFS_MAX_RESOURCE(active + inactive + uvm_availmem(false), 1);
  /src/usr.sbin/user/
user.c 766 fprintf(fp, "inactive\t%s\n", (up->u_inactive == NULL) ?
859 } else if (strncmp(s, "inactive", 8) == 0) {
1071 time_t inactive; local in function:adduser
1205 if (!scantime(&inactive, up->u_inactive)) {
1206 warnx("Warning: inactive time `%s' invalid, password expiry off",
1239 (long) inactive,
1609 warnx("Warning: inactive time `%s' invalid, "
1794 "[-e expiry-time] [-f inactive-time]\n"
1799 "\t[-f inactive-time] [-G secondary-group] "
1808 "\t[-f inactive] [-G secondary-group]
    [all...]
user.c 766 fprintf(fp, "inactive\t%s\n", (up->u_inactive == NULL) ?
859 } else if (strncmp(s, "inactive", 8) == 0) {
1071 time_t inactive; local in function:adduser
1205 if (!scantime(&inactive, up->u_inactive)) {
1206 warnx("Warning: inactive time `%s' invalid, password expiry off",
1239 (long) inactive,
1609 warnx("Warning: inactive time `%s' invalid, "
1794 "[-e expiry-time] [-f inactive-time]\n"
1799 "\t[-f inactive-time] [-G secondary-group] "
1808 "\t[-f inactive] [-G secondary-group]
    [all...]
user.c 766 fprintf(fp, "inactive\t%s\n", (up->u_inactive == NULL) ?
859 } else if (strncmp(s, "inactive", 8) == 0) {
1071 time_t inactive; local in function:adduser
1205 if (!scantime(&inactive, up->u_inactive)) {
1206 warnx("Warning: inactive time `%s' invalid, password expiry off",
1239 (long) inactive,
1609 warnx("Warning: inactive time `%s' invalid, "
1794 "[-e expiry-time] [-f inactive-time]\n"
1799 "\t[-f inactive-time] [-G secondary-group] "
1808 "\t[-f inactive] [-G secondary-group]
    [all...]

Completed in 56 milliseconds

1 2