Lines Matching refs:pep

2788 	proc_edge_t *pep, *ppep;  in flk_check_deadlock()  local
2805 for (pep = start_vertex->edge; pep != NULL; pep = pep->next) { in flk_check_deadlock()
2806 if (pep->to_proc == adj_proc) { in flk_check_deadlock()
2807 ASSERT(pep->refcount); in flk_check_deadlock()
2808 pep->refcount++; in flk_check_deadlock()
2812 if (pep == NULL) { in flk_check_deadlock()
2813 pep = flk_get_proc_edge(); in flk_check_deadlock()
2814 pep->to_proc = adj_proc; in flk_check_deadlock()
2815 pep->refcount = 1; in flk_check_deadlock()
2817 pep->next = start_vertex->edge; in flk_check_deadlock()
2818 start_vertex->edge = pep; in flk_check_deadlock()
2830 for (pep = in_proc->edge; pep != NULL; pep = pep->next) { in flk_check_deadlock()
2831 if (pep->to_proc == start_vertex) { in flk_check_deadlock()
2832 ASSERT(pep->refcount); in flk_check_deadlock()
2833 pep->refcount++; in flk_check_deadlock()
2837 if (pep == NULL) { in flk_check_deadlock()
2838 pep = flk_get_proc_edge(); in flk_check_deadlock()
2839 pep->to_proc = start_vertex; in flk_check_deadlock()
2840 pep->refcount = 1; in flk_check_deadlock()
2842 pep->next = in_proc->edge; in flk_check_deadlock()
2843 in_proc->edge = pep; in flk_check_deadlock()
2860 for (pep = pvertex->p_sedge; pep != NULL; pep = pep->next) { in flk_check_deadlock()
2861 dvertex = pep->to_proc; in flk_check_deadlock()
2866 pvertex->p_sedge = pep->next; in flk_check_deadlock()
2872 if (pep == NULL) { in flk_check_deadlock()
2893 for (pep = start_vertex->edge; pep != NULL; ppep = pep, in flk_check_deadlock()
2894 pep = ppep->next) { in flk_check_deadlock()
2895 if (pep->to_proc == adj_proc) { in flk_check_deadlock()
2896 pep->refcount--; in flk_check_deadlock()
2897 if (pep->refcount == 0) { in flk_check_deadlock()
2898 if (pep == ppep) { in flk_check_deadlock()
2899 start_vertex->edge = pep->next; in flk_check_deadlock()
2901 ppep->next = pep->next; in flk_check_deadlock()
2905 flk_free_proc_edge(pep); in flk_check_deadlock()
2921 for (pep = in_proc->edge; pep != NULL; ppep = pep, in flk_check_deadlock()
2922 pep = ppep->next) { in flk_check_deadlock()
2923 if (pep->to_proc == start_vertex) { in flk_check_deadlock()
2924 pep->refcount--; in flk_check_deadlock()
2925 if (pep->refcount == 0) { in flk_check_deadlock()
2926 if (pep == ppep) { in flk_check_deadlock()
2927 in_proc->edge = pep->next; in flk_check_deadlock()
2929 ppep->next = pep->next; in flk_check_deadlock()
2933 flk_free_proc_edge(pep); in flk_check_deadlock()
3012 proc_edge_t *pep; in flk_get_proc_edge() local
3014 pep = kmem_zalloc(sizeof (proc_edge_t), KM_SLEEP); in flk_get_proc_edge()
3016 return (pep); in flk_get_proc_edge()
3024 flk_free_proc_edge(proc_edge_t *pep) in flk_free_proc_edge() argument
3026 ASSERT(pep->refcount == 0); in flk_free_proc_edge()
3027 kmem_free((void *)pep, sizeof (proc_edge_t)); in flk_free_proc_edge()
3081 proc_edge_t *pep, *prevpep; in flk_update_proc_graph() local
3089 pep = prevpep = fromproc->edge; in flk_update_proc_graph()
3091 ASSERT(pep != NULL); in flk_update_proc_graph()
3092 while (pep != NULL) { in flk_update_proc_graph()
3093 if (pep->to_proc == toproc) { in flk_update_proc_graph()
3094 ASSERT(pep->refcount > 0); in flk_update_proc_graph()
3095 pep->refcount--; in flk_update_proc_graph()
3096 if (pep->refcount == 0) { in flk_update_proc_graph()
3097 if (pep == prevpep) { in flk_update_proc_graph()
3098 fromproc->edge = pep->next; in flk_update_proc_graph()
3100 prevpep->next = pep->next; in flk_update_proc_graph()
3104 flk_free_proc_edge(pep); in flk_update_proc_graph()
3108 prevpep = pep; in flk_update_proc_graph()
3109 pep = pep->next; in flk_update_proc_graph()
3116 pep = fromproc->edge; in flk_update_proc_graph()
3118 while (pep != NULL) { in flk_update_proc_graph()
3119 if (pep->to_proc == toproc) { in flk_update_proc_graph()
3120 ASSERT(pep->refcount > 0); in flk_update_proc_graph()
3121 pep->refcount++; in flk_update_proc_graph()
3124 pep = pep->next; in flk_update_proc_graph()
3126 if (pep == NULL) { in flk_update_proc_graph()
3127 pep = flk_get_proc_edge(); in flk_update_proc_graph()
3128 pep->to_proc = toproc; in flk_update_proc_graph()
3129 pep->refcount = 1; in flk_update_proc_graph()
3131 pep->next = fromproc->edge; in flk_update_proc_graph()
3132 fromproc->edge = pep; in flk_update_proc_graph()