1 Hints for Post-Lab Quiz 1 Works for other quizzes and exams too.

Slides:



Advertisements
Similar presentations
Tutorial Essentially all the Blackfin instruction you need for all of ENCM511. The instructions are easy. Its knowing when to use them that is the difficult.
Advertisements

1 Lecture 3: MIPS Instruction Set Today’s topic:  More MIPS instructions  Procedure call/return Reminder: Assignment 1 is on the class web-page (due.
Review of the MIPS Instruction Set Architecture. RISC Instruction Set Basics All operations on data apply to data in registers and typically change the.
Branches Two branch instructions:
Lecture 9: MIPS Instruction Set
10/6: Lecture Topics Procedure call Calling conventions The stack
Procedures II (1) Fall 2005 Lecture 07: Procedure Calls (Part 2)
Blackfin BF533 EZ-KIT Control The O in I/O Activating a FLASH memory “output line” Part 2.
Blackfin BF533 EZ-KIT Control The O in I/O Activating a FLASH memory “output line” Part 3 – New instruction recap Tutorial.
Help for Assignment 2. Topics Tackled Handling some “C++” keywords when programming assembly code –Programming “subroutines called by subroutines” –Programming.
Assignment Overview Thermal oscillator One of the ENCM415 Laboratory 2 items Oscillator out GND +5V.
Blackfin BF533 EZ-KIT Control The O in I/O Activating a FLASH memory “output line” Part 2.
Building a simple loop using Blackfin assembly code M. Smith, Electrical and Computer Engineering, University of Calgary, Canada.
More Example Blackfin Code Using the E-UNITTest Framework.
Hints for Post-Lab Quiz 1 Works for other quizzes and exams too.
1 Homework Turn in HW2 at start of next class. Starting Chapter 2 K&R. Read ahead. HW3 is on line. –Due: class 9, but a lot to do! –You may want to get.
Understanding the Blackfin ADSP-BF5XX Assembly Code Format
Help for Lab. 1 Subroutines calling Subroutines. Lab 1 – Application stream File “interruptservice.cpp” extern volatile boolean mute_on; extern volatile.
Laboratory 1 – ENCM415 Familiarization with the Analog Devices’ VisualDSP++ Integrated Development Environment.
Blackfin BF533 EZ-KIT Control The O in I/O Activating a FLASH memory “output line” Part 2.
Getting the O in I/O to work on a typical microcontroller Activating a FLASH memory “output line” Part 1 Main part of Laboratory 1 Also needed for “voice.
Just enough information to program a Blackfin Familiarization assignment for the Analog Devices’ VisualDSP++ Integrated Development Environment.
Blackfin BF533 EZ-KIT Control The O in I/O
Tutorial Essentially all the Blackfin instruction you need for all of ENCM511. The instructions are easy. Its knowing when to use them that is the difficult.
Input Laboratory: GPIO Pin control needed to have the Blackfin accept your commands Re-uses information from ENEL353 and ENCM369 courses and text books.
Assembly Language Review Being able to repeat on the Blackfin the things we were able to do on the MIPS 9/19/2015 Review of 50% OF ENCM369 in 50 minutes1.
Computer Organization CS345 David Monismith Based upon notes by Dr. Bill Siever and notes from the Patterson and Hennessy Text.
Blackfin Array Handling Part 2 Moving an array between locations int * MoveASM( int foo[ ], int fee[ ], int N);
M. Smith University of Calgary.  Many people like to sing in the shower.  However, its rather boring as there is no accompaniment.  The McVASH device.
Help for Lab. 1 Subroutines calling Subroutines. Topics tackled today Handling some “C++” keywords when programming assembly code  Programming “subroutines.
1 CS232: Computer Architecture II Fall 2011 Intel i7 Quad-core.
M. Smith University of Calgary.  Many people like to sing in the shower.  However, its rather boring as there is no accompaniment.  The McVASH device.
A Play Core Timer Interrupts Acted by the Human Microcontroller Ensemble from ENCM511.
Generating “Rectify( )” Test driven development approach to TigerSHARC assembly code production Assembly code examples Part 1 of 3.
Moving Arrays -- 1 Completion of ideas needed for a general and complete program Final concepts needed for Final Review for Final – Loop efficiency.
Blackfin Array Handling Part 1 Making an array of Zeros void MakeZeroASM(int foo[ ], int N);
Works for other quizzes and exams too A FEW SLIDES ARE UPDATED OVER THE SLIDES IN THE NOTES 1 Hints for Post-Lab Quiz 1.
12/14/2015 Concept of Test Driven Development applied to Embedded Systems M. Smith University of Calgary, Canada 1 Automated Testing Environment Concepts.
Computer Systems – Machine & Assembly code. Objectives Machine Code Assembly Language Op-code Operand Instruction Set.
CSCI 156: Lab 11 Paging. Our Simple Architecture Logical memory space for a process consists of 16 pages of 4k bytes each. Your program thinks it has.
Building a simple loop using Blackfin assembly code If you can handle the while-loop correctly in assembly code on any processor, then most of the other.
Works for other quizzes and exams too 1 Hints for Post-Lab Quiz 1.
Lab. 1 – GPIO Pin control Using information ENEL353 and ENCM369 text books combined with Blackfin DATA manual.
Assembly Language Review Being able to repeat on the Blackfin the things we were able to do on the MIPS 2/26/2016 Review of 50% OF ENCM369 in 50 minutes1.
Assembly Language Review Being able to repeat on the Blackfin the things we were able to do on the MIPS 3/3/2016 Review of 50% OF ENCM369 in 50 minutes1.
“Lab. 5” – Updating Lab. 3 to use DMA Test we understand DMA by using some simple memory to memory DMA Make life more interesting, since hardware is involved,
LECTURE 3 Translation. PROCESS MEMORY There are four general areas of memory in a process. The text area contains the instructions for the application.
Lecture 3 Translation.
Lecture 6: Assembly Programs
Help for Lab. 1 Subroutines calling Subroutines
Generating the “Rectify” code (C++ and assembly code)
Generating “Rectify( )”
Generating a software loop with memory accesses
MIPS Instructions.
Handling Arrays Completion of ideas needed for a general and complete program Final concepts needed for Final.
Moving Arrays -- 1 Completion of ideas needed for a general and complete program Final concepts needed for Final Review for Final – Loop efficiency.
Assembly Language Review
Using Arrays Completion of ideas needed for a general and complete program Final concepts needed for Final.
Assembly Language Review
Hints for Post-Lab Quiz 1
Handling Arrays Completion of ideas needed for a general and complete program Final concepts needed for Final.
Tutorial Essentially all the Blackfin instruction you need for all of ENCM511. The instructions are easy. Its knowing when to use them that is the difficult.
Explaining issues with DCremoval( )
Lab. 1 – GPIO Pin control Using information ENEL353 and ENCM369 text books combined with Blackfin DATA manual.
Input Laboratory: GPIO Pin control needed to have the Blackfin accept your commands Re-uses information from ENEL353 and ENCM369 courses and text books.
Handling Arrays Completion of ideas needed for a general and complete program Final concepts needed for Final.
Blackfin BF533 EZ-KIT Control The O in I/O
Building a simple loop using Blackfin assembly code
Lecture 4: Instruction Set Design/Pipelining
Blackfin Syntax Stores, Jumps, Calls and Conditional Jumps
Presentation transcript:

1 Hints for Post-Lab Quiz 1 Works for other quizzes and exams too

2 Three types of questions  Basic Knowledge Questions  Translation Questions You are given the C++ and must convert into Blackfin assembly codeYou are given the C++ and must convert into Blackfin assembly code  Design questions Work out what is neededWork out what is needed Generate the design – in C++ or in pseudo codeGenerate the design – in C++ or in pseudo code Most often – convert design code into Blackfin assembly codeMost often – convert design code into Blackfin assembly code

3 Knowledge type question example A)Circle and label with an A -- the icon (menu item) that causes VisualDSP to compile the C++ code, but not build or rebuild the full project. B) Circle and label with a B -- a Blackfin instruction where a non-volatile register is recovered from the stack. CORRECT OR WRONG ANSWER NO PARTIAL MARKS Sometimes more than one correct answer

4 The Rosetta Stone “Question” You understand columns 1 and 2 C++ code NEW C++ keyword extern “C” long int Return1( ); long int Return1( ){ return 1; } Blackfin code.section program;.global _Return1;.section program;.global _Return1; _Return1: LINK 16; R0 = 1; R0 = 1; UNLINK; RTS; UNLINK; RTS; 68K code.section code;.global _Return1;.section code;.global _Return1; _Return1: LINK #-16, A4; MOVE.L #1, D0; MOVE.L #1, D0; UNLINK A4; RTS; UNLINK A4; RTS; Demonstrates ability to transfer knowledge Which register is used as the 68K return register? In this code, which register is used as the 68K frame pointer?

5 C++ to assembly Example ACCURACY IMPORTANT TRY TO MATCH ASSEMBLY CODE TO C++ ON A BOX BY BOX BASIS THEN EASIER TO GIVE PARTIAL MARKS #define count_R1 R1 count_R1 = 0;

6 Design question example Acts like one part of the laboratory

7 Design Question  Next to impossible to mark if not well documented Therefore many marks are given for the C++ or pseudo-code commentsTherefore many marks are given for the C++ or pseudo-code comments  More chance of partial marks if the register names are self documenting

8 Register documentation example ID_R1.L = lo(CHIPID); // Marker know that ID_R1.H = hi(CHIPID); // R1 used to store ID CC = ID_R1 == version_INPAR_R0; // Marker knows that // R0 used for version // Marker also know that you know first parameter is passed in R0 // and not on the stack – later if you make a mistake version_R1 then still a good chance for partial (or full) mark

9 Avoid errors that would take a lot of time to fix in the laboratory  Always check for possible return address and stack errors LINK -- at the start of a functionLINK -- at the start of a function UNLINK -- at the end of a functionUNLINK -- at the end of a function  Always check for NAME_MANGLING Variable _fooarray;Variable _fooarray; Function _FeeFunction__Fv (void)Function _FeeFunction__Fv (void) _FeeFunction__Fl (long int) _FeeFunction__NM (not sure) _FeeFunction__NM2 (different not sure) _FeeFunction__Fl (long int) _FeeFunction__NM (not sure) _FeeFunction__NM2 (different not sure) WITH NAME MANGLING – under exam conditions, more interested in that you understand the concept than whether you are getting it exactly correct

10 Avoid pointer errors that would take a lot of time to fix in the laboratory  If the memory location is shown as extern in C++ or.extern in Assembly extern long int funVariable; extern long int funVariable;.extern _funVariable;.extern _funVariable;.section program // will accept code.section program // will accept code P0.L = lo(_funVariable); P0.H = hi(_funVariable); P0.L = lo(_funVariable); P0.H = hi(_funVariable); _funInRegisterR0 = [P0]; _funInRegisterR0 = [P0];

11 Avoid pointer errors that would take a lot of time to fix in the laboratory  If the memory location is shown without the word EXTERN long int funVariable = 0; long int funVariable = 0;.section L1_data1; // will accept data, data.section L1_data1; // will accept data, data.global _funVariable;.global _funVariable;.var _funVariable = 0; // Follow the C++ funVariable is IN MEMORY and not yet in a register.var _funVariable = 0; // Follow the C++ funVariable is IN MEMORY and not yet in a register You must move the value from memory into a register You must move the value from memory into a register.section program.section program P0.L = lo(_funVariable); IS P0.L = _funVariable P0.L = lo(_funVariable); IS P0.L = _funVariable P0.H = hi( _funVariable); OKAY? funInRegisterR0 = [P0]; P0.H = hi( _funVariable); OKAY? funInRegisterR0 = [P0];

12 Avoid pointer errors that would take a lot of time to fix in the laboratory  If the memory location is known to be part of the special MEMORY LOCATIONS (MMR) used to control special operations of the Blackfin “peripherals” #include // will accept #include // will accept.section program.section program P0.L = lo(TCOUNT); // will accept HI( ) and LO ( ) P0.H = hi(TCOUNT); countInRegisterR0 = [P0]; P0.L = lo(TCOUNT); // will accept HI( ) and LO ( ) P0.H = hi(TCOUNT); countInRegisterR0 = [P0];

13 Know what the hi( ) and lo( ) macros do.section program.section program P0.L = lo(TCOUNT); P0.H = hi(TCOUNT); P0.L = lo(TCOUNT); P0.H = hi(TCOUNT);MEANS P0.L = TCOUNT & 0xFFFF; P0.H = (TCOUNT & 0xFFFF0000) >>16 P0.L = TCOUNT & 0xFFFF; P0.H = (TCOUNT & 0xFFFF0000) >>16

14 HINT – #define CONSTANTS don’t use CONSTANTS #define MAXVALUE Either hex or decimal is okay.section program.section program R0.L = lo(MAXVALUE); R0.H = hi(MAXVALUE); R0.L = lo(MAXVALUE); R0.H = hi(MAXVALUE); HINT: If the person is following “standard” coding conventions then CAPITIALS MEAN CONSTANT – use hi( ), lo( )

15 HINT – Will work for small constants too #define MAXVALUE Either hex or decimal is okay.section program.section program R0.L = lo(MAXVALUE); R0.H = hi(MAXVALUE); R0.L = lo(MAXVALUE); R0.H = hi(MAXVALUE); BUT IN THIS CASE – since the constant is small (short int size) R0 = MAXVALUE; R0 = MAXVALUE; Or R0 = 6; HINT: If it looks like IT MIGHT BE a big constant, then let the assembler worry about it -- use hi( ) and lo( )

16 Condition codes  times out of the following is wrong CC = R0 < number; CC = R0 < number; So play the odds R1 = number; R1 = number; CC = R0 < R1; CC = R0 < R1; Will accept CC = (R0 < R1); under exam conditions WILL NOT ACCEPT CC = R1 > R0; CC conditions are always checked VERY closely as they cause so much problem in the laboratory and in “real life”

17 LOAD AND STORE OPERATIONS  Rule to remember – if the operation would not work on the MIPS, then it will not work on the Blackfin or any other RISC processor register  memory R0 = [P1]; memory  register [P1] = R0; register  memory R0 = [P1]; memory  register [P1] = R0; NEVER add to memory, [P1] = [P0] +1; add to register R0 = R0 + [P0];

18 Register operations Add a small number Make sure that you get the common instructions correct – there are not many R0 += pretty_small_number R0 += 6 or R0 += -10; NOT R0 = R0 + 6; R0 += pretty_small_number R0 += 6 or R0 += -10; NOT R0 = R0 + 6;  Pretty_small_numbers are just that – pretty small numbers -64 <= num <= +63

19 Register operations Add a larger number  Make sure that you get the common instructions correct – there are not many R1 = larger_number; R0 = R0 + R1; R1 = 0x2000; R1 = 0x2000; R0 = R0 + R1; NOT R0 += R1; R1 = 20000; R0 = R0 + R1; R0 = R0 + R1; NOT R0 += R1; R1 = 20000; R0 = R0 + R1; R1.L = lo(40000); R1.H = hi(40000); R0 = R0 + R1; R1.L = lo(40000); R1.H = hi(40000); R0 = R0 + R1; HINT: Hexadecimal numbers are easy to work out if they are small (need 16-bits) or very large (need 32-bits). Decimal numbers are not – PLAY THE ODDS – if it looks large in decimal – then use lo( ), hi( ) approach

20 Other instructions we have used  Make sure that you get the common instructions correct – there are not many common instructions to worry about  JUMP LABEL_END; // OFTEN JUMP (P0); // typically end of function

21 Other instructions we have used  Make sure that you get the common instructions correct – there are not many  CALL _FeePassVoidFunction__Fv // void FeePassVoidFunction(void); NOTE: CALL _FeePassVoidFunction__Fv // long int FeePassVoidFunction(void); // Returns a value in R0; NOTE: CALL _FeePassVoidFunction__Fv // long int FeePassVoidFunction(void); // Returns a value in R0;

22 Other instructions we have used  Make sure that you get the common instructions correct – there are not many // void FeePassLongIntFunction(long int);  CALL _FeePassLongIntFunction__Fl (little L) CALL _FeePassLongIntFunction__NM -- okay in exam  CALL _FeePassIntFunction__Fi (little I) // void FeePassIntFunction(long int); CALL _FeePassIntFunction__NM2 -- okay in exam CALL _FeePassIntFunction__NM2 -- okay in exam

23 Other instructions we have used  Make sure that you get the common instructions correct – there are not many  R0 = 7; CALL _FeeFunction__Fl; // FeeFunction( 7);  R1 = 6; R0 = 7; CALL _FumFunction__NM; // FumFunction(7, 6 );

24 Other instructions we have used  Make sure that you get the common instructions correct – there are not many  R0 = 7; CALL _FeeFunction__Fl; // FeeFunction( 7);  R1 = 6; R0 = 7; CALL _FumFunction__NM; // FumFunction(7, 6 );

25 When to use a register and when to use memory.extern _value; // extern long int value.section L1_data;.global _fum_value; // long int fum_value;.extern _value; // extern long int value.section L1_data;.global _fum_value; // long int fum_value;.var _fum_value;.var _fum_value;.section program;.global _FooFunction__Fl; // void FooFunction(long int passed_Fickle) {.section program;.global _FooFunction__Fl; // void FooFunction(long int passed_Fickle) { _FooFunction__Fl: LINK 16; passed_Fickle_R0 += 6; // passed_Fickle = passed_Fickle +6; P0.H = _value; // value = value + 6; P0.L = _value; R1 = [P0]; R1 += 6; [P0] = R1; [P0] = R1; P1.H = _fum_value; // fum_value = fum_value + 6; P1.L = _fum_value; R2 = [P1]; R2 += 6; P1.H = _fum_value; // fum_value = fum_value + 6; P1.L = _fum_value; R2 = [P1]; R2 += 6; [P1] = R2; [P1] = R2; ……… // Rest of the function ……… // Rest of the function

26 When to use a register and when to use memory.section program;.global _FooFunction__Fl; // void FooFunction(long int passed_Fickle) {.section program;.global _FooFunction__Fl; // void FooFunction(long int passed_Fickle) { _FooFunction__Fl: LINK 16; passed_Fickle_R0 += 6; // passed_Fickle = passed_Fickle +6; #define value_R1 R1 // long int value value_R1 += 6; // value = value + 6; #define fum_valueR2 R2 // long int fum_value; #define fum_valueR2 R2 // long int fum_value; fum_value_R2 += 6; // fum_value = fum_value + 6; fum_value_R2 += 6; // fum_value = fum_value + 6; ……… // Rest of the function ……… // Rest of the function

27  Other requested question and answers