|
@@ -54,9 +54,11 @@ len_loop // do { |
|
|
* We use a simple O(n), no stack algorithm. |
|
|
* We use a simple O(n), no stack algorithm. |
|
|
* @note |
|
|
* @note |
|
|
* This function also writes to RAM address @ref RESULT the return value (which is nasty). |
|
|
* This function also writes to RAM address @ref RESULT the return value (which is nasty). |
|
|
* @arg R0: Pointer to string |
|
|
|
|
|
* @return R0: True if predicate |
|
|
|
|
|
* False if not |
|
|
|
|
|
|
|
|
* @arg src{R0} Pointer to string |
|
|
|
|
|
* @return {R0} True if palindrome, false if not or src is NULL pointer |
|
|
|
|
|
* @note |
|
|
|
|
|
* We consider an empty string "" to be a palindrome, as we can see it the same way both |
|
|
|
|
|
* from the front and the back. |
|
|
*/ |
|
|
*/ |
|
|
__asm uint32_t isPalindrome (const char* src) { |
|
|
__asm uint32_t isPalindrome (const char* src) { |
|
|
// R0: src[] |
|
|
// R0: src[] |
|
|