48 #define func_prev(func)		list_prev_entry(func, l)  argument
49 #define func_next(func)		list_next_entry(func, l)  argument
52 #define entry_bb(func)		func_first_bb(func)  argument
53 #define exit_bb(func)		func_last_bb(func)  argument
58 #define func_first_bb(func)	\  argument
59 	list_first_entry(&func->bbs, struct bb_node, l)
60 #define func_last_bb(func)	\  argument
61 	list_last_entry(&func->bbs, struct bb_node, l)
65 	struct func_node *new_func, *func;  in cfg_append_func()  local
67 	list_for_each_entry(func, &cfg->funcs, l) {  in cfg_append_func()
68 		if (func->start == insn)  in cfg_append_func()
69 			return func;  in cfg_append_func()
70 		else if (func->start > insn)  in cfg_append_func()
74 	func = func_prev(func);  in cfg_append_func()
82 	list_add(&new_func->l, &func->l);  in cfg_append_func()
88 static struct bb_node *func_append_bb(struct func_node *func,  in func_append_bb()  argument
93 	list_for_each_entry(bb, &func->bbs, l) {  in func_append_bb()
134 	struct func_node *func, *last_func;  in cfg_partition_funcs()  local
136 	func = cfg_append_func(cfg, cur);  in cfg_partition_funcs()
137 	if (!func)  in cfg_partition_funcs()
145 		func = cfg_append_func(cfg, cur + cur->off + 1);  in cfg_partition_funcs()
146 		if (!func)  in cfg_partition_funcs()
152 	func = cfg_first_func(cfg);  in cfg_partition_funcs()
153 	list_for_each_entry_from(func, &last_func->l, l) {  in cfg_partition_funcs()
154 		func->end = func_next(func)->start - 1;  in cfg_partition_funcs()
165 static bool func_partition_bb_head(struct func_node *func)  in func_partition_bb_head()  argument
170 	cur = func->start;  in func_partition_bb_head()
171 	end = func->end;  in func_partition_bb_head()
172 	INIT_LIST_HEAD(&func->bbs);  in func_partition_bb_head()
173 	bb = func_append_bb(func, cur);  in func_partition_bb_head()
184 			bb = func_append_bb(func, cur + cur->off + 1);  in func_partition_bb_head()
189 				bb = func_append_bb(func, cur + 1);  in func_partition_bb_head()
199 static void func_partition_bb_tail(struct func_node *func)  in func_partition_bb_tail()  argument
204 	last = func_last_bb(func);  in func_partition_bb_tail()
205 	last->tail = func->end;  in func_partition_bb_tail()
206 	bb = func_first_bb(func);  in func_partition_bb_tail()
213 	func->bb_num = bb_idx;  in func_partition_bb_tail()
216 static bool func_add_special_bb(struct func_node *func)  in func_add_special_bb()  argument
220 	bb = func_insert_dummy_bb(&func->bbs);  in func_add_special_bb()
225 	bb = func_insert_dummy_bb(&func_last_bb(func)->l);  in func_add_special_bb()
233 static bool func_partition_bb(struct func_node *func)  in func_partition_bb()  argument
235 	if (func_partition_bb_head(func))  in func_partition_bb()
238 	func_partition_bb_tail(func);  in func_partition_bb()
243 static struct bb_node *func_search_bb_with_head(struct func_node *func,  in func_search_bb_with_head()  argument
248 	list_for_each_entry(bb, &func->bbs, l) {  in func_search_bb_with_head()
277 static bool func_add_bb_edges(struct func_node *func)  in func_add_bb_edges()  argument
283 	bb = entry_bb(func);  in func_add_bb_edges()
289 	bb = exit_bb(func);  in func_add_bb_edges()
295 	bb = entry_bb(func);  in func_add_bb_edges()
297 	list_for_each_entry_from(bb, &exit_bb(func)->l, l) {  in func_add_bb_edges()
311 			e->dst = func_search_bb_with_head(func,  in func_add_bb_edges()
326 		e->dst = func_search_bb_with_head(func, insn + insn->off + 1);  in func_add_bb_edges()
336 	struct func_node *func;  in cfg_build()  local
343 	list_for_each_entry(func, &cfg->funcs, l) {  in cfg_build()
344 		if (func_partition_bb(func) || func_add_special_bb(func))  in cfg_build()
347 		if (func_add_bb_edges(func))  in cfg_build()
356 	struct func_node *func, *func2;  in cfg_destroy()  local
358 	list_for_each_entry_safe(func, func2, &cfg->funcs, l) {  in cfg_destroy()
361 		list_for_each_entry_safe(bb, bb2, &func->bbs, l) {  in cfg_destroy()
378 		list_del(&func->l);  in cfg_destroy()
379 		free(func);  in cfg_destroy()
384 draw_bb_node(struct func_node *func, struct bb_node *bb, struct dump_data *dd,  in draw_bb_node()  argument
395 	       func->idx, bb->idx, shape);  in draw_bb_node()
404 		start_idx = bb->head - func->start;  in draw_bb_node()
413 static void draw_bb_succ_edges(struct func_node *func, struct bb_node *bb)  in draw_bb_succ_edges()  argument
417 	int func_idx = func->idx;  in draw_bb_succ_edges()
433 func_output_bb_def(struct func_node *func, struct dump_data *dd,  in func_output_bb_def()  argument
438 	list_for_each_entry(bb, &func->bbs, l) {  in func_output_bb_def()
439 		draw_bb_node(func, bb, dd, opcodes, linum);  in func_output_bb_def()
443 static void func_output_edges(struct func_node *func)  in func_output_edges()  argument
445 	int func_idx = func->idx;  in func_output_edges()
448 	list_for_each_entry(bb, &func->bbs, l) {  in func_output_edges()
449 		draw_bb_succ_edges(func, bb);  in func_output_edges()
462 	struct func_node *func;  in cfg_dump()  local
465 	list_for_each_entry(func, &cfg->funcs, l) {  in cfg_dump()
467 		       func->idx, func->idx);  in cfg_dump()
468 		func_output_bb_def(func, dd, opcodes, linum);  in cfg_dump()
469 		func_output_edges(func);  in cfg_dump()