SPO600 Lab1 (Pt.4) - Challenges

Two challenges regarding 6502 processor instruction will be completed.

Challenge 1 - fill in the screen with one color while the middle four pixel will be filled in with another color.

Solution:

 	lda #$00	; set a pointer in memory location $40 to point to $0200
 	sta $40		; ... low byte ($00) goes in address $40
 	lda #$02	
 	sta $41		; ... high byte ($02) goes into address $41
 	lda #$07	; colour number
 	ldy #$00	; set index to 0
 loop:	sta ($40),y	; set pixel colour at the address (pointer)+Y
 	iny		; increment index
 	bne loop	; continue until done the page (256 pixels)
 	inc $41		; increment the page
 	ldx $41		; get the current page number
 	cpx #$06	; compare with 6   
 	bne loop  	; continue until done all pages   
        lda #$02        ; second colour number
        sta $03ef       ; set pixel colour to the middle four pixels
        sta $03f0
        sta $040f
        sta $0410


Challenge 2 - Write a program which draws lines around the edge of the display:

A red line across the top

A green line across the bottom

A blue line across the right side.

A purple line across the left side.

Solution:

 ;add a purple line accrose left side
 	lda #$00 	; set pointer $0200 to address $40
 	sta $40
 	lda #$02
 	sta $41
 	lda #$20
 	sta $42
 	ldy #$00	; set index to 0

leftloop: lda $40
 	clc
 	adc $42
        sta $40
 	lda #$04 ;purple
 	sta ($40),y
 	ldx $40
 	bne leftloop
 	inc $41
 	ldx $41
 	cpx #$06
 	bne leftloop

;add a blue line across right side 
        lda #$00 	; set pointer $0200 to address $40
 	sta $40
 	lda #$02
 	sta $41
 	lda #$20
 	sta $42
 	ldy #$1f	; set index to 0

rightloop: lda $40
 	clc
 	adc $42
        sta $40
 	lda #$06 	; blue color
 	sta ($40),y
 	ldx $40
 	bne rightloop
 	inc $41
 	ldx $41
 	cpx #$06
 	bne rightloop
	
;add a red line across top 
;and a green line across bottom
 	ldy #$00	; set index to 0
xloop:  lda #$02	; red colour number
 	sta $0200,y	; set pixel colour at the top
        lda #$05        ; green colour number  
 	sta $05e0,y	; set pixel colour at the address $0000 +Y	
        iny		; increment index
        cpy #$20
 	bne xloop       ; continue until done the page (256 pixels)
The solution first draw line on the left. Then, draw line on the right. Finally, draw line on top and at the bottom.


Comments

Post a Comment

Popular posts from this blog

SPO600 Project Stage 1 (Pt.1) - Create a GCC Pass

Image
Create a GCC Pass I would like to create a GCC Pass. I expect the pass will be used to analyze the GIMPLE files. Step 1. Get to the gcc subdirectory I go to the directory of my gcc source code. Then, I get to the gcc subdirectory inside the sourcecode of gcc. Step 2. Create a very simple pass I create a Pass file modeled on the pass_nrv. I just hope the pass works first. So, the pass is as simple as possible. code: /* Test Pass Jeff Yau, Seneca Polytechnic College Modelled on tree-nrv.cc and tree-ctyler.cc by Chris Tyler, Seneca Polytechnic College, 2024-11 This file is part of GCC. GCC is free software; you can redistribute it and/or modify it under the terms of the GNU General Public License as published by the Free Software Foundation; either version 3, or (at your option) any later version. GCC is distributed in the hope that it will be useful, but WITHOUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. Se...
Read more

SPO600 Project Stage 2 (Pt.1) - GCC pass locating clone function

Image
In project stage 1, I created a GCC pass in both x86-64 server and AARCH64 server to print the functions' name and counting number of block. Now, I would like to revise the pass again and increase it's functionality. Step 1. Modify the pass First, I would like to detect if the function is a clone. When a clone is detected, loop will be broken. Meanwhile, just ignore the count of statement and blocks first. They will be useful for later part. revised code: /* Test Pass Jeff Yau, Seneca Polytechnic College Student ID :142466234 Modelled on tree-nrv.cc and tree-ctyler.cc by Chris Tyler, Seneca Polytechnic College, 2024-11 This file is part of GCC. GCC is free software; you can redistribute it and/or modify it under the terms of the GNU General Public License as published by the Free Software Foundation; either version 3, or (at your option) any later version. GCC is distributed in the hope that it will be useful, but WITHOUT ANY WARRANTY; without even th...
Read more

SPO600 Project Stage 2 (Pt.2) - GCC pass locating clone function -modified version

Image
In project stage 1, I created a GCC pass in both x86-64 server and AARCH64 server to print the functions' name and counting number of block. In stage 2 pt.1, I was trying to modify the code to locate the clone but in vain. I sought advice from my professor, Chris Tyler and note that for the default version of the clone, the node->name() function will return function name without any .variant, i.e. without .default . That's why the previous version does not work. As a result, I revised the code accordingly and it works now. revised code: /* Test Pass Jeff Yau, Seneca Polytechnic College Student ID :142466234 Modelled on tree-nrv.cc and tree-ctyler.cc by Chris Tyler, Seneca Polytechnic College, 2024-11 This file is part of GCC. GCC is free software; you can redistribute it and/or modify it under the terms of the GNU General Public License as published by the Free Software Foundation; either version 3, or (at your option) any later version. GCC is dis...
Read more