mcomm.c 4.4 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246
  1. /* $Header$ */
  2. /*
  3. * (c) copyright 1987 by the Vrije Universiteit, Amsterdam, The Netherlands.
  4. * See the copyright notice in the ACK home directory, in the file "Copyright".
  5. */
  6. /* mcomm.c -- change ".lcomm name" into ".comm name" where "name"
  7. is specified in a list.
  8. */
  9. #include <stdio.h>
  10. #define IDFSIZE 4096
  11. char *readfile();
  12. struct node {
  13. char *name;
  14. struct node *left, *right;
  15. };
  16. char *
  17. Malloc(n)
  18. unsigned n;
  19. {
  20. char *space;
  21. char *malloc();
  22. if ((space = malloc(n)) == 0) {
  23. fprintf(stderr, "out of memory\n");
  24. exit(1);
  25. }
  26. return space;
  27. }
  28. struct node *make_tree();
  29. #define new_node() ((struct node *) Malloc(sizeof (struct node)))
  30. main(argc, argv)
  31. char *argv[];
  32. {
  33. char *nl_file, *as_file;
  34. char *nl_text, *as_text;
  35. struct node *nl_tree = 0;
  36. int nl_siz, as_siz;
  37. if (argc != 3) {
  38. fprintf(stderr, "use: %s namelist assembler_file\n", argv[0]);
  39. exit(1);
  40. }
  41. nl_file = argv[1];
  42. as_file = argv[2];
  43. if ((nl_text = readfile(nl_file, &nl_siz)) == 0) {
  44. fprintf(stderr, "%s: cannot read namelist %s\n",
  45. argv[0], nl_file);
  46. exit(1);
  47. }
  48. if ((as_text = readfile(as_file, &as_siz)) == 0) {
  49. fprintf(stderr, "%s: cannot read assembler file %s\n",
  50. argv[0], as_file);
  51. exit(1);
  52. }
  53. nl_tree = make_tree(nl_text);
  54. edit(as_text, nl_tree);
  55. if (writefile(as_file, as_text, as_siz) == 0) {
  56. fprintf(stderr, "%s: cannot write to %s\n", argv[0], as_file);
  57. exit(1);
  58. }
  59. return 0;
  60. }
  61. #include <sys/types.h>
  62. #include <stat.h>
  63. char *
  64. readfile(filename, psiz)
  65. char *filename;
  66. int *psiz;
  67. {
  68. struct stat stbuf; /* for `stat' to get filesize */
  69. register int fd; /* filedescriptor for `filename' */
  70. register char *cbuf; /* pointer to buffer to be returned */
  71. if (((fd = open(filename, 0)) < 0) || (fstat(fd, &stbuf) != 0))
  72. return 0;
  73. cbuf = Malloc(stbuf.st_size + 1);
  74. if (read(fd, cbuf, stbuf.st_size) != stbuf.st_size)
  75. return 0;
  76. cbuf[stbuf.st_size] = '\0';
  77. close(fd); /* filedes no longer needed */
  78. *psiz = stbuf.st_size;
  79. return cbuf;
  80. }
  81. int
  82. writefile(filename, text, size)
  83. char *filename, *text;
  84. {
  85. register fd;
  86. if ((fd = open(filename, 1)) < 0)
  87. return 0;
  88. if (write(fd, text, size) != size)
  89. return 0;
  90. close(fd);
  91. return 1;
  92. }
  93. struct node *
  94. make_tree(nl)
  95. char *nl;
  96. {
  97. char *id = nl;
  98. struct node *tree = 0;
  99. while (*nl) {
  100. if (*nl == '\n') {
  101. *nl = '\0';
  102. insert(&tree, id);
  103. id = ++nl;
  104. }
  105. else {
  106. ++nl;
  107. }
  108. }
  109. return tree;
  110. }
  111. insert(ptree, id)
  112. struct node **ptree;
  113. char *id;
  114. {
  115. register cmp;
  116. if (*ptree == 0) {
  117. register struct node *nnode = new_node();
  118. nnode->name = id;
  119. nnode->left = nnode->right = 0;
  120. *ptree = nnode;
  121. }
  122. else
  123. if ((cmp = strcmp((*ptree)->name, id)) < 0)
  124. insert(&((*ptree)->right), id);
  125. else
  126. if (cmp > 0)
  127. insert(&((*ptree)->left), id);
  128. }
  129. struct node *
  130. find(tree, id)
  131. struct node *tree;
  132. char *id;
  133. {
  134. register cmp;
  135. if (tree == 0)
  136. return 0;
  137. if ((cmp = strcmp(tree->name, id)) < 0)
  138. return find(tree->right, id);
  139. if (cmp > 0)
  140. return find(tree->left, id);
  141. return tree;
  142. }
  143. edit(text, tree)
  144. char *text;
  145. struct node *tree;
  146. {
  147. register char *ptr = text;
  148. char idbuf[IDFSIZE];
  149. register char *id;
  150. register char *save_ptr;
  151. while (*ptr) {
  152. if (
  153. *ptr == '.' &&
  154. *++ptr == 'l' &&
  155. *++ptr == 'c' &&
  156. *++ptr == 'o' &&
  157. *++ptr == 'm' &&
  158. *++ptr == 'm' &&
  159. (*++ptr == ' ' || *ptr == '\t')
  160. )
  161. {
  162. save_ptr = ptr - 6;
  163. while (*++ptr == ' ' || *ptr == '\t')
  164. ;
  165. if (*ptr == '_')
  166. ++ptr;
  167. if (InId(*ptr)) {
  168. id = &idbuf[0];
  169. *id++ = *ptr++;
  170. while (InId(*ptr))
  171. *id++ = *ptr++;
  172. *id = '\0';
  173. if (find(tree, idbuf) != 0) {
  174. *save_ptr++ = ' ';
  175. *save_ptr++ = '.';
  176. }
  177. }
  178. }
  179. while (*ptr && *ptr++ != '\n')
  180. ;
  181. }
  182. }
  183. InId(c)
  184. {
  185. switch (c) {
  186. case 'a': case 'b': case 'c': case 'd': case 'e':
  187. case 'f': case 'g': case 'h': case 'i': case 'j':
  188. case 'k': case 'l': case 'm': case 'n': case 'o':
  189. case 'p': case 'q': case 'r': case 's': case 't':
  190. case 'u': case 'v': case 'w': case 'x': case 'y':
  191. case 'z':
  192. case 'A': case 'B': case 'C': case 'D': case 'E':
  193. case 'F': case 'G': case 'H': case 'I': case 'J':
  194. case 'K': case 'L': case 'M': case 'N': case 'O':
  195. case 'P': case 'Q': case 'R': case 'S': case 'T':
  196. case 'U': case 'V': case 'W': case 'X': case 'Y':
  197. case 'Z':
  198. case '_':
  199. case '.':
  200. case '0': case '1': case '2': case '3': case '4':
  201. case '5': case '6': case '7': case '8': case '9':
  202. return 1;
  203. default:
  204. return 0;
  205. }
  206. }
  207. puttree(nd)
  208. struct node *nd;
  209. {
  210. if (nd) {
  211. puttree(nd->left);
  212. printf("%s\n", nd->name);
  213. puttree(nd->right);
  214. }
  215. }