We saw in the previous chapter what is the process required to build a program from different compilation units. This process happened before we obtained the final program. The question is, can this process happen when the program runs? This is, is it possible to dynamically link a program?
Today we will toy around a very simple optimization in clang and discuss a bit about separation of concerns when optimizing code.
In the previous installment of this series we saw how to alter the sequencing of our programs. Today we will see how we can reuse instructions by means of branches. Let’s talk about functions.
As I stated in my previous post, Fortran 90 improved the array capabilities of Fortran. Today we will discuss what are the challenges when compiling array expressions.
With the approval of Fortran 90, its array capabilities were largely improved. While still far from languages like APL, the extra functionality required a rethinking of the concept array in Fortran. This led to the need for array descriptors in the language.
In the previous installment we talked about the parsing technology we used, which looks like the canonical academic approach to parsing. In this chapter we will see some dificulties we encountered along the years.
So far we know how to do some computations and access memory. Today we will learn how to alter the control flow of our program.
In this chapter we will see how we can access the memory in AArch64.
In this chapter we will talk about a fascinating step that is required to create a program, even when using assembler. Today we will talk about linking.
In this chapter we will see some instructions that will allow us to compute things.