aboutsummaryrefslogtreecommitdiffstats
path: root/lib/asn1/src/asn1ct_table.erl
blob: 139267d32b9e52c02fae3536b6e53e071a098355 (plain) (blame)
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
%%
%% %CopyrightBegin%
%%
%% Copyright Ericsson AB 2012. All Rights Reserved.
%%
%% The contents of this file are subject to the Erlang Public License,
%% Version 1.1, (the "License"); you may not use this file except in
%% compliance with the License. You should have received a copy of the
%% Erlang Public License along with this software. If not, it can be
%% retrieved online at http://www.erlang.org/.
%%
%% Software distributed under the License is distributed on an "AS IS"
%% basis, WITHOUT WARRANTY OF ANY KIND, either express or implied. See
%% the License for the specific language governing rights and limitations
%% under the License.
%%
%% %CopyrightEnd%
%%
%%
-module(asn1ct_table).

%% Table abstraction module for ASN.1 compiler

-export([new/1]).
-export([new/2]).
-export([new_reuse/1]).
-export([new_reuse/2]).
-export([exists/1]).
-export([size/1]).
-export([insert/2]).
-export([lookup/2]).
-export([match/2]).
-export([to_list/1]).
-export([delete/1]).


%% Always creates a new table
new(Table) -> new(Table, []).
new(Table, Options) ->
    TableId = case get(Table) of
                undefined ->
                    ets:new(Table, Options);
                _  ->
                    delete(Table),
                    ets:new(Table, Options)
              end,
    put(Table, TableId).

%% Only create it if it doesn't exist yet
new_reuse(Table) -> new_reuse(Table, []).
new_reuse(Table, Options) ->
    not exists(Table) andalso new(Table, Options).

exists(Table) -> get(Table) =/= undefined.

size(Table) -> ets:info(get(Table), size).

insert(Table, Tuple) -> ets:insert(get(Table), Tuple).

lookup(Table, Key) -> ets:lookup(get(Table), Key).

match(Table, MatchSpec) -> ets:match(get(Table), MatchSpec).

to_list(Table) -> ets:tab2list(get(Table)).

%% Deleting tables is no longer strictly necessary since each compilation
%% runs in separate process, but it will reduce memory consumption
%% especially when many compilations are run in parallel.

delete(Tables) when is_list(Tables) ->
    [delete(T) || T <- Tables],
    true;
delete(Table) when is_atom(Table) ->
    case erase(Table) of
        undefined ->
            true;
        TableId ->
            ets:delete(TableId)
    end.