12  * 2      label v as discovered
23  * 13               if vertex w is not discovered and not explored
25  * 15                   label w as discovered
28  * 18               else if vertex w is discovered
37  * 0x10 - discovered
38  * 0x11 - discovered and fall-through edge labelled
39  * 0x12 - discovered and fall-through and branch edges labelled
44 	DISCOVERED = 0x10,  enumerator
107 	if (e == FALLTHROUGH && insn_state[t] >= (DISCOVERED | FALLTHROUGH))  in push_insn()
110 	if (e == BRANCH && insn_state[t] >= (DISCOVERED | BRANCH))  in push_insn()
127 		insn_state[t] = DISCOVERED | e;  in push_insn()
128 		insn_state[w] = DISCOVERED;  in push_insn()
133 	} else if ((insn_state[w] & 0xF0) == DISCOVERED) {  in push_insn()
142 		insn_state[t] = DISCOVERED | e;  in push_insn()
382 		/* EXPLORED || DISCOVERED */  in visit_gotox_insn()
390 		insn_state[w] |= DISCOVERED;  in visit_gotox_insn()
584 	insn_state[0] = DISCOVERED; /* mark 1st insn as discovered */  in bpf_check_cfg()
616 		insn_state[ex_insn_beg] = DISCOVERED;  in bpf_check_cfg()
677 			state[top] |= DISCOVERED;  in bpf_compute_postorder()
687 					state[succ->items[s]] |= DISCOVERED;  in bpf_compute_postorder()