the10thwiz/cc65
1
0
Fork 0
Code Issues Pull Requests Packages Projects Releases Wiki Activity

Small changes to work around problems in the linuxdoc implementation of

Browse Source 
Debian Woody. Contributed by Michael Klein.


git-svn-id: svn://svn.cc65.org/cc65/trunk@3541 b7a2c559-68d2-44c3-8de9-860c34a00d81
This commit is contained in:
cuz
2005-07-24 13:32:38 +00:00
parent 8334d54622
commit 43da460147
4 changed files with 28 additions and 26 deletions
Download Patch File Download Diff File Expand all files Collapse all files

8
doc/coding.sgml
View File

@@ -109,11 +109,11 @@ if you don't help. Look at this example:
i = i + OFFS + 3;
</verb></tscreen>
The expression is parsed from left to right, that means, the compiler sees
'i', and puts it contents into the secondary register. Next is OFFS, which is
The expression is parsed from left to right, that means, the compiler sees 'i',
and puts it contents into the secondary register. Next is OFFS, which is
constant. The compiler emits code to add a constant to the secondary register.
Same thing again for the constant 3. So the code produced contains a fetch of
'i', two additions of constants, and a store (into 'i'). Unfortunately, the
Same thing again for the constant 3. So the code produced contains a fetch
of 'i', two additions of constants, and a store (into 'i'). Unfortunately, the
compiler does not see, that "OFFS + 3" is a constant for itself, since it does
it's evaluation from left to right. There are some ways to help the compiler
to recognize expression like this: