Searched refs:pt_a (Results 1 – 2 of 2) sorted by relevance
954 collinear_path<T> find_start_and_end_of_collinear_edges(point_ptr<T> pt_a, point_ptr<T> pt_b) { in find_start_and_end_of_collinear_edges() argument956 bool same_ring = pt_a->ring == pt_b->ring; in find_start_and_end_of_collinear_edges()957 point_ptr<T> back = pt_a; in find_start_and_end_of_collinear_edges()963 if (back == pt_a) { in find_start_and_end_of_collinear_edges()978 if (!first && (back == pt_a || forward == pt_b)) { in find_start_and_end_of_collinear_edges()993 while (!same_ring && *start_a == *start_a->next && start_a != pt_a) { in find_start_and_end_of_collinear_edges()1002 forward = pt_a; in find_start_and_end_of_collinear_edges()1018 if (forward == pt_a) { in find_start_and_end_of_collinear_edges()1022 if (!first && (back == pt_b || forward == pt_a)) { in find_start_and_end_of_collinear_edges()1039 while (!same_ring && *end_a == *end_a->prev && end_a != pt_a) { in find_start_and_end_of_collinear_edges()[all …]
240 struct dma_fence *pt_a = a_fences[i_a]; in sync_file_merge() local243 if (pt_a->context < pt_b->context) { in sync_file_merge()244 add_fence(fences, &i, pt_a); in sync_file_merge()247 } else if (pt_a->context > pt_b->context) { in sync_file_merge()252 if (__dma_fence_is_later(pt_a->seqno, pt_b->seqno, in sync_file_merge()253 pt_a->ops)) in sync_file_merge()254 add_fence(fences, &i, pt_a); in sync_file_merge()