Nie możesz wybrać więcej, niż 25 tematów Tematy muszą się zaczynać od litery lub cyfry, mogą zawierać myślniki ('-') i mogą mieć do 35 znaków.

86 lines
2.3KB

  1. /* Teensyduino Core Library
  2. * http://www.pjrc.com/teensy/
  3. * Copyright (c) 2013 PJRC.COM, LLC.
  4. *
  5. * Permission is hereby granted, free of charge, to any person obtaining
  6. * a copy of this software and associated documentation files (the
  7. * "Software"), to deal in the Software without restriction, including
  8. * without limitation the rights to use, copy, modify, merge, publish,
  9. * distribute, sublicense, and/or sell copies of the Software, and to
  10. * permit persons to whom the Software is furnished to do so, subject to
  11. * the following conditions:
  12. *
  13. * 1. The above copyright notice and this permission notice shall be
  14. * included in all copies or substantial portions of the Software.
  15. *
  16. * 2. If the Software is incorporated into a build system that allows
  17. * selection among a list of target devices, then similar target
  18. * devices manufactured by PJRC.COM must be included in the list of
  19. * target devices and selectable in the same manner.
  20. *
  21. * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND,
  22. * EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
  23. * MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND
  24. * NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS
  25. * BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN
  26. * ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN
  27. * CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
  28. * SOFTWARE.
  29. */
  30. #include "avr_functions.h"
  31. #include <string.h>
  32. #include <stdio.h>
  33. size_t strlen(const char *s)
  34. {
  35. size_t n=0;
  36. while (*s++) n++;
  37. return n;
  38. }
  39. char * ultoa(unsigned long val, char *buf, int radix)
  40. {
  41. unsigned digit;
  42. int i=0, j;
  43. char t;
  44. while (1) {
  45. digit = val % radix;
  46. buf[i] = ((digit < 10) ? '0' + digit : 'A' + digit - 10);
  47. val /= radix;
  48. if (val == 0) break;
  49. i++;
  50. }
  51. buf[i + 1] = 0;
  52. for (j=0; j < i; j++, i--) {
  53. t = buf[j];
  54. buf[j] = buf[i];
  55. buf[i] = t;
  56. }
  57. return buf;
  58. }
  59. char * ltoa(long val, char *buf, int radix)
  60. {
  61. if (val >= 0) {
  62. return ultoa(val, buf, radix);
  63. } else {
  64. buf[0] = '-';
  65. ultoa(-val, buf + 1, radix);
  66. return buf;
  67. }
  68. }
  69. // TODO: actually write an efficient dtostrf()....
  70. char * dtostrf(float val, int width, unsigned int precision, char *buf)
  71. {
  72. char format[20];
  73. sprintf(format, "%%%d.%df", width, precision);
  74. sprintf(buf, format, val);
  75. return buf;
  76. }