1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
|
/*
* Copyright 2001-2004 David Abrahams.
* Distributed under the Boost Software License, Version 1.0.
* (See accompanying file LICENSE_1_0.txt or http://www.boost.org/LICENSE_1_0.txt)
*/
#include "jam.h"
#include "modules.h"
#include "string.h"
#include "hash.h"
#include "newstr.h"
#include "lists.h"
#include "parse.h"
#include "rules.h"
#include "variable.h"
#include "strings.h"
#include <assert.h>
static struct hash * module_hash = 0;
static char * new_module_str( module_t * m, char * suffix )
{
char * result;
string s;
string_copy( &s, m->name );
string_append( &s, suffix );
result = newstr( s.value );
string_free( &s );
return result;
}
module_t * bindmodule( char * name )
{
PROFILE_ENTER( BINDMODULE );
string s;
module_t m_;
module_t * m = &m_;
if ( !module_hash )
module_hash = hashinit( sizeof( module_t ), "modules" );
string_new( &s );
if ( name )
{
string_append( &s, name );
string_push_back( &s, '.' );
}
m->name = s.value;
if ( hashenter( module_hash, (HASHDATA * *)&m ) )
{
m->name = newstr( m->name );
m->variables = 0;
m->rules = 0;
m->imported_modules = 0;
m->class_module = 0;
m->native_rules = 0;
m->user_module = 0;
}
string_free( &s );
PROFILE_EXIT( BINDMODULE );
return m;
}
/*
* demand_rules() - Get the module's "rules" hash on demand.
*/
struct hash * demand_rules( module_t * m )
{
if ( !m->rules )
m->rules = hashinit( sizeof( RULE ), new_module_str( m, "rules" ) );
return m->rules;
}
/*
* delete_module() - wipe out the module's rules and variables.
*/
static void delete_rule_( void * xrule, void * data )
{
rule_free( (RULE *)xrule );
}
void delete_module( module_t * m )
{
/* Clear out all the rules. */
if ( m->rules )
{
hashenumerate( m->rules, delete_rule_, (void *)0 );
hashdone( m->rules );
m->rules = 0;
}
if ( m->variables )
{
var_hash_swap( &m->variables );
var_done();
var_hash_swap( &m->variables );
m->variables = 0;
}
}
module_t * root_module()
{
static module_t * root = 0;
if ( !root )
root = bindmodule( 0 );
return root;
}
void enter_module( module_t * m )
{
var_hash_swap( &m->variables );
}
void exit_module( module_t * m )
{
var_hash_swap( &m->variables );
}
void import_module( LIST * module_names, module_t * target_module )
{
PROFILE_ENTER( IMPORT_MODULE );
struct hash * h;
if ( !target_module->imported_modules )
target_module->imported_modules = hashinit( sizeof( char * ), "imported" );
h = target_module->imported_modules;
for ( ; module_names; module_names = module_names->next )
{
char * s = module_names->string;
char * * ss = &s;
hashenter( h, (HASHDATA * *)&ss );
}
PROFILE_EXIT( IMPORT_MODULE );
}
static void add_module_name( void * r_, void * result_ )
{
char * * r = (char * *)r_;
LIST * * result = (LIST * *)result_;
*result = list_new( *result, copystr( *r ) );
}
LIST * imported_modules( module_t * module )
{
LIST * result = L0;
if ( module->imported_modules )
hashenumerate( module->imported_modules, add_module_name, &result );
return result;
}
|
