Lines Matching refs:next
247 for (p = ti->first; p; p = p->next) {
248 if (p->next && p->next->prev != p)
250 if (p->next == 0 && p != ti->last)
254 if (p->prev && p->prev->next != p)
465 sg->next = 0;
711 sg->next = 0;
713 DRD_(g_threadinfo)[tid].last->next = sg;
738 sg->prev->next = sg->next;
739 if (sg->next)
740 sg->next->prev = sg->prev;
742 DRD_(g_threadinfo)[tid].first = sg->next;
867 sg && (sg_next = sg->next) && DRD_(vc_lte)(&sg->vc, &thread_vc_min);
890 * for (sg = DRD_(g_threadinfo)[i].first; sg; sg = sg->next)
911 tl_assert(sg1->next);
912 tl_assert(sg2->next);
913 tl_assert(sg1->next == sg2);
920 for (sg = DRD_(g_threadinfo)[i].first; sg; sg = sg->next)
922 if (! sg->next || DRD_(sg_get_refcnt)(sg) > 1)
932 if (! sg->next || DRD_(sg_get_refcnt)(sg) > 1)
977 for (sg = DRD_(g_threadinfo)[i].first; sg; sg = sg->next)
980 && sg->next
981 && DRD_(sg_get_refcnt)(sg->next) == 1
982 && sg->next->next
983 && thread_consistent_segment_ordering(i, sg, sg->next))
985 /* Merge sg and sg->next into sg. */
986 DRD_(sg_merge)(sg, sg->next);
987 thread_discard_segment(i, sg->next);
1162 for (p = DRD_(g_threadinfo)[i].first; p; p = p->next)
1237 for (p = DRD_(g_threadinfo)[i].first; p; p = p->next)
1296 * q->next->vc <= p->vc will also hold. Hence, break out of the
1310 q->next ? q->next->stacktrace : 0);
1329 for (p = DRD_(g_threadinfo)[tid].first; p; p = p->next)
