84 #define bb_prev(bb)		list_prev_entry(bb, l)  argument
85 #define bb_next(bb)		list_next_entry(bb, l)  argument
125 	struct bb_node *new_bb, *bb;  in func_append_bb()  local
127 	list_for_each_entry(bb, &func->bbs, l) {  in func_append_bb()
128 		if (bb->head == insn)  in func_append_bb()
129 			return bb;  in func_append_bb()
130 		else if (bb->head > insn)  in func_append_bb()
134 	bb = bb_prev(bb);  in func_append_bb()
143 	list_add(&new_bb->l, &bb->l);  in func_append_bb()
150 	struct bb_node *bb;  in func_insert_dummy_bb()  local
152 	bb = calloc(1, sizeof(*bb));  in func_insert_dummy_bb()
153 	if (!bb) {  in func_insert_dummy_bb()
158 	INIT_LIST_HEAD(&bb->e_prevs);  in func_insert_dummy_bb()
159 	INIT_LIST_HEAD(&bb->e_succs);  in func_insert_dummy_bb()
160 	list_add(&bb->l, after);  in func_insert_dummy_bb()
162 	return bb;  in func_insert_dummy_bb()
197 	struct bb_node *bb;  in func_partition_bb_head()  local
202 	bb = func_append_bb(func, cur);  in func_partition_bb_head()
203 	if (!bb)  in func_partition_bb_head()
213 			bb = func_append_bb(func, cur + cur->off + 1);  in func_partition_bb_head()
214 			if (!bb)  in func_partition_bb_head()
218 				bb = func_append_bb(func, cur + 1);  in func_partition_bb_head()
219 				if (!bb)  in func_partition_bb_head()
231 	struct bb_node *bb, *last;  in func_partition_bb_tail()  local
235 	bb = func_first_bb(func);  in func_partition_bb_tail()
236 	list_for_each_entry_from(bb, &last->l, l) {  in func_partition_bb_tail()
237 		bb->tail = bb_next(bb)->head - 1;  in func_partition_bb_tail()
238 		bb->idx = bb_idx++;  in func_partition_bb_tail()
247 	struct bb_node *bb;  in func_add_special_bb()  local
249 	bb = func_insert_dummy_bb(&func->bbs);  in func_add_special_bb()
250 	if (!bb)  in func_add_special_bb()
252 	bb->idx = ENTRY_BLOCK_INDEX;  in func_add_special_bb()
254 	bb = func_insert_dummy_bb(&func_last_bb(func)->l);  in func_add_special_bb()
255 	if (!bb)  in func_add_special_bb()
257 	bb->idx = EXIT_BLOCK_INDEX;  in func_add_special_bb()
275 	struct bb_node *bb;  in func_search_bb_with_head()  local
277 	list_for_each_entry(bb, &func->bbs, l) {  in func_search_bb_with_head()
278 		if (bb->head == insn)  in func_search_bb_with_head()
279 			return bb;  in func_search_bb_with_head()
310 	struct bb_node *bb;  in func_add_bb_edges()  local
312 	bb = entry_bb(func);  in func_add_bb_edges()
313 	e = new_edge(bb, bb_next(bb), EDGE_FLAG_FALLTHROUGH);  in func_add_bb_edges()
316 	list_add_tail(&e->l, &bb->e_succs);  in func_add_bb_edges()
318 	bb = exit_bb(func);  in func_add_bb_edges()
319 	e = new_edge(bb_prev(bb), bb, EDGE_FLAG_FALLTHROUGH);  in func_add_bb_edges()
322 	list_add_tail(&e->l, &bb->e_prevs);  in func_add_bb_edges()
324 	bb = entry_bb(func);  in func_add_bb_edges()
325 	bb = bb_next(bb);  in func_add_bb_edges()
326 	list_for_each_entry_from(bb, &exit_bb(func)->l, l) {  in func_add_bb_edges()
327 		e = new_edge(bb, NULL, EDGE_FLAG_EMPTY);  in func_add_bb_edges()
330 		e->src = bb;  in func_add_bb_edges()
332 		insn = bb->tail;  in func_add_bb_edges()
335 			e->dst = bb_next(bb);  in func_add_bb_edges()
337 			list_add_tail(&e->l, &bb->e_succs);  in func_add_bb_edges()
343 			list_add_tail(&e->l, &bb->e_succs);  in func_add_bb_edges()
347 		e->dst = bb_next(bb);  in func_add_bb_edges()
349 		list_add_tail(&e->l, &bb->e_succs);  in func_add_bb_edges()
351 		e = new_edge(bb, NULL, EDGE_FLAG_JUMP);  in func_add_bb_edges()
354 		e->src = bb;  in func_add_bb_edges()
356 		list_add_tail(&e->l, &bb->e_succs);  in func_add_bb_edges()
388 		struct bb_node *bb, *bb2;  in cfg_destroy()  local
390 		list_for_each_entry_safe(bb, bb2, &func->bbs, l) {  in cfg_destroy()
393 			list_for_each_entry_safe(e, e2, &bb->e_prevs, l) {  in cfg_destroy()
398 			list_for_each_entry_safe(e, e2, &bb->e_succs, l) {  in cfg_destroy()
403 			list_del(&bb->l);  in cfg_destroy()
404 			free(bb);  in cfg_destroy()
412 static void draw_bb_node(struct func_node *func, struct bb_node *bb)  in draw_bb_node()  argument
416 	if (bb->idx == ENTRY_BLOCK_INDEX || bb->idx == EXIT_BLOCK_INDEX)  in draw_bb_node()
422 	       func->idx, bb->idx, shape);  in draw_bb_node()
424 	if (bb->idx == ENTRY_BLOCK_INDEX) {  in draw_bb_node()
426 	} else if (bb->idx == EXIT_BLOCK_INDEX) {  in draw_bb_node()
434 		start_idx = bb->head - func->start;  in draw_bb_node()
435 		dump_xlated_for_graph(&dd, bb->head, bb->tail, start_idx);  in draw_bb_node()
443 static void draw_bb_succ_edges(struct func_node *func, struct bb_node *bb)  in draw_bb_succ_edges()  argument
451 	if (list_empty(&bb->e_succs))  in draw_bb_succ_edges()
454 	list_for_each_entry(e, &bb->e_succs, l) {  in draw_bb_succ_edges()
464 	struct bb_node *bb;  in func_output_bb_def()  local
466 	list_for_each_entry(bb, &func->bbs, l) {  in func_output_bb_def()
467 		draw_bb_node(func, bb);  in func_output_bb_def()
474 	struct bb_node *bb;  in func_output_edges()  local
476 	list_for_each_entry(bb, &func->bbs, l) {  in func_output_edges()
477 		draw_bb_succ_edges(func, bb);  in func_output_edges()