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
169 | ------------------------------------------------------------------------------
-- --
-- Matreshka Project --
-- --
-- Localization, Internationalization, Globalization for Ada --
-- --
-- Runtime Library Component --
-- --
------------------------------------------------------------------------------
-- --
-- Copyright © 2010-2012, Vadim Godunko <vgodunko@gmail.com> --
-- All rights reserved. --
-- --
-- Redistribution and use in source and binary forms, with or without --
-- modification, are permitted provided that the following conditions --
-- are met: --
-- --
-- * Redistributions of source code must retain the above copyright --
-- notice, this list of conditions and the following disclaimer. --
-- --
-- * Redistributions in binary form must reproduce the above copyright --
-- notice, this list of conditions and the following disclaimer in the --
-- documentation and/or other materials provided with the distribution. --
-- --
-- * Neither the name of the Vadim Godunko, IE nor the names of its --
-- contributors may be used to endorse or promote products derived from --
-- this software without specific prior written permission. --
-- --
-- THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS --
-- "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT --
-- LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR --
-- A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT --
-- HOLDER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, --
-- SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED --
-- TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR --
-- PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF --
-- LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING --
-- NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS --
-- SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. --
-- --
------------------------------------------------------------------------------
-- $Revision: 3010 $ $Date: 2012-05-22 10:16:35 +0400 (Вт, 22 мая 2012) $
------------------------------------------------------------------------------
with Ada.Unchecked_Deallocation;
with Matreshka.Atomics.Generic_Test_And_Set;
with Matreshka.Internals.Strings.Operations;
package body Matreshka.Internals.Regexps is
use Matreshka.Internals.Strings;
use Matreshka.Internals.Utf16;
function Test_And_Set is
new Matreshka.Atomics.Generic_Test_And_Set
(Shared_String, Shared_String_Access);
-------------
-- Capture --
-------------
function Capture
(Item : not null Shared_Match_Access;
Number : Natural)
return not null Matreshka.Internals.Strings.Shared_String_Access
is
Aux : Shared_String_Access := Item.Captures (Number);
begin
if Aux = null then
Aux :=
Operations.Slice
(Item.Source,
Item.Slices (Number).First_Position,
Item.Slices (Number).Next_Position
- Item.Slices (Number).First_Position,
Item.Slices (Number).Next_Index
- Item.Slices (Number).First_Index);
if not Test_And_Set (Item.Captures (Number), null, Aux) then
-- Operation can fail when capture is computed by another thread.
-- In this case computed capture is dereferenced and another
-- value is used.
Dereference (Aux);
Aux := Item.Captures (Number);
end if;
end if;
Reference (Aux);
return Aux;
end Capture;
-----------------
-- Dereference --
-----------------
procedure Dereference (Item : in out Shared_Match_Access) is
pragma Assert (Item /= null);
procedure Free is
new Ada.Unchecked_Deallocation (Shared_Match, Shared_Match_Access);
begin
if Item /= Empty_Shared_Match'Access
and then Matreshka.Atomics.Counters.Decrement (Item.Counter)
then
if Item.Source /= null then
Dereference (Item.Source);
end if;
for J in Item.Captures'Range loop
if Item.Captures (J) /= null then
Dereference (Item.Captures (J));
end if;
end loop;
Free (Item);
else
Item := null;
end if;
end Dereference;
-----------------
-- Dereference --
-----------------
procedure Dereference (Item : in out Shared_Pattern_Access) is
pragma Assert (Item /= null);
procedure Free is
new Ada.Unchecked_Deallocation (Shared_Pattern, Shared_Pattern_Access);
begin
if Item /= Empty_Shared_Pattern'Access
and then Matreshka.Atomics.Counters.Decrement (Item.Counter)
then
Free (Item);
else
Item := null;
end if;
end Dereference;
---------------
-- Reference --
---------------
procedure Reference (Item : not null Shared_Match_Access) is
begin
if Item /= Empty_Shared_Match'Access then
Matreshka.Atomics.Counters.Increment (Item.Counter);
end if;
end Reference;
---------------
-- Reference --
---------------
procedure Reference (Item : not null Shared_Pattern_Access) is
begin
if Item /= Empty_Shared_Pattern'Access then
Matreshka.Atomics.Counters.Increment (Item.Counter);
end if;
end Reference;
end Matreshka.Internals.Regexps;
|