This lab is done individually. V2.<\/strong><\/p>\n In this lab, you will write assembly code with increasing complexity.<\/p>\n You will use your computer and program on the cpen211-ssh RISC-V compute servers. There are 4 parts to this lab:<\/p>\n Each part requires adding complexity to your program.<\/p>\n Make a copy of hello.s, and call it rect.s, eg in Linux type: In the steps below, modify rect.s incrementally to build up your solution. It is Print an asterisk \u201c*\u201d and a new line \u201c\\n\u201d.<\/p>\n Modify the program so you print a single asterisk character \u201c*\u201d, then print Make sure your program works before going to the next step.<\/p>\n<\/li>\n<\/ul>\n<\/li>\n Print N asterisk characters ending with a new line.<\/p>\n Define a constant N using \u201c.equ\u201d with a small value like 3 or 4.<\/p>\n<\/li>\n Use a loop, storing the loop count and the loop end value in the t registers.<\/p>\n<\/li>\n Change the value of N. Make sure your program works for N=0 to 10. When Print N lines of text, where each line has N asterisks ending with a new line.<\/p>\n Add another loop outside of the loop in step 6, using more t registers.<\/p>\n<\/li>\n Change the value of N. Make sure your program works for N=0 to 10. When Make a copy of rect.s and call it tri.s<\/p>\n<\/li>\n Assuming the outer loop is Y=1..N (or 0..N-1, whichever you prefer), and the inner Modify the loop structure of your assembly code to match the C code below. (NOTE: do NOT simply write the C code version and compile it.) In this implementation, you will define two constants NY and NX which define the number of lines of text (NY) and the number of asterisks to print (NX) at the base of the triangle when Y=NY.<\/p>\n Running tri(4,8), where NX=4 and NY=8, should print this:<\/p>\n Running tri(8,4), where NX=8 and NY=4, should print this:<\/p>\n Test your program with a variety of values for NX and NY.<\/p>\n<\/li>\n<\/ol>\nLearning Objectives<\/h2>\n
\n
Abstract<\/h2>\n
Equipment<\/h2>\n
\nYou may wish to consult the RISC-V Instruction Set Summary (1 page) or (4 page)
\nversions.<\/p>\nOverview<\/h2>\n
\n
A. Hello World<\/h3>\n
\n
\n
\n
.equ<\/code> lines ?<\/li>\n.ascii<\/code> line?<\/li>\n
\nstring? Hint: don\u2019t forget to change the string length (unlike C, strings in
\nassembly are not null-terminated by default.) These two characters
\nrepresent a single, non-printable ASCII character \u2013 what is the decimal and
\nhexadecimal value of this non-printable character?<\/li>\n
\nmessage. Many of you skipped this step \u2013 make sure you do it this time!<\/li>\n<\/ul>\n<\/li>\n<\/ol>\nB. Rectangle<\/h3>\n
\n
\ncp hello.s rect.s <\/p>\n<\/li>\n
\nstrongly advised you do not skip ahead and go to the last part, or you will find
\ndebugging very challenging.<\/p>\n\n
\n
\na newline character \u201c\\n\u201d, then exit.<\/p>\n<\/li>\n\n
\nN=0, no stars should print and no newline should print.<\/p>\n<\/li>\n<\/ul>\n<\/li>\n\n
\nN=0, no stars should print and no newline should print.<\/p>\n<\/li>\n<\/ul>\n<\/li>\n<\/ol>\nC. Triangles<\/h3>\n
\n
\nloop is X=1..N (likewise, 0..N-1 is ok), modify the inner loop X so that it only prints
\nup to Y stars, that is X=1..Y. This should print a simple right-angle triangle where
\nthe diagonal is exactly 45 degrees.<\/p>\n\n
void tri( int NX, int NY )\n{\n int x_max = NX;\n for( int y=0; y < NY; y++ ) {\n for( int x=0; x < x_max; x += NY ) {\n printf(\"*\");\n }\n printf(\"\\n\");\n x_max += NX;\n }\n}<\/code><\/pre>\n\n
*\n*\n**\n**\n***\n***\n****\n****<\/code><\/pre>\n<\/li>\n<\/ul>\n\n
**\n****\n******\n********<\/code><\/pre>\n<\/li>\n<\/ul>\n<\/li>\nD. Subroutines<\/h3>\n
\n
\nand NY as arguments in a0 and a1, respectively. The main part should only set up
\nthe arguments, call tri(), and then exit. Note: you can rely upon the value of the
\nstack pointer (sp) being set up for you automatically by the compilation system.<\/li>\nSUBMISSION REQUIREMENTS<\/h3>\n