+ /* The algorithm calculates a lower and upper bound for the offset of each
+ * fragment. With this information we can calculate a lower and upper bound
+ * for the size of each jump instruction.
+ * A single iteration updates the offset bounds for all fragments and jump
+ * sizes for each fragment. We iterate until we had an iteration where
+ * none of the minimum offsets changed. */