pid_table
pid = pid_table[i].pt_pid;
tsz = pt_size * sizeof(struct pid_table);
n_pt = pid_table;
atomic_store_release(&pid_table, new_pt);
struct pid_table *pt;
if (__predict_false(PT_RESERVED(pid_table[1].pt_slot) &&
pt = &pid_table[1];
pt = &pid_table[next_free_pt];
struct pid_table *pt;
pt = &pid_table[pid & pid_tbl_mask];
struct pid_table *pt;
pt = &pid_table[pid & pid_tbl_mask];
pt = &pid_table[last_free_pt];
struct pid_table *pt;
pt = &pid_table[pid & pid_tbl_mask];
pgrp = pid_table[pgid & pid_tbl_mask].pt_pgrp;
if (__predict_false(pid_table[pgid & pid_tbl_mask].pt_pgrp))
pid_table[pgid & pid_tbl_mask].pt_pgrp = pgrp;
struct pid_table *pt;
pt = &pid_table[pg_id & pid_tbl_mask];
pt = &pid_table[last_free_pt];
pg = pid_table[pg_id & pid_tbl_mask].pt_pgrp;
struct pid_table *pt;
pid_table, pid_tbl_mask+1,
for (pt = pid_table, id = 0; id <= pid_tbl_mask; id++, pt++) {
static struct pid_table *pid_table __read_mostly;
pid_table = kmem_alloc(INITIAL_PID_TABLE_SIZE
* sizeof(struct pid_table), KM_SLEEP);
pid_table[i].pt_slot = PT_SET_FREE(LINK_EMPTY + i + 1);
pid_table[i].pt_pgrp = 0;
pid_table[i].pt_pid = 0;
pid_table[last_free_pt].pt_slot = PT_SET_FREE(LINK_EMPTY);
pid_table[lwp0.l_lid].pt_slot = PT_SET_LWP(&lwp0);
pid_table[lwp0.l_lid].pt_pgrp = pg;
struct pid_table *pt;
pt = &atomic_load_consume(&pid_table)[pid & pt_mask];
struct pid_table *pt;
pt = &atomic_load_consume(&pid_table)[pid & pt_mask];
struct pid_table *pt;
pt = &pid_table[pid & pid_tbl_mask];
struct pid_table *pt;
pt = &pid_table[pid & pid_tbl_mask];
pg = pid_table[pgid & pid_tbl_mask].pt_pgrp;
struct pid_table *n_pt, *new_pt;
tsz = pt_size * 2 * sizeof(struct pid_table);
slot = pid_table[i].pt_slot;
pgrp = pid_table[i].pt_pgrp;