mcomm.c 4.2 KB

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