nextp
pmd_t *nextp;
nextp = pt_ops.get_pmd_virt(next_phys);
memset(nextp, 0, PAGE_SIZE);
nextp = pt_ops.get_pmd_virt(next_phys);
create_pmd_mapping(nextp, va, pa, sz, prot);
pud_t *nextp;
nextp = pt_ops.get_pud_virt(next_phys);
memset(nextp, 0, PAGE_SIZE);
nextp = pt_ops.get_pud_virt(next_phys);
create_pud_mapping(nextp, va, pa, sz, prot);
pgd_next_t *nextp;
nextp = get_pgd_next_virt(next_phys);
memset(nextp, 0, PAGE_SIZE);
nextp = get_pgd_next_virt(next_phys);
create_pgd_next_mapping(nextp, va, pa, sz, prot);
void leon_node_init(struct device_node *dp, struct device_node ***nextp);
void _amba_init(struct device_node *dp, struct device_node ***nextp);
struct media_entity_notify *notify, *nextp;
list_for_each_entry_safe(notify, nextp, &mdev->entity_notify, list)
struct media_entity_notify *notify, *nextp;
list_for_each_entry_safe(notify, nextp, &mdev->entity_notify, list) {
u8 **nextp)
if (nextp) {
*nextp = nexthdr;
*nextp = NULL;
char **nextp, unsigned *sizep)
char *next = *nextp;
*nextp = next;
char **nextp, unsigned *sizep)
char *next = *nextp;
*nextp = next;
if (dbq->head != nextp(dbq->tail)) {
dbq->tail = nextp(dbq->tail);
dbq->head = nextp(dbq->head);
u8 *nextp = ent12_p[1] + 1 + (fatent->entry & 1);
if (nextp < (u8 *)(bhs[0]->b_data + (bhs[0]->b_size - 1))) {
ent12_p[0] = nextp - 1;
ent12_p[1] = nextp;
ent12_p[0] = nextp - 1;
ent12_p[1] = nextp;
static int xtSearch(struct inode *ip, s64 xoff, s64 *nextp,
if (nextp)
*nextp = next;
if (nextp)
*nextp = next;
xfs_bmbt_rec_t *nextp; /* pointer to next extent */
nextp = xfs_bmbt_rec_addr(mp, block, j + 1);
xfs_bmbt_disk_get_startoff(nextp));
ep = nextp;
xfs_rtxnum_t *nextp, /* out: next rtext to try */
*nextp = next;
struct cgroup_subsys_state **nextp;
nextp = &prstatc->updated_children;
while (*nextp != root) {
nrstatc = css_rstat_cpu(*nextp, cpu);
WARN_ON_ONCE(*nextp == parent);
nextp = &nrstatc->updated_next;
*nextp = rstatc->updated_next;
nextp = ktime_add_ns(last_jiffies_update, TICK_NSEC);
smp_store_release(&tick_next_period, nextp);
tick_next_period = nextp;
ktime_t delta, nextp;
nextp = tick_next_period;
if (ktime_before(now, nextp))
struct work_struct **nextp)
if (nextp)
*nextp = n;
struct work_struct **nextp)
if (nextp)
*nextp = list_next_entry(work, entry);
move_linked_works(work, &collision->scheduled, nextp);
move_linked_works(work, &worker->scheduled, nextp);
struct sk_buff **nextp = NULL;
nextp = &clone->next;
nextp = &skb_shinfo(head)->frag_list;
return nextp;
struct sk_buff **nextp = reasm_data;
*nextp = fp;
nextp = &fp->next;
*nextp = NULL;
static struct sk_buff **iptfs_rehome_fraglist(struct sk_buff **nextp, struct sk_buff *child)
*nextp = skb_shinfo(child)->frag_list;
while (*nextp) {
fllen += (*nextp)->len;
nextp = &(*nextp)->next;
return nextp;
struct sk_buff *skb, *skb2, **nextp;
nextp = &shi->frag_list;
while (*nextp) {
if (skb_has_frag_list(*nextp))
nextp = iptfs_rehome_fraglist(&(*nextp)->next, *nextp);
nextp = &(*nextp)->next;
*nextp = skb2;
nextp = &skb2->next;
nextp = iptfs_rehome_fraglist(nextp,
*nextp = pos;
*nextp = pos;
*nextp = candidate;
struct list_head *p, *nextp;
for (; p != &emu->mapped_order_link_head; p = nextp) {
nextp = p->next;
static int search_empty_map_area(struct snd_emu10k1 *emu, int npages, struct list_head **nextp)