Source:NetHack 5.0.0/src/strutil.c
Jump to navigation
Jump to search
Below is the full text to strutil.c from the source code of NetHack 5.0.0. To link to a particular line, write [[Source:NetHack 5.0.0/src/strutil.c#line12]], for example.
The NetHack General Public License applies to screenshots, source code and other content from NetHack.
This content was modified from the original NetHack source code distribution (by splitting up NetHack content between wiki pages, and possibly further editing). See the page history for a list of who changed it, and on what dates.
1. /* NetHack 5.0 strutil.c $NHDT-Date: 1709571807 2024/03/04 17:03:27 $ $NHDT-Branch: keni-mdlib-followup $:$NHDT-Revision: 1.0 $ */ 2. /* Copyright (c) Robert Patrick Rankin, 1991 */ 3. /* NetHack may be freely redistributed. See license for details. */ 4. 5. #include "hack.h" /* for config.h+extern.h */ 6. 7. /* strbuf_init() initializes strbuf state for use */ 8. void 9. strbuf_init(strbuf_t *strbuf) 10. { 11. strbuf->str = NULL; 12. strbuf->len = 0; 13. } 14. 15. /* strbuf_append() appends given str to strbuf->str */ 16. void 17. strbuf_append(strbuf_t *strbuf, const char *str) 18. { 19. int len = (int) strlen(str) + 1; 20. 21. strbuf_reserve(strbuf, 22. len + (strbuf->str ? (int) strlen(strbuf->str) : 0)); 23. Strcat(strbuf->str, str); 24. } 25. 26. /* strbuf_reserve() ensure strbuf->str has storage for len characters */ 27. void 28. strbuf_reserve(strbuf_t *strbuf, int len) 29. { 30. if (strbuf->str == NULL) { 31. strbuf->str = strbuf->buf; 32. strbuf->str[0] = '\0'; 33. strbuf->len = (int) sizeof strbuf->buf; 34. } 35. 36. if (len > strbuf->len) { 37. char *oldbuf = strbuf->str; 38. 39. strbuf->len = len + (int) sizeof strbuf->buf; 40. strbuf->str = (char *) alloc(strbuf->len); 41. Strcpy(strbuf->str, oldbuf); 42. if (oldbuf != strbuf->buf) 43. free((genericptr_t) oldbuf); 44. } 45. } 46. 47. /* strbuf_empty() frees allocated memory and set strbuf to initial state */ 48. void 49. strbuf_empty(strbuf_t *strbuf) 50. { 51. if (strbuf->str != NULL && strbuf->str != strbuf->buf) 52. free((genericptr_t) strbuf->str); 53. strbuf_init(strbuf); 54. } 55. 56. /* strbuf_nl_to_crlf() converts all occurrences of \n to \r\n */ 57. void 58. strbuf_nl_to_crlf(strbuf_t *strbuf) 59. { 60. if (strbuf->str) { 61. int len = (int) strlen(strbuf->str); 62. int count = 0; 63. char *cp = strbuf->str; 64. 65. while (*cp) 66. if (*cp++ == '\n') 67. count++; 68. if (count) { 69. strbuf_reserve(strbuf, len + count + 1); 70. for (cp = strbuf->str + len + count; count; --cp) 71. if ((*cp = cp[-count]) == '\n') { 72. *--cp = '\r'; 73. --count; 74. } 75. } 76. } 77. } 78. 79. /* strlen() but returns unsigned and panics if string is unreasonably long; 80. used by dlb as well as by nethack */ 81. unsigned 82. Strlen_( 83. const char *str, 84. const char *file, 85. int line) 86. { 87. const char *p; 88. size_t len; 89. 90. /* strnlen(str, LARGEST_INT) w/o requiring posix.1 headers or libraries */ 91. for (p = str, len = 0; len < LARGEST_INT; ++len) 92. if (*p++ == '\0') 93. break; 94. 95. if (len == LARGEST_INT) 96. panic("%s:%d string too long", file, line); 97. return (unsigned) len; 98. } 99. 100. staticfn boolean pmatch_internal(const char *, const char *, boolean, 101. const char *); 102. /* guts of pmatch(), pmatchi(), and pmatchz(); 103. match a string against a pattern */ 104. staticfn boolean 105. pmatch_internal(const char *patrn, const char *strng, 106. boolean ci, /* True => case-insensitive, 107. False => case-sensitive */ 108. const char *sk) /* set of characters to skip */ 109. { 110. char s, p; 111. /* 112. * Simple pattern matcher: '*' matches 0 or more characters, '?' matches 113. * any single character. Returns TRUE if 'strng' matches 'patrn'. 114. */ 115. pmatch_top: 116. if (!sk) { 117. s = *strng++; 118. p = *patrn++; /* get next chars and pre-advance */ 119. } else { 120. /* fuzzy match variant of pmatch; particular characters are ignored */ 121. do { 122. s = *strng++; 123. } while (strchr(sk, s)); 124. do { 125. p = *patrn++; 126. } while (strchr(sk, p)); 127. } 128. if (!p) /* end of pattern */ 129. return (boolean) (s == '\0'); /* matches iff end of string too */ 130. else if (p == '*') /* wildcard reached */ 131. return (boolean) ((!*patrn 132. || pmatch_internal(patrn, strng - 1, ci, sk)) 133. ? TRUE 134. : s ? pmatch_internal(patrn - 1, strng, ci, sk) 135. : FALSE); 136. else if ((ci ? lowc(p) != lowc(s) : p != s) /* check single character */ 137. && (p != '?' || !s)) /* & single-char wildcard */ 138. return FALSE; /* doesn't match */ 139. else /* return pmatch_internal(patrn, strng, ci, sk); */ 140. goto pmatch_top; /* optimize tail recursion */ 141. } 142. 143. /* case-sensitive wildcard match */ 144. boolean 145. pmatch(const char *patrn, const char *strng) 146. { 147. return pmatch_internal(patrn, strng, FALSE, (const char *) 0); 148. } 149. 150. /* case-insensitive wildcard match */ 151. boolean 152. pmatchi(const char *patrn, const char *strng) 153. { 154. return pmatch_internal(patrn, strng, TRUE, (const char *) 0); 155. } 156. 157. 158. /*strutil.c*/