Project Plan (Part 2)

 After doing some research I have some ideas of how I am thinking to plan and the code. I will put some steps in point form in order to make it easy to follow.


github: https://github.com/a-martin94/Spo600


- As we need to run choose between three different versions at run time I will be making a few functions that are able to tell what system that it the code is about to run on.


- the first function will be for sve2 implementation. I am still trying to find the way to approach the logic and reviewing more notes and open source documents. 

- The second function will be for the sve implementation, and again trying to find best way to code this and what arguments to pass in.

- The third will be for the sve/sve2 implementation again the same comments above.

- Next I will need to make a resolver function that will have the logic to choose what implementation will be run depending on the machine its being executed on. I am looking into bit fields and how to properly use them in a function as I have been seeing this pop a lot.

- I Plan to make a function that can parse through input coming into and use built in features to make it a bit easier. The parsing function should be able to take in the test image provided in GitHub and be able to get the binary value. After the parsing is done I will return the value.

- I will need to do some more research on the autovectorizer and see how that is going to affect the project.



Comments

Post a Comment

Popular posts from this blog

Lab 4 (x86)

Image
 For this lab we were tasked with doing the same loop problem from the aarch64. How ever me being the genius I am I tried to switch to the x86 well still on the Israel server not even thinking to switch to the Portugal one. So After just getting that sorted out I can now attempt to build the code.  Also unpacking the file was needed again as you can see here:  I have so far got it loop the hello world out but just need to change it to loop for the ascii message and print the number here is my code so far min = 0                         /* starting value for the loop index; note that this is a symbol (constant), not a variable */ max = 10                        /* loop exits when the index hits this number (loop condition is i<max) */ _start:     mov     $min,%r15           /* loop index */ lo...
Read more

LAB 3 PART 1

 For this lab we were tasked with creating a simple game or using open source code and adding some of our own code to it. The lab is based on the 6502 assembler and is written in assembly language, for this task I found a classic game of snake that is written in assembly and it is a little complex but I was able to follow it and make a few changes.  Green highlight is my code and edits, Blue code is important to user input and movements Source material:  https://skilldrick.github.io/easy6502/#snake THE CODE ;  ___           _        __ ___  __ ___ ; / __|_ _  __ _| |_____ / /| __|/  \_  ) ; \__ \ ' \/ _` | / / -_) _ \__ \ () / / ; |___/_||_\__,_|_\_\___\___/___/\__/___| ; Change direction: W A S D define appleL         $00 ; screen location of apple, low byte define appleH         $01 ; screen location of apple, high byte define snakeHeadL  ...
Read more

LAB 3 PART 2

 loop:   jsr readKeys   jsr checkCollision   jsr updateSnake   jsr drawApple   jsr drawSnake   jsr spinWheels   jmp loop readKeys:   lda sysLastKey   cmp #ASCII_i   beq upKey   cmp #ASCII_l   beq rightKey   cmp #ASCII_k   beq downKey   cmp #ASCII_j   beq leftKey   rts upKey:   lda #movingDown   bit snakeDirection   bne illegalMove   lda #movingUp   sta snakeDirection   rts rightKey:   lda #movingLeft   bit snakeDirection   bne illegalMove   lda #movingRight   sta snakeDirection   rts downKey:   lda #movingUp   bit snakeDirection   bne illegalMove   lda #movingDown   sta snakeDirection   rts leftKey:   lda #movingRight   bit snakeDirection   bne illegalMove   lda #movingLeft   sta snakeDirection   rts illegalMove:   rts checkCollision:   jsr checkAppleCollision   js...
Read more