search for: juuust

...nctions (or even individual basic blocks) to minimize the needed thunks is a complex problem. But you're not doing that. Once an ordering is selected a simple greedy algorithm is optimal. There is no cost difference between a thunk that is right next to the short jump and a thunk that is only juuust within range. So you can find the lowest address jump needing a thunk to a particular target and put the thunk the maximum possible distance after it (after the end of a function, or even after any unconditional branch). Find everything else within range of that thunk and fix it up. Repeat. Other...

...;> needed thunks is a complex problem. >> >> But you're not doing that. Once an ordering is selected a simple greedy >> algorithm is optimal. >> >> There is no cost difference between a thunk that is right next to the >> short jump and a thunk that is only juuust within range. So you can find >> the lowest address jump needing a thunk to a particular target and put the >> thunk the maximum possible distance after it (after the end of a function, >> or even after any unconditional branch). Find everything else within range >> of that...

Hello Rui, Thanks for the comments - Synthetic sections and rewriting relocations I think that this would definitely be worth trying. It should remove the need for thunks to be represented in the core data structures, and would allow . It would also mean that we wouldn't have to associate symbols with thunks as the relocations would directly target the thunks. ARM interworking makes reusing