// Figure out how many regions of branch islands will be needed, and their locations.
// Construct a vector containing the atoms after which branch islands will be inserted,
// taking into account follow on fixups. No atom run without an island can exceed kBetweenRegions.
const uint64_t kBetweenRegions = maxDistanceBetweenIslands(opts, hasThumbBranches); // place regions of islands every 14MB in __text section
std::vector<const ld::Atom*> branchIslandInsertionPoints; // atoms in the atom list after which branch islands will be inserted
uint64_t previousIslandEndAddr = 0;
const ld::Atom *insertionPoint = NULL;
branchIslandInsertionPoints.reserve(totalTextSize/kBetweenRegions*2);
for (std::vector<const ld::Atom*>::iterator it=textSection->atoms.begin(); it != textSection->atoms.end(); it++) {
	const ld::Atom* atom = *it;
	// if we move past the next atom, will the run length exceed kBetweenRegions?
	if ( atom->sectionOffset() + atom->size() > previousIslandEndAddr + kBetweenRegions ) {
		// yes. Add the last known good location (atom) for inserting a branch island.
		if ( insertionPoint == NULL )
			throwf("Unable to insert branch island. No insertion point available."); // <- HERE!
		branchIslandInsertionPoints.push_back(insertionPoint);
		previousIslandEndAddr = insertionPoint->sectionOffset()+insertionPoint->size();
		insertionPoint = NULL;
	}
	// Can we insert an island after this atom? If so then keep track of it.
	if ( !atom->hasFixupsOfKind(ld::Fixup::kindNoneFollowOn) )
		insertionPoint = atom;
}