editing disabled
vivdesh
Actions
Navigation
project report 1 (project description)

project report 2 (progress report)

Project Report 3 (Final Report)
- High Level Design
- Dependency Analysis and Vectorization Algorithm
- Data Structures Used in Implementation
- Vector Extensions to Grammar and Pseudo Compiler
- Test Cases
- Performance Evaluation
- Task Division
- References and resources


References and resources
guest · Join · Help · Sign In · Wikispaces
Add To FavoritesTest CasesProtected

Protected
Testing is divided into two parts:
1. We first test whether vectorizable instructions are identified and are correctly transformed into vector instructions.
2. Then we test whether the .tmp file generated(which contains vector additions) is correctly transformed to LLVM IR(.ll file)
1. For the 1st part, following are some of the test cases been tested and their outcomes.
Functionality tested
 Input source code(.psd)
 Expected output
 Generated .tmp file
ZIV subscripts
 FOR i:=1 TO 10 DO
a[j] := b[i] + c[1];
c[j] := a[1] + a[j-1];
ENDFOR;
 FOR i:=1 TO 10 DO
a[j] := b[i] + c[i];
c[i] := a[1] + a[j - 1];
ENDFOR;
 FOR i:=1 TO 10 DO
a[j] := b[i] + c[i];
c[i] := a[1] + a[j - 1];
ENDFOR;
Strong SIV
 FOR i:=1 TO 32 DO
a[i] := a[i-1] + c[i];
ENDFOR;
 FOR i:=1 TO 32 DO
a[i] := a[i - 1] + c[i];
ENDFOR;
 FOR i:=1 TO 32 DO
a[i] := a[i - 1] + c[i];
ENDFOR;
Strong SIV
('d' > loop- bounds)
 FOR i:=1 TO 32 DO
a[i] := a[i+32] + c[i];
ENDFOR;
 a[1:32] :=:32 a[1+32:32+32] +:32 c[1:32];
 a[1:32] :=:32 a[1+32:32+32] +:32 c[1:32];
Strong SIV(non-integer 'd')
 FOR i:=1 TO 32 DO
a[3*i+1] := a[3*i+32] + c[i];
ENDFOR;
 a[3*1+1:3*32+1] :=:32 a[3*1+32:3*32+32] +:32 c[1:32];
 a[3*1+1:3*32+1] :=:32 a[3*1+32:3*32+32] +:32 c[1:32];
Strong SIV
 FOR i:=1 TO 32 DO
a[3 * i + 1] := a[3 * i + 61] + c[i];
ENDFOR;
 FOR i:=1 TO 32 DO
a[3 * i + 1] := a[3 * i + 61] + c[i];
ENDFOR;
 FOR i:=1 TO 32 DO
a[3 * i + 1] := a[3 * i + 61] + c[i];
ENDFOR;
Weak zero SIV
 FOR i:=1 TO 32 DO
a[i] := a[i] + c[i];
d[i] := a[10] + c[i];
ENDFOR;
 FOR i:=1 TO 32 DO
a[i] := a[i] + c[i];
d[i] := a[10] + c[i];
ENDFOR;
 FOR i:=1 TO 32 DO
a[i] := a[i] + c[i];
d[i] := a[10] + c[i];
ENDFOR;
Weak zero SIV
('d' outside array bounds)
 FOR i:=1 TO 32 DO
a[i] := a[i] + c[i];
d[i] := a[80] + c[i];
ENDFOR;
 a[1:32] :=:32 a[1:32] +:32 c[1:32];
FOR i:=1 TO 32 DO
d[i] := a[80] + c[i];
ENDFOR;
 FOR i:=1 TO 32 DO
d[i] := a[80] + c[i];
ENDFOR;
a[1:32] :=:32 a[1:32] +:32 c[1:32];
Weak zero SIV
('d' not an integer)
 FOR i:=1 TO 32 DO
a[2*i] := a[2*i] + c[i];
d[i] := a[9] + c[i];
ENDFOR;
 a[2*1:2*32] :=:32 a[2*1:2*32] +:32 c[1:32];
FOR i:=1 TO 32 DO
d[i] := a[9] + c[i];
ENDFOR;
 FOR i:=1 TO 32 DO
d[i] := a[9] + c[i];
ENDFOR;
a[2*1:2*32] :=:32 a[2*1:2*32] +:32 c[1:32];
Weak crossing SIV('d' is integer)
 FOR i:=1 TO 32 DO
a[-2*i+1] := a[2*i+13] + c[i];
ENDFOR;
 FOR i:=1 TO 32 DO
a[-2 * i + 1] := a[2 * i + 13] + c[i];
ENDFOR;
 FOR i:=1 TO 32 DO
a[-2 * i + 1] := a[2 * i + 13] + c[i];
ENDFOR;
Weak crossing SIV('d' is integer+1/2)
 FOR i:=1 TO 32 DO
a[-2*i+1] := a[2*i+15] + c[i];
ENDFOR;
 FOR i:=1 TO 32 DO
a[-2 * i + 1] := a[2 * i + 15] + c[i];
ENDFOR;
 FOR i:=1 TO 32 DO
a[-2 * i + 1] := a[2 * i + 15] + c[i];
ENDFOR;
Weak crossing SIV('d' outside loop bounds)
 FOR i:=1 TO 32 DO
a[-2*i+1] := a[2*i+257] + c[i];
ENDFOR;
 a[-2*1+1:-2*32+1] :=:32 a[2*1+257:2*32+257] +:32 c[1:32];
 a[-2*1+1:-2*32+1] :=:32 a[2*1+257:2*32+257] +:32 c[1:32];
Weak crossing SIV('d' not a integer or int1/2)
 FOR i:=1 TO 32 DO
a[-2*i+1] := a[2*i+14] + c[i];
ENDFOR;
 a[-2*1+1:-2*32+1] :=:32 a[2*1+14:2*32+14] +:32 c[1:32];
 a[-2*1+1:-2*32+1] :=:32 a[2*1+14:2*32+14] +:32 c[1:32];
General SIV
 FOR i:=1 TO 32 DO
a[2*i+1] := a[3*i+15] + c[i];
ENDFOR;
 a[2*1+1:2*32+1] :=:32 a[3*1+15:3*32+15] +:32 c[1:32];
 a[2*1+1:2*32+1] :=:32 a[3*1+15:3*32+15] +:32 c[1:32];
General SIV
 FOR i:=1 TO 32 DO
a[2*i+15] := a[3*i+1] + c[i];
ENDFOR;
 FOR i:=1 TO 32 DO
a[2 * i + 15] := a[3 * i + 1] + c[i];
ENDFOR;
 FOR i:=1 TO 32 DO
a[2 * i + 15] := a[3 * i + 1] + c[i];
ENDFOR;

Home
Loading...
Home Turn Off "Getting Started"
Loading...