15:41:36ebrascaI think I understand what functions are in assembly, it is a web of pointers.
15:48:14beachThat doesn't sound like something I recognize.
15:48:45beachEverything in assembly is a sequence of instructions with some words of data from time to time.
15:49:21beachA function, if translated from a high-level language, would be called with a CALL or JSR instruction, and the function would return to the caller with a RET instruction.
15:51:35ebrascabranching instructions are like the string of the web
15:52:45ebrascaAnd all them together form the web of paths the code can take
15:53:56beachYou can certainly view it that way if you want.
16:00:49pjbbeach: in the extreme case of a 1-instruction processor, you don't have to store any bit to encode the operation code. You just need to store the addresses of the arguments or the jump.
16:00:58pjbbeach: therefore code, is purely addresses.
16:02:23pjbOf course, we can color two kinds of pointers, data pointers, and code pointers.
16:03:03pjbThis is why compilers have to perform two kinds of analysis and optimization: data flow analysis and optimization, and code flow analysis and optimization.
17:35:20jackdanielebrasca: you can say exactly the same thing about the philosophy - it may be a huge waste of time and may not give you understanding. people are far too often seduced by their own words