Why the topic? Why not?

I have a question:


Code:


I originally wrote it in hexadecimal, it even had a problem, but Deep Thought found it. Eitherway, I tried to put this in mnemonics so I can get help:


Code:


What I'd like to know is how to have line breaks in text? So I could have in the output:


Code:


I don't care if the answer is hex or asm, eitherway, I'll just make it hex

You have to:
either put as many spaces in so that the lines become full
or you have to do it in 3 times:

Code:

Its totally up to you, I would prefer method 1 here, because this is not so much text.

The most optimized one seems first:D Thanks.

EDIT:


Code:


How many chars has a line though?

16 characters per line. Why are you using Pencol and Puts together, though? Pencol/penrow go with _vputs (graphscreen text), while curcol/currow go with _puts (homescreen text).

Thanks! I didn't know about that. I also know I could use HomeUp to prepare the screen here but I don't know its hex code.

Why not just use bcall(_homeup), then? And now you know about the text types. Curcol can be 0-15, Currow can be 0-7, for 16x8 homescreen characters. The graphscreen is 96x64, so pencol can be 0 to 95, and penrow can be 0 to 57 (text is 6 pixels tall!).

As I stated in the first post I'm not using mnemonics. I'll dig into that though, thanks!

The character $3F is a newline character, so you could use that. I'm not sure if it would work, though.

If I recall correctly, it would not, but that's some good outside-the-box thinking regardless. Scout, if you insist on making life harder for yourself (in my opinion) and want to learn hEx-represented ASM, you can still mix in mnemonics.

This is my code.


Code:


I understand this code, cp 1 will set the zero flag, so, when we do 'jr z, DisplayNumber', since z is set it displays number 1.

My question is, in the end of the second label (DisplayNumber1) there's a 'ret', will it end the program or is it just like 'Return' in the soubrutine and go back to the main code (Init) where it was left.

I think it goes back to:


Code:


And this is what I don't get.

a is 1, if we do "cp 2", then we set the Carry flag, not the zero flag. So why does "ret z" work?

Thanks.

The ret will end the program, since you are not calling that piece of code as a subroutine. Also, as you said, the cp 2 \ ret z will not ever get executed since a is 1 and you are jumping to DisplayNumber1.

souvik is right: it doesn't even look at the cp 2 / ret z part. one way to test out what would happen is to XOR A before the first cp and then do the ld a, 2.

If it helps at all, this is how it would be read, like a pseudocode program:


Code:

Thanks a lot.

@Ashbad:


Code:


Thanks much, it makes sense

yeah, I've learned that pseudocoding or writing something in axe first helps me understand what I'm trying to do, then I use that to translate it into assembly

I just learnt we can use increment loops in Assembly too


Code:

indeed we can which is very useful

in case you do not know how decrement loops work:


Code:


This will keep going until B == 0, and at that end, A will be equal to 150 DJNZ loops are very commonly used, but the type of loop depends on the purpose you're after.

xD Ashbad, of course I know how those loops work, and there's an error in that code:

Loop:

Eitherway, what does "xor a" do? I would ld a,0.

XOR A is a simple way of doing LD A,0 -- however it's the most optimized version, faster and smaller than LD A,0 and AND 0.

and, I use brass for labels, so I use no colons.

I don't like labels, they don't exist in hexadecimal, or at least we don't have to set them. In hex we do like:


Code:


What doex xor a do to a if a already has a value?

Let's say:


Code:


xor a:


Code:

it sets A to zero basically, XOR works by comparing A to another value in an xor bitwise comparision -- which can work like this:

Basically, xor takes two values, and checks them bit by bit. It compares to see if two corresponding bits are both the same -- if so, the returned bit for that position is zero. It only returns a 1 for that bit if only one of the bits are set

and scout, there's little point of using a mnemonic assembler if you don't use labels -- labels is one of the main points of an assembler