diff options
| author | Joshua Bakita <jbakita@cs.unc.edu> | 2020-10-22 00:37:06 -0400 |
|---|---|---|
| committer | Joshua Bakita <jbakita@cs.unc.edu> | 2020-10-22 00:37:06 -0400 |
| commit | 1849016a4c0fd3d62b0acb66e7fd0f8c92b4c6fb (patch) | |
| tree | 932b2074ccc51d279ea04495b4d840a813e28ee2 /baseline/source/anagram/anagram.c | |
| parent | 83f8b415563703d9efdf258a60f10fcca264565d (diff) | |
Fix 4 more bugs in TACLeBench
- anagram: Fix two off-by-ones, the heap size, and the result
- rijndael_dec: Reset result checksum at job start
- huff_enc: Reset mutable global variables at job start
Diffstat (limited to 'baseline/source/anagram/anagram.c')
| -rw-r--r-- | baseline/source/anagram/anagram.c | 6 |
1 files changed, 3 insertions, 3 deletions
diff --git a/baseline/source/anagram/anagram.c b/baseline/source/anagram/anagram.c index fc8b6a8..feb9784 100644 --- a/baseline/source/anagram/anagram.c +++ b/baseline/source/anagram/anagram.c | |||
| @@ -305,10 +305,10 @@ void anagram_ReadDict( void ) | |||
| 305 | _Pragma( "loopbound min 1 max 5" ) | 305 | _Pragma( "loopbound min 1 max 5" ) |
| 306 | while ( anagram_dictionary[ i ][ strlen ] != 0 ) | 306 | while ( anagram_dictionary[ i ][ strlen ] != 0 ) |
| 307 | strlen ++; | 307 | strlen ++; |
| 308 | len += strlen + 2; | 308 | len += strlen + 3; |
| 309 | } | 309 | } |
| 310 | 310 | ||
| 311 | pchBase = anagram_pchDictionary = ( char * )anagram_malloc( len ); | 311 | pchBase = anagram_pchDictionary = ( char * )anagram_malloc( len + 1 ); |
| 312 | 312 | ||
| 313 | _Pragma( "loopbound min 2279 max 2279" ) | 313 | _Pragma( "loopbound min 2279 max 2279" ) |
| 314 | for ( i = 0; i < anagram_DICTWORDS; i ++ ) { | 314 | for ( i = 0; i < anagram_DICTWORDS; i ++ ) { |
| @@ -346,7 +346,7 @@ void anagram_init( void ) | |||
| 346 | int anagram_return( void ) | 346 | int anagram_return( void ) |
| 347 | { | 347 | { |
| 348 | int i; | 348 | int i; |
| 349 | char const *answer = "duke rip amy"; | 349 | char const *answer = "duke yip arm"; |
| 350 | 350 | ||
| 351 | for ( i = 0; i < 12; i++ ) | 351 | for ( i = 0; i < 12; i++ ) |
| 352 | if ( answer[ i ] != anagram_buffer[ i ] ) | 352 | if ( answer[ i ] != anagram_buffer[ i ] ) |
