stdstring.c 2.8 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081
  1. /*
  2. * Copyright (c) 1988 Regents of the University of California.
  3. * All rights reserved.
  4. *
  5. * Redistribution and use in source and binary forms, with or without
  6. * modification, are permitted provided that the following conditions
  7. * are met:
  8. * 1. Redistributions of source code must retain the above copyright
  9. * notice, this list of conditions and the following disclaimer.
  10. * 2. Redistributions in binary form must reproduce the above copyright
  11. * notice, this list of conditions and the following disclaimer in the
  12. * documentation and/or other materials provided with the distribution.
  13. * 3. Neither the name of the University nor the names of its contributors
  14. * may be used to endorse or promote products derived from this software
  15. * without specific prior written permission.
  16. *
  17. * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
  18. * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
  19. * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
  20. * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
  21. * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
  22. * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
  23. * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
  24. * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
  25. * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
  26. * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
  27. * SUCH DAMAGE.
  28. */
  29. #include <string.h>
  30. char* nrf_strcat(char* s, const char* append) {
  31. char* save = s;
  32. for(; *s; ++s)
  33. ;
  34. while((*s++ = *append++) != '\0')
  35. ;
  36. return (save);
  37. }
  38. static char* nrfstrtok_r(char* s, const char* delim, char** last) {
  39. char* spanp;
  40. int c, sc;
  41. char* tok;
  42. if(s == NULL && (s = *last) == NULL) return (NULL);
  43. /*
  44. * Skip (span) leading delimiters (s += strspn(s, delim), sort of).
  45. */
  46. cont:
  47. c = *s++;
  48. for(spanp = (char*)delim; (sc = *spanp++) != 0;) {
  49. if(c == sc) goto cont;
  50. }
  51. if(c == 0) { /* no non-delimiter characters */
  52. *last = NULL;
  53. return (NULL);
  54. }
  55. tok = s - 1;
  56. /*
  57. * Scan token (scan for delimiters: s += strcspn(s, delim), sort of).
  58. * Note that delim must have one NUL; we stop if we see that, too.
  59. */
  60. for(;;) {
  61. c = *s++;
  62. spanp = (char*)delim;
  63. do {
  64. if((sc = *spanp++) == c) {
  65. if(c == 0)
  66. s = NULL;
  67. else
  68. s[-1] = 0;
  69. *last = s;
  70. return (tok);
  71. }
  72. } while(sc != 0);
  73. }
  74. /* NOTREACHED */
  75. }
  76. char* nrf_strtok(char* s, const char* delim) {
  77. static char* last;
  78. return nrfstrtok_r(s, delim, &last);
  79. }