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 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 326 327 328 329 330 331 332 333 334 335 336 337 338 339 340 341 342 343 344 345 346 347 348 349 350 351 352 353 354 355 356 357 358 359 360 361 362 363 364 365 366 367 368 369 370 371 372 373 374 375 376 377 378 379 380 381 382 383 384 385 386 387 388 389 390 391 392 393 394 395 396 397 398 399 400 401 402 403 404 405 406 407 408 409 410 411 412 413 414 415 416 417 418 419 420 421 422 423 424 425 426 427 428 429 430 431 432 433 434 435 436 437 438 439 440 441 442 443 444 445 446 447 448 449 450 451 452 453 454 455 456 457 458 459 460 461 462 463 464 465 466 467 468 469 470 471 472 473 474 475 476 477 478 479 480 481 482 483 484 485 486 487 488 489 490 491 492 493 494 495 496 497 498 499 500 501 502 503 504 505 506 507 508 509 510 511 512 513 514 515 516 517 518 519 520 521 522 523 524 525 526 527 528 529 530 531 532 533 534 535 536 537 538 539 540 541 542 543 544 545 546 547 548 549 550 551 552 553 554 555 556 557 558 559 560 561 562 563 564 565 566 567 568 569 570 571 572 573 574 575 576 577 578 579 580 581 582 583 584 585 586 587 588 589 590 591 592 593 594 595 596 597 598 599 600 601 602 603 604 605 606 607 608 609 610 611 612 613 614 615 616 617 618 619 620 621 622 623 624 625 626 627 628 629 630 631 632 633 634 635 636 637 638 639 640 641 642 643 644 645 646 647 648 649 650 651 652 653 654 655 656 657 658 659 660 661 662 663 664 665 666 667 668 669 670 671 672 673 674 675 676 677 678 679 680 681 682 683 684 685 686 687 688 689 690 691 692 693 694 695 696 697 698 699 700 701 702 703 704 705 706 707 708 709 710 711 712 713 714 715 716 717 718 719 720 721 722 723 724 725 726 727 728 729 730 731 732 733 734 735 736 737 738 739 740 741 742 743 744 745 746 747 748 749 750 751 752 753 754 755 756 757 758 759 760 761 762 763 764 765 766 767 768 769 770 771 772 773 774 775 776 777 778 779 780 781 782 783 784 785 786 787 788 789 790 791 792 793 794 795 796 797 798 799 800 801 802 803 804 805 806 807 808 809 810 811 812 813 814 815 816 817 818 819 820 821 822 823 824 825 826 827 828 829 830 831 832 833 834 835 836 837 838 839 840 841 842 843 844 845 846 847 848 849 850 851 852 853 854 855 856 857 858 859 860 861 862 863 864 865 866 867 868 869 870 871 872 873 874 875 876 877 878 879 880 881 882 883 884 885 886 887 888 889 890 891 892 893 894 895 896 897 898 899 900 901 902 903 904 905 906 907 908 909 910 911 912 913 914 915 916 917 918 919 920 921 922 923 924 925 926 927 928 929 930 931 932 933 934 935 936 937 938 939 940 941 942 943 944 945 946 947 948 949 950 951 952 953 954 955 956 957 958 959 960 961 962 963 964 965 966 967 968 969 970 971 972 973 974 975 976 977 978 979 980 981 982 983 984 985 986 987 988 989 990 991 992 993 994 995 996 997 998 999 1000 1001 1002 1003 1004 1005 1006 1007 1008 1009 1010 1011 1012 1013 1014 1015 1016 1017 1018 1019 1020 1021 1022 1023 1024 1025 1026 1027 1028 1029 1030 1031 1032 1033 1034 1035 1036 1037 1038 1039 1040 1041 1042 1043 1044 1045 1046 1047 1048 1049 1050 1051 1052 1053 1054 1055 1056 1057 1058 1059 1060 1061 1062 1063 1064 1065 1066 1067 1068 1069 1070 1071 1072 1073 1074 1075 1076 1077 1078 1079 1080 1081 1082 1083 1084 1085 1086 1087 1088 1089 1090 1091 1092 1093 1094 1095 1096 1097 1098 1099 1100 1101 1102 1103 1104 1105 1106 1107 1108 1109 1110 1111 1112 1113 1114 1115 1116 1117 1118 1119 1120 1121 1122 1123 1124 1125 1126 1127 1128 1129 1130 1131 1132 1133 1134 1135 1136 1137 1138 1139 1140 1141 1142 1143 1144 1145 1146 1147 1148 1149 1150 1151 1152 1153 1154 1155 1156 1157 1158 1159 1160 1161 1162 1163 1164 1165 1166 1167 1168 1169 1170 1171 1172 1173 1174 1175 1176 1177 1178 1179 1180 1181 1182 1183 1184 1185 1186 1187 1188 1189 1190 1191 1192 1193 1194 1195 1196 1197 1198 1199 1200 1201 1202 1203 1204 1205 1206 1207 1208 1209 1210 1211 1212 1213 1214 1215 1216 1217 1218 1219 1220 1221 1222 1223 1224 1225 1226 1227 1228 1229 1230 1231 1232 1233 1234 1235 1236 1237 1238 1239 1240 1241 1242 1243 1244 1245 1246 1247 1248 1249 1250 1251 1252 1253 1254 1255 1256 1257 1258 1259 1260 1261 1262 1263 1264 1265 1266 1267 1268 1269 1270 1271 1272 1273 1274 1275 1276 1277 1278 1279 1280 1281 1282 1283 1284 1285 1286 1287 1288 1289 1290 1291 1292 1293 1294 1295 1296 1297 1298 1299 1300 1301 1302 1303 1304 1305 1306 1307 1308 1309 1310 1311 1312 1313 1314 1315 1316 1317 1318 1319 1320 1321 1322 1323 1324 1325 1326 1327 1328 1329 1330 1331 1332 1333 1334 1335 1336 1337 1338 1339 1340 1341 1342 1343 1344 1345 1346 1347 1348 1349 1350 1351 1352 1353 1354 1355 1356 1357 1358 1359 1360 1361 1362 1363 1364 1365 1366 1367 1368 1369 1370 1371 1372 1373 1374 1375 1376 1377 1378 1379 1380 1381 1382 1383 1384 1385 1386 1387 1388 1389 1390 1391 1392 1393 1394 1395 1396 1397 1398 1399 1400 1401 1402 1403 1404 1405 1406 1407 1408 1409 1410 1411 1412 1413 1414 1415 1416 1417 1418 1419 1420 1421 1422 1423 1424 1425 1426 1427 1428 1429 1430 1431 1432 1433 1434 1435 1436 1437 1438 1439 1440 1441 1442 1443 1444 1445 1446 1447 1448 1449 1450 1451 1452 1453 1454 1455 1456 1457 1458 1459 1460 1461 1462 1463 1464 1465 1466 1467 1468 1469 1470 1471 1472 1473 1474 1475 1476 1477 1478 1479 1480 1481 1482 1483 1484 1485 1486 1487 1488 1489 1490 1491 1492 1493 1494 1495 1496 1497 1498 1499 1500 1501 1502 1503 1504 1505 1506 1507 1508 1509 1510 1511 1512 1513 1514 1515 1516 1517 1518 1519 1520 1521 1522 1523 1524 1525 1526 1527 1528 1529 1530 1531 1532 1533 1534 1535 1536 1537 1538 1539 1540 1541 1542 1543 1544 1545 1546 1547 1548 1549 1550 1551 1552 1553 1554 1555 1556 1557 1558 1559 1560 1561 1562 1563 1564 1565 1566 1567 1568 1569 1570 1571 1572 1573 1574 1575 1576 1577 1578 1579 1580 1581 1582 1583 1584 1585 1586 1587 1588 1589 1590 1591 1592 1593 1594 1595 1596 1597 1598 1599 1600 1601 1602 1603 1604 1605 1606 1607 1608 1609 1610 1611 1612 1613 1614 1615 1616 1617 1618 1619 1620 1621 1622 1623 1624 1625 1626 1627 1628 1629 1630 1631 1632 1633 1634 1635 1636 1637 1638 1639 1640 1641 1642 1643 1644 1645 1646 1647 1648 1649 1650 1651 1652 1653 1654 1655 1656 1657 1658 1659 1660 1661 1662 1663 1664 1665 1666 1667 1668 1669 1670 1671 1672 1673 1674 1675 1676 1677 1678 1679 1680 1681 1682 1683 1684 1685 1686 1687 1688 1689 1690 1691 1692 1693 1694 1695 1696 1697 1698 1699 1700 1701 1702 1703 1704 1705 1706 1707 1708 1709 1710 1711 1712 1713 1714 1715 1716 1717 1718 1719 1720 1721 1722 1723 1724 1725 1726 1727 1728 1729 1730 1731 1732 1733 1734 1735 1736 1737 1738 1739 1740 1741 1742 1743 1744 1745 1746 1747 1748 1749 1750 1751 1752 1753 1754 1755 1756 1757 1758 1759 1760 1761 1762 1763 1764 1765 1766 1767 1768 1769 1770 1771 1772 1773 1774 1775 1776 1777 1778 1779 1780 1781 1782 1783 1784 1785 1786 1787 1788 1789 1790 1791 1792 1793 1794 1795 1796 1797 1798 1799 1800 1801 1802 1803 1804 1805 1806 1807 1808 1809 1810 1811 1812 1813 1814 1815 1816 1817 1818 1819 1820 1821 1822 1823 1824 1825 1826 1827 1828 1829 1830 1831 1832 1833 1834 1835 1836 1837 1838 1839 1840 1841 1842 1843 1844 1845 1846 1847 1848 1849 1850 1851 1852 1853 1854 1855 1856 1857 1858 1859 1860 1861 1862 1863 1864 1865 1866 1867 1868 1869 1870 1871 1872 1873 1874 1875 1876 1877 1878 1879 1880 1881 1882 1883 1884 1885 1886 1887 1888 1889 1890 1891 1892 1893 1894 1895 1896 1897 1898 1899 1900 1901 1902 1903 1904 1905 1906 1907 1908 1909 1910 1911 1912 1913 1914 1915 1916 1917 1918 1919 1920 1921 1922 1923 1924 1925 1926 1927 1928 1929 1930 1931 1932 1933 1934 1935 1936 1937 1938 1939 1940 1941 1942 1943 1944 1945 1946 1947 1948 1949 1950 1951 1952 1953 1954 1955 1956 1957 1958 1959 1960 1961 1962 1963 1964 1965 1966 1967 1968 1969 1970 1971 1972 1973 1974 1975 1976 1977 1978 1979 1980 1981 1982 1983 1984 1985 1986 1987 1988 1989 1990 1991 1992 1993 1994 1995 1996 1997 1998 1999 2000 2001 2002 2003 2004 2005 2006 2007 2008 2009 2010 2011 2012 2013 2014 2015 2016 2017 2018 2019 2020 2021 2022 2023 2024 2025 2026 2027 2028 2029 2030 2031 2032 2033 2034 2035 2036 2037 2038 2039 2040 2041 2042 2043 2044 2045 2046 2047 2048 2049 2050 2051 2052 2053 2054 2055 2056 2057 2058 2059 2060 2061 2062 2063 2064 2065 2066 2067 2068 2069 2070 2071 2072 2073 2074 2075 2076 2077 2078 2079 2080 2081 2082 2083 2084 2085 2086 2087 2088 2089 2090 2091 2092 2093 2094 2095 2096 2097 2098 2099 2100 2101 2102 2103 2104 2105 2106 2107 2108 2109 2110 2111 2112 2113 2114 2115 2116 2117 2118 2119 2120 2121 2122 2123 2124 2125 2126 2127 2128 2129 2130 2131 2132 2133 2134 2135 2136 2137 2138 2139 2140 2141 2142 2143 2144 2145 2146 2147 2148 2149 2150 2151 2152 2153 2154 2155 2156 2157 2158 2159 2160 2161 2162 2163 2164 2165 2166 2167 2168 2169 2170 2171 2172 2173 2174 2175 2176 2177 2178 2179 2180 2181 2182 2183 2184 2185 2186 2187 2188 2189 2190 2191 2192 2193 2194 2195 2196 2197 2198 2199 2200 2201 2202 2203 2204 2205 2206 2207 2208 2209 2210 2211 2212 2213 2214 2215 2216 2217 2218 2219 2220 2221 2222 2223 2224 2225 2226 2227 2228 2229 2230 2231 2232 2233 2234 2235 2236 2237 2238 2239 2240 2241 2242 2243 2244 2245 2246 2247 2248 2249 2250 2251 2252 2253 2254 2255 2256 2257 2258 2259 2260 2261 2262 2263 2264 2265 2266 2267 2268 2269 2270 2271 2272 2273 2274 2275 2276 2277 2278 2279 2280 2281 2282 2283 2284 2285 2286 2287 2288 2289 2290 2291 2292 2293 2294 2295 2296 2297 2298 2299 2300 2301 2302 2303 2304 2305 2306 2307 2308 2309 2310 2311 2312 2313 2314 2315 2316 2317 2318 2319 2320 2321 2322 2323 2324 2325 2326 2327 2328 2329
|
----------------------------------------------------------------------
-- Ada Web Server --
-- --
-- Copyright (C) 2003-2018, AdaCore --
-- --
-- This is free software; you can redistribute it and/or modify it --
-- under terms of the GNU General Public License as published by the --
-- Free Software Foundation; either version 3, or (at your option) any --
-- later version. This software 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 this software; see file COPYING3. If not, go --
-- to http://www.gnu.org/licenses for a complete copy of the license. --
------------------------------------------------------------------------------
with Ada.Characters.Conversions;
with Ada.Characters.Handling;
with Ada.Directories;
with Ada.Exceptions;
with Ada.Strings;
with Ada.Strings.Fixed;
with Ada.Strings.Maps;
with Ada.Strings.Unbounded;
with Ada.Text_IO;
with Ada.Unchecked_Deallocation;
with GNAT.OS_Lib;
with GNAT.Regpat;
with Asis;
with Asis.Ada_Environments;
with Asis.Compilation_Units;
with Asis.Declarations;
with Asis.Definitions;
with Asis.Elements;
with Asis.Errors;
with Asis.Exceptions;
with Asis.Expressions;
with Asis.Extensions.Flat_Kinds;
with Asis.Implementation;
with Asis.Iterator;
with Asis.Text;
with A4G.GNAT_Int;
with AWS.Utils;
with SOAP.Name_Space;
with SOAP.Types;
with Ada2WSDL.Generator;
with Ada2WSDL.Options;
package body Ada2WSDL.Parser is
use Ada;
use Ada.Exceptions;
use Ada.Strings.Unbounded;
use Asis;
use GNAT;
-- The Compile routine is defined in Asis.Extensions in recent ASIS
-- version, it was defined in A4G.GNAT_Int in older ones.
use A4G.GNAT_Int;
use Asis.Extensions;
pragma Warnings (Off, A4G.GNAT_Int);
subtype String_Access is OS_Lib.String_Access;
------------------------------
-- File and Directory names --
------------------------------
Tree_Name : String_Access;
-- We need it in more, then one routine, so we define it here
Max_Argument : constant := 1_024;
Arg_List : OS_Lib.Argument_List (1 .. Max_Argument);
-- -I options from the Ada2WSDL command line transformed into the
-- form appropriate for calling gcc to create the tree file.
Arg_Index : Natural := 0;
GPRBUILD : constant String_Access :=
OS_Lib.Locate_Exec_On_Path ("gprbuild");
----------------------
-- Status variables --
----------------------
My_Context : Asis.Context;
Spec_File : Text_IO.File_Type;
-----------------------
-- Local subprograms --
-----------------------
procedure Create_Tree;
-- Creates a tree file or checks if the tree file already exists,
-- depending on options
type Element_Node;
type Link is access all Element_Node;
type Element_Node is record
Spec : Asis.Element := Nil_Element;
Spec_Name : String_Access;
-- Not used for incomplete type declarations
Up : Link;
Down : Link;
Prev : Link;
Next : Link;
Last : Link;
end record;
-- An element of a dynamic structure representing a "skeleton" of the body
-- to be generated
--
-- Logically this structure is a list of elements representing local
-- bodies and sublists representing the bodies which are a components of
-- some local body. Each list and sublist is represented by its first
-- element. For this first list element, the field Last is used to point
-- to the last element in this list to speed up adding the new element if
-- we do not have to order alphabetically the local bodies.
Body_Structure : aliased Element_Node;
-- This is a "design" for a body to generate. It contains references
-- to the elements from the argument spec for which body samples should
-- be generated, ordered alphabetically. The top of this link structure
-- is the Element representing a unit declaration from the argument
-- compilation unit.
------------------------------------------------
-- Actuals for Traverse_Element instantiation --
------------------------------------------------
type Body_State is record
Argument_Spec : Boolean := True;
-- Flag indicating if we are in the very beginning (very top)
-- of scanning the argument library unit declaration
Current_List : Link;
-- Declaration list in which a currently processed spec
-- should be inserted;
Last_Top : Link;
-- An element which represents a declaration from which the currently
-- processed sublist was originated
New_List_Needed : Boolean := False;
-- Flag indication if a new sublist should be created
end record;
procedure Create_Element_Node
(Element : Asis.Element;
Control : in out Traverse_Control;
State : in out Body_State);
-- When visiting an Element representing something for which a body
-- sample may be required, we check if the body is really required
-- and insert the corresponding Element on the right place in Body_State
-- if it is.
procedure Go_Up
(Element : Asis.Element;
Control : in out Traverse_Control;
State : in out Body_State);
-- When leaving a [generic] package declaration or a protected [type]
-- declaration, we have to go one step up in Body_State structure.
procedure Create_Structure is new Iterator.Traverse_Element
(State_Information => Body_State,
Pre_Operation => Create_Element_Node,
Post_Operation => Go_Up);
-- Creates Body_Structure by traversing an argument spec and choosing
-- specs to create body samples for
--------------------
-- Local Routines --
--------------------
function Name (Elem : Asis.Element) return String;
-- Returns a defining name string image for a declaration which
-- defines exactly one name. This should definitely be made an extension
-- query
function Image (Str : Wide_String) return String;
-- Returns the trimed string representation of Str
procedure Analyse_Structure;
-- Go through all entities and generate WSDL
procedure Emergency_Clean_Up;
-- Does clean up actions in case if an exception was raised during
-- creating a body sample (closes a Context, dissociates it, finalizes
-- ASIS, closes and deletes needed files.
------------------------------------
-- Deferred Asis types to analyse --
------------------------------------
type Element_Set is array (Positive range <>) of Asis.Element;
Max_Deferred_Types : constant := 1_024;
Deferred_Types : Element_Set (1 .. Max_Deferred_Types);
-- Records all types tha can't be analysed at some point. For example we
-- can't parse a type while parsing the spec.
Index : Natural := 0;
-- Current Index in the Deferred_Types array
procedure Append_Deferred (E : Asis.Element);
-- Append a new element into the list of deferred types
----------------
-- Add_Option --
----------------
procedure Add_Option (Option : String) is
begin
if Option (Option'First .. Option'First + 1) /= "-I" then
Arg_Index := Arg_Index + 1;
Arg_List (Arg_Index) := new String'(Option);
end if;
end Add_Option;
-----------------------
-- Analyse_Structure --
-----------------------
procedure Analyse_Structure is
procedure Analyse_Package (Node : Link);
-- Analyse a package declaration, the package name is used as
-- the Web Service name.
procedure Analyse_Package_Instantiation (Node : Link);
-- Checks if this instantiation is to create a safe pointer, in this
-- case records the type and access type for later used.
procedure Analyse_Routine (Node : Link);
-- Node is a procedure or function, analyse its spec profile
procedure Analyse_Type (Elem : Asis.Element);
-- Node is a subtype or type, analyse its definition
procedure Analyse_Profile (Node : Link);
-- Generates an entry_body_formal_part, parameter or parameter
-- and result profile for the body of a program unit
-- represented by Node. Upon exit, sets Change_Line is set True
-- if the following "is" for the body should be generated on a new line
procedure Array_Type_Suffix
(E : Asis.Element;
Type_Suffix : out Unbounded_String;
Length : out Positive);
function Type_Def
(Elem : Asis.Element;
Base : Boolean) return Generator.Type_Data;
-- Returns the type name for Elem. If Base is true the returned name is
-- the base type for the given element.
procedure Analyse_Node (Node : Link);
-- Analyse a Node, handles procedure or function only
procedure Analyse_Node_List (List : Link);
-- Call Analyse_Node for each element in List
function Name_Space (E : Asis.Element) return String;
-- Returns the name space for element E. Name space is defined as
-- follow: http://soapaws/<unit_name>_pkg/
function Is_Standard (T : Asis.Declaration) return Boolean;
-- Returns True if type T is declared in Standard
------------------
-- Analyse_Node --
------------------
procedure Analyse_Node (Node : Link) is
use Extensions.Flat_Kinds;
Arg_Kind : constant Flat_Element_Kinds :=
Flat_Element_Kind (Node.Spec);
begin
case Arg_Kind is
when A_Function_Declaration
| A_Procedure_Declaration
=>
Analyse_Routine (Node);
when An_Entry_Declaration
| A_Single_Protected_Declaration
| A_Protected_Type_Declaration
| A_Single_Task_Declaration
| A_Task_Type_Declaration
| A_Generic_Package_Declaration
| An_Incomplete_Type_Declaration
| A_Generic_Function_Declaration
| A_Generic_Procedure_Declaration
=>
null;
when A_Package_Declaration =>
Analyse_Package (Node);
when A_Package_Instantiation =>
Analyse_Package_Instantiation (Node);
when A_Subtype_Declaration | An_Ordinary_Type_Declaration =>
Analyse_Type (Node.Spec);
when others =>
Text_IO.Put_Line
(Text_IO.Standard_Error,
"ada2wsdl: unexpected element in the body structure");
Text_IO.Put
(Text_IO.Standard_Error,
"ada2wsdl: " & Arg_Kind'Img);
raise Fatal_Error;
end case;
if Node.Down /= null then
Analyse_Node_List (Node.Down);
end if;
end Analyse_Node;
-----------------------
-- Analyse_Node_List --
-----------------------
procedure Analyse_Node_List (List : Link) is
Next_Node : Link;
List_Start : Link := List;
begin
-- Here we have to go to the beginning of the list
while List_Start.Prev /= null loop
List_Start := List_Start.Prev;
end loop;
Next_Node := List_Start;
loop
Analyse_Node (Next_Node);
if Next_Node.Next /= null then
Next_Node := Next_Node.Next;
else
exit;
end if;
end loop;
end Analyse_Node_List;
---------------------
-- Analyse_Package --
---------------------
procedure Analyse_Package (Node : Link) is
begin
if Options.WS_Name = Null_Unbounded_String then
Options.WS_Name := To_Unbounded_String
(Strings.Fixed.Translate
(Node.Spec_Name.all,
Strings.Maps.To_Mapping (".", "-")));
end if;
end Analyse_Package;
-----------------------------------
-- Analyse_Package_Instantiation --
-----------------------------------
procedure Analyse_Package_Instantiation (Node : Link) is
G_Unit : constant Asis.Expression :=
Declarations.Generic_Unit_Name (Node.Spec);
-- The generic unit name (name after the reserved word is)
G_Name : constant String := Image (Text.Element_Image (G_Unit));
begin
if G_Name = "SOAP.Utils.Safe_Pointers" then
-- This is the safe pointer AWS/SOAP runtime type support
declare
Actual : Asis.Association_List :=
Declarations.Generic_Actual_Part (Node.Spec);
begin
if Actual'Length = 2 then
-- There is only two formal parameters, the first one is
-- the type, the second the access type to the first one.
for K in Actual'Range loop
Actual (K) := Expressions.Actual_Parameter (Actual (K));
end loop;
Generator.Register_Safe_Pointer
(Name => Node.Spec_Name.all,
Type_Name => Image (Text.Element_Image (Actual (1))),
Access_Name => Image (Text.Element_Image (Actual (2))));
end if;
end;
end if;
end Analyse_Package_Instantiation;
----------------------
-- Analyse_Profile --
----------------------
procedure Analyse_Profile (Node : Link) is
use Extensions.Flat_Kinds;
Arg_Kind : constant Flat_Element_Kinds :=
Flat_Element_Kind (Node.Spec);
Parameters : constant Asis.Element_List :=
Declarations.Parameter_Profile (Node.Spec);
begin
if not Elements.Is_Nil (Parameters) then
for I in Parameters'Range loop
declare
Elem : constant Asis.Element :=
Declarations.Declaration_Subtype_Mark
(Parameters (I));
Mode : constant Asis.Mode_Kinds :=
Elements.Mode_Kind (Parameters (I));
Names : constant Defining_Name_List :=
Declarations.Names (Parameters (I));
E : Asis.Element := Elem;
begin
-- For each name create a new formal parameter
if not (Mode = An_In_Mode
or else Mode = A_Default_In_Mode)
then
Raise_Spec_Error
(Parameters (I),
Message => "only in mode supported.");
end if;
if Elements.Expression_Kind (E) = A_Selected_Component then
E := Expressions.Selector (E);
end if;
E := Expressions.Corresponding_Name_Declaration (E);
E := Declarations.Type_Declaration_View (E);
for K in Names'Range loop
Generator.New_Formal
(NS => Name_Space (E),
Var_Name => Image (Text.Element_Image (Names (K))),
Var_Type => To_String
(Type_Def (Elem, Base => False).Name));
end loop;
end;
end loop;
end if;
if Arg_Kind = A_Function_Declaration
or else Arg_Kind = A_Generic_Function_Declaration
then
declare
Elem : constant Asis.Element :=
Declarations.Result_Profile (Node.Spec);
E : Asis.Element := Elem;
begin
if Elements.Expression_Kind (E) = A_Selected_Component then
E := Expressions.Selector (E);
end if;
E := Expressions.Corresponding_Name_Declaration (E);
E := Declarations.Type_Declaration_View (E);
Generator.Return_Type
(Name_Space (E),
To_String (Type_Def (Elem, Base => False).Name),
Node.Spec_Name.all);
end;
end if;
end Analyse_Profile;
---------------------
-- Analyse_Routine --
---------------------
procedure Analyse_Routine (Node : Link) is
use Extensions.Flat_Kinds;
Arg_Kind : constant Flat_Element_Kinds :=
Flat_Element_Kind (Node.Spec);
begin
begin
Generator.Start_Routine
(Name_Space (Node.Spec),
Node.Spec_Name.all,
(if Arg_Kind = A_Function_Declaration
then "function "
else "procedure"));
exception
when E : Spec_Error =>
Raise_Spec_Error (Node.Spec, Exception_Message (E));
end;
Analyse_Profile (Node);
end Analyse_Routine;
------------------
-- Analyse_Type --
------------------
procedure Analyse_Type (Elem : Asis.Definition) is
use Extensions.Flat_Kinds;
type U_Array_Def is record
Name, NS : Unbounded_String;
Comp_NS, Comp_Type : Unbounded_String;
Length : Positive;
end record;
Deferred_U_Arrays : array (1 .. 100) of U_Array_Def;
U_Array_Index : Natural := 0;
Def : Generator.Type_Data;
procedure Analyse_Field (Component : Asis.Element);
-- Analyse a field from the record
function Analyse_Array_Component
(Component : Asis.Element) return Generator.Type_Data;
-- Analyse an array component and return the corresponding type
-- definition.
-----------------------------
-- Analyse_Array_Component --
-----------------------------
function Analyse_Array_Component
(Component : Asis.Element) return Generator.Type_Data
is
E : Asis.Element :=
(Definitions.Subtype_Mark
(Definitions.Component_Subtype_Indication
(Component)));
E_Type : constant Generator.Type_Data :=
Type_Def (E, False);
begin
if Elements.Expression_Kind (E) = A_Selected_Component then
E := Expressions.Selector (E);
end if;
E := Declarations.Corresponding_First_Subtype
(Expressions.Corresponding_Name_Declaration (E));
Analyse_Type (E);
return E_Type;
end Analyse_Array_Component;
-------------------
-- Analyse_Field --
-------------------
procedure Analyse_Field (Component : Asis.Element) is
ODV : constant Asis.Element :=
Declarations.Object_Declaration_View (Component);
Elem : constant Asis.Element :=
Definitions.Subtype_Mark
(Definitions.Component_Subtype_Indication (ODV));
Names : constant Defining_Name_List :=
Declarations.Names (Component);
E : Asis.Element := Elem;
E_Type : Generator.Type_Data;
CND : Asis.Element;
Type_Name : Unbounded_String;
begin
if Elements.Expression_Kind (E) = A_Selected_Component then
E := Expressions.Selector (E);
end if;
CND := Expressions.Corresponding_Name_Declaration (E);
E := Declarations.Type_Declaration_View (CND);
if Flat_Element_Kind (E) = An_Unconstrained_Array_Definition then
declare
Type_Suffix : Unbounded_String;
begin
U_Array_Index := U_Array_Index + 1;
-- Set array's component type information
E := Definitions.Array_Component_Definition (E);
E_Type := Analyse_Array_Component (E);
Deferred_U_Arrays (U_Array_Index).Comp_NS := E_Type.NS;
Deferred_U_Arrays (U_Array_Index).Comp_Type := E_Type.Name;
Deferred_U_Arrays (U_Array_Index).NS :=
To_Unbounded_String (Name_Space (E));
-- Set array's type name
Deferred_U_Arrays (U_Array_Index).Name :=
To_Unbounded_String
(Image
(Text.Element_Image
(Declarations.Names (CND) (1))));
-- Get array's constraint, an array inside a record must be
-- constrained.
E := Definitions.Subtype_Constraint
(Definitions.Component_Subtype_Indication (ODV));
declare
R : constant Asis.Discrete_Range_List :=
Definitions.Discrete_Ranges (E);
begin
if R'Length /= 1 then
Raise_Spec_Error
(E,
Message => "Arrays with multiple dimensions not "
& "supported.");
end if;
-- Add array's name suffix
Array_Type_Suffix
(R (1), Type_Suffix,
Deferred_U_Arrays (U_Array_Index).Length);
Append (Deferred_U_Arrays (U_Array_Index).Name,
Type_Suffix);
end;
Type_Name := Deferred_U_Arrays (U_Array_Index).Name;
end;
end if;
-- Append the type of the field into the list of deferred type to
-- analyse later if needed. Indeed if this type is only used into
-- the record and is defined into a separate package we need to
-- analyse it to get the corresponding WSDL definition.
Append_Deferred (Declarations.Corresponding_First_Subtype (CND));
declare
T : constant Flat_Element_Kinds :=
Flat_Element_Kind
(Declarations.Type_Declaration_View
(Declarations.Corresponding_First_Subtype (CND)));
begin
if Flat_Element_Kind (CND) = A_Subtype_Declaration
and then T /= A_Signed_Integer_Type_Definition
and then T /= A_Floating_Point_Definition
then
-- This is a subtype field
Type_Name := To_Unbounded_String
(Image (Text.Element_Image (ODV)));
end if;
end;
if Type_Name = Null_Unbounded_String then
-- If type name not set, then compute it now
Type_Name := Type_Def (Elem, Base => False).Name;
end if;
for K in Names'Range loop
Generator.New_Component
(NS => Name_Space
(Declarations.Type_Declaration_View (CND)),
Comp_Name => Image (Text.Element_Image (Names (K))),
Comp_Type => To_String (Type_Name));
end loop;
end Analyse_Field;
Name : constant String :=
Image
(Declarations.Defining_Name_Image
(Declarations.Names (Elem) (1)));
E : Asis.Definition :=
Declarations.Type_Declaration_View (Elem);
E_Type : Generator.Type_Data;
Type_Kind : constant Flat_Element_Kinds := Flat_Element_Kind (E);
begin
case Type_Kind is
when A_Record_Type_Definition =>
if not Generator.Type_Exists (Name_Space (E), Name) then
Generator.Start_Record (Name_Space (E), Name);
E := Definitions.Record_Definition (E);
declare
R : constant Asis.Record_Component_List :=
Definitions.Record_Components (E);
begin
for K in R'Range loop
Analyse_Field (R (K));
end loop;
end;
-- Create now all deferred arrays
for K in 1 .. U_Array_Index loop
Generator.Start_Array
(To_String (Deferred_U_Arrays (K).NS),
To_String (Deferred_U_Arrays (K).Name),
To_String (Deferred_U_Arrays (K).Comp_NS),
To_String (Deferred_U_Arrays (K).Comp_Type),
Deferred_U_Arrays (K).Length);
end loop;
end if;
when A_Constrained_Array_Definition =>
declare
S : constant Asis.Definition_List :=
Definitions.Discrete_Subtype_Definitions (E);
Array_Len : Natural;
Type_Suffix : Unbounded_String;
C : Asis.Element;
begin
if S'Length /= 1 then
Raise_Spec_Error
(E,
Message => "Arrays with multiple dimensions not "
& "supported.");
end if;
if Flat_Element_Kind (S (1))
= A_Discrete_Simple_Expression_Range_As_Subtype_Definition
then
-- This is the constraint (a .. b)
C := S (1);
else
-- This is a subtype definition as constraint
-- (Positive range a .. b)
C := Definitions.Subtype_Constraint (S (1));
end if;
Array_Type_Suffix (C, Type_Suffix, Array_Len);
E := Definitions.Array_Component_Definition (E);
if not Generator.Type_Exists (Name_Space (E), Name) then
E_Type := Analyse_Array_Component (E);
Generator.Start_Array
(Name_Space (E), Name,
To_String (E_Type.NS),
To_String (E_Type.Name),
Array_Len);
end if;
end;
when An_Unconstrained_Array_Definition =>
E := Definitions.Array_Component_Definition (E);
if not Generator.Type_Exists (Name_Space (E), Name) then
E_Type := Analyse_Array_Component (E);
Generator.Start_Array
(Name_Space (E), Name,
To_String (E_Type.NS),
To_String (E_Type.Name));
end if;
when A_Derived_Type_Definition =>
declare
TDV : constant Asis.Element :=
Declarations.Type_Declaration_View
(Definitions.Corresponding_Root_Type (E));
PST : Asis.Element;
C : Asis.Constraint;
Comp : Asis.Element;
begin
if Flat_Element_Kind (TDV)
= An_Unconstrained_Array_Definition
or else Flat_Element_Kind (TDV)
= A_Constrained_Array_Definition
then
-- This is derived type from an array, we have to create
-- a new array definition if this derived type as a set
-- of constraint.
PST := Definitions.Parent_Subtype_Indication (E);
C := Definitions.Subtype_Constraint (PST);
Comp := Definitions.Array_Component_Definition (TDV);
-- Check whether the base name is a standard Ada string
declare
B_Name : constant String :=
Characters.Handling.To_Lower
(Image (Text.Element_Image
(Definitions.Subtype_Mark (PST))));
Len : Unbounded_String;
begin
if B_Name = "string" then
if Flat_Element_Kind (C) = An_Index_Constraint then
declare
R : constant Asis.Discrete_Range_List :=
Definitions.Discrete_Ranges (C);
Dummy : Unbounded_String;
Str_Len : Natural;
begin
Array_Type_Suffix (R (1), Dummy, Str_Len);
Len := To_Unbounded_String
(AWS.Utils.Image (Str_Len));
end;
end if;
if not Generator.Type_Exists
(Name_Space (E), Name)
then
Generator.Register_Derived
(Name_Space (E), Name,
(To_Unbounded_String
(SOAP.Name_Space.Value
(SOAP.Name_Space.XSD)),
To_Unbounded_String ("string"),
Null_Unbounded_String,
Null_Unbounded_String,
Len));
end if;
return;
end if;
end;
if Flat_Element_Kind (C) = An_Index_Constraint then
-- This derived type has constraints
declare
R : constant Asis.Discrete_Range_List :=
Definitions.Discrete_Ranges (C);
Type_Suffix : Unbounded_String;
Array_Len : Natural;
begin
if R'Length /= 1 then
Raise_Spec_Error
(C,
Message => "Arrays with multiple dimensions"
& " not supported.");
end if;
Array_Type_Suffix (R (1), Type_Suffix, Array_Len);
if not Generator.Type_Exists
(Name_Space (Comp), Name)
then
E_Type := Analyse_Array_Component (Comp);
Generator.Start_Array
(Name_Space (Comp), Name,
To_String (E_Type.NS),
To_String (E_Type.Name),
Array_Len);
end if;
return;
end;
end if;
end if;
end;
if not Generator.Type_Exists (Name_Space (E), Name) then
Generator.Register_Derived
(Name_Space (E), Name,
Type_Def (Elem, Base => False));
end if;
when A_Subtype_Indication =>
declare
CFS : constant Asis.Declaration :=
Declarations.Corresponding_First_Subtype (Elem);
TDV : constant Asis.Definition :=
Declarations.Type_Declaration_View (CFS);
C : Asis.Constraint;
Comp : Asis.Element;
begin
if Flat_Element_Kind (TDV)
= An_Unconstrained_Array_Definition
then
-- This is a subtype of an unconstraint array, create
-- the corresponding array definition.
C := Definitions.Subtype_Constraint (E);
Comp := Definitions.Array_Component_Definition (TDV);
declare
R : constant Asis.Discrete_Range_List :=
Definitions.Discrete_Ranges (C);
Type_Suffix : Unbounded_String;
Array_Len : Natural;
begin
if R'Length /= 1 then
Raise_Spec_Error
(C,
Message => "Arrays with multiple dimensions"
& " not supported.");
end if;
Array_Type_Suffix (R (1), Type_Suffix, Array_Len);
if not Generator.Type_Exists
(Name_Space (Comp), Name)
then
E_Type := Analyse_Array_Component (Comp);
Generator.Start_Array
(Name_Space (Comp), Name,
To_String (E_Type.NS),
To_String (E_Type.Name),
Array_Len);
end if;
end;
else
if not Generator.Type_Exists (Name_Space (E), Name) then
Generator.Register_Type
(Name_Space (E), Name,
Type_Def (Elem, Base => True));
end if;
end if;
end;
when An_Enumeration_Type_Definition =>
if not Options.Enum_To_String then
if not Generator.Type_Exists (Name_Space (E), Name) then
Generator.Start_Enumeration (Name_Space (E), Name);
declare
D : constant Asis.Declaration_List :=
Definitions.Enumeration_Literal_Declarations (E);
begin
for K in D'Range loop
Generator.New_Literal
(Image
(Text.Element_Image
(Declarations.Names (D (K)) (1))));
end loop;
end;
end if;
end if;
when A_Signed_Integer_Type_Definition
| A_Modular_Type_Definition
| A_Floating_Point_Definition
=>
if not Is_Standard (Elem)
and then not Generator.Type_Exists (Name_Space (E), Name)
then
-- We do not want to generate types declared in standard
Def := Type_Def (Elem, Base => True);
Generator.Register_Type (Name_Space (E), Name, Def);
end if;
when others =>
-- A type definition not handled by this version
null;
end case;
end Analyse_Type;
-----------------------
-- Array_Type_Suffix --
-----------------------
procedure Array_Type_Suffix
(E : Asis.Element;
Type_Suffix : out Unbounded_String;
Length : out Positive)
is
Low : constant Asis.Expression := Definitions.Lower_Bound (E);
Up : constant Asis.Expression := Definitions.Upper_Bound (E);
begin
declare
Low_Str : constant String := Image (Text.Element_Image (Low));
Up_Str : constant String := Image (Text.Element_Image (Up));
begin
Length := Integer'Value (Up_Str) - Integer'Value (Low_Str) + 1;
Type_Suffix := To_Unbounded_String ("_" & Low_Str & "_" & Up_Str);
exception
when others =>
Raise_Spec_Error
(E,
Message => "Only arrays with numeric indexes supported.");
end;
end Array_Type_Suffix;
-----------------
-- Is_Standard --
-----------------
function Is_Standard (T : Asis.Declaration) return Boolean is
begin
return Characters.Handling.To_Lower
(Image
(Compilation_Units.Unit_Full_Name
(Elements.Enclosing_Compilation_Unit (T)))) = "standard";
end Is_Standard;
----------------
-- Name_Space --
----------------
function Name_Space (E : Asis.Element) return String is
NS : String :=
Image (Compilation_Units.Unit_Full_Name
(Elements.Enclosing_Compilation_Unit (E)));
begin
Strings.Fixed.Translate (NS, Strings.Maps.To_Mapping (".", "/"));
declare
Res : String (1 .. NS'Length + Strings.Fixed.Count (NS, "/") * 4);
I : Natural := 0;
begin
for K in NS'Range loop
I := I + 1;
if NS (K) = '/' then
Res (I .. I + 4) := "_pkg/";
I := I + 4;
else
Res (I) := NS (K);
end if;
end loop;
return SOAP.Name_Space.Value (SOAP.Name_Space.AWS) & Res & "_pkg/";
end;
end Name_Space;
--------------
-- Type_Def --
--------------
function Type_Def
(Elem : Asis.Element;
Base : Boolean) return Generator.Type_Data
is
use Extensions.Flat_Kinds;
function Register_Deferred
(E : Asis.Declaration) return Generator.Type_Data;
-- Register a deferred type to be generated after first
-- pass. Returns the name of the type.
function Register_Deferred_I
(E : Asis.Declaration;
First : Long_Long_Integer := Long_Long_Integer'Last;
Last : Long_Long_Integer := Long_Long_Integer'First)
return Generator.Type_Data;
-- Same as above for integer and optional range
function Register_Deferred_F
(E : Asis.Declaration;
First : Long_Float := Long_Float'Last;
Last : Long_Float := Long_Float'First)
return Generator.Type_Data;
-- Same as above for float and optional range
function "+" (Str : String)
return Unbounded_String renames To_Unbounded_String;
function Build_Type
(Name : String;
NS : String := SOAP.Name_Space.Value (SOAP.Name_Space.XSD);
First : Long_Long_Integer := Long_Long_Integer'Last;
Last : Long_Long_Integer := Long_Long_Integer'First)
return Generator.Type_Data
is (+NS, +Name,
(if First = Long_Long_Integer'Last
then Null_Unbounded_String
else +Long_Long_Integer'Image (First)),
(if Last = Long_Long_Integer'First
then Null_Unbounded_String
else +Long_Long_Integer'Image (Last)),
Null_Unbounded_String);
function Build_Type_F
(Name : String;
NS : String := SOAP.Name_Space.Value (SOAP.Name_Space.XSD);
First : Long_Float := Long_Float'Last;
Last : Long_Float := Long_Float'First)
return Generator.Type_Data
is (+NS, +Name,
(if First = Long_Float'Last
then Null_Unbounded_String
else +Long_Float'Image (First)),
(if Last = Long_Float'First
then Null_Unbounded_String
else +Long_Float'Image (Last)),
Null_Unbounded_String);
procedure Get_Range
(E : Asis.Element; Lower, Upper : out Long_Long_Integer);
procedure Get_Range
(E : Asis.Element; Lower, Upper : out Long_Float);
-- Returns the range constraint for the given type pointed to by E
function Compute_Value
(V : Asis.Expression) return Long_Long_Integer;
function Compute_Value
(V : Asis.Expression) return Long_Float;
function Compute_Value
(V : Asis.Expression) return SOAP.Types.Unsigned_Long;
-- Retruns the computed value for the given expression. This is
-- supposed to be a simple expression for a range declaration:
-- range -2**5 .. 2**7 or mod 2**15;
function Is_Calendar (T : Asis.Declaration) return Boolean;
-- Returns true if the declaration is inside the Ada.Calendar package
-------------------
-- Compute_Value --
-------------------
function Compute_Value
(V : Asis.Expression) return Long_Float
is
use type Regpat.Match_Location;
VI : constant String :=
Strings.Fixed.Trim
(Image (Text.Element_Image (V)), Strings.Both);
-- [+-] n
R1 : constant Regpat.Pattern_Matcher :=
Regpat.Compile ("^([+-]?[\d_.]+)$");
-- [+-] n ** exp
R2 : constant Regpat.Pattern_Matcher :=
Regpat.Compile ("^([+-]?[\d_.]+) *\*\* *(\+?[\d_]+)$");
-- [+-] n ** exp - n
R3 : constant Regpat.Pattern_Matcher :=
Regpat.Compile
("^([+-]?[\d_.]+) *\*\* *(\+?[\d_]+) *- *([\d_.]+)$");
-- [+-] n ** exp + n
R4 : constant Regpat.Pattern_Matcher :=
Regpat.Compile
("^([+-]?[\d_.]+) *\*\* *(\+?[\d_]+) *\+ *([\d_.]+)$");
M : Regpat.Match_Array (1 .. 3);
begin
Regpat.Match (R1, VI, M);
if M (1) /= Regpat.No_Match and then M (1).Last = VI'Last then
return Long_Float'Value
(VI (M (1).First .. M (1).Last));
end if;
Regpat.Match (R2, VI, M);
if M (1) /= Regpat.No_Match
and then M (2) /= Regpat.No_Match
and then M (2).Last = VI'Last
then
return Long_Float'Value (VI (M (1).First .. M (1).Last))
** Integer'Value (VI (M (2).First .. M (2).Last));
end if;
Regpat.Match (R3, VI, M);
if M (1) /= Regpat.No_Match
and then M (2) /= Regpat.No_Match
and then M (3) /= Regpat.No_Match
and then M (3).Last = VI'Last
then
if VI (M (1).First .. M (1).Last) = "1.0"
and then VI (M (2).First .. M (2).Last) = "256"
then
return Long_Float'Last;
else
return
Long_Float'Value (VI (M (1).First .. M (1).Last))
** Integer'Value (VI (M (2).First .. M (2).Last))
- Long_Float'Value (VI (M (3).First .. M (3).Last));
end if;
end if;
Regpat.Match (R4, VI, M);
if M (1) /= Regpat.No_Match
and then M (2) /= Regpat.No_Match
and then M (3) /= Regpat.No_Match
and then M (3).Last = VI'Last
then
return Long_Float'Value (VI (M (1).First .. M (1).Last))
** Integer'Value (VI (M (2).First .. M (2).Last))
+ Long_Float'Value (VI (M (3).First .. M (3).Last));
end if;
-- The expression is not supported
return 0.0;
end Compute_Value;
function Compute_Value
(V : Asis.Expression) return Long_Long_Integer
is
use type Regpat.Match_Location;
VI : constant String :=
Strings.Fixed.Trim
(Image (Text.Element_Image (V)), Strings.Both);
-- [+-] n
R1 : constant Regpat.Pattern_Matcher :=
Regpat.Compile ("^([+-]?[\d_]+)$");
-- [+-] n ** exp
R2 : constant Regpat.Pattern_Matcher :=
Regpat.Compile ("^([+-]?[\d_]+) *\*\* *(\+?[\d_]+)$");
-- [+-] n ** exp - n
R3 : constant Regpat.Pattern_Matcher :=
Regpat.Compile
("^([+-]?[\d_]+) *\*\* *(\+?[\d_]+) *- *([\d_]+)$");
-- [+-] n ** exp + n
R4 : constant Regpat.Pattern_Matcher :=
Regpat.Compile
("^([+-]?[\d_]+) *\*\* *(\+?[\d_]+) *\+ *([\d_]+)$");
M : Regpat.Match_Array (1 .. 3);
begin
Regpat.Match (R1, VI, M);
if M (1) /= Regpat.No_Match and then M (1).Last = VI'Last then
return Long_Long_Integer'Value
(VI (M (1).First .. M (1).Last));
end if;
Regpat.Match (R2, VI, M);
if M (1) /= Regpat.No_Match
and then M (2) /= Regpat.No_Match
and then M (2).Last = VI'Last
then
return Long_Long_Integer'Value (VI (M (1).First .. M (1).Last))
** Integer'Value (VI (M (2).First .. M (2).Last));
end if;
Regpat.Match (R3, VI, M);
if M (1) /= Regpat.No_Match
and then M (2) /= Regpat.No_Match
and then M (3) /= Regpat.No_Match
and then M (3).Last = VI'Last
then
if VI (M (1).First .. M (1).Last) = "2"
and then VI (M (2).First .. M (2).Last) = "63"
and then VI (M (3).First .. M (3).Last) = "1"
then
return Long_Long_Integer'Last;
else
return
Long_Long_Integer'Value (VI (M (1).First .. M (1).Last))
** Integer'Value (VI (M (2).First .. M (2).Last))
- Long_Long_Integer'Value (VI (M (3).First .. M (3).Last));
end if;
end if;
Regpat.Match (R4, VI, M);
if M (1) /= Regpat.No_Match
and then M (2) /= Regpat.No_Match
and then M (3) /= Regpat.No_Match
and then M (3).Last = VI'Last
then
return Long_Long_Integer'Value (VI (M (1).First .. M (1).Last))
** Integer'Value (VI (M (2).First .. M (2).Last))
+ Long_Long_Integer'Value (VI (M (3).First .. M (3).Last));
end if;
-- The expression is not supported
return 0;
end Compute_Value;
function Compute_Value
(V : Asis.Expression) return SOAP.Types.Unsigned_Long
is
use type SOAP.Types.Unsigned_Long;
VI : constant String := Image (Text.Element_Image (V));
E : constant Natural := Strings.Fixed.Index (VI, "**");
N : SOAP.Types.Unsigned_Long;
N1, N2 : SOAP.Types.Unsigned_Long;
begin
N1 := SOAP.Types.Unsigned_Long'Value (VI (VI'First .. E - 1));
N2 := SOAP.Types.Unsigned_Long'Value (VI (E + 2 .. VI'Last));
if N1 = 2 and then N2 = 64 then
N := SOAP.Types.Unsigned_Long'Last;
else
N := N1;
for K in 1 .. N2 - 1 loop
N := N * N1;
end loop;
N := N - 1;
end if;
return N;
end Compute_Value;
---------------
-- Get_Range --
---------------
procedure Get_Range
(E : Asis.Element; Lower, Upper : out Long_Long_Integer)
is
C : Asis.Element := E;
LB, UB : Asis.Expression;
begin
Lower := Long_Long_Integer'Last;
Upper := Long_Long_Integer'First;
if Flat_Element_Kind (C) = An_Ordinary_Type_Declaration then
C := Declarations.Type_Declaration_View (C);
end if;
case Flat_Element_Kind (C) is
when A_Signed_Integer_Type_Definition =>
C := Definitions.Integer_Constraint (C);
when A_Derived_Type_Definition =>
C := Definitions.Subtype_Constraint
(Definitions.Parent_Subtype_Indication (C));
when others =>
null;
end case;
if Flat_Element_Kind (C) = A_Simple_Expression_Range then
LB := Definitions.Lower_Bound (C);
UB := Definitions.Upper_Bound (C);
if Flat_Element_Kind (LB) = A_Function_Call then
Lower := Compute_Value (LB);
elsif Flat_Element_Kind (LB) = A_First_Attribute then
Lower := Long_Long_Integer'Last;
else
Lower := Long_Long_Integer'Value
(Image (Expressions.Value_Image (LB)));
end if;
if Flat_Element_Kind (UB) = A_Function_Call then
Upper := Compute_Value (UB);
elsif Flat_Element_Kind (UB) = A_Last_Attribute then
Upper := Long_Long_Integer'First;
else
Upper := Long_Long_Integer'Value
(Image (Expressions.Value_Image (UB)));
end if;
end if;
end Get_Range;
procedure Get_Range
(E : Asis.Element; Lower, Upper : out Long_Float)
is
C : Asis.Element;
LB, UB : Asis.Expression;
begin
Lower := Long_Float'Last;
Upper := Long_Float'First;
case Flat_Element_Kind (E) is
when A_Floating_Point_Definition =>
C := Definitions.Real_Range_Constraint (E);
when An_Ordinary_Type_Declaration =>
C := Definitions.Subtype_Constraint
(Definitions.Parent_Subtype_Indication
(Declarations.Type_Declaration_View (E)));
when A_Derived_Type_Definition =>
C := Definitions.Subtype_Constraint (E);
when others =>
C := E;
end case;
if Flat_Element_Kind (C) = A_Simple_Expression_Range then
LB := Definitions.Lower_Bound (C);
UB := Definitions.Upper_Bound (C);
if Flat_Element_Kind (LB) = A_Function_Call then
Lower := Compute_Value (LB);
elsif Flat_Element_Kind (LB) = A_First_Attribute then
Lower := Long_Float'Last;
else
Lower := Long_Float'Value
(Image (Expressions.Value_Image (LB)));
end if;
if Flat_Element_Kind (UB) = A_Function_Call then
Upper := Compute_Value (UB);
elsif Flat_Element_Kind (UB) = A_Last_Attribute then
Upper := Long_Float'First;
else
Upper := Long_Float'Value
(Image (Expressions.Value_Image (UB)));
end if;
end if;
end Get_Range;
-----------------
-- Is_Calendar --
-----------------
function Is_Calendar (T : Asis.Declaration) return Boolean is
begin
return Characters.Handling.To_Lower
(Image
(Compilation_Units.Unit_Full_Name
(Elements.Enclosing_Compilation_Unit (T))))
= "ada.calendar";
end Is_Calendar;
-----------------------
-- Register_Deferred --
-----------------------
function Register_Deferred
(E : Asis.Declaration) return Generator.Type_Data
is
Name : constant String :=
Image
(Declarations.Defining_Name_Image
(Declarations.Names (E) (1)));
begin
Append_Deferred (E);
return Build_Type (Name, Name_Space (Declarations.Names (E) (1)));
end Register_Deferred;
-------------------------
-- Register_Deferred_F --
-------------------------
function Register_Deferred_F
(E : Asis.Declaration;
First : Long_Float := Long_Float'Last;
Last : Long_Float := Long_Float'First)
return Generator.Type_Data
is
Name : constant String :=
Image
(Declarations.Defining_Name_Image
(Declarations.Names (E) (1)));
begin
Append_Deferred (E);
return Build_Type_F
(Name, Name_Space (Declarations.Names (E) (1)), First, Last);
end Register_Deferred_F;
-------------------------
-- Register_Deferred_I --
-------------------------
function Register_Deferred_I
(E : Asis.Declaration;
First : Long_Long_Integer := Long_Long_Integer'Last;
Last : Long_Long_Integer := Long_Long_Integer'First)
return Generator.Type_Data
is
Name : constant String :=
Image
(Declarations.Defining_Name_Image
(Declarations.Names (E) (1)));
begin
Append_Deferred (E);
return Build_Type
(Name, Name_Space (Declarations.Names (E) (1)), First, Last);
end Register_Deferred_I;
E : Asis.Element := Elem;
CFS : Asis.Declaration;
CND : Asis.Declaration;
Tn : Asis.Element := Elem;
begin
if Elements.Expression_Kind (E) = A_Selected_Component then
E := Expressions.Selector (E);
end if;
if Flat_Element_Kind (E) = An_Ordinary_Type_Declaration
and then Flat_Element_Kind (Declarations.Type_Declaration_View (E))
= A_Derived_Type_Definition
then
E := Declarations.Type_Declaration_View (E);
end if;
if Flat_Element_Kind (E) = A_Derived_Type_Definition then
E := Definitions.Subtype_Mark
(Definitions.Parent_Subtype_Indication (E));
Tn := E;
end if;
if Elements.Expression_Kind (E) = A_Selected_Component then
E := Expressions.Selector (E);
end if;
if Flat_Element_Kind (E) /= An_Ordinary_Type_Declaration
and then Flat_Element_Kind (E) /= A_Subtype_Declaration
and then Flat_Element_Kind (E) /= A_Derived_Type_Definition
and then Flat_Element_Kind (E) /= A_Selected_Component
then
CND := Expressions.Corresponding_Name_Declaration (E);
else
CND := Elem;
end if;
CFS := Declarations.Corresponding_First_Subtype (CND);
-- Get type view
E := Declarations.Type_Declaration_View (CFS);
case Flat_Element_Kind (E) is
when A_Record_Type_Definition =>
-- This is a record, checks if the record definition has
-- been parsed.
return Register_Deferred (CFS);
when An_Enumeration_Type_Definition =>
-- Handle special enumerations like Boolean and Character
if Characters.Handling.To_Lower
(Image (Text.Element_Image (Elem))) = "character"
then
return Build_Type ("character");
elsif Characters.Handling.To_Lower
(Image (Text.Element_Image (Elem))) = "boolean"
then
return Build_Type ("boolean");
else
if Options.Enum_To_String then
return Build_Type ("string");
else
return Register_Deferred (CFS);
end if;
end if;
when A_Floating_Point_Definition =>
-- This is a floating point type, check the constraint to
-- return the proper mapping.
if Base then
declare
Dig : constant Integer :=
Integer'Value
(Image (Expressions.Value_Image
(Definitions.Digits_Expression (E))));
Ilb, Iub : Long_Float;
begin
Get_Range (E, Ilb, Iub);
if Dig <= Float'Digits then
return Build_Type_F
("float", First => Ilb, Last => Iub);
else
return Build_Type_F
("long_float", First => Ilb, Last => Iub);
end if;
end;
else
declare
NS_Name : constant String := Name_Space (Tn);
NS_Type : constant String := Name_Space (CFS);
Name : constant String :=
Image (Text.Element_Image (Tn));
Ilb, Iub : Long_Float;
begin
Get_Range (Elem, Ilb, Iub);
-- If the type is not un the current package (so in
-- different name space). We need to analyse it later
-- so, we do register a differred analysis for this type.
if NS_Name = NS_Type or else Is_Standard (CFS) then
return Build_Type_F
(Name, NS_Type, First => Ilb, Last => Iub);
else
return Register_Deferred_F (CFS, Ilb, Iub);
end if;
end;
end if;
when A_Modular_Type_Definition =>
-- This is an integer type, check the constraint to return the
-- proper mapping.
if Base then
declare
use type SOAP.Types.Unsigned_Long;
Mod_Node : constant Asis.Expression :=
Definitions.Mod_Static_Expression (E);
Modulus : SOAP.Types.Unsigned_Long;
begin
if Flat_Element_Kind (Mod_Node) = A_Function_Call then
Modulus := Compute_Value (Mod_Node);
else
Modulus := SOAP.Types.Unsigned_Long'Value
(Image (Expressions.Value_Image (Mod_Node)));
end if;
if Modulus = SOAP.Types.Unsigned_Long
(SOAP.Types.Unsigned_Byte'Modulus - 1)
then
return Build_Type ("unsigned_byte");
elsif Modulus < SOAP.Types.Unsigned_Long
(SOAP.Types.Unsigned_Byte'Modulus - 1)
then
return Build_Type
("unsigned_byte",
Last => Long_Long_Integer (Modulus - 1));
elsif Modulus = SOAP.Types.Unsigned_Long
(SOAP.Types.Unsigned_Short'Modulus - 1)
then
return Build_Type ("unsigned_short");
elsif Modulus < SOAP.Types.Unsigned_Long
(SOAP.Types.Unsigned_Short'Modulus - 1)
then
return Build_Type
("unsigned_short",
Last => Long_Long_Integer (Modulus - 1));
elsif Modulus = SOAP.Types.Unsigned_Long
(SOAP.Types.Unsigned_Int'Modulus - 1)
then
return Build_Type ("unsigned_int");
elsif Modulus < SOAP.Types.Unsigned_Long
(SOAP.Types.Unsigned_Int'Modulus - 1)
then
return Build_Type
("unsigned_int",
Last => Long_Long_Integer (Modulus - 1));
elsif Modulus = SOAP.Types.Unsigned_Long
(SOAP.Types.Unsigned_Long'Modulus - 1)
then
return Build_Type ("unsigned_long");
else
return Build_Type
("unsigned_long",
Last => Long_Long_Integer (Modulus - 1));
end if;
end;
else
declare
NS_Name : constant String := Name_Space (Tn);
NS_Type : constant String := Name_Space (CFS);
Name : constant String :=
Image (Text.Element_Image (Tn));
begin
-- If the type is not un the current package (so in
-- different name space). We need to analyse it later
-- so, we do register a differred analysis for this type.
if NS_Name = NS_Type or else Is_Standard (CFS) then
return Build_Type (Name, NS_Type);
else
return Register_Deferred (CFS);
end if;
end;
end if;
when A_Signed_Integer_Type_Definition =>
-- This is an integer type, check the constraint to return the
-- proper mapping.
if Base then
declare
Ilb, Iub : Long_Long_Integer;
begin
Get_Range (E, Ilb, Iub);
if Ilb = Long_Long_Integer (SOAP.Types.Byte'First)
and then Iub = Long_Long_Integer (SOAP.Types.Byte'Last)
then
return Build_Type ("byte");
elsif Ilb >= Long_Long_Integer (SOAP.Types.Byte'First)
and then Iub <= Long_Long_Integer (SOAP.Types.Byte'Last)
then
return Build_Type ("byte", First => Ilb, Last => Iub);
elsif Ilb = Long_Long_Integer (SOAP.Types.Short'First)
and then
Iub = Long_Long_Integer (SOAP.Types.Short'Last)
then
return Build_Type ("short");
elsif Ilb >= Long_Long_Integer (SOAP.Types.Short'First)
and then
Iub <= Long_Long_Integer (SOAP.Types.Short'Last)
then
return Build_Type ("short", First => Ilb, Last => Iub);
elsif Ilb = Long_Long_Integer (Integer'First)
and then Iub = Long_Long_Integer (Integer'Last)
then
return Build_Type ("integer");
elsif Ilb >= Long_Long_Integer (Integer'First)
and then Iub <= Long_Long_Integer (Integer'Last)
then
return Build_Type
("integer", First => Ilb, Last => Iub);
elsif Ilb = Long_Long_Integer (Long_Integer'First)
and then Iub = Long_Long_Integer (Long_Integer'Last)
then
return Build_Type ("long");
else
return Build_Type ("long", First => Ilb, Last => Iub);
end if;
end;
else
declare
NS_Name : constant String := Name_Space (Tn);
NS_Type : constant String := Name_Space (CFS);
Name : constant String :=
Image (Text.Element_Image (Tn));
Ilb, Iub : Long_Long_Integer;
begin
Get_Range (Elem, Ilb, Iub);
-- If the type is not un the current package (so in
-- different name space). We need to analyse it later
-- so, we do register a differred analysis for this type.
if NS_Name = NS_Type or else Is_Standard (CFS) then
return Build_Type
(Name, NS_Type, First => Ilb, Last => Iub);
else
return Register_Deferred_I (CFS, Ilb, Iub);
end if;
end;
end if;
when A_Derived_Type_Definition =>
-- This is a derived type definition, analyse the name after
-- the "is new".
-- Record the type to generate the corresponding schema.
return Register_Deferred (CFS);
when A_Constrained_Array_Definition
| An_Unconstrained_Array_Definition
=>
-- If this array definition is the standard Ada String,
-- returns it, no need to analyse this further.
declare
T_Name : constant String :=
Characters.Handling.To_Lower
(Image (Text.Element_Image (Elem)));
begin
-- Check for specific array name like String and Base64
if T_Name = "string" then
return Build_Type ("string");
elsif T_Name = "soap_base64"
or else T_Name = "utils.soap_base64"
or else T_Name = "soap.utils.soap_base64"
then
-- This is the SOAP Base64 runtime type support
return Build_Type ("SOAP_Base64");
else
return Register_Deferred (CFS);
end if;
end;
when A_Private_Type_Definition =>
E := Declarations.Names (CFS) (1);
declare
Name : constant String :=
Characters.Handling.To_Lower
(Image (Declarations.Defining_Name_Image (E)));
begin
if Name = "unbounded_string" then
if Base then
return Build_Type ("string");
else
return Build_Type ("unbounded_string");
end if;
elsif Name = "time" and then Is_Calendar (E) then
return Build_Type ("time");
else
Raise_Spec_Error
(E, Message => "unsupported private type " & Name);
end if;
end;
when A_Derived_Record_Extension_Definition =>
-- This can be a safe pointer object
declare
Name : constant String :=
Characters.Handling.To_Lower
(Image
(Declarations.Defining_Name_Image
(Declarations.Names (CFS) (1))));
begin
if Name = "safe_pointer" then
-- We have a Safe_Pointer definition here, let's get the
-- corresponding type.
-- Get the record definition
E := Definitions.Record_Definition (E);
-- Get first record element type
E := Definitions.Subtype_Mark
(Definitions.Component_Subtype_Indication
(Declarations.Object_Declaration_View
(Definitions.Record_Components (E) (1))));
-- Get the corresponding type
E := Declarations.Type_Declaration_View
(Declarations.Corresponding_First_Subtype
(Expressions.Corresponding_Name_Declaration (E)));
E := Definitions.Access_To_Object_Definition (E);
E := Definitions.Subtype_Mark (E);
E := Declarations.Corresponding_First_Subtype
(Expressions.Corresponding_Name_Declaration (E));
return Register_Deferred (E);
else
Raise_Spec_Error
(E, Message => "unsupported record extension " & Name);
end if;
end;
when others =>
E := Declarations.Names (CFS) (1);
Raise_Spec_Error
(E,
Message => "unsupported element kind "
& Image (Declarations.Defining_Name_Image (E)));
end case;
end Type_Def;
begin
Analyse_Node (Body_Structure'Access);
-- Analyse deferred types
declare
Prev_Index : Natural;
First : Positive := 1;
begin
-- When analysing the deferred types we could have some more types
-- discoverred. Do the analyse of the defintions until there is no
-- more added into the deferred list.
loop
Prev_Index := Index;
for K in First .. Index loop
Analyse_Type (Deferred_Types (K));
end loop;
exit when Prev_Index = Index;
First := Prev_Index;
end loop;
end;
end Analyse_Structure;
---------------------
-- Append_Deferred --
---------------------
procedure Append_Deferred (E : Asis.Element) is
begin
Index := Index + 1;
Deferred_Types (Index) := E;
end Append_Deferred;
--------------
-- Clean_Up --
--------------
procedure Clean_Up is
begin
-- Deleting the tree file itself
Directories.Delete_File (Tree_Name.all);
-- And the corresponding ALI file
Directories.Delete_File
(Tree_Name (Tree_Name'First .. Tree_Name'Last - 3) & "ali");
exception
when others =>
null;
end Clean_Up;
-------------------------
-- Create_Element_Node --
-------------------------
procedure Create_Element_Node
(Element : Asis.Element;
Control : in out Traverse_Control;
State : in out Body_State)
is
use Extensions.Flat_Kinds;
Arg_Kind : constant Flat_Element_Kinds :=
Flat_Element_Kind (Element);
Current_Node : Link;
procedure Insert_In_List
(State : in out Body_State;
El : Asis.Element;
New_Node : out Link);
-- Inserts an argument Element in the current list, keeping the
-- alphabetic ordering. Creates a new sublist if needed.
-- New_Node returns the reference to the newly inserted node
--------------------
-- Insert_In_List --
--------------------
procedure Insert_In_List
(State : in out Body_State;
El : Asis.Element;
New_Node : out Link) is
begin
New_Node := new Element_Node;
New_Node.Spec := El;
New_Node.Spec_Name := new String'(Name (El));
if State.New_List_Needed then
-- Here we have to set up a new sub-list:
State.Current_List := New_Node;
New_Node.Up := State.Last_Top;
State.Last_Top.Down := New_Node;
State.New_List_Needed := False;
New_Node.Last := New_Node;
-- We've just created a new list. It contains a single element
-- which is its last Element, so we are setting the link to the
-- last element to the Prev field of the list head element
else
-- Here we have to insert New_Node in an existing list,
-- keeping the alphabetical order of program unit names
New_Node.Up := State.Current_List.Up;
if Arg_Kind = An_Incomplete_Type_Declaration then
-- No need for alphabetical ordering, inserting in the
-- very beginning:
New_Node.Last := State.Current_List.Last;
-- New_Node will be the head element of the list, so we have
-- to copy into this new head element the reference to the
-- last element of the list.
New_Node.Next := State.Current_List;
State.Current_List.Prev := New_Node;
State.Current_List := New_Node;
else
New_Node.Prev := State.Current_List.Last;
State.Current_List.Last.Next := New_Node;
State.Current_List.Last := New_Node;
end if;
end if;
end Insert_In_List;
-- Start of the processing of Create_Element_Node
begin
if State.Argument_Spec then
Body_Structure.Spec := Element;
State.Argument_Spec := False;
Body_Structure.Spec_Name := new String'(Name (Element));
Current_Node := Body_Structure'Access;
elsif Arg_Kind = A_Defining_Identifier then
-- Skipping a defining name of a spec which may contain local
-- specs requiring bodies
null;
elsif Arg_Kind = A_Protected_Definition then
-- We just have to go one level down to process protected items
null;
elsif not (Arg_Kind = A_Procedure_Declaration
or else Arg_Kind = A_Function_Declaration
or else Arg_Kind = A_Subtype_Declaration
or else Arg_Kind = An_Ordinary_Type_Declaration
or else Arg_Kind = A_Package_Declaration)
then
-- Do nothing if this is not a procedure or function
null;
else
Insert_In_List (State, Element, Current_Node);
end if;
if Arg_Kind = A_Package_Declaration
or else Arg_Kind = A_Generic_Package_Declaration
or else Arg_Kind = A_Single_Protected_Declaration
or else Arg_Kind = A_Protected_Type_Declaration
then
-- Here we may have specs requiring bodies inside a construct
State.New_List_Needed := True;
State.Last_Top := Current_Node;
elsif Arg_Kind = A_Protected_Definition then
-- We have to skip this syntax level
null;
elsif Arg_Kind = A_Package_Instantiation then
-- We want to keep track of all package instantiations to analyse
-- those that are used to create a safe pointer for array in
-- records.
Insert_In_List (State, Element, Current_Node);
else
-- No need to go deeper
Control := Abandon_Children;
end if;
end Create_Element_Node;
-----------------
-- Create_Tree --
-----------------
procedure Create_Tree is
File_Name : String_Access;
Success : Boolean := False;
function Get_Tree_Name return String;
-- Returns the name of the tree file
----------
-- Free --
----------
procedure Unchecked_Free is
new Ada.Unchecked_Deallocation (String, String_Access);
-------------------
-- Get_Tree_Name --
-------------------
function Get_Tree_Name return String is
F_Name : constant String :=
Directories.Base_Name (To_String (Options.File_Name));
Dot_Index : Natural;
Last : Natural;
begin
Dot_Index := Strings.Fixed.Index (F_Name, ".", Strings.Backward);
if Dot_Index = 0 then
Last := F_Name'Last;
else
Last := Dot_Index - 1;
end if;
return To_String (Options.Tree_File_Path)
& F_Name (F_Name'First .. Last) & ".adt";
end Get_Tree_Name;
begin
File_Name := new String'(To_String (Options.File_Name));
Compile
(File_Name, Arg_List (Arg_List'First .. Arg_Index), Success,
GCC => GPRBUILD,
Use_GPRBUILD => True);
if not Success then
Text_IO.Put_Line
(Text_IO.Standard_Error,
"ada2wsdl: cannot create the tree file for " & File_Name.all);
raise Parameter_Error;
end if;
Tree_Name := new String'(Get_Tree_Name);
if not Directories.Exists (Tree_Name.all) then
Text_IO.Put_Line
(Text_IO.Standard_Error,
"ada2wsdl: after compilation, cannot find tree file "
& Tree_Name.all);
Text_IO.Put_Line
(Text_IO.Standard_Error, "ada2wsdl: consider using -t option");
raise Parameter_Error;
end if;
Unchecked_Free (File_Name);
end Create_Tree;
------------------------
-- Emergency_Clean_Up --
------------------------
procedure Emergency_Clean_Up is
begin
if Ada_Environments.Is_Open (My_Context) then
Ada_Environments.Close (My_Context);
end if;
Ada_Environments.Dissociate (My_Context);
Implementation.Finalize;
if Text_IO.Is_Open (Spec_File) then
-- No need to keep a broken body in case of an emergency clean up
Text_IO.Close (Spec_File);
end if;
end Emergency_Clean_Up;
-----------
-- Go_Up --
-----------
procedure Go_Up
(Element : Asis.Element;
Control : in out Traverse_Control;
State : in out Body_State)
is
pragma Unreferenced (Control);
use Extensions.Flat_Kinds;
Arg_Kind : constant Flat_Element_Kinds := Flat_Element_Kind (Element);
begin
if not (Arg_Kind = A_Package_Declaration
or else Arg_Kind = A_Generic_Package_Declaration
or else Arg_Kind = A_Single_Protected_Declaration
or else Arg_Kind = A_Protected_Type_Declaration)
then
return;
end if;
if State.New_List_Needed then
-- No local body is needed for a given construct
State.New_List_Needed := False;
else
-- We have to reset the current list:
if State.Current_List /= null then
State.Current_List := State.Current_List.Up;
while State.Current_List.Prev /= null loop
State.Current_List := State.Current_List.Prev;
end loop;
end if;
end if;
end Go_Up;
-----------
-- Image --
-----------
function Image (Str : Wide_String) return String is
use AWS;
begin
return Strings.Fixed.Trim
(Characters.Conversions.To_String (Str),
Left => Utils.Spaces,
Right => Utils.Spaces);
end Image;
----------------
-- Initialize --
----------------
procedure Initialize is
begin
Create_Tree;
Options.Initialized := True;
exception
when others =>
Options.Initialized := False;
raise;
end Initialize;
----------
-- Name --
----------
function Name (Elem : Asis.Element) return String is
Def_Name : constant Asis.Element := Declarations.Names (Elem) (1);
begin
return Characters.Conversions.To_String
(Declarations.Defining_Name_Image (Def_Name));
end Name;
-----------
-- Start --
-----------
procedure Start is
use Text_IO;
CU : Asis.Compilation_Unit;
My_Control : Traverse_Control := Continue;
My_State : Body_State;
begin
Asis.Implementation.Initialize;
Ada_Environments.Associate
(My_Context,
"My_Context",
"-C1 " & Characters.Conversions.To_Wide_String (Tree_Name.all));
Ada_Environments.Open (My_Context);
CU := Extensions.Main_Unit_In_Current_Tree (My_Context);
if Compilation_Units.Is_Nil (CU) then
Put_Line
(Standard_Error,
"Nothing to be done for " & To_String (Options.File_Name));
return;
else
-- And here we have to do the job
Create_Structure
(Element => Elements.Unit_Declaration (CU),
Control => My_Control,
State => My_State);
if not Options.Quiet then
New_Line;
end if;
Analyse_Structure;
if not Options.Quiet then
New_Line;
Put_Line
("WSDL document " & To_String (Options.WSDL_File_Name)
& " is created for " & To_String (Options.File_Name) & '.');
end if;
end if;
Ada_Environments.Close (My_Context);
Ada_Environments.Dissociate (My_Context);
Implementation.Finalize;
exception
when Ex : Asis.Exceptions.ASIS_Inappropriate_Context
| Asis.Exceptions.ASIS_Inappropriate_Container
| Asis.Exceptions.ASIS_Inappropriate_Compilation_Unit
| Asis.Exceptions.ASIS_Inappropriate_Element
| Asis.Exceptions.ASIS_Inappropriate_Line
| Asis.Exceptions.ASIS_Inappropriate_Line_Number
| Asis.Exceptions.ASIS_Failed
=>
New_Line (Standard_Error);
Put_Line (Standard_Error, "Unexpected bug in Ada2WSDL v" & Version);
Put (Standard_Error, Exception_Name (Ex));
Put_Line (Standard_Error, " raised");
Put
(Standard_Error, "ada2wsdl: ASIS Diagnosis is "
& Characters.Conversions.To_String
(Asis.Implementation.Diagnosis));
New_Line (Standard_Error);
Put (Standard_Error, "ada2wsdl: Status Value is ");
Put_Line (Standard_Error, Asis.Errors.Error_Kinds'Image
(Asis.Implementation.Status));
Emergency_Clean_Up;
raise Fatal_Error;
when others =>
Emergency_Clean_Up;
raise;
end Start;
end Ada2WSDL.Parser;
|