77 struct block_info;
85   struct block_info *src;
86   struct block_info *dst;
134 struct block_info  struct
137   block_info ();
176   struct block_info *chain;  argument
180 block_info::block_info (): succ (NULL), pred (NULL), num_succ (0), num_pred (0),  in block_info()  function
197   bool has_block (block_info *needle);
206   vector<block_info *> blocks;
219 line_info::has_block (block_info *needle)  in has_block()
264   vector<block_info> blocks;
605 typedef vector<const block_info *> block_vector_t;
634 unblock (const block_info *u, block_vector_t &blocked,  in unblock()
670 circuit (block_info *v, arc_vector_t &path, block_info *start,  in circuit()
683       block_info *w = arc->dst;  in circuit()
709 	block_info *w = arc->dst;  in circuit()
739   for (vector<block_info *>::iterator it = linfo.blocks.begin ();  in get_cycles_count()
1185 	      block_info *block = &fn->blocks[block_no];  in process_all_functions()
1614 	  block_info *src_blk = &fn->blocks[src];  in read_graph_file()
1687 	  block_info *block = &fn->blocks[blockno];  in read_graph_file()
1849   block_info *blk;  in solve_flow_graph()
1850   block_info *valid_blocks = NULL;    /* valid, but unpropagated blocks.  */  in solve_flow_graph()
1851   block_info *invalid_blocks = NULL;  /* invalid, but inferable blocks.  */  in solve_flow_graph()
1902       block_info const *prev_dst = NULL;  in solve_flow_graph()
2020 	      block_info *dst;  in solve_flow_graph()
2056 	      block_info *src;  in solve_flow_graph()
2110   block_info **queue = XALLOCAVEC (block_info *, fn->blocks.size ());  in find_exception_blocks()
2121       block_info *block = queue[--ix];  in find_exception_blocks()
2493       block_info *block = &fn->blocks[ix];  in add_line_counts()
2589       for (vector<block_info *>::iterator it = line->blocks.begin ();  in accumulate_line_info()
2853       for (vector<block_info *>::const_iterator it = line->blocks.begin ();  in output_line_details()