blob: b44c021c2c3e13e4ab56fd3a885b74e38732d0c4 [file] [log] [blame]
H. Peter Anvin274cda82016-05-10 02:56:29 -07001/* ----------------------------------------------------------------------- *
2 *
H. Peter Anvin (Intel)5b7369d2020-07-05 02:16:13 -07003 * Copyright 1996-2020 The NASM Authors - All Rights Reserved
H. Peter Anvin274cda82016-05-10 02:56:29 -07004 * See the file AUTHORS included with the NASM distribution for
5 * the specific copyright holders.
6 *
7 * Redistribution and use in source and binary forms, with or without
8 * modification, are permitted provided that the following
9 * conditions are met:
10 *
11 * * Redistributions of source code must retain the above copyright
12 * notice, this list of conditions and the following disclaimer.
13 * * Redistributions in binary form must reproduce the above
14 * copyright notice, this list of conditions and the following
15 * disclaimer in the documentation and/or other materials provided
16 * with the distribution.
17 *
18 * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND
19 * CONTRIBUTORS "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES,
20 * INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF
21 * MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
22 * DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR
23 * CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
24 * SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT
25 * NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;
26 * LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
27 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
28 * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR
29 * OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE,
30 * EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
31 *
32 * ----------------------------------------------------------------------- */
33
34/*
H. Peter Anvin (Intel)5b7369d2020-07-05 02:16:13 -070035 * srcfile.c - keep track of the current position in the input stream.
36 *
37 * This is used for error messages, listing, and debug information. In
38 * both cases we also want to understand where inside a non-nolist
39 * macro we may be.
40 *
41 * This hierarchy is a stack that is kept as a doubly-linked list, as
42 * we want to traverse it in either top-down order or bottom-up.
H. Peter Anvin274cda82016-05-10 02:56:29 -070043 */
44
45#include "compiler.h"
46
H. Peter Anvin274cda82016-05-10 02:56:29 -070047
48#include "nasmlib.h"
49#include "hashtbl.h"
H. Peter Anvin1aa79452018-12-10 23:00:10 -080050#include "srcfile.h"
H. Peter Anvin274cda82016-05-10 02:56:29 -070051
H. Peter Anvin (Intel)5b7369d2020-07-05 02:16:13 -070052struct src_location_stack _src_top;
53struct src_location_stack *_src_bottom = &_src_top;
54struct src_location_stack *_src_error = &_src_top;
H. Peter Anvin274cda82016-05-10 02:56:29 -070055
56static struct hash_table filename_hash;
57
58void src_init(void)
59{
H. Peter Anvin274cda82016-05-10 02:56:29 -070060}
61
62void src_free(void)
63{
H. Peter Anvinbbb39572017-04-24 00:41:21 -070064 hash_free_all(&filename_hash, false);
H. Peter Anvin274cda82016-05-10 02:56:29 -070065}
66
67/*
68 * Set the current filename, returning the old one. The input
69 * filename is duplicated if needed.
70 */
71const char *src_set_fname(const char *newname)
72{
73 struct hash_insert hi;
74 const char *oldname;
75 void **dp;
76
77 if (newname) {
78 dp = hash_find(&filename_hash, newname, &hi);
79 if (dp) {
80 newname = (const char *)(*dp);
81 } else {
82 newname = nasm_strdup(newname);
83 hash_add(&hi, newname, (void *)newname);
84 }
85 }
86
H. Peter Anvin (Intel)5b7369d2020-07-05 02:16:13 -070087 oldname = _src_bottom->l.filename;
88 _src_bottom->l.filename = newname;
H. Peter Anvin274cda82016-05-10 02:56:29 -070089 return oldname;
90}
91
H. Peter Anvin274cda82016-05-10 02:56:29 -070092void src_set(int32_t line, const char *fname)
93{
94 src_set_fname(fname);
95 src_set_linnum(line);
96}
H. Peter Anvin (Intel)5b7369d2020-07-05 02:16:13 -070097
98void src_macro_push(const void *macro, struct src_location where)
99{
100 struct src_location_stack *sl;
101
102 nasm_new(sl);
103 sl->l = where;
104 sl->macro = macro;
105 sl->up = _src_bottom;
106 _src_bottom->down = sl;
107 _src_bottom = sl;
108}
109
110void src_macro_pop(void)
111{
112 struct src_location_stack *sl = _src_bottom;
113
114 _src_bottom = sl->up;
115 _src_bottom->down = NULL;
116
117 nasm_free(sl);
118}