/usr/share/ada/adainclude/opentoken/opentoken-token-enumerated-list.adb is in libopentoken3-dev 4.0b-3.
This file is owned by root:root, with mode 0o644.
The actual contents of the file can be viewed below.
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 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 | -------------------------------------------------------------------------------
--
-- Copyright (C) 2002, 2003 Stephe Leake
-- Copyright (C) 1999 Ted Dennison
--
-- This file is part of the OpenToken package.
--
-- The OpenToken package is free software; you can redistribute it and/or
-- modify it under the terms of the GNU General Public License as published
-- by the Free Software Foundation; either version 3, or (at your option)
-- any later version. The OpenToken package is distributed in the hope that
-- it will be useful, but WITHOUT ANY WARRANTY; without even the implied
-- warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
-- GNU General Public License for more details. You should have received
-- a copy of the GNU General Public License distributed with the OpenToken
-- package; see file GPL.txt. If not, write to the Free Software Foundation,
-- 59 Temple Place - Suite 330, Boston, MA 02111-1307, USA.
--
-- As a special exception, if other files instantiate generics from
-- this unit, or you link this unit with other files to produce an
-- executable, this unit does not by itself cause the resulting
-- executable to be covered by the GNU General Public License. This
-- exception does not however invalidate any other reasons why the
-- executable file might be covered by the GNU Public License.
--
-------------------------------------------------------------------------------
with Ada.Unchecked_Deallocation;
-----------------------------------------------------------------------------
-- This package provides a type and operatoions for building lists of
-- tokens for use in grammar productions
--
-- The algorithm for handling automatic cleanup of list nodes using
-- controlled types was taken directly from Matthew Heaney's tutorial
-- on Homogeneous, Reference-Counted Lists on AdaPower at
-- http://www.adapower.com/alg/homoref.html
-----------------------------------------------------------------------------
package body OpenToken.Token.Enumerated.List is
procedure Free is new Ada.Unchecked_Deallocation (List_Node, List_Node_Ptr);
procedure Free is new Ada.Unchecked_Deallocation
(OpenToken.Token.Enumerated.Class, OpenToken.Token.Enumerated.Handle);
----------------------------------------------------------------------------
-- Create a token list from a single instance.
----------------------------------------------------------------------------
function Only (Subject : in OpenToken.Token.Enumerated.Class) return Instance is
New_Node : constant List_Node_Ptr :=
new List_Node'(Token => new OpenToken.Token.Enumerated.Class'(Subject),
Next => null);
begin
return (Head => New_Node,
Tail => New_Node);
end Only;
----------------------------------------------------------------------------
-- Create a token list from a pair of token instances.
----------------------------------------------------------------------------
function "&" (Left : in OpenToken.Token.Enumerated.Class;
Right : in OpenToken.Token.Enumerated.Class) return Instance is
Right_Node : constant List_Node_Ptr :=
new List_Node'(Token => new OpenToken.Token.Enumerated.Class'(Right),
Next => null
);
begin
return (Head => new List_Node'(Token => new OpenToken.Token.Enumerated.Class'(Left),
Next => Right_Node),
Tail => Right_Node);
end "&";
----------------------------------------------------------------------------
-- Create a token list from a token instance and a token list.
----------------------------------------------------------------------------
function "&" (Left : in OpenToken.Token.Enumerated.Class;
Right : in Instance) return Instance is
Left_Node : constant List_Node_Ptr :=
new List_Node'(Token => new OpenToken.Token.Enumerated.Class'(Left),
Next => Right.Head);
Last_Node : List_Node_Ptr := Right.Tail;
begin
if Last_Node = null then
Last_Node := Left_Node;
end if;
return (Head => Left_Node,
Tail => Last_Node
);
end "&";
function "&" (Left : in Instance;
Right : in OpenToken.Token.Enumerated.Class) return Instance is
New_Node : constant List_Node_Ptr :=
new List_Node'(Token => new OpenToken.Token.Enumerated.Class'(Right),
Next => null);
First_Node : List_Node_Ptr;
begin
if Left.Tail = null then
First_Node := New_Node;
else
First_Node := Left.Head;
Left.Tail.Next := New_Node;
end if;
return (Head => First_Node,
Tail => New_Node
);
end "&";
----------------------------------------------------------------------------
-- Create a token list from a pair of token lists.
----------------------------------------------------------------------------
function "&" (Left : in Instance;
Right : in Instance) return Instance is
begin
Left.Tail.Next := Right.Head;
return (Head => Left.Head,
Tail => Right.Tail
);
end "&";
--------------------------------------------------------------------------
-- Enqueue a token on the given list. The token itself will not be
-- copied, but will be managed by the list from here on in. Do not
-- delete it while the list is still using it!
--
-- This routine is intended for internal use by parsers.
----------------------------------------------------------------------------
procedure Enqueue (List : in out Instance;
Token : in OpenToken.Token.Enumerated.Handle
) is
New_Node : constant List_Node_Ptr :=
new List_Node'(Token => Token,
Next => List.Head
);
begin
if List.Tail = null then
List.Tail := New_Node;
end if;
List.Head := New_Node;
end Enqueue;
--------------------------------------------------------------------------
-- This routine needs to be called when you are done using a list,
-- or want to reset it to empty.
--------------------------------------------------------------------------
procedure Clean (List : in out Instance) is
Node : List_Node_Ptr := List.Head;
Next : List_Node_Ptr;
begin
-- Deallocate all the nodes in the list, along with all their tokens
while Node /= null loop
Next := Node.Next;
Free (Node.Token);
Free (Node);
Node := Next;
end loop;
List.Head := null;
List.Tail := null;
end Clean;
----------------------------------------------------------------------------
-- Return an initialized iterator for traversing the token list
----------------------------------------------------------------------------
function Initial_Iterator (List : in Instance) return List_Iterator is
begin
return List_Iterator (List.Head);
end Initial_Iterator;
----------------------------------------------------------------------------
-- Move the iterator down the list to the next token.
----------------------------------------------------------------------------
procedure Next_Token (Iterator : in out List_Iterator) is
begin
if Iterator /= null then
Iterator := List_Iterator (Iterator.Next);
end if;
end Next_Token;
----------------------------------------------------------------------------
-- Return the next Token in the list.
----------------------------------------------------------------------------
function Token_Handle (Iterator : in List_Iterator) return OpenToken.Token.Enumerated.Handle is
begin
if Iterator = null then
return null;
end if;
return Iterator.Token;
end Token_Handle;
end OpenToken.Token.Enumerated.List;
|