-- Lists data type. -- Copyright (C) 2002, 2003, 2004, 2005 Tristan Gingold -- -- This program 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 2 of the License, or -- (at your option) any later version. -- -- This program 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 -- along with this program. If not, see . with Types; use Types; generic type El_Type is range <>; package Lists is type List_Type is new Nat32; for List_Type'Size use 32; Null_List : constant List_Type := 0; List_All : constant List_Type := 1; subtype List_Valid_Type is List_Type range List_All + 1 .. List_Type'Last; ----------- -- Lists -- ----------- -- Iir_Kinds_List -- Lists of elements. -- index is 0 .. nbr_elements - 1. -- -- Append an element to (the end of) the list. -- procedure Append_Element (List: in Iir; Element: Iir); -- -- Get the N th element in list, starting from 0. -- Return an access to the element or null_iir, if beyond bounds. -- function Get_Nth_Element (List: in Iir; N: Natural) return Iir; -- -- Return the last element of the list, or null_iir. -- function Get_Last_Element (List: in Iir) return Iir; -- -- Return the first element of the list, or null_iir. -- function Get_First_Element (List: in Iir) return Iir; -- -- Replace an element selected by position. -- procedure Replace_Nth_Element (List: in Iir_List; N: Natural; El:Iir); -- -- Add (append) an element only if it was not already present in the list. -- Return its position. -- procedure Add_Element (List: in Iir; El: Iir; Position: out integer); -- procedure Add_Element (List: in Iir_List; El: Iir); -- -- Return the number of elements in the list. -- This is also 1 + the position of the last element. -- function Get_Nbr_Elements (List: in Iir_List) return Natural; -- -- Set the number of elements in the list. -- Can be used only to shrink the list. -- procedure Set_Nbr_Elements (List: in Iir_List; N: Natural); -- Create a list. function Create_List return List_Type; -- Destroy a list. procedure Destroy_List (List : in out List_Type); -- Free all the lists. procedure Finalize; -- Reset to initial state. procedure Initialize; -- Append ELEMENT to the list. It's an O(1) operation. procedure Append_Element (List : List_Type; Element : El_Type); -- Return the first element of the list. function Get_First_Element (List : List_Type) return El_Type; -- Append EL if not already in LIST. It's an O(n) operation. procedure Add_Element (List : List_Type; El : El_Type); -- Return the number of elements in the list. -- This is also 1 + the position of the last element. function Get_Nbr_Elements (List: List_Type) return Natural; pragma Inline (Get_Nbr_Elements); -- True if LIST is empty. function Is_Empty (List : List_Type) return Boolean; -- Iterator. The idiomatic way to iterate is: -- It := Iterate (List); -- while Is_Valid (It) loop -- El := Get_Element (It); -- ... -- Next (It); -- end loop; type Iterator is private; function Iterate (List : List_Valid_Type) return Iterator; function Is_Valid (It : Iterator) return Boolean; procedure Next (It : in out Iterator); function Get_Element (It : Iterator) return El_Type; procedure Set_Element (It : Iterator; El : El_Type); -- Use the C convention for all these subprograms, so that the Iterator is -- always passed by reference. pragma Convention (C, Is_Valid); pragma Convention (C, Next); pragma Convention (C, Get_Element); pragma Convention (C, Set_Element); -- Like Iterate, but if LIST is Null_List, it returns an iterator that is -- never valid. function Iterate_Safe (List : List_Type) return Iterator; private type Chunk_Index_Type is new Int32; for Chunk_Index_Type'Size use 32; No_Chunk_Index : constant Chunk_Index_Type := 0; Chunk_Len : constant := 7; type Node_Type_Array is array (Nat32 range 0 .. Chunk_Len - 1) of El_Type; type Chunk_Type is record Next : Chunk_Index_Type; Els : Node_Type_Array; end record; type Iterator is record Chunk : Chunk_Index_Type; Chunk_Idx : Nat32; Remain : Nat32; end record; pragma Convention (C, Iterator); pragma Inline (Iterate); pragma Inline (Is_Valid); pragma Inline (Next); pragma Inline (Get_Element); end Lists; '#n71'>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 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282 283 284 285 286 287 288 289 290 291 292 293 294 295 296 297 298 299 300 301 302 303 304 305 306 307 308 309 310 311 312 313 314 315 316 317 318 319 320 321 322 323 324 325