/contrib/tcsh/tw.spell.c

https://bitbucket.org/freebsd/freebsd-head/ · C · 162 lines · 98 code · 12 blank · 52 comment · 51 complexity · a20e419663f33a32e5913641bea43983 MD5 · raw file

  1. /* $Header: /p/tcsh/cvsroot/tcsh/tw.spell.c,v 3.21 2006/03/02 18:46:45 christos Exp $ */
  2. /*
  3. * tw.spell.c: Spell check words
  4. */
  5. /*-
  6. * Copyright (c) 1980, 1991 The Regents of the University of California.
  7. * All rights reserved.
  8. *
  9. * Redistribution and use in source and binary forms, with or without
  10. * modification, are permitted provided that the following conditions
  11. * are met:
  12. * 1. Redistributions of source code must retain the above copyright
  13. * notice, this list of conditions and the following disclaimer.
  14. * 2. Redistributions in binary form must reproduce the above copyright
  15. * notice, this list of conditions and the following disclaimer in the
  16. * documentation and/or other materials provided with the distribution.
  17. * 3. Neither the name of the University nor the names of its contributors
  18. * may be used to endorse or promote products derived from this software
  19. * without specific prior written permission.
  20. *
  21. * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
  22. * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
  23. * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
  24. * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
  25. * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
  26. * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
  27. * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
  28. * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
  29. * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
  30. * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
  31. * SUCH DAMAGE.
  32. */
  33. #include "sh.h"
  34. RCSID("$tcsh: tw.spell.c,v 3.21 2006/03/02 18:46:45 christos Exp $")
  35. #include "tw.h"
  36. /* spell_me : return corrrectly spelled filename. From K&P spname */
  37. int
  38. spell_me(struct Strbuf *oldname, int looking, Char *pat, eChar suf)
  39. {
  40. struct Strbuf guess = Strbuf_INIT, newname = Strbuf_INIT;
  41. const Char *old = oldname->s;
  42. size_t ws;
  43. int foundslash = 0;
  44. int retval;
  45. cleanup_push(&guess, Strbuf_cleanup);
  46. cleanup_push(&newname, Strbuf_cleanup);
  47. for (;;) {
  48. while (*old == '/') { /* skip '/' */
  49. Strbuf_append1(&newname, *old++);
  50. foundslash = 1;
  51. }
  52. /* do not try to correct spelling of single letter words */
  53. if (*old != '\0' && old[1] == '\0')
  54. Strbuf_append1(&newname, *old++);
  55. Strbuf_terminate(&newname);
  56. if (*old == '\0') {
  57. retval = (StrQcmp(oldname->s, newname.s) != 0);
  58. cleanup_ignore(&newname);
  59. xfree(oldname->s);
  60. *oldname = newname; /* shove it back. */
  61. cleanup_until(&guess);
  62. return retval;
  63. }
  64. guess.len = 0; /* start at beginning of buf */
  65. Strbuf_append(&guess, newname.s); /* add current dir if any */
  66. ws = guess.len;
  67. for (; *old != '/' && *old != '\0'; old++)/* add current file name */
  68. Strbuf_append1(&guess, *old);
  69. Strbuf_terminate(&guess);
  70. /*
  71. * Don't tell t_search we're looking for cmd if no '/' in the name so
  72. * far but there are later - or it will look for *all* commands
  73. */
  74. /* (*should* say "looking for directory" whenever '/' is next...) */
  75. retval = t_search(&guess, SPELL,
  76. looking == TW_COMMAND && (foundslash || *old != '/') ?
  77. TW_COMMAND : looking, 1, pat, suf);
  78. if (retval >= 4 || retval < 0) {
  79. cleanup_until(&guess);
  80. return -1; /* hopeless */
  81. }
  82. Strbuf_append(&newname, guess.s + ws);
  83. }
  84. /*NOTREACHED*/
  85. #ifdef notdef
  86. return (0); /* lint on the vax under mtXinu complains! */
  87. #endif
  88. }
  89. #define EQ(s,t) (StrQcmp(s,t) == 0)
  90. /*
  91. * spdist() is taken from Kernighan & Pike,
  92. * _The_UNIX_Programming_Environment_
  93. * and adapted somewhat to correspond better to psychological reality.
  94. * (Note the changes to the return values)
  95. *
  96. * According to Pollock and Zamora, CACM April 1984 (V. 27, No. 4),
  97. * page 363, the correct order for this is:
  98. * OMISSION = TRANSPOSITION > INSERTION > SUBSTITUTION
  99. * thus, it was exactly backwards in the old version. -- PWP
  100. */
  101. int
  102. spdist(const Char *s, const Char *t)
  103. {
  104. for (; (*s & TRIM) == (*t & TRIM); t++, s++)
  105. if (*t == '\0')
  106. return 0; /* exact match */
  107. if (*s) {
  108. if (*t) {
  109. if (s[1] && t[1] && (*s & TRIM) == (t[1] & TRIM) &&
  110. (*t & TRIM) == (s[1] & TRIM) && EQ(s + 2, t + 2))
  111. return 1; /* transposition */
  112. if (EQ(s + 1, t + 1))
  113. return 3; /* 1 char mismatch */
  114. }
  115. if (EQ(s + 1, t))
  116. return 2; /* extra character */
  117. }
  118. if (*t && EQ(s, t + 1))
  119. return 1; /* missing character */
  120. return 4;
  121. }
  122. int
  123. spdir(struct Strbuf *extended_name, const Char *tilded_dir, const Char *item,
  124. Char *name)
  125. {
  126. Char *path, *s, oldch;
  127. char *p;
  128. if (ISDOT(item) || ISDOTDOT(item))
  129. return 0;
  130. for (s = name; *s != 0 && (*s & TRIM) == (*item & TRIM); s++, item++)
  131. continue;
  132. if (*s == 0 || s[1] == 0 || *item != 0)
  133. return 0;
  134. path = xmalloc((Strlen(tilded_dir) + Strlen(name) + 1) * sizeof (*path));
  135. (void) Strcpy(path, tilded_dir);
  136. oldch = *s;
  137. *s = '/';
  138. Strcat(path, name);
  139. p = short2str(path);
  140. xfree(path);
  141. if (access(p, F_OK) == 0) {
  142. extended_name->len = 0;
  143. Strbuf_append(extended_name, name);
  144. Strbuf_terminate(extended_name);
  145. /* FIXME: *s = oldch? */
  146. return 1;
  147. }
  148. *s = oldch;
  149. return 0;
  150. }