zenithsiz/ftmemsim-valgrind
1
0
Fork 0
mirror of https://github.com/Zenithsiz/ftmemsim-valgrind.git synced 2026-02-03 18:13:01 +00:00
Code Issues Actions Packages Projects Releases Wiki Activity

mips64: add test cases for Cavium BBIT032 and BBIT132

Browse Source 
This is a follow up to VEX r3028. This change adds two test cases
for Cavium instructions BBIT032 and BBIT132.

Issue tracked in BZ #339288.

Patch by Maran Pakkirisamy.


git-svn-id: svn://svn.valgrind.org/valgrind/trunk@14792
This commit is contained in:
Petar Jovanovic 2014-11-26 23:50:31 +00:00
parent 3129007b9a
commit 65c74e8e8a
2 changed files with 40 additions and 0 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

38
none/tests/mips64/cvm_bbit.c
View File

@ -33,6 +33,44 @@ int main()
printf("TEST bbit0: %s\n", t1 == 0x08 ? "PASS" : "FAIL");
printf("TEST bbit1: %s\n", t2 == 0xF7 ? "PASS" : "FAIL");
long int lt1 = 0;
long int lt2 = 0;
long int lt3 = 0xff00000000;
long int lt4 = 0x100000000;
/* Take 0x100000000 and loop until 35th bit is set
by incrementing 0x100000000 at a time. */
__asm__ volatile(
".set noreorder" "\n\t"
"move $t0, $zero" "\n\t"
"move $t1, %1" "\n\t"
"label4:" "\n\t"
"dadd $t0, $t0, $t1" "\n\t"
"bbit032 $t0, 0x3, label4" "\n\t"
"nop" "\n\t"
"move %0, $t0" "\n\t"
".set reorder" "\n\t"
: "=r" (lt1)
: "r" (lt4)
: "t0", "t1");
/* Take 0xff00000000 and loop until 35th bit is cleared
by decrementing 0x100000000 at a time. */
__asm__ volatile(
".set noreorder" "\n\t"
"move $t0, %1" "\n\t"
"move $t1, %2" "\n\t"
"label3:" "\n\t"
"dadd $t0, $t0, $t1" "\n\t"
"bbit132 $t0, 0x3, label3" "\n\t"
"nop" "\n\t"
"move %0, $t0" "\n\t"
".set reorder" "\n\t"
: "=r" (lt2)
: "r" (lt3), "r" (-lt4)
: "t0", "t1");
printf("TEST bbit032: %s\n", lt1 == 0x0800000000 ? "PASS" : "FAIL");
printf("TEST bbit132: %s\n", lt2 == 0xF700000000 ? "PASS" : "FAIL");
#endif
return 0;
}

2
none/tests/mips64/cvm_bbit.stdout.exp
View File

@ -1,2 +1,4 @@
TEST bbit0: PASS
TEST bbit1: PASS
TEST bbit032: PASS
TEST bbit132: PASS