| Deepa Dinamani | eb9eefe | 2012-09-24 11:35:01 -0700 | [diff] [blame] | 1 | /* Copyright (c) 2012, The Linux Foundation. All rights reserved. |
| 2 | * |
| 3 | * Redistribution and use in source and binary forms, with or without |
| 4 | * modification, are permitted provided that the following conditions are |
| 5 | * met: |
| 6 | * * Redistributions of source code must retain the above copyright |
| 7 | * notice, this list of conditions and the following disclaimer. |
| 8 | * * Redistributions in binary form must reproduce the above |
| 9 | * copyright notice, this list of conditions and the following |
| 10 | * disclaimer in the documentation and/or other materials provided |
| 11 | * with the distribution. |
| 12 | * * Neither the name of The Linux Foundation nor the names of its |
| 13 | * contributors may be used to endorse or promote products derived |
| 14 | * from this software without specific prior written permission. |
| 15 | * |
| 16 | * THIS SOFTWARE IS PROVIDED "AS IS" AND ANY EXPRESS OR IMPLIED |
| 17 | * WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF |
| 18 | * MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NON-INFRINGEMENT |
| 19 | * ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS |
| 20 | * BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR |
| 21 | * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF |
| 22 | * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR |
| 23 | * BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, |
| 24 | * WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE |
| 25 | * OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN |
| 26 | * IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. |
| 27 | */ |
| 28 | |
| 29 | #include <stdlib.h> |
| 30 | #include <string.h> |
| 31 | #include <ctype.h> |
| 32 | |
| 33 | int |
| 34 | itoa(int num, unsigned char* str, int len, int base) |
| 35 | { |
| 36 | int sum = num; |
| 37 | int i = 0; |
| 38 | int digit; |
| 39 | |
| 40 | if (len == 0) |
| 41 | return -1; |
| 42 | |
| 43 | do |
| 44 | { |
| 45 | digit = sum % base; |
| 46 | |
| 47 | if (digit < 0xA) |
| 48 | str[i++] = '0' + digit; |
| 49 | else |
| 50 | str[i++] = 'A' + digit - 0xA; |
| 51 | |
| 52 | sum /= base; |
| 53 | |
| 54 | }while (sum && (i < (len - 1))); |
| 55 | |
| 56 | if (i == (len - 1) && sum) |
| 57 | return -1; |
| 58 | |
| 59 | str[i] = '\0'; |
| 60 | strrev(str); |
| 61 | |
| 62 | return 0; |
| 63 | } |