private void addFlows(InstructionBlock block) {
			if (block == null) {
				return;
			}
			if (!block.hasInstructionError()) {
				// Only add fall-through flow if block has no conflict
				Address fallThrough = block.getFallThrough();
				if (fallThrough != null && !startAddresses.contains(fallThrough) &&
					isNotVisitedAndHasBlock(fallThrough)) {
					flowQueue.addToFront(fallThrough);
				}
			}
			Address conflictAddr = null;
			if (block.hasInstructionError()) {
				conflictAddr = block.getInstructionConflict().getInstructionAddress();
				if (conflictAddr == null) {
					return;
				}
			}
			for (Address address : block.getBranchFlows()) {
				if (!startAddresses.contains(address) && isNotVisitedAndHasBlock(address) &&
					flowsFromBeforeCutoff(address, conflictAddr)) {
					flowQueue.add(address);
				}
			}
		}
Returns a list of conflicts for this set.  If a block is not reachable from a non-conflicted
block, it's conflicts(if any) will not be included.
@return the list of conflicts for this set.
Ghidra/Framework/SoftwareModeling/src/main/java/ghidra/program/model/lang/InstructionSet.java