Lines Matching refs:grp
450 struct devres_group *grp;
455 grp = node_to_group(node);
456 if (grp) {
458 grp->color = 0;
481 struct devres_group *grp;
486 grp = node_to_group(node);
487 BUG_ON(!grp || list_empty(&grp->node[0].entry));
489 grp->color++;
490 if (list_empty(&grp->node[1].entry))
491 grp->color++;
493 BUG_ON(grp->color <= 0 || grp->color > 2);
494 if (grp->color == 2) {
498 list_move_tail(&grp->node[0].entry, todo);
499 list_del_init(&grp->node[1].entry);
564 struct devres_group *grp;
567 grp = kmalloc(sizeof(*grp), gfp);
568 if (unlikely(!grp))
571 grp->node[0].release = &group_open_release;
572 grp->node[1].release = &group_close_release;
573 INIT_LIST_HEAD(&grp->node[0].entry);
574 INIT_LIST_HEAD(&grp->node[1].entry);
575 set_node_dbginfo(&grp->node[0], "grp<", 0);
576 set_node_dbginfo(&grp->node[1], "grp>", 0);
577 grp->id = grp;
579 grp->id = id;
582 add_dr(dev, &grp->node[0]);
584 return grp->id;
594 struct devres_group *grp;
599 grp = container_of(node, struct devres_group, node[0]);
602 if (grp->id == id)
603 return grp;
604 } else if (list_empty(&grp->node[1].entry))
605 return grp;
621 struct devres_group *grp;
626 grp = find_group(dev, id);
627 if (grp)
628 add_dr(dev, &grp->node[1]);
647 struct devres_group *grp;
652 grp = find_group(dev, id);
653 if (grp) {
654 list_del_init(&grp->node[0].entry);
655 list_del_init(&grp->node[1].entry);
656 devres_log(dev, &grp->node[0], "REM");
662 kfree(grp);
680 struct devres_group *grp;
686 grp = find_group(dev, id);
687 if (grp) {
688 struct list_head *first = &grp->node[0].entry;
691 if (!list_empty(&grp->node[1].entry))
692 end = grp->node[1].entry.next;