Compare commits
No commits in common. "cpp" and "assembly" have entirely different histories.
1
.gitignore
vendored
1
.gitignore
vendored
@ -1,2 +1,3 @@
|
|||||||
/build/
|
/build/
|
||||||
a.out
|
a.out
|
||||||
|
/vendor/
|
||||||
|
|||||||
674
COPYING3
674
COPYING3
@ -1,674 +0,0 @@
|
|||||||
GNU GENERAL PUBLIC LICENSE
|
|
||||||
Version 3, 29 June 2007
|
|
||||||
|
|
||||||
Copyright (C) 2007 Free Software Foundation, Inc. <http://fsf.org/>
|
|
||||||
Everyone is permitted to copy and distribute verbatim copies
|
|
||||||
of this license document, but changing it is not allowed.
|
|
||||||
|
|
||||||
Preamble
|
|
||||||
|
|
||||||
The GNU General Public License is a free, copyleft license for
|
|
||||||
software and other kinds of works.
|
|
||||||
|
|
||||||
The licenses for most software and other practical works are designed
|
|
||||||
to take away your freedom to share and change the works. By contrast,
|
|
||||||
the GNU General Public License is intended to guarantee your freedom to
|
|
||||||
share and change all versions of a program--to make sure it remains free
|
|
||||||
software for all its users. We, the Free Software Foundation, use the
|
|
||||||
GNU General Public License for most of our software; it applies also to
|
|
||||||
any other work released this way by its authors. You can apply it to
|
|
||||||
your programs, too.
|
|
||||||
|
|
||||||
When we speak of free software, we are referring to freedom, not
|
|
||||||
price. Our General Public Licenses are designed to make sure that you
|
|
||||||
have the freedom to distribute copies of free software (and charge for
|
|
||||||
them if you wish), that you receive source code or can get it if you
|
|
||||||
want it, that you can change the software or use pieces of it in new
|
|
||||||
free programs, and that you know you can do these things.
|
|
||||||
|
|
||||||
To protect your rights, we need to prevent others from denying you
|
|
||||||
these rights or asking you to surrender the rights. Therefore, you have
|
|
||||||
certain responsibilities if you distribute copies of the software, or if
|
|
||||||
you modify it: responsibilities to respect the freedom of others.
|
|
||||||
|
|
||||||
For example, if you distribute copies of such a program, whether
|
|
||||||
gratis or for a fee, you must pass on to the recipients the same
|
|
||||||
freedoms that you received. You must make sure that they, too, receive
|
|
||||||
or can get the source code. And you must show them these terms so they
|
|
||||||
know their rights.
|
|
||||||
|
|
||||||
Developers that use the GNU GPL protect your rights with two steps:
|
|
||||||
(1) assert copyright on the software, and (2) offer you this License
|
|
||||||
giving you legal permission to copy, distribute and/or modify it.
|
|
||||||
|
|
||||||
For the developers' and authors' protection, the GPL clearly explains
|
|
||||||
that there is no warranty for this free software. For both users' and
|
|
||||||
authors' sake, the GPL requires that modified versions be marked as
|
|
||||||
changed, so that their problems will not be attributed erroneously to
|
|
||||||
authors of previous versions.
|
|
||||||
|
|
||||||
Some devices are designed to deny users access to install or run
|
|
||||||
modified versions of the software inside them, although the manufacturer
|
|
||||||
can do so. This is fundamentally incompatible with the aim of
|
|
||||||
protecting users' freedom to change the software. The systematic
|
|
||||||
pattern of such abuse occurs in the area of products for individuals to
|
|
||||||
use, which is precisely where it is most unacceptable. Therefore, we
|
|
||||||
have designed this version of the GPL to prohibit the practice for those
|
|
||||||
products. If such problems arise substantially in other domains, we
|
|
||||||
stand ready to extend this provision to those domains in future versions
|
|
||||||
of the GPL, as needed to protect the freedom of users.
|
|
||||||
|
|
||||||
Finally, every program is threatened constantly by software patents.
|
|
||||||
States should not allow patents to restrict development and use of
|
|
||||||
software on general-purpose computers, but in those that do, we wish to
|
|
||||||
avoid the special danger that patents applied to a free program could
|
|
||||||
make it effectively proprietary. To prevent this, the GPL assures that
|
|
||||||
patents cannot be used to render the program non-free.
|
|
||||||
|
|
||||||
The precise terms and conditions for copying, distribution and
|
|
||||||
modification follow.
|
|
||||||
|
|
||||||
TERMS AND CONDITIONS
|
|
||||||
|
|
||||||
0. Definitions.
|
|
||||||
|
|
||||||
"This License" refers to version 3 of the GNU General Public License.
|
|
||||||
|
|
||||||
"Copyright" also means copyright-like laws that apply to other kinds of
|
|
||||||
works, such as semiconductor masks.
|
|
||||||
|
|
||||||
"The Program" refers to any copyrightable work licensed under this
|
|
||||||
License. Each licensee is addressed as "you". "Licensees" and
|
|
||||||
"recipients" may be individuals or organizations.
|
|
||||||
|
|
||||||
To "modify" a work means to copy from or adapt all or part of the work
|
|
||||||
in a fashion requiring copyright permission, other than the making of an
|
|
||||||
exact copy. The resulting work is called a "modified version" of the
|
|
||||||
earlier work or a work "based on" the earlier work.
|
|
||||||
|
|
||||||
A "covered work" means either the unmodified Program or a work based
|
|
||||||
on the Program.
|
|
||||||
|
|
||||||
To "propagate" a work means to do anything with it that, without
|
|
||||||
permission, would make you directly or secondarily liable for
|
|
||||||
infringement under applicable copyright law, except executing it on a
|
|
||||||
computer or modifying a private copy. Propagation includes copying,
|
|
||||||
distribution (with or without modification), making available to the
|
|
||||||
public, and in some countries other activities as well.
|
|
||||||
|
|
||||||
To "convey" a work means any kind of propagation that enables other
|
|
||||||
parties to make or receive copies. Mere interaction with a user through
|
|
||||||
a computer network, with no transfer of a copy, is not conveying.
|
|
||||||
|
|
||||||
An interactive user interface displays "Appropriate Legal Notices"
|
|
||||||
to the extent that it includes a convenient and prominently visible
|
|
||||||
feature that (1) displays an appropriate copyright notice, and (2)
|
|
||||||
tells the user that there is no warranty for the work (except to the
|
|
||||||
extent that warranties are provided), that licensees may convey the
|
|
||||||
work under this License, and how to view a copy of this License. If
|
|
||||||
the interface presents a list of user commands or options, such as a
|
|
||||||
menu, a prominent item in the list meets this criterion.
|
|
||||||
|
|
||||||
1. Source Code.
|
|
||||||
|
|
||||||
The "source code" for a work means the preferred form of the work
|
|
||||||
for making modifications to it. "Object code" means any non-source
|
|
||||||
form of a work.
|
|
||||||
|
|
||||||
A "Standard Interface" means an interface that either is an official
|
|
||||||
standard defined by a recognized standards body, or, in the case of
|
|
||||||
interfaces specified for a particular programming language, one that
|
|
||||||
is widely used among developers working in that language.
|
|
||||||
|
|
||||||
The "System Libraries" of an executable work include anything, other
|
|
||||||
than the work as a whole, that (a) is included in the normal form of
|
|
||||||
packaging a Major Component, but which is not part of that Major
|
|
||||||
Component, and (b) serves only to enable use of the work with that
|
|
||||||
Major Component, or to implement a Standard Interface for which an
|
|
||||||
implementation is available to the public in source code form. A
|
|
||||||
"Major Component", in this context, means a major essential component
|
|
||||||
(kernel, window system, and so on) of the specific operating system
|
|
||||||
(if any) on which the executable work runs, or a compiler used to
|
|
||||||
produce the work, or an object code interpreter used to run it.
|
|
||||||
|
|
||||||
The "Corresponding Source" for a work in object code form means all
|
|
||||||
the source code needed to generate, install, and (for an executable
|
|
||||||
work) run the object code and to modify the work, including scripts to
|
|
||||||
control those activities. However, it does not include the work's
|
|
||||||
System Libraries, or general-purpose tools or generally available free
|
|
||||||
programs which are used unmodified in performing those activities but
|
|
||||||
which are not part of the work. For example, Corresponding Source
|
|
||||||
includes interface definition files associated with source files for
|
|
||||||
the work, and the source code for shared libraries and dynamically
|
|
||||||
linked subprograms that the work is specifically designed to require,
|
|
||||||
such as by intimate data communication or control flow between those
|
|
||||||
subprograms and other parts of the work.
|
|
||||||
|
|
||||||
The Corresponding Source need not include anything that users
|
|
||||||
can regenerate automatically from other parts of the Corresponding
|
|
||||||
Source.
|
|
||||||
|
|
||||||
The Corresponding Source for a work in source code form is that
|
|
||||||
same work.
|
|
||||||
|
|
||||||
2. Basic Permissions.
|
|
||||||
|
|
||||||
All rights granted under this License are granted for the term of
|
|
||||||
copyright on the Program, and are irrevocable provided the stated
|
|
||||||
conditions are met. This License explicitly affirms your unlimited
|
|
||||||
permission to run the unmodified Program. The output from running a
|
|
||||||
covered work is covered by this License only if the output, given its
|
|
||||||
content, constitutes a covered work. This License acknowledges your
|
|
||||||
rights of fair use or other equivalent, as provided by copyright law.
|
|
||||||
|
|
||||||
You may make, run and propagate covered works that you do not
|
|
||||||
convey, without conditions so long as your license otherwise remains
|
|
||||||
in force. You may convey covered works to others for the sole purpose
|
|
||||||
of having them make modifications exclusively for you, or provide you
|
|
||||||
with facilities for running those works, provided that you comply with
|
|
||||||
the terms of this License in conveying all material for which you do
|
|
||||||
not control copyright. Those thus making or running the covered works
|
|
||||||
for you must do so exclusively on your behalf, under your direction
|
|
||||||
and control, on terms that prohibit them from making any copies of
|
|
||||||
your copyrighted material outside their relationship with you.
|
|
||||||
|
|
||||||
Conveying under any other circumstances is permitted solely under
|
|
||||||
the conditions stated below. Sublicensing is not allowed; section 10
|
|
||||||
makes it unnecessary.
|
|
||||||
|
|
||||||
3. Protecting Users' Legal Rights From Anti-Circumvention Law.
|
|
||||||
|
|
||||||
No covered work shall be deemed part of an effective technological
|
|
||||||
measure under any applicable law fulfilling obligations under article
|
|
||||||
11 of the WIPO copyright treaty adopted on 20 December 1996, or
|
|
||||||
similar laws prohibiting or restricting circumvention of such
|
|
||||||
measures.
|
|
||||||
|
|
||||||
When you convey a covered work, you waive any legal power to forbid
|
|
||||||
circumvention of technological measures to the extent such circumvention
|
|
||||||
is effected by exercising rights under this License with respect to
|
|
||||||
the covered work, and you disclaim any intention to limit operation or
|
|
||||||
modification of the work as a means of enforcing, against the work's
|
|
||||||
users, your or third parties' legal rights to forbid circumvention of
|
|
||||||
technological measures.
|
|
||||||
|
|
||||||
4. Conveying Verbatim Copies.
|
|
||||||
|
|
||||||
You may convey verbatim copies of the Program's source code as you
|
|
||||||
receive it, in any medium, provided that you conspicuously and
|
|
||||||
appropriately publish on each copy an appropriate copyright notice;
|
|
||||||
keep intact all notices stating that this License and any
|
|
||||||
non-permissive terms added in accord with section 7 apply to the code;
|
|
||||||
keep intact all notices of the absence of any warranty; and give all
|
|
||||||
recipients a copy of this License along with the Program.
|
|
||||||
|
|
||||||
You may charge any price or no price for each copy that you convey,
|
|
||||||
and you may offer support or warranty protection for a fee.
|
|
||||||
|
|
||||||
5. Conveying Modified Source Versions.
|
|
||||||
|
|
||||||
You may convey a work based on the Program, or the modifications to
|
|
||||||
produce it from the Program, in the form of source code under the
|
|
||||||
terms of section 4, provided that you also meet all of these conditions:
|
|
||||||
|
|
||||||
a) The work must carry prominent notices stating that you modified
|
|
||||||
it, and giving a relevant date.
|
|
||||||
|
|
||||||
b) The work must carry prominent notices stating that it is
|
|
||||||
released under this License and any conditions added under section
|
|
||||||
7. This requirement modifies the requirement in section 4 to
|
|
||||||
"keep intact all notices".
|
|
||||||
|
|
||||||
c) You must license the entire work, as a whole, under this
|
|
||||||
License to anyone who comes into possession of a copy. This
|
|
||||||
License will therefore apply, along with any applicable section 7
|
|
||||||
additional terms, to the whole of the work, and all its parts,
|
|
||||||
regardless of how they are packaged. This License gives no
|
|
||||||
permission to license the work in any other way, but it does not
|
|
||||||
invalidate such permission if you have separately received it.
|
|
||||||
|
|
||||||
d) If the work has interactive user interfaces, each must display
|
|
||||||
Appropriate Legal Notices; however, if the Program has interactive
|
|
||||||
interfaces that do not display Appropriate Legal Notices, your
|
|
||||||
work need not make them do so.
|
|
||||||
|
|
||||||
A compilation of a covered work with other separate and independent
|
|
||||||
works, which are not by their nature extensions of the covered work,
|
|
||||||
and which are not combined with it such as to form a larger program,
|
|
||||||
in or on a volume of a storage or distribution medium, is called an
|
|
||||||
"aggregate" if the compilation and its resulting copyright are not
|
|
||||||
used to limit the access or legal rights of the compilation's users
|
|
||||||
beyond what the individual works permit. Inclusion of a covered work
|
|
||||||
in an aggregate does not cause this License to apply to the other
|
|
||||||
parts of the aggregate.
|
|
||||||
|
|
||||||
6. Conveying Non-Source Forms.
|
|
||||||
|
|
||||||
You may convey a covered work in object code form under the terms
|
|
||||||
of sections 4 and 5, provided that you also convey the
|
|
||||||
machine-readable Corresponding Source under the terms of this License,
|
|
||||||
in one of these ways:
|
|
||||||
|
|
||||||
a) Convey the object code in, or embodied in, a physical product
|
|
||||||
(including a physical distribution medium), accompanied by the
|
|
||||||
Corresponding Source fixed on a durable physical medium
|
|
||||||
customarily used for software interchange.
|
|
||||||
|
|
||||||
b) Convey the object code in, or embodied in, a physical product
|
|
||||||
(including a physical distribution medium), accompanied by a
|
|
||||||
written offer, valid for at least three years and valid for as
|
|
||||||
long as you offer spare parts or customer support for that product
|
|
||||||
model, to give anyone who possesses the object code either (1) a
|
|
||||||
copy of the Corresponding Source for all the software in the
|
|
||||||
product that is covered by this License, on a durable physical
|
|
||||||
medium customarily used for software interchange, for a price no
|
|
||||||
more than your reasonable cost of physically performing this
|
|
||||||
conveying of source, or (2) access to copy the
|
|
||||||
Corresponding Source from a network server at no charge.
|
|
||||||
|
|
||||||
c) Convey individual copies of the object code with a copy of the
|
|
||||||
written offer to provide the Corresponding Source. This
|
|
||||||
alternative is allowed only occasionally and noncommercially, and
|
|
||||||
only if you received the object code with such an offer, in accord
|
|
||||||
with subsection 6b.
|
|
||||||
|
|
||||||
d) Convey the object code by offering access from a designated
|
|
||||||
place (gratis or for a charge), and offer equivalent access to the
|
|
||||||
Corresponding Source in the same way through the same place at no
|
|
||||||
further charge. You need not require recipients to copy the
|
|
||||||
Corresponding Source along with the object code. If the place to
|
|
||||||
copy the object code is a network server, the Corresponding Source
|
|
||||||
may be on a different server (operated by you or a third party)
|
|
||||||
that supports equivalent copying facilities, provided you maintain
|
|
||||||
clear directions next to the object code saying where to find the
|
|
||||||
Corresponding Source. Regardless of what server hosts the
|
|
||||||
Corresponding Source, you remain obligated to ensure that it is
|
|
||||||
available for as long as needed to satisfy these requirements.
|
|
||||||
|
|
||||||
e) Convey the object code using peer-to-peer transmission, provided
|
|
||||||
you inform other peers where the object code and Corresponding
|
|
||||||
Source of the work are being offered to the general public at no
|
|
||||||
charge under subsection 6d.
|
|
||||||
|
|
||||||
A separable portion of the object code, whose source code is excluded
|
|
||||||
from the Corresponding Source as a System Library, need not be
|
|
||||||
included in conveying the object code work.
|
|
||||||
|
|
||||||
A "User Product" is either (1) a "consumer product", which means any
|
|
||||||
tangible personal property which is normally used for personal, family,
|
|
||||||
or household purposes, or (2) anything designed or sold for incorporation
|
|
||||||
into a dwelling. In determining whether a product is a consumer product,
|
|
||||||
doubtful cases shall be resolved in favor of coverage. For a particular
|
|
||||||
product received by a particular user, "normally used" refers to a
|
|
||||||
typical or common use of that class of product, regardless of the status
|
|
||||||
of the particular user or of the way in which the particular user
|
|
||||||
actually uses, or expects or is expected to use, the product. A product
|
|
||||||
is a consumer product regardless of whether the product has substantial
|
|
||||||
commercial, industrial or non-consumer uses, unless such uses represent
|
|
||||||
the only significant mode of use of the product.
|
|
||||||
|
|
||||||
"Installation Information" for a User Product means any methods,
|
|
||||||
procedures, authorization keys, or other information required to install
|
|
||||||
and execute modified versions of a covered work in that User Product from
|
|
||||||
a modified version of its Corresponding Source. The information must
|
|
||||||
suffice to ensure that the continued functioning of the modified object
|
|
||||||
code is in no case prevented or interfered with solely because
|
|
||||||
modification has been made.
|
|
||||||
|
|
||||||
If you convey an object code work under this section in, or with, or
|
|
||||||
specifically for use in, a User Product, and the conveying occurs as
|
|
||||||
part of a transaction in which the right of possession and use of the
|
|
||||||
User Product is transferred to the recipient in perpetuity or for a
|
|
||||||
fixed term (regardless of how the transaction is characterized), the
|
|
||||||
Corresponding Source conveyed under this section must be accompanied
|
|
||||||
by the Installation Information. But this requirement does not apply
|
|
||||||
if neither you nor any third party retains the ability to install
|
|
||||||
modified object code on the User Product (for example, the work has
|
|
||||||
been installed in ROM).
|
|
||||||
|
|
||||||
The requirement to provide Installation Information does not include a
|
|
||||||
requirement to continue to provide support service, warranty, or updates
|
|
||||||
for a work that has been modified or installed by the recipient, or for
|
|
||||||
the User Product in which it has been modified or installed. Access to a
|
|
||||||
network may be denied when the modification itself materially and
|
|
||||||
adversely affects the operation of the network or violates the rules and
|
|
||||||
protocols for communication across the network.
|
|
||||||
|
|
||||||
Corresponding Source conveyed, and Installation Information provided,
|
|
||||||
in accord with this section must be in a format that is publicly
|
|
||||||
documented (and with an implementation available to the public in
|
|
||||||
source code form), and must require no special password or key for
|
|
||||||
unpacking, reading or copying.
|
|
||||||
|
|
||||||
7. Additional Terms.
|
|
||||||
|
|
||||||
"Additional permissions" are terms that supplement the terms of this
|
|
||||||
License by making exceptions from one or more of its conditions.
|
|
||||||
Additional permissions that are applicable to the entire Program shall
|
|
||||||
be treated as though they were included in this License, to the extent
|
|
||||||
that they are valid under applicable law. If additional permissions
|
|
||||||
apply only to part of the Program, that part may be used separately
|
|
||||||
under those permissions, but the entire Program remains governed by
|
|
||||||
this License without regard to the additional permissions.
|
|
||||||
|
|
||||||
When you convey a copy of a covered work, you may at your option
|
|
||||||
remove any additional permissions from that copy, or from any part of
|
|
||||||
it. (Additional permissions may be written to require their own
|
|
||||||
removal in certain cases when you modify the work.) You may place
|
|
||||||
additional permissions on material, added by you to a covered work,
|
|
||||||
for which you have or can give appropriate copyright permission.
|
|
||||||
|
|
||||||
Notwithstanding any other provision of this License, for material you
|
|
||||||
add to a covered work, you may (if authorized by the copyright holders of
|
|
||||||
that material) supplement the terms of this License with terms:
|
|
||||||
|
|
||||||
a) Disclaiming warranty or limiting liability differently from the
|
|
||||||
terms of sections 15 and 16 of this License; or
|
|
||||||
|
|
||||||
b) Requiring preservation of specified reasonable legal notices or
|
|
||||||
author attributions in that material or in the Appropriate Legal
|
|
||||||
Notices displayed by works containing it; or
|
|
||||||
|
|
||||||
c) Prohibiting misrepresentation of the origin of that material, or
|
|
||||||
requiring that modified versions of such material be marked in
|
|
||||||
reasonable ways as different from the original version; or
|
|
||||||
|
|
||||||
d) Limiting the use for publicity purposes of names of licensors or
|
|
||||||
authors of the material; or
|
|
||||||
|
|
||||||
e) Declining to grant rights under trademark law for use of some
|
|
||||||
trade names, trademarks, or service marks; or
|
|
||||||
|
|
||||||
f) Requiring indemnification of licensors and authors of that
|
|
||||||
material by anyone who conveys the material (or modified versions of
|
|
||||||
it) with contractual assumptions of liability to the recipient, for
|
|
||||||
any liability that these contractual assumptions directly impose on
|
|
||||||
those licensors and authors.
|
|
||||||
|
|
||||||
All other non-permissive additional terms are considered "further
|
|
||||||
restrictions" within the meaning of section 10. If the Program as you
|
|
||||||
received it, or any part of it, contains a notice stating that it is
|
|
||||||
governed by this License along with a term that is a further
|
|
||||||
restriction, you may remove that term. If a license document contains
|
|
||||||
a further restriction but permits relicensing or conveying under this
|
|
||||||
License, you may add to a covered work material governed by the terms
|
|
||||||
of that license document, provided that the further restriction does
|
|
||||||
not survive such relicensing or conveying.
|
|
||||||
|
|
||||||
If you add terms to a covered work in accord with this section, you
|
|
||||||
must place, in the relevant source files, a statement of the
|
|
||||||
additional terms that apply to those files, or a notice indicating
|
|
||||||
where to find the applicable terms.
|
|
||||||
|
|
||||||
Additional terms, permissive or non-permissive, may be stated in the
|
|
||||||
form of a separately written license, or stated as exceptions;
|
|
||||||
the above requirements apply either way.
|
|
||||||
|
|
||||||
8. Termination.
|
|
||||||
|
|
||||||
You may not propagate or modify a covered work except as expressly
|
|
||||||
provided under this License. Any attempt otherwise to propagate or
|
|
||||||
modify it is void, and will automatically terminate your rights under
|
|
||||||
this License (including any patent licenses granted under the third
|
|
||||||
paragraph of section 11).
|
|
||||||
|
|
||||||
However, if you cease all violation of this License, then your
|
|
||||||
license from a particular copyright holder is reinstated (a)
|
|
||||||
provisionally, unless and until the copyright holder explicitly and
|
|
||||||
finally terminates your license, and (b) permanently, if the copyright
|
|
||||||
holder fails to notify you of the violation by some reasonable means
|
|
||||||
prior to 60 days after the cessation.
|
|
||||||
|
|
||||||
Moreover, your license from a particular copyright holder is
|
|
||||||
reinstated permanently if the copyright holder notifies you of the
|
|
||||||
violation by some reasonable means, this is the first time you have
|
|
||||||
received notice of violation of this License (for any work) from that
|
|
||||||
copyright holder, and you cure the violation prior to 30 days after
|
|
||||||
your receipt of the notice.
|
|
||||||
|
|
||||||
Termination of your rights under this section does not terminate the
|
|
||||||
licenses of parties who have received copies or rights from you under
|
|
||||||
this License. If your rights have been terminated and not permanently
|
|
||||||
reinstated, you do not qualify to receive new licenses for the same
|
|
||||||
material under section 10.
|
|
||||||
|
|
||||||
9. Acceptance Not Required for Having Copies.
|
|
||||||
|
|
||||||
You are not required to accept this License in order to receive or
|
|
||||||
run a copy of the Program. Ancillary propagation of a covered work
|
|
||||||
occurring solely as a consequence of using peer-to-peer transmission
|
|
||||||
to receive a copy likewise does not require acceptance. However,
|
|
||||||
nothing other than this License grants you permission to propagate or
|
|
||||||
modify any covered work. These actions infringe copyright if you do
|
|
||||||
not accept this License. Therefore, by modifying or propagating a
|
|
||||||
covered work, you indicate your acceptance of this License to do so.
|
|
||||||
|
|
||||||
10. Automatic Licensing of Downstream Recipients.
|
|
||||||
|
|
||||||
Each time you convey a covered work, the recipient automatically
|
|
||||||
receives a license from the original licensors, to run, modify and
|
|
||||||
propagate that work, subject to this License. You are not responsible
|
|
||||||
for enforcing compliance by third parties with this License.
|
|
||||||
|
|
||||||
An "entity transaction" is a transaction transferring control of an
|
|
||||||
organization, or substantially all assets of one, or subdividing an
|
|
||||||
organization, or merging organizations. If propagation of a covered
|
|
||||||
work results from an entity transaction, each party to that
|
|
||||||
transaction who receives a copy of the work also receives whatever
|
|
||||||
licenses to the work the party's predecessor in interest had or could
|
|
||||||
give under the previous paragraph, plus a right to possession of the
|
|
||||||
Corresponding Source of the work from the predecessor in interest, if
|
|
||||||
the predecessor has it or can get it with reasonable efforts.
|
|
||||||
|
|
||||||
You may not impose any further restrictions on the exercise of the
|
|
||||||
rights granted or affirmed under this License. For example, you may
|
|
||||||
not impose a license fee, royalty, or other charge for exercise of
|
|
||||||
rights granted under this License, and you may not initiate litigation
|
|
||||||
(including a cross-claim or counterclaim in a lawsuit) alleging that
|
|
||||||
any patent claim is infringed by making, using, selling, offering for
|
|
||||||
sale, or importing the Program or any portion of it.
|
|
||||||
|
|
||||||
11. Patents.
|
|
||||||
|
|
||||||
A "contributor" is a copyright holder who authorizes use under this
|
|
||||||
License of the Program or a work on which the Program is based. The
|
|
||||||
work thus licensed is called the contributor's "contributor version".
|
|
||||||
|
|
||||||
A contributor's "essential patent claims" are all patent claims
|
|
||||||
owned or controlled by the contributor, whether already acquired or
|
|
||||||
hereafter acquired, that would be infringed by some manner, permitted
|
|
||||||
by this License, of making, using, or selling its contributor version,
|
|
||||||
but do not include claims that would be infringed only as a
|
|
||||||
consequence of further modification of the contributor version. For
|
|
||||||
purposes of this definition, "control" includes the right to grant
|
|
||||||
patent sublicenses in a manner consistent with the requirements of
|
|
||||||
this License.
|
|
||||||
|
|
||||||
Each contributor grants you a non-exclusive, worldwide, royalty-free
|
|
||||||
patent license under the contributor's essential patent claims, to
|
|
||||||
make, use, sell, offer for sale, import and otherwise run, modify and
|
|
||||||
propagate the contents of its contributor version.
|
|
||||||
|
|
||||||
In the following three paragraphs, a "patent license" is any express
|
|
||||||
agreement or commitment, however denominated, not to enforce a patent
|
|
||||||
(such as an express permission to practice a patent or covenant not to
|
|
||||||
sue for patent infringement). To "grant" such a patent license to a
|
|
||||||
party means to make such an agreement or commitment not to enforce a
|
|
||||||
patent against the party.
|
|
||||||
|
|
||||||
If you convey a covered work, knowingly relying on a patent license,
|
|
||||||
and the Corresponding Source of the work is not available for anyone
|
|
||||||
to copy, free of charge and under the terms of this License, through a
|
|
||||||
publicly available network server or other readily accessible means,
|
|
||||||
then you must either (1) cause the Corresponding Source to be so
|
|
||||||
available, or (2) arrange to deprive yourself of the benefit of the
|
|
||||||
patent license for this particular work, or (3) arrange, in a manner
|
|
||||||
consistent with the requirements of this License, to extend the patent
|
|
||||||
license to downstream recipients. "Knowingly relying" means you have
|
|
||||||
actual knowledge that, but for the patent license, your conveying the
|
|
||||||
covered work in a country, or your recipient's use of the covered work
|
|
||||||
in a country, would infringe one or more identifiable patents in that
|
|
||||||
country that you have reason to believe are valid.
|
|
||||||
|
|
||||||
If, pursuant to or in connection with a single transaction or
|
|
||||||
arrangement, you convey, or propagate by procuring conveyance of, a
|
|
||||||
covered work, and grant a patent license to some of the parties
|
|
||||||
receiving the covered work authorizing them to use, propagate, modify
|
|
||||||
or convey a specific copy of the covered work, then the patent license
|
|
||||||
you grant is automatically extended to all recipients of the covered
|
|
||||||
work and works based on it.
|
|
||||||
|
|
||||||
A patent license is "discriminatory" if it does not include within
|
|
||||||
the scope of its coverage, prohibits the exercise of, or is
|
|
||||||
conditioned on the non-exercise of one or more of the rights that are
|
|
||||||
specifically granted under this License. You may not convey a covered
|
|
||||||
work if you are a party to an arrangement with a third party that is
|
|
||||||
in the business of distributing software, under which you make payment
|
|
||||||
to the third party based on the extent of your activity of conveying
|
|
||||||
the work, and under which the third party grants, to any of the
|
|
||||||
parties who would receive the covered work from you, a discriminatory
|
|
||||||
patent license (a) in connection with copies of the covered work
|
|
||||||
conveyed by you (or copies made from those copies), or (b) primarily
|
|
||||||
for and in connection with specific products or compilations that
|
|
||||||
contain the covered work, unless you entered into that arrangement,
|
|
||||||
or that patent license was granted, prior to 28 March 2007.
|
|
||||||
|
|
||||||
Nothing in this License shall be construed as excluding or limiting
|
|
||||||
any implied license or other defenses to infringement that may
|
|
||||||
otherwise be available to you under applicable patent law.
|
|
||||||
|
|
||||||
12. No Surrender of Others' Freedom.
|
|
||||||
|
|
||||||
If conditions are imposed on you (whether by court order, agreement or
|
|
||||||
otherwise) that contradict the conditions of this License, they do not
|
|
||||||
excuse you from the conditions of this License. If you cannot convey a
|
|
||||||
covered work so as to satisfy simultaneously your obligations under this
|
|
||||||
License and any other pertinent obligations, then as a consequence you may
|
|
||||||
not convey it at all. For example, if you agree to terms that obligate you
|
|
||||||
to collect a royalty for further conveying from those to whom you convey
|
|
||||||
the Program, the only way you could satisfy both those terms and this
|
|
||||||
License would be to refrain entirely from conveying the Program.
|
|
||||||
|
|
||||||
13. Use with the GNU Affero General Public License.
|
|
||||||
|
|
||||||
Notwithstanding any other provision of this License, you have
|
|
||||||
permission to link or combine any covered work with a work licensed
|
|
||||||
under version 3 of the GNU Affero General Public License into a single
|
|
||||||
combined work, and to convey the resulting work. The terms of this
|
|
||||||
License will continue to apply to the part which is the covered work,
|
|
||||||
but the special requirements of the GNU Affero General Public License,
|
|
||||||
section 13, concerning interaction through a network will apply to the
|
|
||||||
combination as such.
|
|
||||||
|
|
||||||
14. Revised Versions of this License.
|
|
||||||
|
|
||||||
The Free Software Foundation may publish revised and/or new versions of
|
|
||||||
the GNU General Public License from time to time. Such new versions will
|
|
||||||
be similar in spirit to the present version, but may differ in detail to
|
|
||||||
address new problems or concerns.
|
|
||||||
|
|
||||||
Each version is given a distinguishing version number. If the
|
|
||||||
Program specifies that a certain numbered version of the GNU General
|
|
||||||
Public License "or any later version" applies to it, you have the
|
|
||||||
option of following the terms and conditions either of that numbered
|
|
||||||
version or of any later version published by the Free Software
|
|
||||||
Foundation. If the Program does not specify a version number of the
|
|
||||||
GNU General Public License, you may choose any version ever published
|
|
||||||
by the Free Software Foundation.
|
|
||||||
|
|
||||||
If the Program specifies that a proxy can decide which future
|
|
||||||
versions of the GNU General Public License can be used, that proxy's
|
|
||||||
public statement of acceptance of a version permanently authorizes you
|
|
||||||
to choose that version for the Program.
|
|
||||||
|
|
||||||
Later license versions may give you additional or different
|
|
||||||
permissions. However, no additional obligations are imposed on any
|
|
||||||
author or copyright holder as a result of your choosing to follow a
|
|
||||||
later version.
|
|
||||||
|
|
||||||
15. Disclaimer of Warranty.
|
|
||||||
|
|
||||||
THERE IS NO WARRANTY FOR THE PROGRAM, TO THE EXTENT PERMITTED BY
|
|
||||||
APPLICABLE LAW. EXCEPT WHEN OTHERWISE STATED IN WRITING THE COPYRIGHT
|
|
||||||
HOLDERS AND/OR OTHER PARTIES PROVIDE THE PROGRAM "AS IS" WITHOUT WARRANTY
|
|
||||||
OF ANY KIND, EITHER EXPRESSED OR IMPLIED, INCLUDING, BUT NOT LIMITED TO,
|
|
||||||
THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
|
|
||||||
PURPOSE. THE ENTIRE RISK AS TO THE QUALITY AND PERFORMANCE OF THE PROGRAM
|
|
||||||
IS WITH YOU. SHOULD THE PROGRAM PROVE DEFECTIVE, YOU ASSUME THE COST OF
|
|
||||||
ALL NECESSARY SERVICING, REPAIR OR CORRECTION.
|
|
||||||
|
|
||||||
16. Limitation of Liability.
|
|
||||||
|
|
||||||
IN NO EVENT UNLESS REQUIRED BY APPLICABLE LAW OR AGREED TO IN WRITING
|
|
||||||
WILL ANY COPYRIGHT HOLDER, OR ANY OTHER PARTY WHO MODIFIES AND/OR CONVEYS
|
|
||||||
THE PROGRAM AS PERMITTED ABOVE, BE LIABLE TO YOU FOR DAMAGES, INCLUDING ANY
|
|
||||||
GENERAL, SPECIAL, INCIDENTAL OR CONSEQUENTIAL DAMAGES ARISING OUT OF THE
|
|
||||||
USE OR INABILITY TO USE THE PROGRAM (INCLUDING BUT NOT LIMITED TO LOSS OF
|
|
||||||
DATA OR DATA BEING RENDERED INACCURATE OR LOSSES SUSTAINED BY YOU OR THIRD
|
|
||||||
PARTIES OR A FAILURE OF THE PROGRAM TO OPERATE WITH ANY OTHER PROGRAMS),
|
|
||||||
EVEN IF SUCH HOLDER OR OTHER PARTY HAS BEEN ADVISED OF THE POSSIBILITY OF
|
|
||||||
SUCH DAMAGES.
|
|
||||||
|
|
||||||
17. Interpretation of Sections 15 and 16.
|
|
||||||
|
|
||||||
If the disclaimer of warranty and limitation of liability provided
|
|
||||||
above cannot be given local legal effect according to their terms,
|
|
||||||
reviewing courts shall apply local law that most closely approximates
|
|
||||||
an absolute waiver of all civil liability in connection with the
|
|
||||||
Program, unless a warranty or assumption of liability accompanies a
|
|
||||||
copy of the Program in return for a fee.
|
|
||||||
|
|
||||||
END OF TERMS AND CONDITIONS
|
|
||||||
|
|
||||||
How to Apply These Terms to Your New Programs
|
|
||||||
|
|
||||||
If you develop a new program, and you want it to be of the greatest
|
|
||||||
possible use to the public, the best way to achieve this is to make it
|
|
||||||
free software which everyone can redistribute and change under these terms.
|
|
||||||
|
|
||||||
To do so, attach the following notices to the program. It is safest
|
|
||||||
to attach them to the start of each source file to most effectively
|
|
||||||
state the exclusion of warranty; and each file should have at least
|
|
||||||
the "copyright" line and a pointer to where the full notice is found.
|
|
||||||
|
|
||||||
<one line to give the program's name and a brief idea of what it does.>
|
|
||||||
Copyright (C) <year> <name of author>
|
|
||||||
|
|
||||||
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 3 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 <http://www.gnu.org/licenses/>.
|
|
||||||
|
|
||||||
Also add information on how to contact you by electronic and paper mail.
|
|
||||||
|
|
||||||
If the program does terminal interaction, make it output a short
|
|
||||||
notice like this when it starts in an interactive mode:
|
|
||||||
|
|
||||||
<program> Copyright (C) <year> <name of author>
|
|
||||||
This program comes with ABSOLUTELY NO WARRANTY; for details type `show w'.
|
|
||||||
This is free software, and you are welcome to redistribute it
|
|
||||||
under certain conditions; type `show c' for details.
|
|
||||||
|
|
||||||
The hypothetical commands `show w' and `show c' should show the appropriate
|
|
||||||
parts of the General Public License. Of course, your program's commands
|
|
||||||
might be different; for a GUI interface, you would use an "about box".
|
|
||||||
|
|
||||||
You should also get your employer (if you work as a programmer) or school,
|
|
||||||
if any, to sign a "copyright disclaimer" for the program, if necessary.
|
|
||||||
For more information on this, and how to apply and follow the GNU GPL, see
|
|
||||||
<http://www.gnu.org/licenses/>.
|
|
||||||
|
|
||||||
The GNU General Public License does not permit incorporating your program
|
|
||||||
into proprietary programs. If your program is a subroutine library, you
|
|
||||||
may consider it more useful to permit linking proprietary applications with
|
|
||||||
the library. If this is what you want to do, use the GNU Lesser General
|
|
||||||
Public License instead of this License. But first, please read
|
|
||||||
<http://www.gnu.org/philosophy/why-not-lgpl.html>.
|
|
||||||
9
Gemfile
Normal file
9
Gemfile
Normal file
@ -0,0 +1,9 @@
|
|||||||
|
# This Source Code Form is subject to the terms of the Mozilla Public License,
|
||||||
|
# v. 2.0. If a copy of the MPL was not distributed with this file, You can
|
||||||
|
# obtain one at https://mozilla.org/MPL/2.0/.
|
||||||
|
# frozen_string_literal: true
|
||||||
|
|
||||||
|
source 'https://rubygems.org'
|
||||||
|
|
||||||
|
gem 'term-ansicolor', '~> 1.2'
|
||||||
|
gem 'rake', '~> 13.2'
|
||||||
22
Gemfile.lock
Normal file
22
Gemfile.lock
Normal file
@ -0,0 +1,22 @@
|
|||||||
|
GEM
|
||||||
|
remote: https://rubygems.org/
|
||||||
|
specs:
|
||||||
|
bigdecimal (3.1.9)
|
||||||
|
rake (13.2.1)
|
||||||
|
sync (0.5.0)
|
||||||
|
term-ansicolor (1.11.2)
|
||||||
|
tins (~> 1.0)
|
||||||
|
tins (1.38.0)
|
||||||
|
bigdecimal
|
||||||
|
sync
|
||||||
|
|
||||||
|
PLATFORMS
|
||||||
|
ruby
|
||||||
|
x86_64-linux
|
||||||
|
|
||||||
|
DEPENDENCIES
|
||||||
|
rake (~> 13.2)
|
||||||
|
term-ansicolor (~> 1.2)
|
||||||
|
|
||||||
|
BUNDLED WITH
|
||||||
|
2.6.7
|
||||||
34
README.md
34
README.md
@ -9,37 +9,3 @@ representation for a such high-level hypothetical programming language.
|
|||||||
## File extension
|
## File extension
|
||||||
|
|
||||||
.elna
|
.elna
|
||||||
|
|
||||||
## Current implementation
|
|
||||||
|
|
||||||
This repository contains a GCC frontend for Elna. After finishing the frontend
|
|
||||||
I'm planning to rewrite the compiler in Elna itself with its own backend and
|
|
||||||
a hand-written parser. So GCC gives a way to have a simple bootstrap compiler
|
|
||||||
and a possbility to compile Elna programs for different platforms.
|
|
||||||
|
|
||||||
## Grammar
|
|
||||||
|
|
||||||
Flex and bison grammar specifications, `lexer.ll` and `parser.yy`, can be found
|
|
||||||
in the `boot/` directory.
|
|
||||||
|
|
||||||
## Build
|
|
||||||
|
|
||||||
The frontend requires GCC 14.2.0 (not tested with other versions).
|
|
||||||
|
|
||||||
Download the GCC source. Copy the contents of this repository into `gcc/elna`
|
|
||||||
inside GCC. Finally build GCC enabling the frontend with
|
|
||||||
`--enable-languages=c,c++,elna`. After the installation the compiler can be
|
|
||||||
invoked with `$prefix/bin/gelna`.
|
|
||||||
|
|
||||||
There is also a `Rakefile` that downloads, builds and installs GCC into the
|
|
||||||
`./build/` subdirectory. The `Rakefile` assumes that ruby and rake, as well as
|
|
||||||
all GCC dependencies are already available in the system. It works under Linux
|
|
||||||
and Mac OS. In the latter case GCC is patched with the patches used by Homebrew
|
|
||||||
(official GCC doesn't support Apple silicon targets). Invoke with
|
|
||||||
|
|
||||||
```sh
|
|
||||||
rake boot
|
|
||||||
```
|
|
||||||
|
|
||||||
See `rake -T` for more tasks. The GCC source is under `build/tools`. The
|
|
||||||
installation path is `build/host/install`.
|
|
||||||
|
|||||||
84
Rakefile
84
Rakefile
@ -1,78 +1,38 @@
|
|||||||
# This Source Code Form is subject to the terms of the Mozilla Public License,
|
# This Source Code Form is subject to the terms of the Mozilla Public License,
|
||||||
# v. 2.0. If a copy of the MPL was not distributed with this file, You can
|
# v. 2.0. If a copy of the MPL was not distributed with this file, You can
|
||||||
# obtain one at https://mozilla.org/MPL/2.0/. -}
|
# obtain one at https://mozilla.org/MPL/2.0/.
|
||||||
|
# frozen_string_literal: true
|
||||||
|
|
||||||
require 'pathname'
|
|
||||||
require 'open3'
|
require 'open3'
|
||||||
require 'rake/clean'
|
require 'rake/clean'
|
||||||
require_relative 'tools/support'
|
require 'term/ansicolor'
|
||||||
|
|
||||||
# Dependencies.
|
CLEAN.include 'build/boot'
|
||||||
GCC_VERSION = "14.2.0"
|
|
||||||
GCC_PATCH = 'https://raw.githubusercontent.com/Homebrew/formula-patches/f30c309442a60cfb926e780eae5d70571f8ab2cb/gcc/gcc-14.2.0-r2.diff'
|
|
||||||
|
|
||||||
# Paths.
|
directory 'build/boot'
|
||||||
HOST_GCC = TMP + 'host/gcc'
|
|
||||||
HOST_INSTALL = TMP + 'host/install'
|
|
||||||
|
|
||||||
CLOBBER.include TMP
|
desc 'Final stage'
|
||||||
|
task default: ['build/boot/stage2b', 'build/boot/stage2b.s', 'boot/stage2.elna'] do |t|
|
||||||
|
exe, previous_output, source = t.prerequisites
|
||||||
|
|
||||||
directory(TMP + 'tools')
|
cat_arguments = ['cat', source]
|
||||||
directory HOST_GCC
|
compiler_arguments = [QEMU, '-L', SYSROOT, exe]
|
||||||
directory HOST_INSTALL
|
diff_arguments = ['diff', '-Nur', '--text', previous_output, '-']
|
||||||
|
Open3.pipeline(cat_arguments, compiler_arguments, diff_arguments)
|
||||||
task default: [TMP + 'elna'] do
|
|
||||||
sh (TMP + 'elna').to_path, '--tokenize', 'source.elna'
|
|
||||||
end
|
end
|
||||||
|
|
||||||
namespace :boot do
|
file 'build/boot/test.s' => ['build/boot/stage1', 'boot/test.elna'] do |t|
|
||||||
desc 'Download and configure the bootstrap compiler'
|
source, exe = t.prerequisites.partition { |prerequisite| prerequisite.end_with? '.elna' }
|
||||||
task configure: [TMP + 'tools', HOST_GCC, HOST_INSTALL] do
|
|
||||||
url = URI.parse "https://gcc.gnu.org/pub/gcc/releases/gcc-#{GCC_VERSION}/gcc-#{GCC_VERSION}.tar.xz"
|
|
||||||
options = find_build_target GCC_VERSION
|
|
||||||
source_directory = TMP + "tools/gcc-#{GCC_VERSION}"
|
|
||||||
frontend_link = source_directory + 'gcc'
|
|
||||||
|
|
||||||
download_and_pipe url, source_directory.dirname, ['tar', '-Jxv']
|
File.open t.name, 'w' do |output|
|
||||||
download_and_pipe URI.parse(GCC_PATCH), source_directory, ['patch', '-p1']
|
assemble_stage output, exe, source
|
||||||
|
|
||||||
sh 'contrib/download_prerequisites', chdir: source_directory.to_path
|
|
||||||
File.symlink Pathname.new('.').relative_path_from(frontend_link), (frontend_link + 'elna')
|
|
||||||
|
|
||||||
configure_options = [
|
|
||||||
"--prefix=#{HOST_INSTALL.realpath}",
|
|
||||||
"--with-sysroot=#{options.sysroot.realpath}",
|
|
||||||
'--enable-languages=c,c++,elna',
|
|
||||||
'--disable-bootstrap',
|
|
||||||
'--disable-multilib',
|
|
||||||
"--target=#{options.build}",
|
|
||||||
"--build=#{options.build}",
|
|
||||||
"--host=#{options.build}"
|
|
||||||
]
|
|
||||||
flags = '-O0 -g -fPIC -I/opt/homebrew/Cellar/flex/2.6.4_2/include'
|
|
||||||
env = {
|
|
||||||
'CC' => options.gcc,
|
|
||||||
'CXX' => options.gxx,
|
|
||||||
'CFLAGS' => flags,
|
|
||||||
'CXXFLAGS' => flags,
|
|
||||||
}
|
|
||||||
configure = source_directory.relative_path_from(HOST_GCC) + 'configure'
|
|
||||||
sh env, configure.to_path, *configure_options, chdir: HOST_GCC.to_path
|
|
||||||
end
|
|
||||||
|
|
||||||
desc 'Make and install the bootstrap compiler'
|
|
||||||
task :make do
|
|
||||||
cwd = HOST_GCC.to_path
|
|
||||||
|
|
||||||
sh 'make', '-j', Etc.nprocessors.to_s, chdir: cwd
|
|
||||||
sh 'make', 'install', chdir: cwd
|
|
||||||
end
|
end
|
||||||
end
|
end
|
||||||
|
|
||||||
desc 'Build the bootstrap compiler'
|
file 'build/boot/test' => ['build/boot/test.s', 'boot/common-boot.s'] do |t|
|
||||||
task boot: %w[boot:configure boot:make]
|
sh CROSS_GCC, '-nostdlib', '-o', t.name, *t.prerequisites
|
||||||
|
end
|
||||||
file (TMP + 'elna').to_path => ['source.elna']
|
|
||||||
file (TMP + 'elna').to_path => [(HOST_INSTALL + 'bin/gelna').to_path] do |task|
|
task test: 'build/boot/test' do |t|
|
||||||
sh (HOST_INSTALL + 'bin/gelna').to_path, '-o', task.name, task.prerequisites.first
|
sh QEMU, '-L', SYSROOT, t.prerequisites.first
|
||||||
end
|
end
|
||||||
|
|||||||
922
boot/ast.cc
922
boot/ast.cc
@ -1,922 +0,0 @@
|
|||||||
/* Abstract syntax tree representation.
|
|
||||||
Copyright (C) 2025 Free Software Foundation, Inc.
|
|
||||||
|
|
||||||
GCC 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.
|
|
||||||
|
|
||||||
GCC 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 GCC; see the file COPYING3. If not see
|
|
||||||
<http://www.gnu.org/licenses/>. */
|
|
||||||
|
|
||||||
#include "elna/boot/ast.h"
|
|
||||||
|
|
||||||
namespace elna::boot
|
|
||||||
{
|
|
||||||
node::node(const struct position position)
|
|
||||||
: source_position(position)
|
|
||||||
{
|
|
||||||
}
|
|
||||||
|
|
||||||
node::~node()
|
|
||||||
{
|
|
||||||
}
|
|
||||||
|
|
||||||
const struct position& node::position() const
|
|
||||||
{
|
|
||||||
return this->source_position;
|
|
||||||
}
|
|
||||||
|
|
||||||
cast_expression *expression::is_cast()
|
|
||||||
{
|
|
||||||
return nullptr;
|
|
||||||
}
|
|
||||||
|
|
||||||
traits_expression *expression::is_traits()
|
|
||||||
{
|
|
||||||
return nullptr;
|
|
||||||
}
|
|
||||||
|
|
||||||
binary_expression *expression::is_binary()
|
|
||||||
{
|
|
||||||
return nullptr;
|
|
||||||
}
|
|
||||||
|
|
||||||
unary_expression *expression::is_unary()
|
|
||||||
{
|
|
||||||
return nullptr;
|
|
||||||
}
|
|
||||||
|
|
||||||
designator_expression *expression::is_designator()
|
|
||||||
{
|
|
||||||
return nullptr;
|
|
||||||
}
|
|
||||||
|
|
||||||
procedure_call *expression::is_call_expression()
|
|
||||||
{
|
|
||||||
return nullptr;
|
|
||||||
}
|
|
||||||
|
|
||||||
literal_expression *expression::is_literal()
|
|
||||||
{
|
|
||||||
return nullptr;
|
|
||||||
}
|
|
||||||
|
|
||||||
type_expression::type_expression(const struct position position)
|
|
||||||
: node(position)
|
|
||||||
{
|
|
||||||
}
|
|
||||||
|
|
||||||
named_type_expression *type_expression::is_named()
|
|
||||||
{
|
|
||||||
return nullptr;
|
|
||||||
}
|
|
||||||
|
|
||||||
array_type_expression *type_expression::is_array()
|
|
||||||
{
|
|
||||||
return nullptr;
|
|
||||||
}
|
|
||||||
|
|
||||||
pointer_type_expression *type_expression::is_pointer()
|
|
||||||
{
|
|
||||||
return nullptr;
|
|
||||||
}
|
|
||||||
|
|
||||||
record_type_expression *type_expression::is_record()
|
|
||||||
{
|
|
||||||
return nullptr;
|
|
||||||
}
|
|
||||||
|
|
||||||
union_type_expression *type_expression::is_union()
|
|
||||||
{
|
|
||||||
return nullptr;
|
|
||||||
}
|
|
||||||
|
|
||||||
procedure_type_expression *type_expression::is_procedure()
|
|
||||||
{
|
|
||||||
return nullptr;
|
|
||||||
}
|
|
||||||
|
|
||||||
enumeration_type_expression *type_expression::is_enumeration()
|
|
||||||
{
|
|
||||||
return nullptr;
|
|
||||||
}
|
|
||||||
|
|
||||||
named_type_expression::named_type_expression(const struct position position, const std::string& name)
|
|
||||||
: type_expression(position), name(name)
|
|
||||||
{
|
|
||||||
}
|
|
||||||
|
|
||||||
void named_type_expression::accept(parser_visitor *visitor)
|
|
||||||
{
|
|
||||||
visitor->visit(this);
|
|
||||||
}
|
|
||||||
|
|
||||||
named_type_expression *named_type_expression::is_named()
|
|
||||||
{
|
|
||||||
return this;
|
|
||||||
}
|
|
||||||
|
|
||||||
array_type_expression::array_type_expression(const struct position position,
|
|
||||||
type_expression *base, const std::uint32_t size)
|
|
||||||
: type_expression(position), m_base(base), size(size)
|
|
||||||
{
|
|
||||||
}
|
|
||||||
|
|
||||||
array_type_expression::~array_type_expression()
|
|
||||||
{
|
|
||||||
delete m_base;
|
|
||||||
}
|
|
||||||
|
|
||||||
void array_type_expression::accept(parser_visitor *visitor)
|
|
||||||
{
|
|
||||||
visitor->visit(this);
|
|
||||||
}
|
|
||||||
|
|
||||||
array_type_expression *array_type_expression::is_array()
|
|
||||||
{
|
|
||||||
return this;
|
|
||||||
}
|
|
||||||
|
|
||||||
type_expression& array_type_expression::base()
|
|
||||||
{
|
|
||||||
return *m_base;
|
|
||||||
}
|
|
||||||
|
|
||||||
pointer_type_expression::pointer_type_expression(const struct position position,
|
|
||||||
type_expression *base)
|
|
||||||
: type_expression(position), m_base(base)
|
|
||||||
{
|
|
||||||
}
|
|
||||||
|
|
||||||
pointer_type_expression::~pointer_type_expression()
|
|
||||||
{
|
|
||||||
delete m_base;
|
|
||||||
}
|
|
||||||
|
|
||||||
void pointer_type_expression::accept(parser_visitor *visitor)
|
|
||||||
{
|
|
||||||
visitor->visit(this);
|
|
||||||
}
|
|
||||||
|
|
||||||
pointer_type_expression *pointer_type_expression::is_pointer()
|
|
||||||
{
|
|
||||||
return this;
|
|
||||||
}
|
|
||||||
|
|
||||||
type_expression& pointer_type_expression::base()
|
|
||||||
{
|
|
||||||
return *m_base;
|
|
||||||
}
|
|
||||||
|
|
||||||
record_type_expression::record_type_expression(const struct position position,
|
|
||||||
std::vector<field_declaration>&& fields)
|
|
||||||
: type_expression(position), fields(std::move(fields))
|
|
||||||
{
|
|
||||||
}
|
|
||||||
|
|
||||||
record_type_expression::~record_type_expression()
|
|
||||||
{
|
|
||||||
for (const field_declaration& field : this->fields)
|
|
||||||
{
|
|
||||||
delete field.second;
|
|
||||||
}
|
|
||||||
}
|
|
||||||
|
|
||||||
void record_type_expression::accept(parser_visitor *visitor)
|
|
||||||
{
|
|
||||||
visitor->visit(this);
|
|
||||||
}
|
|
||||||
|
|
||||||
record_type_expression *record_type_expression::is_record()
|
|
||||||
{
|
|
||||||
return this;
|
|
||||||
}
|
|
||||||
|
|
||||||
union_type_expression::union_type_expression(const struct position position,
|
|
||||||
std::vector<field_declaration>&& fields)
|
|
||||||
: type_expression(position), fields(std::move(fields))
|
|
||||||
{
|
|
||||||
}
|
|
||||||
|
|
||||||
union_type_expression::~union_type_expression()
|
|
||||||
{
|
|
||||||
for (const field_declaration& field : this->fields)
|
|
||||||
{
|
|
||||||
delete field.second;
|
|
||||||
}
|
|
||||||
}
|
|
||||||
|
|
||||||
void union_type_expression::accept(parser_visitor *visitor)
|
|
||||||
{
|
|
||||||
visitor->visit(this);
|
|
||||||
}
|
|
||||||
|
|
||||||
union_type_expression *union_type_expression::is_union()
|
|
||||||
{
|
|
||||||
return this;
|
|
||||||
}
|
|
||||||
|
|
||||||
variable_declaration::variable_declaration(const struct position position, identifier_definition identifier,
|
|
||||||
std::shared_ptr<type_expression> variable_type)
|
|
||||||
: definition(position, identifier), m_variable_type(variable_type)
|
|
||||||
{
|
|
||||||
}
|
|
||||||
|
|
||||||
void variable_declaration::accept(parser_visitor *visitor)
|
|
||||||
{
|
|
||||||
visitor->visit(this);
|
|
||||||
}
|
|
||||||
|
|
||||||
type_expression& variable_declaration::variable_type()
|
|
||||||
{
|
|
||||||
return *m_variable_type;
|
|
||||||
}
|
|
||||||
|
|
||||||
definition::definition(const struct position position, identifier_definition identifier)
|
|
||||||
: node(position), identifier(identifier)
|
|
||||||
{
|
|
||||||
}
|
|
||||||
|
|
||||||
constant_definition::constant_definition(const struct position position, identifier_definition identifier,
|
|
||||||
expression *body)
|
|
||||||
: definition(position, identifier), m_body(body)
|
|
||||||
{
|
|
||||||
}
|
|
||||||
|
|
||||||
void constant_definition::accept(parser_visitor *visitor)
|
|
||||||
{
|
|
||||||
visitor->visit(this);
|
|
||||||
}
|
|
||||||
|
|
||||||
expression& constant_definition::body()
|
|
||||||
{
|
|
||||||
return *m_body;
|
|
||||||
}
|
|
||||||
|
|
||||||
constant_definition::~constant_definition()
|
|
||||||
{
|
|
||||||
delete m_body;
|
|
||||||
}
|
|
||||||
|
|
||||||
procedure_type_expression::procedure_type_expression(const struct position position, return_t return_type)
|
|
||||||
: type_expression(position), return_type(return_type)
|
|
||||||
{
|
|
||||||
}
|
|
||||||
|
|
||||||
procedure_type_expression::~procedure_type_expression()
|
|
||||||
{
|
|
||||||
if (return_type.proper_type != nullptr)
|
|
||||||
{
|
|
||||||
delete return_type.proper_type;
|
|
||||||
}
|
|
||||||
for (const type_expression *parameter : this->parameters)
|
|
||||||
{
|
|
||||||
delete parameter;
|
|
||||||
}
|
|
||||||
}
|
|
||||||
|
|
||||||
void procedure_type_expression::accept(parser_visitor *visitor)
|
|
||||||
{
|
|
||||||
visitor->visit(this);
|
|
||||||
}
|
|
||||||
|
|
||||||
procedure_type_expression *procedure_type_expression::is_procedure()
|
|
||||||
{
|
|
||||||
return this;
|
|
||||||
}
|
|
||||||
|
|
||||||
enumeration_type_expression::enumeration_type_expression(const struct position position, std::vector<std::string>&& members)
|
|
||||||
: type_expression(position), members(members)
|
|
||||||
{
|
|
||||||
}
|
|
||||||
|
|
||||||
void enumeration_type_expression::accept(parser_visitor *visitor)
|
|
||||||
{
|
|
||||||
visitor->visit(this);
|
|
||||||
}
|
|
||||||
|
|
||||||
enumeration_type_expression *enumeration_type_expression::is_enumeration()
|
|
||||||
{
|
|
||||||
return this;
|
|
||||||
}
|
|
||||||
|
|
||||||
procedure_definition::procedure_definition(const struct position position, identifier_definition identifier,
|
|
||||||
procedure_type_expression *heading, block *body)
|
|
||||||
: definition(position, identifier), m_heading(heading), body(body)
|
|
||||||
{
|
|
||||||
}
|
|
||||||
|
|
||||||
void procedure_definition::accept(parser_visitor *visitor)
|
|
||||||
{
|
|
||||||
visitor->visit(this);
|
|
||||||
}
|
|
||||||
|
|
||||||
procedure_type_expression& procedure_definition::heading()
|
|
||||||
{
|
|
||||||
return *m_heading;
|
|
||||||
}
|
|
||||||
|
|
||||||
procedure_definition::~procedure_definition()
|
|
||||||
{
|
|
||||||
delete m_heading;
|
|
||||||
delete body;
|
|
||||||
}
|
|
||||||
|
|
||||||
type_definition::type_definition(const struct position position, identifier_definition identifier,
|
|
||||||
type_expression *body)
|
|
||||||
: definition(position, identifier), m_body(body)
|
|
||||||
{
|
|
||||||
}
|
|
||||||
|
|
||||||
type_definition::~type_definition()
|
|
||||||
{
|
|
||||||
delete m_body;
|
|
||||||
}
|
|
||||||
|
|
||||||
void type_definition::accept(parser_visitor *visitor)
|
|
||||||
{
|
|
||||||
visitor->visit(this);
|
|
||||||
}
|
|
||||||
|
|
||||||
type_expression& type_definition::body()
|
|
||||||
{
|
|
||||||
return *m_body;
|
|
||||||
}
|
|
||||||
|
|
||||||
block::block(const struct position position)
|
|
||||||
: node(position)
|
|
||||||
{
|
|
||||||
}
|
|
||||||
|
|
||||||
void block::accept(parser_visitor *visitor)
|
|
||||||
{
|
|
||||||
visitor->visit(this);
|
|
||||||
}
|
|
||||||
|
|
||||||
block::~block()
|
|
||||||
{
|
|
||||||
for (statement *body_statement : this->body)
|
|
||||||
{
|
|
||||||
delete body_statement;
|
|
||||||
}
|
|
||||||
for (variable_declaration *variable : this->variables)
|
|
||||||
{
|
|
||||||
delete variable;
|
|
||||||
}
|
|
||||||
for (constant_definition *constant : this->constants)
|
|
||||||
{
|
|
||||||
delete constant;
|
|
||||||
}
|
|
||||||
}
|
|
||||||
|
|
||||||
program::program(const struct position position)
|
|
||||||
: block(position)
|
|
||||||
{
|
|
||||||
}
|
|
||||||
|
|
||||||
void program::accept(parser_visitor *visitor)
|
|
||||||
{
|
|
||||||
visitor->visit(this);
|
|
||||||
}
|
|
||||||
|
|
||||||
program::~program()
|
|
||||||
{
|
|
||||||
for (procedure_definition *procedure : this->procedures)
|
|
||||||
{
|
|
||||||
delete procedure;
|
|
||||||
}
|
|
||||||
for (type_definition *type : this->types)
|
|
||||||
{
|
|
||||||
delete type;
|
|
||||||
}
|
|
||||||
}
|
|
||||||
|
|
||||||
literal_expression::literal_expression()
|
|
||||||
{
|
|
||||||
}
|
|
||||||
|
|
||||||
literal_expression *literal_expression::is_literal()
|
|
||||||
{
|
|
||||||
return this;
|
|
||||||
}
|
|
||||||
|
|
||||||
defer_statement::defer_statement(const struct position position, std::vector<statement *>&& statements)
|
|
||||||
: node(position), statements(std::move(statements))
|
|
||||||
{
|
|
||||||
}
|
|
||||||
|
|
||||||
void defer_statement::accept(parser_visitor *visitor)
|
|
||||||
{
|
|
||||||
visitor->visit(this);
|
|
||||||
}
|
|
||||||
|
|
||||||
defer_statement::~defer_statement()
|
|
||||||
{
|
|
||||||
for (statement *body_statement : statements)
|
|
||||||
{
|
|
||||||
delete body_statement;
|
|
||||||
}
|
|
||||||
}
|
|
||||||
|
|
||||||
designator_expression::designator_expression()
|
|
||||||
{
|
|
||||||
}
|
|
||||||
|
|
||||||
designator_expression::~designator_expression()
|
|
||||||
{
|
|
||||||
}
|
|
||||||
|
|
||||||
designator_expression *designator_expression::is_designator()
|
|
||||||
{
|
|
||||||
return this;
|
|
||||||
}
|
|
||||||
|
|
||||||
void designator_expression::accept(parser_visitor *visitor)
|
|
||||||
{
|
|
||||||
if (variable_expression *node = is_variable())
|
|
||||||
{
|
|
||||||
return visitor->visit(node);
|
|
||||||
}
|
|
||||||
else if (array_access_expression *node = is_array_access())
|
|
||||||
{
|
|
||||||
return visitor->visit(node);
|
|
||||||
}
|
|
||||||
else if (field_access_expression *node = is_field_access())
|
|
||||||
{
|
|
||||||
return visitor->visit(node);
|
|
||||||
}
|
|
||||||
else if (dereference_expression *node = is_dereference())
|
|
||||||
{
|
|
||||||
return visitor->visit(node);
|
|
||||||
}
|
|
||||||
__builtin_unreachable();
|
|
||||||
}
|
|
||||||
|
|
||||||
variable_expression::variable_expression(const struct position position, const std::string& name)
|
|
||||||
: node(position), name(name)
|
|
||||||
{
|
|
||||||
}
|
|
||||||
|
|
||||||
void variable_expression::accept(parser_visitor *visitor)
|
|
||||||
{
|
|
||||||
visitor->visit(this);
|
|
||||||
}
|
|
||||||
|
|
||||||
variable_expression *variable_expression::is_variable()
|
|
||||||
{
|
|
||||||
return this;
|
|
||||||
}
|
|
||||||
|
|
||||||
array_access_expression::array_access_expression(const struct position position,
|
|
||||||
expression *base, expression *index)
|
|
||||||
: node(position), m_base(base), m_index(index)
|
|
||||||
{
|
|
||||||
}
|
|
||||||
|
|
||||||
void array_access_expression::accept(parser_visitor *visitor)
|
|
||||||
{
|
|
||||||
visitor->visit(this);
|
|
||||||
}
|
|
||||||
|
|
||||||
expression& array_access_expression::index()
|
|
||||||
{
|
|
||||||
return *m_index;
|
|
||||||
}
|
|
||||||
|
|
||||||
expression& array_access_expression::base()
|
|
||||||
{
|
|
||||||
return *m_base;
|
|
||||||
}
|
|
||||||
|
|
||||||
array_access_expression *array_access_expression::is_array_access()
|
|
||||||
{
|
|
||||||
return this;
|
|
||||||
}
|
|
||||||
|
|
||||||
array_access_expression::~array_access_expression()
|
|
||||||
{
|
|
||||||
delete m_index;
|
|
||||||
delete m_base;
|
|
||||||
}
|
|
||||||
|
|
||||||
field_access_expression::field_access_expression(const struct position position,
|
|
||||||
expression *base, const std::string& field)
|
|
||||||
: node(position), m_base(base), m_field(field)
|
|
||||||
{
|
|
||||||
}
|
|
||||||
|
|
||||||
void field_access_expression::accept(parser_visitor *visitor)
|
|
||||||
{
|
|
||||||
visitor->visit(this);
|
|
||||||
}
|
|
||||||
|
|
||||||
expression& field_access_expression::base()
|
|
||||||
{
|
|
||||||
return *m_base;
|
|
||||||
}
|
|
||||||
|
|
||||||
std::string& field_access_expression::field()
|
|
||||||
{
|
|
||||||
return m_field;
|
|
||||||
}
|
|
||||||
|
|
||||||
field_access_expression *field_access_expression::is_field_access()
|
|
||||||
{
|
|
||||||
return this;
|
|
||||||
}
|
|
||||||
|
|
||||||
field_access_expression::~field_access_expression()
|
|
||||||
{
|
|
||||||
delete m_base;
|
|
||||||
}
|
|
||||||
|
|
||||||
dereference_expression::dereference_expression(const struct position position,
|
|
||||||
expression *base)
|
|
||||||
: node(position), m_base(base)
|
|
||||||
{
|
|
||||||
}
|
|
||||||
|
|
||||||
void dereference_expression::accept(parser_visitor *visitor)
|
|
||||||
{
|
|
||||||
visitor->visit(this);
|
|
||||||
}
|
|
||||||
|
|
||||||
expression& dereference_expression::base()
|
|
||||||
{
|
|
||||||
return *m_base;
|
|
||||||
}
|
|
||||||
|
|
||||||
dereference_expression *dereference_expression::is_dereference()
|
|
||||||
{
|
|
||||||
return this;
|
|
||||||
}
|
|
||||||
|
|
||||||
dereference_expression::~dereference_expression()
|
|
||||||
{
|
|
||||||
delete m_base;
|
|
||||||
}
|
|
||||||
|
|
||||||
binary_expression::binary_expression(const struct position position, expression *lhs,
|
|
||||||
expression *rhs, const binary_operator operation)
|
|
||||||
: node(position), m_lhs(lhs), m_rhs(rhs), m_operator(operation)
|
|
||||||
{
|
|
||||||
}
|
|
||||||
|
|
||||||
void binary_expression::accept(parser_visitor *visitor)
|
|
||||||
{
|
|
||||||
visitor->visit(this);
|
|
||||||
}
|
|
||||||
|
|
||||||
binary_expression *binary_expression::is_binary()
|
|
||||||
{
|
|
||||||
return this;
|
|
||||||
}
|
|
||||||
|
|
||||||
expression& binary_expression::lhs()
|
|
||||||
{
|
|
||||||
return *m_lhs;
|
|
||||||
}
|
|
||||||
|
|
||||||
expression& binary_expression::rhs()
|
|
||||||
{
|
|
||||||
return *m_rhs;
|
|
||||||
}
|
|
||||||
|
|
||||||
binary_operator binary_expression::operation() const
|
|
||||||
{
|
|
||||||
return m_operator;
|
|
||||||
}
|
|
||||||
|
|
||||||
binary_expression::~binary_expression()
|
|
||||||
{
|
|
||||||
delete m_lhs;
|
|
||||||
delete m_rhs;
|
|
||||||
}
|
|
||||||
|
|
||||||
unary_expression::unary_expression(const struct position position, expression *operand,
|
|
||||||
const unary_operator operation)
|
|
||||||
: node(position), m_operand(std::move(operand)), m_operator(operation)
|
|
||||||
{
|
|
||||||
}
|
|
||||||
|
|
||||||
void unary_expression::accept(parser_visitor *visitor)
|
|
||||||
{
|
|
||||||
visitor->visit(this);
|
|
||||||
}
|
|
||||||
|
|
||||||
unary_expression *unary_expression::is_unary()
|
|
||||||
{
|
|
||||||
return this;
|
|
||||||
}
|
|
||||||
|
|
||||||
expression& unary_expression::operand()
|
|
||||||
{
|
|
||||||
return *m_operand;
|
|
||||||
}
|
|
||||||
|
|
||||||
unary_operator unary_expression::operation() const
|
|
||||||
{
|
|
||||||
return this->m_operator;
|
|
||||||
}
|
|
||||||
|
|
||||||
unary_expression::~unary_expression()
|
|
||||||
{
|
|
||||||
delete m_operand;
|
|
||||||
}
|
|
||||||
|
|
||||||
procedure_call::procedure_call(const struct position position, designator_expression *callable)
|
|
||||||
: node(position), m_callable(callable)
|
|
||||||
{
|
|
||||||
}
|
|
||||||
|
|
||||||
void procedure_call::accept(parser_visitor *visitor)
|
|
||||||
{
|
|
||||||
visitor->visit(this);
|
|
||||||
}
|
|
||||||
|
|
||||||
procedure_call *procedure_call::is_call_expression()
|
|
||||||
{
|
|
||||||
return this;
|
|
||||||
}
|
|
||||||
|
|
||||||
designator_expression& procedure_call::callable()
|
|
||||||
{
|
|
||||||
return *m_callable;
|
|
||||||
}
|
|
||||||
|
|
||||||
procedure_call::~procedure_call()
|
|
||||||
{
|
|
||||||
for (expression *const argument : arguments)
|
|
||||||
{
|
|
||||||
delete argument;
|
|
||||||
}
|
|
||||||
delete m_callable;
|
|
||||||
}
|
|
||||||
|
|
||||||
cast_expression::cast_expression(const struct position position, type_expression *target, expression *value)
|
|
||||||
: node(position), m_target(target), m_value(value)
|
|
||||||
{
|
|
||||||
}
|
|
||||||
|
|
||||||
void cast_expression::accept(parser_visitor *visitor)
|
|
||||||
{
|
|
||||||
visitor->visit(this);
|
|
||||||
}
|
|
||||||
|
|
||||||
cast_expression *cast_expression::is_cast()
|
|
||||||
{
|
|
||||||
return this;
|
|
||||||
}
|
|
||||||
|
|
||||||
type_expression& cast_expression::target()
|
|
||||||
{
|
|
||||||
return *m_target;
|
|
||||||
}
|
|
||||||
|
|
||||||
expression& cast_expression::value()
|
|
||||||
{
|
|
||||||
return *m_value;
|
|
||||||
}
|
|
||||||
|
|
||||||
cast_expression::~cast_expression()
|
|
||||||
{
|
|
||||||
delete m_target;
|
|
||||||
delete m_value;
|
|
||||||
}
|
|
||||||
|
|
||||||
traits_expression::traits_expression(const struct position position, const std::string& name)
|
|
||||||
: node(position), name(name)
|
|
||||||
{
|
|
||||||
}
|
|
||||||
|
|
||||||
traits_expression::~traits_expression()
|
|
||||||
{
|
|
||||||
for (const type_expression *parameter : this->parameters)
|
|
||||||
{
|
|
||||||
delete parameter;
|
|
||||||
}
|
|
||||||
}
|
|
||||||
|
|
||||||
void traits_expression::accept(parser_visitor *visitor)
|
|
||||||
{
|
|
||||||
visitor->visit(this);
|
|
||||||
}
|
|
||||||
|
|
||||||
traits_expression *traits_expression::is_traits()
|
|
||||||
{
|
|
||||||
return this;
|
|
||||||
}
|
|
||||||
|
|
||||||
conditional_statements::conditional_statements(expression *prerequisite, std::vector<statement *>&& statements)
|
|
||||||
: m_prerequisite(prerequisite), statements(std::move(statements))
|
|
||||||
{
|
|
||||||
}
|
|
||||||
|
|
||||||
expression& conditional_statements::prerequisite()
|
|
||||||
{
|
|
||||||
return *m_prerequisite;
|
|
||||||
}
|
|
||||||
|
|
||||||
conditional_statements::~conditional_statements()
|
|
||||||
{
|
|
||||||
delete m_prerequisite;
|
|
||||||
for (auto statement : statements)
|
|
||||||
{
|
|
||||||
delete statement;
|
|
||||||
}
|
|
||||||
}
|
|
||||||
|
|
||||||
return_statement::return_statement(const struct position position, expression *return_expression)
|
|
||||||
: node(position), return_expression(return_expression)
|
|
||||||
{
|
|
||||||
}
|
|
||||||
|
|
||||||
void return_statement::accept(parser_visitor *visitor)
|
|
||||||
{
|
|
||||||
visitor->visit(this);
|
|
||||||
}
|
|
||||||
|
|
||||||
return_statement::~return_statement()
|
|
||||||
{
|
|
||||||
delete this->return_expression;
|
|
||||||
}
|
|
||||||
|
|
||||||
case_statement::case_statement(const struct position position,
|
|
||||||
expression *condition, std::vector<switch_case>&& cases, std::vector<statement *> *alternative)
|
|
||||||
: node(position), m_condition(condition), cases(std::move(cases)), alternative(alternative)
|
|
||||||
{
|
|
||||||
}
|
|
||||||
|
|
||||||
void case_statement::accept(parser_visitor *visitor)
|
|
||||||
{
|
|
||||||
visitor->visit(this);
|
|
||||||
}
|
|
||||||
|
|
||||||
expression& case_statement::condition()
|
|
||||||
{
|
|
||||||
return *m_condition;
|
|
||||||
}
|
|
||||||
|
|
||||||
assign_statement::assign_statement(const struct position position, designator_expression *lvalue,
|
|
||||||
expression *rvalue)
|
|
||||||
: node(position), m_lvalue(lvalue), m_rvalue(rvalue)
|
|
||||||
{
|
|
||||||
}
|
|
||||||
|
|
||||||
void assign_statement::accept(parser_visitor *visitor)
|
|
||||||
{
|
|
||||||
visitor->visit(this);
|
|
||||||
}
|
|
||||||
|
|
||||||
variable_expression *designator_expression::is_variable()
|
|
||||||
{
|
|
||||||
return nullptr;
|
|
||||||
}
|
|
||||||
|
|
||||||
array_access_expression *designator_expression::is_array_access()
|
|
||||||
{
|
|
||||||
return nullptr;
|
|
||||||
}
|
|
||||||
|
|
||||||
field_access_expression *designator_expression::is_field_access()
|
|
||||||
{
|
|
||||||
return nullptr;
|
|
||||||
}
|
|
||||||
|
|
||||||
dereference_expression *designator_expression::is_dereference()
|
|
||||||
{
|
|
||||||
return nullptr;
|
|
||||||
}
|
|
||||||
|
|
||||||
designator_expression& assign_statement::lvalue()
|
|
||||||
{
|
|
||||||
return *m_lvalue;
|
|
||||||
}
|
|
||||||
|
|
||||||
expression& assign_statement::rvalue()
|
|
||||||
{
|
|
||||||
return *m_rvalue;
|
|
||||||
}
|
|
||||||
|
|
||||||
assign_statement::~assign_statement()
|
|
||||||
{
|
|
||||||
delete m_rvalue;
|
|
||||||
}
|
|
||||||
|
|
||||||
if_statement::if_statement(const struct position position, conditional_statements *body,
|
|
||||||
std::vector<conditional_statements *>&& branches,
|
|
||||||
std::vector<statement *> *alternative)
|
|
||||||
: node(position), m_body(body), branches(std::move(branches)), alternative(alternative)
|
|
||||||
{
|
|
||||||
}
|
|
||||||
|
|
||||||
void if_statement::accept(parser_visitor *visitor)
|
|
||||||
{
|
|
||||||
visitor->visit(this);
|
|
||||||
}
|
|
||||||
|
|
||||||
conditional_statements& if_statement::body()
|
|
||||||
{
|
|
||||||
return *m_body;
|
|
||||||
}
|
|
||||||
|
|
||||||
if_statement::~if_statement()
|
|
||||||
{
|
|
||||||
delete m_body;
|
|
||||||
for (const auto branch : branches)
|
|
||||||
{
|
|
||||||
delete branch;
|
|
||||||
}
|
|
||||||
delete this->alternative;
|
|
||||||
}
|
|
||||||
|
|
||||||
escape_statement::escape_statement(const struct position position,
|
|
||||||
escape_direction direction, const std::string& label)
|
|
||||||
: node(position), direction(direction), label(label)
|
|
||||||
{
|
|
||||||
}
|
|
||||||
|
|
||||||
void escape_statement::accept(parser_visitor *visitor)
|
|
||||||
{
|
|
||||||
visitor->visit(this);
|
|
||||||
}
|
|
||||||
|
|
||||||
while_statement::while_statement(const struct position position, conditional_statements *body,
|
|
||||||
std::vector<conditional_statements *>&& branches, std::vector<statement *> *alternative)
|
|
||||||
: node(position), m_body(body), branches(std::move(branches)), alternative(alternative)
|
|
||||||
{
|
|
||||||
}
|
|
||||||
|
|
||||||
while_statement::while_statement(const struct position position, conditional_statements *body,
|
|
||||||
std::vector<conditional_statements *>&& branches, const std::string& label,
|
|
||||||
std::vector<statement *> *alternative)
|
|
||||||
: node(position), m_body(body), branches(std::move(branches)), label(label), alternative(alternative)
|
|
||||||
{
|
|
||||||
}
|
|
||||||
|
|
||||||
void while_statement::accept(parser_visitor *visitor)
|
|
||||||
{
|
|
||||||
visitor->visit(this);
|
|
||||||
}
|
|
||||||
|
|
||||||
conditional_statements& while_statement::body()
|
|
||||||
{
|
|
||||||
return *m_body;
|
|
||||||
}
|
|
||||||
|
|
||||||
while_statement::~while_statement()
|
|
||||||
{
|
|
||||||
delete m_body;
|
|
||||||
for (const auto branch : branches)
|
|
||||||
{
|
|
||||||
delete branch;
|
|
||||||
}
|
|
||||||
}
|
|
||||||
|
|
||||||
const char *print_binary_operator(const binary_operator operation)
|
|
||||||
{
|
|
||||||
switch (operation)
|
|
||||||
{
|
|
||||||
case binary_operator::sum:
|
|
||||||
return "+";
|
|
||||||
case binary_operator::subtraction:
|
|
||||||
return "-";
|
|
||||||
case binary_operator::multiplication:
|
|
||||||
return "*";
|
|
||||||
case binary_operator::division:
|
|
||||||
return "/";
|
|
||||||
case binary_operator::remainder:
|
|
||||||
return "%";
|
|
||||||
case binary_operator::equals:
|
|
||||||
return "=";
|
|
||||||
case binary_operator::not_equals:
|
|
||||||
return "<>";
|
|
||||||
case binary_operator::less:
|
|
||||||
return "<";
|
|
||||||
case binary_operator::less_equal:
|
|
||||||
return "<=";
|
|
||||||
case binary_operator::greater:
|
|
||||||
return ">";
|
|
||||||
case binary_operator::greater_equal:
|
|
||||||
return ">=";
|
|
||||||
case binary_operator::conjunction:
|
|
||||||
return "and";
|
|
||||||
case binary_operator::disjunction:
|
|
||||||
return "or";
|
|
||||||
case binary_operator::exclusive_disjunction:
|
|
||||||
return "xor";
|
|
||||||
case binary_operator::shift_left:
|
|
||||||
return "<<";
|
|
||||||
case binary_operator::shift_right:
|
|
||||||
return ">>";
|
|
||||||
}
|
|
||||||
__builtin_unreachable();
|
|
||||||
};
|
|
||||||
}
|
|
||||||
600
boot/common-boot.s
Normal file
600
boot/common-boot.s
Normal file
@ -0,0 +1,600 @@
|
|||||||
|
# This Source Code Form is subject to the terms of the Mozilla Public License,
|
||||||
|
# v. 2.0. If a copy of the MPL was not distributed with this file, You can
|
||||||
|
# obtain one at https://mozilla.org/MPL/2.0/.
|
||||||
|
|
||||||
|
.global _is_alpha, _is_digit, _is_alnum, _is_upper, _is_lower
|
||||||
|
.global _write_s, _read_file, _write_error, _write_c, _write_i, _print_i
|
||||||
|
.global _get, _memcmp, _memchr, _memmem, _memcpy
|
||||||
|
.global _divide_by_zero_error, _exit, _mmap
|
||||||
|
.global _strings_index, _string_equal
|
||||||
|
|
||||||
|
.section .rodata
|
||||||
|
|
||||||
|
.equ SYS_READ, 63
|
||||||
|
.equ SYS_WRITE, 64
|
||||||
|
.equ SYS_EXIT, 93
|
||||||
|
.equ SYS_MMAP2, 222
|
||||||
|
.equ STDIN, 0
|
||||||
|
.equ STDOUT, 1
|
||||||
|
.equ STDERR, 2
|
||||||
|
.equ PROT_READ, 0x1
|
||||||
|
.equ PROT_WRITE, 0x2
|
||||||
|
.equ MAP_PRIVATE, 0x02
|
||||||
|
.equ MAP_ANONYMOUS, 0x20
|
||||||
|
|
||||||
|
new_line: .ascii "\n"
|
||||||
|
|
||||||
|
.section .text
|
||||||
|
|
||||||
|
# Write the current token to stderr. Ends the output with a newline.
|
||||||
|
#
|
||||||
|
# a0 - String pointer.
|
||||||
|
# a1 - String length.
|
||||||
|
.type _write_error, @function
|
||||||
|
_write_error:
|
||||||
|
mv t0, a0
|
||||||
|
mv t1, a1
|
||||||
|
|
||||||
|
li a0, STDERR
|
||||||
|
mv a1, t0
|
||||||
|
mv a2, t1
|
||||||
|
li a7, SYS_WRITE
|
||||||
|
ecall
|
||||||
|
|
||||||
|
li a0, STDERR
|
||||||
|
la a1, new_line
|
||||||
|
li a2, 1
|
||||||
|
li a7, SYS_WRITE
|
||||||
|
ecall
|
||||||
|
|
||||||
|
ret
|
||||||
|
|
||||||
|
# a0 - First pointer.
|
||||||
|
# a1 - Second pointer.
|
||||||
|
# a2 - The length to compare.
|
||||||
|
#
|
||||||
|
# Returns 0 in a0 if memory regions are equal.
|
||||||
|
.type _memcmp, @function
|
||||||
|
_memcmp:
|
||||||
|
mv t0, a0
|
||||||
|
li a0, 0
|
||||||
|
|
||||||
|
.Lmemcmp_loop:
|
||||||
|
beqz a2, .Lmemcmp_end
|
||||||
|
|
||||||
|
lbu t1, (t0)
|
||||||
|
lbu t2, (a1)
|
||||||
|
sub a0, t1, t2
|
||||||
|
|
||||||
|
bnez a0, .Lmemcmp_end
|
||||||
|
|
||||||
|
addi t0, t0, 1
|
||||||
|
addi a1, a1, 1
|
||||||
|
addi a2, a2, -1
|
||||||
|
|
||||||
|
j .Lmemcmp_loop
|
||||||
|
|
||||||
|
.Lmemcmp_end:
|
||||||
|
ret
|
||||||
|
|
||||||
|
# Detects if a0 is an uppercase character. Sets a0 to 1 if so, otherwise to 0.
|
||||||
|
.type _is_upper, @function
|
||||||
|
_is_upper:
|
||||||
|
li t0, 'A' - 1
|
||||||
|
sltu t1, t0, a0 # t1 = a0 >= 'A'
|
||||||
|
|
||||||
|
sltiu t2, a0, 'Z' + 1 # t2 = a0 <= 'Z'
|
||||||
|
and a0, t1, t2 # t1 = a0 >= 'A' & a0 <= 'Z'
|
||||||
|
|
||||||
|
ret
|
||||||
|
|
||||||
|
# Detects if a0 is an lowercase character. Sets a0 to 1 if so, otherwise to 0.
|
||||||
|
.type _is_lower, @function
|
||||||
|
_is_lower:
|
||||||
|
li t0, 'a' - 1
|
||||||
|
sltu t2, t0, a0 # t2 = a0 >= 'a'
|
||||||
|
|
||||||
|
sltiu t3, a0, 'z' + 1 # t3 = a0 <= 'z'
|
||||||
|
and a0, t2, t3 # t2 = a0 >= 'a' & a0 <= 'z'
|
||||||
|
|
||||||
|
ret
|
||||||
|
|
||||||
|
# Detects if the passed character is a 7-bit alpha character or an underscore.
|
||||||
|
# The character is passed in a0.
|
||||||
|
# Sets a0 to 1 if the character is an alpha character or underscore, sets it to 0 otherwise.
|
||||||
|
.type _is_alpha, @function
|
||||||
|
_is_alpha:
|
||||||
|
# Prologue.
|
||||||
|
addi sp, sp, -16
|
||||||
|
sw ra, 12(sp)
|
||||||
|
sw s0, 8(sp)
|
||||||
|
addi s0, sp, 16
|
||||||
|
|
||||||
|
sw a0, 4(sp)
|
||||||
|
|
||||||
|
call _is_upper
|
||||||
|
sw a0, 0(sp)
|
||||||
|
|
||||||
|
lw a0, 4(sp)
|
||||||
|
call _is_lower
|
||||||
|
|
||||||
|
lw t0, 4(sp)
|
||||||
|
xori t1, t0, '_'
|
||||||
|
seqz t1, t1
|
||||||
|
|
||||||
|
lw t0, 0(sp)
|
||||||
|
or a0, a0, t0
|
||||||
|
or a0, a0, t1
|
||||||
|
|
||||||
|
# Epilogue.
|
||||||
|
lw ra, 12(sp)
|
||||||
|
lw s0, 8(sp)
|
||||||
|
addi sp, sp, 16
|
||||||
|
ret
|
||||||
|
|
||||||
|
# Detects whether the passed character is a digit
|
||||||
|
# (a value between 0 and 9).
|
||||||
|
#
|
||||||
|
# Parameters:
|
||||||
|
# a0 - Exemined value.
|
||||||
|
#
|
||||||
|
# Sets a0 to 1 if it is a digit, to 0 otherwise.
|
||||||
|
.type _is_digit, @function
|
||||||
|
_is_digit:
|
||||||
|
li t0, '0' - 1
|
||||||
|
sltu t1, t0, a0 # t1 = a0 >= '0'
|
||||||
|
|
||||||
|
sltiu t2, a0, '9' + 1 # t2 = a0 <= '9'
|
||||||
|
|
||||||
|
and a0, t1, t2
|
||||||
|
|
||||||
|
ret
|
||||||
|
|
||||||
|
.type _is_alnum, @function
|
||||||
|
_is_alnum:
|
||||||
|
# Prologue.
|
||||||
|
addi sp, sp, -16
|
||||||
|
sw ra, 12(sp)
|
||||||
|
sw s0, 8(sp)
|
||||||
|
addi s0, sp, 16
|
||||||
|
|
||||||
|
sw a0, 4(sp)
|
||||||
|
|
||||||
|
call _is_alpha
|
||||||
|
sw a0, 0(sp)
|
||||||
|
|
||||||
|
lw a0, 4(sp)
|
||||||
|
call _is_digit
|
||||||
|
|
||||||
|
lw a1, 0(sp)
|
||||||
|
or a0, a0, a1
|
||||||
|
|
||||||
|
# Epilogue.
|
||||||
|
lw ra, 12(sp)
|
||||||
|
lw s0, 8(sp)
|
||||||
|
addi sp, sp, 16
|
||||||
|
ret
|
||||||
|
|
||||||
|
# Writes a string to the standard output.
|
||||||
|
#
|
||||||
|
# Parameters:
|
||||||
|
# a0 - Length of the string.
|
||||||
|
# a1 - String pointer.
|
||||||
|
.type _write_s, @function
|
||||||
|
_write_s:
|
||||||
|
# Prologue.
|
||||||
|
addi sp, sp, -8
|
||||||
|
sw ra, 4(sp)
|
||||||
|
sw s0, 0(sp)
|
||||||
|
addi s0, sp, 8
|
||||||
|
|
||||||
|
mv a2, a0
|
||||||
|
li a0, STDOUT
|
||||||
|
li a7, SYS_WRITE
|
||||||
|
ecall
|
||||||
|
|
||||||
|
# Epilogue.
|
||||||
|
lw ra, 4(sp)
|
||||||
|
lw s0, 0(sp)
|
||||||
|
addi sp, sp, 8
|
||||||
|
ret
|
||||||
|
|
||||||
|
# Reads standard input into a buffer.
|
||||||
|
# a0 - Buffer pointer.
|
||||||
|
# a1 - Buffer size.
|
||||||
|
#
|
||||||
|
# Sets s1 to the buffer passed in a0.
|
||||||
|
#
|
||||||
|
# Returns the amount of bytes written in a0.
|
||||||
|
.type _read_file, @function
|
||||||
|
_read_file:
|
||||||
|
# Prologue.
|
||||||
|
addi sp, sp, -8
|
||||||
|
sw ra, 4(sp)
|
||||||
|
sw s0, 0(sp)
|
||||||
|
addi s0, sp, 8
|
||||||
|
|
||||||
|
mv s1, a0
|
||||||
|
|
||||||
|
li a0, STDIN
|
||||||
|
mv a2, a1
|
||||||
|
mv a1, s1
|
||||||
|
li a7, SYS_READ
|
||||||
|
ecall
|
||||||
|
|
||||||
|
# Epilogue.
|
||||||
|
lw ra, 4(sp)
|
||||||
|
lw s0, 0(sp)
|
||||||
|
addi sp, sp, 8
|
||||||
|
ret
|
||||||
|
|
||||||
|
# Terminates the program. a0 contains the return code.
|
||||||
|
#
|
||||||
|
# Parameters:
|
||||||
|
# a0 - Status code.
|
||||||
|
.type _exit, @function
|
||||||
|
_exit:
|
||||||
|
li a7, SYS_EXIT
|
||||||
|
ecall
|
||||||
|
# ret
|
||||||
|
|
||||||
|
.type _divide_by_zero_error, @function
|
||||||
|
_divide_by_zero_error:
|
||||||
|
addi a7, zero, 172 # getpid
|
||||||
|
ecall
|
||||||
|
|
||||||
|
addi a1, zero, 8 # SIGFPE
|
||||||
|
addi a7, zero, 129 # kill
|
||||||
|
ecall
|
||||||
|
ret
|
||||||
|
|
||||||
|
# Writes a number to a string buffer.
|
||||||
|
#
|
||||||
|
# t0 - Local buffer.
|
||||||
|
# t1 - Constant 10.
|
||||||
|
# t2 - Current character.
|
||||||
|
# t3 - Whether the number is negative.
|
||||||
|
#
|
||||||
|
# Parameters:
|
||||||
|
# a0 - Whole number.
|
||||||
|
# a1 - Buffer pointer.
|
||||||
|
#
|
||||||
|
# Sets a0 to the length of the written number.
|
||||||
|
.type _print_i, @function
|
||||||
|
_print_i:
|
||||||
|
addi sp, sp, -32
|
||||||
|
sw ra, 28(sp)
|
||||||
|
sw s0, 24(sp)
|
||||||
|
addi s0, sp, 32
|
||||||
|
|
||||||
|
li t1, 10
|
||||||
|
addi t0, s0, -9
|
||||||
|
|
||||||
|
li t3, 0
|
||||||
|
bgez a0, .Lprint_i_digit10
|
||||||
|
li t3, 1
|
||||||
|
neg a0, a0
|
||||||
|
|
||||||
|
.Lprint_i_digit10:
|
||||||
|
rem t2, a0, t1
|
||||||
|
addi t2, t2, '0'
|
||||||
|
sb t2, 0(t0)
|
||||||
|
div a0, a0, t1
|
||||||
|
addi t0, t0, -1
|
||||||
|
bne zero, a0, .Lprint_i_digit10
|
||||||
|
|
||||||
|
beq zero, t3, .Lprint_i_write_call
|
||||||
|
addi t2, zero, '-'
|
||||||
|
sb t2, 0(t0)
|
||||||
|
addi t0, t0, -1
|
||||||
|
|
||||||
|
.Lprint_i_write_call:
|
||||||
|
mv a0, a1
|
||||||
|
addi a1, t0, 1
|
||||||
|
sub a2, s0, t0
|
||||||
|
addi a2, a2, -9
|
||||||
|
sw a2, 0(sp)
|
||||||
|
|
||||||
|
call _memcpy
|
||||||
|
|
||||||
|
lw a0, 0(sp)
|
||||||
|
|
||||||
|
lw ra, 28(sp)
|
||||||
|
lw s0, 24(sp)
|
||||||
|
addi sp, sp, 32
|
||||||
|
ret
|
||||||
|
|
||||||
|
# Writes a number to the standard output.
|
||||||
|
#
|
||||||
|
# Parameters:
|
||||||
|
# a0 - Whole number.
|
||||||
|
.type _write_i, @function
|
||||||
|
_write_i:
|
||||||
|
addi sp, sp, -32
|
||||||
|
sw ra, 28(sp)
|
||||||
|
sw s0, 24(sp)
|
||||||
|
addi s0, sp, 32
|
||||||
|
|
||||||
|
addi a1, sp, 0
|
||||||
|
call _print_i
|
||||||
|
|
||||||
|
addi a1, sp, 0
|
||||||
|
call _write_s
|
||||||
|
|
||||||
|
lw ra, 28(sp)
|
||||||
|
lw s0, 24(sp)
|
||||||
|
addi sp, sp, 32
|
||||||
|
ret
|
||||||
|
|
||||||
|
# Writes a character from a0 into the standard output.
|
||||||
|
.type _write_c, @function
|
||||||
|
_write_c:
|
||||||
|
# Prologue
|
||||||
|
addi sp, sp, -16
|
||||||
|
sw ra, 12(sp)
|
||||||
|
sw s0, 8(sp)
|
||||||
|
addi s0, sp, 16
|
||||||
|
|
||||||
|
sb a0, 4(sp)
|
||||||
|
li a0, STDOUT
|
||||||
|
addi a1, sp, 4
|
||||||
|
li a2, 1
|
||||||
|
li a7, SYS_WRITE
|
||||||
|
ecall
|
||||||
|
|
||||||
|
# Epilogue.
|
||||||
|
lw ra, 12(sp)
|
||||||
|
lw s0, 8(sp)
|
||||||
|
add sp, sp, 16
|
||||||
|
ret
|
||||||
|
|
||||||
|
# a0 - Pointer to an array to get the first element.
|
||||||
|
#
|
||||||
|
# Dereferences a pointer and returns what is on the address in a0.
|
||||||
|
.type _get, @function
|
||||||
|
_get:
|
||||||
|
lw a0, (a0)
|
||||||
|
ret
|
||||||
|
|
||||||
|
# Searches for the occurences of a character in the given memory block.
|
||||||
|
#
|
||||||
|
# Parameters:
|
||||||
|
# a0 - Memory block.
|
||||||
|
# a1 - Needle.
|
||||||
|
# a2 - Memory size.
|
||||||
|
#
|
||||||
|
# Sets a0 to the pointer to the found character or to null if the character
|
||||||
|
# doesn't occur in the memory block.
|
||||||
|
.type _memchr, @function
|
||||||
|
_memchr:
|
||||||
|
.Lmemchr_loop:
|
||||||
|
beqz a2, .Lmemchr_nil # Exit if the length is 0.
|
||||||
|
|
||||||
|
lbu t0, (a0) # Load the character from the memory block.
|
||||||
|
beq t0, a1, .Lmemchr_end # Exit if the character was found.
|
||||||
|
|
||||||
|
# Otherwise, continue with the next character.
|
||||||
|
addi a0, a0, 1
|
||||||
|
addi a2, a2, -1
|
||||||
|
|
||||||
|
j .Lmemchr_loop
|
||||||
|
|
||||||
|
.Lmemchr_nil:
|
||||||
|
li a0, 0
|
||||||
|
|
||||||
|
.Lmemchr_end:
|
||||||
|
ret
|
||||||
|
|
||||||
|
# Locates a substring.
|
||||||
|
#
|
||||||
|
# Parameters:
|
||||||
|
# a0 - Haystack.
|
||||||
|
# a1 - Haystack size.
|
||||||
|
# a2 - Needle.
|
||||||
|
# a3 - Needle size.
|
||||||
|
#
|
||||||
|
# Sets a0 to the pointer to the beginning of the substring in memory or to 0
|
||||||
|
# if the substring doesn't occur in the block.
|
||||||
|
.type _memmem, @function
|
||||||
|
_memmem:
|
||||||
|
# Prologue.
|
||||||
|
addi sp, sp, -24
|
||||||
|
sw ra, 20(sp)
|
||||||
|
sw s0, 16(sp)
|
||||||
|
addi s0, sp, 24
|
||||||
|
|
||||||
|
# Save preserved registers. They are used to keep arguments.
|
||||||
|
sw s1, 12(sp)
|
||||||
|
sw s2, 8(sp)
|
||||||
|
sw s3, 4(sp)
|
||||||
|
sw s4, 0(sp)
|
||||||
|
|
||||||
|
mv s1, a0
|
||||||
|
mv s2, a1
|
||||||
|
mv s3, a2
|
||||||
|
mv s4, a3
|
||||||
|
|
||||||
|
.Lmemmem_loop:
|
||||||
|
blt s2, s3, .Lmemmem_nil # Exit if the needle length is greater than memory.
|
||||||
|
|
||||||
|
mv a0, s1
|
||||||
|
mv a1, s3
|
||||||
|
mv a2, s4
|
||||||
|
call _memcmp
|
||||||
|
|
||||||
|
mv t0, a0 # memcmp result.
|
||||||
|
mv a0, s1 # Memory pointer for the case the substring was found.
|
||||||
|
beqz t0, .Lmemmem_end
|
||||||
|
|
||||||
|
addi s1, s1, 1
|
||||||
|
add s2, s2, -1
|
||||||
|
|
||||||
|
j .Lmemmem_loop
|
||||||
|
|
||||||
|
.Lmemmem_nil:
|
||||||
|
li a0, 0
|
||||||
|
|
||||||
|
.Lmemmem_end:
|
||||||
|
|
||||||
|
# Restore the preserved registers.
|
||||||
|
lw s1, 12(sp)
|
||||||
|
lw s2, 8(sp)
|
||||||
|
lw s3, 4(sp)
|
||||||
|
lw s4, 0(sp)
|
||||||
|
|
||||||
|
# Epilogue.
|
||||||
|
lw ra, 20(sp)
|
||||||
|
lw s0, 16(sp)
|
||||||
|
add sp, sp, 24
|
||||||
|
ret
|
||||||
|
|
||||||
|
# Copies memory.
|
||||||
|
#
|
||||||
|
# Parameters:
|
||||||
|
# a0 - Destination.
|
||||||
|
# a1 - Source.
|
||||||
|
# a2 - Size.
|
||||||
|
#
|
||||||
|
# Preserves a0.
|
||||||
|
.type _memcpy, @function
|
||||||
|
_memcpy:
|
||||||
|
mv t0, a0
|
||||||
|
|
||||||
|
.Lmemcpy_loop:
|
||||||
|
beqz a2, .Lmemcpy_end
|
||||||
|
|
||||||
|
lbu t1, (a1)
|
||||||
|
sb t1, (a0)
|
||||||
|
|
||||||
|
addi a0, a0, 1
|
||||||
|
addi a1, a1, 1
|
||||||
|
addi a2, a2, -1
|
||||||
|
|
||||||
|
j .Lmemcpy_loop
|
||||||
|
|
||||||
|
.Lmemcpy_end:
|
||||||
|
mv a0, t0
|
||||||
|
ret
|
||||||
|
|
||||||
|
# Searches for a string in a string array.
|
||||||
|
#
|
||||||
|
# Parameters:
|
||||||
|
# a0 - Number of elements in the string array.
|
||||||
|
# a1 - String array.
|
||||||
|
# a2 - Needle length.
|
||||||
|
# a3 - Needle.
|
||||||
|
#
|
||||||
|
# Sets a0 to the 1-based index of the needle in the haystack or to 0 if the
|
||||||
|
# element could not be found.
|
||||||
|
.type _strings_index, @function
|
||||||
|
_strings_index:
|
||||||
|
# Prologue.
|
||||||
|
addi sp, sp, -32
|
||||||
|
sw ra, 28(sp)
|
||||||
|
sw s0, 24(sp)
|
||||||
|
addi s0, sp, 32
|
||||||
|
|
||||||
|
sw s1, 20(sp)
|
||||||
|
mv s1, a0
|
||||||
|
sw s2, 16(sp)
|
||||||
|
mv s2, a1
|
||||||
|
sw s3, 12(sp)
|
||||||
|
mv s3, a2
|
||||||
|
sw s4, 8(sp)
|
||||||
|
mv s4, a3
|
||||||
|
sw s5, 4(sp)
|
||||||
|
li s5, 0 # Index counter.
|
||||||
|
|
||||||
|
.Lstrings_index_loop:
|
||||||
|
addi s5, s5, 1
|
||||||
|
beqz s1, .Lstrings_index_missing
|
||||||
|
|
||||||
|
lw a2, (s2) # Read the length of the current element in the haystack.
|
||||||
|
bne a2, s3, .Lstrings_index_next # Lengths don't match, skip the iteration.
|
||||||
|
|
||||||
|
addi a0, s2, 4
|
||||||
|
mv a1, s4
|
||||||
|
call _memcmp
|
||||||
|
|
||||||
|
beqz a0, .Lstrings_index_end
|
||||||
|
|
||||||
|
.Lstrings_index_next:
|
||||||
|
# Advance the pointer, reduce the length.
|
||||||
|
lw a2, (s2)
|
||||||
|
addi s2, s2, 4
|
||||||
|
add s2, s2, a2
|
||||||
|
addi s1, s1, -1
|
||||||
|
j .Lstrings_index_loop
|
||||||
|
|
||||||
|
.Lstrings_index_missing:
|
||||||
|
li s5, 0
|
||||||
|
|
||||||
|
.Lstrings_index_end:
|
||||||
|
mv a0, s5
|
||||||
|
|
||||||
|
lw s1, 20(sp)
|
||||||
|
lw s2, 16(sp)
|
||||||
|
lw s3, 12(sp)
|
||||||
|
lw s4, 8(sp)
|
||||||
|
lw s5, 4(sp)
|
||||||
|
|
||||||
|
# Epilogue.
|
||||||
|
lw ra, 28(sp)
|
||||||
|
lw s0, 24(sp)
|
||||||
|
add sp, sp, 32
|
||||||
|
ret
|
||||||
|
|
||||||
|
# Compares two strings for equality.
|
||||||
|
#
|
||||||
|
# Parameters:
|
||||||
|
# a0 - Length of the first string.
|
||||||
|
# a1 - Pointer to the first string.
|
||||||
|
# a2 - Length of the second string.
|
||||||
|
# a3 - Pointer to the second string.
|
||||||
|
#
|
||||||
|
# Sets a0 to 1 if the string are equal, to 0 if not.
|
||||||
|
.type _string_equal, @function
|
||||||
|
_string_equal:
|
||||||
|
# Prologue.
|
||||||
|
addi sp, sp, -32
|
||||||
|
sw ra, 28(sp)
|
||||||
|
sw s0, 24(sp)
|
||||||
|
addi s0, sp, 32
|
||||||
|
|
||||||
|
# Compare string lengths.
|
||||||
|
bne a0, a2, .Lstring_equal_not_found
|
||||||
|
|
||||||
|
# If lengths match, compare the content.
|
||||||
|
mv a0, a1
|
||||||
|
mv a1, a3
|
||||||
|
# a2 is already set to the length.
|
||||||
|
call _memcmp
|
||||||
|
|
||||||
|
bnez a0, .Lstring_equal_not_found
|
||||||
|
|
||||||
|
li a0, 1
|
||||||
|
j .Lstring_equal_end
|
||||||
|
|
||||||
|
.Lstring_equal_not_found:
|
||||||
|
mv a0, zero
|
||||||
|
|
||||||
|
.Lstring_equal_end:
|
||||||
|
# Epilogue.
|
||||||
|
lw ra, 28(sp)
|
||||||
|
lw s0, 24(sp)
|
||||||
|
addi sp, sp, 32
|
||||||
|
ret
|
||||||
|
|
||||||
|
# Sets a0 to the mapping address.
|
||||||
|
.type _mmap, @function
|
||||||
|
_mmap:
|
||||||
|
li a0, 0 # Address at which to create the mapping.
|
||||||
|
li a1, 4096 # The length of the mapping.
|
||||||
|
li a2, PROT_READ | PROT_WRITE # Protection flags.
|
||||||
|
li a3, MAP_ANONYMOUS | MAP_PRIVATE # The mapping is not backed by a file.
|
||||||
|
li a4, -1 # File descriptor.
|
||||||
|
li a5, 0 # Page offset.
|
||||||
|
li a7, SYS_MMAP2
|
||||||
|
ecall
|
||||||
|
|
||||||
|
ret
|
||||||
66
boot/definitions.inc
Normal file
66
boot/definitions.inc
Normal file
@ -0,0 +1,66 @@
|
|||||||
|
# This Source Code Form is subject to the terms of the Mozilla Public License,
|
||||||
|
# v. 2.0. If a copy of the MPL was not distributed with this file, You can
|
||||||
|
# obtain one at https://mozilla.org/MPL/2.0/.
|
||||||
|
|
||||||
|
#
|
||||||
|
# Tokens.
|
||||||
|
#
|
||||||
|
|
||||||
|
# The constant should match the index in the keywords array in tokenizer.s.
|
||||||
|
|
||||||
|
.equ TOKEN_PROGRAM, 1
|
||||||
|
.equ TOKEN_IMPORT, 2
|
||||||
|
.equ TOKEN_CONST, 3
|
||||||
|
.equ TOKEN_VAR, 4
|
||||||
|
.equ TOKEN_IF, 5
|
||||||
|
.equ TOKEN_THEN, 6
|
||||||
|
.equ TOKEN_ELSIF, 7
|
||||||
|
.equ TOKEN_ELSE, 8
|
||||||
|
.equ TOKEN_WHILE, 9
|
||||||
|
.equ TOKEN_DO, 10
|
||||||
|
.equ TOKEN_PROC, 11
|
||||||
|
.equ TOKEN_BEGIN, 12
|
||||||
|
.equ TOKEN_END, 13
|
||||||
|
.equ TOKEN_TYPE, 14
|
||||||
|
.equ TOKEN_RECORD, 15
|
||||||
|
.equ TOKEN_UNION, 16
|
||||||
|
.equ TOKEN_TRUE, 17
|
||||||
|
.equ TOKEN_FALSE, 18
|
||||||
|
.equ TOKEN_NIL, 19
|
||||||
|
.equ TOKEN_XOR, 20
|
||||||
|
.equ TOKEN_OR, 21
|
||||||
|
.equ TOKEN_RETURN, 22
|
||||||
|
.equ TOKEN_CAST, 23
|
||||||
|
.equ TOKEN_GOTO, 24
|
||||||
|
.equ TOKEN_CASE, 25
|
||||||
|
.equ TOKEN_OF, 26
|
||||||
|
|
||||||
|
.equ TOKEN_IDENTIFIER, 27
|
||||||
|
# The constant should match the character index in the byte_keywords string.
|
||||||
|
|
||||||
|
.equ TOKEN_AND, TOKEN_IDENTIFIER + 1
|
||||||
|
.equ TOKEN_DOT, TOKEN_IDENTIFIER + 2
|
||||||
|
.equ TOKEN_COMMA, TOKEN_IDENTIFIER + 3
|
||||||
|
.equ TOKEN_COLON, TOKEN_IDENTIFIER + 4
|
||||||
|
.equ TOKEN_SEMICOLON, TOKEN_IDENTIFIER + 5
|
||||||
|
.equ TOKEN_LEFT_PAREN, TOKEN_IDENTIFIER + 6
|
||||||
|
.equ TOKEN_RIGHT_PAREN, TOKEN_IDENTIFIER + 7
|
||||||
|
.equ TOKEN_LEFT_BRACKET, TOKEN_IDENTIFIER + 8
|
||||||
|
.equ TOKEN_RIGHT_BRACKET, TOKEN_IDENTIFIER + 9
|
||||||
|
.equ TOKEN_HAT, TOKEN_IDENTIFIER + 10
|
||||||
|
.equ TOKEN_EQUALS, TOKEN_IDENTIFIER + 11
|
||||||
|
.equ TOKEN_PLUS, TOKEN_IDENTIFIER + 12
|
||||||
|
.equ TOKEN_MINUS, TOKEN_IDENTIFIER + 13
|
||||||
|
.equ TOKEN_ASTERISK, TOKEN_IDENTIFIER + 14
|
||||||
|
.equ TOKEN_AT, TOKEN_IDENTIFIER + 15
|
||||||
|
|
||||||
|
.equ TOKEN_ASSIGN, 43
|
||||||
|
.equ TOKEN_INTEGER, 44
|
||||||
|
|
||||||
|
#
|
||||||
|
# Symbols.
|
||||||
|
#
|
||||||
|
.equ TYPE_PRIMITIVE, 0x01
|
||||||
|
.equ TYPE_POINTER, 0x02
|
||||||
|
.equ INFO_PARAMETER, 0x10
|
||||||
|
.equ INFO_LOCAL, 0x20
|
||||||
@ -1,62 +0,0 @@
|
|||||||
/* Dependency graph analysis.
|
|
||||||
Copyright (C) 2025 Free Software Foundation, Inc.
|
|
||||||
|
|
||||||
GCC 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.
|
|
||||||
|
|
||||||
GCC 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 GCC; see the file COPYING3. If not see
|
|
||||||
<http://www.gnu.org/licenses/>. */
|
|
||||||
|
|
||||||
#include "elna/boot/dependency.h"
|
|
||||||
|
|
||||||
#include "elna/boot/driver.h"
|
|
||||||
#include "parser.hh"
|
|
||||||
|
|
||||||
namespace elna::boot
|
|
||||||
{
|
|
||||||
dependency_graph::dependency_graph()
|
|
||||||
{
|
|
||||||
}
|
|
||||||
|
|
||||||
dependency_graph::dependency_graph(error_list&& errors)
|
|
||||||
: m_errors(std::move(errors))
|
|
||||||
{
|
|
||||||
}
|
|
||||||
|
|
||||||
bool dependency_graph::has_errors() const
|
|
||||||
{
|
|
||||||
return !errors().empty();
|
|
||||||
}
|
|
||||||
|
|
||||||
const error_list& dependency_graph::errors() const
|
|
||||||
{
|
|
||||||
return m_errors;
|
|
||||||
}
|
|
||||||
|
|
||||||
dependency_graph read_sources(std::istream& entry_point, const char *entry_path)
|
|
||||||
{
|
|
||||||
driver parse_driver{ entry_path };
|
|
||||||
lexer tokenizer(entry_point);
|
|
||||||
yy::parser parser(tokenizer, parse_driver);
|
|
||||||
|
|
||||||
if (parser())
|
|
||||||
{
|
|
||||||
return dependency_graph(std::move(parse_driver.errors()));
|
|
||||||
}
|
|
||||||
else
|
|
||||||
{
|
|
||||||
dependency_graph outcome;
|
|
||||||
outcome.modules.emplace_back(std::move(parse_driver.tree));
|
|
||||||
|
|
||||||
return outcome;
|
|
||||||
}
|
|
||||||
}
|
|
||||||
}
|
|
||||||
124
boot/driver.cc
124
boot/driver.cc
@ -1,124 +0,0 @@
|
|||||||
/* Parsing driver.
|
|
||||||
Copyright (C) 2025 Free Software Foundation, Inc.
|
|
||||||
|
|
||||||
GCC 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.
|
|
||||||
|
|
||||||
GCC 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 GCC; see the file COPYING3. If not see
|
|
||||||
<http://www.gnu.org/licenses/>. */
|
|
||||||
|
|
||||||
#include "elna/boot/driver.h"
|
|
||||||
|
|
||||||
namespace elna::boot
|
|
||||||
{
|
|
||||||
position make_position(const yy::location& location)
|
|
||||||
{
|
|
||||||
position result;
|
|
||||||
result.line = static_cast<std::size_t>(location.begin.line);
|
|
||||||
result.column = static_cast<std::size_t>(location.begin.column);
|
|
||||||
|
|
||||||
return result;
|
|
||||||
}
|
|
||||||
|
|
||||||
syntax_error::syntax_error(const std::string& message,
|
|
||||||
const char *input_file, const yy::location& location)
|
|
||||||
: error(input_file, make_position(location)), message(message)
|
|
||||||
{
|
|
||||||
}
|
|
||||||
|
|
||||||
std::string syntax_error::what() const
|
|
||||||
{
|
|
||||||
return message;
|
|
||||||
}
|
|
||||||
|
|
||||||
driver::driver(const char *input_file)
|
|
||||||
: error_container(input_file)
|
|
||||||
{
|
|
||||||
}
|
|
||||||
|
|
||||||
char escape_char(char escape)
|
|
||||||
{
|
|
||||||
switch (escape)
|
|
||||||
{
|
|
||||||
case 'n':
|
|
||||||
return '\n';
|
|
||||||
case 'a':
|
|
||||||
return '\a';
|
|
||||||
case 'b':
|
|
||||||
return '\b';
|
|
||||||
case 't':
|
|
||||||
return '\t';
|
|
||||||
case 'f':
|
|
||||||
return '\f';
|
|
||||||
case 'r':
|
|
||||||
return '\r';
|
|
||||||
case 'v':
|
|
||||||
return '\v';
|
|
||||||
case '\\':
|
|
||||||
return '\\';
|
|
||||||
case '\'':
|
|
||||||
return '\'';
|
|
||||||
case '"':
|
|
||||||
return '"';
|
|
||||||
case '?':
|
|
||||||
return '\?';
|
|
||||||
case '0':
|
|
||||||
return '\0';
|
|
||||||
default:
|
|
||||||
return escape_invalid_char;
|
|
||||||
}
|
|
||||||
}
|
|
||||||
|
|
||||||
std::optional<std::string> escape_string(const char *escape)
|
|
||||||
{
|
|
||||||
std::string result;
|
|
||||||
const char *current_position = escape + 1;
|
|
||||||
|
|
||||||
while (*current_position != '\0')
|
|
||||||
{
|
|
||||||
if (*current_position == '\\' && *(current_position + 1) == 'x')
|
|
||||||
{
|
|
||||||
current_position += 2;
|
|
||||||
|
|
||||||
std::size_t processed;
|
|
||||||
char character = static_cast<char>(std::stoi(current_position, &processed, 16));
|
|
||||||
if (processed == 0)
|
|
||||||
{
|
|
||||||
return std::nullopt;
|
|
||||||
}
|
|
||||||
else
|
|
||||||
{
|
|
||||||
current_position += processed - 1;
|
|
||||||
result.push_back(character);
|
|
||||||
}
|
|
||||||
}
|
|
||||||
else if (*current_position == '\\')
|
|
||||||
{
|
|
||||||
++current_position;
|
|
||||||
|
|
||||||
char escape = escape_char(*current_position);
|
|
||||||
if (escape == escape_invalid_char)
|
|
||||||
{
|
|
||||||
return std::nullopt;
|
|
||||||
}
|
|
||||||
result.push_back(escape);
|
|
||||||
}
|
|
||||||
else
|
|
||||||
{
|
|
||||||
result.push_back(*current_position);
|
|
||||||
}
|
|
||||||
++current_position;
|
|
||||||
}
|
|
||||||
result.pop_back();
|
|
||||||
|
|
||||||
return result;
|
|
||||||
}
|
|
||||||
}
|
|
||||||
276
boot/lexer.ll
276
boot/lexer.ll
@ -1,276 +0,0 @@
|
|||||||
/* Lexical analyzer.
|
|
||||||
Copyright (C) 2025 Free Software Foundation, Inc.
|
|
||||||
|
|
||||||
GCC 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.
|
|
||||||
|
|
||||||
GCC 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 GCC; see the file COPYING3. If not see
|
|
||||||
<http://www.gnu.org/licenses/>. */
|
|
||||||
|
|
||||||
%{
|
|
||||||
#define YY_NO_UNISTD_H
|
|
||||||
#define YY_USER_ACTION this->location.columns(yyleng);
|
|
||||||
|
|
||||||
#include <sstream>
|
|
||||||
#include "parser.hh"
|
|
||||||
|
|
||||||
#undef YY_DECL
|
|
||||||
#define YY_DECL yy::parser::symbol_type elna::boot::lexer::lex(driver& driver)
|
|
||||||
#define yyterminate() return yy::parser::make_YYEOF(this->location)
|
|
||||||
%}
|
|
||||||
|
|
||||||
%option c++ noyywrap never-interactive
|
|
||||||
%option yyclass="lexer"
|
|
||||||
|
|
||||||
%x IN_COMMENT
|
|
||||||
|
|
||||||
%%
|
|
||||||
%{
|
|
||||||
this->location.step();
|
|
||||||
%}
|
|
||||||
|
|
||||||
<IN_COMMENT>{
|
|
||||||
\*\) BEGIN(INITIAL);
|
|
||||||
[^*\n]+ ; /* Eat comment in chunks. */
|
|
||||||
\* ; /* Eat the lone star. */
|
|
||||||
\n+ {
|
|
||||||
this->location.lines(yyleng);
|
|
||||||
this->location.step();
|
|
||||||
}
|
|
||||||
}
|
|
||||||
\(\* BEGIN(IN_COMMENT);
|
|
||||||
[ \t\r] {
|
|
||||||
this->location.step();
|
|
||||||
}
|
|
||||||
\n+ {
|
|
||||||
this->location.lines(yyleng);
|
|
||||||
}
|
|
||||||
if {
|
|
||||||
return yy::parser::make_IF(this->location);
|
|
||||||
}
|
|
||||||
then {
|
|
||||||
return yy::parser::make_THEN(this->location);
|
|
||||||
}
|
|
||||||
else {
|
|
||||||
return yy::parser::make_ELSE(this->location);
|
|
||||||
}
|
|
||||||
elsif {
|
|
||||||
return yy::parser::make_ELSIF(this->location);
|
|
||||||
}
|
|
||||||
while {
|
|
||||||
return yy::parser::make_WHILE(this->location);
|
|
||||||
}
|
|
||||||
do {
|
|
||||||
return yy::parser::make_DO(this->location);
|
|
||||||
}
|
|
||||||
proc {
|
|
||||||
return yy::parser::make_PROCEDURE(this->location);
|
|
||||||
}
|
|
||||||
begin {
|
|
||||||
return yy::parser::make_BEGIN_BLOCK(this->location);
|
|
||||||
}
|
|
||||||
end {
|
|
||||||
return yy::parser::make_END_BLOCK(this->location);
|
|
||||||
}
|
|
||||||
extern {
|
|
||||||
return yy::parser::make_EXTERN(this->location);
|
|
||||||
}
|
|
||||||
const {
|
|
||||||
return yy::parser::make_CONST(this->location);
|
|
||||||
}
|
|
||||||
var {
|
|
||||||
return yy::parser::make_VAR(this->location);
|
|
||||||
}
|
|
||||||
type {
|
|
||||||
return yy::parser::make_TYPE(this->location);
|
|
||||||
}
|
|
||||||
record {
|
|
||||||
return yy::parser::make_RECORD(this->location);
|
|
||||||
}
|
|
||||||
union {
|
|
||||||
return yy::parser::make_UNION(this->location);
|
|
||||||
}
|
|
||||||
true {
|
|
||||||
return yy::parser::make_BOOLEAN(true, this->location);
|
|
||||||
}
|
|
||||||
false {
|
|
||||||
return yy::parser::make_BOOLEAN(false, this->location);
|
|
||||||
}
|
|
||||||
nil {
|
|
||||||
return yy::parser::make_NIL(this->location);
|
|
||||||
}
|
|
||||||
\& {
|
|
||||||
return yy::parser::make_AND(this->location);
|
|
||||||
}
|
|
||||||
xor {
|
|
||||||
return yy::parser::make_XOR(this->location);
|
|
||||||
}
|
|
||||||
or {
|
|
||||||
return yy::parser::make_OR(this->location);
|
|
||||||
}
|
|
||||||
\| {
|
|
||||||
return yy::parser::make_PIPE(this->location);
|
|
||||||
}
|
|
||||||
\~ {
|
|
||||||
return yy::parser::make_NOT(this->location);
|
|
||||||
}
|
|
||||||
return {
|
|
||||||
return yy::parser::make_RETURN(this->location);
|
|
||||||
}
|
|
||||||
break {
|
|
||||||
return yy::parser::make_BREAK(this->location);
|
|
||||||
}
|
|
||||||
repeat {
|
|
||||||
return yy::parser::make_REPEAT(this->location);
|
|
||||||
}
|
|
||||||
cast {
|
|
||||||
return yy::parser::make_CAST(this->location);
|
|
||||||
}
|
|
||||||
defer {
|
|
||||||
return yy::parser::make_DEFER(this->location);
|
|
||||||
}
|
|
||||||
case {
|
|
||||||
return yy::parser::make_CASE(this->location);
|
|
||||||
}
|
|
||||||
of {
|
|
||||||
return yy::parser::make_OF(this->location);
|
|
||||||
}
|
|
||||||
[A-Za-z_][A-Za-z0-9_]* {
|
|
||||||
return yy::parser::make_IDENTIFIER(yytext, this->location);
|
|
||||||
}
|
|
||||||
#[A-Za-z_][A-Za-z0-9_]* {
|
|
||||||
return yy::parser::make_TRAIT(yytext + 1, this->location);
|
|
||||||
}
|
|
||||||
[0-9]+u {
|
|
||||||
return yy::parser::make_WORD(strtoul(yytext, NULL, 10), this->location);
|
|
||||||
}
|
|
||||||
[0-9]+ {
|
|
||||||
return yy::parser::make_INTEGER(strtol(yytext, NULL, 10), this->location);
|
|
||||||
}
|
|
||||||
[0-9]+\.[0-9] {
|
|
||||||
return yy::parser::make_FLOAT(strtof(yytext, NULL), this->location);
|
|
||||||
}
|
|
||||||
'[[:print:]]' {
|
|
||||||
if (yytext[1] == '\\' || yytext[1] == '\'')
|
|
||||||
{
|
|
||||||
REJECT;
|
|
||||||
}
|
|
||||||
else
|
|
||||||
{
|
|
||||||
return yy::parser::make_CHARACTER(std::string(yytext, 1, 1), this->location);
|
|
||||||
}
|
|
||||||
}
|
|
||||||
'\\x[0-9a-fA-F]{1,2}' {
|
|
||||||
char character = static_cast<char>(std::stoi(yytext + 3, nullptr, 16));
|
|
||||||
|
|
||||||
return yy::parser::make_CHARACTER(std::string(&character, 1), this->location);
|
|
||||||
}
|
|
||||||
'\\[0nabtfrv\\'"?]' {
|
|
||||||
char escape = escape_char(yytext[2]);
|
|
||||||
if (escape == escape_invalid_char)
|
|
||||||
{
|
|
||||||
REJECT;
|
|
||||||
}
|
|
||||||
return yy::parser::make_CHARACTER(std::string(&escape, 1), this->location);
|
|
||||||
}
|
|
||||||
\"[[:print:]]*\" {
|
|
||||||
std::optional<std::string> result = escape_string(yytext);
|
|
||||||
if (!result.has_value())
|
|
||||||
{
|
|
||||||
REJECT;
|
|
||||||
}
|
|
||||||
return yy::parser::make_STRING(result.value(), this->location);
|
|
||||||
}
|
|
||||||
\( {
|
|
||||||
return yy::parser::make_LEFT_PAREN(this->location);
|
|
||||||
}
|
|
||||||
\) {
|
|
||||||
return yy::parser::make_RIGHT_PAREN(this->location);
|
|
||||||
}
|
|
||||||
\[ {
|
|
||||||
return yy::parser::make_LEFT_SQUARE(this->location);
|
|
||||||
}
|
|
||||||
\] {
|
|
||||||
return yy::parser::make_RIGHT_SQUARE(this->location);
|
|
||||||
}
|
|
||||||
\<\< {
|
|
||||||
return yy::parser::make_SHIFT_LEFT(this->location);
|
|
||||||
}
|
|
||||||
\>\> {
|
|
||||||
return yy::parser::make_SHIFT_RIGHT(this->location);
|
|
||||||
}
|
|
||||||
\>= {
|
|
||||||
return yy::parser::make_GREATER_EQUAL(this->location);
|
|
||||||
}
|
|
||||||
\<= {
|
|
||||||
return yy::parser::make_LESS_EQUAL(this->location);
|
|
||||||
}
|
|
||||||
\> {
|
|
||||||
return yy::parser::make_GREATER_THAN(this->location);
|
|
||||||
}
|
|
||||||
\< {
|
|
||||||
return yy::parser::make_LESS_THAN(this->location);
|
|
||||||
}
|
|
||||||
\<\> {
|
|
||||||
return yy::parser::make_NOT_EQUAL(this->location);
|
|
||||||
}
|
|
||||||
= {
|
|
||||||
return yy::parser::make_EQUALS(this->location);
|
|
||||||
}
|
|
||||||
; {
|
|
||||||
return yy::parser::make_SEMICOLON(this->location);
|
|
||||||
}
|
|
||||||
\. {
|
|
||||||
return yy::parser::make_DOT(this->location);
|
|
||||||
}
|
|
||||||
, {
|
|
||||||
return yy::parser::make_COMMA(this->location);
|
|
||||||
}
|
|
||||||
\+ {
|
|
||||||
return yy::parser::make_PLUS(this->location);
|
|
||||||
}
|
|
||||||
\-> {
|
|
||||||
return yy::parser::make_ARROW(this->location);
|
|
||||||
}
|
|
||||||
\- {
|
|
||||||
return yy::parser::make_MINUS(this->location);
|
|
||||||
}
|
|
||||||
\* {
|
|
||||||
return yy::parser::make_MULTIPLICATION(this->location);
|
|
||||||
}
|
|
||||||
\/ {
|
|
||||||
return yy::parser::make_DIVISION(this->location);
|
|
||||||
}
|
|
||||||
% {
|
|
||||||
return yy::parser::make_REMAINDER(this->location);
|
|
||||||
}
|
|
||||||
:= {
|
|
||||||
return yy::parser::make_ASSIGNMENT(this->location);
|
|
||||||
}
|
|
||||||
: {
|
|
||||||
return yy::parser::make_COLON(this->location);
|
|
||||||
}
|
|
||||||
\^ {
|
|
||||||
return yy::parser::make_HAT(this->location);
|
|
||||||
}
|
|
||||||
@ {
|
|
||||||
return yy::parser::make_AT(this->location);
|
|
||||||
}
|
|
||||||
! {
|
|
||||||
return yy::parser::make_EXCLAMATION(this->location);
|
|
||||||
}
|
|
||||||
. {
|
|
||||||
std::stringstream ss;
|
|
||||||
|
|
||||||
ss << "Illegal character 0x" << std::hex << static_cast<unsigned int>(yytext[0]);
|
|
||||||
driver.add_error<syntax_error>(ss.str(), driver.input_file, this->location);
|
|
||||||
}
|
|
||||||
%%
|
|
||||||
569
boot/parser.yy
569
boot/parser.yy
@ -1,569 +0,0 @@
|
|||||||
/* Syntax analyzer.
|
|
||||||
Copyright (C) 2025 Free Software Foundation, Inc.
|
|
||||||
|
|
||||||
GCC 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.
|
|
||||||
|
|
||||||
GCC 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 GCC; see the file COPYING3. If not see
|
|
||||||
<http://www.gnu.org/licenses/>. */
|
|
||||||
|
|
||||||
%require "3.4"
|
|
||||||
%language "c++"
|
|
||||||
|
|
||||||
%code {
|
|
||||||
using namespace elna;
|
|
||||||
}
|
|
||||||
|
|
||||||
%code requires {
|
|
||||||
#include <cstdint>
|
|
||||||
#include <iostream>
|
|
||||||
#include "elna/boot/driver.h"
|
|
||||||
|
|
||||||
#if !defined(yyFlexLexerOnce)
|
|
||||||
#include <FlexLexer.h>
|
|
||||||
#endif
|
|
||||||
|
|
||||||
namespace elna
|
|
||||||
{
|
|
||||||
namespace boot
|
|
||||||
{
|
|
||||||
class lexer;
|
|
||||||
}
|
|
||||||
}
|
|
||||||
}
|
|
||||||
|
|
||||||
%code provides {
|
|
||||||
namespace elna
|
|
||||||
{
|
|
||||||
namespace boot
|
|
||||||
{
|
|
||||||
|
|
||||||
class lexer: public yyFlexLexer
|
|
||||||
{
|
|
||||||
public:
|
|
||||||
yy::location location;
|
|
||||||
|
|
||||||
lexer(std::istream& arg_yyin)
|
|
||||||
: yyFlexLexer(&arg_yyin)
|
|
||||||
{
|
|
||||||
}
|
|
||||||
|
|
||||||
yy::parser::symbol_type lex(driver& driver);
|
|
||||||
};
|
|
||||||
|
|
||||||
}
|
|
||||||
}
|
|
||||||
}
|
|
||||||
|
|
||||||
%define api.token.raw
|
|
||||||
%define api.token.constructor
|
|
||||||
%define api.value.type variant
|
|
||||||
|
|
||||||
%parse-param {elna::boot::lexer& lexer}
|
|
||||||
%param {elna::boot::driver& driver}
|
|
||||||
%locations
|
|
||||||
|
|
||||||
%header
|
|
||||||
|
|
||||||
%code {
|
|
||||||
#define yylex lexer.lex
|
|
||||||
}
|
|
||||||
%start program;
|
|
||||||
|
|
||||||
%token <std::string> IDENTIFIER
|
|
||||||
%token <std::string> TRAIT
|
|
||||||
%token <std::int32_t> INTEGER
|
|
||||||
%token <std::uint32_t> WORD
|
|
||||||
%token <float> FLOAT
|
|
||||||
%token <std::string> CHARACTER
|
|
||||||
%token <std::string> STRING
|
|
||||||
%token <bool> BOOLEAN
|
|
||||||
%token LEFT_PAREN "(" RIGHT_PAREN ")" LEFT_SQUARE "[" RIGHT_SQUARE "]"
|
|
||||||
%token ASSIGNMENT ":="
|
|
||||||
ARROW "->" EXCLAMATION "!"
|
|
||||||
AT "@" HAT "^"
|
|
||||||
COLON ":" SEMICOLON ";" DOT "." COMMA ","
|
|
||||||
%token NOT "~"
|
|
||||||
CAST "cast"
|
|
||||||
NIL "nil"
|
|
||||||
CONST "const"
|
|
||||||
VAR "var"
|
|
||||||
PROCEDURE "proc"
|
|
||||||
TYPE "type"
|
|
||||||
RECORD "record"
|
|
||||||
UNION "union"
|
|
||||||
EXTERN "extern"
|
|
||||||
IF "if"
|
|
||||||
WHILE "while"
|
|
||||||
DO "do"
|
|
||||||
THEN "then"
|
|
||||||
ELSE "else"
|
|
||||||
ELSIF "elsif"
|
|
||||||
RETURN "return"
|
|
||||||
REPEAT "repeat"
|
|
||||||
BREAK "break"
|
|
||||||
BEGIN_BLOCK "begin"
|
|
||||||
END_BLOCK "end"
|
|
||||||
DEFER "defer"
|
|
||||||
CASE "case"
|
|
||||||
OF "of"
|
|
||||||
PIPE "|"
|
|
||||||
%token OR "or" AND "&" XOR "xor"
|
|
||||||
EQUALS "=" NOT_EQUAL "<>" LESS_THAN "<" GREATER_THAN ">" LESS_EQUAL "<=" GREATER_EQUAL ">="
|
|
||||||
SHIFT_LEFT "<<" SHIFT_RIGHT ">>"
|
|
||||||
PLUS "+" MINUS "-"
|
|
||||||
MULTIPLICATION "*" DIVISION "/" REMAINDER "%"
|
|
||||||
|
|
||||||
%left "or" "&" "xor"
|
|
||||||
%left "=" "<>" "<" ">" "<=" ">="
|
|
||||||
%left "<<" ">>"
|
|
||||||
%left "+" "-"
|
|
||||||
%left "*" "/" "%"
|
|
||||||
|
|
||||||
%type <elna::boot::literal_expression *> literal;
|
|
||||||
%type <std::vector<elna::boot::expression *>> case_labels;
|
|
||||||
%type <elna::boot::switch_case> switch_case;
|
|
||||||
%type <std::vector<elna::boot::switch_case>> switch_cases;
|
|
||||||
%type <elna::boot::constant_definition *> constant_definition;
|
|
||||||
%type <std::vector<elna::boot::constant_definition *>> constant_part constant_definitions;
|
|
||||||
%type <std::vector<elna::boot::variable_declaration *>> variable_declarations variable_part variable_declaration;
|
|
||||||
%type <elna::boot::type_expression *> type_expression;
|
|
||||||
%type <std::vector<elna::boot::type_expression *>> type_expressions;
|
|
||||||
%type <elna::boot::traits_expression *> traits_expression;
|
|
||||||
%type <elna::boot::expression *> expression operand simple_expression;
|
|
||||||
%type <elna::boot::unary_expression *> unary_expression;
|
|
||||||
%type <elna::boot::binary_expression *> binary_expression;
|
|
||||||
%type <std::vector<elna::boot::expression *>> expressions actual_parameter_list;
|
|
||||||
%type <elna::boot::designator_expression *> designator_expression;
|
|
||||||
%type <elna::boot::procedure_call*> call_expression;
|
|
||||||
%type <elna::boot::while_statement *> while_statement;
|
|
||||||
%type <elna::boot::return_statement *> return_statement;
|
|
||||||
%type <elna::boot::statement *> statement;
|
|
||||||
%type <std::vector<elna::boot::statement *>> statements;
|
|
||||||
%type <elna::boot::procedure_definition *> procedure_definition;
|
|
||||||
%type <std::pair<std::vector<std::string>, elna::boot::procedure_type_expression *>> procedure_heading;
|
|
||||||
%type <elna::boot::procedure_type_expression::return_t> return_declaration;
|
|
||||||
%type <std::vector<elna::boot::procedure_definition *>> procedure_definitions procedure_part;
|
|
||||||
%type <elna::boot::type_definition *> type_definition;
|
|
||||||
%type <std::vector<elna::boot::type_definition *>> type_definitions type_part;
|
|
||||||
%type <elna::boot::block *> block;
|
|
||||||
%type <elna::boot::field_declaration> field_declaration formal_parameter;
|
|
||||||
%type <std::vector<std::pair<std::string, elna::boot::type_expression *>>>
|
|
||||||
optional_fields required_fields formal_parameters;
|
|
||||||
%type <std::vector<elna::boot::conditional_statements *>> elsif_then_statements elsif_do_statements;
|
|
||||||
%type <std::vector<elna::boot::statement *> *> else_statements;
|
|
||||||
%type <elna::boot::cast_expression *> cast_expression;
|
|
||||||
%type <elna::boot::identifier_definition> identifier_definition;
|
|
||||||
%type <std::vector<elna::boot::identifier_definition>> identifier_definitions;
|
|
||||||
%type <std::vector<std::string>> identifiers;
|
|
||||||
%%
|
|
||||||
program:
|
|
||||||
constant_part type_part variable_part procedure_part "begin" statements "end" "."
|
|
||||||
{
|
|
||||||
auto tree = new boot::program(boot::make_position(@5));
|
|
||||||
|
|
||||||
std::swap(tree->constants, $1);
|
|
||||||
std::swap(tree->types , $2);
|
|
||||||
std::swap(tree->variables, $3);
|
|
||||||
std::swap(tree->procedures, $4);
|
|
||||||
std::swap(tree->body, $6);
|
|
||||||
|
|
||||||
driver.tree.reset(tree);
|
|
||||||
}
|
|
||||||
block: constant_part variable_part "begin" statements "end"
|
|
||||||
{
|
|
||||||
$$ = new boot::block(boot::make_position(@3));
|
|
||||||
|
|
||||||
std::swap($$->constants, $1);
|
|
||||||
std::swap($$->variables, $2);
|
|
||||||
std::swap($$->body, $4);
|
|
||||||
}
|
|
||||||
identifier_definition:
|
|
||||||
IDENTIFIER "*" { $$ = boot::identifier_definition{ $1, true }; }
|
|
||||||
| IDENTIFIER { $$ = boot::identifier_definition{ $1, false }; }
|
|
||||||
identifier_definitions:
|
|
||||||
identifier_definition "," identifier_definitions
|
|
||||||
{
|
|
||||||
std::swap($$, $3);
|
|
||||||
$$.emplace($$.cbegin(), $1);
|
|
||||||
}
|
|
||||||
| identifier_definition { $$.emplace_back(std::move($1)); }
|
|
||||||
return_declaration:
|
|
||||||
/* proper procedure */ {}
|
|
||||||
| "->" "!" { $$ = boot::procedure_type_expression::return_t(std::monostate{}); }
|
|
||||||
| "->" type_expression { $$ = boot::procedure_type_expression::return_t($2); }
|
|
||||||
procedure_heading:
|
|
||||||
"(" formal_parameters ")" return_declaration
|
|
||||||
{
|
|
||||||
$$.second = new boot::procedure_type_expression(boot::make_position(@1), std::move($4));
|
|
||||||
for (auto& [name, type] : $2)
|
|
||||||
{
|
|
||||||
$$.first.emplace_back(std::move(name));
|
|
||||||
$$.second->parameters.push_back(type);
|
|
||||||
}
|
|
||||||
}
|
|
||||||
procedure_definition:
|
|
||||||
"proc" identifier_definition procedure_heading ";" block
|
|
||||||
{
|
|
||||||
$$ = new boot::procedure_definition(boot::make_position(@1), std::move($2), $3.second, $5);
|
|
||||||
std::swap($3.first, $$->parameter_names);
|
|
||||||
}
|
|
||||||
| "proc" identifier_definition procedure_heading ";" "extern"
|
|
||||||
{
|
|
||||||
$$ = new boot::procedure_definition(boot::make_position(@1), std::move($2), $3.second);
|
|
||||||
std::swap($3.first, $$->parameter_names);
|
|
||||||
}
|
|
||||||
procedure_definitions:
|
|
||||||
procedure_definition procedure_definitions
|
|
||||||
{
|
|
||||||
std::swap($$, $2);
|
|
||||||
$$.emplace($$.cbegin(), std::move($1));
|
|
||||||
}
|
|
||||||
| procedure_definition { $$.emplace_back(std::move($1)); }
|
|
||||||
procedure_part:
|
|
||||||
/* no procedure definitions */ {}
|
|
||||||
| procedure_definitions { std::swap($$, $1); }
|
|
||||||
call_expression: designator_expression actual_parameter_list
|
|
||||||
{
|
|
||||||
$$ = new boot::procedure_call(boot::make_position(@1), $1);
|
|
||||||
std::swap($$->arguments, $2);
|
|
||||||
}
|
|
||||||
cast_expression: "cast" "(" expression ":" type_expression ")"
|
|
||||||
{ $$ = new boot::cast_expression(boot::make_position(@1), $5, $3); }
|
|
||||||
elsif_do_statements:
|
|
||||||
"elsif" expression "do" statements elsif_do_statements
|
|
||||||
{
|
|
||||||
boot::conditional_statements *branch = new boot::conditional_statements($2, std::move($4));
|
|
||||||
std::swap($5, $$);
|
|
||||||
$$.emplace($$.begin(), branch);
|
|
||||||
}
|
|
||||||
| {}
|
|
||||||
else_statements:
|
|
||||||
"else" statements { $$ = new std::vector<boot::statement *>(std::move($2)); }
|
|
||||||
| { $$ = nullptr; }
|
|
||||||
while_statement:
|
|
||||||
"while" expression "do" statements elsif_do_statements else_statements "end"
|
|
||||||
{
|
|
||||||
boot::conditional_statements *body = new boot::conditional_statements($2, std::move($4));
|
|
||||||
$$ = new boot::while_statement(boot::make_position(@1), body, std::move($5), $6);
|
|
||||||
}
|
|
||||||
| "while" expression "," IDENTIFIER "do" statements elsif_do_statements else_statements "end"
|
|
||||||
{
|
|
||||||
boot::conditional_statements *body = new boot::conditional_statements($2, std::move($6));
|
|
||||||
$$ = new boot::while_statement(boot::make_position(@1), body, std::move($7), $4, $8);
|
|
||||||
}
|
|
||||||
elsif_then_statements:
|
|
||||||
"elsif" expression "then" statements elsif_then_statements
|
|
||||||
{
|
|
||||||
boot::conditional_statements *branch = new boot::conditional_statements($2, std::move($4));
|
|
||||||
std::swap($5, $$);
|
|
||||||
$$.emplace($$.begin(), branch);
|
|
||||||
}
|
|
||||||
| {}
|
|
||||||
return_statement:
|
|
||||||
"return" expression
|
|
||||||
{
|
|
||||||
$$ = new boot::return_statement(boot::make_position(@1), $2);
|
|
||||||
}
|
|
||||||
| "return"
|
|
||||||
{
|
|
||||||
$$ = new boot::return_statement(boot::make_position(@1));
|
|
||||||
}
|
|
||||||
literal:
|
|
||||||
INTEGER { $$ = new boot::literal<std::int32_t>(boot::make_position(@1), $1); }
|
|
||||||
| WORD { $$ = new boot::literal<std::uint32_t>(boot::make_position(@1), $1); }
|
|
||||||
| FLOAT { $$ = new boot::literal<double>(boot::make_position(@1), $1); }
|
|
||||||
| BOOLEAN { $$ = new boot::literal<bool>(boot::make_position(@1), $1); }
|
|
||||||
| CHARACTER { $$ = new boot::literal<unsigned char>(boot::make_position(@1), $1.at(0)); }
|
|
||||||
| "nil" { $$ = new boot::literal<std::nullptr_t>(boot::make_position(@1), nullptr); }
|
|
||||||
| STRING { $$ = new boot::literal<std::string>(boot::make_position(@1), $1); }
|
|
||||||
traits_expression:
|
|
||||||
TRAIT "(" type_expressions ")"
|
|
||||||
{
|
|
||||||
$$ = new boot::traits_expression(boot::make_position(@1), $1);
|
|
||||||
std::swap($3, $$->parameters);
|
|
||||||
}
|
|
||||||
simple_expression:
|
|
||||||
literal { $$ = $1; }
|
|
||||||
| designator_expression { $$ = $1; }
|
|
||||||
| traits_expression { $$ = $1; }
|
|
||||||
| cast_expression { $$ = $1; }
|
|
||||||
| call_expression { $$ = $1; }
|
|
||||||
| "(" expression ")" { $$ = $2; }
|
|
||||||
operand:
|
|
||||||
unary_expression { $$ = $1; }
|
|
||||||
| simple_expression { $$ = $1; }
|
|
||||||
expression:
|
|
||||||
binary_expression { $$ = $1; }
|
|
||||||
| operand { $$ = $1; }
|
|
||||||
binary_expression:
|
|
||||||
expression "*" expression
|
|
||||||
{
|
|
||||||
$$ = new boot::binary_expression(boot::make_position(@2), $1, $3, boot::binary_operator::multiplication);
|
|
||||||
}
|
|
||||||
| expression "/" expression
|
|
||||||
{
|
|
||||||
$$ = new boot::binary_expression(boot::make_position(@2), $1, $3, boot::binary_operator::division);
|
|
||||||
}
|
|
||||||
| expression "%" expression
|
|
||||||
{
|
|
||||||
$$ = new boot::binary_expression(boot::make_position(@2), $1, $3, boot::binary_operator::remainder);
|
|
||||||
}
|
|
||||||
| expression "+" expression
|
|
||||||
{
|
|
||||||
$$ = new boot::binary_expression(boot::make_position(@2), $1, $3, boot::binary_operator::sum);
|
|
||||||
}
|
|
||||||
| expression "-" expression
|
|
||||||
{
|
|
||||||
$$ = new boot::binary_expression(boot::make_position(@2), $1, $3, boot::binary_operator::subtraction);
|
|
||||||
}
|
|
||||||
| expression "=" expression
|
|
||||||
{
|
|
||||||
$$ = new boot::binary_expression(boot::make_position(@2), $1, $3, boot::binary_operator::equals);
|
|
||||||
}
|
|
||||||
| expression "<>" expression
|
|
||||||
{
|
|
||||||
$$ = new boot::binary_expression(boot::make_position(@2), $1, $3, boot::binary_operator::not_equals);
|
|
||||||
}
|
|
||||||
| expression "<" expression
|
|
||||||
{
|
|
||||||
$$ = new boot::binary_expression(boot::make_position(@2), $1, $3, boot::binary_operator::less);
|
|
||||||
}
|
|
||||||
| expression ">" expression
|
|
||||||
{
|
|
||||||
$$ = new boot::binary_expression(boot::make_position(@2), $1, $3, boot::binary_operator::greater);
|
|
||||||
}
|
|
||||||
| expression "<=" expression
|
|
||||||
{
|
|
||||||
$$ = new boot::binary_expression(boot::make_position(@2), $1, $3,
|
|
||||||
boot::binary_operator::less_equal);
|
|
||||||
}
|
|
||||||
| expression ">=" expression
|
|
||||||
{
|
|
||||||
$$ = new boot::binary_expression(boot::make_position(@2), $1, $3, boot::binary_operator::greater_equal);
|
|
||||||
}
|
|
||||||
| expression "&" expression
|
|
||||||
{
|
|
||||||
$$ = new boot::binary_expression(boot::make_position(@2), $1, $3, boot::binary_operator::conjunction);
|
|
||||||
}
|
|
||||||
| expression "or" expression
|
|
||||||
{
|
|
||||||
$$ = new boot::binary_expression(boot::make_position(@2), $1, $3, boot::binary_operator::disjunction);
|
|
||||||
}
|
|
||||||
| expression "xor" expression
|
|
||||||
{
|
|
||||||
$$ = new boot::binary_expression(boot::make_position(@2), $1, $3,
|
|
||||||
boot::binary_operator::exclusive_disjunction);
|
|
||||||
}
|
|
||||||
| expression "<<" expression
|
|
||||||
{
|
|
||||||
$$ = new boot::binary_expression(boot::make_position(@2), $1, $3, boot::binary_operator::shift_left);
|
|
||||||
}
|
|
||||||
| expression ">>" expression
|
|
||||||
{
|
|
||||||
$$ = new boot::binary_expression(boot::make_position(@2), $1, $3, boot::binary_operator::shift_right);
|
|
||||||
}
|
|
||||||
unary_expression:
|
|
||||||
"@" operand
|
|
||||||
{
|
|
||||||
$$ = new boot::unary_expression(boot::make_position(@1), $2, boot::unary_operator::reference);
|
|
||||||
}
|
|
||||||
| "~" operand
|
|
||||||
{
|
|
||||||
$$ = new boot::unary_expression(boot::make_position(@1), $2, boot::unary_operator::negation);
|
|
||||||
}
|
|
||||||
| "-" operand
|
|
||||||
{
|
|
||||||
$$ = new boot::unary_expression(boot::make_position(@1), $2, boot::unary_operator::minus);
|
|
||||||
}
|
|
||||||
expressions:
|
|
||||||
expression "," expressions
|
|
||||||
{
|
|
||||||
std::swap($$, $3);
|
|
||||||
$$.emplace($$.cbegin(), $1);
|
|
||||||
}
|
|
||||||
| expression { $$.push_back($1); }
|
|
||||||
type_expressions:
|
|
||||||
type_expression "," type_expressions
|
|
||||||
{
|
|
||||||
std::swap($$, $3);
|
|
||||||
$$.emplace($$.cbegin(), $1);
|
|
||||||
}
|
|
||||||
| type_expression { $$.push_back($1); }
|
|
||||||
designator_expression:
|
|
||||||
simple_expression "[" expression "]"
|
|
||||||
{ $$ = new boot::array_access_expression(boot::make_position(@2), $1, $3); }
|
|
||||||
| simple_expression "." IDENTIFIER
|
|
||||||
{ $$ = new boot::field_access_expression(boot::make_position(@2), $1, $3); }
|
|
||||||
| simple_expression "^"
|
|
||||||
{ $$ = new boot::dereference_expression(boot::make_position(@1), $1); }
|
|
||||||
| IDENTIFIER
|
|
||||||
{ $$ = new boot::variable_expression(boot::make_position(@1), $1); }
|
|
||||||
statement:
|
|
||||||
designator_expression ":=" expression
|
|
||||||
{ $$ = new boot::assign_statement(boot::make_position(@1), $1, $3); }
|
|
||||||
| while_statement { $$ = $1; }
|
|
||||||
| "if" expression "then" statements elsif_then_statements else_statements "end"
|
|
||||||
{
|
|
||||||
boot::conditional_statements *then = new boot::conditional_statements($2, std::move($4));
|
|
||||||
$$ = new boot::if_statement(boot::make_position(@1), then, std::move($5), $6);
|
|
||||||
}
|
|
||||||
| return_statement { $$ = $1; }
|
|
||||||
| "break" IDENTIFIER
|
|
||||||
{ $$ = new boot::escape_statement(boot::make_position(@1), boot::escape_direction::end, $2); }
|
|
||||||
| "repeat" IDENTIFIER
|
|
||||||
{ $$ = new boot::escape_statement(boot::make_position(@1), boot::escape_direction::begin, $2); }
|
|
||||||
| call_expression { $$ = $1; }
|
|
||||||
| "defer" statements "end" { $$ = new boot::defer_statement(boot::make_position(@1), std::move($2)); }
|
|
||||||
| "case" expression "of" switch_cases else_statements "end"
|
|
||||||
{ $$ = new boot::case_statement(boot::make_position(@1), $2, std::move($4), $5); }
|
|
||||||
switch_case: case_labels ":" statements { $$ = { .labels = std::move($1), .statements = std::move($3) }; }
|
|
||||||
switch_cases:
|
|
||||||
switch_case "|" switch_cases
|
|
||||||
{
|
|
||||||
std::swap($$, $3);
|
|
||||||
$$.emplace($$.cbegin(), $1);
|
|
||||||
}
|
|
||||||
| switch_case { $$.push_back($1); }
|
|
||||||
case_labels:
|
|
||||||
expression "," case_labels
|
|
||||||
{
|
|
||||||
std::swap($$, $3);
|
|
||||||
$$.emplace($$.cbegin(), $1);
|
|
||||||
}
|
|
||||||
| expression { $$.push_back($1); }
|
|
||||||
statements:
|
|
||||||
statement ";" statements
|
|
||||||
{
|
|
||||||
std::swap($$, $3);
|
|
||||||
$$.insert($$.cbegin(), $1);
|
|
||||||
}
|
|
||||||
| statement { $$.push_back($1); }
|
|
||||||
| /* no statements */ {}
|
|
||||||
field_declaration:
|
|
||||||
IDENTIFIER ":" type_expression { $$ = std::make_pair($1, $3); }
|
|
||||||
required_fields:
|
|
||||||
field_declaration ";" required_fields
|
|
||||||
{
|
|
||||||
std::swap($$, $3);
|
|
||||||
$$.emplace($$.cbegin(), $1);
|
|
||||||
}
|
|
||||||
| field_declaration { $$.emplace_back($1); }
|
|
||||||
optional_fields:
|
|
||||||
required_fields { std::swap($$, $1); }
|
|
||||||
| /* no fields */ {}
|
|
||||||
type_expression:
|
|
||||||
"[" INTEGER "]" type_expression
|
|
||||||
{
|
|
||||||
$$ = new boot::array_type_expression(boot::make_position(@1), $4, $2);
|
|
||||||
}
|
|
||||||
| "^" type_expression
|
|
||||||
{
|
|
||||||
$$ = new boot::pointer_type_expression(boot::make_position(@1), $2);
|
|
||||||
}
|
|
||||||
| "record" optional_fields "end"
|
|
||||||
{
|
|
||||||
$$ = new boot::record_type_expression(boot::make_position(@1), std::move($2));
|
|
||||||
}
|
|
||||||
| "union" required_fields "end"
|
|
||||||
{
|
|
||||||
$$ = new boot::union_type_expression(boot::make_position(@1), std::move($2));
|
|
||||||
}
|
|
||||||
| "proc" "(" type_expressions ")" return_declaration
|
|
||||||
{
|
|
||||||
auto result = new boot::procedure_type_expression(boot::make_position(@1), std::move($5));
|
|
||||||
std::swap(result->parameters, $3);
|
|
||||||
$$ = result;
|
|
||||||
}
|
|
||||||
| "(" identifiers ")"
|
|
||||||
{
|
|
||||||
$$ = new boot::enumeration_type_expression(boot::make_position(@1), std::move($2));
|
|
||||||
}
|
|
||||||
| IDENTIFIER
|
|
||||||
{
|
|
||||||
$$ = new boot::named_type_expression(boot::make_position(@1), $1);
|
|
||||||
}
|
|
||||||
identifiers:
|
|
||||||
IDENTIFIER "," identifiers
|
|
||||||
{
|
|
||||||
std::swap($$, $3);
|
|
||||||
$$.emplace($$.cbegin(), std::move($1));
|
|
||||||
}
|
|
||||||
| IDENTIFIER { $$.emplace_back(std::move($1)); }
|
|
||||||
variable_declaration: identifier_definitions ":" type_expression
|
|
||||||
{
|
|
||||||
std::shared_ptr<boot::type_expression> shared_type{ $3 };
|
|
||||||
|
|
||||||
for (boot::identifier_definition& identifier : $1)
|
|
||||||
{
|
|
||||||
boot::variable_declaration *declaration = new boot::variable_declaration(
|
|
||||||
boot::make_position(@2), std::move(identifier), shared_type);
|
|
||||||
$$.push_back(declaration);
|
|
||||||
}
|
|
||||||
}
|
|
||||||
variable_declarations:
|
|
||||||
/* no variable declarations */ {}
|
|
||||||
| variable_declaration variable_declarations
|
|
||||||
{
|
|
||||||
std::swap($$, $1);
|
|
||||||
$$.reserve($$.size() + $2.size());
|
|
||||||
$$.insert(std::end($$), std::begin($2), std::end($2));
|
|
||||||
}
|
|
||||||
variable_part:
|
|
||||||
/* no variable declarations */ {}
|
|
||||||
| "var" variable_declarations { std::swap($$, $2); }
|
|
||||||
constant_definition: identifier_definition ":=" expression
|
|
||||||
{
|
|
||||||
$$ = new boot::constant_definition(boot::make_position(@1), std::move($1), $3);
|
|
||||||
}
|
|
||||||
constant_definitions:
|
|
||||||
constant_definition constant_definitions
|
|
||||||
{
|
|
||||||
std::swap($$, $2);
|
|
||||||
$$.insert($$.cbegin(), $1);
|
|
||||||
}
|
|
||||||
| /* no constant definitions */ {}
|
|
||||||
constant_part:
|
|
||||||
/* no constant definitions */ {}
|
|
||||||
| "const" constant_definitions { std::swap($$, $2); }
|
|
||||||
type_definition: identifier_definition "=" type_expression
|
|
||||||
{
|
|
||||||
$$ = new boot::type_definition(boot::make_position(@1), std::move($1), $3);
|
|
||||||
}
|
|
||||||
type_definitions:
|
|
||||||
type_definition type_definitions
|
|
||||||
{
|
|
||||||
std::swap($$, $2);
|
|
||||||
$$.insert($$.cbegin(), $1);
|
|
||||||
}
|
|
||||||
| /* no type definitions */ {}
|
|
||||||
type_part:
|
|
||||||
/* no type definitions */ {}
|
|
||||||
| "type" type_definitions { std::swap($$, $2); }
|
|
||||||
formal_parameter:
|
|
||||||
IDENTIFIER ":" type_expression { $$ = std::make_pair($1, $3); }
|
|
||||||
formal_parameters:
|
|
||||||
/* no formal parameters */ {}
|
|
||||||
| formal_parameter "," formal_parameters
|
|
||||||
{
|
|
||||||
std::swap($$, $3);
|
|
||||||
$$.emplace($$.cbegin(), std::move($1));
|
|
||||||
}
|
|
||||||
| formal_parameter { $$.emplace_back(std::move($1)); }
|
|
||||||
actual_parameter_list:
|
|
||||||
"(" ")" {}
|
|
||||||
| "(" expressions ")" { std::swap($$, $2); }
|
|
||||||
%%
|
|
||||||
|
|
||||||
void yy::parser::error(const location_type& loc, const std::string& message)
|
|
||||||
{
|
|
||||||
driver.add_error<boot::syntax_error>(message, driver.input_file, loc);
|
|
||||||
}
|
|
||||||
@ -1,46 +0,0 @@
|
|||||||
/* Miscellaneous types used across stage boundaries.
|
|
||||||
Copyright (C) 2025 Free Software Foundation, Inc.
|
|
||||||
|
|
||||||
GCC 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.
|
|
||||||
|
|
||||||
GCC 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 GCC; see the file COPYING3. If not see
|
|
||||||
<http://www.gnu.org/licenses/>. */
|
|
||||||
|
|
||||||
#include "elna/boot/result.h"
|
|
||||||
|
|
||||||
namespace elna::boot
|
|
||||||
{
|
|
||||||
error::error(const char *path, const struct position position)
|
|
||||||
: position(position), path(path)
|
|
||||||
{
|
|
||||||
}
|
|
||||||
|
|
||||||
std::size_t error::line() const noexcept
|
|
||||||
{
|
|
||||||
return this->position.line;
|
|
||||||
}
|
|
||||||
|
|
||||||
std::size_t error::column() const noexcept
|
|
||||||
{
|
|
||||||
return this->position.column;
|
|
||||||
}
|
|
||||||
|
|
||||||
error_container::error_container(const char *input_file)
|
|
||||||
: input_file(input_file)
|
|
||||||
{
|
|
||||||
}
|
|
||||||
|
|
||||||
std::deque<std::unique_ptr<error>>& error_container::errors()
|
|
||||||
{
|
|
||||||
return m_errors;
|
|
||||||
}
|
|
||||||
}
|
|
||||||
403
boot/semantic.cc
403
boot/semantic.cc
@ -1,403 +0,0 @@
|
|||||||
/* Name analysis.
|
|
||||||
Copyright (C) 2025 Free Software Foundation, Inc.
|
|
||||||
|
|
||||||
GCC 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.
|
|
||||||
|
|
||||||
GCC 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 GCC; see the file COPYING3. If not see
|
|
||||||
<http://www.gnu.org/licenses/>. */
|
|
||||||
|
|
||||||
#include "elna/boot/semantic.h"
|
|
||||||
|
|
||||||
namespace elna::boot
|
|
||||||
{
|
|
||||||
undeclared_error::undeclared_error(const std::string& identifier, const char *path, const struct position position)
|
|
||||||
: error(path, position), identifier(identifier)
|
|
||||||
{
|
|
||||||
}
|
|
||||||
|
|
||||||
std::string undeclared_error::what() const
|
|
||||||
{
|
|
||||||
return "Type '" + identifier + "' not declared";
|
|
||||||
}
|
|
||||||
|
|
||||||
|
|
||||||
already_declared_error::already_declared_error(const std::string& identifier,
|
|
||||||
const char *path, const struct position position)
|
|
||||||
: error(path, position), identifier(identifier)
|
|
||||||
{
|
|
||||||
}
|
|
||||||
|
|
||||||
std::string already_declared_error::what() const
|
|
||||||
{
|
|
||||||
return "Symbol '" + identifier + "' has been already declared";
|
|
||||||
}
|
|
||||||
|
|
||||||
declaration_visitor::declaration_visitor(const char *path, std::shared_ptr<symbol_table> symbols)
|
|
||||||
: error_container(path), symbols(symbols)
|
|
||||||
{
|
|
||||||
}
|
|
||||||
|
|
||||||
procedure_type declaration_visitor::build_procedure(procedure_type_expression& type_expression)
|
|
||||||
{
|
|
||||||
procedure_type::return_t result_return;
|
|
||||||
|
|
||||||
if (type_expression.return_type.no_return)
|
|
||||||
{
|
|
||||||
result_return = procedure_type::return_t(std::monostate{});
|
|
||||||
}
|
|
||||||
else if (type_expression.return_type.proper_type != nullptr)
|
|
||||||
{
|
|
||||||
type_expression.return_type.proper_type->accept(this);
|
|
||||||
result_return = procedure_type::return_t(this->current_type);
|
|
||||||
}
|
|
||||||
else
|
|
||||||
{
|
|
||||||
result_return = procedure_type::return_t();
|
|
||||||
}
|
|
||||||
procedure_type result_type = procedure_type(result_return);
|
|
||||||
|
|
||||||
for (struct type_expression *parameter : type_expression.parameters)
|
|
||||||
{
|
|
||||||
parameter->accept(this);
|
|
||||||
result_type.parameters.push_back(this->current_type);
|
|
||||||
}
|
|
||||||
return result_type;
|
|
||||||
}
|
|
||||||
|
|
||||||
void declaration_visitor::visit(program *program)
|
|
||||||
{
|
|
||||||
for (type_definition *const type : program->types)
|
|
||||||
{
|
|
||||||
const std::string& type_identifier = type->identifier.identifier;
|
|
||||||
|
|
||||||
if (!this->unresolved.insert({ type_identifier, std::make_shared<alias_type>(type_identifier) }).second
|
|
||||||
|| this->symbols->contains(type_identifier))
|
|
||||||
{
|
|
||||||
add_error<already_declared_error>(type->identifier.identifier, this->input_file, type->position());
|
|
||||||
}
|
|
||||||
}
|
|
||||||
for (type_definition *const type : program->types)
|
|
||||||
{
|
|
||||||
type->accept(this);
|
|
||||||
}
|
|
||||||
for (auto& unresolved : this->unresolved)
|
|
||||||
{
|
|
||||||
auto info = std::make_shared<type_info>(type_info(type(unresolved.second)));
|
|
||||||
this->symbols->enter(std::move(unresolved.first), info);
|
|
||||||
}
|
|
||||||
for (variable_declaration *const variable : program->variables)
|
|
||||||
{
|
|
||||||
variable->accept(this);
|
|
||||||
}
|
|
||||||
for (procedure_definition *const procedure : program->procedures)
|
|
||||||
{
|
|
||||||
procedure->accept(this);
|
|
||||||
}
|
|
||||||
for (statement *const statement : program->body)
|
|
||||||
{
|
|
||||||
statement->accept(this);
|
|
||||||
}
|
|
||||||
}
|
|
||||||
|
|
||||||
void declaration_visitor::visit(type_definition *definition)
|
|
||||||
{
|
|
||||||
definition->body().accept(this);
|
|
||||||
auto unresolved_declaration = this->unresolved.at(definition->identifier.identifier);
|
|
||||||
|
|
||||||
unresolved_declaration->reference = this->current_type;
|
|
||||||
}
|
|
||||||
|
|
||||||
void declaration_visitor::visit(named_type_expression *type_expression)
|
|
||||||
{
|
|
||||||
auto unresolved_alias = this->unresolved.find(type_expression->name);
|
|
||||||
|
|
||||||
if (unresolved_alias != this->unresolved.end())
|
|
||||||
{
|
|
||||||
this->current_type = type(unresolved_alias->second);
|
|
||||||
}
|
|
||||||
else if (auto from_symbol_table = this->symbols->lookup(type_expression->name))
|
|
||||||
{
|
|
||||||
this->current_type = from_symbol_table->is_type()->symbol;
|
|
||||||
}
|
|
||||||
else
|
|
||||||
{
|
|
||||||
add_error<undeclared_error>(type_expression->name, this->input_file, type_expression->position());
|
|
||||||
this->current_type = type();
|
|
||||||
}
|
|
||||||
}
|
|
||||||
|
|
||||||
void declaration_visitor::visit(pointer_type_expression *type_expression)
|
|
||||||
{
|
|
||||||
type_expression->base().accept(this);
|
|
||||||
this->current_type = type(std::make_shared<pointer_type>(this->current_type));
|
|
||||||
}
|
|
||||||
|
|
||||||
void declaration_visitor::visit(array_type_expression *type_expression)
|
|
||||||
{
|
|
||||||
type_expression->base().accept(this);
|
|
||||||
this->current_type = type(std::make_shared<array_type>(this->current_type, type_expression->size));
|
|
||||||
}
|
|
||||||
|
|
||||||
void declaration_visitor::visit(record_type_expression *type_expression)
|
|
||||||
{
|
|
||||||
auto result_type = std::make_shared<record_type>();
|
|
||||||
|
|
||||||
for (auto& field : type_expression->fields)
|
|
||||||
{
|
|
||||||
field.second->accept(this);
|
|
||||||
result_type->fields.push_back(std::make_pair(field.first, this->current_type));
|
|
||||||
}
|
|
||||||
this->current_type = type(result_type);
|
|
||||||
}
|
|
||||||
|
|
||||||
void declaration_visitor::visit(union_type_expression *type_expression)
|
|
||||||
{
|
|
||||||
auto result_type = std::make_shared<union_type>();
|
|
||||||
|
|
||||||
for (const field_declaration& field : type_expression->fields)
|
|
||||||
{
|
|
||||||
field.second->accept(this);
|
|
||||||
result_type->fields.push_back(std::make_pair(field.first, this->current_type));
|
|
||||||
}
|
|
||||||
this->current_type = type(result_type);
|
|
||||||
}
|
|
||||||
|
|
||||||
void declaration_visitor::visit(procedure_type_expression *type_expression)
|
|
||||||
{
|
|
||||||
std::shared_ptr<procedure_type> result_type =
|
|
||||||
std::make_shared<procedure_type>(std::move(build_procedure(*type_expression)));
|
|
||||||
|
|
||||||
this->current_type = type(result_type);
|
|
||||||
}
|
|
||||||
|
|
||||||
void declaration_visitor::visit(enumeration_type_expression *type_expression)
|
|
||||||
{
|
|
||||||
std::shared_ptr<enumeration_type> result_type = std::make_shared<enumeration_type>(type_expression->members);
|
|
||||||
|
|
||||||
this->current_type = type(result_type);
|
|
||||||
}
|
|
||||||
|
|
||||||
void declaration_visitor::visit(variable_declaration *declaration)
|
|
||||||
{
|
|
||||||
declaration->variable_type().accept(this);
|
|
||||||
}
|
|
||||||
|
|
||||||
void declaration_visitor::visit(constant_definition *definition)
|
|
||||||
{
|
|
||||||
definition->body().accept(this);
|
|
||||||
|
|
||||||
this->symbols->enter(definition->identifier.identifier,
|
|
||||||
std::make_shared<constant_info>(this->current_literal));
|
|
||||||
}
|
|
||||||
|
|
||||||
void declaration_visitor::visit(procedure_definition *definition)
|
|
||||||
{
|
|
||||||
std::shared_ptr<procedure_info> info = std::make_shared<procedure_info>(
|
|
||||||
build_procedure(definition->heading()), definition->parameter_names);
|
|
||||||
|
|
||||||
this->symbols->enter(definition->identifier.identifier, info);
|
|
||||||
if (definition->body != nullptr)
|
|
||||||
{
|
|
||||||
definition->body->accept(this);
|
|
||||||
}
|
|
||||||
}
|
|
||||||
|
|
||||||
void declaration_visitor::visit(assign_statement *statement)
|
|
||||||
{
|
|
||||||
statement->lvalue().accept(this);
|
|
||||||
statement->rvalue().accept(this);
|
|
||||||
}
|
|
||||||
|
|
||||||
void declaration_visitor::visit(if_statement *statement)
|
|
||||||
{
|
|
||||||
statement->body().prerequisite().accept(this);
|
|
||||||
for (struct statement *const statement : statement->body().statements)
|
|
||||||
{
|
|
||||||
statement->accept(this);
|
|
||||||
}
|
|
||||||
for (const auto branch : statement->branches)
|
|
||||||
{
|
|
||||||
branch->prerequisite().accept(this);
|
|
||||||
|
|
||||||
for (struct statement *const statement : branch->statements)
|
|
||||||
{
|
|
||||||
statement->accept(this);
|
|
||||||
}
|
|
||||||
}
|
|
||||||
if (statement->alternative != nullptr)
|
|
||||||
{
|
|
||||||
for (struct statement *const statement : *statement->alternative)
|
|
||||||
{
|
|
||||||
statement->accept(this);
|
|
||||||
}
|
|
||||||
}
|
|
||||||
}
|
|
||||||
|
|
||||||
void declaration_visitor::visit(escape_statement *)
|
|
||||||
{
|
|
||||||
}
|
|
||||||
|
|
||||||
void declaration_visitor::visit(while_statement *statement)
|
|
||||||
{
|
|
||||||
statement->body().prerequisite().accept(this);
|
|
||||||
for (struct statement *const statement : statement->body().statements)
|
|
||||||
{
|
|
||||||
statement->accept(this);
|
|
||||||
}
|
|
||||||
for (const auto branch : statement->branches)
|
|
||||||
{
|
|
||||||
branch->prerequisite().accept(this);
|
|
||||||
|
|
||||||
for (struct statement *const statement : branch->statements)
|
|
||||||
{
|
|
||||||
statement->accept(this);
|
|
||||||
}
|
|
||||||
}
|
|
||||||
}
|
|
||||||
|
|
||||||
void declaration_visitor::visit(return_statement *statement)
|
|
||||||
{
|
|
||||||
if (statement->return_expression != nullptr)
|
|
||||||
{
|
|
||||||
statement->return_expression->accept(this);
|
|
||||||
}
|
|
||||||
}
|
|
||||||
|
|
||||||
void declaration_visitor::visit(defer_statement *statement)
|
|
||||||
{
|
|
||||||
for (struct statement *const statement : statement->statements)
|
|
||||||
{
|
|
||||||
statement->accept(this);
|
|
||||||
}
|
|
||||||
}
|
|
||||||
|
|
||||||
void declaration_visitor::visit(case_statement *statement)
|
|
||||||
{
|
|
||||||
statement->condition().accept(this);
|
|
||||||
for (const switch_case& case_block : statement->cases)
|
|
||||||
{
|
|
||||||
for (expression *const case_label : case_block.labels)
|
|
||||||
{
|
|
||||||
case_label->accept(this);
|
|
||||||
}
|
|
||||||
for (struct statement *const statement : case_block.statements)
|
|
||||||
{
|
|
||||||
statement->accept(this);
|
|
||||||
}
|
|
||||||
}
|
|
||||||
}
|
|
||||||
|
|
||||||
void declaration_visitor::visit(procedure_call *call)
|
|
||||||
{
|
|
||||||
call->callable().accept(this);
|
|
||||||
for (expression *const argument: call->arguments)
|
|
||||||
{
|
|
||||||
argument->accept(this);
|
|
||||||
}
|
|
||||||
}
|
|
||||||
|
|
||||||
void declaration_visitor::visit(block *block)
|
|
||||||
{
|
|
||||||
for (constant_definition *const constant : block->constants)
|
|
||||||
{
|
|
||||||
constant->accept(this);
|
|
||||||
}
|
|
||||||
for (variable_declaration *const variable : block->variables)
|
|
||||||
{
|
|
||||||
variable->accept(this);
|
|
||||||
}
|
|
||||||
for (statement *const statement : block->body)
|
|
||||||
{
|
|
||||||
statement->accept(this);
|
|
||||||
}
|
|
||||||
}
|
|
||||||
|
|
||||||
void declaration_visitor::visit(traits_expression *trait)
|
|
||||||
{
|
|
||||||
if (!trait->parameters.empty())
|
|
||||||
{
|
|
||||||
trait->parameters.front()->accept(this);
|
|
||||||
}
|
|
||||||
}
|
|
||||||
|
|
||||||
void declaration_visitor::visit(cast_expression *expression)
|
|
||||||
{
|
|
||||||
expression->value().accept(this);
|
|
||||||
expression->target().accept(this);
|
|
||||||
}
|
|
||||||
|
|
||||||
void declaration_visitor::visit(binary_expression *expression)
|
|
||||||
{
|
|
||||||
expression->lhs().accept(this);
|
|
||||||
expression->rhs().accept(this);
|
|
||||||
}
|
|
||||||
|
|
||||||
void declaration_visitor::visit(unary_expression *expression)
|
|
||||||
{
|
|
||||||
expression->operand().accept(this);
|
|
||||||
}
|
|
||||||
|
|
||||||
void declaration_visitor::visit(variable_expression *)
|
|
||||||
{
|
|
||||||
}
|
|
||||||
|
|
||||||
void declaration_visitor::visit(array_access_expression *expression)
|
|
||||||
{
|
|
||||||
expression->base().accept(this);
|
|
||||||
expression->index().accept(this);
|
|
||||||
}
|
|
||||||
|
|
||||||
void declaration_visitor::visit(field_access_expression *expression)
|
|
||||||
{
|
|
||||||
expression->base().accept(this);
|
|
||||||
}
|
|
||||||
|
|
||||||
void declaration_visitor::visit(dereference_expression *expression)
|
|
||||||
{
|
|
||||||
expression->base().accept(this);
|
|
||||||
}
|
|
||||||
|
|
||||||
void declaration_visitor::visit(literal<std::int32_t> *literal)
|
|
||||||
{
|
|
||||||
this->current_literal = literal->value;
|
|
||||||
}
|
|
||||||
|
|
||||||
void declaration_visitor::visit(literal<std::uint32_t> *literal)
|
|
||||||
{
|
|
||||||
this->current_literal = literal->value;
|
|
||||||
}
|
|
||||||
|
|
||||||
void declaration_visitor::visit(literal<double> *literal)
|
|
||||||
{
|
|
||||||
this->current_literal = literal->value;
|
|
||||||
}
|
|
||||||
|
|
||||||
void declaration_visitor::visit(literal<bool> *literal)
|
|
||||||
{
|
|
||||||
this->current_literal = literal->value;
|
|
||||||
}
|
|
||||||
|
|
||||||
void declaration_visitor::visit(literal<unsigned char> *literal)
|
|
||||||
{
|
|
||||||
this->current_literal = literal->value;
|
|
||||||
}
|
|
||||||
|
|
||||||
void declaration_visitor::visit(literal<std::nullptr_t> *literal)
|
|
||||||
{
|
|
||||||
this->current_literal = literal->value;
|
|
||||||
}
|
|
||||||
|
|
||||||
void declaration_visitor::visit(literal<std::string> *literal)
|
|
||||||
{
|
|
||||||
this->current_literal = literal->value;
|
|
||||||
}
|
|
||||||
}
|
|
||||||
1753
boot/stage1.s
Normal file
1753
boot/stage1.s
Normal file
File diff suppressed because it is too large
Load Diff
1473
boot/stage2.elna
Normal file
1473
boot/stage2.elna
Normal file
File diff suppressed because it is too large
Load Diff
359
boot/symbol.cc
359
boot/symbol.cc
@ -1,359 +0,0 @@
|
|||||||
/* Symbol definitions.
|
|
||||||
Copyright (C) 2025 Free Software Foundation, Inc.
|
|
||||||
|
|
||||||
GCC 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.
|
|
||||||
|
|
||||||
GCC 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 GCC; see the file COPYING3. If not see
|
|
||||||
<http://www.gnu.org/licenses/>. */
|
|
||||||
|
|
||||||
#include "elna/boot/symbol.h"
|
|
||||||
|
|
||||||
namespace elna::boot
|
|
||||||
{
|
|
||||||
type::type()
|
|
||||||
{
|
|
||||||
}
|
|
||||||
|
|
||||||
type::type(std::shared_ptr<alias_type> alias)
|
|
||||||
: tag(type_tag::alias), alias(alias)
|
|
||||||
{
|
|
||||||
}
|
|
||||||
|
|
||||||
type::type(std::shared_ptr<primitive_type> primitive)
|
|
||||||
: tag(type_tag::primitive), primitive(primitive)
|
|
||||||
{
|
|
||||||
}
|
|
||||||
|
|
||||||
type::type(std::shared_ptr<record_type> record)
|
|
||||||
: tag(type_tag::record), record(record)
|
|
||||||
{
|
|
||||||
}
|
|
||||||
|
|
||||||
type::type(std::shared_ptr<union_type> _union)
|
|
||||||
: tag(type_tag::_union), _union(_union)
|
|
||||||
{
|
|
||||||
}
|
|
||||||
|
|
||||||
type::type(std::shared_ptr<pointer_type> pointer)
|
|
||||||
: tag(type_tag::pointer), pointer(pointer)
|
|
||||||
{
|
|
||||||
}
|
|
||||||
|
|
||||||
type::type(std::shared_ptr<array_type> array)
|
|
||||||
: tag(type_tag::array), array(array)
|
|
||||||
{
|
|
||||||
}
|
|
||||||
|
|
||||||
type::type(std::shared_ptr<procedure_type> procedure)
|
|
||||||
: tag(type_tag::procedure), procedure(procedure)
|
|
||||||
{
|
|
||||||
}
|
|
||||||
|
|
||||||
type::type(std::shared_ptr<enumeration_type> enumeration)
|
|
||||||
: tag(type_tag::enumeration), enumeration(enumeration)
|
|
||||||
{
|
|
||||||
}
|
|
||||||
|
|
||||||
void type::copy(const type& other)
|
|
||||||
{
|
|
||||||
switch (other.tag)
|
|
||||||
{
|
|
||||||
case type_tag::empty:
|
|
||||||
break;
|
|
||||||
case type_tag::alias:
|
|
||||||
new (&alias) std::weak_ptr<alias_type>(other.alias);
|
|
||||||
break;
|
|
||||||
case type_tag::primitive:
|
|
||||||
new (&primitive) std::shared_ptr<primitive_type>(other.primitive);
|
|
||||||
break;
|
|
||||||
case type_tag::record:
|
|
||||||
new (&record) std::shared_ptr<record_type>(other.record);
|
|
||||||
break;
|
|
||||||
case type_tag::_union:
|
|
||||||
new (&_union) std::shared_ptr<union_type>(other._union);
|
|
||||||
break;
|
|
||||||
case type_tag::pointer:
|
|
||||||
new (&pointer) std::shared_ptr<pointer_type>(other.pointer);
|
|
||||||
break;
|
|
||||||
case type_tag::array:
|
|
||||||
new (&array) std::shared_ptr<array_type>(other.array);
|
|
||||||
break;
|
|
||||||
case type_tag::procedure:
|
|
||||||
new (&procedure) std::shared_ptr<procedure_type>(other.procedure);
|
|
||||||
break;
|
|
||||||
case type_tag::enumeration:
|
|
||||||
new (&enumeration) std::shared_ptr<enumeration_type>(other.enumeration);
|
|
||||||
break;
|
|
||||||
}
|
|
||||||
}
|
|
||||||
|
|
||||||
type::type(const type& other)
|
|
||||||
: tag(other.tag)
|
|
||||||
{
|
|
||||||
copy(other);
|
|
||||||
}
|
|
||||||
|
|
||||||
void type::move(type&& other)
|
|
||||||
{
|
|
||||||
switch (other.tag)
|
|
||||||
{
|
|
||||||
case type_tag::empty:
|
|
||||||
break;
|
|
||||||
case type_tag::alias:
|
|
||||||
new (&alias) std::weak_ptr<alias_type>(std::move(other.alias));
|
|
||||||
break;
|
|
||||||
case type_tag::primitive:
|
|
||||||
new (&primitive) std::shared_ptr<primitive_type>(std::move(other.primitive));
|
|
||||||
break;
|
|
||||||
case type_tag::record:
|
|
||||||
new (&record) std::shared_ptr<record_type>(std::move(other.record));
|
|
||||||
break;
|
|
||||||
case type_tag::_union:
|
|
||||||
new (&_union) std::shared_ptr<union_type>(std::move(other._union));
|
|
||||||
break;
|
|
||||||
case type_tag::pointer:
|
|
||||||
new (&pointer) std::shared_ptr<pointer_type>(std::move(other.pointer));
|
|
||||||
break;
|
|
||||||
case type_tag::array:
|
|
||||||
new (&array) std::shared_ptr<array_type>(std::move(other.array));
|
|
||||||
break;
|
|
||||||
case type_tag::procedure:
|
|
||||||
new (&procedure) std::shared_ptr<procedure_type>(std::move(other.procedure));
|
|
||||||
break;
|
|
||||||
case type_tag::enumeration:
|
|
||||||
new (&enumeration) std::shared_ptr<enumeration_type>(std::move(other.enumeration));
|
|
||||||
break;
|
|
||||||
}
|
|
||||||
}
|
|
||||||
|
|
||||||
type& type::operator=(const type& other)
|
|
||||||
{
|
|
||||||
this->~type();
|
|
||||||
this->tag = other.tag;
|
|
||||||
copy(other);
|
|
||||||
return *this;
|
|
||||||
}
|
|
||||||
|
|
||||||
type::type(type&& other)
|
|
||||||
: tag(other.tag)
|
|
||||||
{
|
|
||||||
move(std::move(other));
|
|
||||||
}
|
|
||||||
|
|
||||||
type& type::operator=(type&& other)
|
|
||||||
{
|
|
||||||
this->~type();
|
|
||||||
this->tag = other.tag;
|
|
||||||
move(std::move(other));
|
|
||||||
return *this;
|
|
||||||
}
|
|
||||||
|
|
||||||
bool type::operator==(const std::nullptr_t&)
|
|
||||||
{
|
|
||||||
return empty();
|
|
||||||
}
|
|
||||||
|
|
||||||
type::~type()
|
|
||||||
{
|
|
||||||
switch (tag)
|
|
||||||
{
|
|
||||||
case type_tag::empty:
|
|
||||||
break;
|
|
||||||
case type_tag::alias:
|
|
||||||
this->alias.~weak_ptr<alias_type>();
|
|
||||||
break;
|
|
||||||
case type_tag::primitive:
|
|
||||||
this->primitive.~shared_ptr<primitive_type>();
|
|
||||||
break;
|
|
||||||
case type_tag::record:
|
|
||||||
this->record.~shared_ptr<record_type>();
|
|
||||||
break;
|
|
||||||
case type_tag::_union:
|
|
||||||
this->_union.~shared_ptr<union_type>();
|
|
||||||
break;
|
|
||||||
case type_tag::pointer:
|
|
||||||
this->pointer.~shared_ptr<pointer_type>();
|
|
||||||
break;
|
|
||||||
case type_tag::array:
|
|
||||||
this->array.~shared_ptr<array_type>();
|
|
||||||
break;
|
|
||||||
case type_tag::procedure:
|
|
||||||
this->procedure.~shared_ptr<procedure_type>();
|
|
||||||
break;
|
|
||||||
case type_tag::enumeration:
|
|
||||||
this->enumeration.~shared_ptr<enumeration_type>();
|
|
||||||
break;
|
|
||||||
}
|
|
||||||
}
|
|
||||||
|
|
||||||
template<>
|
|
||||||
std::shared_ptr<alias_type> type::get<alias_type>() const
|
|
||||||
{
|
|
||||||
return tag == type_tag::alias ? this->alias.lock() : nullptr;
|
|
||||||
}
|
|
||||||
|
|
||||||
template<>
|
|
||||||
std::shared_ptr<primitive_type> type::get<primitive_type>() const
|
|
||||||
{
|
|
||||||
return tag == type_tag::primitive ? this->primitive : nullptr;
|
|
||||||
}
|
|
||||||
|
|
||||||
template<>
|
|
||||||
std::shared_ptr<record_type> type::get<record_type>() const
|
|
||||||
{
|
|
||||||
return tag == type_tag::record ? this->record : nullptr;
|
|
||||||
}
|
|
||||||
|
|
||||||
template<>
|
|
||||||
std::shared_ptr<union_type> type::get<union_type>() const
|
|
||||||
{
|
|
||||||
return tag == type_tag::_union ? this->_union : nullptr;
|
|
||||||
}
|
|
||||||
|
|
||||||
template<>
|
|
||||||
std::shared_ptr<pointer_type> type::get<pointer_type>() const
|
|
||||||
{
|
|
||||||
return tag == type_tag::pointer ? this->pointer : nullptr;
|
|
||||||
}
|
|
||||||
|
|
||||||
template<>
|
|
||||||
std::shared_ptr<array_type> type::get<array_type>() const
|
|
||||||
{
|
|
||||||
return tag == type_tag::array ? this->array : nullptr;
|
|
||||||
}
|
|
||||||
|
|
||||||
template<>
|
|
||||||
std::shared_ptr<procedure_type> type::get<procedure_type>() const
|
|
||||||
{
|
|
||||||
return tag == type_tag::procedure ? this->procedure : nullptr;
|
|
||||||
}
|
|
||||||
|
|
||||||
template<>
|
|
||||||
std::shared_ptr<enumeration_type> type::get<enumeration_type>() const
|
|
||||||
{
|
|
||||||
return tag == type_tag::enumeration ? this->enumeration : nullptr;
|
|
||||||
}
|
|
||||||
|
|
||||||
bool type::empty() const
|
|
||||||
{
|
|
||||||
return tag == type_tag::empty;
|
|
||||||
}
|
|
||||||
|
|
||||||
alias_type::alias_type(const std::string& name)
|
|
||||||
: name(name), reference()
|
|
||||||
{
|
|
||||||
}
|
|
||||||
|
|
||||||
pointer_type::pointer_type(type base)
|
|
||||||
: base(base)
|
|
||||||
{
|
|
||||||
}
|
|
||||||
|
|
||||||
array_type::array_type(type base, std::uint64_t size)
|
|
||||||
: base(base), size(size)
|
|
||||||
{
|
|
||||||
}
|
|
||||||
|
|
||||||
primitive_type::primitive_type(const std::string& identifier)
|
|
||||||
: identifier(identifier)
|
|
||||||
{
|
|
||||||
}
|
|
||||||
|
|
||||||
procedure_type::procedure_type(return_t return_type)
|
|
||||||
: return_type(return_type)
|
|
||||||
{
|
|
||||||
}
|
|
||||||
|
|
||||||
enumeration_type::enumeration_type(const std::vector<std::string>& members)
|
|
||||||
: members(members)
|
|
||||||
{
|
|
||||||
}
|
|
||||||
|
|
||||||
info::~info()
|
|
||||||
{
|
|
||||||
}
|
|
||||||
|
|
||||||
std::shared_ptr<type_info> info::is_type()
|
|
||||||
{
|
|
||||||
return nullptr;
|
|
||||||
}
|
|
||||||
|
|
||||||
std::shared_ptr<procedure_info> info::is_procedure()
|
|
||||||
{
|
|
||||||
return nullptr;
|
|
||||||
}
|
|
||||||
|
|
||||||
std::shared_ptr<constant_info> info::is_constant()
|
|
||||||
{
|
|
||||||
return nullptr;
|
|
||||||
}
|
|
||||||
|
|
||||||
std::shared_ptr<variable_info> info::is_variable()
|
|
||||||
{
|
|
||||||
return nullptr;
|
|
||||||
}
|
|
||||||
|
|
||||||
type_info::type_info(const type symbol)
|
|
||||||
: symbol(symbol)
|
|
||||||
{
|
|
||||||
}
|
|
||||||
|
|
||||||
std::shared_ptr<type_info> type_info::is_type()
|
|
||||||
{
|
|
||||||
return std::static_pointer_cast<type_info>(shared_from_this());
|
|
||||||
}
|
|
||||||
|
|
||||||
procedure_info::procedure_info(const procedure_type symbol, const std::vector<std::string> names)
|
|
||||||
: symbol(symbol), names(names)
|
|
||||||
{
|
|
||||||
}
|
|
||||||
|
|
||||||
std::shared_ptr<procedure_info> procedure_info::is_procedure()
|
|
||||||
{
|
|
||||||
return std::static_pointer_cast<procedure_info>(shared_from_this());
|
|
||||||
}
|
|
||||||
|
|
||||||
constant_info::constant_info(const variant& symbol)
|
|
||||||
: symbol(symbol)
|
|
||||||
{
|
|
||||||
}
|
|
||||||
|
|
||||||
std::shared_ptr<constant_info> constant_info::is_constant()
|
|
||||||
{
|
|
||||||
return std::static_pointer_cast<constant_info>(shared_from_this());
|
|
||||||
}
|
|
||||||
|
|
||||||
variable_info::variable_info(const std::string& name, const type symbol)
|
|
||||||
: name(name), symbol(symbol)
|
|
||||||
{
|
|
||||||
}
|
|
||||||
|
|
||||||
std::shared_ptr<variable_info> variable_info::is_variable()
|
|
||||||
{
|
|
||||||
return std::static_pointer_cast<variable_info>(shared_from_this());
|
|
||||||
}
|
|
||||||
|
|
||||||
std::shared_ptr<symbol_table> builtin_symbol_table()
|
|
||||||
{
|
|
||||||
auto result = std::make_shared<symbol_table>();
|
|
||||||
|
|
||||||
result->enter("Int", std::make_shared<type_info>(type(std::make_shared<primitive_type>("Int"))));
|
|
||||||
result->enter("Word", std::make_shared<type_info>(type(std::make_shared<primitive_type>("Word"))));
|
|
||||||
result->enter("Char", std::make_shared<type_info>(type(std::make_shared<primitive_type>("Char"))));
|
|
||||||
result->enter("Bool", std::make_shared<type_info>(type(std::make_shared<primitive_type>("Bool"))));
|
|
||||||
result->enter("Byte", std::make_shared<type_info>(type(std::make_shared<primitive_type>("Byte"))));
|
|
||||||
result->enter("Float", std::make_shared<type_info>(type(std::make_shared<primitive_type>("Float"))));
|
|
||||||
result->enter("String", std::make_shared<type_info>(type(std::make_shared<primitive_type>("String"))));
|
|
||||||
|
|
||||||
return result;
|
|
||||||
}
|
|
||||||
}
|
|
||||||
279
boot/symbol.s
Normal file
279
boot/symbol.s
Normal file
@ -0,0 +1,279 @@
|
|||||||
|
# This Source Code Form is subject to the terms of the Mozilla Public License,
|
||||||
|
# v. 2.0. If a copy of the MPL was not distributed with this file, You can
|
||||||
|
# obtain one at https://mozilla.org/MPL/2.0/.
|
||||||
|
|
||||||
|
.global symbol_table
|
||||||
|
.global symbol_table_build, symbol_table_find, symbol_table_insert, symbol_table_dump
|
||||||
|
.global symbol_table_make_pointer, symbol_table_make_parameter, symbol_table_make_local
|
||||||
|
|
||||||
|
.include "boot/definitions.inc"
|
||||||
|
|
||||||
|
.equ SYMBOL_PRIME, 1543
|
||||||
|
|
||||||
|
.section .rodata
|
||||||
|
|
||||||
|
.type symbol_builtin_name_int, @object
|
||||||
|
symbol_builtin_name_int: .ascii "Int"
|
||||||
|
.type symbol_builtin_name_word, @object
|
||||||
|
symbol_builtin_name_word: .ascii "Word"
|
||||||
|
.type symbol_builtin_name_byte, @object
|
||||||
|
symbol_builtin_name_byte: .ascii "Byte"
|
||||||
|
.type symbol_builtin_name_char, @object
|
||||||
|
symbol_builtin_name_char: .ascii "Char"
|
||||||
|
.type symbol_builtin_name_bool, @object
|
||||||
|
symbol_builtin_name_bool: .ascii "Bool"
|
||||||
|
|
||||||
|
# Every type info starts with a word describing what type it is.
|
||||||
|
|
||||||
|
# Primitive types have only type size.
|
||||||
|
.type symbol_builtin_type_int, @object
|
||||||
|
symbol_builtin_type_int: .word TYPE_PRIMITIVE
|
||||||
|
.word 4
|
||||||
|
.type symbol_builtin_type_word, @object
|
||||||
|
symbol_builtin_type_word: .word TYPE_PRIMITIVE
|
||||||
|
.word 4
|
||||||
|
.type symbol_builtin_type_byte, @object
|
||||||
|
symbol_builtin_type_byte: .word TYPE_PRIMITIVE
|
||||||
|
.word 1
|
||||||
|
.type symbol_builtin_type_char, @object
|
||||||
|
symbol_builtin_type_char: .word TYPE_PRIMITIVE
|
||||||
|
.word 1
|
||||||
|
.type symbol_builtin_type_bool, @object
|
||||||
|
symbol_builtin_type_bool: .word TYPE_PRIMITIVE
|
||||||
|
.word 1
|
||||||
|
|
||||||
|
.section .bss
|
||||||
|
|
||||||
|
# The first word of the symbol table is its length.
|
||||||
|
# Then a list of type infos follows:
|
||||||
|
#
|
||||||
|
# record
|
||||||
|
# name: String
|
||||||
|
# info: ^TypeInfo
|
||||||
|
# end
|
||||||
|
.type symbol_table, @object
|
||||||
|
symbol_table: .zero SYMBOL_PRIME
|
||||||
|
|
||||||
|
.section .text
|
||||||
|
|
||||||
|
# Prints the list of symbols in the table.
|
||||||
|
.type symbol_table_dump, @function
|
||||||
|
symbol_table_dump:
|
||||||
|
# Prologue.
|
||||||
|
addi sp, sp, -32
|
||||||
|
sw ra, 28(sp)
|
||||||
|
sw s0, 24(sp)
|
||||||
|
addi s0, sp, 32
|
||||||
|
|
||||||
|
sw s1, 20(sp) # Current symbol in the table.
|
||||||
|
sw s2, 16(sp) # Symbol table length.
|
||||||
|
|
||||||
|
la s1, symbol_table
|
||||||
|
lw s2, 0(s1)
|
||||||
|
addi s1, s1, 4 # Advance to the first symbol in the table.
|
||||||
|
|
||||||
|
.Lsymbol_table_dump_loop:
|
||||||
|
beqz s2, .Lsymbol_table_dump_end
|
||||||
|
|
||||||
|
# Compare string lengths.
|
||||||
|
lw a0, 4(s1)
|
||||||
|
lw a1, 0(s1)
|
||||||
|
call _write_error
|
||||||
|
|
||||||
|
addi s1, s1, 12
|
||||||
|
addi s2, s2, -1
|
||||||
|
j .Lsymbol_table_dump_loop
|
||||||
|
|
||||||
|
.Lsymbol_table_dump_end:
|
||||||
|
lw s1, 20(sp)
|
||||||
|
lw s2, 16(sp)
|
||||||
|
|
||||||
|
# Epilogue.
|
||||||
|
lw ra, 28(sp)
|
||||||
|
lw s0, 24(sp)
|
||||||
|
addi sp, sp, 32
|
||||||
|
ret
|
||||||
|
|
||||||
|
# Searches for a symbol by name.
|
||||||
|
#
|
||||||
|
# Parameters:
|
||||||
|
# a0 - Length of the symbol to search.
|
||||||
|
# a1 - Pointer to the symbol name.
|
||||||
|
#
|
||||||
|
# Sets a0 to the symbol info pointer or 0 if the symbol has not been found.
|
||||||
|
.type symbol_table_find, @function
|
||||||
|
symbol_table_find:
|
||||||
|
# Prologue.
|
||||||
|
addi sp, sp, -32
|
||||||
|
sw ra, 28(sp)
|
||||||
|
sw s0, 24(sp)
|
||||||
|
addi s0, sp, 32
|
||||||
|
|
||||||
|
sw s1, 20(sp) # Current symbol in the table.
|
||||||
|
sw s2, 16(sp) # Symbol table length.
|
||||||
|
sw s3, 12(sp) # Length of the symbol to search.
|
||||||
|
sw s4, 8(sp) # Pointer to the symbol to search.
|
||||||
|
|
||||||
|
mv s3, a0
|
||||||
|
mv s4, a1
|
||||||
|
|
||||||
|
la s1, symbol_table
|
||||||
|
lw s2, 0(s1)
|
||||||
|
addi s1, s1, 4 # Advance to the first symbol in the table.
|
||||||
|
|
||||||
|
.Lsymbol_table_find_loop:
|
||||||
|
beqz s2, .Lsymbol_table_find_not_found
|
||||||
|
|
||||||
|
# Compare string lengths.
|
||||||
|
mv a0, s3
|
||||||
|
mv a1, s4
|
||||||
|
lw a2, 0(s1)
|
||||||
|
lw a3, 4(s1)
|
||||||
|
call _string_equal
|
||||||
|
|
||||||
|
beqz a0, .Lsymbol_table_find_continue
|
||||||
|
|
||||||
|
lw a0, 8(s1) # Pointer to the symbol.
|
||||||
|
j .Lsymbol_table_find_end
|
||||||
|
|
||||||
|
.Lsymbol_table_find_continue:
|
||||||
|
addi s1, s1, 12
|
||||||
|
addi s2, s2, -1
|
||||||
|
j .Lsymbol_table_find_loop
|
||||||
|
|
||||||
|
.Lsymbol_table_find_not_found:
|
||||||
|
li a0, 0
|
||||||
|
|
||||||
|
.Lsymbol_table_find_end:
|
||||||
|
lw s1, 20(sp)
|
||||||
|
lw s2, 16(sp)
|
||||||
|
lw s3, 12(sp)
|
||||||
|
lw s4, 8(sp)
|
||||||
|
|
||||||
|
# Epilogue.
|
||||||
|
lw ra, 28(sp)
|
||||||
|
lw s0, 24(sp)
|
||||||
|
addi sp, sp, 32
|
||||||
|
ret
|
||||||
|
|
||||||
|
# Creates a pointer type.
|
||||||
|
#
|
||||||
|
# Parameters:
|
||||||
|
# a0 - Pointer to the base type.
|
||||||
|
# a1 - Output memory.
|
||||||
|
#
|
||||||
|
# Sets a0 to the size of newly created type in bytes.
|
||||||
|
.type symbol_table_make_pointer, @function
|
||||||
|
symbol_table_make_pointer:
|
||||||
|
li t0, TYPE_POINTER
|
||||||
|
sw t0, 0(a1)
|
||||||
|
sw a0, 4(a1)
|
||||||
|
|
||||||
|
li a0, 8
|
||||||
|
ret
|
||||||
|
|
||||||
|
# Creates a parameter info.
|
||||||
|
#
|
||||||
|
# Parameters:
|
||||||
|
# a0 - Pointer to the parameter type.
|
||||||
|
# a1 - Parameter offset.
|
||||||
|
# a2 - Output memory.
|
||||||
|
#
|
||||||
|
# Sets a0 to the size of newly created info object in bytes.
|
||||||
|
.type symbol_table_make_parameter, @function
|
||||||
|
symbol_table_make_parameter:
|
||||||
|
li t0, INFO_PARAMETER
|
||||||
|
sw t0, 0(a2)
|
||||||
|
sw a0, 4(a2)
|
||||||
|
sw a1, 8(a2)
|
||||||
|
|
||||||
|
li a0, 12
|
||||||
|
ret
|
||||||
|
|
||||||
|
# Creates a local variable info.
|
||||||
|
#
|
||||||
|
# Parameters:
|
||||||
|
# a0 - Pointer to the variable type.
|
||||||
|
# a1 - Variable stack offset.
|
||||||
|
# a2 - Output memory.
|
||||||
|
#
|
||||||
|
# Sets a0 to the size of newly created info object in bytes.
|
||||||
|
.type symbol_table_make_local, @function
|
||||||
|
symbol_table_make_local:
|
||||||
|
li t0, INFO_LOCAL
|
||||||
|
sw t0, 0(a2)
|
||||||
|
sw a0, 4(a2)
|
||||||
|
sw a1, 8(a2)
|
||||||
|
|
||||||
|
li a0, 12
|
||||||
|
ret
|
||||||
|
|
||||||
|
# Inserts a symbol into the table.
|
||||||
|
#
|
||||||
|
# Parameters:
|
||||||
|
# a0 - Symbol name length.
|
||||||
|
# a1 - Symbol name pointer.
|
||||||
|
# a2 - Symbol pointer.
|
||||||
|
.type symbol_table_insert, @function
|
||||||
|
symbol_table_insert:
|
||||||
|
la t0, symbol_table
|
||||||
|
|
||||||
|
lw t1, 0(t0) # Current table length.
|
||||||
|
li t2, 12 # Calculate the offset to the next entry.
|
||||||
|
mul t2, t1, t2
|
||||||
|
addi t2, t2, 4
|
||||||
|
add t2, t0, t2
|
||||||
|
|
||||||
|
sw a0, 0(t2)
|
||||||
|
sw a1, 4(t2)
|
||||||
|
sw a2, 8(t2)
|
||||||
|
|
||||||
|
addi t1, t1, 1 # Save the new length.
|
||||||
|
sw t1, 0(t0)
|
||||||
|
|
||||||
|
ret
|
||||||
|
|
||||||
|
# Build the initial symbols.
|
||||||
|
#
|
||||||
|
# Sets a0 to the pointer to the global symbol table.
|
||||||
|
.type symbol_build, @function
|
||||||
|
symbol_table_build:
|
||||||
|
# Prologue.
|
||||||
|
addi sp, sp, -16
|
||||||
|
sw ra, 12(sp)
|
||||||
|
sw s0, 8(sp)
|
||||||
|
addi s0, sp, 16
|
||||||
|
|
||||||
|
la a0, symbol_table
|
||||||
|
addi t0, a0, 4
|
||||||
|
|
||||||
|
li a0, 3 # Length of the word "Int".
|
||||||
|
la a1, symbol_builtin_name_int
|
||||||
|
la a2, symbol_builtin_type_int
|
||||||
|
call symbol_table_insert
|
||||||
|
|
||||||
|
li a0, 4 # Length of the word "Word".
|
||||||
|
la a1, symbol_builtin_name_word
|
||||||
|
la a2, symbol_builtin_type_word
|
||||||
|
call symbol_table_insert
|
||||||
|
|
||||||
|
li a0, 4 # Length of the word "Byte".
|
||||||
|
la a1, symbol_builtin_name_byte
|
||||||
|
la a2, symbol_builtin_type_byte
|
||||||
|
call symbol_table_insert
|
||||||
|
|
||||||
|
li a0, 4 # Length of the word "Char".
|
||||||
|
la a1, symbol_builtin_name_char
|
||||||
|
la a2, symbol_builtin_type_char
|
||||||
|
call symbol_table_insert
|
||||||
|
|
||||||
|
li a0, 4 # Length of the word "Bool".
|
||||||
|
la a1, symbol_builtin_name_bool
|
||||||
|
la a2, symbol_builtin_type_bool
|
||||||
|
call symbol_table_insert
|
||||||
|
|
||||||
|
# Epilogue.
|
||||||
|
lw ra, 12(sp)
|
||||||
|
lw s0, 8(sp)
|
||||||
|
addi sp, sp, 16
|
||||||
|
ret
|
||||||
11
boot/test.elna
Normal file
11
boot/test.elna
Normal file
@ -0,0 +1,11 @@
|
|||||||
|
program
|
||||||
|
|
||||||
|
proc _main(x: Word, y: Word)
|
||||||
|
begin
|
||||||
|
_write_s(@x, 4);
|
||||||
|
_write_s(@y, 4)
|
||||||
|
end
|
||||||
|
|
||||||
|
begin
|
||||||
|
_main(0x0a2c3061, 0x0a2c3062)
|
||||||
|
end.
|
||||||
616
boot/tokenizer.s
Normal file
616
boot/tokenizer.s
Normal file
@ -0,0 +1,616 @@
|
|||||||
|
# This Source Code Form is subject to the terms of the Mozilla Public License,
|
||||||
|
# v. 2.0. If a copy of the MPL was not distributed with this file, You can
|
||||||
|
# obtain one at https://mozilla.org/MPL/2.0/.
|
||||||
|
|
||||||
|
.global lex_next, classification, transitions, keywords, byte_keywords
|
||||||
|
|
||||||
|
.include "boot/definitions.inc"
|
||||||
|
|
||||||
|
.section .rodata
|
||||||
|
|
||||||
|
#
|
||||||
|
# Classification table assigns each possible character to a group (class). All
|
||||||
|
# characters of the same group a handled equivalently.
|
||||||
|
#
|
||||||
|
# Classification:
|
||||||
|
#
|
||||||
|
.equ CLASS_INVALID, 0x00
|
||||||
|
.equ CLASS_DIGIT, 0x01
|
||||||
|
.equ CLASS_CHARACTER, 0x02
|
||||||
|
.equ CLASS_SPACE, 0x03
|
||||||
|
.equ CLASS_COLON, 0x04
|
||||||
|
.equ CLASS_EQUALS, 0x05
|
||||||
|
.equ CLASS_LEFT_PAREN, 0x06
|
||||||
|
.equ CLASS_RIGHT_PAREN, 0x07
|
||||||
|
.equ CLASS_ASTERISK, 0x08
|
||||||
|
.equ CLASS_UNDERSCORE, 0x09
|
||||||
|
.equ CLASS_SINGLE, 0x0a
|
||||||
|
.equ CLASS_HEX, 0x0b
|
||||||
|
.equ CLASS_ZERO, 0x0c
|
||||||
|
.equ CLASS_X, 0x0d
|
||||||
|
.equ CLASS_EOF, 0x0e
|
||||||
|
.equ CLASS_DOT, 0x0f
|
||||||
|
.equ CLASS_MINUS, 0x10
|
||||||
|
.equ CLASS_QUOTE, 0x11
|
||||||
|
.equ CLASS_GREATER, 0x12
|
||||||
|
.equ CLASS_LESS, 0x13
|
||||||
|
|
||||||
|
.equ CLASS_COUNT, 20
|
||||||
|
|
||||||
|
.type classification, @object
|
||||||
|
classification:
|
||||||
|
.byte CLASS_EOF # 00 NUL
|
||||||
|
.byte CLASS_INVALID # 01 SOH
|
||||||
|
.byte CLASS_INVALID # 02 STX
|
||||||
|
.byte CLASS_INVALID # 03 ETX
|
||||||
|
.byte CLASS_INVALID # 04 EOT
|
||||||
|
.byte CLASS_INVALID # 05 ENQ
|
||||||
|
.byte CLASS_INVALID # 06 ACK
|
||||||
|
.byte CLASS_INVALID # 07 BEL
|
||||||
|
.byte CLASS_INVALID # 08 BS
|
||||||
|
.byte CLASS_SPACE # 09 HT
|
||||||
|
.byte CLASS_SPACE # 0A LF
|
||||||
|
.byte CLASS_INVALID # 0B VT
|
||||||
|
.byte CLASS_INVALID # 0C FF
|
||||||
|
.byte CLASS_SPACE # 0D CR
|
||||||
|
.byte CLASS_INVALID # 0E SO
|
||||||
|
.byte CLASS_INVALID # 0F SI
|
||||||
|
.byte CLASS_INVALID # 10 DLE
|
||||||
|
.byte CLASS_INVALID # 11 DC1
|
||||||
|
.byte CLASS_INVALID # 12 DC2
|
||||||
|
.byte CLASS_INVALID # 13 DC3
|
||||||
|
.byte CLASS_INVALID # 14 DC4
|
||||||
|
.byte CLASS_INVALID # 15 NAK
|
||||||
|
.byte CLASS_INVALID # 16 SYN
|
||||||
|
.byte CLASS_INVALID # 17 ETB
|
||||||
|
.byte CLASS_INVALID # 18 CAN
|
||||||
|
.byte CLASS_INVALID # 19 EM
|
||||||
|
.byte CLASS_INVALID # 1A SUB
|
||||||
|
.byte CLASS_INVALID # 1B ESC
|
||||||
|
.byte CLASS_INVALID # 1C FS
|
||||||
|
.byte CLASS_INVALID # 1D GS
|
||||||
|
.byte CLASS_INVALID # 1E RS
|
||||||
|
.byte CLASS_INVALID # 1F US
|
||||||
|
.byte CLASS_SPACE # 20 Space
|
||||||
|
.byte CLASS_SINGLE # 21 !
|
||||||
|
.byte CLASS_QUOTE # 22 "
|
||||||
|
.byte 0x00 # 23 #
|
||||||
|
.byte 0x00 # 24 $
|
||||||
|
.byte CLASS_SINGLE # 25 %
|
||||||
|
.byte CLASS_SINGLE # 26 &
|
||||||
|
.byte CLASS_QUOTE # 27 '
|
||||||
|
.byte CLASS_LEFT_PAREN # 28 (
|
||||||
|
.byte CLASS_RIGHT_PAREN # 29 )
|
||||||
|
.byte CLASS_ASTERISK # 2A *
|
||||||
|
.byte CLASS_SINGLE # 2B +
|
||||||
|
.byte CLASS_SINGLE # 2C ,
|
||||||
|
.byte CLASS_MINUS # 2D -
|
||||||
|
.byte CLASS_DOT # 2E .
|
||||||
|
.byte CLASS_SINGLE # 2F /
|
||||||
|
.byte CLASS_ZERO # 30 0
|
||||||
|
.byte CLASS_DIGIT # 31 1
|
||||||
|
.byte CLASS_DIGIT # 32 2
|
||||||
|
.byte CLASS_DIGIT # 33 3
|
||||||
|
.byte CLASS_DIGIT # 34 4
|
||||||
|
.byte CLASS_DIGIT # 35 5
|
||||||
|
.byte CLASS_DIGIT # 36 6
|
||||||
|
.byte CLASS_DIGIT # 37 7
|
||||||
|
.byte CLASS_DIGIT # 38 8
|
||||||
|
.byte CLASS_DIGIT # 39 9
|
||||||
|
.byte CLASS_COLON # 3A :
|
||||||
|
.byte CLASS_SINGLE # 3B ;
|
||||||
|
.byte CLASS_LESS # 3C <
|
||||||
|
.byte CLASS_EQUALS # 3D =
|
||||||
|
.byte CLASS_GREATER # 3E >
|
||||||
|
.byte 0x00 # 3F ?
|
||||||
|
.byte CLASS_SINGLE # 40 @
|
||||||
|
.byte CLASS_CHARACTER # 41 A
|
||||||
|
.byte CLASS_CHARACTER # 42 B
|
||||||
|
.byte CLASS_CHARACTER # 43 C
|
||||||
|
.byte CLASS_CHARACTER # 44 D
|
||||||
|
.byte CLASS_CHARACTER # 45 E
|
||||||
|
.byte CLASS_CHARACTER # 46 F
|
||||||
|
.byte CLASS_CHARACTER # 47 G
|
||||||
|
.byte CLASS_CHARACTER # 48 H
|
||||||
|
.byte CLASS_CHARACTER # 49 I
|
||||||
|
.byte CLASS_CHARACTER # 4A J
|
||||||
|
.byte CLASS_CHARACTER # 4B K
|
||||||
|
.byte CLASS_CHARACTER # 4C L
|
||||||
|
.byte CLASS_CHARACTER # 4D M
|
||||||
|
.byte CLASS_CHARACTER # 4E N
|
||||||
|
.byte CLASS_CHARACTER # 4F O
|
||||||
|
.byte CLASS_CHARACTER # 50 P
|
||||||
|
.byte CLASS_CHARACTER # 51 Q
|
||||||
|
.byte CLASS_CHARACTER # 52 R
|
||||||
|
.byte CLASS_CHARACTER # 53 S
|
||||||
|
.byte CLASS_CHARACTER # 54 T
|
||||||
|
.byte CLASS_CHARACTER # 55 U
|
||||||
|
.byte CLASS_CHARACTER # 56 V
|
||||||
|
.byte CLASS_CHARACTER # 57 W
|
||||||
|
.byte CLASS_CHARACTER # 58 X
|
||||||
|
.byte CLASS_CHARACTER # 59 Y
|
||||||
|
.byte CLASS_CHARACTER # 5A Z
|
||||||
|
.byte CLASS_SINGLE # 5B [
|
||||||
|
.byte 0x00 # 5C \
|
||||||
|
.byte CLASS_SINGLE # 5D ]
|
||||||
|
.byte CLASS_SINGLE # 5E ^
|
||||||
|
.byte CLASS_UNDERSCORE # 5F _
|
||||||
|
.byte 0x00 # 60 `
|
||||||
|
.byte CLASS_HEX # 61 a
|
||||||
|
.byte CLASS_HEX # 62 b
|
||||||
|
.byte CLASS_HEX # 63 c
|
||||||
|
.byte CLASS_HEX # 64 d
|
||||||
|
.byte CLASS_HEX # 65 e
|
||||||
|
.byte CLASS_HEX # 66 f
|
||||||
|
.byte CLASS_CHARACTER # 67 g
|
||||||
|
.byte CLASS_CHARACTER # 68 h
|
||||||
|
.byte CLASS_CHARACTER # 69 i
|
||||||
|
.byte CLASS_CHARACTER # 6A j
|
||||||
|
.byte CLASS_CHARACTER # 6B k
|
||||||
|
.byte CLASS_CHARACTER # 6C l
|
||||||
|
.byte CLASS_CHARACTER # 6D m
|
||||||
|
.byte CLASS_CHARACTER # 6E n
|
||||||
|
.byte CLASS_CHARACTER # 6F o
|
||||||
|
.byte CLASS_CHARACTER # 70 p
|
||||||
|
.byte CLASS_CHARACTER # 71 q
|
||||||
|
.byte CLASS_CHARACTER # 72 r
|
||||||
|
.byte CLASS_CHARACTER # 73 s
|
||||||
|
.byte CLASS_CHARACTER # 74 t
|
||||||
|
.byte CLASS_CHARACTER # 75 u
|
||||||
|
.byte CLASS_CHARACTER # 76 v
|
||||||
|
.byte CLASS_CHARACTER # 77 w
|
||||||
|
.byte CLASS_X # 78 x
|
||||||
|
.byte CLASS_CHARACTER # 79 y
|
||||||
|
.byte CLASS_CHARACTER # 7A z
|
||||||
|
.byte 0x00 # 7B {
|
||||||
|
.byte CLASS_SINGLE # 7C |
|
||||||
|
.byte 0x00 # 7D }
|
||||||
|
.byte CLASS_SINGLE # 7E ~
|
||||||
|
.byte CLASS_INVALID # 7F DEL
|
||||||
|
|
||||||
|
#
|
||||||
|
# Textual keywords in the language.
|
||||||
|
#
|
||||||
|
.equ KEYWORDS_COUNT, TOKEN_IDENTIFIER - 1
|
||||||
|
|
||||||
|
.type keywords, @object
|
||||||
|
keywords:
|
||||||
|
.word 7
|
||||||
|
.ascii "program"
|
||||||
|
.word 6
|
||||||
|
.ascii "import"
|
||||||
|
.word 5
|
||||||
|
.ascii "const"
|
||||||
|
.word 3
|
||||||
|
.ascii "var"
|
||||||
|
.word 2
|
||||||
|
.ascii "if"
|
||||||
|
.word 4
|
||||||
|
.ascii "then"
|
||||||
|
.word 5
|
||||||
|
.ascii "elsif"
|
||||||
|
.word 4
|
||||||
|
.ascii "else"
|
||||||
|
.word 5
|
||||||
|
.ascii "while"
|
||||||
|
.word 2
|
||||||
|
.ascii "do"
|
||||||
|
.word 4
|
||||||
|
.ascii "proc"
|
||||||
|
.word 5
|
||||||
|
.ascii "begin"
|
||||||
|
.word 3
|
||||||
|
.ascii "end"
|
||||||
|
.word 4
|
||||||
|
.ascii "type"
|
||||||
|
.word 6
|
||||||
|
.ascii "record"
|
||||||
|
.word 5
|
||||||
|
.ascii "union"
|
||||||
|
.word 4
|
||||||
|
.ascii "true"
|
||||||
|
.word 5
|
||||||
|
.ascii "false"
|
||||||
|
.word 3
|
||||||
|
.ascii "nil"
|
||||||
|
.word 3
|
||||||
|
.ascii "xor"
|
||||||
|
.word 2
|
||||||
|
.ascii "or"
|
||||||
|
.word 6
|
||||||
|
.ascii "return"
|
||||||
|
.word 4
|
||||||
|
.ascii "cast"
|
||||||
|
.word 4
|
||||||
|
.ascii "goto"
|
||||||
|
.word 4
|
||||||
|
.ascii "case"
|
||||||
|
.word 2
|
||||||
|
.ascii "of"
|
||||||
|
|
||||||
|
.type byte_keywords, @object
|
||||||
|
byte_keywords: .ascii "&.,:;()[]^=+-*@"
|
||||||
|
.equ BYTE_KEYWORDS_SIZE, . - byte_keywords
|
||||||
|
|
||||||
|
.section .data
|
||||||
|
|
||||||
|
# The transition table describes transitions from one state to another, given
|
||||||
|
# a symbol (character class).
|
||||||
|
#
|
||||||
|
# The table has m rows and n columns, where m is the amount of states and n is
|
||||||
|
# the amount of classes. So given the current state and a classified character
|
||||||
|
# the table can be used to look up the next state.
|
||||||
|
#
|
||||||
|
# Each cell is a word long.
|
||||||
|
# - The least significant byte of the word is a row number (beginning with 0).
|
||||||
|
# It specifies the target state. "ff" means that this is an end state and no
|
||||||
|
# transition is possible.
|
||||||
|
# - The next byte is the action that should be performed when transitioning.
|
||||||
|
# For the meaning of actions see labels in the lex_next function, which
|
||||||
|
# handles each action.
|
||||||
|
#
|
||||||
|
.type transitions, @object
|
||||||
|
transitions:
|
||||||
|
# Invalid Digit Alpha Space : = ( )
|
||||||
|
# * _ Single Hex 0 x NUL .
|
||||||
|
# - " or ' > <
|
||||||
|
.word 0x00ff, 0x0103, 0x0102, 0x0300, 0x0101, 0x06ff, 0x0106, 0x06ff
|
||||||
|
.word 0x06ff, 0x0102, 0x06ff, 0x0102, 0x010c, 0x0102, 0x00ff, 0x06ff
|
||||||
|
.word 0x0105, 0x0110, 0x0104, 0x0107 # 0x00 Start
|
||||||
|
|
||||||
|
.word 0x02ff, 0x02ff, 0x02ff, 0x02ff, 0x02ff, 0x07ff, 0x02ff, 0x02ff
|
||||||
|
.word 0x02ff, 0x02ff, 0x02ff, 0x02ff, 0x02ff, 0x02ff, 0x02ff, 0x02ff
|
||||||
|
.word 0x02ff, 0x02ff, 0x02ff, 0x02ff # 0x01 Colon
|
||||||
|
|
||||||
|
.word 0x05ff, 0x0102, 0x0102, 0x05ff, 0x05ff, 0x05ff, 0x05ff, 0x05ff
|
||||||
|
.word 0x05ff, 0x0102, 0x05ff, 0x0102, 0x0102, 0x0102, 0x05ff, 0x05ff
|
||||||
|
.word 0x05ff, 0x05ff, 0x05ff, 0x05ff # 0x02 Identifier
|
||||||
|
|
||||||
|
.word 0x08ff, 0x0103, 0x00ff, 0x08ff, 0x08ff, 0x08ff, 0x08ff, 0x08ff
|
||||||
|
.word 0x08ff, 0x00ff, 0x08ff, 0x00ff, 0x0103, 0x00ff, 0x08ff, 0x08ff
|
||||||
|
.word 0x08ff, 0x08ff, 0x08ff, 0x08ff # 0x03 Decimal
|
||||||
|
|
||||||
|
.word 0x02ff, 0x02ff, 0x02ff, 0x02ff, 0x02ff, 0x04ff, 0x02ff, 0x02ff
|
||||||
|
.word 0x02ff, 0x02ff, 0x02ff, 0x02ff, 0x02ff, 0x02ff, 0x02ff, 0x02ff
|
||||||
|
.word 0x02ff, 0x02ff, 0x04ff, 0x02ff # 0x04 Greater
|
||||||
|
|
||||||
|
.word 0x06ff, 0x06ff, 0x06ff, 0x06ff, 0x06ff, 0x06ff, 0x06ff, 0x06ff
|
||||||
|
.word 0x06ff, 0x06ff, 0x06ff, 0x06ff, 0x06ff, 0x06ff, 0x06ff, 0x06ff
|
||||||
|
.word 0x06ff, 0x06ff, 0x04ff, 0x06ff # 0x05 Minus
|
||||||
|
|
||||||
|
.word 0x06ff, 0x06ff, 0x06ff, 0x06ff, 0x06ff, 0x06ff, 0x06ff, 0x06ff
|
||||||
|
.word 0x0109, 0x06ff, 0x06ff, 0x06ff, 0x06ff, 0x06ff, 0x06ff, 0x06ff
|
||||||
|
.word 0x06ff, 0x06ff, 0x06ff, 0x06ff # 0x06 Left paren
|
||||||
|
|
||||||
|
.word 0x02ff, 0x02ff, 0x02ff, 0x02ff, 0x02ff, 0x02ff, 0x02ff, 0x02ff
|
||||||
|
.word 0x02ff, 0x02ff, 0x02ff, 0x02ff, 0x02ff, 0x02ff, 0x02ff, 0x02ff
|
||||||
|
.word 0x02ff, 0x02ff, 0x02ff, 0x04ff # 0x07 Less
|
||||||
|
|
||||||
|
.word 0x08ff, 0x0108, 0x00ff, 0x08ff, 0x08ff, 0x08ff, 0x08ff, 0x08ff
|
||||||
|
.word 0x08ff, 0x00ff, 0x08ff, 0x0108, 0x0108, 0x00ff, 0x08ff, 0x08ff
|
||||||
|
.word 0x08ff, 0x08ff, 0x08ff, 0x08ff # 0x08 Hexadecimal after 0x.
|
||||||
|
|
||||||
|
.word 0x0109, 0x0109, 0x0109, 0x0109, 0x0109, 0x0109, 0x0109, 0x0109
|
||||||
|
.word 0x010a, 0x0109, 0x0109, 0x0109, 0x0109, 0x0109, 0x00ff, 0x0109
|
||||||
|
.word 0x0109, 0x0109, 0x0109, 0x0109 # 0x09 Comment
|
||||||
|
|
||||||
|
.word 0x00ff, 0x0109, 0x0109, 0x0109, 0x0109, 0x0109, 0x0109, 0x04ff
|
||||||
|
.word 0x010a, 0x0109, 0x0109, 0x0109, 0x0109, 0x0109, 0x00ff, 0x0109
|
||||||
|
.word 0x0109, 0x0109, 0x0109, 0x0109 # 0x0a Closing comment
|
||||||
|
|
||||||
|
.word 0x00ff, 0x010b, 0x010b, 0x010b, 0x010b, 0x010b, 0x010b, 0x0110
|
||||||
|
.word 0x010b, 0x010b, 0x010b, 0x010b, 0x010b, 0x010b, 0x010b, 0x0110
|
||||||
|
.word 0x010b, 0x04ff, 0x010b, 0x010b # 0x0b String
|
||||||
|
|
||||||
|
.word 0x08ff, 0x00ff, 0x00ff, 0x08ff, 0x08ff, 0x08ff, 0x08ff, 0x08ff
|
||||||
|
.word 0x08ff, 0x00ff, 0x08ff, 0x00ff, 0x00ff, 0x010d, 0x08ff, 0x08ff
|
||||||
|
.word 0x08ff, 0x08ff, 0x08ff, 0x08ff # 0x0c Leading zero
|
||||||
|
|
||||||
|
.word 0x00ff, 0x0108, 0x00ff, 0x00ff, 0x00ff, 0x00ff, 0x00ff, 0x00ff
|
||||||
|
.word 0x00ff, 0x00ff, 0x00ff, 0x0108, 0x0108, 0x00ff, 0x00ff, 0x00ff
|
||||||
|
.word 0x00ff, 0x00ff, 0x00ff, 0x00ff # 0x0d Starting hexadecimal
|
||||||
|
|
||||||
|
.section .text
|
||||||
|
|
||||||
|
# Returns the class from the classification table for the given character.
|
||||||
|
#
|
||||||
|
# Parameters:
|
||||||
|
# a0 - Character.
|
||||||
|
#
|
||||||
|
# Sets a0 to the class number.
|
||||||
|
.type classify, @function
|
||||||
|
classify:
|
||||||
|
la t0, classification
|
||||||
|
add t0, t0, a0 # Character class pointer.
|
||||||
|
lbu a0, (t0) # Character class.
|
||||||
|
ret
|
||||||
|
|
||||||
|
# Given the current state and a character class, calculates the next state.
|
||||||
|
|
||||||
|
# Parameters:
|
||||||
|
# a0 - Current state.
|
||||||
|
# a1 - Character class.
|
||||||
|
#
|
||||||
|
# Sets a0 to the next state.
|
||||||
|
.type lookup_state, @function
|
||||||
|
lookup_state:
|
||||||
|
li t0, CLASS_COUNT
|
||||||
|
mul a0, a0, t0 # Transition row.
|
||||||
|
add a0, a0, a1 # Transition column.
|
||||||
|
|
||||||
|
li t0, 4
|
||||||
|
mul a0, a0, t0 # Multiply by the word size.
|
||||||
|
|
||||||
|
la t0, transitions
|
||||||
|
add t0, t0, a0
|
||||||
|
lw a0, (t0) # Next state.
|
||||||
|
|
||||||
|
ret
|
||||||
|
|
||||||
|
# Chains classify and lookup_state.
|
||||||
|
#
|
||||||
|
# Parameters:
|
||||||
|
# a0 - Current state.
|
||||||
|
# a1 - Character.
|
||||||
|
#
|
||||||
|
# Sets a0 to the next state based on the given character.
|
||||||
|
.type _next_state, @function
|
||||||
|
_next_state:
|
||||||
|
# Prologue.
|
||||||
|
addi sp, sp, -16
|
||||||
|
sw ra, 12(sp)
|
||||||
|
sw s0, 8(sp)
|
||||||
|
addi s0, sp, 16
|
||||||
|
|
||||||
|
sw a0, 4(sp)
|
||||||
|
mv a0, a1
|
||||||
|
call classify
|
||||||
|
|
||||||
|
mv a1, a0
|
||||||
|
lw a0, 4(sp)
|
||||||
|
call lookup_state
|
||||||
|
|
||||||
|
# Epilogue.
|
||||||
|
lw ra, 12(sp)
|
||||||
|
lw s0, 8(sp)
|
||||||
|
addi sp, sp, 16
|
||||||
|
ret
|
||||||
|
|
||||||
|
# Takes an identifier and checks whether it's a keyword.
|
||||||
|
#
|
||||||
|
# Parameters:
|
||||||
|
# a0 - Token length.
|
||||||
|
# a1 - Token pointer.
|
||||||
|
#
|
||||||
|
# Sets a0 to the appropriate token type.
|
||||||
|
.type classify_identifier, @function
|
||||||
|
classify_identifier:
|
||||||
|
# Prologue.
|
||||||
|
addi sp, sp, -16
|
||||||
|
sw ra, 12(sp)
|
||||||
|
sw s0, 8(sp)
|
||||||
|
addi s0, sp, 16
|
||||||
|
|
||||||
|
mv a2, a0
|
||||||
|
mv a3, a1
|
||||||
|
li a0, KEYWORDS_COUNT
|
||||||
|
la a1, keywords
|
||||||
|
call _strings_index
|
||||||
|
|
||||||
|
bnez a0, .Lclassify_identifier_end
|
||||||
|
li a0, TOKEN_IDENTIFIER
|
||||||
|
|
||||||
|
.Lclassify_identifier_end:
|
||||||
|
# Epilogue.
|
||||||
|
lw ra, 12(sp)
|
||||||
|
lw s0, 8(sp)
|
||||||
|
addi sp, sp, 16
|
||||||
|
ret
|
||||||
|
|
||||||
|
# Takes a symbol and determines its type.
|
||||||
|
#
|
||||||
|
# Parameters:
|
||||||
|
# a0 - Token character.
|
||||||
|
#
|
||||||
|
# Sets a0 to the appropriate token type.
|
||||||
|
.type classify_single, @function
|
||||||
|
classify_single:
|
||||||
|
# Prologue.
|
||||||
|
addi sp, sp, -16
|
||||||
|
sw ra, 12(sp)
|
||||||
|
sw s0, 8(sp)
|
||||||
|
addi s0, sp, 16
|
||||||
|
|
||||||
|
mv a1, a0
|
||||||
|
li a2, BYTE_KEYWORDS_SIZE
|
||||||
|
la a0, byte_keywords
|
||||||
|
call _memchr
|
||||||
|
|
||||||
|
la a1, byte_keywords
|
||||||
|
sub a0, a0, a1
|
||||||
|
addi a0, a0, TOKEN_IDENTIFIER + 1
|
||||||
|
|
||||||
|
# Epilogue.
|
||||||
|
lw ra, 12(sp)
|
||||||
|
lw s0, 8(sp)
|
||||||
|
addi sp, sp, 16
|
||||||
|
ret
|
||||||
|
|
||||||
|
# Classified a symbol containing multiple characters (probably 2).
|
||||||
|
#
|
||||||
|
# Parameters:
|
||||||
|
# a0 - Token length.
|
||||||
|
# a1 - Token pointer.
|
||||||
|
#
|
||||||
|
# Sets a0 to the appropriate token type.
|
||||||
|
.type classify_composite, @function
|
||||||
|
classify_composite:
|
||||||
|
lbu t0, 0(a1)
|
||||||
|
li t1, ':'
|
||||||
|
beq t0, t1, .Lclassify_composite_assign
|
||||||
|
|
||||||
|
j .Lclassify_composite_end
|
||||||
|
|
||||||
|
.Lclassify_composite_assign:
|
||||||
|
li a0, TOKEN_ASSIGN
|
||||||
|
j .Lclassify_composite_end
|
||||||
|
|
||||||
|
.Lclassify_composite_end:
|
||||||
|
ret
|
||||||
|
|
||||||
|
# Initializes the classification table.
|
||||||
|
#
|
||||||
|
# Paramaters:
|
||||||
|
# a0 - Source text pointer.
|
||||||
|
# a1 - A pointer for output value, the token kind. 4 Bytes.
|
||||||
|
#
|
||||||
|
# Sets a0 to the position of the next token.
|
||||||
|
.type lex_next, @function
|
||||||
|
lex_next:
|
||||||
|
# Prologue.
|
||||||
|
addi sp, sp, -32
|
||||||
|
sw ra, 28(sp)
|
||||||
|
sw s0, 24(sp)
|
||||||
|
addi s0, sp, 32
|
||||||
|
|
||||||
|
sw s1, 20(sp) # Preserve s1 used for current source text position.
|
||||||
|
mv s1, a0
|
||||||
|
sw a0, 12(sp) # Keeps a pointer to the beginning of a token.
|
||||||
|
# 4(sp) and 8(sp) are reserved for the kind and length of the token if needed.
|
||||||
|
|
||||||
|
sw s2, 16(sp) # Preserve s2 containing the current state.
|
||||||
|
li s2, 0x00 # Initial, start state.
|
||||||
|
|
||||||
|
sw a1, 0(sp)
|
||||||
|
sw zero, (a1) # Initialize.
|
||||||
|
|
||||||
|
.Llex_next_loop:
|
||||||
|
mv a0, s2
|
||||||
|
lbu a1, (s1)
|
||||||
|
call _next_state
|
||||||
|
|
||||||
|
li t0, 0xff
|
||||||
|
and s2, a0, t0 # Next state.
|
||||||
|
|
||||||
|
li t0, 0xff00
|
||||||
|
and t1, a0, t0 # Transition action.
|
||||||
|
srli t1, t1, 8
|
||||||
|
|
||||||
|
# Perform the provided action.
|
||||||
|
li t0, 0x01 # Accumulate action.
|
||||||
|
beq t1, t0, .Llex_next_accumulate
|
||||||
|
|
||||||
|
li t0, 0x02 # Print action.
|
||||||
|
beq t1, t0, .Llex_next_print
|
||||||
|
|
||||||
|
li t0, 0x03 # Skip action.
|
||||||
|
beq t1, t0, .Llex_next_skip
|
||||||
|
|
||||||
|
li t0, 0x04 # Delimited string action.
|
||||||
|
beq t1, t0, .Llex_next_comment
|
||||||
|
|
||||||
|
li t0, 0x05 # Finalize identifier.
|
||||||
|
beq t1, t0, .Llex_next_identifier
|
||||||
|
|
||||||
|
li t0, 0x06 # Single character symbol action.
|
||||||
|
beq t1, t0, .Llex_next_single
|
||||||
|
|
||||||
|
li t0, 0x07 # An action for symbols containing multiple characters.
|
||||||
|
beq t1, t0, .Llex_next_composite
|
||||||
|
|
||||||
|
li t0, 0x08 # Integer action.
|
||||||
|
beq t1, t0, .Llex_next_integer
|
||||||
|
|
||||||
|
j .Llex_next_reject
|
||||||
|
|
||||||
|
.Llex_next_reject:
|
||||||
|
addi s1, s1, 1
|
||||||
|
|
||||||
|
j .Llex_next_end
|
||||||
|
|
||||||
|
.Llex_next_accumulate:
|
||||||
|
addi s1, s1, 1
|
||||||
|
|
||||||
|
j .Llex_next_loop
|
||||||
|
|
||||||
|
.Llex_next_skip:
|
||||||
|
addi s1, s1, 1
|
||||||
|
lw t0, 12(sp)
|
||||||
|
addi t0, t0, 1
|
||||||
|
sw t0, 12(sp)
|
||||||
|
|
||||||
|
j .Llex_next_loop
|
||||||
|
|
||||||
|
.Llex_next_print:
|
||||||
|
/* DEBUG
|
||||||
|
addi a0, a0, 21
|
||||||
|
sw a0, 0(sp)
|
||||||
|
addi a0, sp, 0
|
||||||
|
li a1, 1
|
||||||
|
call _write_error */
|
||||||
|
|
||||||
|
j .Llex_next_end
|
||||||
|
|
||||||
|
.Llex_next_comment:
|
||||||
|
addi s1, s1, 1
|
||||||
|
|
||||||
|
j .Llex_next_end
|
||||||
|
|
||||||
|
.Llex_next_identifier:
|
||||||
|
# An identifier can be a textual keyword.
|
||||||
|
# Check the kind of the token and write it into the output parameter.
|
||||||
|
lw a1, 12(sp)
|
||||||
|
sub a0, s1, a1
|
||||||
|
sw a0, 8(sp)
|
||||||
|
call classify_identifier
|
||||||
|
sw a0, 4(sp)
|
||||||
|
lw a0, 0(sp)
|
||||||
|
addi a1, sp, 4
|
||||||
|
li a2, 12
|
||||||
|
call _memcpy
|
||||||
|
|
||||||
|
j .Llex_next_end
|
||||||
|
|
||||||
|
.Llex_next_single:
|
||||||
|
lw a0, 12(sp)
|
||||||
|
addi s1, a0, 1
|
||||||
|
lbu a0, (a0)
|
||||||
|
call classify_single
|
||||||
|
lw a1, 0(sp)
|
||||||
|
sw a0, (a1)
|
||||||
|
|
||||||
|
j .Llex_next_end
|
||||||
|
|
||||||
|
.Llex_next_composite:
|
||||||
|
addi s1, s1, 1
|
||||||
|
lw a1, 12(sp)
|
||||||
|
sub a0, s1, a1
|
||||||
|
call classify_composite
|
||||||
|
lw a1, 0(sp)
|
||||||
|
sw a0, (a1)
|
||||||
|
|
||||||
|
j .Llex_next_end
|
||||||
|
|
||||||
|
.Llex_next_integer:
|
||||||
|
lw t0, 0(sp)
|
||||||
|
li t1, TOKEN_INTEGER
|
||||||
|
sw t1, 0(t0)
|
||||||
|
lw t1, 12(sp)
|
||||||
|
sw t1, 8(t0)
|
||||||
|
sub t1, s1, t1
|
||||||
|
sw t1, 4(t0)
|
||||||
|
|
||||||
|
j .Llex_next_end
|
||||||
|
|
||||||
|
.Llex_next_end:
|
||||||
|
mv a0, s1 # Return the advanced text pointer.
|
||||||
|
|
||||||
|
# Restore saved registers.
|
||||||
|
lw s1, 20(sp)
|
||||||
|
lw s2, 16(sp)
|
||||||
|
|
||||||
|
# Epilogue.
|
||||||
|
lw ra, 28(sp)
|
||||||
|
lw s0, 24(sp)
|
||||||
|
addi sp, sp, 32
|
||||||
|
ret
|
||||||
@ -1,21 +0,0 @@
|
|||||||
# Top level configure fragment for gcc Elna frontend.
|
|
||||||
# Copyright (C) 2025 Free Software Foundation, Inc.
|
|
||||||
|
|
||||||
# GCC 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.
|
|
||||||
|
|
||||||
# GCC 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 GCC; see the file COPYING3. If not see
|
|
||||||
# <http://www.gnu.org/licenses/>.
|
|
||||||
|
|
||||||
language="elna"
|
|
||||||
gcc_subdir="elna/gcc"
|
|
||||||
|
|
||||||
. ${srcdir}/elna/gcc/config-lang.in
|
|
||||||
163
gcc/Make-lang.in
163
gcc/Make-lang.in
@ -1,163 +0,0 @@
|
|||||||
# Top level -*- makefile -*- fragment for the Elna frontend.
|
|
||||||
# Copyright (C) 2025 Free Software Foundation, Inc.
|
|
||||||
|
|
||||||
# GCC 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.
|
|
||||||
|
|
||||||
# GCC 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 GCC; see the file COPYING3. If not see
|
|
||||||
# <http://www.gnu.org/licenses/>.
|
|
||||||
|
|
||||||
ELNA_INSTALL_NAME := $(shell echo gelna|sed '$(program_transform_name)')
|
|
||||||
ELNA_TARGET_INSTALL_NAME := $(target_noncanonical)-$(shell echo gelna|sed '$(program_transform_name)')
|
|
||||||
|
|
||||||
elna: elna1$(exeext)
|
|
||||||
|
|
||||||
.PHONY: elna
|
|
||||||
|
|
||||||
# Driver
|
|
||||||
|
|
||||||
ELNA_OBJS = \
|
|
||||||
$(GCC_OBJS) \
|
|
||||||
elna/elna-spec.o \
|
|
||||||
$(END)
|
|
||||||
|
|
||||||
gelna$(exeext): $(ELNA_OBJS) $(EXTRA_GCC_OBJS) libcommon-target.a $(LIBDEPS)
|
|
||||||
+$(LINKER) $(ALL_LINKERFLAGS) $(LDFLAGS) -o $@ \
|
|
||||||
$(ELNA_OBJS) $(EXTRA_GCC_OBJS) libcommon-target.a \
|
|
||||||
$(EXTRA_GCC_LIBS) $(LIBS)
|
|
||||||
|
|
||||||
# The compiler proper
|
|
||||||
|
|
||||||
elna_OBJS = \
|
|
||||||
elna/elna1.o \
|
|
||||||
elna/elna-generic.o \
|
|
||||||
elna/elna-diagnostic.o \
|
|
||||||
elna/elna-tree.o \
|
|
||||||
elna/elna-builtins.o \
|
|
||||||
elna/ast.o \
|
|
||||||
elna/dependency.o \
|
|
||||||
elna/driver.o \
|
|
||||||
elna/lexer.o \
|
|
||||||
elna/parser.o \
|
|
||||||
elna/semantic.o \
|
|
||||||
elna/symbol.o \
|
|
||||||
elna/result.o \
|
|
||||||
$(END)
|
|
||||||
|
|
||||||
elna1$(exeext): attribs.o $(elna_OBJS) $(BACKEND) $(LIBDEPS)
|
|
||||||
+$(LLINKER) $(ALL_LINKERFLAGS) $(LDFLAGS) -o $@ \
|
|
||||||
attribs.o $(elna_OBJS) $(BACKEND) $(LIBS) $(BACKENDLIBS)
|
|
||||||
|
|
||||||
elna.all.cross:
|
|
||||||
|
|
||||||
elna.start.encap: gelna$(exeext)
|
|
||||||
elna.rest.encap:
|
|
||||||
|
|
||||||
# No elna-specific selftests.
|
|
||||||
selftest-elna:
|
|
||||||
|
|
||||||
ELNA_TEXI_FILES = \
|
|
||||||
elna/gcc/gelna.texi \
|
|
||||||
$(srcdir)/doc/include/fdl.texi \
|
|
||||||
$(srcdir)/doc/include/gpl_v3.texi \
|
|
||||||
$(srcdir)/doc/include/funding.texi \
|
|
||||||
$(srcdir)/doc/include/gcc-common.texi \
|
|
||||||
gcc-vers.texi
|
|
||||||
|
|
||||||
elna.install-common: installdirs
|
|
||||||
-rm -f $(DESTDIR)$(bindir)/$(ELNA_INSTALL_NAME)$(exeext)
|
|
||||||
$(INSTALL_PROGRAM) gelna$(exeext) $(DESTDIR)$(bindir)/$(ELNA_INSTALL_NAME)$(exeext)
|
|
||||||
rm -f $(DESTDIR)$(bindir)/$(ELNA_TARGET_INSTALL_NAME)$(exeext); \
|
|
||||||
( cd $(DESTDIR)$(bindir) && \
|
|
||||||
$(LN) $(ELNA_INSTALL_NAME)$(exeext) $(ELNA_TARGET_INSTALL_NAME)$(exeext) ); \
|
|
||||||
|
|
||||||
$(build_htmldir)/gelna/index.html: $(ELNA_TEXI_FILES)
|
|
||||||
$(mkinstalldirs) $(@D)
|
|
||||||
rm -f $(@D)/*
|
|
||||||
$(TEXI2HTML) -I $(gcc_docdir)/include -I $(srcdir)/elna -o $(@D) $<
|
|
||||||
|
|
||||||
# Required goals, they still do nothing
|
|
||||||
elna.install-man:
|
|
||||||
elna.install-info:
|
|
||||||
elna.install-pdf:
|
|
||||||
elna.install-plugin:
|
|
||||||
|
|
||||||
elna.install-html: $(build_htmldir)/gelna
|
|
||||||
@$(NORMAL_INSTALL)
|
|
||||||
test -z "$(htmldir)" || $(mkinstalldirs) "$(DESTDIR)$(htmldir)"
|
|
||||||
@for p in $(build_htmldir)/gelna; do \
|
|
||||||
if test -f "$$p" || test -d "$$p"; then d=""; else d="$(srcdir)/"; fi; \
|
|
||||||
f=$(html__strip_dir) \
|
|
||||||
if test -d "$$d$$p"; then \
|
|
||||||
echo " $(mkinstalldirs) '$(DESTDIR)$(htmldir)/$$f'"; \
|
|
||||||
$(mkinstalldirs) "$(DESTDIR)$(htmldir)/$$f" || exit 1; \
|
|
||||||
echo " $(INSTALL_DATA) '$$d$$p'/* '$(DESTDIR)$(htmldir)/$$f'"; \
|
|
||||||
$(INSTALL_DATA) "$$d$$p"/* "$(DESTDIR)$(htmldir)/$$f"; \
|
|
||||||
else \
|
|
||||||
echo " $(INSTALL_DATA) '$$d$$p' '$(DESTDIR)$(htmldir)/$$f'"; \
|
|
||||||
$(INSTALL_DATA) "$$d$$p" "$(DESTDIR)$(htmldir)/$$f"; \
|
|
||||||
fi; \
|
|
||||||
done
|
|
||||||
|
|
||||||
elna.info:
|
|
||||||
elna.dvi:
|
|
||||||
elna.pdf:
|
|
||||||
elna.html: $(build_htmldir)/gelna/index.html
|
|
||||||
elna.man:
|
|
||||||
elna.mostlyclean:
|
|
||||||
elna.clean:
|
|
||||||
elna.distclean:
|
|
||||||
elna.maintainer-clean:
|
|
||||||
|
|
||||||
# make uninstall
|
|
||||||
elna.uninstall:
|
|
||||||
-rm -f gelna$(exeext) elna1$(exeext)
|
|
||||||
-rm -f $(elna_OBJS)
|
|
||||||
|
|
||||||
# Used for handling bootstrap
|
|
||||||
elna.stage1: stage1-start
|
|
||||||
-mv elna/*$(objext) stage1/elna
|
|
||||||
elna.stage2: stage2-start
|
|
||||||
-mv elna/*$(objext) stage2/elna
|
|
||||||
elna.stage3: stage3-start
|
|
||||||
-mv elna/*$(objext) stage3/elna
|
|
||||||
elna.stage4: stage4-start
|
|
||||||
-mv elna/*$(objext) stage4/elna
|
|
||||||
elna.stageprofile: stageprofile-start
|
|
||||||
-mv elna/*$(objext) stageprofile/elna
|
|
||||||
elna.stagefeedback: stagefeedback-start
|
|
||||||
-mv elna/*$(objext) stagefeedback/elna
|
|
||||||
|
|
||||||
ELNA_INCLUDES = -I $(srcdir)/elna/include -I elna/generated
|
|
||||||
ELNA_CXXFLAGS = -std=c++17
|
|
||||||
|
|
||||||
elna/%.o: elna/boot/%.cc elna/generated/parser.hh elna/generated/location.hh
|
|
||||||
$(COMPILE) $(ELNA_CXXFLAGS) $(ELNA_INCLUDES) $<
|
|
||||||
$(POSTCOMPILE)
|
|
||||||
|
|
||||||
elna/%.o: elna/generated/%.cc elna/generated/parser.hh elna/generated/location.hh
|
|
||||||
$(COMPILE) $(ELNA_CXXFLAGS) $(ELNA_INCLUDES) $<
|
|
||||||
$(POSTCOMPILE)
|
|
||||||
|
|
||||||
elna/%.o: elna/gcc/%.cc elna/generated/parser.hh elna/generated/location.hh
|
|
||||||
$(COMPILE) $(ELNA_CXXFLAGS) $(ELNA_INCLUDES) $<
|
|
||||||
$(POSTCOMPILE)
|
|
||||||
|
|
||||||
elna/generated/parser.cc: elna/boot/parser.yy
|
|
||||||
mkdir -p $(dir $@)
|
|
||||||
$(BISON) -d -o $@ $<
|
|
||||||
|
|
||||||
elna/generated/parser.hh elna/generated/location.hh: elna/generated/parser.cc
|
|
||||||
@touch $@
|
|
||||||
|
|
||||||
elna/generated/lexer.cc: elna/boot/lexer.ll
|
|
||||||
mkdir -p $(dir $@)
|
|
||||||
$(FLEX) -o $@ $<
|
|
||||||
@ -1,37 +0,0 @@
|
|||||||
# Top level configure fragment for gcc Elna frontend.
|
|
||||||
# Copyright (C) 2025 Free Software Foundation, Inc.
|
|
||||||
|
|
||||||
# GCC 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.
|
|
||||||
|
|
||||||
# GCC 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 GCC; see the file COPYING3. If not see
|
|
||||||
# <http://www.gnu.org/licenses/>.
|
|
||||||
|
|
||||||
# Configure looks for the existence of this file to auto-config each language.
|
|
||||||
# We define several parameters used by configure:
|
|
||||||
#
|
|
||||||
# language - name of language as it would appear in $(LANGUAGES)
|
|
||||||
# boot_language - "yes" if we need to build this language in stage1
|
|
||||||
# compilers - value to add to $(COMPILERS)
|
|
||||||
|
|
||||||
language="elna"
|
|
||||||
gcc_subdir="elna/gcc"
|
|
||||||
|
|
||||||
compilers="elna1\$(exeext)"
|
|
||||||
|
|
||||||
target_libs=""
|
|
||||||
|
|
||||||
gtfiles="\$(srcdir)/elna/gcc/elna1.cc \$(srcdir)/elna/include/elna/gcc/elna1.h"
|
|
||||||
|
|
||||||
lang_requires_boot_languages=c++
|
|
||||||
|
|
||||||
# Do not build by default
|
|
||||||
build_by_default="no"
|
|
||||||
@ -1,82 +0,0 @@
|
|||||||
/* Builtin definitions.
|
|
||||||
Copyright (C) 2025 Free Software Foundation, Inc.
|
|
||||||
|
|
||||||
GCC 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.
|
|
||||||
|
|
||||||
GCC 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 GCC; see the file COPYING3. If not see
|
|
||||||
<http://www.gnu.org/licenses/>. */
|
|
||||||
|
|
||||||
#include "elna/gcc/elna-builtins.h"
|
|
||||||
#include "elna/gcc/elna1.h"
|
|
||||||
#include "stor-layout.h"
|
|
||||||
#include "stringpool.h"
|
|
||||||
#include "elna/gcc/elna-tree.h"
|
|
||||||
|
|
||||||
namespace elna::gcc
|
|
||||||
{
|
|
||||||
void init_ttree()
|
|
||||||
{
|
|
||||||
elna_int_type_node = long_integer_type_node;
|
|
||||||
elna_word_type_node = size_type_node;
|
|
||||||
elna_char_type_node = unsigned_char_type_node;
|
|
||||||
elna_byte_type_node = make_unsigned_type(8);
|
|
||||||
elna_float_type_node = double_type_node;
|
|
||||||
|
|
||||||
elna_bool_type_node = boolean_type_node;
|
|
||||||
elna_bool_true_node = boolean_true_node;
|
|
||||||
elna_bool_false_node = boolean_false_node;
|
|
||||||
|
|
||||||
elna_pointer_nil_node = null_pointer_node;
|
|
||||||
|
|
||||||
elna_string_type_node = make_node(RECORD_TYPE);
|
|
||||||
tree string_ptr_type = build_pointer_type_for_mode(elna_char_type_node, VOIDmode, true);
|
|
||||||
|
|
||||||
elna_string_length_field_node = build_field(UNKNOWN_LOCATION,
|
|
||||||
elna_string_type_node, "length", build_qualified_type(elna_word_type_node, TYPE_QUAL_CONST));
|
|
||||||
elna_string_ptr_field_node = build_field(UNKNOWN_LOCATION,
|
|
||||||
elna_string_type_node, "ptr", build_qualified_type(string_ptr_type, TYPE_QUAL_CONST));
|
|
||||||
|
|
||||||
TYPE_FIELDS(elna_string_type_node) = chainon(elna_string_ptr_field_node, elna_string_length_field_node);
|
|
||||||
layout_type(elna_string_type_node);
|
|
||||||
}
|
|
||||||
|
|
||||||
static
|
|
||||||
tree declare_builtin_type(std::shared_ptr<symbol_table> symbol_table, const char *name, tree type)
|
|
||||||
{
|
|
||||||
tree identifier = get_identifier(name);
|
|
||||||
tree type_declaration = build_decl(UNKNOWN_LOCATION, TYPE_DECL, identifier, type);
|
|
||||||
|
|
||||||
TREE_PUBLIC(type_declaration) = 1;
|
|
||||||
|
|
||||||
symbol_table->enter(name, type_declaration);
|
|
||||||
|
|
||||||
return type_declaration;
|
|
||||||
}
|
|
||||||
|
|
||||||
std::shared_ptr<symbol_table> builtin_symbol_table()
|
|
||||||
{
|
|
||||||
std::shared_ptr<elna::gcc::symbol_table> symbol_table = std::make_shared<elna::gcc::symbol_table>();
|
|
||||||
|
|
||||||
declare_builtin_type(symbol_table, "Int", elna_int_type_node);
|
|
||||||
declare_builtin_type(symbol_table, "Word", elna_word_type_node);
|
|
||||||
declare_builtin_type(symbol_table, "Char", elna_char_type_node);
|
|
||||||
declare_builtin_type(symbol_table, "Bool", elna_bool_type_node);
|
|
||||||
declare_builtin_type(symbol_table, "Byte", elna_byte_type_node);
|
|
||||||
declare_builtin_type(symbol_table, "Float", elna_float_type_node);
|
|
||||||
|
|
||||||
tree string_declaration = declare_builtin_type(symbol_table, "String", elna_string_type_node);
|
|
||||||
TYPE_NAME(elna_string_type_node) = DECL_NAME(string_declaration);
|
|
||||||
TYPE_STUB_DECL(elna_string_type_node) = string_declaration;
|
|
||||||
|
|
||||||
return symbol_table;
|
|
||||||
}
|
|
||||||
}
|
|
||||||
@ -1,153 +0,0 @@
|
|||||||
/* Elna frontend specific diagnostic routines.
|
|
||||||
Copyright (C) 2025 Free Software Foundation, Inc.
|
|
||||||
|
|
||||||
GCC 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.
|
|
||||||
|
|
||||||
GCC 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 GCC; see the file COPYING3. If not see
|
|
||||||
<http://www.gnu.org/licenses/>. */
|
|
||||||
|
|
||||||
#include "elna/gcc/elna-diagnostic.h"
|
|
||||||
#include "elna/gcc/elna-tree.h"
|
|
||||||
#include "elna/gcc/elna1.h"
|
|
||||||
|
|
||||||
namespace elna::gcc
|
|
||||||
{
|
|
||||||
location_t get_location(const boot::position *position)
|
|
||||||
{
|
|
||||||
linemap_line_start(line_table, position->line, 0);
|
|
||||||
|
|
||||||
return linemap_position_for_column(line_table, position->column);
|
|
||||||
}
|
|
||||||
|
|
||||||
std::string print_aggregate_name(tree type, const std::string& kind_name)
|
|
||||||
{
|
|
||||||
if (TYPE_IDENTIFIER(type) == NULL_TREE)
|
|
||||||
{
|
|
||||||
return kind_name;
|
|
||||||
}
|
|
||||||
else
|
|
||||||
{
|
|
||||||
return std::string(IDENTIFIER_POINTER(TYPE_IDENTIFIER(type)));
|
|
||||||
}
|
|
||||||
}
|
|
||||||
|
|
||||||
std::string print_type(tree type)
|
|
||||||
{
|
|
||||||
gcc_assert(TYPE_P(type));
|
|
||||||
|
|
||||||
tree unqualified_type = get_qualified_type(type, TYPE_UNQUALIFIED);
|
|
||||||
tree_code code = TREE_CODE(type);
|
|
||||||
|
|
||||||
if (unqualified_type == elna_int_type_node)
|
|
||||||
{
|
|
||||||
return "Int";
|
|
||||||
}
|
|
||||||
else if (unqualified_type == elna_word_type_node)
|
|
||||||
{
|
|
||||||
return "Word";
|
|
||||||
}
|
|
||||||
else if (unqualified_type == elna_bool_type_node)
|
|
||||||
{
|
|
||||||
return "Bool";
|
|
||||||
}
|
|
||||||
else if (unqualified_type == elna_byte_type_node)
|
|
||||||
{
|
|
||||||
return "Byte";
|
|
||||||
}
|
|
||||||
else if (unqualified_type == elna_float_type_node)
|
|
||||||
{
|
|
||||||
return "Float";
|
|
||||||
}
|
|
||||||
else if (unqualified_type == elna_char_type_node)
|
|
||||||
{
|
|
||||||
return "Char";
|
|
||||||
}
|
|
||||||
else if (unqualified_type == elna_string_type_node)
|
|
||||||
{
|
|
||||||
return "String";
|
|
||||||
}
|
|
||||||
else if (is_void_type(unqualified_type)) // For procedures without a return type.
|
|
||||||
{
|
|
||||||
return "()";
|
|
||||||
}
|
|
||||||
else if (POINTER_TYPE_P(unqualified_type))
|
|
||||||
{
|
|
||||||
tree pointer_target_type = TREE_TYPE(type);
|
|
||||||
|
|
||||||
if (TREE_CODE(pointer_target_type) == FUNCTION_TYPE)
|
|
||||||
{
|
|
||||||
return print_type(pointer_target_type);
|
|
||||||
}
|
|
||||||
else
|
|
||||||
{
|
|
||||||
return std::string("^" + print_type(pointer_target_type));
|
|
||||||
}
|
|
||||||
}
|
|
||||||
else if (code == FUNCTION_TYPE)
|
|
||||||
{
|
|
||||||
std::string output = "proc(";
|
|
||||||
tree parameter_type = TYPE_ARG_TYPES(type);
|
|
||||||
while (TREE_VALUE(parameter_type) != void_type_node)
|
|
||||||
{
|
|
||||||
output += print_type(TREE_VALUE(parameter_type));
|
|
||||||
parameter_type = TREE_CHAIN(parameter_type);
|
|
||||||
if (TREE_VALUE(parameter_type) == void_type_node)
|
|
||||||
{
|
|
||||||
break;
|
|
||||||
}
|
|
||||||
else
|
|
||||||
{
|
|
||||||
output += ", ";
|
|
||||||
}
|
|
||||||
}
|
|
||||||
output += ')';
|
|
||||||
tree return_type = TREE_TYPE(type);
|
|
||||||
|
|
||||||
if (!is_void_type(return_type))
|
|
||||||
{
|
|
||||||
output += " -> " + print_type(return_type);
|
|
||||||
}
|
|
||||||
return output;
|
|
||||||
}
|
|
||||||
else if (code == ARRAY_TYPE)
|
|
||||||
{
|
|
||||||
return "array";
|
|
||||||
}
|
|
||||||
else if (code == RECORD_TYPE)
|
|
||||||
{
|
|
||||||
return print_aggregate_name(unqualified_type, "record");
|
|
||||||
}
|
|
||||||
else if (code == UNION_TYPE)
|
|
||||||
{
|
|
||||||
return print_aggregate_name(unqualified_type, "union");
|
|
||||||
}
|
|
||||||
else if (code == ENUMERAL_TYPE)
|
|
||||||
{
|
|
||||||
return print_aggregate_name(unqualified_type, "enumeration");
|
|
||||||
}
|
|
||||||
else
|
|
||||||
{
|
|
||||||
return "<<unknown-type>>";
|
|
||||||
}
|
|
||||||
gcc_unreachable();
|
|
||||||
}
|
|
||||||
|
|
||||||
void report_errors(const std::deque<std::unique_ptr<boot::error>>& errors)
|
|
||||||
{
|
|
||||||
for (const auto& error : errors)
|
|
||||||
{
|
|
||||||
auto gcc_location = elna::gcc::get_location(&error->position);
|
|
||||||
|
|
||||||
error_at(gcc_location, error->what().c_str());
|
|
||||||
}
|
|
||||||
}
|
|
||||||
}
|
|
||||||
1609
gcc/elna-generic.cc
1609
gcc/elna-generic.cc
File diff suppressed because it is too large
Load Diff
@ -1,31 +0,0 @@
|
|||||||
/* Specific flags and argument handling of the Elna front end.
|
|
||||||
Copyright (C) 2025 Free Software Foundation, Inc.
|
|
||||||
|
|
||||||
GCC 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.
|
|
||||||
|
|
||||||
GCC 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 GCC; see the file COPYING3. If not see
|
|
||||||
<http://www.gnu.org/licenses/>. */
|
|
||||||
|
|
||||||
void lang_specific_driver(struct cl_decoded_option ** /* in_decoded_options */,
|
|
||||||
unsigned int * /* in_decoded_options_count */,
|
|
||||||
int * /*in_added_libraries */)
|
|
||||||
{
|
|
||||||
}
|
|
||||||
|
|
||||||
/* Called before linking. Returns 0 on success and -1 on failure. */
|
|
||||||
int lang_specific_pre_link(void)
|
|
||||||
{
|
|
||||||
return 0;
|
|
||||||
}
|
|
||||||
|
|
||||||
/* Number of extra output files that lang_specific_pre_link may generate. */
|
|
||||||
int lang_specific_extra_outfiles = 0;
|
|
||||||
267
gcc/elna-tree.cc
267
gcc/elna-tree.cc
@ -1,267 +0,0 @@
|
|||||||
/* Utilities to manipulate GCC trees.
|
|
||||||
Copyright (C) 2025 Free Software Foundation, Inc.
|
|
||||||
|
|
||||||
GCC 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.
|
|
||||||
|
|
||||||
GCC 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 GCC; see the file COPYING3. If not see
|
|
||||||
<http://www.gnu.org/licenses/>. */
|
|
||||||
|
|
||||||
#include "elna/gcc/elna-tree.h"
|
|
||||||
#include "elna/gcc/elna-diagnostic.h"
|
|
||||||
#include "elna/gcc/elna1.h"
|
|
||||||
|
|
||||||
#include "function.h"
|
|
||||||
#include "stor-layout.h"
|
|
||||||
#include "fold-const.h"
|
|
||||||
#include "diagnostic-core.h"
|
|
||||||
|
|
||||||
namespace elna::gcc
|
|
||||||
{
|
|
||||||
bool is_integral_type(tree type)
|
|
||||||
{
|
|
||||||
gcc_assert(TYPE_P(type));
|
|
||||||
return TREE_CODE(type) == INTEGER_TYPE && type != elna_char_type_node;
|
|
||||||
}
|
|
||||||
|
|
||||||
bool is_numeric_type(tree type)
|
|
||||||
{
|
|
||||||
return is_integral_type(type) || type == elna_float_type_node;
|
|
||||||
}
|
|
||||||
|
|
||||||
bool is_unique_type(tree type)
|
|
||||||
{
|
|
||||||
gcc_assert(TYPE_P(type));
|
|
||||||
return RECORD_OR_UNION_TYPE_P(type) || TREE_CODE(type) == ENUMERAL_TYPE;
|
|
||||||
}
|
|
||||||
|
|
||||||
bool is_void_type(tree type)
|
|
||||||
{
|
|
||||||
return type == NULL_TREE || type == void_type_node;
|
|
||||||
}
|
|
||||||
|
|
||||||
bool is_castable_type(tree type)
|
|
||||||
{
|
|
||||||
gcc_assert(TYPE_P(type));
|
|
||||||
return INTEGRAL_TYPE_P(type) || POINTER_TYPE_P(type) || TREE_CODE(type) == REAL_TYPE;
|
|
||||||
}
|
|
||||||
|
|
||||||
bool are_compatible_pointers(tree lhs_type, tree rhs)
|
|
||||||
{
|
|
||||||
gcc_assert(TYPE_P(lhs_type));
|
|
||||||
tree rhs_type = TREE_TYPE(rhs);
|
|
||||||
|
|
||||||
return (POINTER_TYPE_P(lhs_type) && rhs == elna_pointer_nil_node)
|
|
||||||
|| (POINTER_TYPE_P(lhs_type) && lhs_type == rhs_type);
|
|
||||||
}
|
|
||||||
|
|
||||||
tree prepare_rvalue(tree rvalue)
|
|
||||||
{
|
|
||||||
if (DECL_P(rvalue) && TREE_CODE(TREE_TYPE(rvalue)) == FUNCTION_TYPE)
|
|
||||||
{
|
|
||||||
return build1(ADDR_EXPR, build_pointer_type_for_mode(TREE_TYPE(rvalue), VOIDmode, true), rvalue);
|
|
||||||
}
|
|
||||||
else
|
|
||||||
{
|
|
||||||
return rvalue;
|
|
||||||
}
|
|
||||||
}
|
|
||||||
|
|
||||||
bool is_assignable_from(tree assignee, tree assignment)
|
|
||||||
{
|
|
||||||
return get_qualified_type(TREE_TYPE(assignment), TYPE_UNQUALIFIED) == assignee
|
|
||||||
|| are_compatible_pointers(assignee, assignment);
|
|
||||||
}
|
|
||||||
|
|
||||||
void append_statement(tree statement_tree)
|
|
||||||
{
|
|
||||||
if (!vec_safe_is_empty(f_binding_level->defers))
|
|
||||||
{
|
|
||||||
append_to_statement_list(statement_tree, &f_binding_level->defers->begin()->try_statements);
|
|
||||||
}
|
|
||||||
else
|
|
||||||
{
|
|
||||||
append_to_statement_list(statement_tree, &f_binding_level->statement_list);
|
|
||||||
}
|
|
||||||
}
|
|
||||||
|
|
||||||
void defer(tree statement_tree)
|
|
||||||
{
|
|
||||||
defer_scope new_defer{ statement_tree, alloc_stmt_list() };
|
|
||||||
vec_safe_insert(f_binding_level->defers, 0, new_defer);
|
|
||||||
}
|
|
||||||
|
|
||||||
tree chain_defer()
|
|
||||||
{
|
|
||||||
if (vec_safe_is_empty(f_binding_level->defers))
|
|
||||||
{
|
|
||||||
return f_binding_level->statement_list;
|
|
||||||
}
|
|
||||||
defer_scope *defer_iterator = f_binding_level->defers->begin();
|
|
||||||
tree defer_tree = build2(TRY_FINALLY_EXPR, void_type_node,
|
|
||||||
defer_iterator->try_statements, defer_iterator->defer_block);
|
|
||||||
int i;
|
|
||||||
|
|
||||||
FOR_EACH_VEC_ELT_FROM(*f_binding_level->defers, i, defer_iterator, 1)
|
|
||||||
{
|
|
||||||
append_to_statement_list(defer_tree, &defer_iterator->try_statements);
|
|
||||||
defer_tree = build2(TRY_FINALLY_EXPR, void_type_node,
|
|
||||||
defer_iterator->try_statements, defer_iterator->defer_block);
|
|
||||||
}
|
|
||||||
return build2(COMPOUND_EXPR, TREE_TYPE(defer_tree), f_binding_level->statement_list, defer_tree);
|
|
||||||
}
|
|
||||||
|
|
||||||
tree build_field(location_t location, tree record_type, const std::string name, tree type)
|
|
||||||
{
|
|
||||||
tree field_declaration = build_decl(location,
|
|
||||||
FIELD_DECL, get_identifier(name.c_str()), type);
|
|
||||||
TREE_ADDRESSABLE(field_declaration) = 1;
|
|
||||||
DECL_CONTEXT(field_declaration) = record_type;
|
|
||||||
|
|
||||||
return field_declaration;
|
|
||||||
}
|
|
||||||
|
|
||||||
tree do_pointer_arithmetic(boot::binary_operator binary_operator,
|
|
||||||
tree left, tree right, location_t operation_location)
|
|
||||||
{
|
|
||||||
tree left_type = get_qualified_type(TREE_TYPE(left), TYPE_UNQUALIFIED);
|
|
||||||
tree right_type = get_qualified_type(TREE_TYPE(right), TYPE_UNQUALIFIED);
|
|
||||||
if (binary_operator == boot::binary_operator::sum)
|
|
||||||
{
|
|
||||||
tree pointer{ NULL_TREE };
|
|
||||||
tree offset{ NULL_TREE };
|
|
||||||
|
|
||||||
if (POINTER_TYPE_P(left_type) && is_integral_type(right_type))
|
|
||||||
{
|
|
||||||
pointer = left;
|
|
||||||
offset = right;
|
|
||||||
}
|
|
||||||
else if (is_integral_type(left_type) && POINTER_TYPE_P(right_type))
|
|
||||||
{
|
|
||||||
pointer = right;
|
|
||||||
offset = left;
|
|
||||||
}
|
|
||||||
else
|
|
||||||
{
|
|
||||||
return error_mark_node;
|
|
||||||
}
|
|
||||||
tree size_exp = fold_convert(TREE_TYPE(offset), size_in_bytes(TREE_TYPE(TREE_TYPE(pointer))));
|
|
||||||
|
|
||||||
offset = fold_build2(MULT_EXPR, TREE_TYPE(offset), offset, size_exp);
|
|
||||||
offset = fold_convert(sizetype, offset);
|
|
||||||
|
|
||||||
return fold_build2_loc(operation_location, POINTER_PLUS_EXPR, TREE_TYPE(pointer), pointer, offset);
|
|
||||||
}
|
|
||||||
else if (binary_operator == boot::binary_operator::subtraction)
|
|
||||||
{
|
|
||||||
if (POINTER_TYPE_P(left_type) && is_integral_type(right_type))
|
|
||||||
{
|
|
||||||
tree pointer_type = left_type;
|
|
||||||
tree offset_type = right_type;
|
|
||||||
tree size_exp = fold_convert(offset_type, size_in_bytes(TREE_TYPE(pointer_type)));
|
|
||||||
|
|
||||||
tree convert_expression = fold_build2(MULT_EXPR, offset_type, right, size_exp);
|
|
||||||
convert_expression = fold_convert(sizetype, convert_expression);
|
|
||||||
|
|
||||||
convert_expression = fold_build1(NEGATE_EXPR, sizetype, convert_expression);
|
|
||||||
return fold_build2_loc(operation_location, POINTER_PLUS_EXPR, pointer_type, left, convert_expression);
|
|
||||||
}
|
|
||||||
else if (POINTER_TYPE_P(left_type) && POINTER_TYPE_P(right_type) && left_type == right_type)
|
|
||||||
{
|
|
||||||
return fold_build2_loc(operation_location, POINTER_DIFF_EXPR, ssizetype, left, right);
|
|
||||||
}
|
|
||||||
}
|
|
||||||
gcc_unreachable();
|
|
||||||
}
|
|
||||||
|
|
||||||
tree build_binary_operation(bool condition, boot::binary_expression *expression,
|
|
||||||
tree_code operator_code, tree left, tree right, tree target_type)
|
|
||||||
{
|
|
||||||
location_t expression_location = get_location(&expression->position());
|
|
||||||
tree left_type = get_qualified_type(TREE_TYPE(left), TYPE_UNQUALIFIED);
|
|
||||||
tree right_type = get_qualified_type(TREE_TYPE(right), TYPE_UNQUALIFIED);
|
|
||||||
|
|
||||||
if (condition)
|
|
||||||
{
|
|
||||||
return fold_build2_loc(expression_location, operator_code, target_type, left, right);
|
|
||||||
}
|
|
||||||
else
|
|
||||||
{
|
|
||||||
error_at(expression_location,
|
|
||||||
"invalid operands of type '%s' and '%s' for operator %s",
|
|
||||||
print_type(left_type).c_str(), print_type(right_type).c_str(),
|
|
||||||
elna::boot::print_binary_operator(expression->operation()));
|
|
||||||
return error_mark_node;
|
|
||||||
}
|
|
||||||
}
|
|
||||||
|
|
||||||
tree find_field_by_name(location_t expression_location, tree type, const std::string& field_name)
|
|
||||||
{
|
|
||||||
if (type == error_mark_node)
|
|
||||||
{
|
|
||||||
return type;
|
|
||||||
}
|
|
||||||
tree field_declaration = TYPE_FIELDS(type);
|
|
||||||
|
|
||||||
if (!RECORD_OR_UNION_TYPE_P(type))
|
|
||||||
{
|
|
||||||
error_at(expression_location, "Type '%s' does not have a field named '%s'",
|
|
||||||
print_type(type).c_str(), field_name.c_str());
|
|
||||||
return error_mark_node;
|
|
||||||
}
|
|
||||||
while (field_declaration != NULL_TREE)
|
|
||||||
{
|
|
||||||
tree declaration_name = DECL_NAME(field_declaration);
|
|
||||||
const char *identifier_pointer = IDENTIFIER_POINTER(declaration_name);
|
|
||||||
|
|
||||||
if (field_name == identifier_pointer)
|
|
||||||
{
|
|
||||||
break;
|
|
||||||
}
|
|
||||||
field_declaration = TREE_CHAIN(field_declaration);
|
|
||||||
}
|
|
||||||
if (field_declaration == NULL_TREE)
|
|
||||||
{
|
|
||||||
error_at(expression_location, "Aggregate type does not have a field '%s'", field_name.c_str());
|
|
||||||
return error_mark_node;
|
|
||||||
}
|
|
||||||
return field_declaration;
|
|
||||||
}
|
|
||||||
|
|
||||||
tree build_global_pointer_type(tree type)
|
|
||||||
{
|
|
||||||
return build_pointer_type_for_mode(type, VOIDmode, true);
|
|
||||||
}
|
|
||||||
|
|
||||||
tree build_label_decl(const char *name, location_t loc)
|
|
||||||
{
|
|
||||||
auto label_decl = build_decl(loc, LABEL_DECL, get_identifier(name), void_type_node);
|
|
||||||
|
|
||||||
DECL_CONTEXT(label_decl) = current_function_decl;
|
|
||||||
|
|
||||||
return label_decl;
|
|
||||||
}
|
|
||||||
|
|
||||||
tree extract_constant(tree expression)
|
|
||||||
{
|
|
||||||
int code = TREE_CODE(expression);
|
|
||||||
|
|
||||||
if (code == CONST_DECL)
|
|
||||||
{
|
|
||||||
return DECL_INITIAL(expression);
|
|
||||||
}
|
|
||||||
else if (TREE_CODE_CLASS(code) == tcc_constant)
|
|
||||||
{
|
|
||||||
return expression;
|
|
||||||
}
|
|
||||||
return NULL_TREE;
|
|
||||||
}
|
|
||||||
}
|
|
||||||
244
gcc/elna1.cc
244
gcc/elna1.cc
@ -1,244 +0,0 @@
|
|||||||
/* Language-dependent hooks for Elna.
|
|
||||||
Copyright (C) 2025 Free Software Foundation, Inc.
|
|
||||||
|
|
||||||
GCC 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.
|
|
||||||
|
|
||||||
GCC 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 GCC; see the file COPYING3. If not see
|
|
||||||
<http://www.gnu.org/licenses/>. */
|
|
||||||
|
|
||||||
#include "config.h"
|
|
||||||
#include "system.h"
|
|
||||||
#include "coretypes.h"
|
|
||||||
#include "target.h"
|
|
||||||
#include "function.h"
|
|
||||||
#include "tree.h"
|
|
||||||
#include "elna/gcc/elna1.h"
|
|
||||||
#include "diagnostic.h"
|
|
||||||
#include "opts.h"
|
|
||||||
#include "debug.h"
|
|
||||||
#include "langhooks.h"
|
|
||||||
#include "langhooks-def.h"
|
|
||||||
|
|
||||||
#include <fstream>
|
|
||||||
#include "elna/boot/dependency.h"
|
|
||||||
#include "elna/gcc/elna-tree.h"
|
|
||||||
#include "elna/gcc/elna-generic.h"
|
|
||||||
#include "elna/gcc/elna-diagnostic.h"
|
|
||||||
#include "elna/gcc/elna-builtins.h"
|
|
||||||
|
|
||||||
tree elna_global_trees[ELNA_TI_MAX];
|
|
||||||
hash_map<nofree_string_hash, tree> *elna_global_decls = nullptr;
|
|
||||||
|
|
||||||
/* The resulting tree type. */
|
|
||||||
|
|
||||||
union GTY ((desc("TREE_CODE (&%h.generic) == IDENTIFIER_NODE"),
|
|
||||||
chain_next("CODE_CONTAINS_STRUCT (TREE_CODE (&%h.generic), "
|
|
||||||
"TS_COMMON) ? ((union lang_tree_node *) TREE_CHAIN "
|
|
||||||
"(&%h.generic)) : NULL"))) lang_tree_node
|
|
||||||
{
|
|
||||||
union tree_node GTY ((tag ("0"), desc ("tree_node_structure (&%h)"))) generic;
|
|
||||||
};
|
|
||||||
|
|
||||||
/* Language hooks. */
|
|
||||||
|
|
||||||
static bool elna_langhook_init(void)
|
|
||||||
{
|
|
||||||
build_common_tree_nodes(false);
|
|
||||||
|
|
||||||
elna::gcc::init_ttree();
|
|
||||||
elna_global_decls = hash_map<nofree_string_hash, tree>::create_ggc(default_hash_map_size);
|
|
||||||
|
|
||||||
build_common_builtin_nodes();
|
|
||||||
|
|
||||||
return true;
|
|
||||||
}
|
|
||||||
|
|
||||||
static void elna_parse_file(const char *filename)
|
|
||||||
{
|
|
||||||
std::ifstream file{ filename, std::ios::in };
|
|
||||||
|
|
||||||
if (!file)
|
|
||||||
{
|
|
||||||
fatal_error(UNKNOWN_LOCATION, "cannot open filename %s: %m", filename);
|
|
||||||
}
|
|
||||||
elna::boot::dependency_graph outcome = elna::boot::read_sources(file, filename);
|
|
||||||
|
|
||||||
std::shared_ptr<elna::boot::symbol_table> info_table = elna::boot::builtin_symbol_table();
|
|
||||||
std::shared_ptr<elna::gcc::symbol_table> symbol_table = elna::gcc::builtin_symbol_table();
|
|
||||||
|
|
||||||
linemap_add(line_table, LC_ENTER, 0, filename, 1);
|
|
||||||
if (outcome.has_errors())
|
|
||||||
{
|
|
||||||
elna::gcc::report_errors(outcome.errors());
|
|
||||||
}
|
|
||||||
else
|
|
||||||
{
|
|
||||||
for (const std::unique_ptr<elna::boot::program>& module_tree : outcome.modules)
|
|
||||||
{
|
|
||||||
std::unordered_map<std::string, tree> unresolved;
|
|
||||||
|
|
||||||
auto semantic_errors = elna::gcc::do_semantic_analysis(filename, module_tree,
|
|
||||||
info_table, symbol_table, unresolved);
|
|
||||||
|
|
||||||
if (semantic_errors.empty())
|
|
||||||
{
|
|
||||||
elna::gcc::generic_visitor generic_visitor{ symbol_table, std::move(unresolved) };
|
|
||||||
generic_visitor.visit(module_tree.get());
|
|
||||||
}
|
|
||||||
else
|
|
||||||
{
|
|
||||||
elna::gcc::report_errors(semantic_errors);
|
|
||||||
}
|
|
||||||
}
|
|
||||||
}
|
|
||||||
linemap_add(line_table, LC_LEAVE, 0, NULL, 0);
|
|
||||||
}
|
|
||||||
|
|
||||||
static void elna_langhook_parse_file(void)
|
|
||||||
{
|
|
||||||
for (unsigned int i = 0; i < num_in_fnames; i++)
|
|
||||||
{
|
|
||||||
elna_parse_file(in_fnames[i]);
|
|
||||||
}
|
|
||||||
}
|
|
||||||
|
|
||||||
static tree elna_langhook_type_for_mode(enum machine_mode mode, int unsignedp)
|
|
||||||
{
|
|
||||||
if (mode == TYPE_MODE(float_type_node))
|
|
||||||
{
|
|
||||||
return float_type_node;
|
|
||||||
}
|
|
||||||
else if (mode == TYPE_MODE(double_type_node))
|
|
||||||
{
|
|
||||||
return double_type_node;
|
|
||||||
}
|
|
||||||
if (mode == TYPE_MODE(intQI_type_node))
|
|
||||||
{
|
|
||||||
return unsignedp ? unsigned_intQI_type_node : intQI_type_node;
|
|
||||||
}
|
|
||||||
else if (mode == TYPE_MODE(intHI_type_node))
|
|
||||||
{
|
|
||||||
return unsignedp ? unsigned_intHI_type_node : intHI_type_node;
|
|
||||||
}
|
|
||||||
else if (mode == TYPE_MODE(intSI_type_node))
|
|
||||||
{
|
|
||||||
return unsignedp ? unsigned_intSI_type_node : intSI_type_node;
|
|
||||||
}
|
|
||||||
else if (mode == TYPE_MODE(intDI_type_node))
|
|
||||||
{
|
|
||||||
return unsignedp ? unsigned_intDI_type_node : intDI_type_node;
|
|
||||||
}
|
|
||||||
else if (mode == TYPE_MODE(intTI_type_node))
|
|
||||||
{
|
|
||||||
return unsignedp ? unsigned_intTI_type_node : intTI_type_node;
|
|
||||||
}
|
|
||||||
else if (mode == TYPE_MODE(integer_type_node))
|
|
||||||
{
|
|
||||||
return unsignedp ? unsigned_type_node : integer_type_node;
|
|
||||||
}
|
|
||||||
else if (mode == TYPE_MODE(long_integer_type_node))
|
|
||||||
{
|
|
||||||
return unsignedp ? long_unsigned_type_node : long_integer_type_node;
|
|
||||||
}
|
|
||||||
else if (mode == TYPE_MODE(long_long_integer_type_node))
|
|
||||||
{
|
|
||||||
return unsignedp
|
|
||||||
? long_long_unsigned_type_node
|
|
||||||
: long_long_integer_type_node;
|
|
||||||
}
|
|
||||||
if (COMPLEX_MODE_P(mode))
|
|
||||||
{
|
|
||||||
if (mode == TYPE_MODE(complex_float_type_node))
|
|
||||||
{
|
|
||||||
return complex_float_type_node;
|
|
||||||
}
|
|
||||||
if (mode == TYPE_MODE(complex_double_type_node))
|
|
||||||
{
|
|
||||||
return complex_double_type_node;
|
|
||||||
}
|
|
||||||
if (mode == TYPE_MODE(complex_long_double_type_node))
|
|
||||||
{
|
|
||||||
return complex_long_double_type_node;
|
|
||||||
}
|
|
||||||
if (mode == TYPE_MODE(complex_integer_type_node) && !unsignedp)
|
|
||||||
{
|
|
||||||
return complex_integer_type_node;
|
|
||||||
}
|
|
||||||
}
|
|
||||||
/* gcc_unreachable */
|
|
||||||
return nullptr;
|
|
||||||
}
|
|
||||||
|
|
||||||
static bool global_bindings_p(void)
|
|
||||||
{
|
|
||||||
return current_function_decl == NULL_TREE;
|
|
||||||
}
|
|
||||||
|
|
||||||
static tree pushdecl(tree decl)
|
|
||||||
{
|
|
||||||
return decl;
|
|
||||||
}
|
|
||||||
|
|
||||||
static tree elna_langhook_builtin_function(tree decl)
|
|
||||||
{
|
|
||||||
elna_global_decls->put(IDENTIFIER_POINTER(DECL_NAME(decl)), decl);
|
|
||||||
return decl;
|
|
||||||
}
|
|
||||||
|
|
||||||
static unsigned int elna_langhook_option_lang_mask(void)
|
|
||||||
{
|
|
||||||
return CL_Elna;
|
|
||||||
}
|
|
||||||
|
|
||||||
/* Creates an expression whose value is that of EXPR, converted to type TYPE.
|
|
||||||
This function implements all reasonable scalar conversions. */
|
|
||||||
tree convert(tree type, tree expr)
|
|
||||||
{
|
|
||||||
if (error_operand_p(type) || error_operand_p(expr))
|
|
||||||
{
|
|
||||||
return error_mark_node;
|
|
||||||
}
|
|
||||||
if (TREE_TYPE(expr) == type)
|
|
||||||
{
|
|
||||||
return expr;
|
|
||||||
}
|
|
||||||
return error_mark_node;
|
|
||||||
}
|
|
||||||
|
|
||||||
#undef LANG_HOOKS_NAME
|
|
||||||
#define LANG_HOOKS_NAME "GNU Elna"
|
|
||||||
|
|
||||||
#undef LANG_HOOKS_INIT
|
|
||||||
#define LANG_HOOKS_INIT elna_langhook_init
|
|
||||||
|
|
||||||
#undef LANG_HOOKS_PARSE_FILE
|
|
||||||
#define LANG_HOOKS_PARSE_FILE elna_langhook_parse_file
|
|
||||||
|
|
||||||
#undef LANG_HOOKS_TYPE_FOR_MODE
|
|
||||||
#define LANG_HOOKS_TYPE_FOR_MODE elna_langhook_type_for_mode
|
|
||||||
|
|
||||||
#undef LANG_HOOKS_GETDECLS
|
|
||||||
#define LANG_HOOKS_GETDECLS hook_tree_void_null
|
|
||||||
|
|
||||||
#undef LANG_HOOKS_BUILTIN_FUNCTION
|
|
||||||
#define LANG_HOOKS_BUILTIN_FUNCTION elna_langhook_builtin_function
|
|
||||||
|
|
||||||
#undef LANG_HOOKS_IDENTIFIER_SIZE
|
|
||||||
#define LANG_HOOKS_IDENTIFIER_SIZE sizeof(struct tree_identifier)
|
|
||||||
|
|
||||||
#undef LANG_HOOKS_OPTION_LANG_MASK
|
|
||||||
#define LANG_HOOKS_OPTION_LANG_MASK elna_langhook_option_lang_mask
|
|
||||||
|
|
||||||
struct lang_hooks lang_hooks = LANG_HOOKS_INITIALIZER;
|
|
||||||
|
|
||||||
#include "gt-elna-elna1.h"
|
|
||||||
#include "gtype-elna.h"
|
|
||||||
135
gcc/gelna.texi
135
gcc/gelna.texi
@ -1,135 +0,0 @@
|
|||||||
\input texinfo @c -*-texinfo-*-
|
|
||||||
@setfilename gelna.info
|
|
||||||
@settitle The GNU Elna Compiler
|
|
||||||
|
|
||||||
@c Create a separate index for command line options
|
|
||||||
@defcodeindex op
|
|
||||||
@c Merge the standard indexes into a single one.
|
|
||||||
@syncodeindex fn cp
|
|
||||||
@syncodeindex vr cp
|
|
||||||
@syncodeindex ky cp
|
|
||||||
@syncodeindex pg cp
|
|
||||||
@syncodeindex tp cp
|
|
||||||
|
|
||||||
@include gcc-common.texi
|
|
||||||
|
|
||||||
@c Copyright years for this manual.
|
|
||||||
@set copyrights-elna 2025
|
|
||||||
|
|
||||||
@copying
|
|
||||||
@c man begin COPYRIGHT
|
|
||||||
Copyright @copyright{} @value{copyrights-elna} Free Software Foundation, Inc.
|
|
||||||
|
|
||||||
Permission is granted to copy, distribute and/or modify this document
|
|
||||||
under the terms of the GNU Free Documentation License, Version 1.3 or
|
|
||||||
any later version published by the Free Software Foundation; with no
|
|
||||||
Invariant Sections, no Front-Cover Texts, and no Back-Cover Texts.
|
|
||||||
A copy of the license is included in the
|
|
||||||
@c man end
|
|
||||||
section entitled ``GNU Free Documentation License''.
|
|
||||||
@ignore
|
|
||||||
@c man begin COPYRIGHT
|
|
||||||
man page gfdl(7).
|
|
||||||
@c man end
|
|
||||||
@end ignore
|
|
||||||
@end copying
|
|
||||||
|
|
||||||
@ifinfo
|
|
||||||
@format
|
|
||||||
@dircategory Software development
|
|
||||||
@direntry
|
|
||||||
* Gelna: (gelna). A GCC-based compiler for the Elna language
|
|
||||||
@end direntry
|
|
||||||
@end format
|
|
||||||
|
|
||||||
@insertcopying
|
|
||||||
@end ifinfo
|
|
||||||
|
|
||||||
@titlepage
|
|
||||||
@title The GNU Elna Compiler
|
|
||||||
@versionsubtitle
|
|
||||||
@author Eugen Wissner
|
|
||||||
|
|
||||||
@page
|
|
||||||
@vskip 0pt plus 1filll
|
|
||||||
Published by the Free Software Foundation @*
|
|
||||||
51 Franklin Street, Fifth Floor@*
|
|
||||||
Boston, MA 02110-1301, USA@*
|
|
||||||
@sp 1
|
|
||||||
@insertcopying
|
|
||||||
@end titlepage
|
|
||||||
@contents
|
|
||||||
@page
|
|
||||||
|
|
||||||
@node Top
|
|
||||||
@top Introduction
|
|
||||||
|
|
||||||
This manual describes how to use @command{gelna}, the GNU compiler for
|
|
||||||
the Elna programming language. This manual is specifically about how to
|
|
||||||
invoke @command{gelna}.
|
|
||||||
|
|
||||||
@menu
|
|
||||||
* Copying:: The GNU General Public License.
|
|
||||||
* GNU Free Documentation License::
|
|
||||||
How you can share and copy this manual.
|
|
||||||
* Invoking gelna:: How to run gelna.
|
|
||||||
* Option Index:: Index of command line options.
|
|
||||||
* Keyword Index:: Index of concepts.
|
|
||||||
@end menu
|
|
||||||
|
|
||||||
|
|
||||||
@include gpl_v3.texi
|
|
||||||
|
|
||||||
@include fdl.texi
|
|
||||||
|
|
||||||
|
|
||||||
@node Invoking gelna
|
|
||||||
@chapter Invoking gelna
|
|
||||||
|
|
||||||
@c man title gelna A GCC-based compiler for the Elna language
|
|
||||||
|
|
||||||
@ignore
|
|
||||||
@c man begin SYNOPSIS gelna
|
|
||||||
gelna [@option{-c}|@option{-S}]
|
|
||||||
[@option{-g}] [@option{-pg}]
|
|
||||||
[@option{-o} @var{outfile}] @var{infile}@dots{}
|
|
||||||
|
|
||||||
Only the most useful options are listed here; see below for the
|
|
||||||
remainder.
|
|
||||||
@c man end
|
|
||||||
@c man begin SEEALSO
|
|
||||||
gpl(7), gfdl(7), fsf-funding(7), gcc(1)
|
|
||||||
and the Info entries for @file{gelna} and @file{gcc}.
|
|
||||||
@c man end
|
|
||||||
@end ignore
|
|
||||||
|
|
||||||
@c man begin DESCRIPTION gelna
|
|
||||||
|
|
||||||
The @command{gelna} command is a frontend to @command{gcc} and
|
|
||||||
supports many of the same options. @xref{Option Summary, , Option
|
|
||||||
Summary, gcc, Using the GNU Compiler Collection (GCC)}. This manual
|
|
||||||
only documents the options specific to @command{gelna}.
|
|
||||||
|
|
||||||
@c man end
|
|
||||||
|
|
||||||
@c man begin OPTIONS gelna
|
|
||||||
|
|
||||||
@c man end
|
|
||||||
|
|
||||||
@node Option Index
|
|
||||||
@unnumbered Option Index
|
|
||||||
|
|
||||||
@command{gelna}'s command line options are indexed here without any
|
|
||||||
initial @samp{-} or @samp{--}. Where an option has both positive and
|
|
||||||
negative forms (such as -foption and -fno-option), relevant entries in
|
|
||||||
the manual are indexed under the most appropriate form; it may sometimes
|
|
||||||
be useful to look up both forms.
|
|
||||||
|
|
||||||
@printindex op
|
|
||||||
|
|
||||||
@node Keyword Index
|
|
||||||
@unnumbered Keyword Index
|
|
||||||
|
|
||||||
@printindex cp
|
|
||||||
|
|
||||||
@bye
|
|
||||||
@ -1,28 +0,0 @@
|
|||||||
/* GCC driver specs for Elna frontend.
|
|
||||||
Copyright (C) 2025 Free Software Foundation, Inc.
|
|
||||||
|
|
||||||
GCC 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.
|
|
||||||
|
|
||||||
GCC 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 GCC; see the file COPYING3. If not see
|
|
||||||
<http://www.gnu.org/licenses/>. */
|
|
||||||
|
|
||||||
/* gcc/gcc.cc */
|
|
||||||
{".elna", "@elna", nullptr, 0, 0},
|
|
||||||
{"@elna",
|
|
||||||
"elna1 %i \
|
|
||||||
%{!Q:-quiet} " DUMPS_OPTIONS("") " %{m*} %{aux-info*} \
|
|
||||||
%{g*} %{O*} %{W*&pedantic*} %{w} %{std*&ansi&trigraphs} \
|
|
||||||
%{pg:-p} %{p} %{f*} %{undef} \
|
|
||||||
%{!fsyntax-only:%{S:%W{o*}%{!o*:-o %w%b.s}}} \
|
|
||||||
%{fsyntax-only:-o %j} %{-param*} \
|
|
||||||
%{!fsyntax-only:%(invoke_as)}",
|
|
||||||
nullptr, 0, 0},
|
|
||||||
23
gcc/lang.opt
23
gcc/lang.opt
@ -1,23 +0,0 @@
|
|||||||
; lang.opt -- Options for the Elna front end.
|
|
||||||
; Copyright (C) 2025 Free Software Foundation, Inc.
|
|
||||||
;
|
|
||||||
; GCC 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.
|
|
||||||
;
|
|
||||||
; GCC 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 GCC; see the file COPYING3. If not see
|
|
||||||
; <http://www.gnu.org/licenses/>.
|
|
||||||
|
|
||||||
; See the GCC internals manual for a description of this file's format.
|
|
||||||
|
|
||||||
; Please try to keep this file in ASCII collating order.
|
|
||||||
|
|
||||||
Language
|
|
||||||
Elna
|
|
||||||
@ -1,2 +0,0 @@
|
|||||||
; Autogenerated by regenerate-opt-urls.py from gcc/lang.opt and generated HTML
|
|
||||||
|
|
||||||
@ -1,743 +0,0 @@
|
|||||||
/* Abstract syntax tree representation.
|
|
||||||
Copyright (C) 2025 Free Software Foundation, Inc.
|
|
||||||
|
|
||||||
GCC 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.
|
|
||||||
|
|
||||||
GCC 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 GCC; see the file COPYING3. If not see
|
|
||||||
<http://www.gnu.org/licenses/>. */
|
|
||||||
|
|
||||||
#pragma once
|
|
||||||
|
|
||||||
#include <cstdint>
|
|
||||||
#include <memory>
|
|
||||||
#include <string>
|
|
||||||
#include <vector>
|
|
||||||
#include <optional>
|
|
||||||
#include "elna/boot/result.h"
|
|
||||||
|
|
||||||
namespace elna::boot
|
|
||||||
{
|
|
||||||
enum class binary_operator
|
|
||||||
{
|
|
||||||
sum,
|
|
||||||
subtraction,
|
|
||||||
multiplication,
|
|
||||||
division,
|
|
||||||
remainder,
|
|
||||||
equals,
|
|
||||||
not_equals,
|
|
||||||
less,
|
|
||||||
greater,
|
|
||||||
less_equal,
|
|
||||||
greater_equal,
|
|
||||||
disjunction,
|
|
||||||
conjunction,
|
|
||||||
exclusive_disjunction,
|
|
||||||
shift_left,
|
|
||||||
shift_right
|
|
||||||
};
|
|
||||||
|
|
||||||
enum class unary_operator
|
|
||||||
{
|
|
||||||
reference,
|
|
||||||
negation,
|
|
||||||
minus
|
|
||||||
};
|
|
||||||
|
|
||||||
enum class escape_direction
|
|
||||||
{
|
|
||||||
begin,
|
|
||||||
end
|
|
||||||
};
|
|
||||||
|
|
||||||
class variable_declaration;
|
|
||||||
class constant_definition;
|
|
||||||
class procedure_definition;
|
|
||||||
class type_definition;
|
|
||||||
class procedure_call;
|
|
||||||
class cast_expression;
|
|
||||||
class assign_statement;
|
|
||||||
class if_statement;
|
|
||||||
class escape_statement;
|
|
||||||
class while_statement;
|
|
||||||
class return_statement;
|
|
||||||
class case_statement;
|
|
||||||
class traits_expression;
|
|
||||||
class block;
|
|
||||||
class program;
|
|
||||||
class binary_expression;
|
|
||||||
class unary_expression;
|
|
||||||
class named_type_expression;
|
|
||||||
class array_type_expression;
|
|
||||||
class pointer_type_expression;
|
|
||||||
class record_type_expression;
|
|
||||||
class union_type_expression;
|
|
||||||
class procedure_type_expression;
|
|
||||||
class enumeration_type_expression;
|
|
||||||
class variable_expression;
|
|
||||||
class array_access_expression;
|
|
||||||
class field_access_expression;
|
|
||||||
class dereference_expression;
|
|
||||||
class designator_expression;
|
|
||||||
class literal_expression;
|
|
||||||
template<typename T>
|
|
||||||
class literal;
|
|
||||||
class defer_statement;
|
|
||||||
|
|
||||||
/**
|
|
||||||
* Interface for AST visitors.
|
|
||||||
*/
|
|
||||||
struct parser_visitor
|
|
||||||
{
|
|
||||||
virtual void visit(variable_declaration *) = 0;
|
|
||||||
virtual void visit(constant_definition *) = 0;
|
|
||||||
virtual void visit(procedure_definition *) = 0;
|
|
||||||
virtual void visit(type_definition *) = 0;
|
|
||||||
virtual void visit(procedure_call *) = 0;
|
|
||||||
virtual void visit(cast_expression *) = 0;
|
|
||||||
virtual void visit(traits_expression *) = 0;
|
|
||||||
virtual void visit(assign_statement *) = 0;
|
|
||||||
virtual void visit(if_statement *) = 0;
|
|
||||||
virtual void visit(escape_statement *) = 0;
|
|
||||||
virtual void visit(while_statement *) = 0;
|
|
||||||
virtual void visit(return_statement *) = 0;
|
|
||||||
virtual void visit(defer_statement *) = 0;
|
|
||||||
virtual void visit(case_statement *) = 0;
|
|
||||||
virtual void visit(block *) = 0;
|
|
||||||
virtual void visit(program *) = 0;
|
|
||||||
virtual void visit(binary_expression *) = 0;
|
|
||||||
virtual void visit(unary_expression *) = 0;
|
|
||||||
virtual void visit(named_type_expression *) = 0;
|
|
||||||
virtual void visit(array_type_expression *) = 0;
|
|
||||||
virtual void visit(pointer_type_expression *) = 0;
|
|
||||||
virtual void visit(record_type_expression *) = 0;
|
|
||||||
virtual void visit(union_type_expression *) = 0;
|
|
||||||
virtual void visit(procedure_type_expression *) = 0;
|
|
||||||
virtual void visit(enumeration_type_expression *) = 0;
|
|
||||||
virtual void visit(variable_expression *) = 0;
|
|
||||||
virtual void visit(array_access_expression *) = 0;
|
|
||||||
virtual void visit(field_access_expression *) = 0;
|
|
||||||
virtual void visit(dereference_expression *) = 0;
|
|
||||||
virtual void visit(literal<std::int32_t> *) = 0;
|
|
||||||
virtual void visit(literal<std::uint32_t> *) = 0;
|
|
||||||
virtual void visit(literal<double> *) = 0;
|
|
||||||
virtual void visit(literal<bool> *) = 0;
|
|
||||||
virtual void visit(literal<unsigned char> *) = 0;
|
|
||||||
virtual void visit(literal<std::nullptr_t> *) = 0;
|
|
||||||
virtual void visit(literal<std::string> *) = 0;
|
|
||||||
};
|
|
||||||
|
|
||||||
/**
|
|
||||||
* AST node.
|
|
||||||
*/
|
|
||||||
class node
|
|
||||||
{
|
|
||||||
const struct position source_position;
|
|
||||||
|
|
||||||
protected:
|
|
||||||
/**
|
|
||||||
* \param position Source code position.
|
|
||||||
*/
|
|
||||||
explicit node(const position position);
|
|
||||||
|
|
||||||
public:
|
|
||||||
virtual void accept(parser_visitor *visitor) = 0;
|
|
||||||
virtual ~node() = 0;
|
|
||||||
|
|
||||||
/**
|
|
||||||
* \return Node position in the source code.
|
|
||||||
*/
|
|
||||||
const struct position& position() const;
|
|
||||||
};
|
|
||||||
|
|
||||||
class statement : public virtual node
|
|
||||||
{
|
|
||||||
};
|
|
||||||
|
|
||||||
class expression : public virtual node
|
|
||||||
{
|
|
||||||
public:
|
|
||||||
virtual cast_expression *is_cast();
|
|
||||||
virtual traits_expression *is_traits();
|
|
||||||
virtual binary_expression *is_binary();
|
|
||||||
virtual unary_expression *is_unary();
|
|
||||||
virtual designator_expression *is_designator();
|
|
||||||
virtual procedure_call *is_call_expression();
|
|
||||||
virtual literal_expression *is_literal();
|
|
||||||
};
|
|
||||||
|
|
||||||
struct identifier_definition
|
|
||||||
{
|
|
||||||
std::string identifier;
|
|
||||||
bool exported;
|
|
||||||
};
|
|
||||||
|
|
||||||
/**
|
|
||||||
* Symbol definition.
|
|
||||||
*/
|
|
||||||
class definition : public node
|
|
||||||
{
|
|
||||||
protected:
|
|
||||||
definition(const struct position position, identifier_definition identifier);
|
|
||||||
|
|
||||||
public:
|
|
||||||
const identifier_definition identifier;
|
|
||||||
};
|
|
||||||
|
|
||||||
/**
|
|
||||||
* Some type expression.
|
|
||||||
*/
|
|
||||||
class type_expression : public node
|
|
||||||
{
|
|
||||||
public:
|
|
||||||
virtual named_type_expression *is_named();
|
|
||||||
virtual array_type_expression *is_array();
|
|
||||||
virtual pointer_type_expression *is_pointer();
|
|
||||||
virtual record_type_expression *is_record();
|
|
||||||
virtual union_type_expression *is_union();
|
|
||||||
virtual procedure_type_expression *is_procedure();
|
|
||||||
virtual enumeration_type_expression *is_enumeration();
|
|
||||||
|
|
||||||
protected:
|
|
||||||
type_expression(const struct position position);
|
|
||||||
};
|
|
||||||
|
|
||||||
/**
|
|
||||||
* Expression refering to a type by its name.
|
|
||||||
*/
|
|
||||||
class named_type_expression : public type_expression
|
|
||||||
{
|
|
||||||
public:
|
|
||||||
const std::string name;
|
|
||||||
|
|
||||||
named_type_expression(const struct position position, const std::string& name);
|
|
||||||
void accept(parser_visitor *visitor) override;
|
|
||||||
named_type_expression *is_named() override;
|
|
||||||
};
|
|
||||||
|
|
||||||
class array_type_expression : public type_expression
|
|
||||||
{
|
|
||||||
type_expression *m_base;
|
|
||||||
|
|
||||||
public:
|
|
||||||
const std::uint32_t size;
|
|
||||||
|
|
||||||
array_type_expression(const struct position position,
|
|
||||||
type_expression *base, const std::uint32_t size);
|
|
||||||
~array_type_expression();
|
|
||||||
|
|
||||||
void accept(parser_visitor *visitor) override;
|
|
||||||
array_type_expression *is_array() override;
|
|
||||||
|
|
||||||
type_expression& base();
|
|
||||||
};
|
|
||||||
|
|
||||||
class pointer_type_expression : public type_expression
|
|
||||||
{
|
|
||||||
type_expression *m_base;
|
|
||||||
|
|
||||||
public:
|
|
||||||
pointer_type_expression(const struct position position, type_expression *base);
|
|
||||||
~pointer_type_expression();
|
|
||||||
|
|
||||||
void accept(parser_visitor *visitor) override;
|
|
||||||
pointer_type_expression *is_pointer() override;
|
|
||||||
|
|
||||||
type_expression& base();
|
|
||||||
};
|
|
||||||
|
|
||||||
using field_declaration = std::pair<std::string, type_expression *>;
|
|
||||||
|
|
||||||
class record_type_expression : public type_expression
|
|
||||||
{
|
|
||||||
public:
|
|
||||||
const std::vector<field_declaration> fields;
|
|
||||||
|
|
||||||
record_type_expression(const struct position position, std::vector<field_declaration>&& fields);
|
|
||||||
~record_type_expression();
|
|
||||||
|
|
||||||
void accept(parser_visitor *visitor) override;
|
|
||||||
record_type_expression *is_record() override;
|
|
||||||
};
|
|
||||||
|
|
||||||
class union_type_expression : public type_expression
|
|
||||||
{
|
|
||||||
public:
|
|
||||||
std::vector<field_declaration> fields;
|
|
||||||
|
|
||||||
union_type_expression(const struct position position, std::vector<field_declaration>&& fields);
|
|
||||||
~union_type_expression();
|
|
||||||
|
|
||||||
void accept(parser_visitor *visitor) override;
|
|
||||||
union_type_expression *is_union() override;
|
|
||||||
};
|
|
||||||
|
|
||||||
/**
|
|
||||||
* Enumeration type.
|
|
||||||
*/
|
|
||||||
class enumeration_type_expression : public type_expression
|
|
||||||
{
|
|
||||||
public:
|
|
||||||
const std::vector<std::string> members;
|
|
||||||
|
|
||||||
enumeration_type_expression(const struct position, std::vector<std::string>&& members);
|
|
||||||
|
|
||||||
void accept(parser_visitor *visitor) override;
|
|
||||||
enumeration_type_expression *is_enumeration() override;
|
|
||||||
};
|
|
||||||
|
|
||||||
/**
|
|
||||||
* Variable declaration.
|
|
||||||
*/
|
|
||||||
class variable_declaration : public definition
|
|
||||||
{
|
|
||||||
std::shared_ptr<type_expression> m_variable_type;
|
|
||||||
|
|
||||||
public:
|
|
||||||
variable_declaration(const struct position position, identifier_definition identifier,
|
|
||||||
std::shared_ptr<type_expression> variable_type);
|
|
||||||
|
|
||||||
void accept(parser_visitor *visitor) override;
|
|
||||||
|
|
||||||
type_expression& variable_type();
|
|
||||||
};
|
|
||||||
|
|
||||||
/**
|
|
||||||
* Literal expression.
|
|
||||||
*/
|
|
||||||
class literal_expression : public expression
|
|
||||||
{
|
|
||||||
public:
|
|
||||||
literal_expression *is_literal() override;
|
|
||||||
|
|
||||||
protected:
|
|
||||||
literal_expression();
|
|
||||||
};
|
|
||||||
|
|
||||||
/**
|
|
||||||
* Constant definition.
|
|
||||||
*/
|
|
||||||
class constant_definition : public definition
|
|
||||||
{
|
|
||||||
expression *m_body;
|
|
||||||
|
|
||||||
public:
|
|
||||||
constant_definition(const struct position position, identifier_definition identifier,
|
|
||||||
expression *body);
|
|
||||||
void accept(parser_visitor *visitor) override;
|
|
||||||
|
|
||||||
expression& body();
|
|
||||||
|
|
||||||
virtual ~constant_definition() override;
|
|
||||||
};
|
|
||||||
|
|
||||||
/**
|
|
||||||
* Procedure type.
|
|
||||||
*/
|
|
||||||
class procedure_type_expression : public type_expression
|
|
||||||
{
|
|
||||||
public:
|
|
||||||
using return_t = return_declaration<type_expression *>;
|
|
||||||
|
|
||||||
const return_t return_type;
|
|
||||||
std::vector<type_expression *> parameters;
|
|
||||||
|
|
||||||
procedure_type_expression(const struct position position, return_t return_type = return_t());
|
|
||||||
~procedure_type_expression();
|
|
||||||
|
|
||||||
void accept(parser_visitor *visitor) override;
|
|
||||||
procedure_type_expression *is_procedure() override;
|
|
||||||
};
|
|
||||||
|
|
||||||
/**
|
|
||||||
* Procedure definition.
|
|
||||||
*/
|
|
||||||
class procedure_definition : public definition
|
|
||||||
{
|
|
||||||
procedure_type_expression *m_heading;
|
|
||||||
|
|
||||||
public:
|
|
||||||
block *const body;
|
|
||||||
std::vector<std::string> parameter_names;
|
|
||||||
|
|
||||||
procedure_definition(const struct position position, identifier_definition identifier,
|
|
||||||
procedure_type_expression *heading, block *body = nullptr);
|
|
||||||
void accept(parser_visitor *visitor) override;
|
|
||||||
|
|
||||||
procedure_type_expression& heading();
|
|
||||||
|
|
||||||
virtual ~procedure_definition() override;
|
|
||||||
};
|
|
||||||
|
|
||||||
/**
|
|
||||||
* Type definition.
|
|
||||||
*/
|
|
||||||
class type_definition : public definition
|
|
||||||
{
|
|
||||||
type_expression *m_body;
|
|
||||||
|
|
||||||
public:
|
|
||||||
type_definition(const struct position position, identifier_definition identifier,
|
|
||||||
type_expression *expression);
|
|
||||||
~type_definition();
|
|
||||||
|
|
||||||
void accept(parser_visitor *visitor) override;
|
|
||||||
|
|
||||||
type_expression& body();
|
|
||||||
};
|
|
||||||
|
|
||||||
/**
|
|
||||||
* Cast expression.
|
|
||||||
*/
|
|
||||||
class cast_expression : public expression
|
|
||||||
{
|
|
||||||
type_expression *m_target;
|
|
||||||
expression *m_value;
|
|
||||||
|
|
||||||
public:
|
|
||||||
cast_expression(const struct position position, type_expression *target, expression *value);
|
|
||||||
void accept(parser_visitor *visitor) override;
|
|
||||||
cast_expression *is_cast() override;
|
|
||||||
|
|
||||||
type_expression& target();
|
|
||||||
expression& value();
|
|
||||||
|
|
||||||
virtual ~cast_expression() override;
|
|
||||||
};
|
|
||||||
|
|
||||||
class traits_expression : public expression
|
|
||||||
{
|
|
||||||
public:
|
|
||||||
std::vector<type_expression *> parameters;
|
|
||||||
const std::string name;
|
|
||||||
|
|
||||||
traits_expression(const struct position position, const std::string& name);
|
|
||||||
~traits_expression();
|
|
||||||
|
|
||||||
void accept(parser_visitor *visitor) override;
|
|
||||||
traits_expression *is_traits() override;
|
|
||||||
};
|
|
||||||
|
|
||||||
/**
|
|
||||||
* List of statements paired with a condition.
|
|
||||||
*/
|
|
||||||
class conditional_statements
|
|
||||||
{
|
|
||||||
expression *m_prerequisite;
|
|
||||||
|
|
||||||
public:
|
|
||||||
const std::vector<statement *> statements;
|
|
||||||
|
|
||||||
conditional_statements(expression *prerequisite, std::vector<statement *>&& statements);
|
|
||||||
|
|
||||||
expression& prerequisite();
|
|
||||||
|
|
||||||
virtual ~conditional_statements();
|
|
||||||
};
|
|
||||||
|
|
||||||
class return_statement : public statement
|
|
||||||
{
|
|
||||||
public:
|
|
||||||
expression *const return_expression{ nullptr };
|
|
||||||
|
|
||||||
return_statement(const struct position position, expression *return_expression = nullptr);
|
|
||||||
void accept(parser_visitor *visitor) override;
|
|
||||||
|
|
||||||
virtual ~return_statement() override;
|
|
||||||
};
|
|
||||||
|
|
||||||
struct switch_case
|
|
||||||
{
|
|
||||||
std::vector<expression *> labels;
|
|
||||||
std::vector<statement *> statements;
|
|
||||||
};
|
|
||||||
|
|
||||||
class case_statement : public statement
|
|
||||||
{
|
|
||||||
expression *m_condition;
|
|
||||||
|
|
||||||
public:
|
|
||||||
const std::vector<switch_case> cases;
|
|
||||||
const std::vector<statement *> *alternative;
|
|
||||||
|
|
||||||
case_statement(const struct position position, expression *condition,
|
|
||||||
std::vector<switch_case>&& cases, std::vector<statement *> *alternative = nullptr);
|
|
||||||
void accept(parser_visitor *visitor) override;
|
|
||||||
expression& condition();
|
|
||||||
};
|
|
||||||
|
|
||||||
class designator_expression : public expression
|
|
||||||
{
|
|
||||||
public:
|
|
||||||
virtual variable_expression *is_variable();
|
|
||||||
virtual array_access_expression *is_array_access();
|
|
||||||
virtual field_access_expression *is_field_access();
|
|
||||||
virtual dereference_expression *is_dereference();
|
|
||||||
|
|
||||||
designator_expression *is_designator() override;
|
|
||||||
void accept(parser_visitor *visitor);
|
|
||||||
~designator_expression() = 0;
|
|
||||||
|
|
||||||
protected:
|
|
||||||
designator_expression();
|
|
||||||
};
|
|
||||||
|
|
||||||
class variable_expression : public designator_expression, public literal_expression
|
|
||||||
{
|
|
||||||
public:
|
|
||||||
const std::string name;
|
|
||||||
|
|
||||||
variable_expression(const struct position position, const std::string& name);
|
|
||||||
void accept(parser_visitor *visitor) override;
|
|
||||||
|
|
||||||
variable_expression *is_variable() override;
|
|
||||||
};
|
|
||||||
|
|
||||||
class array_access_expression : public designator_expression
|
|
||||||
{
|
|
||||||
expression *m_base;
|
|
||||||
expression *m_index;
|
|
||||||
|
|
||||||
public:
|
|
||||||
array_access_expression(const struct position position, expression *base, expression *index);
|
|
||||||
void accept(parser_visitor *visitor) override;
|
|
||||||
|
|
||||||
expression& base();
|
|
||||||
expression& index();
|
|
||||||
|
|
||||||
array_access_expression *is_array_access() override;
|
|
||||||
|
|
||||||
~array_access_expression() override;
|
|
||||||
};
|
|
||||||
|
|
||||||
class field_access_expression : public designator_expression
|
|
||||||
{
|
|
||||||
expression *m_base;
|
|
||||||
std::string m_field;
|
|
||||||
|
|
||||||
public:
|
|
||||||
field_access_expression(const struct position position, expression *base,
|
|
||||||
const std::string& field);
|
|
||||||
void accept(parser_visitor *visitor) override;
|
|
||||||
|
|
||||||
expression& base();
|
|
||||||
std::string& field();
|
|
||||||
|
|
||||||
field_access_expression *is_field_access() override;
|
|
||||||
|
|
||||||
~field_access_expression() override;
|
|
||||||
};
|
|
||||||
|
|
||||||
class dereference_expression : public designator_expression
|
|
||||||
{
|
|
||||||
expression *m_base;
|
|
||||||
|
|
||||||
public:
|
|
||||||
dereference_expression(const struct position position, expression *base);
|
|
||||||
void accept(parser_visitor *visitor) override;
|
|
||||||
|
|
||||||
expression& base();
|
|
||||||
|
|
||||||
dereference_expression *is_dereference() override;
|
|
||||||
|
|
||||||
~dereference_expression() override;
|
|
||||||
};
|
|
||||||
|
|
||||||
/**
|
|
||||||
* Procedure call expression.
|
|
||||||
*/
|
|
||||||
class procedure_call : public expression, public statement
|
|
||||||
{
|
|
||||||
designator_expression *m_callable;
|
|
||||||
|
|
||||||
public:
|
|
||||||
std::vector<expression *> arguments;
|
|
||||||
|
|
||||||
procedure_call(const struct position position, designator_expression *callable);
|
|
||||||
void accept(parser_visitor *visitor) override;
|
|
||||||
virtual procedure_call *is_call_expression() override;
|
|
||||||
|
|
||||||
designator_expression& callable();
|
|
||||||
|
|
||||||
virtual ~procedure_call() override;
|
|
||||||
};
|
|
||||||
|
|
||||||
class assign_statement : public statement
|
|
||||||
{
|
|
||||||
designator_expression *m_lvalue;
|
|
||||||
expression *m_rvalue;
|
|
||||||
|
|
||||||
public:
|
|
||||||
/**
|
|
||||||
* \param position Source code position.
|
|
||||||
* \param lvalue Left-hand side.
|
|
||||||
* \param rvalue Assigned expression.
|
|
||||||
*/
|
|
||||||
assign_statement(const struct position position, designator_expression *lvalue,
|
|
||||||
expression *rvalue);
|
|
||||||
void accept(parser_visitor *visitor) override;
|
|
||||||
|
|
||||||
designator_expression& lvalue();
|
|
||||||
expression& rvalue();
|
|
||||||
|
|
||||||
virtual ~assign_statement() override;
|
|
||||||
};
|
|
||||||
|
|
||||||
/**
|
|
||||||
* If-statement.
|
|
||||||
*/
|
|
||||||
class if_statement : public statement
|
|
||||||
{
|
|
||||||
conditional_statements *m_body;
|
|
||||||
|
|
||||||
public:
|
|
||||||
const std::vector<conditional_statements *> branches;
|
|
||||||
const std::vector<statement *> *alternative;
|
|
||||||
|
|
||||||
if_statement(const struct position position, conditional_statements *body,
|
|
||||||
std::vector<conditional_statements *>&& branches,
|
|
||||||
std::vector<statement *> *alternative = nullptr);
|
|
||||||
void accept(parser_visitor *visitor) override;
|
|
||||||
|
|
||||||
conditional_statements& body();
|
|
||||||
|
|
||||||
virtual ~if_statement() override;
|
|
||||||
};
|
|
||||||
|
|
||||||
class escape_statement : public statement
|
|
||||||
{
|
|
||||||
public:
|
|
||||||
const escape_direction direction;
|
|
||||||
const std::string label;
|
|
||||||
|
|
||||||
escape_statement(const struct position position,
|
|
||||||
escape_direction direction, const std::string& label);
|
|
||||||
void accept(parser_visitor *visitor) override;
|
|
||||||
};
|
|
||||||
|
|
||||||
/**
|
|
||||||
* While-statement.
|
|
||||||
*/
|
|
||||||
class while_statement : public statement
|
|
||||||
{
|
|
||||||
conditional_statements *m_body;
|
|
||||||
|
|
||||||
public:
|
|
||||||
const std::vector<conditional_statements *> branches;
|
|
||||||
const std::optional<std::string> label;
|
|
||||||
const std::vector<statement *> *alternative;
|
|
||||||
|
|
||||||
while_statement(const struct position position, conditional_statements *body,
|
|
||||||
std::vector<conditional_statements *>&& branches, std::vector<statement *> *alternative = nullptr);
|
|
||||||
while_statement(const struct position position, conditional_statements *body,
|
|
||||||
std::vector<conditional_statements *>&& branches, const std::string& label,
|
|
||||||
std::vector<statement *> *alternative = nullptr);
|
|
||||||
void accept(parser_visitor *visitor) override;
|
|
||||||
|
|
||||||
conditional_statements& body();
|
|
||||||
|
|
||||||
virtual ~while_statement() override;
|
|
||||||
};
|
|
||||||
|
|
||||||
class block : public node
|
|
||||||
{
|
|
||||||
public:
|
|
||||||
std::vector<variable_declaration *> variables;
|
|
||||||
std::vector<constant_definition *> constants;
|
|
||||||
std::vector<statement *> body;
|
|
||||||
|
|
||||||
block(const struct position position);
|
|
||||||
virtual void accept(parser_visitor *visitor) override;
|
|
||||||
|
|
||||||
virtual ~block() override;
|
|
||||||
};
|
|
||||||
|
|
||||||
class program : public block
|
|
||||||
{
|
|
||||||
public:
|
|
||||||
std::vector<type_definition *> types;
|
|
||||||
std::vector<procedure_definition *> procedures;
|
|
||||||
|
|
||||||
program(const struct position position);
|
|
||||||
void accept(parser_visitor *visitor) override;
|
|
||||||
|
|
||||||
virtual ~program() override;
|
|
||||||
};
|
|
||||||
|
|
||||||
template<typename T>
|
|
||||||
class literal : public literal_expression
|
|
||||||
{
|
|
||||||
public:
|
|
||||||
T value;
|
|
||||||
|
|
||||||
literal(const struct position position, const T& value)
|
|
||||||
: node(position), value(value)
|
|
||||||
{
|
|
||||||
}
|
|
||||||
|
|
||||||
void accept(parser_visitor *visitor) override
|
|
||||||
{
|
|
||||||
visitor->visit(this);
|
|
||||||
}
|
|
||||||
};
|
|
||||||
|
|
||||||
class defer_statement : public statement
|
|
||||||
{
|
|
||||||
public:
|
|
||||||
const std::vector<statement *> statements;
|
|
||||||
|
|
||||||
defer_statement(const struct position position, std::vector<statement *>&& statements);
|
|
||||||
void accept(parser_visitor *visitor) override;
|
|
||||||
|
|
||||||
virtual ~defer_statement() override;
|
|
||||||
};
|
|
||||||
|
|
||||||
class binary_expression : public expression
|
|
||||||
{
|
|
||||||
expression *m_lhs;
|
|
||||||
expression *m_rhs;
|
|
||||||
binary_operator m_operator;
|
|
||||||
|
|
||||||
public:
|
|
||||||
binary_expression(const struct position position, expression *lhs,
|
|
||||||
expression *rhs, const binary_operator operation);
|
|
||||||
|
|
||||||
void accept(parser_visitor *visitor) override;
|
|
||||||
binary_expression *is_binary() override;
|
|
||||||
|
|
||||||
expression& lhs();
|
|
||||||
expression& rhs();
|
|
||||||
binary_operator operation() const;
|
|
||||||
|
|
||||||
virtual ~binary_expression() override;
|
|
||||||
};
|
|
||||||
|
|
||||||
class unary_expression : public expression
|
|
||||||
{
|
|
||||||
expression *m_operand;
|
|
||||||
unary_operator m_operator;
|
|
||||||
|
|
||||||
public:
|
|
||||||
unary_expression(const struct position position, expression *operand,
|
|
||||||
const unary_operator operation);
|
|
||||||
|
|
||||||
void accept(parser_visitor *visitor) override;
|
|
||||||
unary_expression *is_unary() override;
|
|
||||||
|
|
||||||
expression& operand();
|
|
||||||
unary_operator operation() const;
|
|
||||||
|
|
||||||
virtual ~unary_expression() override;
|
|
||||||
};
|
|
||||||
|
|
||||||
const char *print_binary_operator(const binary_operator operation);
|
|
||||||
}
|
|
||||||
@ -1,41 +0,0 @@
|
|||||||
/* Dependency graph analysis.
|
|
||||||
Copyright (C) 2025 Free Software Foundation, Inc.
|
|
||||||
|
|
||||||
GCC 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.
|
|
||||||
|
|
||||||
GCC 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 GCC; see the file COPYING3. If not see
|
|
||||||
<http://www.gnu.org/licenses/>. */
|
|
||||||
|
|
||||||
#pragma once
|
|
||||||
|
|
||||||
#include <fstream>
|
|
||||||
#include "elna/boot/result.h"
|
|
||||||
#include "elna/boot/ast.h"
|
|
||||||
|
|
||||||
namespace elna::boot
|
|
||||||
{
|
|
||||||
class dependency_graph
|
|
||||||
{
|
|
||||||
error_list m_errors;
|
|
||||||
|
|
||||||
public:
|
|
||||||
std::vector<std::unique_ptr<program>> modules;
|
|
||||||
|
|
||||||
bool has_errors() const;
|
|
||||||
const error_list& errors() const;
|
|
||||||
|
|
||||||
dependency_graph();
|
|
||||||
explicit dependency_graph(error_list&& errors);
|
|
||||||
};
|
|
||||||
|
|
||||||
dependency_graph read_sources(std::istream& entry_point, const char *entry_path);
|
|
||||||
}
|
|
||||||
@ -1,51 +0,0 @@
|
|||||||
/* Parsing driver.
|
|
||||||
Copyright (C) 2025 Free Software Foundation, Inc.
|
|
||||||
|
|
||||||
GCC 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.
|
|
||||||
|
|
||||||
GCC 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 GCC; see the file COPYING3. If not see
|
|
||||||
<http://www.gnu.org/licenses/>. */
|
|
||||||
|
|
||||||
#pragma once
|
|
||||||
|
|
||||||
#include <optional>
|
|
||||||
#include "elna/boot/ast.h"
|
|
||||||
#include "location.hh"
|
|
||||||
|
|
||||||
namespace elna::boot
|
|
||||||
{
|
|
||||||
position make_position(const yy::location& location);
|
|
||||||
|
|
||||||
class syntax_error final : public error
|
|
||||||
{
|
|
||||||
std::string message;
|
|
||||||
|
|
||||||
public:
|
|
||||||
syntax_error(const std::string& message,
|
|
||||||
const char *input_file, const yy::location& location);
|
|
||||||
|
|
||||||
virtual std::string what() const override;
|
|
||||||
};
|
|
||||||
|
|
||||||
class driver : public error_container
|
|
||||||
{
|
|
||||||
public:
|
|
||||||
std::unique_ptr<program> tree;
|
|
||||||
|
|
||||||
driver(const char *input_file);
|
|
||||||
};
|
|
||||||
|
|
||||||
constexpr char escape_invalid_char = '\xff';
|
|
||||||
|
|
||||||
char escape_char(char escape);
|
|
||||||
std::optional<std::string> escape_string(const char *escape);
|
|
||||||
}
|
|
||||||
@ -1,107 +0,0 @@
|
|||||||
/* Miscellaneous types used across stage boundaries.
|
|
||||||
Copyright (C) 2025 Free Software Foundation, Inc.
|
|
||||||
|
|
||||||
GCC 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.
|
|
||||||
|
|
||||||
GCC 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 GCC; see the file COPYING3. If not see
|
|
||||||
<http://www.gnu.org/licenses/>. */
|
|
||||||
|
|
||||||
#pragma once
|
|
||||||
|
|
||||||
#include <cstddef>
|
|
||||||
#include <string>
|
|
||||||
#include <deque>
|
|
||||||
#include <memory>
|
|
||||||
#include <variant>
|
|
||||||
|
|
||||||
namespace elna::boot
|
|
||||||
{
|
|
||||||
/**
|
|
||||||
* Position in the source text.
|
|
||||||
*/
|
|
||||||
struct position
|
|
||||||
{
|
|
||||||
/// Line.
|
|
||||||
std::size_t line = 1;
|
|
||||||
|
|
||||||
/// Column.
|
|
||||||
std::size_t column = 1;
|
|
||||||
};
|
|
||||||
|
|
||||||
/**
|
|
||||||
* A compilation error consists of an error message and position.
|
|
||||||
*/
|
|
||||||
class error
|
|
||||||
{
|
|
||||||
protected:
|
|
||||||
error(const char *path, const struct position position);
|
|
||||||
|
|
||||||
public:
|
|
||||||
const struct position position;
|
|
||||||
const char *path;
|
|
||||||
|
|
||||||
virtual ~error() = default;
|
|
||||||
|
|
||||||
/// Error text.
|
|
||||||
virtual std::string what() const = 0;
|
|
||||||
|
|
||||||
/// Error line in the source text.
|
|
||||||
std::size_t line() const;
|
|
||||||
|
|
||||||
/// Error column in the source text.
|
|
||||||
std::size_t column() const;
|
|
||||||
};
|
|
||||||
|
|
||||||
using error_list = typename std::deque<std::unique_ptr<error>>;
|
|
||||||
|
|
||||||
class error_container
|
|
||||||
{
|
|
||||||
protected:
|
|
||||||
error_list m_errors;
|
|
||||||
|
|
||||||
error_container(const char *input_file);
|
|
||||||
|
|
||||||
public:
|
|
||||||
const char *input_file;
|
|
||||||
|
|
||||||
error_list& errors();
|
|
||||||
|
|
||||||
template<typename T, typename... Args>
|
|
||||||
void add_error(Args... arguments)
|
|
||||||
{
|
|
||||||
auto new_error = std::make_unique<T>(arguments...);
|
|
||||||
m_errors.emplace_back(std::move(new_error));
|
|
||||||
}
|
|
||||||
};
|
|
||||||
|
|
||||||
/**
|
|
||||||
* Tags a procedure type as never returning.
|
|
||||||
*/
|
|
||||||
template<typename T>
|
|
||||||
struct return_declaration
|
|
||||||
{
|
|
||||||
return_declaration() = default;
|
|
||||||
|
|
||||||
explicit return_declaration(T type)
|
|
||||||
: proper_type(type)
|
|
||||||
{
|
|
||||||
}
|
|
||||||
|
|
||||||
explicit return_declaration(std::monostate)
|
|
||||||
: no_return(true)
|
|
||||||
{
|
|
||||||
}
|
|
||||||
|
|
||||||
T proper_type{};
|
|
||||||
bool no_return{ false };
|
|
||||||
};
|
|
||||||
}
|
|
||||||
@ -1,103 +0,0 @@
|
|||||||
/* Name analysis.
|
|
||||||
Copyright (C) 2025 Free Software Foundation, Inc.
|
|
||||||
|
|
||||||
GCC 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.
|
|
||||||
|
|
||||||
GCC 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 GCC; see the file COPYING3. If not see
|
|
||||||
<http://www.gnu.org/licenses/>. */
|
|
||||||
|
|
||||||
#pragma once
|
|
||||||
|
|
||||||
#include <string>
|
|
||||||
#include <unordered_map>
|
|
||||||
#include <memory>
|
|
||||||
#include <deque>
|
|
||||||
|
|
||||||
#include "elna/boot/ast.h"
|
|
||||||
#include "elna/boot/result.h"
|
|
||||||
#include "elna/boot/symbol.h"
|
|
||||||
|
|
||||||
namespace elna::boot
|
|
||||||
{
|
|
||||||
class undeclared_error : public error
|
|
||||||
{
|
|
||||||
std::string identifier;
|
|
||||||
|
|
||||||
public:
|
|
||||||
undeclared_error(const std::string& identifier, const char *path, const struct position position);
|
|
||||||
|
|
||||||
std::string what() const override;
|
|
||||||
};
|
|
||||||
|
|
||||||
class already_declared_error : public error
|
|
||||||
{
|
|
||||||
std::string identifier;
|
|
||||||
|
|
||||||
public:
|
|
||||||
already_declared_error(const std::string& identifier, const char *path, const struct position position);
|
|
||||||
|
|
||||||
std::string what() const override;
|
|
||||||
};
|
|
||||||
|
|
||||||
class declaration_visitor final : public parser_visitor, public error_container
|
|
||||||
{
|
|
||||||
type current_type;
|
|
||||||
constant_info::variant current_literal;
|
|
||||||
|
|
||||||
std::shared_ptr<symbol_table> symbols;
|
|
||||||
|
|
||||||
procedure_type build_procedure(procedure_type_expression& type_expression);
|
|
||||||
|
|
||||||
public:
|
|
||||||
std::unordered_map<std::string, std::shared_ptr<alias_type>> unresolved;
|
|
||||||
|
|
||||||
explicit declaration_visitor(const char *path, std::shared_ptr<symbol_table> symbols);
|
|
||||||
|
|
||||||
void visit(named_type_expression *type_expression) override;
|
|
||||||
void visit(array_type_expression *type_expression) override;
|
|
||||||
void visit(pointer_type_expression *type_expression) override;
|
|
||||||
void visit(program *program) override;
|
|
||||||
void visit(type_definition *definition) override;
|
|
||||||
void visit(record_type_expression *type_expression) override;
|
|
||||||
void visit(union_type_expression *type_expression) override;
|
|
||||||
void visit(procedure_type_expression *type_expression) override;
|
|
||||||
void visit(enumeration_type_expression *type_expression) override;
|
|
||||||
|
|
||||||
void visit(variable_declaration *declaration) override;
|
|
||||||
void visit(constant_definition *definition) override;
|
|
||||||
void visit(procedure_definition *definition) override;
|
|
||||||
void visit(assign_statement *statement) override;
|
|
||||||
void visit(if_statement *statement) override;
|
|
||||||
void visit(escape_statement *) override;
|
|
||||||
void visit(while_statement *statement) override;
|
|
||||||
void visit(return_statement *statement) override;
|
|
||||||
void visit(defer_statement *statement) override;
|
|
||||||
void visit(case_statement *statement) override;
|
|
||||||
void visit(procedure_call *call) override;
|
|
||||||
void visit(block *block) override;
|
|
||||||
void visit(cast_expression *expression) override;
|
|
||||||
void visit(traits_expression *trait) override;
|
|
||||||
void visit(binary_expression *expression) override;
|
|
||||||
void visit(unary_expression *expression) override;
|
|
||||||
void visit(variable_expression *) override;
|
|
||||||
void visit(array_access_expression *expression) override;
|
|
||||||
void visit(field_access_expression *expression) override;
|
|
||||||
void visit(dereference_expression *expression) override;
|
|
||||||
void visit(literal<std::int32_t> *literal) override;
|
|
||||||
void visit(literal<std::uint32_t> *literal) override;
|
|
||||||
void visit(literal<double> *literal) override;
|
|
||||||
void visit(literal<bool> *literal) override;
|
|
||||||
void visit(literal<unsigned char> *literal) override;
|
|
||||||
void visit(literal<std::nullptr_t> *literal) override;
|
|
||||||
void visit(literal<std::string> *literal) override;
|
|
||||||
};
|
|
||||||
}
|
|
||||||
@ -1,327 +0,0 @@
|
|||||||
/* Symbol definitions.
|
|
||||||
Copyright (C) 2025 Free Software Foundation, Inc.
|
|
||||||
|
|
||||||
GCC 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.
|
|
||||||
|
|
||||||
GCC 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 GCC; see the file COPYING3. If not see
|
|
||||||
<http://www.gnu.org/licenses/>. */
|
|
||||||
|
|
||||||
#pragma once
|
|
||||||
|
|
||||||
#include <cstdint>
|
|
||||||
#include <unordered_map>
|
|
||||||
#include <string>
|
|
||||||
#include <memory>
|
|
||||||
#include <vector>
|
|
||||||
|
|
||||||
#include "elna/boot/result.h"
|
|
||||||
|
|
||||||
namespace elna::boot
|
|
||||||
{
|
|
||||||
class alias_type;
|
|
||||||
class primitive_type;
|
|
||||||
class record_type;
|
|
||||||
class union_type;
|
|
||||||
class pointer_type;
|
|
||||||
class array_type;
|
|
||||||
class procedure_type;
|
|
||||||
class enumeration_type;
|
|
||||||
|
|
||||||
class type
|
|
||||||
{
|
|
||||||
enum class type_tag
|
|
||||||
{
|
|
||||||
empty,
|
|
||||||
alias,
|
|
||||||
primitive,
|
|
||||||
record,
|
|
||||||
_union,
|
|
||||||
pointer,
|
|
||||||
array,
|
|
||||||
procedure,
|
|
||||||
enumeration
|
|
||||||
};
|
|
||||||
type_tag tag{ type_tag::empty };
|
|
||||||
union
|
|
||||||
{
|
|
||||||
std::weak_ptr<alias_type> alias;
|
|
||||||
std::shared_ptr<primitive_type> primitive;
|
|
||||||
std::shared_ptr<record_type> record;
|
|
||||||
std::shared_ptr<union_type> _union;
|
|
||||||
std::shared_ptr<pointer_type> pointer;
|
|
||||||
std::shared_ptr<array_type> array;
|
|
||||||
std::shared_ptr<procedure_type> procedure;
|
|
||||||
std::shared_ptr<enumeration_type> enumeration;
|
|
||||||
};
|
|
||||||
|
|
||||||
void copy(const type& other);
|
|
||||||
void move(type&& other);
|
|
||||||
|
|
||||||
public:
|
|
||||||
type();
|
|
||||||
explicit type(std::shared_ptr<alias_type> alias);
|
|
||||||
explicit type(std::shared_ptr<primitive_type> primitive);
|
|
||||||
explicit type(std::shared_ptr<record_type> record);
|
|
||||||
explicit type(std::shared_ptr<union_type> _union);
|
|
||||||
explicit type(std::shared_ptr<pointer_type> pointer);
|
|
||||||
explicit type(std::shared_ptr<array_type> array);
|
|
||||||
explicit type(std::shared_ptr<procedure_type> procedure);
|
|
||||||
explicit type(std::shared_ptr<enumeration_type> enumeration);
|
|
||||||
|
|
||||||
type(const type& other);
|
|
||||||
type& operator=(const type& other);
|
|
||||||
|
|
||||||
type(type&& other);
|
|
||||||
type& operator=(type&& other);
|
|
||||||
|
|
||||||
bool operator==(const std::nullptr_t&);
|
|
||||||
|
|
||||||
~type();
|
|
||||||
|
|
||||||
template<typename T>
|
|
||||||
std::shared_ptr<T> get() const;
|
|
||||||
|
|
||||||
bool empty() const;
|
|
||||||
};
|
|
||||||
|
|
||||||
struct alias_type
|
|
||||||
{
|
|
||||||
const std::string name;
|
|
||||||
type reference;
|
|
||||||
|
|
||||||
explicit alias_type(const std::string& name);
|
|
||||||
};
|
|
||||||
|
|
||||||
struct pointer_type
|
|
||||||
{
|
|
||||||
const type base;
|
|
||||||
|
|
||||||
explicit pointer_type(type base);
|
|
||||||
};
|
|
||||||
|
|
||||||
struct array_type
|
|
||||||
{
|
|
||||||
const type base;
|
|
||||||
const std::uint64_t size;
|
|
||||||
|
|
||||||
array_type(type base, std::uint64_t size);
|
|
||||||
};
|
|
||||||
|
|
||||||
struct primitive_type
|
|
||||||
{
|
|
||||||
const std::string identifier;
|
|
||||||
|
|
||||||
explicit primitive_type(const std::string& identifier);
|
|
||||||
};
|
|
||||||
|
|
||||||
using type_field = std::pair<std::string, type>;
|
|
||||||
|
|
||||||
struct record_type
|
|
||||||
{
|
|
||||||
std::vector<type_field> fields;
|
|
||||||
};
|
|
||||||
|
|
||||||
struct union_type
|
|
||||||
{
|
|
||||||
std::vector<type_field> fields;
|
|
||||||
};
|
|
||||||
|
|
||||||
struct procedure_type
|
|
||||||
{
|
|
||||||
using return_t = return_declaration<type>;
|
|
||||||
|
|
||||||
std::vector<type> parameters;
|
|
||||||
const return_t return_type;
|
|
||||||
|
|
||||||
procedure_type(return_t return_type = return_t());
|
|
||||||
};
|
|
||||||
|
|
||||||
struct enumeration_type
|
|
||||||
{
|
|
||||||
std::vector<std::string> members;
|
|
||||||
|
|
||||||
explicit enumeration_type(const std::vector<std::string>& members);
|
|
||||||
};
|
|
||||||
|
|
||||||
class type_info;
|
|
||||||
class procedure_info;
|
|
||||||
class constant_info;
|
|
||||||
class variable_info;
|
|
||||||
|
|
||||||
class info : public std::enable_shared_from_this<info>
|
|
||||||
{
|
|
||||||
public:
|
|
||||||
virtual ~info() = 0;
|
|
||||||
|
|
||||||
virtual std::shared_ptr<type_info> is_type();
|
|
||||||
virtual std::shared_ptr<procedure_info> is_procedure();
|
|
||||||
virtual std::shared_ptr<constant_info> is_constant();
|
|
||||||
virtual std::shared_ptr<variable_info> is_variable();
|
|
||||||
};
|
|
||||||
|
|
||||||
class type_info : public info
|
|
||||||
{
|
|
||||||
public:
|
|
||||||
const type symbol;
|
|
||||||
|
|
||||||
explicit type_info(const type symbol);
|
|
||||||
std::shared_ptr<type_info> is_type() override;
|
|
||||||
};
|
|
||||||
|
|
||||||
class procedure_info : public info
|
|
||||||
{
|
|
||||||
public:
|
|
||||||
const procedure_type symbol;
|
|
||||||
const std::vector<std::string> names;
|
|
||||||
|
|
||||||
procedure_info(const procedure_type symbol, const std::vector<std::string> names);
|
|
||||||
std::shared_ptr<procedure_info> is_procedure() override;
|
|
||||||
};
|
|
||||||
|
|
||||||
class constant_info : public info
|
|
||||||
{
|
|
||||||
public:
|
|
||||||
using variant = typename
|
|
||||||
std::variant<std::int32_t, std::uint32_t, double, bool, unsigned char, std::nullptr_t, std::string>;
|
|
||||||
|
|
||||||
const variant symbol;
|
|
||||||
|
|
||||||
explicit constant_info(const variant& symbol);
|
|
||||||
std::shared_ptr<constant_info> is_constant() override;
|
|
||||||
};
|
|
||||||
|
|
||||||
class variable_info : public info
|
|
||||||
{
|
|
||||||
public:
|
|
||||||
const std::string name;
|
|
||||||
const type symbol;
|
|
||||||
|
|
||||||
variable_info(const std::string& name, const type symbol);
|
|
||||||
std::shared_ptr<variable_info> is_variable() override;
|
|
||||||
};
|
|
||||||
|
|
||||||
/**
|
|
||||||
* Symbol table.
|
|
||||||
*/
|
|
||||||
template<typename T, typename U, U nothing>
|
|
||||||
class symbol_map
|
|
||||||
{
|
|
||||||
public:
|
|
||||||
using symbol_ptr = typename std::enable_if<
|
|
||||||
std::is_convertible<U, T>::value || std::is_assignable<T, U>::value,
|
|
||||||
T
|
|
||||||
>::type;
|
|
||||||
using iterator = typename std::unordered_map<std::string, symbol_ptr>::iterator;
|
|
||||||
using const_iterator = typename std::unordered_map<std::string, symbol_ptr>::const_iterator;
|
|
||||||
|
|
||||||
private:
|
|
||||||
std::unordered_map<std::string, symbol_ptr> entries;
|
|
||||||
std::shared_ptr<symbol_map> outer_scope;
|
|
||||||
|
|
||||||
public:
|
|
||||||
/**
|
|
||||||
* Constructs a new symbol with an optional outer scope.
|
|
||||||
*
|
|
||||||
* \param scope Outer scope.
|
|
||||||
*/
|
|
||||||
explicit symbol_map(std::shared_ptr<symbol_map> scope = nullptr)
|
|
||||||
: outer_scope(scope)
|
|
||||||
{
|
|
||||||
}
|
|
||||||
|
|
||||||
iterator begin()
|
|
||||||
{
|
|
||||||
return this->entries.begin();
|
|
||||||
}
|
|
||||||
|
|
||||||
iterator end()
|
|
||||||
{
|
|
||||||
return this->entries.end();
|
|
||||||
}
|
|
||||||
|
|
||||||
const_iterator cbegin() const
|
|
||||||
{
|
|
||||||
return this->entries.cbegin();
|
|
||||||
}
|
|
||||||
|
|
||||||
const_iterator cend() const
|
|
||||||
{
|
|
||||||
return this->entries.cend();
|
|
||||||
}
|
|
||||||
|
|
||||||
/**
|
|
||||||
* \return Symbol count in the current scope.
|
|
||||||
*/
|
|
||||||
std::size_t size() const
|
|
||||||
{
|
|
||||||
return this->entries.size();
|
|
||||||
}
|
|
||||||
|
|
||||||
/**
|
|
||||||
* Looks for symbol in the table by name. Returns nothing if the symbol
|
|
||||||
* can not be found.
|
|
||||||
*
|
|
||||||
* \param name Symbol name.
|
|
||||||
* \return Symbol from the table if found.
|
|
||||||
*/
|
|
||||||
symbol_ptr lookup(const std::string& name)
|
|
||||||
{
|
|
||||||
auto entry = entries.find(name);
|
|
||||||
|
|
||||||
if (entry != entries.cend())
|
|
||||||
{
|
|
||||||
return entry->second;
|
|
||||||
}
|
|
||||||
if (this->outer_scope != nullptr)
|
|
||||||
{
|
|
||||||
return this->outer_scope->lookup(name);
|
|
||||||
}
|
|
||||||
return nothing;
|
|
||||||
}
|
|
||||||
|
|
||||||
/**
|
|
||||||
* \param name Symbol name.
|
|
||||||
* \return Whether the table contains a symbol with the given name.
|
|
||||||
*/
|
|
||||||
bool contains(const std::string& name)
|
|
||||||
{
|
|
||||||
return lookup(name) != nothing;
|
|
||||||
}
|
|
||||||
|
|
||||||
/**
|
|
||||||
* Registers new symbol.
|
|
||||||
*
|
|
||||||
* \param name Symbol name.
|
|
||||||
* \param entry Symbol information.
|
|
||||||
*
|
|
||||||
* \return Whether the insertion took place.
|
|
||||||
*/
|
|
||||||
bool enter(const std::string& name, symbol_ptr entry)
|
|
||||||
{
|
|
||||||
return lookup(name) == nothing && entries.insert({ name, entry }).second;
|
|
||||||
}
|
|
||||||
|
|
||||||
/**
|
|
||||||
* Returns the outer scope or nullptr if the this is the global scope.
|
|
||||||
*
|
|
||||||
* \return Outer scope.
|
|
||||||
*/
|
|
||||||
std::shared_ptr<symbol_map> scope()
|
|
||||||
{
|
|
||||||
return this->outer_scope;
|
|
||||||
}
|
|
||||||
};
|
|
||||||
|
|
||||||
using symbol_table = symbol_map<std::shared_ptr<info>, std::nullptr_t, nullptr>;
|
|
||||||
|
|
||||||
std::shared_ptr<symbol_table> builtin_symbol_table();
|
|
||||||
}
|
|
||||||
@ -1,32 +0,0 @@
|
|||||||
/* Builtin definitions.
|
|
||||||
Copyright (C) 2025 Free Software Foundation, Inc.
|
|
||||||
|
|
||||||
GCC 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.
|
|
||||||
|
|
||||||
GCC 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 GCC; see the file COPYING3. If not see
|
|
||||||
<http://www.gnu.org/licenses/>. */
|
|
||||||
|
|
||||||
#include <memory>
|
|
||||||
|
|
||||||
#include "config.h"
|
|
||||||
#include "system.h"
|
|
||||||
#include "coretypes.h"
|
|
||||||
#include "tree.h"
|
|
||||||
#include "tree-iterator.h"
|
|
||||||
|
|
||||||
#include "elna/gcc/elna-tree.h"
|
|
||||||
|
|
||||||
namespace elna::gcc
|
|
||||||
{
|
|
||||||
void init_ttree();
|
|
||||||
std::shared_ptr<symbol_table> builtin_symbol_table();
|
|
||||||
}
|
|
||||||
@ -1,37 +0,0 @@
|
|||||||
/* Elna frontend specific diagnostic routines.
|
|
||||||
Copyright (C) 2025 Free Software Foundation, Inc.
|
|
||||||
|
|
||||||
GCC 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.
|
|
||||||
|
|
||||||
GCC 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 GCC; see the file COPYING3. If not see
|
|
||||||
<http://www.gnu.org/licenses/>. */
|
|
||||||
|
|
||||||
#pragma once
|
|
||||||
|
|
||||||
#include "config.h"
|
|
||||||
#include "system.h"
|
|
||||||
#include "coretypes.h"
|
|
||||||
#include "input.h"
|
|
||||||
#include "tree.h"
|
|
||||||
#include "diagnostic.h"
|
|
||||||
|
|
||||||
#include <deque>
|
|
||||||
#include <memory>
|
|
||||||
|
|
||||||
#include "elna/boot/result.h"
|
|
||||||
|
|
||||||
namespace elna::gcc
|
|
||||||
{
|
|
||||||
location_t get_location(const boot::position *position);
|
|
||||||
std::string print_type(tree type);
|
|
||||||
void report_errors(const std::deque<std::unique_ptr<boot::error>>& errors);
|
|
||||||
}
|
|
||||||
@ -1,119 +0,0 @@
|
|||||||
/* Visitor generating a GENERIC tree.
|
|
||||||
Copyright (C) 2025 Free Software Foundation, Inc.
|
|
||||||
|
|
||||||
GCC 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.
|
|
||||||
|
|
||||||
GCC 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 GCC; see the file COPYING3. If not see
|
|
||||||
<http://www.gnu.org/licenses/>. */
|
|
||||||
|
|
||||||
#pragma once
|
|
||||||
|
|
||||||
#include "elna/boot/ast.h"
|
|
||||||
#include "elna/boot/symbol.h"
|
|
||||||
#include "elna/boot/semantic.h"
|
|
||||||
#include "elna/gcc/elna-tree.h"
|
|
||||||
|
|
||||||
#include "config.h"
|
|
||||||
#include "system.h"
|
|
||||||
#include "coretypes.h"
|
|
||||||
#include "tree.h"
|
|
||||||
#include "tree-iterator.h"
|
|
||||||
|
|
||||||
#include <string>
|
|
||||||
#include <forward_list>
|
|
||||||
|
|
||||||
namespace elna::gcc
|
|
||||||
{
|
|
||||||
std::deque<std::unique_ptr<boot::error>> do_semantic_analysis(const char *path,
|
|
||||||
const std::unique_ptr<boot::program>& ast, std::shared_ptr<boot::symbol_table> info_table,
|
|
||||||
std::shared_ptr<symbol_table> symbols, std::unordered_map<std::string, tree>& unresolved);
|
|
||||||
tree handle_symbol(const std::string& symbol_name, std::shared_ptr<boot::alias_type> reference,
|
|
||||||
std::shared_ptr<symbol_table> symbols, std::unordered_map<std::string, tree>& unresolved,
|
|
||||||
std::vector<std::string>& path);
|
|
||||||
|
|
||||||
class generic_visitor final : public boot::parser_visitor
|
|
||||||
{
|
|
||||||
tree current_expression{ NULL_TREE };
|
|
||||||
std::shared_ptr<symbol_table> symbols;
|
|
||||||
std::unordered_map<std::string, tree> unresolved;
|
|
||||||
std::forward_list<std::pair<tree, tree>> loops;
|
|
||||||
|
|
||||||
void declare_procedure(boot::procedure_definition *const definition);
|
|
||||||
tree build_procedure_type(boot::procedure_type_expression& type);
|
|
||||||
void build_composite_type(const std::vector<boot::field_declaration>& fields,
|
|
||||||
tree composite_type_node);
|
|
||||||
|
|
||||||
void enter_scope();
|
|
||||||
tree leave_scope();
|
|
||||||
|
|
||||||
void make_if_branch(boot::conditional_statements& branch, tree goto_endif);
|
|
||||||
|
|
||||||
tree build_arithmetic_operation(boot::binary_expression *expression,
|
|
||||||
tree_code operator_code, tree left, tree right);
|
|
||||||
tree build_comparison_operation(boot::binary_expression *expression,
|
|
||||||
tree_code operator_code, tree left, tree right);
|
|
||||||
tree build_bit_logic_operation(boot::binary_expression *expression, tree left, tree right);
|
|
||||||
tree build_equality_operation(boot::binary_expression *expression, tree left, tree right);
|
|
||||||
void build_procedure_call(location_t call_location,
|
|
||||||
tree procedure_address, const std::vector<boot::expression *>& arguments);
|
|
||||||
void build_record_call(location_t call_location,
|
|
||||||
tree symbol, const std::vector<boot::expression *>& arguments);
|
|
||||||
bool build_builtin_procedures(boot::procedure_call *call);
|
|
||||||
void build_assert_builtin(location_t call_location, const std::vector<boot::expression *>& arguments);
|
|
||||||
|
|
||||||
bool expect_trait_type_only(boot::traits_expression *trait);
|
|
||||||
bool expect_trait_for_integral_type(boot::traits_expression *trait);
|
|
||||||
void visit_statements(const std::vector<boot::statement *>& statements);
|
|
||||||
bool assert_constant(location_t expression_location);
|
|
||||||
|
|
||||||
public:
|
|
||||||
generic_visitor(std::shared_ptr<symbol_table> symbol_table,
|
|
||||||
std::unordered_map<std::string, tree>&& unresolved);
|
|
||||||
|
|
||||||
void visit(boot::program *program) override;
|
|
||||||
void visit(boot::procedure_definition *definition) override;
|
|
||||||
void visit(boot::procedure_call *call) override;
|
|
||||||
void visit(boot::cast_expression *expression) override;
|
|
||||||
void visit(boot::traits_expression *trait) override;
|
|
||||||
void visit(boot::literal<std::int32_t> *literal) override;
|
|
||||||
void visit(boot::literal<std::uint32_t> *literal) override;
|
|
||||||
void visit(boot::literal<double> *literal) override;
|
|
||||||
void visit(boot::literal<bool> *boolean) override;
|
|
||||||
void visit(boot::literal<unsigned char> *character) override;
|
|
||||||
void visit(boot::literal<std::nullptr_t> *) override;
|
|
||||||
void visit(boot::literal<std::string> *string) override;
|
|
||||||
void visit(boot::binary_expression *expression) override;
|
|
||||||
void visit(boot::unary_expression *expression) override;
|
|
||||||
void visit(boot::constant_definition *definition) override;
|
|
||||||
void visit(boot::type_definition *definition) override;
|
|
||||||
void visit(boot::variable_declaration *declaration) override;
|
|
||||||
void visit(boot::variable_expression *expression) override;
|
|
||||||
void visit(boot::array_access_expression *expression) override;
|
|
||||||
void visit(boot::field_access_expression *expression) override;
|
|
||||||
void visit(boot::dereference_expression *expression) override;
|
|
||||||
void visit(boot::block *block) override;
|
|
||||||
void visit(boot::assign_statement *statement) override;
|
|
||||||
void visit(boot::if_statement *statement) override;
|
|
||||||
void visit(boot::escape_statement *statement) override;
|
|
||||||
void visit(boot::while_statement *statement) override;
|
|
||||||
void visit(boot::named_type_expression *type) override;
|
|
||||||
void visit(boot::array_type_expression *type) override;
|
|
||||||
void visit(boot::pointer_type_expression *type) override;
|
|
||||||
void visit(boot::record_type_expression *type) override;
|
|
||||||
void visit(boot::union_type_expression *type) override;
|
|
||||||
void visit(boot::procedure_type_expression *type) override;
|
|
||||||
void visit(boot::enumeration_type_expression *type) override;
|
|
||||||
void visit(boot::return_statement *statement) override;
|
|
||||||
void visit(boot::defer_statement *statement) override;
|
|
||||||
void visit(boot::case_statement *statement) override;
|
|
||||||
};
|
|
||||||
}
|
|
||||||
@ -1,100 +0,0 @@
|
|||||||
/* Utilities to manipulate GCC trees.
|
|
||||||
Copyright (C) 2025 Free Software Foundation, Inc.
|
|
||||||
|
|
||||||
GCC 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.
|
|
||||||
|
|
||||||
GCC 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 GCC; see the file COPYING3. If not see
|
|
||||||
<http://www.gnu.org/licenses/>. */
|
|
||||||
|
|
||||||
#pragma once
|
|
||||||
|
|
||||||
#include <forward_list>
|
|
||||||
|
|
||||||
#include "config.h"
|
|
||||||
#include "system.h"
|
|
||||||
#include "coretypes.h"
|
|
||||||
#include "tree.h"
|
|
||||||
#include "tree-iterator.h"
|
|
||||||
#include "stringpool.h"
|
|
||||||
|
|
||||||
#include "elna/boot/ast.h"
|
|
||||||
#include "elna/boot/symbol.h"
|
|
||||||
#include "elna/gcc/elna1.h"
|
|
||||||
|
|
||||||
namespace elna::gcc
|
|
||||||
{
|
|
||||||
using symbol_table = boot::symbol_map<tree, tree, NULL_TREE>;
|
|
||||||
|
|
||||||
bool is_integral_type(tree type);
|
|
||||||
bool is_numeric_type(tree type);
|
|
||||||
bool is_unique_type(tree type);
|
|
||||||
bool is_void_type(tree type);
|
|
||||||
|
|
||||||
/**
|
|
||||||
* \param type The type to evaluate.
|
|
||||||
* \return Whether this type can be converted to another type.
|
|
||||||
*/
|
|
||||||
bool is_castable_type(tree type);
|
|
||||||
|
|
||||||
/**
|
|
||||||
* \param lhs Left hand value.
|
|
||||||
* \param rhs Right hand value.
|
|
||||||
* \return Whether rhs can be assigned to lhs.
|
|
||||||
*/
|
|
||||||
bool are_compatible_pointers(tree lhs_type, tree rhs);
|
|
||||||
|
|
||||||
/**
|
|
||||||
* Prepares a value to be bound to a variable or parameter.
|
|
||||||
*
|
|
||||||
* If rvalue is a procedure declaration, builds a procedure pointer.
|
|
||||||
*
|
|
||||||
* \param rvalue Value to be assigned.
|
|
||||||
* \return Processed value.
|
|
||||||
*/
|
|
||||||
tree prepare_rvalue(tree rvalue);
|
|
||||||
|
|
||||||
/**
|
|
||||||
* \param assignee Assignee.
|
|
||||||
* \param assignee Assignment.
|
|
||||||
* \return Whether an expression assignment can be assigned to a variable of type assignee.
|
|
||||||
*/
|
|
||||||
bool is_assignable_from(tree assignee, tree assignment);
|
|
||||||
|
|
||||||
void append_statement(tree statement_tree);
|
|
||||||
void defer(tree statement_tree);
|
|
||||||
tree chain_defer();
|
|
||||||
|
|
||||||
tree do_pointer_arithmetic(boot::binary_operator binary_operator,
|
|
||||||
tree left, tree right, location_t expression_location);
|
|
||||||
tree build_binary_operation(bool condition, boot::binary_expression *expression,
|
|
||||||
tree_code operator_code, tree left, tree right, tree target_type);
|
|
||||||
tree build_arithmetic_operation(boot::binary_expression *expression,
|
|
||||||
tree_code operator_code, tree left, tree right);
|
|
||||||
tree build_field(location_t location, tree record_type, const std::string name, tree type);
|
|
||||||
tree find_field_by_name(location_t expression_location, tree type, const std::string& field_name);
|
|
||||||
tree build_global_pointer_type(tree type);
|
|
||||||
tree build_label_decl(const char *name, location_t loc);
|
|
||||||
|
|
||||||
tree extract_constant(tree expression);
|
|
||||||
|
|
||||||
template<typename... Args>
|
|
||||||
tree call_built_in(location_t call_location, const char *name, tree return_type, Args... arguments)
|
|
||||||
{
|
|
||||||
tree *builtin = elna_global_decls->get(name);
|
|
||||||
gcc_assert(builtin != nullptr);
|
|
||||||
|
|
||||||
tree fndecl_type = build_function_type(return_type, TYPE_ARG_TYPES(*builtin));
|
|
||||||
tree builtin_addr = build1_loc(call_location, ADDR_EXPR, build_pointer_type(fndecl_type), *builtin);
|
|
||||||
|
|
||||||
return build_call_nary(return_type, builtin_addr, sizeof...(Args), arguments...);
|
|
||||||
}
|
|
||||||
}
|
|
||||||
@ -1,94 +0,0 @@
|
|||||||
/* Language-dependent hooks for Elna.
|
|
||||||
Copyright (C) 2025 Free Software Foundation, Inc.
|
|
||||||
|
|
||||||
GCC 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.
|
|
||||||
|
|
||||||
GCC 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 GCC; see the file COPYING3. If not see
|
|
||||||
<http://www.gnu.org/licenses/>. */
|
|
||||||
|
|
||||||
#pragma once
|
|
||||||
|
|
||||||
enum elna_tree_index
|
|
||||||
{
|
|
||||||
ELNA_TI_INT_TYPE,
|
|
||||||
ELNA_TI_WORD_TYPE,
|
|
||||||
ELNA_TI_CHAR_TYPE,
|
|
||||||
ELNA_TI_BOOL_TYPE,
|
|
||||||
ELNA_TI_BYTE_TYPE,
|
|
||||||
ELNA_TI_FLOAT_TYPE,
|
|
||||||
ELNA_TI_STRING_TYPE,
|
|
||||||
ELNA_TI_BOOL_TRUE,
|
|
||||||
ELNA_TI_BOOL_FALSE,
|
|
||||||
ELNA_TI_POINTER_NIL,
|
|
||||||
ELNA_TI_STRING_PTR_FIELD,
|
|
||||||
ELNA_TI_STRING_LENGTH_FIELD,
|
|
||||||
ELNA_TI_MAX
|
|
||||||
};
|
|
||||||
|
|
||||||
extern GTY(()) tree elna_global_trees[ELNA_TI_MAX];
|
|
||||||
extern GTY(()) hash_map<nofree_string_hash, tree> *elna_global_decls;
|
|
||||||
|
|
||||||
#define elna_int_type_node elna_global_trees[ELNA_TI_INT_TYPE]
|
|
||||||
#define elna_word_type_node elna_global_trees[ELNA_TI_WORD_TYPE]
|
|
||||||
#define elna_char_type_node elna_global_trees[ELNA_TI_CHAR_TYPE]
|
|
||||||
#define elna_bool_type_node elna_global_trees[ELNA_TI_BOOL_TYPE]
|
|
||||||
#define elna_byte_type_node elna_global_trees[ELNA_TI_BYTE_TYPE]
|
|
||||||
#define elna_float_type_node elna_global_trees[ELNA_TI_FLOAT_TYPE]
|
|
||||||
#define elna_string_type_node elna_global_trees[ELNA_TI_STRING_TYPE]
|
|
||||||
#define elna_bool_true_node elna_global_trees[ELNA_TI_BOOL_TRUE]
|
|
||||||
#define elna_bool_false_node elna_global_trees[ELNA_TI_BOOL_FALSE]
|
|
||||||
#define elna_pointer_nil_node elna_global_trees[ELNA_TI_POINTER_NIL]
|
|
||||||
#define elna_string_ptr_field_node elna_global_trees[ELNA_TI_STRING_PTR_FIELD]
|
|
||||||
#define elna_string_length_field_node elna_global_trees[ELNA_TI_STRING_LENGTH_FIELD]
|
|
||||||
|
|
||||||
/* Language-dependent contents of a type. */
|
|
||||||
struct GTY (()) lang_type
|
|
||||||
{
|
|
||||||
};
|
|
||||||
|
|
||||||
/* Language-dependent contents of a decl. */
|
|
||||||
struct GTY (()) lang_decl
|
|
||||||
{
|
|
||||||
};
|
|
||||||
|
|
||||||
struct GTY (()) defer_scope
|
|
||||||
{
|
|
||||||
tree defer_block;
|
|
||||||
tree try_statements;
|
|
||||||
};
|
|
||||||
|
|
||||||
struct GTY ((chain_next ("%h.level_chain"))) binding_level
|
|
||||||
{
|
|
||||||
// A block chain is needed to call defer statements beloning to each block.
|
|
||||||
tree blocks;
|
|
||||||
|
|
||||||
// Parent level.
|
|
||||||
struct binding_level *level_chain;
|
|
||||||
|
|
||||||
// Statements before the first defer has been seen.
|
|
||||||
tree statement_list;
|
|
||||||
|
|
||||||
// Defer statement coupled with statements following it.
|
|
||||||
vec<defer_scope, va_gc> *defers;
|
|
||||||
};
|
|
||||||
|
|
||||||
struct GTY (()) language_function
|
|
||||||
{
|
|
||||||
// Local variables and constants.
|
|
||||||
tree names;
|
|
||||||
|
|
||||||
// Lexical scope.
|
|
||||||
struct binding_level *binding_level;
|
|
||||||
};
|
|
||||||
|
|
||||||
#define f_binding_level DECL_STRUCT_FUNCTION(current_function_decl)->language->binding_level
|
|
||||||
#define f_names DECL_STRUCT_FUNCTION(current_function_decl)->language->names
|
|
||||||
323
rakelib/cross.rake
Normal file
323
rakelib/cross.rake
Normal file
@ -0,0 +1,323 @@
|
|||||||
|
# This Source Code Form is subject to the terms of the Mozilla Public License,
|
||||||
|
# v. 2.0. If a copy of the MPL was not distributed with this file, You can
|
||||||
|
# obtain one at https://mozilla.org/MPL/2.0/. -}
|
||||||
|
# frozen_string_literal: true
|
||||||
|
|
||||||
|
require 'pathname'
|
||||||
|
require 'uri'
|
||||||
|
require 'net/http'
|
||||||
|
require 'rake/clean'
|
||||||
|
require 'open3'
|
||||||
|
require 'etc'
|
||||||
|
|
||||||
|
GCC_VERSION = "15.1.0"
|
||||||
|
BINUTILS_VERSION = '2.44'
|
||||||
|
GLIBC_VERSION = '2.41'
|
||||||
|
KERNEL_VERSION = '5.15.181'
|
||||||
|
|
||||||
|
CLOBBER.include 'build'
|
||||||
|
|
||||||
|
class BuildTarget
|
||||||
|
attr_accessor(:build, :gcc, :target, :tmp)
|
||||||
|
|
||||||
|
def gxx
|
||||||
|
@gcc.gsub 'c', '+'
|
||||||
|
end
|
||||||
|
|
||||||
|
def sysroot
|
||||||
|
tmp + 'sysroot'
|
||||||
|
end
|
||||||
|
|
||||||
|
def rootfs
|
||||||
|
tmp + 'rootfs'
|
||||||
|
end
|
||||||
|
|
||||||
|
def tools
|
||||||
|
tmp + 'tools'
|
||||||
|
end
|
||||||
|
end
|
||||||
|
|
||||||
|
def gcc_verbose(gcc_binary)
|
||||||
|
read, write = IO.pipe
|
||||||
|
sh({'LANG' => 'C'}, gcc_binary, '--verbose', err: write)
|
||||||
|
write.close
|
||||||
|
output = read.read
|
||||||
|
read.close
|
||||||
|
output
|
||||||
|
end
|
||||||
|
|
||||||
|
def find_build_target(gcc_version, task)
|
||||||
|
gcc_binary = 'gcc'
|
||||||
|
output = gcc_verbose gcc_binary
|
||||||
|
|
||||||
|
if output.start_with? 'Apple clang'
|
||||||
|
gcc_binary = "gcc-#{gcc_version.split('.').first}"
|
||||||
|
output = gcc_verbose gcc_binary
|
||||||
|
end
|
||||||
|
result = output
|
||||||
|
.lines
|
||||||
|
.each_with_object(BuildTarget.new) do |line, accumulator|
|
||||||
|
if line.start_with? 'Target: '
|
||||||
|
accumulator.build = line.split(' ').last.strip
|
||||||
|
elsif line.start_with? 'COLLECT_GCC'
|
||||||
|
accumulator.gcc = line.split('=').last.strip
|
||||||
|
end
|
||||||
|
end
|
||||||
|
result.tmp = Pathname.new('./build')
|
||||||
|
task.with_defaults target: 'riscv32-unknown-linux-gnu'
|
||||||
|
result.target = task[:target]
|
||||||
|
result
|
||||||
|
end
|
||||||
|
|
||||||
|
def download_and_unarchive(url, target)
|
||||||
|
case File.extname url.path
|
||||||
|
when '.bz2'
|
||||||
|
archive_type = '-j'
|
||||||
|
root_directory = File.basename url.path, '.tar.bz2'
|
||||||
|
when '.xz'
|
||||||
|
archive_type = '-J'
|
||||||
|
root_directory = File.basename url.path, '.tar.xz'
|
||||||
|
else
|
||||||
|
raise "Unsupported archive type #{url.path}."
|
||||||
|
end
|
||||||
|
|
||||||
|
Net::HTTP.start(url.host, url.port, use_ssl: url.scheme == 'https') do |http|
|
||||||
|
request = Net::HTTP::Get.new url.request_uri
|
||||||
|
|
||||||
|
http.request request do |response|
|
||||||
|
case response
|
||||||
|
when Net::HTTPRedirection
|
||||||
|
download_and_unarchive URI.parse(response['location'])
|
||||||
|
when Net::HTTPSuccess
|
||||||
|
Open3.popen2 'tar', '-C', target.to_path, archive_type, '-xv' do |stdin, stdout, wait_thread|
|
||||||
|
Thread.new do
|
||||||
|
stdout.each { |line| puts line }
|
||||||
|
end
|
||||||
|
|
||||||
|
response.read_body do |chunk|
|
||||||
|
stdin.write chunk
|
||||||
|
end
|
||||||
|
stdin.close
|
||||||
|
|
||||||
|
wait_thread.value
|
||||||
|
end
|
||||||
|
else
|
||||||
|
response.error!
|
||||||
|
end
|
||||||
|
end
|
||||||
|
end
|
||||||
|
target + root_directory
|
||||||
|
end
|
||||||
|
|
||||||
|
namespace :cross do
|
||||||
|
desc 'Build cross binutils'
|
||||||
|
task :binutils, [:target] do |_, args|
|
||||||
|
options = find_build_target GCC_VERSION, args
|
||||||
|
options.tools.mkpath
|
||||||
|
source_directory = download_and_unarchive(
|
||||||
|
URI.parse("https://ftp.gnu.org/gnu/binutils/binutils-#{BINUTILS_VERSION}.tar.xz"),
|
||||||
|
options.tools)
|
||||||
|
|
||||||
|
cwd = source_directory.dirname + 'build-binutils'
|
||||||
|
cwd.mkpath
|
||||||
|
options.rootfs.mkpath
|
||||||
|
|
||||||
|
env = {
|
||||||
|
'CC' => options.gcc,
|
||||||
|
'CXX' => options.gxx
|
||||||
|
}
|
||||||
|
configure_options = [
|
||||||
|
"--prefix=#{options.rootfs.realpath}",
|
||||||
|
"--target=#{options.target}",
|
||||||
|
'--disable-nls',
|
||||||
|
'--enable-gprofng=no',
|
||||||
|
'--disable-werror',
|
||||||
|
'--enable-default-hash-style=gnu',
|
||||||
|
'--disable-libquadmath'
|
||||||
|
]
|
||||||
|
configure = source_directory.relative_path_from(cwd) + 'configure'
|
||||||
|
sh env, configure.to_path, *configure_options, chdir: cwd.to_path
|
||||||
|
sh env, 'make', '-j', Etc.nprocessors.to_s, chdir: cwd.to_path
|
||||||
|
sh env, 'make', 'install', chdir: cwd.to_path
|
||||||
|
end
|
||||||
|
|
||||||
|
desc 'Build stage 1 GCC'
|
||||||
|
task :gcc1, [:target] do |_, args|
|
||||||
|
options = find_build_target GCC_VERSION, args
|
||||||
|
options.tools.mkpath
|
||||||
|
source_directory = download_and_unarchive(
|
||||||
|
URI.parse("https://gcc.gnu.org/pub/gcc/releases/gcc-#{GCC_VERSION}/gcc-#{GCC_VERSION}.tar.xz"),
|
||||||
|
options.tools)
|
||||||
|
|
||||||
|
cwd = source_directory.dirname + 'build-gcc'
|
||||||
|
cwd.mkpath
|
||||||
|
options.rootfs.mkpath
|
||||||
|
options.sysroot.mkpath
|
||||||
|
|
||||||
|
sh 'contrib/download_prerequisites', chdir: source_directory.to_path
|
||||||
|
configure_options = [
|
||||||
|
"--prefix=#{options.rootfs.realpath}",
|
||||||
|
"--with-sysroot=#{options.sysroot.realpath}",
|
||||||
|
'--enable-languages=c,c++',
|
||||||
|
'--disable-shared',
|
||||||
|
'--with-arch=rv32imafdc',
|
||||||
|
'--with-abi=ilp32d',
|
||||||
|
'--with-tune=rocket',
|
||||||
|
'--with-isa-spec=20191213',
|
||||||
|
'--disable-bootstrap',
|
||||||
|
'--disable-multilib',
|
||||||
|
'--disable-libmudflap',
|
||||||
|
'--disable-libssp',
|
||||||
|
'--disable-libquadmath',
|
||||||
|
'--disable-libsanitizer',
|
||||||
|
'--disable-threads',
|
||||||
|
'--disable-libatomic',
|
||||||
|
'--disable-libgomp',
|
||||||
|
'--disable-libvtv',
|
||||||
|
'--disable-libstdcxx',
|
||||||
|
'--disable-nls',
|
||||||
|
'--with-newlib',
|
||||||
|
'--without-headers',
|
||||||
|
"--target=#{options.target}",
|
||||||
|
"--build=#{options.build}",
|
||||||
|
"--host=#{options.build}"
|
||||||
|
]
|
||||||
|
flags = '-O2 -fPIC'
|
||||||
|
env = {
|
||||||
|
'CC' => options.gcc,
|
||||||
|
'CXX' => options.gxx,
|
||||||
|
'CFLAGS' => flags,
|
||||||
|
'CXXFLAGS' => flags,
|
||||||
|
'PATH' => "#{options.rootfs.realpath + 'bin'}:#{ENV['PATH']}"
|
||||||
|
}
|
||||||
|
configure = source_directory.relative_path_from(cwd) + 'configure'
|
||||||
|
sh env, configure.to_path, *configure_options, chdir: cwd.to_path
|
||||||
|
sh env, 'make', '-j', Etc.nprocessors.to_s, chdir: cwd.to_path
|
||||||
|
sh env, 'make', 'install', chdir: cwd.to_path
|
||||||
|
end
|
||||||
|
|
||||||
|
desc 'Copy glibc headers'
|
||||||
|
task :headers, [:target] do |_, args|
|
||||||
|
options = find_build_target GCC_VERSION, args
|
||||||
|
options.tools.mkpath
|
||||||
|
|
||||||
|
source_directory = download_and_unarchive(
|
||||||
|
URI.parse("https://ftp.gnu.org/gnu/glibc/glibc-#{GLIBC_VERSION}.tar.xz"),
|
||||||
|
options.tools)
|
||||||
|
include_directory = options.tools + 'include'
|
||||||
|
|
||||||
|
include_directory.mkpath
|
||||||
|
cp (source_directory + 'elf/elf.h'), (include_directory + 'elf.h')
|
||||||
|
end
|
||||||
|
|
||||||
|
desc 'Build linux kernel'
|
||||||
|
task :kernel, [:target] do |_, args|
|
||||||
|
options = find_build_target GCC_VERSION, args
|
||||||
|
options.tools.mkpath
|
||||||
|
|
||||||
|
cwd = download_and_unarchive(
|
||||||
|
URI.parse("https://cdn.kernel.org/pub/linux/kernel/v5.x/linux-#{KERNEL_VERSION}.tar.xz"),
|
||||||
|
options.tools)
|
||||||
|
|
||||||
|
env = {
|
||||||
|
'CROSS_COMPILE' => "#{options.target}-",
|
||||||
|
'ARCH' => 'riscv',
|
||||||
|
'PATH' => "#{options.rootfs.realpath + 'bin'}:#{ENV['PATH']}",
|
||||||
|
'HOSTCFLAGS' => "-D_UUID_T -D__GETHOSTUUID_H -I#{options.tools.realpath + 'include'}"
|
||||||
|
}
|
||||||
|
sh env, 'make', 'rv32_defconfig', chdir: cwd.to_path
|
||||||
|
sh env, 'make', '-j', Etc.nprocessors.to_s, chdir: cwd.to_path
|
||||||
|
sh env, 'make', 'headers', chdir: cwd.to_path
|
||||||
|
|
||||||
|
user_directory = options.sysroot + 'usr'
|
||||||
|
|
||||||
|
user_directory.mkpath
|
||||||
|
cp_r (cwd + 'usr/include'), (user_directory + 'include')
|
||||||
|
end
|
||||||
|
|
||||||
|
desc 'Build glibc'
|
||||||
|
task :glibc, [:target] do |_, args|
|
||||||
|
options = find_build_target GCC_VERSION, args
|
||||||
|
source_directory = options.tools + "glibc-#{GLIBC_VERSION}"
|
||||||
|
configure_options = [
|
||||||
|
'--prefix=/usr',
|
||||||
|
"--host=#{options.target}",
|
||||||
|
"--target=#{options.target}",
|
||||||
|
"--build=#{options.build}",
|
||||||
|
"--enable-kernel=#{KERNEL_VERSION}",
|
||||||
|
"--with-headers=#{options.sysroot.realpath + 'usr/include'}",
|
||||||
|
'--disable-nscd',
|
||||||
|
'--disable-libquadmath',
|
||||||
|
'--disable-libitm',
|
||||||
|
'--disable-werror',
|
||||||
|
'libc_cv_forced_unwind=yes'
|
||||||
|
]
|
||||||
|
bin = options.rootfs.realpath + 'bin'
|
||||||
|
env = {
|
||||||
|
'PATH' => "#{bin}:#{ENV['PATH']}",
|
||||||
|
'MAKE' => 'make' # Otherwise it uses gnumake which can be different and too old.
|
||||||
|
}
|
||||||
|
cwd = source_directory.dirname + 'build-glibc'
|
||||||
|
cwd.mkpath
|
||||||
|
|
||||||
|
configure = source_directory.relative_path_from(cwd) +'./configure'
|
||||||
|
sh env, configure.to_path, *configure_options, chdir: cwd.to_path
|
||||||
|
sh env, 'make', '-j', Etc.nprocessors.to_s, chdir: cwd.to_path
|
||||||
|
sh env, 'make', "install_root=#{options.sysroot.realpath}", 'install', chdir: cwd.to_path
|
||||||
|
end
|
||||||
|
|
||||||
|
desc 'Build stage 2 GCC'
|
||||||
|
task :gcc2, [:target] do |_, args|
|
||||||
|
options = find_build_target GCC_VERSION, args
|
||||||
|
source_directory = options.tools + "gcc-#{GCC_VERSION}"
|
||||||
|
cwd = options.tools + 'build-gcc'
|
||||||
|
|
||||||
|
rm_rf cwd
|
||||||
|
cwd.mkpath
|
||||||
|
|
||||||
|
configure_options = [
|
||||||
|
"--prefix=#{options.rootfs.realpath}",
|
||||||
|
"--with-sysroot=#{options.sysroot.realpath}",
|
||||||
|
'--enable-languages=c,c++,lto',
|
||||||
|
'--enable-lto',
|
||||||
|
'--enable-shared',
|
||||||
|
'--with-arch=rv32imafdc',
|
||||||
|
'--with-abi=ilp32d',
|
||||||
|
'--with-tune=rocket',
|
||||||
|
'--with-isa-spec=20191213',
|
||||||
|
'--disable-bootstrap',
|
||||||
|
'--disable-multilib',
|
||||||
|
'--enable-checking=release',
|
||||||
|
'--disable-libssp',
|
||||||
|
'--disable-libquadmath',
|
||||||
|
'--enable-threads=posix',
|
||||||
|
'--with-default-libstdcxx-abi=new',
|
||||||
|
'--disable-nls',
|
||||||
|
"--target=#{options.target}",
|
||||||
|
"--build=#{options.build}",
|
||||||
|
"--host=#{options.build}"
|
||||||
|
|
||||||
|
]
|
||||||
|
flags = '-O2 -fPIC'
|
||||||
|
env = {
|
||||||
|
'CFLAGS' => flags,
|
||||||
|
'CXXFLAGS' => flags,
|
||||||
|
'PATH' => "#{options.rootfs.realpath + 'bin'}:#{ENV['PATH']}"
|
||||||
|
}
|
||||||
|
configure = source_directory.relative_path_from(cwd) + 'configure'
|
||||||
|
sh env, configure.to_path, *configure_options, chdir: cwd.to_path
|
||||||
|
sh env, 'make', '-j', Etc.nprocessors.to_s, chdir: cwd.to_path
|
||||||
|
sh env, 'make', 'install', chdir: cwd.to_path
|
||||||
|
end
|
||||||
|
end
|
||||||
|
|
||||||
|
desc 'Build cross toolchain'
|
||||||
|
task cross: [
|
||||||
|
'cross:binutils',
|
||||||
|
'cross:gcc1',
|
||||||
|
'cross:headers',
|
||||||
|
'cross:kernel',
|
||||||
|
'cross:glibc',
|
||||||
|
'cross:gcc2'
|
||||||
|
] do
|
||||||
|
end
|
||||||
61
rakelib/stage.rake
Normal file
61
rakelib/stage.rake
Normal file
@ -0,0 +1,61 @@
|
|||||||
|
# This Source Code Form is subject to the terms of the Mozilla Public License,
|
||||||
|
# v. 2.0. If a copy of the MPL was not distributed with this file, You can
|
||||||
|
# obtain one at https://mozilla.org/MPL/2.0/. -}
|
||||||
|
# frozen_string_literal: true
|
||||||
|
|
||||||
|
CROSS_GCC = 'build/rootfs/bin/riscv32-unknown-linux-gnu-gcc'
|
||||||
|
SYSROOT = 'build/sysroot'
|
||||||
|
QEMU = 'qemu-riscv32'
|
||||||
|
|
||||||
|
def assemble_stage(output, compiler, source)
|
||||||
|
arguments = [QEMU, '-L', SYSROOT, *compiler]
|
||||||
|
|
||||||
|
puts Term::ANSIColor.green(arguments * ' ')
|
||||||
|
puts
|
||||||
|
Open3.popen2(*arguments) do |qemu_in, qemu_out|
|
||||||
|
qemu_in.write File.read(*source)
|
||||||
|
qemu_in.close
|
||||||
|
|
||||||
|
IO.copy_stream qemu_out, output
|
||||||
|
qemu_out.close
|
||||||
|
end
|
||||||
|
end
|
||||||
|
|
||||||
|
library = []
|
||||||
|
|
||||||
|
Dir.glob('boot/*.s').each do |assembly_source|
|
||||||
|
source_basename = Pathname.new(assembly_source).basename
|
||||||
|
target_object = Pathname.new('build/boot') + source_basename.sub_ext('.o')
|
||||||
|
|
||||||
|
file target_object.to_s => [assembly_source, 'build/boot'] do |t|
|
||||||
|
sh CROSS_GCC, '-c', '-o', t.name, assembly_source
|
||||||
|
end
|
||||||
|
library << assembly_source unless source_basename.to_s.start_with? 'stage'
|
||||||
|
end
|
||||||
|
|
||||||
|
desc 'Initial stage'
|
||||||
|
file 'build/boot/stage1' => ['build/boot/stage1.o', *library] do |t|
|
||||||
|
sh CROSS_GCC, '-nostdlib', '-o', t.name, *t.prerequisites
|
||||||
|
end
|
||||||
|
|
||||||
|
file 'build/boot/stage2a.s' => ['build/boot/stage1', 'boot/stage2.elna'] do |t|
|
||||||
|
source, exe = t.prerequisites.partition { |prerequisite| prerequisite.end_with? '.elna' }
|
||||||
|
|
||||||
|
File.open t.name, 'w' do |output|
|
||||||
|
assemble_stage output, exe, source
|
||||||
|
end
|
||||||
|
end
|
||||||
|
|
||||||
|
['build/boot/stage2a', 'build/boot/stage2b'].each do |exe|
|
||||||
|
file exe => [exe.ext('.s'), *library] do |t|
|
||||||
|
sh CROSS_GCC, '-nostdlib', '-o', t.name, *t.prerequisites
|
||||||
|
end
|
||||||
|
end
|
||||||
|
|
||||||
|
file 'build/boot/stage2b.s' => ['build/boot/stage2a', 'boot/stage2.elna'] do |t|
|
||||||
|
source, exe = t.prerequisites.partition { |prerequisite| prerequisite.end_with? '.elna' }
|
||||||
|
|
||||||
|
File.open t.name, 'w' do |output|
|
||||||
|
assemble_stage output, exe, source
|
||||||
|
end
|
||||||
|
end
|
||||||
998
source.elna
998
source.elna
@ -1,998 +0,0 @@
|
|||||||
const
|
|
||||||
SEEK_SET* := 0
|
|
||||||
SEEK_CUR* := 1
|
|
||||||
SEEK_END* := 2
|
|
||||||
|
|
||||||
type
|
|
||||||
TokenKind* = (
|
|
||||||
unknown,
|
|
||||||
identifier,
|
|
||||||
_if,
|
|
||||||
_then,
|
|
||||||
_else,
|
|
||||||
_elsif,
|
|
||||||
_while,
|
|
||||||
_do,
|
|
||||||
_proc,
|
|
||||||
_begin,
|
|
||||||
_end,
|
|
||||||
_extern,
|
|
||||||
_const,
|
|
||||||
_var,
|
|
||||||
array,
|
|
||||||
_of,
|
|
||||||
_type,
|
|
||||||
_record,
|
|
||||||
_union,
|
|
||||||
pointer,
|
|
||||||
to,
|
|
||||||
boolean,
|
|
||||||
_nil,
|
|
||||||
and,
|
|
||||||
_or,
|
|
||||||
not,
|
|
||||||
_return,
|
|
||||||
_cast,
|
|
||||||
shift_left,
|
|
||||||
shift_right,
|
|
||||||
left_paren,
|
|
||||||
right_paren,
|
|
||||||
left_square,
|
|
||||||
right_square,
|
|
||||||
greater_equal,
|
|
||||||
less_equal,
|
|
||||||
greater_than,
|
|
||||||
less_than,
|
|
||||||
not_equal,
|
|
||||||
equal,
|
|
||||||
semicolon,
|
|
||||||
dot,
|
|
||||||
comma,
|
|
||||||
plus,
|
|
||||||
minus,
|
|
||||||
multiplication,
|
|
||||||
division,
|
|
||||||
remainder,
|
|
||||||
assignment,
|
|
||||||
colon,
|
|
||||||
hat,
|
|
||||||
at,
|
|
||||||
comment,
|
|
||||||
integer,
|
|
||||||
word,
|
|
||||||
character,
|
|
||||||
string,
|
|
||||||
_defer,
|
|
||||||
exclamation,
|
|
||||||
arrow
|
|
||||||
)
|
|
||||||
Position* = record
|
|
||||||
line: Word;
|
|
||||||
column: Word
|
|
||||||
end
|
|
||||||
Location* = record
|
|
||||||
first: Position;
|
|
||||||
last: Position
|
|
||||||
end
|
|
||||||
SourceFile* = record
|
|
||||||
buffer: [1024]Char;
|
|
||||||
handle: ^FILE;
|
|
||||||
size: Word;
|
|
||||||
index: Word
|
|
||||||
end
|
|
||||||
FILE* = record end
|
|
||||||
StringBuffer* = record
|
|
||||||
data: ^Byte;
|
|
||||||
size: Word;
|
|
||||||
capacity: Word
|
|
||||||
end
|
|
||||||
SourceCode = record
|
|
||||||
position: Position;
|
|
||||||
|
|
||||||
input: ^Byte;
|
|
||||||
empty: proc(^Byte) -> Bool;
|
|
||||||
advance: proc(^Byte);
|
|
||||||
head: proc(^Byte) -> Char
|
|
||||||
end
|
|
||||||
Token* = record
|
|
||||||
kind: TokenKind;
|
|
||||||
value: union
|
|
||||||
int_value: Int;
|
|
||||||
string: String;
|
|
||||||
boolean_value: Bool;
|
|
||||||
char_value: Char
|
|
||||||
end;
|
|
||||||
location: Location
|
|
||||||
end
|
|
||||||
CommandLine* = record
|
|
||||||
input: ^Char;
|
|
||||||
tokenize: Bool;
|
|
||||||
syntax_tree: Bool
|
|
||||||
end
|
|
||||||
|
|
||||||
(*
|
|
||||||
External procedures.
|
|
||||||
*)
|
|
||||||
proc fopen(pathname: ^Char, mode: ^Char) -> ^FILE; extern
|
|
||||||
proc fclose(stream: ^FILE) -> Int; extern
|
|
||||||
proc fseek(stream: ^FILE, off: Int, whence: Int) -> Int; extern
|
|
||||||
proc rewind(stream: ^FILE); extern
|
|
||||||
proc ftell(stream: ^FILE) -> Int; extern
|
|
||||||
proc fread(ptr: ^Byte, size: Word, nmemb: Word, stream: ^FILE) -> Word; extern
|
|
||||||
proc write(fd: Int, buf: ^Byte, Word: Int) -> Int; extern
|
|
||||||
|
|
||||||
proc malloc(size: Word) -> ^Byte; extern
|
|
||||||
proc free(ptr: ^Byte); extern
|
|
||||||
proc calloc(nmemb: Word, size: Word) -> ^Byte; extern
|
|
||||||
proc realloc(ptr: ^Byte, size: Word) -> ^Byte; extern
|
|
||||||
|
|
||||||
proc memset(ptr: ^Char, c: Int, n: Int) -> ^Char; extern
|
|
||||||
|
|
||||||
proc strcmp(s1: ^Char, s2: ^Char) -> Int; extern
|
|
||||||
proc strncmp(s1: ^Char, s2: ^Char, n: Word) -> Int; extern
|
|
||||||
proc strncpy(dst: ^Char, src: ^Char, dsize: Word) -> ^Char; extern
|
|
||||||
proc strcpy(dst: ^Char, src: ^Char) -> ^Char; extern
|
|
||||||
proc strlen(ptr: ^Char) -> Word; extern
|
|
||||||
|
|
||||||
proc perror(s: ^Char); extern
|
|
||||||
proc exit(code: Int) -> !; extern
|
|
||||||
|
|
||||||
(*
|
|
||||||
Standard procedures.
|
|
||||||
*)
|
|
||||||
proc reallocarray(ptr: ^Byte, n: Word, size: Word) -> ^Byte;
|
|
||||||
begin
|
|
||||||
return realloc(ptr, n * size)
|
|
||||||
end
|
|
||||||
|
|
||||||
proc write_s(value: String);
|
|
||||||
begin
|
|
||||||
write(0, cast(value.ptr: ^Byte), cast(value.length: Int))
|
|
||||||
end
|
|
||||||
|
|
||||||
proc write_z(value: ^Char);
|
|
||||||
begin
|
|
||||||
write(0, cast(value: ^Byte), cast(strlen(value): Int))
|
|
||||||
end
|
|
||||||
|
|
||||||
proc write_b(value: Bool);
|
|
||||||
begin
|
|
||||||
if value then
|
|
||||||
write_s("true")
|
|
||||||
else
|
|
||||||
write_s("false")
|
|
||||||
end
|
|
||||||
end
|
|
||||||
|
|
||||||
proc write_c(value: Char);
|
|
||||||
begin
|
|
||||||
write(0, cast(@value: ^Byte), 1)
|
|
||||||
end
|
|
||||||
|
|
||||||
proc write_i(value: Int);
|
|
||||||
var
|
|
||||||
digit: Int
|
|
||||||
n: Word
|
|
||||||
buffer: [10]Char
|
|
||||||
begin
|
|
||||||
n := 10u;
|
|
||||||
|
|
||||||
if value = 0 then
|
|
||||||
write_c('0')
|
|
||||||
end;
|
|
||||||
while value <> 0 do
|
|
||||||
digit := value % 10;
|
|
||||||
value := value / 10;
|
|
||||||
|
|
||||||
buffer[n] := cast(cast('0': Int) + digit: Char);
|
|
||||||
n := n - 1u
|
|
||||||
end;
|
|
||||||
while n < 10u do
|
|
||||||
n := n + 1u;
|
|
||||||
write_c(buffer[n])
|
|
||||||
end
|
|
||||||
end
|
|
||||||
|
|
||||||
proc write_u(value: Word);
|
|
||||||
begin
|
|
||||||
write_i(cast(value: Int))
|
|
||||||
end
|
|
||||||
|
|
||||||
proc is_digit(c: Char) -> Bool;
|
|
||||||
begin
|
|
||||||
return cast(c: Int) >= cast('0': Int) & cast(c: Int) <= cast('9': Int)
|
|
||||||
end
|
|
||||||
|
|
||||||
proc is_alpha(c: Char) -> Bool;
|
|
||||||
begin
|
|
||||||
return cast(c: Int) >= cast('A': Int) & cast(c: Int) <= cast('z': Int)
|
|
||||||
end
|
|
||||||
|
|
||||||
proc is_alnum(c: Char) -> Bool;
|
|
||||||
begin
|
|
||||||
return is_digit(c) or is_alpha(c)
|
|
||||||
end
|
|
||||||
|
|
||||||
proc is_space(c: Char) -> Bool;
|
|
||||||
begin
|
|
||||||
return c = ' ' or c = '\n' or c = '\t'
|
|
||||||
end
|
|
||||||
|
|
||||||
proc substring(string: String, start: Word, count: Word) -> String;
|
|
||||||
begin
|
|
||||||
return String(string.ptr + start, count)
|
|
||||||
end
|
|
||||||
|
|
||||||
proc open_substring(string: String, start: Word) -> String;
|
|
||||||
begin
|
|
||||||
return substring(string, start, string.length - start)
|
|
||||||
end
|
|
||||||
|
|
||||||
proc string_dup(origin: String) -> String;
|
|
||||||
var
|
|
||||||
copy: ^Char
|
|
||||||
begin
|
|
||||||
copy := cast(malloc(origin.length): ^Char);
|
|
||||||
strncpy(copy, origin.ptr, origin.length);
|
|
||||||
|
|
||||||
return String(copy, origin.length)
|
|
||||||
end
|
|
||||||
|
|
||||||
proc string_buffer_new() -> StringBuffer;
|
|
||||||
var
|
|
||||||
result: StringBuffer
|
|
||||||
begin
|
|
||||||
result.capacity := 64u;
|
|
||||||
result.data := malloc(result.capacity);
|
|
||||||
result.size := 0u;
|
|
||||||
|
|
||||||
return result
|
|
||||||
end
|
|
||||||
|
|
||||||
proc string_buffer_push(buffer: ^StringBuffer, char: Char);
|
|
||||||
begin
|
|
||||||
if buffer^.size >= buffer^.capacity then
|
|
||||||
buffer^.capacity := buffer^.capacity + 1024u;
|
|
||||||
buffer^.data := realloc(buffer^.data, buffer^.capacity)
|
|
||||||
end;
|
|
||||||
(buffer^.data + buffer^.size)^ := cast(char: Byte);
|
|
||||||
buffer^.size := buffer^.size + 1u
|
|
||||||
end
|
|
||||||
|
|
||||||
proc string_buffer_pop(buffer: ^StringBuffer, count: Word);
|
|
||||||
begin
|
|
||||||
buffer^.size := buffer^.size - count
|
|
||||||
end
|
|
||||||
|
|
||||||
proc string_buffer_clear(buffer: ^StringBuffer) -> String;
|
|
||||||
var
|
|
||||||
result: String
|
|
||||||
begin
|
|
||||||
result := String(cast(buffer^.data: ^Char), buffer^.size);
|
|
||||||
buffer^.size := 0u;
|
|
||||||
return result
|
|
||||||
end
|
|
||||||
|
|
||||||
(*
|
|
||||||
End of standard procedures.
|
|
||||||
*)
|
|
||||||
|
|
||||||
proc make_position() -> Position;
|
|
||||||
begin
|
|
||||||
return Position(1u, 1u)
|
|
||||||
end
|
|
||||||
|
|
||||||
proc read_source(filename: ^Char) -> ^SourceFile;
|
|
||||||
var
|
|
||||||
result: ^SourceFile
|
|
||||||
file_handle: ^FILE
|
|
||||||
begin
|
|
||||||
file_handle := fopen(filename, "rb\0".ptr);
|
|
||||||
|
|
||||||
if file_handle <> nil then
|
|
||||||
result := cast(malloc(#size(SourceFile)): ^SourceFile);
|
|
||||||
result^.handle := file_handle;
|
|
||||||
result^.size := 0u;
|
|
||||||
result^.index := 1u
|
|
||||||
end;
|
|
||||||
return result
|
|
||||||
end
|
|
||||||
|
|
||||||
proc escape_char(escape: Char, result: ^Char) -> Bool;
|
|
||||||
var
|
|
||||||
successful: Bool
|
|
||||||
begin
|
|
||||||
if escape = 'n' then
|
|
||||||
result^ := '\n';
|
|
||||||
successful := true;
|
|
||||||
elsif escape = 'a' then
|
|
||||||
result^ := '\a';
|
|
||||||
successful := true
|
|
||||||
elsif escape = 'b' then
|
|
||||||
result^ := '\b';
|
|
||||||
successful := true
|
|
||||||
elsif escape = 't' then
|
|
||||||
result^ := '\t';
|
|
||||||
successful := true
|
|
||||||
elsif escape = 'f' then
|
|
||||||
result^ := '\f';
|
|
||||||
successful := true
|
|
||||||
elsif escape = 'r' then
|
|
||||||
result^ := '\r';
|
|
||||||
successful := true
|
|
||||||
elsif escape = 'v' then
|
|
||||||
result^ := '\v';
|
|
||||||
successful := true
|
|
||||||
elsif escape = '\\' then
|
|
||||||
result^ := '\\';
|
|
||||||
successful := true
|
|
||||||
elsif escape = '\'' then
|
|
||||||
result^ := '\'';
|
|
||||||
successful := true
|
|
||||||
elsif escape = '"' then
|
|
||||||
result^ := '"';
|
|
||||||
successful := true
|
|
||||||
elsif escape = '?' then
|
|
||||||
result^ := '\?';
|
|
||||||
successful := true
|
|
||||||
elsif escape = '0' then
|
|
||||||
result^ := '\0';
|
|
||||||
successful := true
|
|
||||||
else
|
|
||||||
successful := false
|
|
||||||
end;
|
|
||||||
return successful
|
|
||||||
end
|
|
||||||
|
|
||||||
proc source_file_empty(source_input: ^Byte) -> Bool;
|
|
||||||
var
|
|
||||||
source_file: ^SourceFile
|
|
||||||
begin
|
|
||||||
source_file := cast(source_input: ^SourceFile);
|
|
||||||
|
|
||||||
if source_file^.index > source_file^.size then
|
|
||||||
source_file^.size := fread(cast(@source_file^.buffer: ^Byte), 1u, 1024u, source_file^.handle);
|
|
||||||
source_file^.index := 1u
|
|
||||||
end;
|
|
||||||
|
|
||||||
return source_file^.size = 0u
|
|
||||||
end
|
|
||||||
|
|
||||||
proc source_file_head(source_input: ^Byte) -> Char;
|
|
||||||
var
|
|
||||||
source_file: ^SourceFile
|
|
||||||
begin
|
|
||||||
source_file := cast(source_input: ^SourceFile);
|
|
||||||
|
|
||||||
return source_file^.buffer[source_file^.index]
|
|
||||||
end
|
|
||||||
|
|
||||||
proc source_file_advance(source_input: ^Byte);
|
|
||||||
var
|
|
||||||
source_file: ^SourceFile
|
|
||||||
begin
|
|
||||||
source_file := cast(source_input: ^SourceFile);
|
|
||||||
|
|
||||||
source_file^.index := source_file^.index + 1u
|
|
||||||
end
|
|
||||||
|
|
||||||
proc source_code_empty(source_code: ^SourceCode) -> Bool;
|
|
||||||
begin
|
|
||||||
return source_code^.empty(source_code^.input)
|
|
||||||
end
|
|
||||||
|
|
||||||
proc source_code_head(source_code: SourceCode) -> Char;
|
|
||||||
begin
|
|
||||||
return source_code.head(source_code.input)
|
|
||||||
end
|
|
||||||
|
|
||||||
proc source_code_advance(source_code: ^SourceCode);
|
|
||||||
begin
|
|
||||||
source_code^.advance(source_code^.input);
|
|
||||||
source_code^.position.column := source_code^.position.column
|
|
||||||
end
|
|
||||||
|
|
||||||
proc source_code_break(source_code: ^SourceCode);
|
|
||||||
begin
|
|
||||||
source_code^.position.line := source_code^.position.line + 1u;
|
|
||||||
source_code^.position.column := 0u
|
|
||||||
end
|
|
||||||
|
|
||||||
proc source_code_expect(source_code: ^SourceCode, expected: Char) -> Bool;
|
|
||||||
begin
|
|
||||||
return ~source_code_empty(source_code) & source_code_head(source_code^) = expected
|
|
||||||
end
|
|
||||||
|
|
||||||
proc skip_spaces(source_code: ^SourceCode);
|
|
||||||
var
|
|
||||||
current: Char
|
|
||||||
begin
|
|
||||||
while ~source_code_empty(source_code), loop do
|
|
||||||
current := source_code_head(source_code^);
|
|
||||||
|
|
||||||
if ~is_space(current) then
|
|
||||||
break loop
|
|
||||||
elsif current = '\n' then
|
|
||||||
source_code_break(source_code)
|
|
||||||
end;
|
|
||||||
source_code_advance(source_code)
|
|
||||||
end
|
|
||||||
end
|
|
||||||
|
|
||||||
proc is_ident(char: Char) -> Bool;
|
|
||||||
begin
|
|
||||||
return is_alnum(char) or char = '_'
|
|
||||||
end
|
|
||||||
|
|
||||||
proc lex_identifier(source_code: ^SourceCode, token_content: ^StringBuffer);
|
|
||||||
var
|
|
||||||
content_length: Word
|
|
||||||
begin
|
|
||||||
while ~source_code_empty(source_code) & is_ident(source_code_head(source_code^)) do
|
|
||||||
string_buffer_push(token_content, source_code_head(source_code^));
|
|
||||||
source_code_advance(source_code)
|
|
||||||
end
|
|
||||||
end
|
|
||||||
|
|
||||||
proc lex_comment(source_code: ^SourceCode, token_content: ^StringBuffer) -> Bool;
|
|
||||||
var
|
|
||||||
trailing: Word
|
|
||||||
begin
|
|
||||||
trailing := 0u;
|
|
||||||
|
|
||||||
while ~source_code_empty(source_code) & trailing < 2u do
|
|
||||||
if source_code_head(source_code^) = '*' then
|
|
||||||
string_buffer_push(token_content, '*');
|
|
||||||
trailing := 1u
|
|
||||||
elsif source_code_head(source_code^) = ')' & trailing = 1u then
|
|
||||||
string_buffer_pop(token_content, 1u);
|
|
||||||
trailing := 2u
|
|
||||||
else
|
|
||||||
string_buffer_push(token_content, source_code_head(source_code^));
|
|
||||||
trailing := 0u
|
|
||||||
end;
|
|
||||||
source_code_advance(source_code)
|
|
||||||
end;
|
|
||||||
|
|
||||||
return trailing = 2u
|
|
||||||
end
|
|
||||||
|
|
||||||
proc lex_character(source_code: ^SourceCode, token_content: ^Char) -> Bool;
|
|
||||||
var
|
|
||||||
successful: Bool
|
|
||||||
begin
|
|
||||||
successful := ~source_code_empty(source_code);
|
|
||||||
|
|
||||||
if successful then
|
|
||||||
if source_code_head(source_code^) = '\\' then
|
|
||||||
source_code_advance(source_code);
|
|
||||||
|
|
||||||
successful := ~source_code_empty(source_code) & escape_char(source_code_head(source_code^), token_content)
|
|
||||||
else
|
|
||||||
token_content^ := source_code_head(source_code^);
|
|
||||||
successful := true
|
|
||||||
end
|
|
||||||
end;
|
|
||||||
if successful then
|
|
||||||
source_code_advance(source_code)
|
|
||||||
end;
|
|
||||||
return successful
|
|
||||||
end
|
|
||||||
|
|
||||||
proc lex_string(source_code: ^SourceCode, token_content: ^StringBuffer) -> Bool;
|
|
||||||
var
|
|
||||||
token_end, constructed_string: ^Char
|
|
||||||
token_length: Word
|
|
||||||
is_valid: Bool
|
|
||||||
next_char: Char
|
|
||||||
begin
|
|
||||||
is_valid := true;
|
|
||||||
|
|
||||||
while is_valid & ~source_code_empty(source_code) & source_code_head(source_code^) <> '"' do
|
|
||||||
is_valid := lex_character(source_code, @next_char);
|
|
||||||
|
|
||||||
if is_valid then
|
|
||||||
string_buffer_push(token_content, next_char)
|
|
||||||
end
|
|
||||||
end;
|
|
||||||
|
|
||||||
if is_valid & source_code_expect(source_code, '"') then
|
|
||||||
source_code_advance(source_code)
|
|
||||||
else
|
|
||||||
is_valid := false
|
|
||||||
end;
|
|
||||||
return is_valid
|
|
||||||
end
|
|
||||||
|
|
||||||
proc lex_number(source_code: ^SourceCode, token_content: ^Int);
|
|
||||||
begin
|
|
||||||
token_content^ := 0;
|
|
||||||
|
|
||||||
while ~source_code_empty(source_code) & is_digit(source_code_head(source_code^)) do
|
|
||||||
token_content^ := token_content^ * 10 + (cast(source_code_head(source_code^): Int) - cast('0': Int));
|
|
||||||
|
|
||||||
source_code_advance(source_code)
|
|
||||||
end
|
|
||||||
end
|
|
||||||
|
|
||||||
proc print_tokens(tokens: ^Token, tokens_size: Word);
|
|
||||||
var
|
|
||||||
current_token: ^Token
|
|
||||||
i: Word
|
|
||||||
begin
|
|
||||||
i := 0u;
|
|
||||||
while i < tokens_size do
|
|
||||||
current_token := tokens + i;
|
|
||||||
|
|
||||||
case current_token^.kind of
|
|
||||||
TokenKind._if:
|
|
||||||
write_s("IF")
|
|
||||||
| TokenKind._then:
|
|
||||||
write_s("THEN")
|
|
||||||
| TokenKind._else:
|
|
||||||
write_s("ELSE")
|
|
||||||
| TokenKind._elsif:
|
|
||||||
write_s("ELSIF")
|
|
||||||
| TokenKind._while:
|
|
||||||
write_s("WHILE")
|
|
||||||
| TokenKind._do:
|
|
||||||
write_s("DO")
|
|
||||||
| TokenKind._proc:
|
|
||||||
write_s("PROC")
|
|
||||||
| TokenKind._begin:
|
|
||||||
write_s("BEGIN")
|
|
||||||
| TokenKind._end:
|
|
||||||
write_s("END")
|
|
||||||
| TokenKind._extern:
|
|
||||||
write_s("EXTERN")
|
|
||||||
| TokenKind._const:
|
|
||||||
write_s("CONST")
|
|
||||||
| TokenKind._var:
|
|
||||||
write_s("VAR")
|
|
||||||
| TokenKind.array:
|
|
||||||
write_s("ARRAY")
|
|
||||||
| TokenKind._of:
|
|
||||||
write_s("OF")
|
|
||||||
| TokenKind._type:
|
|
||||||
write_s("TYPE")
|
|
||||||
| TokenKind._record:
|
|
||||||
write_s("RECORD")
|
|
||||||
| TokenKind._union:
|
|
||||||
write_s("UNION")
|
|
||||||
| TokenKind.pointer:
|
|
||||||
write_s("POINTER")
|
|
||||||
| TokenKind.to:
|
|
||||||
write_s("TO")
|
|
||||||
| TokenKind.boolean:
|
|
||||||
write_s("BOOLEAN<");
|
|
||||||
write_b(current_token^.value.boolean_value);
|
|
||||||
write_c('>')
|
|
||||||
| TokenKind._nil:
|
|
||||||
write_s("NIL")
|
|
||||||
| TokenKind.and:
|
|
||||||
write_s("AND")
|
|
||||||
| TokenKind._or:
|
|
||||||
write_s("OR")
|
|
||||||
| TokenKind.not:
|
|
||||||
write_s("NOT")
|
|
||||||
| TokenKind._return:
|
|
||||||
write_s("RETURN")
|
|
||||||
| TokenKind._cast:
|
|
||||||
write_s("CAST")
|
|
||||||
| TokenKind.shift_left:
|
|
||||||
write_s("<<")
|
|
||||||
| TokenKind.shift_right:
|
|
||||||
write_s(">>")
|
|
||||||
| TokenKind.identifier:
|
|
||||||
write_c('<');
|
|
||||||
write_s(current_token^.value.string);
|
|
||||||
write_c('>')
|
|
||||||
| TokenKind.left_paren:
|
|
||||||
write_s("(")
|
|
||||||
| TokenKind.right_paren:
|
|
||||||
write_s(")")
|
|
||||||
| TokenKind.left_square:
|
|
||||||
write_s("[")
|
|
||||||
| TokenKind.right_square:
|
|
||||||
write_s("]")
|
|
||||||
| TokenKind.greater_equal:
|
|
||||||
write_s(">=")
|
|
||||||
| TokenKind.less_equal:
|
|
||||||
write_s("<=")
|
|
||||||
| TokenKind.greater_than:
|
|
||||||
write_s(">")
|
|
||||||
| TokenKind.less_than:
|
|
||||||
write_s("<")
|
|
||||||
| TokenKind.equal:
|
|
||||||
write_s("=")
|
|
||||||
| TokenKind.not_equal:
|
|
||||||
write_s("<>")
|
|
||||||
| TokenKind.semicolon:
|
|
||||||
write_c(';')
|
|
||||||
| TokenKind.dot:
|
|
||||||
write_c('.')
|
|
||||||
| TokenKind.comma:
|
|
||||||
write_c(',')
|
|
||||||
| TokenKind.plus:
|
|
||||||
write_c('+')
|
|
||||||
| TokenKind.minus:
|
|
||||||
write_c('-')
|
|
||||||
| TokenKind.multiplication:
|
|
||||||
write_c('*')
|
|
||||||
| TokenKind.division:
|
|
||||||
write_c('/')
|
|
||||||
| TokenKind.remainder:
|
|
||||||
write_c('%')
|
|
||||||
| TokenKind.assignment:
|
|
||||||
write_s(":=")
|
|
||||||
| TokenKind.colon:
|
|
||||||
write_c(':')
|
|
||||||
| TokenKind.hat:
|
|
||||||
write_c('^')
|
|
||||||
| TokenKind.at:
|
|
||||||
write_c('@')
|
|
||||||
| TokenKind.comment:
|
|
||||||
write_s("(* COMMENT *)")
|
|
||||||
| TokenKind.integer:
|
|
||||||
write_c('<');
|
|
||||||
write_i(current_token^.value.int_value);
|
|
||||||
write_c('>')
|
|
||||||
| TokenKind.word:
|
|
||||||
write_c('<');
|
|
||||||
write_i(current_token^.value.int_value);
|
|
||||||
write_s("u>")
|
|
||||||
| TokenKind.character:
|
|
||||||
write_c('<');
|
|
||||||
write_i(cast(current_token^.value.char_value: Int));
|
|
||||||
write_s("c>")
|
|
||||||
| TokenKind.string:
|
|
||||||
write_s("\"...\"")
|
|
||||||
| TokenKind._defer:
|
|
||||||
write_s("DEFER")
|
|
||||||
| TokenKind.exclamation:
|
|
||||||
write_c('!')
|
|
||||||
| TokenKind.arrow:
|
|
||||||
write_s("->")
|
|
||||||
else
|
|
||||||
write_s("UNKNOWN<");
|
|
||||||
write_i(cast(current_token^.kind: Int));
|
|
||||||
write_c('>')
|
|
||||||
end;
|
|
||||||
write_c(' ');
|
|
||||||
|
|
||||||
i := i + 1u;
|
|
||||||
end;
|
|
||||||
write_c('\n')
|
|
||||||
end
|
|
||||||
|
|
||||||
proc categorize_identifier(token_content: String) -> Token;
|
|
||||||
var
|
|
||||||
current_token: Token
|
|
||||||
begin
|
|
||||||
if "if" = token_content then
|
|
||||||
current_token.kind := TokenKind._if
|
|
||||||
elsif "then" = token_content then
|
|
||||||
current_token.kind := TokenKind._then
|
|
||||||
elsif "else" = token_content then
|
|
||||||
current_token.kind := TokenKind._else
|
|
||||||
elsif "elsif" = token_content then
|
|
||||||
current_token.kind := TokenKind._elsif
|
|
||||||
elsif "while" = token_content then
|
|
||||||
current_token.kind := TokenKind._while
|
|
||||||
elsif "do" = token_content then
|
|
||||||
current_token.kind := TokenKind._do
|
|
||||||
elsif "proc" = token_content then
|
|
||||||
current_token.kind := TokenKind._proc
|
|
||||||
elsif "begin" = token_content then
|
|
||||||
current_token.kind := TokenKind._begin
|
|
||||||
elsif "end" = token_content then
|
|
||||||
current_token.kind := TokenKind._end
|
|
||||||
elsif "extern" = token_content then
|
|
||||||
current_token.kind := TokenKind._extern
|
|
||||||
elsif "const" = token_content then
|
|
||||||
current_token.kind := TokenKind._const
|
|
||||||
elsif "var" = token_content then
|
|
||||||
current_token.kind := TokenKind._var
|
|
||||||
elsif "array" = token_content then
|
|
||||||
current_token.kind := TokenKind.array
|
|
||||||
elsif "of" = token_content then
|
|
||||||
current_token.kind := TokenKind._of
|
|
||||||
elsif "type" = token_content then
|
|
||||||
current_token.kind := TokenKind._type
|
|
||||||
elsif "record" = token_content then
|
|
||||||
current_token.kind := TokenKind._record
|
|
||||||
elsif "union" = token_content then
|
|
||||||
current_token.kind := TokenKind._union
|
|
||||||
elsif "pointer" = token_content then
|
|
||||||
current_token.kind := TokenKind.pointer
|
|
||||||
elsif "to" = token_content then
|
|
||||||
current_token.kind := TokenKind.to
|
|
||||||
elsif "true" = token_content then
|
|
||||||
current_token.kind := TokenKind.boolean;
|
|
||||||
current_token.value.boolean_value := true
|
|
||||||
elsif "false" = token_content then
|
|
||||||
current_token.kind := TokenKind.boolean;
|
|
||||||
current_token.value.boolean_value := false
|
|
||||||
elsif "nil" = token_content then
|
|
||||||
current_token.kind := TokenKind._nil
|
|
||||||
elsif "and" = token_content then
|
|
||||||
current_token.kind := TokenKind.and
|
|
||||||
elsif "or" = token_content then
|
|
||||||
current_token.kind := TokenKind._or
|
|
||||||
elsif "not" = token_content then
|
|
||||||
current_token.kind := TokenKind.not
|
|
||||||
elsif "return" = token_content then
|
|
||||||
current_token.kind := TokenKind._return
|
|
||||||
elsif "cast" = token_content then
|
|
||||||
current_token.kind := TokenKind._cast
|
|
||||||
elsif "defer" = token_content then
|
|
||||||
current_token.kind := TokenKind._defer
|
|
||||||
else
|
|
||||||
current_token.kind := TokenKind.identifier;
|
|
||||||
current_token.value.string := string_dup(token_content)
|
|
||||||
end;
|
|
||||||
|
|
||||||
return current_token
|
|
||||||
end
|
|
||||||
|
|
||||||
proc tokenize(source_code: SourceCode, tokens_size: ^Word) -> ^Token;
|
|
||||||
var
|
|
||||||
tokens, current_token: ^Token
|
|
||||||
first_char: Char
|
|
||||||
token_buffer: StringBuffer
|
|
||||||
begin
|
|
||||||
tokens_size^ := 0u;
|
|
||||||
tokens := nil;
|
|
||||||
token_buffer := string_buffer_new();
|
|
||||||
|
|
||||||
skip_spaces(@source_code);
|
|
||||||
|
|
||||||
while ~source_code_empty(@source_code) do
|
|
||||||
tokens := cast(reallocarray(cast(tokens: ^Byte), tokens_size^ + 1u, #size(Token)): ^Token);
|
|
||||||
current_token := tokens + tokens_size^;
|
|
||||||
first_char := source_code_head(source_code);
|
|
||||||
|
|
||||||
if is_alpha(first_char) or first_char = '_' then
|
|
||||||
lex_identifier(@source_code, @token_buffer);
|
|
||||||
current_token^ := categorize_identifier(string_buffer_clear(@token_buffer))
|
|
||||||
elsif is_digit(first_char) then
|
|
||||||
lex_number(@source_code, @current_token^.value.int_value);
|
|
||||||
|
|
||||||
if source_code_expect(@source_code, 'u') then
|
|
||||||
current_token^.kind := TokenKind.word;
|
|
||||||
source_code_advance(@source_code)
|
|
||||||
else
|
|
||||||
current_token^.kind := TokenKind.integer
|
|
||||||
end
|
|
||||||
elsif first_char = '(' then
|
|
||||||
source_code_advance(@source_code);
|
|
||||||
|
|
||||||
if source_code_empty(@source_code) then
|
|
||||||
current_token^.kind := TokenKind.left_paren
|
|
||||||
elsif source_code_head(source_code) = '*' then
|
|
||||||
source_code_advance(@source_code);
|
|
||||||
|
|
||||||
if lex_comment(@source_code, @token_buffer) then
|
|
||||||
current_token^.value.string := string_dup(string_buffer_clear(@token_buffer));
|
|
||||||
current_token^.kind := TokenKind.comment
|
|
||||||
else
|
|
||||||
current_token^.kind := TokenKind.unknown
|
|
||||||
end
|
|
||||||
else
|
|
||||||
current_token^.kind := TokenKind.left_paren
|
|
||||||
end
|
|
||||||
elsif first_char = ')' then
|
|
||||||
current_token^.kind := TokenKind.right_paren;
|
|
||||||
source_code_advance(@source_code)
|
|
||||||
elsif first_char = '\'' then
|
|
||||||
source_code_advance(@source_code);
|
|
||||||
|
|
||||||
if lex_character(@source_code, @current_token^.value.char_value) & source_code_expect(@source_code, '\'') then
|
|
||||||
current_token^.kind := TokenKind.character;
|
|
||||||
source_code_advance(@source_code)
|
|
||||||
else
|
|
||||||
current_token^.kind := TokenKind.unknown
|
|
||||||
end
|
|
||||||
elsif first_char = '"' then
|
|
||||||
source_code_advance(@source_code);
|
|
||||||
|
|
||||||
if lex_string(@source_code, @token_buffer) then
|
|
||||||
current_token^.kind := TokenKind.string;
|
|
||||||
current_token^.value.string := string_dup(string_buffer_clear(@token_buffer))
|
|
||||||
else
|
|
||||||
current_token^.kind := TokenKind.unknown
|
|
||||||
end
|
|
||||||
elsif first_char = '[' then
|
|
||||||
current_token^.kind := TokenKind.left_square;
|
|
||||||
source_code_advance(@source_code)
|
|
||||||
elsif first_char = ']' then
|
|
||||||
current_token^.kind := TokenKind.right_square;
|
|
||||||
source_code_advance(@source_code)
|
|
||||||
elsif first_char = '>' then
|
|
||||||
source_code_advance(@source_code);
|
|
||||||
|
|
||||||
if source_code_empty(@source_code) then
|
|
||||||
current_token^.kind := TokenKind.greater_than
|
|
||||||
elsif source_code_head(source_code) = '=' then
|
|
||||||
current_token^.kind := TokenKind.greater_equal;
|
|
||||||
source_code_advance(@source_code)
|
|
||||||
elsif source_code_head(source_code) = '>' then
|
|
||||||
current_token^.kind := TokenKind.shift_right;
|
|
||||||
source_code_advance(@source_code)
|
|
||||||
else
|
|
||||||
current_token^.kind := TokenKind.greater_than
|
|
||||||
end
|
|
||||||
elsif first_char = '<' then
|
|
||||||
source_code_advance(@source_code);
|
|
||||||
|
|
||||||
if source_code_empty(@source_code) then
|
|
||||||
current_token^.kind := TokenKind.less_than
|
|
||||||
elsif source_code_head(source_code) = '=' then
|
|
||||||
current_token^.kind := TokenKind.less_equal;
|
|
||||||
source_code_advance(@source_code)
|
|
||||||
elsif source_code_head(source_code) = '<' then
|
|
||||||
current_token^.kind := TokenKind.shift_left;
|
|
||||||
source_code_advance(@source_code)
|
|
||||||
elsif source_code_head(source_code) = '>' then
|
|
||||||
current_token^.kind := TokenKind.not_equal;
|
|
||||||
source_code_advance(@source_code)
|
|
||||||
else
|
|
||||||
current_token^.kind := TokenKind.less_than
|
|
||||||
end
|
|
||||||
elsif first_char = '=' then
|
|
||||||
current_token^.kind := TokenKind.equal;
|
|
||||||
source_code_advance(@source_code)
|
|
||||||
elsif first_char = ';' then
|
|
||||||
current_token^.kind := TokenKind.semicolon;
|
|
||||||
source_code_advance(@source_code)
|
|
||||||
elsif first_char = '.' then
|
|
||||||
current_token^.kind := TokenKind.dot;
|
|
||||||
source_code_advance(@source_code)
|
|
||||||
elsif first_char = ',' then
|
|
||||||
current_token^.kind := TokenKind.comma;
|
|
||||||
source_code_advance(@source_code)
|
|
||||||
elsif first_char = '+' then
|
|
||||||
current_token^.kind := TokenKind.plus;
|
|
||||||
source_code_advance(@source_code)
|
|
||||||
elsif first_char = '-' then
|
|
||||||
source_code_advance(@source_code);
|
|
||||||
|
|
||||||
if source_code_empty(@source_code) then
|
|
||||||
current_token^.kind := TokenKind.minus
|
|
||||||
elsif source_code_head(source_code) = '>' then
|
|
||||||
current_token^.kind := TokenKind.arrow;
|
|
||||||
source_code_advance(@source_code)
|
|
||||||
else
|
|
||||||
current_token^.kind := TokenKind.minus
|
|
||||||
end
|
|
||||||
elsif first_char = '*' then
|
|
||||||
current_token^.kind := TokenKind.multiplication;
|
|
||||||
source_code_advance(@source_code)
|
|
||||||
elsif first_char = '/' then
|
|
||||||
current_token^.kind := TokenKind.division;
|
|
||||||
source_code_advance(@source_code)
|
|
||||||
elsif first_char = '%' then
|
|
||||||
current_token^.kind := TokenKind.remainder;
|
|
||||||
source_code_advance(@source_code)
|
|
||||||
elsif first_char = ':' then
|
|
||||||
source_code_advance(@source_code);
|
|
||||||
|
|
||||||
if source_code_empty(@source_code) then
|
|
||||||
current_token^.kind := TokenKind.colon
|
|
||||||
elsif source_code_head(source_code) = '=' then
|
|
||||||
current_token^.kind := TokenKind.assignment;
|
|
||||||
source_code_advance(@source_code)
|
|
||||||
else
|
|
||||||
current_token^.kind := TokenKind.colon
|
|
||||||
end
|
|
||||||
elsif first_char = '^' then
|
|
||||||
current_token^.kind := TokenKind.hat;
|
|
||||||
source_code_advance(@source_code)
|
|
||||||
elsif first_char = '@' then
|
|
||||||
current_token^.kind := TokenKind.at;
|
|
||||||
source_code_advance(@source_code)
|
|
||||||
elsif first_char = '!' then
|
|
||||||
current_token^.kind := TokenKind.exclamation;
|
|
||||||
source_code_advance(@source_code)
|
|
||||||
else
|
|
||||||
current_token^.kind := TokenKind.unknown;
|
|
||||||
source_code_advance(@source_code)
|
|
||||||
end;
|
|
||||||
|
|
||||||
if current_token^.kind <> TokenKind.unknown then
|
|
||||||
tokens_size^ := tokens_size^ + 1u;
|
|
||||||
skip_spaces(@source_code)
|
|
||||||
else
|
|
||||||
write_s("Lexical analysis error on \"");
|
|
||||||
write_c(first_char);
|
|
||||||
write_s("\".\n")
|
|
||||||
end
|
|
||||||
end;
|
|
||||||
|
|
||||||
return tokens
|
|
||||||
end
|
|
||||||
|
|
||||||
proc parse_command_line*(argc: Int, argv: ^^Char) -> ^CommandLine;
|
|
||||||
var
|
|
||||||
parameter: ^^Char
|
|
||||||
i: Int
|
|
||||||
result: ^CommandLine
|
|
||||||
begin
|
|
||||||
i := 1;
|
|
||||||
result := cast(malloc(#size(CommandLine)): ^CommandLine);
|
|
||||||
result^.tokenize := false;
|
|
||||||
result^.syntax_tree := false;
|
|
||||||
result^.input := nil;
|
|
||||||
|
|
||||||
while i < argc do
|
|
||||||
parameter := argv + i;
|
|
||||||
|
|
||||||
if strcmp(parameter^, "--tokenize\0".ptr) = 0 then
|
|
||||||
result^.tokenize := true
|
|
||||||
elsif strcmp(parameter^, "--syntax-tree\0".ptr) = 0 then
|
|
||||||
result^.syntax_tree := true
|
|
||||||
elsif parameter^^ <> '-' then
|
|
||||||
result^.input := parameter^
|
|
||||||
else
|
|
||||||
write_s("Fatal error: Unknown command line options:");
|
|
||||||
|
|
||||||
write_c(' ');
|
|
||||||
write_z(parameter^);
|
|
||||||
write_s(".\n");
|
|
||||||
|
|
||||||
return nil
|
|
||||||
end;
|
|
||||||
|
|
||||||
i := i + 1
|
|
||||||
end;
|
|
||||||
if result^.input = nil then
|
|
||||||
write_s("Fatal error: no input files.\n");
|
|
||||||
return nil
|
|
||||||
end;
|
|
||||||
|
|
||||||
return result
|
|
||||||
end
|
|
||||||
|
|
||||||
proc process(argc: Int, argv: ^^Char) -> Int;
|
|
||||||
var
|
|
||||||
tokens: ^Token
|
|
||||||
tokens_size: Word
|
|
||||||
source_code: SourceCode
|
|
||||||
command_line: ^CommandLine
|
|
||||||
return_code: Int
|
|
||||||
begin
|
|
||||||
return_code := 0;
|
|
||||||
|
|
||||||
command_line := parse_command_line(argc, argv);
|
|
||||||
if command_line = nil then
|
|
||||||
return_code := 2
|
|
||||||
end;
|
|
||||||
|
|
||||||
if return_code = 0 then
|
|
||||||
source_code.position := make_position();
|
|
||||||
|
|
||||||
source_code.input := cast(read_source(command_line^.input): ^Byte);
|
|
||||||
source_code.empty := source_file_empty;
|
|
||||||
source_code.head := source_file_head;
|
|
||||||
source_code.advance := source_file_advance;
|
|
||||||
|
|
||||||
if source_code.input = nil then
|
|
||||||
perror(command_line^.input);
|
|
||||||
return_code := 3
|
|
||||||
end
|
|
||||||
end;
|
|
||||||
if return_code = 0 then
|
|
||||||
tokens := tokenize(source_code, @tokens_size);
|
|
||||||
|
|
||||||
fclose(cast(source_code.input: ^SourceFile)^.handle);
|
|
||||||
|
|
||||||
if command_line^.tokenize then
|
|
||||||
print_tokens(tokens, tokens_size)
|
|
||||||
end
|
|
||||||
end;
|
|
||||||
return return_code
|
|
||||||
end
|
|
||||||
|
|
||||||
begin
|
|
||||||
exit(process(count, parameters))
|
|
||||||
end.
|
|
||||||
204
tools/init.c
204
tools/init.c
@ -1,204 +0,0 @@
|
|||||||
#include <stdio.h>
|
|
||||||
#include <dirent.h>
|
|
||||||
#include <fcntl.h>
|
|
||||||
#include <unistd.h>
|
|
||||||
#include <sys/stat.h>
|
|
||||||
#include <sys/wait.h>
|
|
||||||
#include <sys/reboot.h>
|
|
||||||
|
|
||||||
#define FILENAME_BUFFER_SIZE 256
|
|
||||||
|
|
||||||
size_t read_command(int descriptor, char *command_buffer)
|
|
||||||
{
|
|
||||||
ssize_t bytes_read = 0;
|
|
||||||
size_t read_so_far = 0;
|
|
||||||
|
|
||||||
while ((bytes_read = read(descriptor, command_buffer + read_so_far, FILENAME_BUFFER_SIZE - read_so_far - 1)) > 0)
|
|
||||||
{
|
|
||||||
read_so_far += bytes_read;
|
|
||||||
if (read_so_far >= FILENAME_BUFFER_SIZE - 1)
|
|
||||||
{
|
|
||||||
break;
|
|
||||||
}
|
|
||||||
}
|
|
||||||
command_buffer[read_so_far] = 0;
|
|
||||||
return read_so_far;
|
|
||||||
}
|
|
||||||
|
|
||||||
enum status
|
|
||||||
{
|
|
||||||
status_success,
|
|
||||||
status_failure,
|
|
||||||
status_warning,
|
|
||||||
status_fatal
|
|
||||||
};
|
|
||||||
|
|
||||||
unsigned int make_path(char *destination, const char *directory, const char *filename, const char *extension)
|
|
||||||
{
|
|
||||||
unsigned int i = 0;
|
|
||||||
|
|
||||||
for (; i < FILENAME_BUFFER_SIZE; i++)
|
|
||||||
{
|
|
||||||
if (directory[i] == 0)
|
|
||||||
{
|
|
||||||
break;
|
|
||||||
}
|
|
||||||
destination[i] = directory[i];
|
|
||||||
}
|
|
||||||
for (int j = 0; i < FILENAME_BUFFER_SIZE; i++, j++)
|
|
||||||
{
|
|
||||||
if (filename[j] == 0)
|
|
||||||
{
|
|
||||||
break;
|
|
||||||
}
|
|
||||||
destination[i] = filename[j];
|
|
||||||
}
|
|
||||||
if (extension == NULL)
|
|
||||||
{
|
|
||||||
goto done;
|
|
||||||
}
|
|
||||||
for (int j = 0; i < FILENAME_BUFFER_SIZE; i++, j++)
|
|
||||||
{
|
|
||||||
if (extension[j] == 0)
|
|
||||||
{
|
|
||||||
break;
|
|
||||||
}
|
|
||||||
destination[i] = extension[j];
|
|
||||||
}
|
|
||||||
done:
|
|
||||||
destination[i] = 0;
|
|
||||||
|
|
||||||
return i;
|
|
||||||
}
|
|
||||||
|
|
||||||
enum status run_test(const char *file_entry_name)
|
|
||||||
{
|
|
||||||
printf("Running %s. ", file_entry_name);
|
|
||||||
|
|
||||||
char filename[FILENAME_BUFFER_SIZE];
|
|
||||||
char command_buffer[FILENAME_BUFFER_SIZE];
|
|
||||||
char file_buffer[256];
|
|
||||||
int pipe_ends[2];
|
|
||||||
|
|
||||||
if (pipe(pipe_ends) == -1)
|
|
||||||
{
|
|
||||||
perror("pipe");
|
|
||||||
return status_fatal;
|
|
||||||
}
|
|
||||||
make_path(filename, "./tests/", file_entry_name, NULL);
|
|
||||||
|
|
||||||
int child_pid = fork();
|
|
||||||
if (child_pid == -1)
|
|
||||||
{
|
|
||||||
return status_fatal;
|
|
||||||
}
|
|
||||||
else if (child_pid == 0)
|
|
||||||
{
|
|
||||||
close(STDIN_FILENO);
|
|
||||||
close(STDERR_FILENO);
|
|
||||||
close(pipe_ends[0]); // Close the read end.
|
|
||||||
|
|
||||||
if (dup2(pipe_ends[1], STDOUT_FILENO) == -1)
|
|
||||||
{
|
|
||||||
perror("dup2");
|
|
||||||
}
|
|
||||||
else
|
|
||||||
{
|
|
||||||
execl(filename, filename);
|
|
||||||
perror("execl");
|
|
||||||
}
|
|
||||||
close(STDOUT_FILENO);
|
|
||||||
close(pipe_ends[1]);
|
|
||||||
_exit(1);
|
|
||||||
}
|
|
||||||
else
|
|
||||||
{
|
|
||||||
close(pipe_ends[1]); // Close the write end.
|
|
||||||
read_command(pipe_ends[0], command_buffer);
|
|
||||||
close(pipe_ends[0]);
|
|
||||||
|
|
||||||
int wait_status = 0;
|
|
||||||
|
|
||||||
make_path(filename, "./expectations/", file_entry_name, ".txt");
|
|
||||||
|
|
||||||
FILE *expectation_descriptor = fopen(filename, "r");
|
|
||||||
|
|
||||||
if (expectation_descriptor == NULL)
|
|
||||||
{
|
|
||||||
return status_warning;
|
|
||||||
}
|
|
||||||
size_t read_from_file = fread(file_buffer, 1, sizeof(file_buffer) - 1, expectation_descriptor);
|
|
||||||
fclose(expectation_descriptor);
|
|
||||||
|
|
||||||
file_buffer[read_from_file] = 0;
|
|
||||||
for (unsigned int i = 0; ; ++i)
|
|
||||||
{
|
|
||||||
if (command_buffer[i] == 0 && file_buffer[i] == 0)
|
|
||||||
{
|
|
||||||
fwrite("\n", 1, 1, stdout);
|
|
||||||
return status_success;
|
|
||||||
}
|
|
||||||
else if (command_buffer[i] != file_buffer[i])
|
|
||||||
{
|
|
||||||
printf("Failed. Got:\n%s", command_buffer);
|
|
||||||
return status_failure;
|
|
||||||
}
|
|
||||||
}
|
|
||||||
}
|
|
||||||
}
|
|
||||||
|
|
||||||
struct summary
|
|
||||||
{
|
|
||||||
size_t total;
|
|
||||||
size_t failure;
|
|
||||||
size_t success;
|
|
||||||
};
|
|
||||||
|
|
||||||
void walk()
|
|
||||||
{
|
|
||||||
DIR *directory_stream = opendir("./tests");
|
|
||||||
struct dirent *file_entry;
|
|
||||||
|
|
||||||
struct summary test_summary = { .total = 0, .failure = 0, .success = 0 };
|
|
||||||
|
|
||||||
while ((file_entry = readdir(directory_stream)) != NULL)
|
|
||||||
{
|
|
||||||
if (file_entry->d_name[0] == '.')
|
|
||||||
{
|
|
||||||
continue;
|
|
||||||
}
|
|
||||||
++test_summary.total;
|
|
||||||
switch (run_test(file_entry->d_name))
|
|
||||||
{
|
|
||||||
case status_failure:
|
|
||||||
++test_summary.failure;
|
|
||||||
break;
|
|
||||||
case status_success:
|
|
||||||
++test_summary.success;
|
|
||||||
break;
|
|
||||||
case status_warning:
|
|
||||||
break;
|
|
||||||
case status_fatal:
|
|
||||||
goto end_walk;
|
|
||||||
}
|
|
||||||
}
|
|
||||||
printf("Successful: %lu, Failed: %lu, Total: %lu.\n",
|
|
||||||
test_summary.success, test_summary.failure, test_summary.total);
|
|
||||||
end_walk:
|
|
||||||
closedir(directory_stream);
|
|
||||||
}
|
|
||||||
|
|
||||||
int main()
|
|
||||||
{
|
|
||||||
int dev_console = open("/dev/console", O_WRONLY);
|
|
||||||
if (dev_console != -1)
|
|
||||||
{
|
|
||||||
dup2(dev_console, STDOUT_FILENO);
|
|
||||||
walk();
|
|
||||||
close(dev_console);
|
|
||||||
}
|
|
||||||
sync();
|
|
||||||
reboot(RB_POWER_OFF);
|
|
||||||
|
|
||||||
return 1;
|
|
||||||
}
|
|
||||||
@ -1,89 +0,0 @@
|
|||||||
# This Source Code Form is subject to the terms of the Mozilla Public License,
|
|
||||||
# v. 2.0. If a copy of the MPL was not distributed with this file, You can
|
|
||||||
# obtain one at https://mozilla.org/MPL/2.0/. -}
|
|
||||||
|
|
||||||
require 'uri'
|
|
||||||
require 'net/http'
|
|
||||||
require 'open3'
|
|
||||||
|
|
||||||
TMP = Pathname.new('./build')
|
|
||||||
|
|
||||||
class BuildTarget
|
|
||||||
attr_accessor(:build, :gcc, :sysroot, :tmp)
|
|
||||||
|
|
||||||
def initialize
|
|
||||||
@sysroot = Pathname.new '/'
|
|
||||||
end
|
|
||||||
|
|
||||||
def gxx
|
|
||||||
@gcc.gsub 'c', '+'
|
|
||||||
end
|
|
||||||
|
|
||||||
def rootfs
|
|
||||||
tmp + 'rootfs'
|
|
||||||
end
|
|
||||||
end
|
|
||||||
|
|
||||||
def gcc_verbose(gcc_binary)
|
|
||||||
read, write = IO.pipe
|
|
||||||
sh({'LANG' => 'C'}, gcc_binary, '--verbose', err: write)
|
|
||||||
write.close
|
|
||||||
output = read.read
|
|
||||||
read.close
|
|
||||||
output
|
|
||||||
end
|
|
||||||
|
|
||||||
def find_build_target(gcc_version)
|
|
||||||
gcc_binary = 'gcc'
|
|
||||||
output = gcc_verbose gcc_binary
|
|
||||||
|
|
||||||
if output.start_with? 'Apple clang'
|
|
||||||
gcc_binary = "gcc-#{gcc_version.split('.').first}"
|
|
||||||
output = gcc_verbose gcc_binary
|
|
||||||
sdk = Pathname.new '/Library/Developer/CommandLineTools/SDKs/MacOSX15.sdk'
|
|
||||||
end
|
|
||||||
result = output
|
|
||||||
.lines
|
|
||||||
.each_with_object(BuildTarget.new) do |line, accumulator|
|
|
||||||
if line.start_with? 'Target: '
|
|
||||||
accumulator.build = line.split(' ').last.strip
|
|
||||||
elsif line.start_with? 'COLLECT_GCC'
|
|
||||||
accumulator.gcc = line.split('=').last.strip
|
|
||||||
end
|
|
||||||
end
|
|
||||||
result.tmp = TMP
|
|
||||||
result.sysroot = sdk unless sdk.nil?
|
|
||||||
result
|
|
||||||
end
|
|
||||||
|
|
||||||
def download_and_pipe(url, target, command)
|
|
||||||
target.mkpath
|
|
||||||
|
|
||||||
Net::HTTP.start(url.host, url.port, use_ssl: url.scheme == 'https') do |http|
|
|
||||||
request = Net::HTTP::Get.new url.request_uri
|
|
||||||
|
|
||||||
http.request request do |response|
|
|
||||||
case response
|
|
||||||
when Net::HTTPRedirection
|
|
||||||
download_and_pipe URI.parse(response['location']), target, command
|
|
||||||
when Net::HTTPSuccess
|
|
||||||
Dir.chdir target.to_path do
|
|
||||||
Open3.popen2(*command) do |stdin, stdout, wait_thread|
|
|
||||||
Thread.new do
|
|
||||||
stdout.each { |line| puts line }
|
|
||||||
end
|
|
||||||
|
|
||||||
response.read_body do |chunk|
|
|
||||||
stdin.write chunk
|
|
||||||
end
|
|
||||||
stdin.close
|
|
||||||
|
|
||||||
wait_thread.value
|
|
||||||
end
|
|
||||||
end
|
|
||||||
else
|
|
||||||
response.error!
|
|
||||||
end
|
|
||||||
end
|
|
||||||
end
|
|
||||||
end
|
|
||||||
Loading…
x
Reference in New Issue
Block a user