80   vec<bitmap> conflicts;  member
387 			   ssa_conflicts *conflicts,  in initialize_conflict_count()  argument
396   if (conflicts->conflicts[p1] && conflicts->conflicts[p2])  in initialize_conflict_count()
397     p->conflict_count = bitmap_count_unique_bits (conflicts->conflicts[p1],  in initialize_conflict_count()
398 						  conflicts->conflicts[p2]);  in initialize_conflict_count()
399   else if (conflicts->conflicts[p1])  in initialize_conflict_count()
400     p->conflict_count = bitmap_count_bits (conflicts->conflicts[p1]);  in initialize_conflict_count()
401   else if (conflicts->conflicts[p2])  in initialize_conflict_count()
402     p->conflict_count = bitmap_count_bits (conflicts->conflicts[p2]);  in initialize_conflict_count()
454 sort_coalesce_list (coalesce_list *cl, ssa_conflicts *conflicts, var_map map)  in sort_coalesce_list()  argument
483   conflicts_ = conflicts;  in sort_coalesce_list()
543   ptr->conflicts.create (size);  in ssa_conflicts_new()
544   ptr->conflicts.safe_grow_cleared (size);  in ssa_conflicts_new()
555   ptr->conflicts.release ();  in ssa_conflicts_delete()
565   bitmap bx = ptr->conflicts[x];  in ssa_conflicts_test_p()
566   bitmap by = ptr->conflicts[y];  in ssa_conflicts_test_p()
583   bitmap bx = ptr->conflicts[x];  in ssa_conflicts_add_one()
586     bx = ptr->conflicts[x] = BITMAP_ALLOC (&ptr->obstack);  in ssa_conflicts_add_one()
609   bitmap bx = ptr->conflicts[x];  in ssa_conflicts_merge()
610   bitmap by = ptr->conflicts[y];  in ssa_conflicts_merge()
621       bitmap bz = ptr->conflicts[z];  in ssa_conflicts_merge()
635       ptr->conflicts[y] = NULL;  in ssa_conflicts_merge()
640       ptr->conflicts[x] = by;  in ssa_conflicts_merge()
641       ptr->conflicts[y] = NULL;  in ssa_conflicts_merge()
656   FOR_EACH_VEC_ELT (ptr->conflicts, x, b)  in ssa_conflicts_dump()