mirror of
https://github.com/BepInEx/mono.git
synced 2026-11-17 01:41:17 -10:00
Compare commits
11
Commits
| Author | SHA1 | Date | |
|---|---|---|---|
|
|
a56625169c | ||
|
|
fb09257402 | ||
|
|
2674b1c004 | ||
|
|
3daef66130 | ||
|
|
8466d0d46e | ||
|
|
dfdc643982 | ||
|
|
3ed3d53bdf | ||
|
|
7bb85568b0 | ||
|
|
94838434da | ||
|
|
400b86f5da | ||
|
|
19ab8dbb43 |
No files matched your search
@@ -1,3 +0,0 @@
|
||||
Miguel de Icaza ([email protected])
|
||||
Paolo Molaro ([email protected])
|
||||
Dietmar Maurer ([email protected])
|
||||
-485
@@ -1,485 +0,0 @@
|
||||
|
||||
The Mono runtime is licensed under the terms of the GNU
|
||||
Library General Public License, version 2.
|
||||
|
||||
GNU LIBRARY GENERAL PUBLIC LICENSE
|
||||
Version 2, June 1991
|
||||
|
||||
Copyright (C) 1991 Free Software Foundation, Inc.
|
||||
675 Mass Ave, Cambridge, MA 02139, USA
|
||||
Everyone is permitted to copy and distribute verbatim copies
|
||||
of this license document, but changing it is not allowed.
|
||||
|
||||
[This is the first released version of the library GPL. It is
|
||||
numbered 2 because it goes with version 2 of the ordinary GPL.]
|
||||
|
||||
Preamble
|
||||
|
||||
The licenses for most software are designed to take away your
|
||||
freedom to share and change it. By contrast, the GNU General Public
|
||||
Licenses are intended to guarantee your freedom to share and change
|
||||
free software--to make sure the software is free for all its users.
|
||||
|
||||
This license, the Library General Public License, applies to some
|
||||
specially designated Free Software Foundation software, and to any
|
||||
other libraries whose authors decide to use it. You can use it for
|
||||
your libraries, 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
|
||||
this service 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 make restrictions that forbid
|
||||
anyone to deny you these rights or to ask you to surrender the rights.
|
||||
These restrictions translate to certain responsibilities for you if
|
||||
you distribute copies of the library, or if you modify it.
|
||||
|
||||
For example, if you distribute copies of the library, whether gratis
|
||||
or for a fee, you must give the recipients all the rights that we gave
|
||||
you. You must make sure that they, too, receive or can get the source
|
||||
code. If you link a program with the library, you must provide
|
||||
complete object files to the recipients so that they can relink them
|
||||
with the library, after making changes to the library and recompiling
|
||||
it. And you must show them these terms so they know their rights.
|
||||
|
||||
Our method of protecting your rights has two steps: (1) copyright
|
||||
the library, and (2) offer you this license which gives you legal
|
||||
permission to copy, distribute and/or modify the library.
|
||||
|
||||
Also, for each distributor's protection, we want to make certain
|
||||
that everyone understands that there is no warranty for this free
|
||||
library. If the library is modified by someone else and passed on, we
|
||||
want its recipients to know that what they have is not the original
|
||||
version, so that any problems introduced by others will not reflect on
|
||||
the original authors' reputations.
|
||||
|
||||
Finally, any free program is threatened constantly by software
|
||||
patents. We wish to avoid the danger that companies distributing free
|
||||
software will individually obtain patent licenses, thus in effect
|
||||
transforming the program into proprietary software. To prevent this,
|
||||
we have made it clear that any patent must be licensed for everyone's
|
||||
free use or not licensed at all.
|
||||
|
||||
Most GNU software, including some libraries, is covered by the ordinary
|
||||
GNU General Public License, which was designed for utility programs. This
|
||||
license, the GNU Library General Public License, applies to certain
|
||||
designated libraries. This license is quite different from the ordinary
|
||||
one; be sure to read it in full, and don't assume that anything in it is
|
||||
the same as in the ordinary license.
|
||||
|
||||
The reason we have a separate public license for some libraries is that
|
||||
they blur the distinction we usually make between modifying or adding to a
|
||||
program and simply using it. Linking a program with a library, without
|
||||
changing the library, is in some sense simply using the library, and is
|
||||
analogous to running a utility program or application program. However, in
|
||||
a textual and legal sense, the linked executable is a combined work, a
|
||||
derivative of the original library, and the ordinary General Public License
|
||||
treats it as such.
|
||||
|
||||
Because of this blurred distinction, using the ordinary General
|
||||
Public License for libraries did not effectively promote software
|
||||
sharing, because most developers did not use the libraries. We
|
||||
concluded that weaker conditions might promote sharing better.
|
||||
|
||||
However, unrestricted linking of non-free programs would deprive the
|
||||
users of those programs of all benefit from the free status of the
|
||||
libraries themselves. This Library General Public License is intended to
|
||||
permit developers of non-free programs to use free libraries, while
|
||||
preserving your freedom as a user of such programs to change the free
|
||||
libraries that are incorporated in them. (We have not seen how to achieve
|
||||
this as regards changes in header files, but we have achieved it as regards
|
||||
changes in the actual functions of the Library.) The hope is that this
|
||||
will lead to faster development of free libraries.
|
||||
|
||||
The precise terms and conditions for copying, distribution and
|
||||
modification follow. Pay close attention to the difference between a
|
||||
"work based on the library" and a "work that uses the library". The
|
||||
former contains code derived from the library, while the latter only
|
||||
works together with the library.
|
||||
|
||||
Note that it is possible for a library to be covered by the ordinary
|
||||
General Public License rather than by this special one.
|
||||
|
||||
GNU LIBRARY GENERAL PUBLIC LICENSE
|
||||
TERMS AND CONDITIONS FOR COPYING, DISTRIBUTION AND MODIFICATION
|
||||
|
||||
0. This License Agreement applies to any software library which
|
||||
contains a notice placed by the copyright holder or other authorized
|
||||
party saying it may be distributed under the terms of this Library
|
||||
General Public License (also called "this License"). Each licensee is
|
||||
addressed as "you".
|
||||
|
||||
A "library" means a collection of software functions and/or data
|
||||
prepared so as to be conveniently linked with application programs
|
||||
(which use some of those functions and data) to form executables.
|
||||
|
||||
The "Library", below, refers to any such software library or work
|
||||
which has been distributed under these terms. A "work based on the
|
||||
Library" means either the Library or any derivative work under
|
||||
copyright law: that is to say, a work containing the Library or a
|
||||
portion of it, either verbatim or with modifications and/or translated
|
||||
straightforwardly into another language. (Hereinafter, translation is
|
||||
included without limitation in the term "modification".)
|
||||
|
||||
"Source code" for a work means the preferred form of the work for
|
||||
making modifications to it. For a library, complete source code means
|
||||
all the source code for all modules it contains, plus any associated
|
||||
interface definition files, plus the scripts used to control compilation
|
||||
and installation of the library.
|
||||
|
||||
Activities other than copying, distribution and modification are not
|
||||
covered by this License; they are outside its scope. The act of
|
||||
running a program using the Library is not restricted, and output from
|
||||
such a program is covered only if its contents constitute a work based
|
||||
on the Library (independent of the use of the Library in a tool for
|
||||
writing it). Whether that is true depends on what the Library does
|
||||
and what the program that uses the Library does.
|
||||
|
||||
1. You may copy and distribute verbatim copies of the Library's
|
||||
complete source code as you receive it, in any medium, provided that
|
||||
you conspicuously and appropriately publish on each copy an
|
||||
appropriate copyright notice and disclaimer of warranty; keep intact
|
||||
all the notices that refer to this License and to the absence of any
|
||||
warranty; and distribute a copy of this License along with the
|
||||
Library.
|
||||
|
||||
You may charge a fee for the physical act of transferring a copy,
|
||||
and you may at your option offer warranty protection in exchange for a
|
||||
fee.
|
||||
|
||||
2. You may modify your copy or copies of the Library or any portion
|
||||
of it, thus forming a work based on the Library, and copy and
|
||||
distribute such modifications or work under the terms of Section 1
|
||||
above, provided that you also meet all of these conditions:
|
||||
|
||||
a) The modified work must itself be a software library.
|
||||
|
||||
b) You must cause the files modified to carry prominent notices
|
||||
stating that you changed the files and the date of any change.
|
||||
|
||||
c) You must cause the whole of the work to be licensed at no
|
||||
charge to all third parties under the terms of this License.
|
||||
|
||||
d) If a facility in the modified Library refers to a function or a
|
||||
table of data to be supplied by an application program that uses
|
||||
the facility, other than as an argument passed when the facility
|
||||
is invoked, then you must make a good faith effort to ensure that,
|
||||
in the event an application does not supply such function or
|
||||
table, the facility still operates, and performs whatever part of
|
||||
its purpose remains meaningful.
|
||||
|
||||
(For example, a function in a library to compute square roots has
|
||||
a purpose that is entirely well-defined independent of the
|
||||
application. Therefore, Subsection 2d requires that any
|
||||
application-supplied function or table used by this function must
|
||||
be optional: if the application does not supply it, the square
|
||||
root function must still compute square roots.)
|
||||
|
||||
These requirements apply to the modified work as a whole. If
|
||||
identifiable sections of that work are not derived from the Library,
|
||||
and can be reasonably considered independent and separate works in
|
||||
themselves, then this License, and its terms, do not apply to those
|
||||
sections when you distribute them as separate works. But when you
|
||||
distribute the same sections as part of a whole which is a work based
|
||||
on the Library, the distribution of the whole must be on the terms of
|
||||
this License, whose permissions for other licensees extend to the
|
||||
entire whole, and thus to each and every part regardless of who wrote
|
||||
it.
|
||||
|
||||
Thus, it is not the intent of this section to claim rights or contest
|
||||
your rights to work written entirely by you; rather, the intent is to
|
||||
exercise the right to control the distribution of derivative or
|
||||
collective works based on the Library.
|
||||
|
||||
In addition, mere aggregation of another work not based on the Library
|
||||
with the Library (or with a work based on the Library) on a volume of
|
||||
a storage or distribution medium does not bring the other work under
|
||||
the scope of this License.
|
||||
|
||||
3. You may opt to apply the terms of the ordinary GNU General Public
|
||||
License instead of this License to a given copy of the Library. To do
|
||||
this, you must alter all the notices that refer to this License, so
|
||||
that they refer to the ordinary GNU General Public License, version 2,
|
||||
instead of to this License. (If a newer version than version 2 of the
|
||||
ordinary GNU General Public License has appeared, then you can specify
|
||||
that version instead if you wish.) Do not make any other change in
|
||||
these notices.
|
||||
|
||||
Once this change is made in a given copy, it is irreversible for
|
||||
that copy, so the ordinary GNU General Public License applies to all
|
||||
subsequent copies and derivative works made from that copy.
|
||||
|
||||
This option is useful when you wish to copy part of the code of
|
||||
the Library into a program that is not a library.
|
||||
|
||||
4. You may copy and distribute the Library (or a portion or
|
||||
derivative of it, under Section 2) in object code or executable form
|
||||
under the terms of Sections 1 and 2 above provided that you accompany
|
||||
it with the complete corresponding machine-readable source code, which
|
||||
must be distributed under the terms of Sections 1 and 2 above on a
|
||||
medium customarily used for software interchange.
|
||||
|
||||
If distribution of object code is made by offering access to copy
|
||||
from a designated place, then offering equivalent access to copy the
|
||||
source code from the same place satisfies the requirement to
|
||||
distribute the source code, even though third parties are not
|
||||
compelled to copy the source along with the object code.
|
||||
|
||||
5. A program that contains no derivative of any portion of the
|
||||
Library, but is designed to work with the Library by being compiled or
|
||||
linked with it, is called a "work that uses the Library". Such a
|
||||
work, in isolation, is not a derivative work of the Library, and
|
||||
therefore falls outside the scope of this License.
|
||||
|
||||
However, linking a "work that uses the Library" with the Library
|
||||
creates an executable that is a derivative of the Library (because it
|
||||
contains portions of the Library), rather than a "work that uses the
|
||||
library". The executable is therefore covered by this License.
|
||||
Section 6 states terms for distribution of such executables.
|
||||
|
||||
When a "work that uses the Library" uses material from a header file
|
||||
that is part of the Library, the object code for the work may be a
|
||||
derivative work of the Library even though the source code is not.
|
||||
Whether this is true is especially significant if the work can be
|
||||
linked without the Library, or if the work is itself a library. The
|
||||
threshold for this to be true is not precisely defined by law.
|
||||
|
||||
If such an object file uses only numerical parameters, data
|
||||
structure layouts and accessors, and small macros and small inline
|
||||
functions (ten lines or less in length), then the use of the object
|
||||
file is unrestricted, regardless of whether it is legally a derivative
|
||||
work. (Executables containing this object code plus portions of the
|
||||
Library will still fall under Section 6.)
|
||||
|
||||
Otherwise, if the work is a derivative of the Library, you may
|
||||
distribute the object code for the work under the terms of Section 6.
|
||||
Any executables containing that work also fall under Section 6,
|
||||
whether or not they are linked directly with the Library itself.
|
||||
|
||||
6. As an exception to the Sections above, you may also compile or
|
||||
link a "work that uses the Library" with the Library to produce a
|
||||
work containing portions of the Library, and distribute that work
|
||||
under terms of your choice, provided that the terms permit
|
||||
modification of the work for the customer's own use and reverse
|
||||
engineering for debugging such modifications.
|
||||
|
||||
You must give prominent notice with each copy of the work that the
|
||||
Library is used in it and that the Library and its use are covered by
|
||||
this License. You must supply a copy of this License. If the work
|
||||
during execution displays copyright notices, you must include the
|
||||
copyright notice for the Library among them, as well as a reference
|
||||
directing the user to the copy of this License. Also, you must do one
|
||||
of these things:
|
||||
|
||||
a) Accompany the work with the complete corresponding
|
||||
machine-readable source code for the Library including whatever
|
||||
changes were used in the work (which must be distributed under
|
||||
Sections 1 and 2 above); and, if the work is an executable linked
|
||||
with the Library, with the complete machine-readable "work that
|
||||
uses the Library", as object code and/or source code, so that the
|
||||
user can modify the Library and then relink to produce a modified
|
||||
executable containing the modified Library. (It is understood
|
||||
that the user who changes the contents of definitions files in the
|
||||
Library will not necessarily be able to recompile the application
|
||||
to use the modified definitions.)
|
||||
|
||||
b) Accompany the work with a written offer, valid for at
|
||||
least three years, to give the same user the materials
|
||||
specified in Subsection 6a, above, for a charge no more
|
||||
than the cost of performing this distribution.
|
||||
|
||||
c) If distribution of the work is made by offering access to copy
|
||||
from a designated place, offer equivalent access to copy the above
|
||||
specified materials from the same place.
|
||||
|
||||
d) Verify that the user has already received a copy of these
|
||||
materials or that you have already sent this user a copy.
|
||||
|
||||
For an executable, the required form of the "work that uses the
|
||||
Library" must include any data and utility programs needed for
|
||||
reproducing the executable from it. However, as a special exception,
|
||||
the source code distributed need not include anything that is normally
|
||||
distributed (in either source or binary form) with the major
|
||||
components (compiler, kernel, and so on) of the operating system on
|
||||
which the executable runs, unless that component itself accompanies
|
||||
the executable.
|
||||
|
||||
It may happen that this requirement contradicts the license
|
||||
restrictions of other proprietary libraries that do not normally
|
||||
accompany the operating system. Such a contradiction means you cannot
|
||||
use both them and the Library together in an executable that you
|
||||
distribute.
|
||||
|
||||
7. You may place library facilities that are a work based on the
|
||||
Library side-by-side in a single library together with other library
|
||||
facilities not covered by this License, and distribute such a combined
|
||||
library, provided that the separate distribution of the work based on
|
||||
the Library and of the other library facilities is otherwise
|
||||
permitted, and provided that you do these two things:
|
||||
|
||||
a) Accompany the combined library with a copy of the same work
|
||||
based on the Library, uncombined with any other library
|
||||
facilities. This must be distributed under the terms of the
|
||||
Sections above.
|
||||
|
||||
b) Give prominent notice with the combined library of the fact
|
||||
that part of it is a work based on the Library, and explaining
|
||||
where to find the accompanying uncombined form of the same work.
|
||||
|
||||
8. You may not copy, modify, sublicense, link with, or distribute
|
||||
the Library except as expressly provided under this License. Any
|
||||
attempt otherwise to copy, modify, sublicense, link with, or
|
||||
distribute the Library is void, and will automatically terminate your
|
||||
rights under this License. However, parties who have received copies,
|
||||
or rights, from you under this License will not have their licenses
|
||||
terminated so long as such parties remain in full compliance.
|
||||
|
||||
9. You are not required to accept this License, since you have not
|
||||
signed it. However, nothing else grants you permission to modify or
|
||||
distribute the Library or its derivative works. These actions are
|
||||
prohibited by law if you do not accept this License. Therefore, by
|
||||
modifying or distributing the Library (or any work based on the
|
||||
Library), you indicate your acceptance of this License to do so, and
|
||||
all its terms and conditions for copying, distributing or modifying
|
||||
the Library or works based on it.
|
||||
|
||||
10. Each time you redistribute the Library (or any work based on the
|
||||
Library), the recipient automatically receives a license from the
|
||||
original licensor to copy, distribute, link with or modify the Library
|
||||
subject to these terms and conditions. You may not impose any further
|
||||
restrictions on the recipients' exercise of the rights granted herein.
|
||||
You are not responsible for enforcing compliance by third parties to
|
||||
this License.
|
||||
|
||||
11. If, as a consequence of a court judgment or allegation of patent
|
||||
infringement or for any other reason (not limited to patent issues),
|
||||
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
|
||||
distribute so as to satisfy simultaneously your obligations under this
|
||||
License and any other pertinent obligations, then as a consequence you
|
||||
may not distribute the Library at all. For example, if a patent
|
||||
license would not permit royalty-free redistribution of the Library by
|
||||
all those who receive copies directly or indirectly through you, then
|
||||
the only way you could satisfy both it and this License would be to
|
||||
refrain entirely from distribution of the Library.
|
||||
|
||||
If any portion of this section is held invalid or unenforceable under any
|
||||
particular circumstance, the balance of the section is intended to apply,
|
||||
and the section as a whole is intended to apply in other circumstances.
|
||||
|
||||
It is not the purpose of this section to induce you to infringe any
|
||||
patents or other property right claims or to contest validity of any
|
||||
such claims; this section has the sole purpose of protecting the
|
||||
integrity of the free software distribution system which is
|
||||
implemented by public license practices. Many people have made
|
||||
generous contributions to the wide range of software distributed
|
||||
through that system in reliance on consistent application of that
|
||||
system; it is up to the author/donor to decide if he or she is willing
|
||||
to distribute software through any other system and a licensee cannot
|
||||
impose that choice.
|
||||
|
||||
This section is intended to make thoroughly clear what is believed to
|
||||
be a consequence of the rest of this License.
|
||||
|
||||
12. If the distribution and/or use of the Library is restricted in
|
||||
certain countries either by patents or by copyrighted interfaces, the
|
||||
original copyright holder who places the Library under this License may add
|
||||
an explicit geographical distribution limitation excluding those countries,
|
||||
so that distribution is permitted only in or among countries not thus
|
||||
excluded. In such case, this License incorporates the limitation as if
|
||||
written in the body of this License.
|
||||
|
||||
13. The Free Software Foundation may publish revised and/or new
|
||||
versions of the Library 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 Library
|
||||
specifies a version number of this License which applies to it and
|
||||
"any later version", you have the option of following the terms and
|
||||
conditions either of that version or of any later version published by
|
||||
the Free Software Foundation. If the Library does not specify a
|
||||
license version number, you may choose any version ever published by
|
||||
the Free Software Foundation.
|
||||
|
||||
14. If you wish to incorporate parts of the Library into other free
|
||||
programs whose distribution conditions are incompatible with these,
|
||||
write to the author to ask for permission. For software which is
|
||||
copyrighted by the Free Software Foundation, write to the Free
|
||||
Software Foundation; we sometimes make exceptions for this. Our
|
||||
decision will be guided by the two goals of preserving the free status
|
||||
of all derivatives of our free software and of promoting the sharing
|
||||
and reuse of software generally.
|
||||
|
||||
NO WARRANTY
|
||||
|
||||
15. BECAUSE THE LIBRARY IS LICENSED FREE OF CHARGE, THERE IS NO
|
||||
WARRANTY FOR THE LIBRARY, TO THE EXTENT PERMITTED BY APPLICABLE LAW.
|
||||
EXCEPT WHEN OTHERWISE STATED IN WRITING THE COPYRIGHT HOLDERS AND/OR
|
||||
OTHER PARTIES PROVIDE THE LIBRARY "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
|
||||
LIBRARY IS WITH YOU. SHOULD THE LIBRARY PROVE DEFECTIVE, YOU ASSUME
|
||||
THE COST OF ALL NECESSARY SERVICING, REPAIR OR CORRECTION.
|
||||
|
||||
16. IN NO EVENT UNLESS REQUIRED BY APPLICABLE LAW OR AGREED TO IN
|
||||
WRITING WILL ANY COPYRIGHT HOLDER, OR ANY OTHER PARTY WHO MAY MODIFY
|
||||
AND/OR REDISTRIBUTE THE LIBRARY 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
|
||||
LIBRARY (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 LIBRARY TO OPERATE WITH ANY OTHER SOFTWARE), EVEN IF
|
||||
SUCH HOLDER OR OTHER PARTY HAS BEEN ADVISED OF THE POSSIBILITY OF SUCH
|
||||
DAMAGES.
|
||||
|
||||
END OF TERMS AND CONDITIONS
|
||||
|
||||
Appendix: How to Apply These Terms to Your New Libraries
|
||||
|
||||
If you develop a new library, and you want it to be of the greatest
|
||||
possible use to the public, we recommend making it free software that
|
||||
everyone can redistribute and change. You can do so by permitting
|
||||
redistribution under these terms (or, alternatively, under the terms of the
|
||||
ordinary General Public License).
|
||||
|
||||
To apply these terms, attach the following notices to the library. It is
|
||||
safest to attach them to the start of each source file to most effectively
|
||||
convey 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 library's name and a brief idea of what it does.>
|
||||
Copyright (C) <year> <name of author>
|
||||
|
||||
This library is free software; you can redistribute it and/or
|
||||
modify it under the terms of the GNU Library General Public
|
||||
License as published by the Free Software Foundation; either
|
||||
version 2 of the License, or (at your option) any later version.
|
||||
|
||||
This library 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
|
||||
Library General Public License for more details.
|
||||
|
||||
You should have received a copy of the GNU Library General Public
|
||||
License along with this library; if not, write to the Free
|
||||
Software Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA.
|
||||
|
||||
Also add information on how to contact you by electronic and paper mail.
|
||||
|
||||
You should also get your employer (if you work as a programmer) or your
|
||||
school, if any, to sign a "copyright disclaimer" for the library, if
|
||||
necessary. Here is a sample; alter the names:
|
||||
|
||||
Yoyodyne, Inc., hereby disclaims all copyright interest in the
|
||||
library `Frob' (a library for tweaking knobs) written by James Random Hacker.
|
||||
|
||||
<signature of Ty Coon>, 1 April 1990
|
||||
Ty Coon, President of Vice
|
||||
|
||||
That's all there is to it!
|
||||
@@ -1,101 +0,0 @@
|
||||
|
||||
Mono is made up of many pieces of code, all of them open source, but
|
||||
different pieces of Mono use different licensing terms.
|
||||
|
||||
For comments, corrections and updates, please contact [email protected]
|
||||
|
||||
* Dual Licensing
|
||||
|
||||
Parts of Mono are dual licensed, they are available to the
|
||||
public in GPL or LGPL forms, but we also offer those pieces
|
||||
under commercial terms from Novell for when the GPL and the
|
||||
LGPL are not suitable.
|
||||
|
||||
We have tried to pick the licenses that will maximize adoption
|
||||
of Mono, so we tend to use the MIT X11 or LGPL liceses.
|
||||
|
||||
Contributions to dual-licensed module require that the author
|
||||
contributes the code under the terms of the MIT X11 code, or
|
||||
to sign an agreement that allows Novell to redistribute the
|
||||
code under other licenses.
|
||||
|
||||
Contributions for other modules should be under the same license
|
||||
terms as the rest of the module, or under MIT X11 terms.
|
||||
|
||||
If you ned further information, please contact [email protected]
|
||||
|
||||
* The Modules
|
||||
|
||||
** mono/mono: the Mono VM
|
||||
|
||||
This code is dual licensed under the LGPL or commercial licenses.
|
||||
|
||||
The LGPL ensures that Mono can be used in most scenarios, but
|
||||
gives Novell the flexibility to relicense the code for embedded
|
||||
systems or commercial settings where the LGPL can not be used.
|
||||
|
||||
Contact [email protected] for details on obtaining the Mono
|
||||
runtime under other terms.
|
||||
|
||||
** mono/eglib: Mono's X11 glib implementation
|
||||
|
||||
This is a minimal subset of glib that is to be licensed under
|
||||
the terms of the MIT X11, this means that this code can be
|
||||
used for any purposes by anyone.
|
||||
|
||||
** mcs/mcs, mcs/gmcs
|
||||
|
||||
The C# Compilers (1.0 and 2.0)
|
||||
|
||||
These compilers are dual licensed under the GPL and commercial
|
||||
terms.
|
||||
|
||||
** tests
|
||||
|
||||
Unless explicitly stated, the tests are under the MIT X11 license.
|
||||
|
||||
** mcs/class
|
||||
|
||||
The class libraries developed by the Mono team are licensed
|
||||
under the MIT X11 terms.
|
||||
|
||||
In addition to the class libraries developed by the Mono team,
|
||||
there are a number of class libraries that we bundle as part
|
||||
of the distribution that were integrated from third-parties or
|
||||
that contain code that was originally licensed under different
|
||||
terms, these are:
|
||||
|
||||
ByteFX.Data: LGPL
|
||||
|
||||
Npgsql: LGPL
|
||||
|
||||
FirebirdSql.Data.Firebird: Firebird public license.
|
||||
See: mcs/class/FirebirdSql.Data.Firebird/license.txt
|
||||
|
||||
ICSharpCode.SharpZipLib, GPL with exceptions.
|
||||
See: mcs/class/ICSharpCode.SharpZipLib/README
|
||||
|
||||
|
||||
** mcs/tools
|
||||
|
||||
These are licensed under the MIT X11 license, except where the
|
||||
GPL is explicitly used.
|
||||
|
||||
** mcs/jay
|
||||
|
||||
This is a port of Berkeley yacc, so it is available under the BSD
|
||||
license. See the license in the individual C files for details.
|
||||
|
||||
** mono/man
|
||||
|
||||
Manual pages and Mono documentation are covered by the MIT X11 license.
|
||||
|
||||
* The Licenses
|
||||
|
||||
These are the licenses used in Mono, the files are located:
|
||||
|
||||
GNU GPL: details avaliable in the file mcs/LICENSE.GPL
|
||||
GNU LGPL: details available in the file mcs/LICENSE.LGPL
|
||||
MIT X11: text available in the file mcs/MIT.X11
|
||||
MPL: text available in the file mcs/LICENSE.MPL
|
||||
|
||||
-92
@@ -1,92 +0,0 @@
|
||||
AUTOMAKE_OPTIONS = foreign
|
||||
ACLOCAL_AMFLAGS = -I .
|
||||
|
||||
SUBDIRS = $(libgc_dir) mono $(ikvm_native_dir) support docs data runtime scripts man samples web
|
||||
|
||||
# Keep in sync with SUBDIRS
|
||||
## 'tools' is not normally built
|
||||
DIST_SUBDIRS = libgc mono ikvm-native support docs data runtime scripts man samples web tools
|
||||
|
||||
vs_files = genmdesc.vcproj libmono.vcproj mono.vcproj mono.sln
|
||||
|
||||
EXTRA_DIST= mono.pc.in mint.pc.in mono-uninstalled.pc.in dotnet.pc.in mono-cairo.pc.in LICENSE $(vs_files)
|
||||
|
||||
DISTCHECK_CONFIGURE_FLAGS = EXTERNAL_MCS=false EXTERNAL_RUNTIME=false
|
||||
|
||||
# Distribute the 'mcs' tree too
|
||||
dist-hook:
|
||||
test -d $(distdir)/mcs || mkdir $(distdir)/mcs
|
||||
d=`cd $(distdir)/mcs && pwd`; cd $(mcs_topdir) && $(MAKE) PROFILE=default distdir=$$d dist-recursive
|
||||
|
||||
pkgconfigdir = $(libdir)/pkgconfig
|
||||
if JIT_SUPPORTED
|
||||
if INTERP_SUPPORTED
|
||||
pkgconfig_DATA= mono.pc mint.pc dotnet.pc mono-cairo.pc
|
||||
else
|
||||
pkgconfig_DATA= mono.pc dotnet.pc mono-cairo.pc
|
||||
endif
|
||||
else
|
||||
pkgconfig_DATA= mint.pc mono-cairo.pc
|
||||
endif
|
||||
noinst_DATA = mono-uninstalled.pc
|
||||
DISTCLEANFILES= mono.pc mint.pc mono-uninstalled.pc dotnet.pc mono-cairo.pc
|
||||
|
||||
.PHONY: get-monolite-latest mcs-do-compiler-tests compiler-tests bootstrap-world
|
||||
|
||||
# building with monolite
|
||||
mcslib = $(mcs_topdir)/class/lib
|
||||
monolite = $(mcslib)/monolite
|
||||
get-monolite-latest:
|
||||
-rm -fr $(mcslib)/monolite-*
|
||||
test ! -d $(monolite) || test ! -d $(monolite).old || rm -fr $(monolite).old
|
||||
test ! -d $(monolite) || mv -f $(monolite) $(monolite).old
|
||||
cd $(mcslib) && { wget -O- http://www.go-mono.com/daily/monolite-latest.tar.gz | gzip -d | tar xf - ; }
|
||||
cd $(mcslib) && mv -f monolite-* monolite
|
||||
|
||||
compiler-tests: mcs-do-clean
|
||||
$(MAKE) all
|
||||
$(MAKE) mcs-do-compiler-tests
|
||||
|
||||
compiler-tests-net_2_0:
|
||||
-rm -f $(mcs_topdir)/build/common/Consts.cs.save
|
||||
-mv -f $(mcs_topdir)/build/common/Consts.cs $(mcs_topdir)/build/common/Consts.cs.save
|
||||
cd $(mcs_topdir) && $(MAKE) PROFILE=net_2_0_bootstrap clean
|
||||
cd $(mcs_topdir) && $(MAKE) PROFILE=net_2_0 clean
|
||||
-mv -f $(mcs_topdir)/build/common/Consts.cs.save $(mcs_topdir)/build/common/Consts.cs
|
||||
$(MAKE) all
|
||||
$(MAKE) build_profiles=net_2_0 mcs-do-compiler-tests
|
||||
|
||||
bootstrap-world: compiler-tests
|
||||
$(MAKE) install
|
||||
|
||||
bootstrap-world-net_2_0: compiler-tests-net_2_0
|
||||
$(MAKE) install
|
||||
|
||||
# internal targets
|
||||
mcs-do-clean:
|
||||
cd runtime && $(MAKE) clean-local
|
||||
cd mono/tests && $(MAKE) clean
|
||||
mcs-do-compiler-tests:
|
||||
cd runtime && $(MAKE) test_select='TEST_SUBDIRS="tests errors"' check-local
|
||||
cd mono/tests && $(MAKE) check
|
||||
|
||||
win32getdeps:
|
||||
wget http://www.go-mono.com/archive/pkgconfig-0.11-20020310.zip
|
||||
wget http://www.go-mono.com/archive/glib-2.0.4-20020703.zip
|
||||
wget http://www.go-mono.com/archive/glib-dev-2.0.4-20020703.zip
|
||||
wget http://www.go-mono.com/archive/libiconv-1.7.zip
|
||||
wget http://www.go-mono.com/archive/libiconv-dev-1.7.zip
|
||||
wget http://www.go-mono.com/archive/libintl-0.10.40-20020101.zip
|
||||
unzip -n -d / pkgconfig-0.11-20020310.zip
|
||||
unzip -n -d / glib-2.0.4-20020703.zip
|
||||
unzip -n -d / glib-dev-2.0.4-20020703.zip
|
||||
unzip -n -d / libiconv-1.7.zip
|
||||
unzip -n -d / libiconv-dev-1.7.zip
|
||||
unzip -n -d / libintl-0.10.40-20020101.zip
|
||||
|
||||
win32setup:
|
||||
makensis /DMILESTONE=$(VERSION) /DSOURCE_INSTALL_DIR=$(SOURCE_INSTALL_DIR) /DBUILDNUM=$(BUILDNUM) monowiz.win32.nsi
|
||||
|
||||
bootstrap: all
|
||||
@echo "*** 'make bootstrap' is obsolete. Just run 'make' to perform a combined mono+mcs build"
|
||||
exit 1
|
||||
@@ -1,8 +0,0 @@
|
||||
Release notes for Mono are hosted on the web, please see:
|
||||
|
||||
http://www.go-mono.com/archive/VERSION
|
||||
|
||||
Where version is the version of this Mono package, for example:
|
||||
|
||||
http://www.go-mono.com/archive/1.1.9
|
||||
|
||||
@@ -1,409 +0,0 @@
|
||||
|
||||
This is Mono.
|
||||
|
||||
1. Installation
|
||||
2. Using Mono
|
||||
3. Directory Roadmap
|
||||
|
||||
1. Compilation and Installation
|
||||
===============================
|
||||
|
||||
a. Build Requirements
|
||||
---------------------
|
||||
|
||||
To build Mono, you will need the following components:
|
||||
|
||||
* pkg-config
|
||||
|
||||
Available from: http://www.freedesktop.org/Software/pkgconfig
|
||||
|
||||
* glib 2.4
|
||||
|
||||
Available from: http://www.gtk.org/
|
||||
|
||||
On Itanium, you must obtain libunwind:
|
||||
|
||||
http://www.hpl.hp.com/research/linux/libunwind/download.php4
|
||||
|
||||
On Solaris, make sure that you used GNU tar to unpack this package, as
|
||||
Solaris tar will not unpack this correctly, and you will get strange errors.
|
||||
|
||||
On Solaris, make sure that you use the GNU toolchain to build the software.
|
||||
|
||||
Optional dependencies:
|
||||
|
||||
* libgdiplus
|
||||
|
||||
If you want to get support for System.Drawing, you will need to get
|
||||
Libgdiplus.
|
||||
|
||||
* libzlib
|
||||
|
||||
This library and the development headers are required for compression
|
||||
file support in the 2.0 profile.
|
||||
|
||||
b. Building the Software
|
||||
------------------------
|
||||
|
||||
If you obtained this package as an officially released tarball,
|
||||
this is very simple, use configure and make:
|
||||
|
||||
./configure --prefix=/usr/local
|
||||
make
|
||||
make install
|
||||
|
||||
Mono supports a JIT engine on x86, SPARC, SPARCv9, S/390, AMD64, ARM
|
||||
and PowerPC systems.
|
||||
|
||||
If you obtained this as a snapshot, you will need an existing
|
||||
Mono installation. To upgrade your installation, unpack both
|
||||
mono and mcs:
|
||||
|
||||
tar xzf mcs-XXXX.tar.gz
|
||||
tar xzf mono-XXXX.tar.gz
|
||||
mv mono-XXX mono
|
||||
mv mcs-XXX mcs
|
||||
cd mono
|
||||
./autogen.sh --prefix=/usr/local
|
||||
make
|
||||
|
||||
c. Building the software from SVN
|
||||
---------------------------------
|
||||
|
||||
If you are building the software from SVN, make sure that you
|
||||
have up-to-date mcs and mono sources:
|
||||
|
||||
svn co svn+ssh://[email protected]/source/trunk/mono
|
||||
svn co svn+ssh://[email protected]/source/trunk/mcs
|
||||
|
||||
Then, go into the mono directory, and configure:
|
||||
|
||||
cd mono
|
||||
./autogen.sh --prefix=/usr/local
|
||||
make
|
||||
|
||||
For people with non-standard installations of the auto* utils and of
|
||||
pkg-config (common on misconfigured OSX and windows boxes), you could get
|
||||
an error like this:
|
||||
|
||||
./configure: line 19176: syntax error near unexpected token `PKG_CHECK_MODULES(BASE_DEPENDENCIES,' ...
|
||||
|
||||
This means that you need to set the ACLOCAL_FLAGS environment var
|
||||
when invoking autogen.sh, like this:
|
||||
|
||||
ACLOCAL_FLAGS="-I $acprefix/share/aclocal" ./autogen.sh --prefix=/usr/loca
|
||||
|
||||
where $acprefix is the prefix where aclocal has been installed.
|
||||
|
||||
This will automatically go into the mcs/ tree and build the
|
||||
binaries there.
|
||||
|
||||
This assumes that you have a working mono installation, and that
|
||||
there's a C# compiler named 'mcs', and a corresponding IL
|
||||
runtime called 'mono'. You can use two make variables
|
||||
EXTERNAL_MCS and EXTERNAL_RUNTIME to override these. e.g., you
|
||||
can say
|
||||
|
||||
make EXTERNAL_MCS=/foo/bar/mcs EXTERNAL_RUNTIME=/somewhere/else/mono
|
||||
|
||||
If you don't have a working Mono installation
|
||||
---------------------------------------------
|
||||
|
||||
If you don't have a working Mono installation, an obvious choice
|
||||
is to install the latest released packages of 'mono' for your
|
||||
distribution and running autogen.sh; make; make install in the
|
||||
mono module directory.
|
||||
|
||||
You can also try a slightly more risky approach: this may not work,
|
||||
so start from the released tarball as detailed above.
|
||||
|
||||
This works by first getting the latest version of the 'monolite'
|
||||
distribution, which contains just enough to run the 'mcs'
|
||||
compiler. You do this with:
|
||||
|
||||
make get-monolite-latest
|
||||
|
||||
This will download and automatically gunzip and untar the
|
||||
tarball, and place the files appropriately so that you can then
|
||||
just run:
|
||||
|
||||
make
|
||||
|
||||
To ensure that you're using the 'monolite' distribution, you can
|
||||
also try passing EXTERNAL_MCS=false on the make command-line.
|
||||
|
||||
Testing and Installation
|
||||
------------------------
|
||||
|
||||
You can run (part of) the mono and mcs testsuites with the command:
|
||||
|
||||
make check
|
||||
|
||||
All tests should pass.
|
||||
|
||||
If you want more extensive tests, including those that test the
|
||||
class libraries, you need to re-run 'configure' with the
|
||||
'--enable-nunit-tests' flag, and try
|
||||
|
||||
make -k check
|
||||
|
||||
Expect to find a few testsuite failures. As a sanity check, you
|
||||
can compare the failures you got with
|
||||
|
||||
http://go-mono.com/tests/displayTestResults.php
|
||||
|
||||
You can now install mono with:
|
||||
|
||||
make install
|
||||
|
||||
Failure to follow these steps may result in a broken installation.
|
||||
|
||||
d. Common Configuration Options
|
||||
-------------------------------
|
||||
|
||||
The following are the configuration options that someone
|
||||
building Mono might want to use:
|
||||
|
||||
|
||||
--with-gc=[boehm, included, sgen, none]
|
||||
|
||||
Selects the garbage collector engine to use, the
|
||||
default is the "included" value.
|
||||
|
||||
included:
|
||||
This is the default value, and its
|
||||
the most feature complete, it will allow Mono
|
||||
to use typed allocations and support the
|
||||
debugger.
|
||||
|
||||
It is essentially a slightly modified Boehm GC
|
||||
|
||||
boehm:
|
||||
This is used to use a system-install Boehm GC,
|
||||
it is useful to test new features available in
|
||||
Boehm GC, but we do not recommend that people
|
||||
use this, as it disables a few features.
|
||||
|
||||
sgen:
|
||||
The under-development Generational GC for
|
||||
Mono, do not use this in production.
|
||||
|
||||
none:
|
||||
Disables the inclusion of a garbage
|
||||
collector.
|
||||
|
||||
--with-tls=__thread,pthread
|
||||
|
||||
Controls how Mono should access thread local storage,
|
||||
pthread forces Mono to use the pthread APIs, while
|
||||
__thread uses compiler-optimized access to it.
|
||||
|
||||
Although __thread is faster, it requires support from
|
||||
the compiler, kernel and libc. Old Linux systems do
|
||||
not support with __thread.
|
||||
|
||||
This value is typically pre-configured and there is no
|
||||
need to set it, unless you are trying to debug a
|
||||
problem.
|
||||
|
||||
--with-sigaltstack=yes,no
|
||||
|
||||
This controls whether Mono will install a special
|
||||
signal handler to handle stack overflows. If set to
|
||||
"yes", it will turn stack overflows into the
|
||||
StackOverflowException. Otherwise when a stack
|
||||
overflow happens, your program will receive a
|
||||
segmentation fault.
|
||||
|
||||
The configure script will try to detect if your
|
||||
operating system supports this. Some older Linux
|
||||
systems do not support this feature, or you might want
|
||||
to override the auto-detection.
|
||||
|
||||
--with-static-mono=yes,no
|
||||
|
||||
This controls whether `mono' should link against a
|
||||
static library (libmono.a) or a shared library
|
||||
(libmono.so).
|
||||
|
||||
This defaults to yes, and will improve the performance
|
||||
of the `mono' program.
|
||||
|
||||
This only affects the `mono' binary, the shared
|
||||
library libmono.so will always be produced for
|
||||
developers that want to embed the runtime in their
|
||||
application.
|
||||
|
||||
--with-xen-opt=yes,no
|
||||
|
||||
The default value for this is `yes', and it makes Mono
|
||||
generate code which might be slightly slower on
|
||||
average systems, but the resulting executable will run
|
||||
faster under the Xen virtualization system.
|
||||
|
||||
--with-large-heap=yes,no
|
||||
|
||||
Enable support for GC heaps larger than 3GB.
|
||||
|
||||
This value is set to `no' by default.
|
||||
|
||||
--with-ikvm-native=yes,no
|
||||
|
||||
Controls whether the IKVM JNI interface library is
|
||||
built or not. This is used if you are planning on
|
||||
using the IKVM Java Virtual machine with Mono.
|
||||
|
||||
This defaults to `yes'.
|
||||
|
||||
--with-preview=yes,no
|
||||
|
||||
Whether you want to build libraries that are still not
|
||||
completed (The 2.0 APIs). It defaults to `yes'.
|
||||
|
||||
--with-libgdiplus=installed,sibling,<path>
|
||||
|
||||
This is used to configure where should Mono look for
|
||||
libgdiplus when running the System.Drawing tests.
|
||||
|
||||
It defaults to `installed', which means that the
|
||||
library is available to Mono through the regular
|
||||
system setup.
|
||||
|
||||
`sibling' can be used to specify that a libgdiplus
|
||||
that resides as a sibling of this directory (mono)
|
||||
should be used.
|
||||
|
||||
Or you can specify a path to a libgdiplus.
|
||||
|
||||
--enable-minimal=LIST
|
||||
|
||||
Use this feature to specify optional runtime
|
||||
components that you might not want to include. This
|
||||
is only useful for developers embedding Mono that
|
||||
require a subset of Mono functionality.
|
||||
|
||||
The list is a comma-separated list of components that
|
||||
should be removed, these are:
|
||||
|
||||
aot:
|
||||
Disables support for the Ahead of Time
|
||||
compilation.
|
||||
|
||||
profiler:
|
||||
Disables support for the default profiler.
|
||||
|
||||
decimal:
|
||||
Disables support for System.Decimal.
|
||||
|
||||
pinvoke:
|
||||
Support for Platform Invocation services,
|
||||
disabling this will drop support for any
|
||||
libraries using DllImport.
|
||||
|
||||
debug:
|
||||
Drop debugging support.
|
||||
|
||||
reflection_emit:
|
||||
Drop System.Reflection.Emit support
|
||||
|
||||
large_code:
|
||||
Disables support for large assemblies.
|
||||
|
||||
logging:
|
||||
Disables support for debug logging.
|
||||
|
||||
com:
|
||||
Disables COM support.
|
||||
|
||||
ssa:
|
||||
Disables compilation for the SSA optimization
|
||||
framework, and the various SSA-based
|
||||
optimizations.
|
||||
|
||||
generics:
|
||||
Generics support. Disabling this will not
|
||||
allow Mono to run any 2.0 libraries or
|
||||
code that contains generics.
|
||||
|
||||
--disable-dev-random
|
||||
|
||||
Mono uses /dev/random to obtain good random data for
|
||||
any source that requires random numbers. If your
|
||||
system does not support this, you might want to
|
||||
disable it.
|
||||
|
||||
There are a number of runtime options to control this
|
||||
also, see the man page.
|
||||
|
||||
|
||||
2. Using Mono
|
||||
=============
|
||||
|
||||
Once you have installed the software, you can run a few programs:
|
||||
|
||||
* runtime engine
|
||||
|
||||
mono program.exe
|
||||
|
||||
* C# compiler
|
||||
|
||||
mcs program.cs
|
||||
|
||||
* CIL Disassembler
|
||||
|
||||
monodis program.exe
|
||||
|
||||
See the man pages for mono(1), mint(1), monodis(1) and mcs(2)
|
||||
for further details.
|
||||
|
||||
3. Directory Roadmap
|
||||
====================
|
||||
|
||||
docs/
|
||||
Technical documents about the Mono runtime.
|
||||
|
||||
data/
|
||||
Configuration files installed as part of the Mono runtime.
|
||||
|
||||
mono/
|
||||
The core of the Mono Runtime.
|
||||
|
||||
metadata/
|
||||
The object system and metadata reader.
|
||||
|
||||
mini/
|
||||
The Just in Time Compiler.
|
||||
|
||||
dis/
|
||||
CIL executable Disassembler
|
||||
|
||||
cli/
|
||||
Common code for the JIT and the interpreter.
|
||||
|
||||
io-layer/
|
||||
The I/O layer and system abstraction for
|
||||
emulating the .NET IO model.
|
||||
|
||||
cil/
|
||||
Common Intermediate Representation, XML
|
||||
definition of the CIL bytecodes.
|
||||
|
||||
interp/
|
||||
Interpreter for CLI executables (obsolete).
|
||||
|
||||
arch/
|
||||
Architecture specific portions.
|
||||
|
||||
man/
|
||||
|
||||
Manual pages for the various Mono commands and programs.
|
||||
|
||||
scripts/
|
||||
|
||||
Scripts used to invoke Mono and the corresponding program.
|
||||
|
||||
runtime/
|
||||
|
||||
A directory that contains the Makefiles that link the
|
||||
mono/ and mcs/ build systems.
|
||||
|
||||
-120
@@ -1,120 +0,0 @@
|
||||
README.vsnet Last updated: 2006-02-01
|
||||
|
||||
|
||||
SVN includes a Visual Studio .NET 2005 solution, mono.sln, and some
|
||||
projects files to build most of the unmanaged parts in Mono.
|
||||
|
||||
The "mono.sln" solution file contains the VC projects files for:
|
||||
|
||||
* Embedded Samples
|
||||
* test-invoke.vcproj
|
||||
* test-metadata.vcproj
|
||||
* teste.vcproj
|
||||
* Libraries
|
||||
* libgc.vcproj
|
||||
* libmono.vcproj
|
||||
* Tools
|
||||
* genmdesc.vcproj
|
||||
* monoburg.vcproj
|
||||
* monodiet.vcproj
|
||||
* monodis.vcproj
|
||||
* monograph.vcproj
|
||||
* pedump.vcproj
|
||||
* mono.vcproj
|
||||
|
||||
|
||||
REQUIREMENTS
|
||||
|
||||
* A working (i.e. where you could succesfully build mono) cygwin
|
||||
(http://www.cygwin.com/) setup! This is required to:
|
||||
* generate some files (via monoburg and genmdesc);
|
||||
* build the class libraries; and
|
||||
* test for regressions.
|
||||
|
||||
* Visual Studio .NET 2005. Previous Visual Studio versions may work or
|
||||
requires, hopefully minimal, changes.
|
||||
|
||||
* VSDependencies.zip must be decompressed under the /mono/ directory
|
||||
(otherwise you will need to edit all the projects files). This file can
|
||||
be downloaded from http://www.go-mono.com/archive/VSDependencies.zip
|
||||
|
||||
|
||||
LOCAL CHANGES
|
||||
|
||||
Sadly solution/projects files aren't easy to move from computers to
|
||||
computers (well unless everyone follow the same naming convention) so
|
||||
you'll likely have to changes some options in order to compile the
|
||||
solution.
|
||||
|
||||
* each executed assembly (i.e. the EXE) must be able to find a
|
||||
working mscorlib.dll (and all the other required assemblies).
|
||||
This can be done in different ways. My preference is to use the
|
||||
project "properties pages" in the "Configuration Properties
|
||||
\Debugging\Environment" options and set MONO_PATH to the class
|
||||
libraries directory build by cygwin (local) or on Linux
|
||||
(remote).
|
||||
|
||||
e.g. MONO_PATH=z:\svn\mcs\class\lib\default\
|
||||
allows me to use the class libs build under Linux, while
|
||||
MONO_PATH=C:\cygwin\opt\mono\lib\mono\1.0
|
||||
use the one built from cygwin (after a make install)
|
||||
|
||||
Some useful informations to adapt the solution/project files...
|
||||
|
||||
* My cygwin root dir is: c:\cygwin\
|
||||
* My username is: poupou
|
||||
* My mono install prefix is: /opt/mono
|
||||
|
||||
|
||||
BUILDING
|
||||
|
||||
Once everything is installed (and edited) you can right-click on the
|
||||
"mono" solution (in the "Solution Explorer"), select "Clean
|
||||
Solution" (for the first time) then "Build Solution".
|
||||
|
||||
|
||||
KNOWN ISSUES
|
||||
|
||||
[1] Most, BUT NOT ALL, the regressions tests pass under this build. The
|
||||
failures seems limited to some mathematical differences and to code
|
||||
relying on the stack walking functions. The hacks to replace the GCC
|
||||
functions (__builtin_frame_address and __builtin_return_address) are
|
||||
incomplete;
|
||||
|
||||
[2] The solution doesn't provide complete (i.e. from scratch) build. It
|
||||
requires a working cygwin environment to create some files (e.g. via
|
||||
genmdesc, monoburg). This isn't so bad as without cygwin you wouldn't be
|
||||
able to test Mono properly (see REQUIREMENTS);
|
||||
|
||||
[3] Only the Debug target is configured properly (that would be easy to
|
||||
fix, but would require turning off some optimizations like omitting
|
||||
stack frames). Anyway there are other issues [1] to fix before switching
|
||||
to Release and IMHO the _biggest_ advantage to VS.NET is it's debugger/
|
||||
debugging tools;
|
||||
|
||||
[4] The C compiler emits _lots_ of warning during compilation. Some
|
||||
warnings have been turned off for some projects (there was so much that
|
||||
it slowed down compilation). You can bring them back (or hide more of
|
||||
them) using the project "properties pages" windows, "Configuration
|
||||
Properties\C/C++\Advanced\Disable Specific Warnings";
|
||||
|
||||
[5] Visual Studio 2005 should have all the latest header files required,
|
||||
but if not (or if you're using an older version of VS) then install MS
|
||||
Platform SDK (Windows Server 2003 is the latest) to ensure you have the
|
||||
latest Windows header files. You can download it from:
|
||||
http://www.microsoft.com/msdownload/platformsdk/sdkupdate/psdk-full.htm
|
||||
|
||||
[6] Not everyone has VS.NET so it is possible you may have to add some
|
||||
(new) files to the build from time to time. See "more informations" for
|
||||
reporting those changes.
|
||||
|
||||
[7] Probably a lot more I didn't discover... or has changed since.
|
||||
|
||||
|
||||
MORE INFORMATION
|
||||
|
||||
Please email <[email protected]> if you have any problem
|
||||
and/or if there's something wrong/missing in the instructions.
|
||||
|
||||
An online version of this file is available at
|
||||
http://www.mono-project.com/Compiling_Mono_VSNET
|
||||
-40
@@ -1,40 +0,0 @@
|
||||
#undef HAVE_INET_PTON
|
||||
#undef HAVE_INET_ATON
|
||||
#undef HAVE_MSG_NOSIGNAL
|
||||
#undef HAVE_SOL_IP
|
||||
#undef HAVE_SOL_TCP
|
||||
#undef HAVE_SOL_IPV6
|
||||
#undef HAVE_IP_PKTINFO
|
||||
#undef HAVE_IPV6_PKTINFO
|
||||
#undef HAVE_IP_DONTFRAGMENT
|
||||
#undef HAVE_IP_MTU_DISCOVER
|
||||
#undef HAVE_STRUCT_IP_MREQN
|
||||
#undef HAVE_STRUCT_IP_MREQ
|
||||
#undef HAVE_PTHREAD_MUTEX_TIMEDLOCK
|
||||
#undef USE_MONO_MUTEX
|
||||
#undef HAVE_LARGE_FILE_SUPPORT
|
||||
#undef HAVE_NEW_ICONV
|
||||
#undef NAME_DEV_RANDOM
|
||||
#undef HAVE_CRYPT_RNG
|
||||
#undef HAVE_BOEHM_GC
|
||||
#undef USE_INCLUDED_LIBGC
|
||||
#undef DISABLE_SHARED_HANDLES
|
||||
#undef HAVE_TIMEZONE
|
||||
#undef HAVE_TM_GMTOFF
|
||||
#undef MONO_SIZEOF_SUNPATH
|
||||
#undef MONO_ZERO_ARRAY_LENGTH
|
||||
#undef PTHREAD_POINTER_ID
|
||||
#undef HAVE_GC_H
|
||||
#undef HAVE_GC_GCJ_MALLOC
|
||||
#undef HAVE_GC_ENABLE
|
||||
#undef WITH_BUNDLE
|
||||
#undef HAVE_GETHOSTBYNAME2_R
|
||||
#undef HAVE_ICU
|
||||
#undef HAVE_KW_THREAD
|
||||
#undef HAVE_SIGNBIT
|
||||
#undef USE_MACH_SEMA
|
||||
#undef HAVE_SOCKLEN_T
|
||||
#undef HAVE_TRUNCL
|
||||
#undef HAVE_AINTL
|
||||
#undef HAVE_SCANDIR
|
||||
#undef HAVE_WORKING_SIGALTSTACK
|
||||
-142
@@ -1,142 +0,0 @@
|
||||
#!/bin/sh
|
||||
# Run this to generate all the initial makefiles, etc.
|
||||
# Ripped off from GNOME macros version
|
||||
|
||||
DIE=0
|
||||
|
||||
srcdir=`dirname $0`
|
||||
test -z "$srcdir" && srcdir=.
|
||||
|
||||
if [ -n "$MONO_PATH" ]; then
|
||||
# from -> /mono/lib:/another/mono/lib
|
||||
# to -> /mono /another/mono
|
||||
for i in `echo ${MONO_PATH} | tr ":" " "`; do
|
||||
i=`dirname ${i}`
|
||||
if [ -n "{i}" -a -d "${i}/share/aclocal" ]; then
|
||||
ACLOCAL_FLAGS="-I ${i}/share/aclocal $ACLOCAL_FLAGS"
|
||||
fi
|
||||
if [ -n "{i}" -a -d "${i}/bin" ]; then
|
||||
PATH="${i}/bin:$PATH"
|
||||
fi
|
||||
done
|
||||
export PATH
|
||||
fi
|
||||
|
||||
(autoconf --version) < /dev/null > /dev/null 2>&1 || {
|
||||
echo
|
||||
echo "**Error**: You must have \`autoconf' installed to compile Mono."
|
||||
echo "Download the appropriate package for your distribution,"
|
||||
echo "or get the source tarball at ftp://ftp.gnu.org/pub/gnu/"
|
||||
DIE=1
|
||||
}
|
||||
|
||||
if [ -z "$LIBTOOL" ]; then
|
||||
LIBTOOL=`which glibtool 2>/dev/null`
|
||||
if [ ! -x "$LIBTOOL" ]; then
|
||||
LIBTOOL=`which libtool`
|
||||
fi
|
||||
fi
|
||||
|
||||
(grep "^AM_PROG_LIBTOOL" $srcdir/configure.in >/dev/null) && {
|
||||
($LIBTOOL --version) < /dev/null > /dev/null 2>&1 || {
|
||||
echo
|
||||
echo "**Error**: You must have \`libtool' installed to compile Mono."
|
||||
echo "Get ftp://ftp.gnu.org/pub/gnu/libtool-1.2d.tar.gz"
|
||||
echo "(or a newer version if it is available)"
|
||||
DIE=1
|
||||
}
|
||||
}
|
||||
|
||||
grep "^AM_GNU_GETTEXT" $srcdir/configure.in >/dev/null && {
|
||||
grep "sed.*POTFILES" $srcdir/configure.in >/dev/null || \
|
||||
(gettext --version) < /dev/null > /dev/null 2>&1 || {
|
||||
echo
|
||||
echo "**Error**: You must have \`gettext' installed to compile Mono."
|
||||
echo "Get ftp://alpha.gnu.org/gnu/gettext-0.10.35.tar.gz"
|
||||
echo "(or a newer version if it is available)"
|
||||
DIE=1
|
||||
}
|
||||
}
|
||||
|
||||
(automake --version) < /dev/null > /dev/null 2>&1 || {
|
||||
echo
|
||||
echo "**Error**: You must have \`automake' installed to compile Mono."
|
||||
echo "Get ftp://ftp.gnu.org/pub/gnu/automake-1.3.tar.gz"
|
||||
echo "(or a newer version if it is available)"
|
||||
DIE=1
|
||||
NO_AUTOMAKE=yes
|
||||
}
|
||||
|
||||
|
||||
# if no automake, don't bother testing for aclocal
|
||||
test -n "$NO_AUTOMAKE" || (aclocal --version) < /dev/null > /dev/null 2>&1 || {
|
||||
echo
|
||||
echo "**Error**: Missing \`aclocal'. The version of \`automake'"
|
||||
echo "installed doesn't appear recent enough."
|
||||
echo "Get ftp://ftp.gnu.org/pub/gnu/automake-1.3.tar.gz"
|
||||
echo "(or a newer version if it is available)"
|
||||
DIE=1
|
||||
}
|
||||
|
||||
if test "$DIE" -eq 1; then
|
||||
exit 1
|
||||
fi
|
||||
|
||||
if test -z "$*"; then
|
||||
echo "**Warning**: I am going to run \`configure' with no arguments."
|
||||
echo "If you wish to pass any to it, please specify them on the"
|
||||
echo \`$0\'" command line."
|
||||
echo
|
||||
fi
|
||||
|
||||
case $CC in
|
||||
xlc )
|
||||
am_opt=--include-deps;;
|
||||
esac
|
||||
|
||||
|
||||
if grep "^AM_PROG_LIBTOOL" configure.in >/dev/null; then
|
||||
if test -z "$NO_LIBTOOLIZE" ; then
|
||||
echo "Running libtoolize..."
|
||||
${LIBTOOL}ize --force --copy
|
||||
fi
|
||||
fi
|
||||
|
||||
echo "Running aclocal $ACLOCAL_FLAGS ..."
|
||||
aclocal $ACLOCAL_FLAGS || {
|
||||
echo
|
||||
echo "**Error**: aclocal failed. This may mean that you have not"
|
||||
echo "installed all of the packages you need, or you may need to"
|
||||
echo "set ACLOCAL_FLAGS to include \"-I \$prefix/share/aclocal\""
|
||||
echo "for the prefix where you installed the packages whose"
|
||||
echo "macros were not found"
|
||||
exit 1
|
||||
}
|
||||
|
||||
if grep "^AM_CONFIG_HEADER" configure.in >/dev/null; then
|
||||
echo "Running autoheader..."
|
||||
autoheader || { echo "**Error**: autoheader failed."; exit 1; }
|
||||
fi
|
||||
|
||||
echo "Running automake --gnu $am_opt ..."
|
||||
automake --add-missing --gnu $am_opt ||
|
||||
{ echo "**Error**: automake failed."; exit 1; }
|
||||
echo "Running autoconf ..."
|
||||
autoconf || { echo "**Error**: autoconf failed."; exit 1; }
|
||||
|
||||
if test -d $srcdir/libgc; then
|
||||
echo Running libgc/autogen.sh ...
|
||||
(cd $srcdir/libgc ; NOCONFIGURE=1 ./autogen.sh "$@")
|
||||
echo Done running libgc/autogen.sh ...
|
||||
fi
|
||||
|
||||
|
||||
conf_flags="--enable-maintainer-mode --enable-compile-warnings" #--enable-iso-c
|
||||
|
||||
if test x$NOCONFIGURE = x; then
|
||||
echo Running $srcdir/configure $conf_flags "$@" ...
|
||||
$srcdir/configure $conf_flags "$@" \
|
||||
&& echo Now type \`make\' to compile $PKG_NAME || exit 1
|
||||
else
|
||||
echo Skipping configure process.
|
||||
fi
|
||||
-2148
File diff suppressed because it is too large.
Load diff
@@ -1,10 +0,0 @@
|
||||
SUBDIRS = net_1_1 net_2_0
|
||||
|
||||
monodir = $(sysconfdir)/mono
|
||||
|
||||
EXTRA_DIST = config.in \
|
||||
browscap.ini mono.supp README
|
||||
|
||||
mono_DATA = config \
|
||||
browscap.ini
|
||||
|
||||
-20
@@ -1,20 +0,0 @@
|
||||
Files in this directory:
|
||||
|
||||
config.in, config:
|
||||
These files are installed into $prefix/etc/mono and
|
||||
contain the global mappings of dllnames into native
|
||||
library names.
|
||||
|
||||
browscap.ini
|
||||
This file contains the browser capabilty database,
|
||||
this is used by ASP.NET to determine in a per-browser
|
||||
basis what kind of features it can depend on when
|
||||
producing the HTML code.
|
||||
|
||||
mono.supp
|
||||
This is a valgrind data file, it lists the warnings
|
||||
that should be supressed when reporting Mono-related
|
||||
errors.
|
||||
|
||||
net_1_1 and net_2_0
|
||||
They contain profile-specific data files
|
||||
-14681
File diff suppressed because it is too large.
Load diff
@@ -1,18 +0,0 @@
|
||||
<configuration>
|
||||
<dllmap dll="cygwin1.dll" target="@LIBC@" os="!windows" />
|
||||
<dllmap dll="libc" target="@LIBC@" os="!windows"/>
|
||||
<dllmap dll="intl" target="@INTL@" os="!windows"/>
|
||||
<dllmap dll="libintl" target="@INTL@" os="!windows"/>
|
||||
<dllmap dll="libxslt.dll" target="libxslt@libsuffix@" os="!windows"/>
|
||||
<dllmap dll="odbc32.dll" target="libodbc@libsuffix@" os="!windows"/>
|
||||
<dllmap os="osx" dll="odbc32.dll" target="libiodbc.dylib" />
|
||||
<dllmap dll="oci" target="libclntsh@libsuffix@" os="!windows"/>
|
||||
<dllmap dll="db2cli" target="libdb2_36@libsuffix@" os="!windows"/>
|
||||
<dllmap dll="MonoPosixHelper" target="libMonoPosixHelper@libsuffix@" os="!windows" />
|
||||
<dllmap dll="msvcrt" target="@LIBC@" os="!windows"/>
|
||||
<dllmap dll="msvcrt.dll" target="@LIBC@" os="!windows"/>
|
||||
<dllmap dll="sqlite" target="@SQLITE@" os="!windows"/>
|
||||
<dllmap dll="sqlite3" target="@SQLITE3@" os="!windows"/>
|
||||
<dllmap dll="libX11" target="@X11@" os="!windows" />
|
||||
<dllmap dll="libcairo-2.dll" target="libcairo.so.2" os="!windows"/>
|
||||
</configuration>
|
||||
@@ -1,40 +0,0 @@
|
||||
##
|
||||
## mono-specific suppressions (Boehm-GC) for use with valgrind
|
||||
##
|
||||
|
||||
{
|
||||
mono - Conditional jump or move depends on uninitialised value
|
||||
Memcheck:Cond
|
||||
fun:GC_*
|
||||
fun:*
|
||||
obj:*mono
|
||||
}
|
||||
{
|
||||
mono - Use of uninitialized value of size 4
|
||||
Memcheck:Value4
|
||||
fun:GC_*
|
||||
fun:*
|
||||
obj:*mono
|
||||
}
|
||||
{
|
||||
mono - Use of uninitialized value of size 8
|
||||
Memcheck:Value8
|
||||
fun:GC_*
|
||||
fun:*
|
||||
obj:*mono
|
||||
}
|
||||
{
|
||||
mono - Use of uninitialized value of size 1
|
||||
Memcheck:Value1
|
||||
fun:GC_*
|
||||
fun:*
|
||||
obj:*mono
|
||||
}
|
||||
{
|
||||
mono - Invalid read of size 4
|
||||
Memcheck:Addr4
|
||||
fun:GC_*
|
||||
fun:*
|
||||
obj:*mono
|
||||
}
|
||||
|
||||
File diff suppressed because it is too large.
Load diff
File diff suppressed because it is too large.
Load diff
@@ -1,8 +0,0 @@
|
||||
monodir = $(sysconfdir)/mono/1.0
|
||||
|
||||
EXTRA_DIST = machine.config \
|
||||
DefaultWsdlHelpGenerator.aspx
|
||||
|
||||
mono_DATA = machine.config \
|
||||
DefaultWsdlHelpGenerator.aspx
|
||||
|
||||
@@ -1,239 +0,0 @@
|
||||
<?xml version="1.0" encoding="utf-8"?>
|
||||
|
||||
<configuration>
|
||||
|
||||
<configSections>
|
||||
<section name="appSettings" type="System.Configuration.NameValueFileSectionHandler, System, Version=1.0.5000.0, Culture=neutral, PublicKeyToken=b77a5c561934e089" />
|
||||
<section name="system.diagnostics" type="System.Diagnostics.DiagnosticsConfigurationHandler, System, Version=1.0.5000.0, Culture=neutral, PublicKeyToken=b77a5c561934e089" />
|
||||
<section name="system.runtime.remoting" type="System.Configuration.IgnoreSectionHandler, System, Version=1.0.5000.0, Culture=neutral, PublicKeyToken=b77a5c561934e089" allowLocation="false"/>
|
||||
<sectionGroup name="system.web">
|
||||
<section name="httpHandlers"
|
||||
type="System.Web.Configuration.HttpHandlersSectionHandler, System.Web, Version=1.0.5000.0, Culture=neutral, PublicKeyToken=b03f5f7f11d50a3a" />
|
||||
<section name="httpModules"
|
||||
type="System.Web.Configuration.HttpModulesConfigurationHandler, System.Web, Version=1.0.5000.0, Culture=neutral, PublicKeyToken=b03f5f7f11d50a3a" />
|
||||
<section name="machineKey"
|
||||
type="System.Web.Configuration.MachineKeyConfigHandler, System.Web, Version=1.0.5000.0, Culture=neutral, PublicKeyToken=b03f5f7f11d50a3a" />
|
||||
<section name="authentication"
|
||||
type="System.Web.Configuration.AuthenticationConfigHandler, System.Web, Version=1.0.5000.0, Culture=neutral, PublicKeyToken=b03f5f7f11d50a3a" />
|
||||
<section name="authorization"
|
||||
type="System.Web.Configuration.AuthorizationConfigHandler, System.Web, Version=1.0.5000.0, Culture=neutral, PublicKeyToken=b03f5f7f11d50a3a" />
|
||||
<section name="globalization"
|
||||
type="System.Web.Configuration.GlobalizationConfigurationHandler, System.Web, Version=1.0.5000.0, Culture=neutral, PublicKeyToken=b03f5f7f11d50a3a" />
|
||||
<section name="sessionState"
|
||||
type="System.Web.SessionState.SessionStateSectionHandler, System.Web, Version=1.0.5000.0, Culture=neutral, PublicKeyToken=b03f5f7f11d50a3a" />
|
||||
<section name="trace"
|
||||
type="System.Web.Configuration.TraceConfigurationHandler, System.Web, Version=1.0.5000.0, Culture=neutral, PublicKeyToken=b03f5f7f11d50a3a" />
|
||||
<section name="webServices"
|
||||
type="System.Web.Services.Configuration.WebServicesConfigurationSectionHandler, System.Web.Services, Version=1.0.5000.0 Culture=neutral, PublicKeyToken=b03f5f7f11d50a3a" />
|
||||
<section name="webControls"
|
||||
type="System.Web.Configuration.WebControlsSectionHandler, System.Web, Version=1.0.5000.0, Culture=neutral, PublicKeyToken=b03f5f7f11d50a3a" />
|
||||
<section name="compilation"
|
||||
type="System.Web.Configuration.CompilationConfigurationHandler, System.Web, Version=1.0.5000.0, Culture=neutral, PublicKeyToken=b03f5f7f11d50a3a" />
|
||||
<section name="httpRuntime"
|
||||
type="System.Web.Configuration.HttpRuntimeConfigurationHandler, System.Web, Version=1.0.5000.0, Culture=neutral, PublicKeyToken=b03f5f7f11d50a3a" />
|
||||
<section name="customErrors"
|
||||
type="System.Web.Configuration.CustomErrorsConfigHandler, System.Web, Version=1.0.5000.0, Culture=neutral, PublicKeyToken=b03f5f7f11d50a3a" />
|
||||
<section name="pages"
|
||||
type="System.Web.Configuration.PagesConfigurationHandler, System.Web, Version=1.0.5000.0, Culture=neutral" />
|
||||
<section name="clientTarget"
|
||||
type="System.Web.Configuration.ClientTargetSectionHandler, System.Web, Version=1.0.5000.0, Culture=neutral" />
|
||||
</sectionGroup>
|
||||
<sectionGroup name="system.net">
|
||||
<section name="settings"
|
||||
type="System.Net.Configuration.NetConfigurationHandler, System, Version=1.0.5000.0, Culture=neutral, PublicKeyToken=b77a5c561934e089" />
|
||||
<section name="connectionManagement"
|
||||
type="System.Net.Configuration.ConnectionManagementHandler, System, Version=1.0.5000.0, Culture=neutral, PublicKeyToken=b77a5c561934e089" />
|
||||
<section name="authenticationModules"
|
||||
type="System.Net.Configuration.NetAuthenticationModuleHandler, System, Version=1.0.5000.0, Culture=neutral, PublicKeyToken=b77a5c561934e089" />
|
||||
<section name="defaultProxy"
|
||||
type="System.Net.Configuration.DefaultProxyHandler, System, Version=1.0.5000.0, Culture=neutral, PublicKeyToken=b77a5c561934e089" />
|
||||
<section name="webRequestModules"
|
||||
type="System.Net.Configuration.WebRequestModuleHandler, System, Version=1.0.5000.0, Culture=neutral, PublicKeyToken=b77a5c561934e089" />
|
||||
</sectionGroup>
|
||||
<section name="system.drawing" type="System.Configuration.NameValueSectionHandler, System, Version=1.0.5000.0, Culture=neutral, PublicKeyToken=b77a5c561934e089" />
|
||||
</configSections>
|
||||
<system.net>
|
||||
<connectionManagement>
|
||||
<add address="*" maxconnection="2" />
|
||||
</connectionManagement>
|
||||
<authenticationModules>
|
||||
<add type="System.Net.BasicClient, System, Version=1.0.5000.0, Culture=neutral, PublicKeyToken=b77a5c561934e089" />
|
||||
<add type="System.Net.DigestClient, System, Version=1.0.5000.0, Culture=neutral, PublicKeyToken=b77a5c561934e089" />
|
||||
<add type="System.Net.NtlmClient, System, Version=1.0.5000.0, Culture=neutral, PublicKeyToken=b77a5c561934e089" />
|
||||
</authenticationModules>
|
||||
<defaultProxy>
|
||||
<proxy
|
||||
usesystemdefault = "true"
|
||||
bypassonlocal = "true"
|
||||
/>
|
||||
<!-- proxyaddress can also be set -->
|
||||
</defaultProxy>
|
||||
<webRequestModules>
|
||||
<add prefix="http" type="System.Net.HttpRequestCreator, System, Version=1.0.5000.0, Culture=neutral, PublicKeyToken=b77a5c561934e089" />
|
||||
<add prefix="https" type="System.Net.HttpRequestCreator, System, Version=1.0.5000.0, Culture=neutral, PublicKeyToken=b77a5c561934e089" />
|
||||
<add prefix="file" type="System.Net.FileWebRequestCreator, System, Version=1.0.5000.0, Culture=neutral, PublicKeyToken=b77a5c561934e089" />
|
||||
</webRequestModules>
|
||||
<settings>
|
||||
<ipv6 enabled="false"/>
|
||||
</settings>
|
||||
</system.net>
|
||||
<system.web>
|
||||
<httpHandlers>
|
||||
<add verb="*" path="Trace.axd" type="System.Web.Handlers.TraceHandler, System.Web, Version=1.0.5000.0, Culture=neutral, PublicKeyToken=b03f5f7f11d50a3a" />
|
||||
<add verb="*" path="*.aspx" type="System.Web.UI.PageHandlerFactory, System.Web, Version=1.0.5000.0, Culture=neutral, PublicKeyToken=b03f5f7f11d50a3a" />
|
||||
<add verb="*" path="*.asmx" validate="false" type="System.Web.Services.Protocols.WebServiceHandlerFactory, System.Web.Services, Version=1.0.5000.0, Culture=neutral, PublicKeyToken=b03f5f7f11d50a3a" />
|
||||
<add verb="*" path="*.ashx" type="System.Web.UI.SimpleHandlerFactory, System.Web, Version=1.0.5000.0, Culture=neutral, PublicKeyToken=b03f5f7f11d50a3a" />
|
||||
<add verb="GET" path="WebResource.axd" type="System.Web.Handlers.AssemblyResourceLoader, System.Web, Version=1.0.5000.0, Culture=neutral, PublicKeyToken=b03f5f7f11d50a3a" />
|
||||
<add verb="*" path="*.asax" type="System.Web.HttpForbiddenHandler, System.Web, Version=1.0.5000.0, Culture=neutral, PublicKeyToken=b03f5f7f11d50a3a" />
|
||||
<add verb="*" path="*.ascx" type="System.Web.HttpForbiddenHandler, System.Web, Version=1.0.5000.0, Culture=neutral, PublicKeyToken=b03f5f7f11d50a3a" />
|
||||
<add verb="*" path="*.config" type="System.Web.HttpForbiddenHandler, System.Web, Version=1.0.5000.0, Culture=neutral, PublicKeyToken=b03f5f7f11d50a3a" />
|
||||
<add verb="*" path="*.Config" type="System.Web.HttpForbiddenHandler, System.Web, Version=1.0.5000.0, Culture=neutral, PublicKeyToken=b03f5f7f11d50a3a" />
|
||||
<add verb="*" path="*.cs" type="System.Web.HttpForbiddenHandler, System.Web, Version=1.0.5000.0, Culture=neutral, PublicKeyToken=b03f5f7f11d50a3a" />
|
||||
<add verb="*" path="*.dll" type="System.Web.HttpForbiddenHandler, System.Web, Version=1.0.5000.0, Culture=neutral, PublicKeyToken=b03f5f7f11d50a3a" />
|
||||
<add verb="*" path="*.rem" type="System.Runtime.Remoting.Channels.Http.HttpRemotingHandlerFactory, System.Runtime.Remoting, Culture=neutral, PublicKeyToken=b77a5c561934e089" validate="false" />
|
||||
<add verb="*" path="*.soap" type="System.Runtime.Remoting.Channels.Http.HttpRemotingHandlerFactory, System.Runtime.Remoting, Culture=neutral, PublicKeyToken=b77a5c561934e089" validate="false" />
|
||||
<add verb="GET,HEAD" path="*" type="System.Web.StaticFileHandler, System.Web, Version=1.0.5000.0, Culture=neutral, PublicKeyToken=b03f5f7f11d50a3a" />
|
||||
<add verb="*" path="*" type="System.Web.HttpMethodNotAllowedHandler, System.Web, Version=1.0.5000.0, Culture=neutral, PublicKeyToken=b03f5f7f11d50a3a" />
|
||||
</httpHandlers>
|
||||
<httpModules>
|
||||
<add name="FormsAuthentication" type="System.Web.Security.FormsAuthenticationModule, System.Web, Version=1.0.5000.0, Culture=neutral, PublicKeyToken=b03f5f7f11d50a3a" />
|
||||
<add name="UrlAuthorization" type="System.Web.Security.UrlAuthorizationModule, System.Web, Version=1.0.5000.0, Culture=neutral, PublicKeyToken=b03f5f7f11d50a3a" />
|
||||
<add name="Session" type="System.Web.SessionState.SessionStateModule, System.Web, Version=1.0.5000.0, Culture=neutral, PublicKeyToken=b03f5f7f11d50a3a" />
|
||||
<add name="OutputCache" type="System.Web.Caching.OutputCacheModule, System.Web, Version=1.0.5000.0, Culture=neutral, PublicKeyToken=b03f5f7f11d50a3a" />
|
||||
</httpModules>
|
||||
<authentication mode="Forms">
|
||||
<forms name=".MONOAUTH" loginUrl="login.aspx" protection="All" timeout="30" path="/">
|
||||
<credentials passwordFormat="Clear">
|
||||
<!--<user name="gonzalo" password="gonz"/>-->
|
||||
</credentials>
|
||||
</forms>
|
||||
</authentication>
|
||||
<machineKey validationKey="AutoGenerate" decryptionKey="AutoGenerate" validation="SHA1" />
|
||||
<globalization requestEncoding="utf-8"
|
||||
responseEncoding="utf-8"
|
||||
fileEncoding="utf-8"/>
|
||||
<!--
|
||||
culture="en-US"
|
||||
uiculture="en-US" />
|
||||
-->
|
||||
<sessionState mode="InProc" />
|
||||
<webServices>
|
||||
<protocols>
|
||||
<add name="HttpSoap"/>
|
||||
<add name="HttpPost"/>
|
||||
<add name="HttpGet"/>
|
||||
<add name="Documentation"/>
|
||||
</protocols>
|
||||
<wsdlHelpGenerator href="DefaultWsdlHelpGenerator.aspx" />
|
||||
</webServices>
|
||||
<webControls clientScriptsLocation="/web_scripts" />
|
||||
<compilation debug="false" defaultLanguage="c#" explicit="true" strict="false" >
|
||||
<compilers>
|
||||
<compiler language="cs;c#;csharp" extension=".cs" warningLevel="1" compilerOptions=""
|
||||
type="Microsoft.CSharp.CSharpCodeProvider, System, Version=1.0.5000.0, Culture=neutral, PublicKeyToken=b77a5c561934e089" />
|
||||
<compiler language="vb;vbs;visualbasic;vbscript" extension=".vb"
|
||||
warningLevel="1" compilerOptions=""
|
||||
type="Microsoft.VisualBasic.VBCodeProvider, System, Version=1.0.5000.0, Culture=neutral, PublicKeyToken=b77a5c561934e089" />
|
||||
</compilers>
|
||||
<assemblies>
|
||||
<!--<add assembly="mscorlib" /> -->
|
||||
<add assembly="System" />
|
||||
<add assembly="System.Xml" />
|
||||
<add assembly="System.Data" />
|
||||
<add assembly="System.Web" />
|
||||
<add assembly="System.Web.Services" />
|
||||
<add assembly="System.Drawing" />
|
||||
<add assembly="*" /> <!-- Add assemblies in bin directory -->
|
||||
</assemblies>
|
||||
</compilation>
|
||||
<!--
|
||||
RequestLengthDiskThreshold is a 2.0 feature that we
|
||||
enable for 1.x too.
|
||||
-->
|
||||
<httpRuntime executionTimeout="90"
|
||||
maxRequestLength="4096"
|
||||
requestLengthDiskThreshold="256"
|
||||
useFullyQualifiedRedirectUrl="false"
|
||||
minFreeThreads="8"
|
||||
minLocalRequestFreeThreads="4"
|
||||
appRequestQueueLimit="100" />
|
||||
<pages buffer="true"
|
||||
enableSessionState="true"
|
||||
autoEventWireup="true"
|
||||
validateRequest="true" />
|
||||
<clientTarget>
|
||||
<add alias="ie5" userAgent="Mozilla/4.0 (compatible; MSIE 5.5; Windows NT 4.0)" />
|
||||
<add alias="ie4" userAgent="Mozilla/4.0 (compatible; MSIE 4.0; Windows NT 4.0)" />
|
||||
<add alias="uplevel" userAgent="Mozilla/4.0 (compatible; MSIE 4.0; Windows NT 4.0)" />
|
||||
<add alias="downlevel" userAgent="Unknown" />
|
||||
</clientTarget>
|
||||
</system.web>
|
||||
|
||||
<system.runtime.remoting>
|
||||
<application>
|
||||
<channels>
|
||||
<channel ref="http client" displayName="http client (delay loaded)" delayLoadAsClientChannel="true" />
|
||||
<channel ref="tcp client" displayName="tcp client (delay loaded)" delayLoadAsClientChannel="true" />
|
||||
</channels>
|
||||
</application>
|
||||
<channels>
|
||||
<channel id="http" type="System.Runtime.Remoting.Channels.Http.HttpChannel, System.Runtime.Remoting, Version=1.0.5000.0, Culture=neutral, PublicKeyToken=b77a5c561934e089" />
|
||||
<channel id="http client" type="System.Runtime.Remoting.Channels.Http.HttpClientChannel, System.Runtime.Remoting, Version=1.0.5000.0, Culture=neutral, PublicKeyToken=b77a5c561934e089" />
|
||||
<channel id="http server" type="System.Runtime.Remoting.Channels.Http.HttpServerChannel, System.Runtime.Remoting, Version=1.0.5000.0, Culture=neutral, PublicKeyToken=b77a5c561934e089" />
|
||||
<channel id="tcp" type="System.Runtime.Remoting.Channels.Tcp.TcpChannel, System.Runtime.Remoting, Version=1.0.5000.0, Culture=neutral, PublicKeyToken=b77a5c561934e089" />
|
||||
<channel id="tcp client" type="System.Runtime.Remoting.Channels.Tcp.TcpClientChannel, System.Runtime.Remoting, Version=1.0.5000.0, Culture=neutral, PublicKeyToken=b77a5c561934e089" />
|
||||
<channel id="tcp server" type="System.Runtime.Remoting.Channels.Tcp.TcpServerChannel, System.Runtime.Remoting, Version=1.0.5000.0, Culture=neutral, PublicKeyToken=b77a5c561934e089" />
|
||||
</channels>
|
||||
<channelSinkProviders>
|
||||
<clientProviders>
|
||||
<formatter id="soap" type="System.Runtime.Remoting.Channels.SoapClientFormatterSinkProvider, System.Runtime.Remoting, Version=1.0.5000.0, Culture=neutral, PublicKeyToken=b77a5c561934e089" />
|
||||
<formatter id="binary" type="System.Runtime.Remoting.Channels.BinaryClientFormatterSinkProvider, System.Runtime.Remoting, Version=1.0.5000.0, Culture=neutral, PublicKeyToken=b77a5c561934e089" />
|
||||
</clientProviders>
|
||||
<serverProviders>
|
||||
<formatter id="soap" type="System.Runtime.Remoting.Channels.SoapServerFormatterSinkProvider, System.Runtime.Remoting, Version=1.0.5000.0, Culture=neutral, PublicKeyToken=b77a5c561934e089" />
|
||||
<formatter id="binary" type="System.Runtime.Remoting.Channels.BinaryServerFormatterSinkProvider, System.Runtime.Remoting, Version=1.0.5000.0, Culture=neutral, PublicKeyToken=b77a5c561934e089" />
|
||||
<provider id="wsdl" type="System.Runtime.Remoting.MetadataServices.SdlChannelSinkProvider, System.Runtime.Remoting, Version=1.0.5000.0, Culture=neutral, PublicKeyToken=b77a5c561934e089" />
|
||||
</serverProviders>
|
||||
</channelSinkProviders>
|
||||
</system.runtime.remoting>
|
||||
|
||||
<appSettings>
|
||||
<!--<add key="yourkey" value="your value" /> -->
|
||||
<!--<remove key="a key defined higher in the hierarchy" /> -->
|
||||
<!--<clear/> Removes all defined settings -->
|
||||
</appSettings>
|
||||
<system.diagnostics>
|
||||
<trace autoflush="false" indentsize="4" />
|
||||
</system.diagnostics>
|
||||
<system.drawing>
|
||||
</system.drawing>
|
||||
|
||||
<mscorlib>
|
||||
<cryptographySettings>
|
||||
<cryptoNameMapping>
|
||||
<cryptoClasses>
|
||||
<cryptoClass monoMD2="Mono.Security.Cryptography.MD2Managed, Mono.Security, Version=1.0.5000.0, Culture=neutral, PublicKeyToken=0738eb9f132ed756" />
|
||||
</cryptoClasses>
|
||||
<nameEntry name="MD2" class="monoMD2" />
|
||||
</cryptoNameMapping>
|
||||
<oidMap>
|
||||
<oidEntry OID="1.2.840.113549.2.2" name="MD2" />
|
||||
</oidMap>
|
||||
</cryptographySettings>
|
||||
</mscorlib>
|
||||
|
||||
<strongNames>
|
||||
<pubTokenMapping>
|
||||
<!-- ECMA key -->
|
||||
<map Token="b77a5c561934e089" PublicKey="002400000480000094000000060200000024000052534131000400000100010079159977d2d03a8e6bea7a2e74e8d1afcc93e8851974952bb480a12c9134474d04062447c37e0e68c080536fcf3c3fbe2ff9c979ce998475e506e8ce82dd5b0f350dc10e93bf2eeecf874b24770c5081dbea7447fddafa277b22de47d6ffea449674a4f9fccf84d15069089380284dbdd35f46cdff12a1bd78e4ef0065d016df" />
|
||||
<!-- Microsoft (final) key -->
|
||||
<map Token="b03f5f7f11d50a3a" PublicKey="002400000480000094000000060200000024000052534131000400000100010079159977d2d03a8e6bea7a2e74e8d1afcc93e8851974952bb480a12c9134474d04062447c37e0e68c080536fcf3c3fbe2ff9c979ce998475e506e8ce82dd5b0f350dc10e93bf2eeecf874b24770c5081dbea7447fddafa277b22de47d6ffea449674a4f9fccf84d15069089380284dbdd35f46cdff12a1bd78e4ef0065d016df" />
|
||||
<!-- Microsoft (Web Service Enhancement) key -->
|
||||
<map Token="31bf3856ad364e35" PublicKey="002400000480000094000000060200000024000052534131000400000100010079159977d2d03a8e6bea7a2e74e8d1afcc93e8851974952bb480a12c9134474d04062447c37e0e68c080536fcf3c3fbe2ff9c979ce998475e506e8ce82dd5b0f350dc10e93bf2eeecf874b24770c5081dbea7447fddafa277b22de47d6ffea449674a4f9fccf84d15069089380284dbdd35f46cdff12a1bd78e4ef0065d016df" />
|
||||
<!-- IBM (DB2 Data Provider) key -->
|
||||
<map Token="7c307b91aa13d208" PublicKey="002400000480000094000000060200000024000052534131000400000100010079159977d2d03a8e6bea7a2e74e8d1afcc93e8851974952bb480a12c9134474d04062447c37e0e68c080536fcf3c3fbe2ff9c979ce998475e506e8ce82dd5b0f350dc10e93bf2eeecf874b24770c5081dbea7447fddafa277b22de47d6ffea449674a4f9fccf84d15069089380284dbdd35f46cdff12a1bd78e4ef0065d016df" />
|
||||
</pubTokenMapping>
|
||||
</strongNames>
|
||||
</configuration>
|
||||
|
||||
|
||||
File diff suppressed because it is too large.
Load diff
File diff suppressed because it is too large.
Load diff
@@ -1,10 +0,0 @@
|
||||
monodir = $(sysconfdir)/mono/2.0
|
||||
|
||||
EXTRA_DIST = machine.config \
|
||||
web.config \
|
||||
DefaultWsdlHelpGenerator.aspx
|
||||
|
||||
mono_DATA = machine.config \
|
||||
web.config \
|
||||
DefaultWsdlHelpGenerator.aspx
|
||||
|
||||
@@ -1,188 +0,0 @@
|
||||
<?xml version="1.0" encoding="utf-8"?>
|
||||
|
||||
<configuration>
|
||||
|
||||
<configSections>
|
||||
<section name="configProtectedData" type="System.Configuration.ProtectedConfigurationSection, System.Configuration, Version=2.0.0.0, Culture=neutral, PublicKeyToken=b03f5f7f11d50a3a" />
|
||||
<section name="appSettings" type="System.Configuration.AppSettingsSection, System.Configuration, Version=2.0.0.0, Culture=neutral, PublicKeyToken=b03f5f7f11d50a3a" />
|
||||
<section name="connectionStrings" type="System.Configuration.ConnectionStringsSection, System.Configuration, Version=2.0.0.0, Culture=neutral, PublicKeyToken=b03f5f7f11d50a3a" />
|
||||
<section name="mscorlib" type="System.Configuration.IgnoreSection, System.Configuration, Version=2.0.0.0, Culture=neutral, PublicKeyToken=b03f5f7f11d50a3a" />
|
||||
<section name="runtime" type="System.Configuration.IgnoreSection, System.Configuration, Version=2.0.0.0, Culture=neutral, PublicKeyToken=b03f5f7f11d50a3a" />
|
||||
<section name="startup" type="System.Configuration.IgnoreSection, System.Configuration, Version=2.0.0.0, Culture=neutral, PublicKeyToken=b03f5f7f11d50a3a" />
|
||||
<section name="system.codedom" type="System.CodeDom.Compiler.CodeDomConfigurationHandler, System, Version=2.0.0.0, Culture=neutral, PublicKeyToken=b77a5c561934e089" />
|
||||
<section name="system.data" type="System.Data.Common.DbProviderFactoriesConfigurationHandler, System.Data, Version=2.0.0.0, Culture=neutral, PublicKeyToken=b77a5c561934e089" />
|
||||
<section name="system.diagnostics" type="System.Diagnostics.DiagnosticsConfigurationHandler, System, Version=2.0.0.0, Culture=neutral, PublicKeyToken=b77a5c561934e089" />
|
||||
<section name="system.runtime.remoting" type="System.Configuration.IgnoreSection, System.Configuration, Version=2.0.0.0, Culture=neutral, PublicKeyToken=b77a5c561934e089" allowLocation="false"/>
|
||||
<section name="strongNames" type="System.Configuration.IgnoreSection, System.Configuration, Version=2.0.0.0, Culture=neutral, PublicKeyToken=b77a5c561934e089" allowLocation="false"/>
|
||||
<sectionGroup name="system.web" type="System.Web.Configuration.SystemWebSectionGroup, System.Web, Version=2.0.0.0, Culture=neutral, PublicKeyToken=b03f5f7f11d50a3a">
|
||||
<section name="anonymousIdentification" type="System.Web.Configuration.AnonymousIdentificationSection, System.Web, Version=2.0.0.0, Culture=neutral, PublicKeyToken=b03f5f7f11d50a3a" />
|
||||
<section name="authentication" type="System.Web.Configuration.AuthenticationSection, System.Web, Version=2.0.0.0, Culture=neutral, PublicKeyToken=b03f5f7f11d50a3a" />
|
||||
<section name="authorization" type="System.Web.Configuration.AuthorizationSection, System.Web, Version=2.0.0.0, Culture=neutral, PublicKeyToken=b03f5f7f11d50a3a" />
|
||||
<section name="clientTarget" type="System.Web.Configuration.ClientTargetSection, System.Web, Version=2.0.0.0, Culture=neutral, PublicKeyToken=b03f5f7f11d50a3a" />
|
||||
<section name="compilation" type="System.Web.Configuration.CompilationSection, System.Web, Version=2.0.0.0, Culture=neutral, PublicKeyToken=b03f5f7f11d50a3a" />
|
||||
<section name="customErrors" type="System.Web.Configuration.CustomErrorsSection, System.Web, Version=2.0.0.0, Culture=neutral, PublicKeyToken=b03f5f7f11d50a3a" />
|
||||
<section name="globalization" type="System.Web.Configuration.GlobalizationSection, System.Web, Version=2.0.0.0, Culture=neutral, PublicKeyToken=b03f5f7f11d50a3a" />
|
||||
<section name="httpHandlers" type="System.Web.Configuration.HttpHandlersSection, System.Web, Version=2.0.0.0, Culture=neutral, PublicKeyToken=b03f5f7f11d50a3a" />
|
||||
<section name="httpModules" type="System.Web.Configuration.HttpModulesSection, System.Web, Version=2.0.0.0, Culture=neutral, PublicKeyToken=b03f5f7f11d50a3a" />
|
||||
<section name="httpRuntime" type="System.Web.Configuration.HttpRuntimeSection, System.Web, Version=2.0.0.0, Culture=neutral, PublicKeyToken=b03f5f7f11d50a3a" />
|
||||
<section name="machineKey" type="System.Web.Configuration.MachineKeySection, System.Web, Version=2.0.0.0, Culture=neutral, PublicKeyToken=b03f5f7f11d50a3a" />
|
||||
<section name="membership" type="System.Web.Configuration.MembershipSection, System.Web, Version=2.0.0.0, Culture=neutral, PublicKeyToken=b03f5f7f11d50a3a" />
|
||||
<section name="pages" type="System.Web.Configuration.PagesSection, System.Web, Version=2.0.0.0, Culture=neutral, PublicKeyToken=b03f5f7f11d50a3a" />
|
||||
<section name="profile" type="System.Web.Configuration.ProfileSection, System.Web, Version=2.0.0.0, Culture=neutral, PublicKeyToken=b03f5f7f11d50a3a" />
|
||||
<section name="roleManager" type="System.Web.Configuration.RoleManagerSection, System.Web, Version=2.0.0.0, Culture=neutral, PublicKeyToken=b03f5f7f11d50a3a" />
|
||||
<section name="sessionState" type="System.Web.Configuration.SessionStateSection, System.Web, Version=2.0.0.0, Culture=neutral, PublicKeyToken=b03f5f7f11d50a3a" />
|
||||
<section name="siteMap" type="System.Web.Configuration.SiteMapSection, System.Web, Version=2.0.0.0, Culture=neutral, PublicKeyToken=b03f5f7f11d50a3a" />
|
||||
<section name="trace" type="System.Web.Configuration.TraceSection, System.Web, Version=2.0.0.0, Culture=neutral, PublicKeyToken=b03f5f7f11d50a3a" />
|
||||
<section name="webControls" type="System.Web.Configuration.WebControlsSection, System.Web, Version=2.0.0.0, Culture=neutral, PublicKeyToken=b03f5f7f11d50a3a" />
|
||||
<section name="webServices" type="System.Web.Services.Configuration.WebServicesSection, System.Web.Services, Version=2.0.0.0, Culture=neutral, PublicKeyToken=b03f5f7f11d50a3a" />
|
||||
<section name="xhtmlConformance" type="System.Web.Services.Configuration.XhtmlConformanceSection, System.Web.Services, Version=2.0.0.0, Culture=neutral, PublicKeyToken=b03f5f7f11d50a3a" />
|
||||
<sectionGroup name="caching" type="System.Web.Configuration.SystemWebCachingSectionGroup, System.Web, Version=2.0.0.0, Culture=neutral, PublicKeyToken=b03f5f7f11d50a3a">
|
||||
<section name="cache" type="System.Web.Configuration.CacheSection, System.Web, Version=2.0.0.0, Culture=neutral, PublicKeyToken=b03f5f7f11d50a3a" />
|
||||
<section name="outputCache" type="System.Web.Configuration.OutputCacheSection, System.Web, Version=2.0.0.0, Culture=neutral, PublicKeyToken=b03f5f7f11d50a3a" />
|
||||
<section name="outputCacheSettings" type="System.Web.Configuration.OutputCacheSettingsSection, System.Web, Version=2.0.0.0, Culture=neutral, PublicKeyToken=b03f5f7f11d50a3a" />
|
||||
<section name="sqlCacheDependency" type="System.Web.Configuration.OutputCacheSettingsSection, System.Web, Version=2.0.0.0, Culture=neutral, PublicKeyToken=b03f5f7f11d50a3a" />
|
||||
</sectionGroup>
|
||||
</sectionGroup>
|
||||
<sectionGroup name="system.net" type="System.Net.Configuration.NetSectionGroup, System, Version=2.0.0.0, Culture=neutral, PublicKeyToken=b77a5c561934e089">
|
||||
<section name="authenticationModules" type="System.Net.Configuration.AuthenticationModulesSection, System, Version=2.0.0.0, Culture=neutral, PublicKeyToken=b77a5c561934e089" />
|
||||
<section name="connectionManagement" type="System.Net.Configuration.ConnectionManagementSection, System, Version=2.0.0.0, Culture=neutral, PublicKeyToken=b77a5c561934e089" />
|
||||
<section name="defaultProxy" type="System.Net.Configuration.DefaultProxySection, System, Version=2.0.0.0, Culture=neutral, PublicKeyToken=b77a5c561934e089" />
|
||||
<sectionGroup name="mailSettings" type="System.Net.Configuration.MailSettingsSectionGroup, System, Version=2.0.0.0, Culture=neutral, PublicKeyToken=b77a5c561934e089">
|
||||
<section name="smtp" type="System.Net.Configuration.SmtpSection, System, Version=2.0.0.0, Culture=neutral, PublicKeyToken=b77a5c561934e089" />
|
||||
</sectionGroup>
|
||||
<section name="requestCaching" type="System.Net.Configuration.RequestCachingSection, System, Version=2.0.0.0, Culture=neutral, PublicKeyToken=b77a5c561934e089" />
|
||||
<section name="settings" type="System.Net.Configuration.SettingsSection, System, Version=2.0.0.0, Culture=neutral, PublicKeyToken=b77a5c561934e089" />
|
||||
<section name="webRequestModules" type="System.Net.Configuration.WebRequestModulesSection, System, Version=2.0.0.0, Culture=neutral, PublicKeyToken=b77a5c561934e089" />
|
||||
</sectionGroup>
|
||||
<section name="system.drawing" type="System.Configuration.NameValueSectionHandler, System, Version=2.0.0.0, Culture=neutral, PublicKeyToken=b77a5c561934e089" />
|
||||
</configSections>
|
||||
|
||||
<connectionStrings>
|
||||
<add name="LocalSqlServer" connectionString="Data Source=|DataDirectory|/aspnetdb.sqlite;create=true;version=3" providerName="Mono.Data.SqliteClient"/>
|
||||
</connectionStrings>
|
||||
|
||||
<configProtectedData defaultProvider="RsaProtectedConfigurationProvider">
|
||||
<providers>
|
||||
<add name="RsaProtectedConfigurationProvider" type="System.Configuration.RsaProtectedConfigurationProvider, System.Configuration, Version=2.0.0.0, Culture=neutral, PublicKeyToken=b03f5f7f11d50a3a"
|
||||
description="" keyContainerName="MonoFrameworkConfigurationKey" cspProviderName="" useMachineContainer="true" useOAEP="false" />
|
||||
<add name="DataProtectionConfigurationProvider" type="System.Configuration.DpapiProtectedConfigurationProvider, System.Configuration, Version=2.0.0.0, Culture=neutral, PublicKeyToken=b03f5f7f11d50a3a"
|
||||
description="" useMachineProtection="true" keyEntropy="" />
|
||||
</providers>
|
||||
</configProtectedData>
|
||||
|
||||
<system.net>
|
||||
<connectionManagement>
|
||||
<add address="*" maxconnection="2" />
|
||||
</connectionManagement>
|
||||
<authenticationModules>
|
||||
<add type="System.Net.BasicClient, System, Version=2.0.0.0, Culture=neutral, PublicKeyToken=b77a5c561934e089" />
|
||||
<add type="System.Net.DigestClient, System, Version=2.0.0.0, Culture=neutral, PublicKeyToken=b77a5c561934e089" />
|
||||
<add type="System.Net.NtlmClient, System, Version=2.0.0.0, Culture=neutral, PublicKeyToken=b77a5c561934e089" />
|
||||
</authenticationModules>
|
||||
<webRequestModules>
|
||||
<add prefix="http" type="System.Net.HttpRequestCreator, System, Version=2.0.0.0, Culture=neutral, PublicKeyToken=b77a5c561934e089" />
|
||||
<add prefix="https" type="System.Net.HttpRequestCreator, System, Version=2.0.0.0, Culture=neutral, PublicKeyToken=b77a5c561934e089" />
|
||||
<add prefix="file" type="System.Net.FileWebRequestCreator, System, Version=2.0.0.0, Culture=neutral, PublicKeyToken=b77a5c561934e089" />
|
||||
<add prefix="ftp" type="System.Net.FtpRequestCreator, System, Version=2.0.0.0, Culture=neutral, PublicKeyToken=b77a5c561934e089" />
|
||||
</webRequestModules>
|
||||
<settings>
|
||||
<ipv6 enabled="false"/>
|
||||
</settings>
|
||||
</system.net>
|
||||
|
||||
<system.runtime.remoting>
|
||||
<application>
|
||||
<channels>
|
||||
<channel ref="http client" displayName="http client (delay loaded)" delayLoadAsClientChannel="true" />
|
||||
<channel ref="tcp client" displayName="tcp client (delay loaded)" delayLoadAsClientChannel="true" />
|
||||
<channel ref="ipc client" displayName="ipc client (delay loaded)" delayLoadAsClientChannel="true" />
|
||||
</channels>
|
||||
</application>
|
||||
<channels>
|
||||
<channel id="http" type="System.Runtime.Remoting.Channels.Http.HttpChannel, System.Runtime.Remoting, Version=2.0.0.0, Culture=neutral, PublicKeyToken=b77a5c561934e089" />
|
||||
<channel id="http client" type="System.Runtime.Remoting.Channels.Http.HttpClientChannel, System.Runtime.Remoting, Version=2.0.0.0, Culture=neutral, PublicKeyToken=b77a5c561934e089" />
|
||||
<channel id="http server" type="System.Runtime.Remoting.Channels.Http.HttpServerChannel, System.Runtime.Remoting, Version=2.0.0.0, Culture=neutral, PublicKeyToken=b77a5c561934e089" />
|
||||
<channel id="tcp" type="System.Runtime.Remoting.Channels.Tcp.TcpChannel, System.Runtime.Remoting, Version=2.0.0.0, Culture=neutral, PublicKeyToken=b77a5c561934e089" />
|
||||
<channel id="tcp client" type="System.Runtime.Remoting.Channels.Tcp.TcpClientChannel, System.Runtime.Remoting, Version=2.0.0.0, Culture=neutral, PublicKeyToken=b77a5c561934e089" />
|
||||
<channel id="tcp server" type="System.Runtime.Remoting.Channels.Tcp.TcpServerChannel, System.Runtime.Remoting, Version=2.0.0.0, Culture=neutral, PublicKeyToken=b77a5c561934e089" />
|
||||
<channel id="ipc" type="System.Runtime.Remoting.Channels.Ipc.IpcChannel, System.Runtime.Remoting, Version=2.0.0.0, Culture=neutral, PublicKeyToken=b77a5c561934e089" />
|
||||
<channel id="ipc client" type="System.Runtime.Remoting.Channels.Ipc.IpcClientChannel, System.Runtime.Remoting, Version=2.0.0.0, Culture=neutral, PublicKeyToken=b77a5c561934e089" />
|
||||
<channel id="ipc server" type="System.Runtime.Remoting.Channels.Ipc.IpcServerChannel, System.Runtime.Remoting, Version=2.0.0.0, Culture=neutral, PublicKeyToken=b77a5c561934e089" />
|
||||
</channels>
|
||||
<channelSinkProviders>
|
||||
<clientProviders>
|
||||
<formatter id="soap" type="System.Runtime.Remoting.Channels.SoapClientFormatterSinkProvider, System.Runtime.Remoting, Version=2.0.0.0, Culture=neutral, PublicKeyToken=b77a5c561934e089" />
|
||||
<formatter id="binary" type="System.Runtime.Remoting.Channels.BinaryClientFormatterSinkProvider, System.Runtime.Remoting, Version=2.0.0.0, Culture=neutral, PublicKeyToken=b77a5c561934e089" />
|
||||
</clientProviders>
|
||||
<serverProviders>
|
||||
<formatter id="soap" type="System.Runtime.Remoting.Channels.SoapServerFormatterSinkProvider, System.Runtime.Remoting, Version=2.0.0.0, Culture=neutral, PublicKeyToken=b77a5c561934e089" />
|
||||
<formatter id="binary" type="System.Runtime.Remoting.Channels.BinaryServerFormatterSinkProvider, System.Runtime.Remoting, Version=2.0.0.0, Culture=neutral, PublicKeyToken=b77a5c561934e089" />
|
||||
<provider id="wsdl" type="System.Runtime.Remoting.MetadataServices.SdlChannelSinkProvider, System.Runtime.Remoting, Version=2.0.0.0, Culture=neutral, PublicKeyToken=b77a5c561934e089" />
|
||||
</serverProviders>
|
||||
</channelSinkProviders>
|
||||
</system.runtime.remoting>
|
||||
|
||||
<appSettings>
|
||||
<!--<add key="yourkey" value="your value" /> -->
|
||||
<!--<remove key="a key defined higher in the hierarchy" /> -->
|
||||
<!--<clear/> Removes all defined settings -->
|
||||
</appSettings>
|
||||
<system.diagnostics>
|
||||
<trace autoflush="false" indentsize="4" />
|
||||
</system.diagnostics>
|
||||
<system.drawing>
|
||||
</system.drawing>
|
||||
|
||||
<system.data>
|
||||
<DbProviderFactories>
|
||||
<add name="Mono Sqlite Data Provider" invariant="Mono.Data.SqliteClient"
|
||||
description="Mono Framework Data Provider for SQLite"
|
||||
type="Mono.Data.SqliteClient.SqliteFactory, Mono.Data.SqliteClient, Version=2.0.0.0, Culture=neutral, PublicKeyToken=0738eb9f132ed756"/>
|
||||
</DbProviderFactories>
|
||||
</system.data>
|
||||
|
||||
<mscorlib>
|
||||
<cryptographySettings>
|
||||
<cryptoNameMapping>
|
||||
<cryptoClasses>
|
||||
<cryptoClass monoMD2="Mono.Security.Cryptography.MD2Managed, Mono.Security, Version=2.0.0.0, Culture=neutral, PublicKeyToken=0738eb9f132ed756" />
|
||||
</cryptoClasses>
|
||||
<nameEntry name="MD2" class="monoMD2" />
|
||||
</cryptoNameMapping>
|
||||
<oidMap>
|
||||
<oidEntry OID="1.2.840.113549.2.2" name="MD2" />
|
||||
</oidMap>
|
||||
</cryptographySettings>
|
||||
</mscorlib>
|
||||
|
||||
<strongNames>
|
||||
<pubTokenMapping>
|
||||
<!-- ECMA key -->
|
||||
<map Token="b77a5c561934e089" PublicKey="002400000480000094000000060200000024000052534131000400000100010079159977d2d03a8e6bea7a2e74e8d1afcc93e8851974952bb480a12c9134474d04062447c37e0e68c080536fcf3c3fbe2ff9c979ce998475e506e8ce82dd5b0f350dc10e93bf2eeecf874b24770c5081dbea7447fddafa277b22de47d6ffea449674a4f9fccf84d15069089380284dbdd35f46cdff12a1bd78e4ef0065d016df" />
|
||||
<!-- Microsoft (final) key -->
|
||||
<map Token="b03f5f7f11d50a3a" PublicKey="002400000480000094000000060200000024000052534131000400000100010079159977d2d03a8e6bea7a2e74e8d1afcc93e8851974952bb480a12c9134474d04062447c37e0e68c080536fcf3c3fbe2ff9c979ce998475e506e8ce82dd5b0f350dc10e93bf2eeecf874b24770c5081dbea7447fddafa277b22de47d6ffea449674a4f9fccf84d15069089380284dbdd35f46cdff12a1bd78e4ef0065d016df" />
|
||||
<!-- Microsoft (Web Service Enhancement) key -->
|
||||
<map Token="31bf3856ad364e35" PublicKey="002400000480000094000000060200000024000052534131000400000100010079159977d2d03a8e6bea7a2e74e8d1afcc93e8851974952bb480a12c9134474d04062447c37e0e68c080536fcf3c3fbe2ff9c979ce998475e506e8ce82dd5b0f350dc10e93bf2eeecf874b24770c5081dbea7447fddafa277b22de47d6ffea449674a4f9fccf84d15069089380284dbdd35f46cdff12a1bd78e4ef0065d016df" />
|
||||
<!-- IBM (DB2 Data Provider) key -->
|
||||
<map Token="7c307b91aa13d208" PublicKey="002400000480000094000000060200000024000052534131000400000100010079159977d2d03a8e6bea7a2e74e8d1afcc93e8851974952bb480a12c9134474d04062447c37e0e68c080536fcf3c3fbe2ff9c979ce998475e506e8ce82dd5b0f350dc10e93bf2eeecf874b24770c5081dbea7447fddafa277b22de47d6ffea449674a4f9fccf84d15069089380284dbdd35f46cdff12a1bd78e4ef0065d016df" />
|
||||
</pubTokenMapping>
|
||||
</strongNames>
|
||||
|
||||
<system.web>
|
||||
<membership>
|
||||
<providers>
|
||||
<!-- <add name="AspNetSqlMembershipProvider" type="System.Web.Security.SqlMembershipProvider, System.Web, Version=2.0.0.0, Culture=neutral, PublicKeyToken=b03f5f7f11d50a3a" applicationName="/" connectionStringName="LocalSqlServer" /> -->
|
||||
<add name="AspNetSqlMembershipProvider" type="Mainsoft.Web.Security.GenericMembershipProvider, Mainsoft.Web.Security" applicationName="/" connectionStringName="LocalSqlServer" />
|
||||
</providers>
|
||||
</membership>
|
||||
|
||||
<roleManager>
|
||||
<providers>
|
||||
<!-- <add name="AspNetSqlRoleProvider" type="System.Web.Security.SqlRoleProvider, System.Web, Version=2.0.0.0, Culture=neutral, PublicKeyToken=b03f5f7f11d50a3a" applicationName="/" connectionStringName="LocalSqlServer" /> -->
|
||||
<add name="AspNetSqlRoleProvider" type="Mainsoft.Web.Security.GenericRoleProvider, Mainsoft.Web.Security" applicationName="/" connectionStringName="LocalSqlServer" />
|
||||
</providers>
|
||||
</roleManager>
|
||||
</system.web>
|
||||
</configuration>
|
||||
|
||||
|
||||
@@ -1,475 +0,0 @@
|
||||
<?xml version="1.0" encoding="utf-8"?>
|
||||
|
||||
<configuration>
|
||||
|
||||
<configSections>
|
||||
<section name="configProtectedData" type="System.Configuration.ProtectedConfigurationSection, System.Configuration, Version=2.0.0.0, Culture=neutral, PublicKeyToken=b03f5f7f11d50a3a" />
|
||||
<section name="appSettings" type="System.Configuration.AppSettingsSection, System.Configuration, Version=2.0.0.0, Culture=neutral, PublicKeyToken=b03f5f7f11d50a3a" />
|
||||
<section name="connectionStrings" type="System.Configuration.ConnectionStringsSection, System.Configuration, Version=2.0.0.0, Culture=neutral, PublicKeyToken=b03f5f7f11d50a3a" />
|
||||
<section name="mscorlib" type="System.Configuration.IgnoreSection, System.Configuration, Version=2.0.0.0, Culture=neutral, PublicKeyToken=b03f5f7f11d50a3a" />
|
||||
<section name="runtime" type="System.Configuration.IgnoreSection, System.Configuration, Version=2.0.0.0, Culture=neutral, PublicKeyToken=b03f5f7f11d50a3a" />
|
||||
<section name="startup" type="System.Configuration.IgnoreSection, System.Configuration, Version=2.0.0.0, Culture=neutral, PublicKeyToken=b03f5f7f11d50a3a" />
|
||||
<!-- <section name="system.codedom" type="System.CodeDom.Compiler.CodeDomConfigurationHandler, System, Version=2.0.0.0, Culture=neutral, PublicKeyToken=b77a5c561934e089" /> -->
|
||||
<section name="system.data" type="System.Data.Common.DbProviderFactoriesConfigurationHandler, System.Data, Version=2.0.0.0, Culture=neutral, PublicKeyToken=b77a5c561934e089" />
|
||||
<section name="system.diagnostics" type="System.Diagnostics.DiagnosticsConfigurationHandler, System, Version=2.0.0.0, Culture=neutral, PublicKeyToken=b77a5c561934e089" />
|
||||
<section name="system.runtime.remoting" type="System.Configuration.IgnoreSection, System.Configuration, Version=2.0.0.0, Culture=neutral, PublicKeyToken=b77a5c561934e089" allowLocation="false"/>
|
||||
<section name="strongNames" type="System.Configuration.IgnoreSection, System.Configuration, Version=2.0.0.0, Culture=neutral, PublicKeyToken=b77a5c561934e089" allowLocation="false"/>
|
||||
<sectionGroup name="system.web" type="System.Web.Configuration.SystemWebSectionGroup, System.Web, Version=2.0.0.0, Culture=neutral, PublicKeyToken=b03f5f7f11d50a3a">
|
||||
<section name="anonymousIdentification" type="System.Web.Configuration.AnonymousIdentificationSection, System.Web, Version=2.0.0.0, Culture=neutral, PublicKeyToken=b03f5f7f11d50a3a" />
|
||||
<section name="authentication" type="System.Web.Configuration.AuthenticationSection, System.Web, Version=2.0.0.0, Culture=neutral, PublicKeyToken=b03f5f7f11d50a3a" />
|
||||
<section name="authorization" type="System.Web.Configuration.AuthorizationSection, System.Web, Version=2.0.0.0, Culture=neutral, PublicKeyToken=b03f5f7f11d50a3a" />
|
||||
<section name="clientTarget" type="System.Web.Configuration.ClientTargetSection, System.Web, Version=2.0.0.0, Culture=neutral, PublicKeyToken=b03f5f7f11d50a3a" />
|
||||
<section name="compilation" type="System.Web.Configuration.CompilationSection, System.Web, Version=2.0.0.0, Culture=neutral, PublicKeyToken=b03f5f7f11d50a3a" />
|
||||
<section name="customErrors" type="System.Web.Configuration.CustomErrorsSection, System.Web, Version=2.0.0.0, Culture=neutral, PublicKeyToken=b03f5f7f11d50a3a" />
|
||||
<section name="globalization" type="System.Web.Configuration.GlobalizationSection, System.Web, Version=2.0.0.0, Culture=neutral, PublicKeyToken=b03f5f7f11d50a3a" />
|
||||
<section name="httpHandlers" type="System.Web.Configuration.HttpHandlersSection, System.Web, Version=2.0.0.0, Culture=neutral, PublicKeyToken=b03f5f7f11d50a3a" />
|
||||
<section name="httpModules" type="System.Web.Configuration.HttpModulesSection, System.Web, Version=2.0.0.0, Culture=neutral, PublicKeyToken=b03f5f7f11d50a3a" />
|
||||
<section name="httpRuntime" type="System.Web.Configuration.HttpRuntimeSection, System.Web, Version=2.0.0.0, Culture=neutral, PublicKeyToken=b03f5f7f11d50a3a" />
|
||||
<section name="machineKey" type="System.Web.Configuration.MachineKeySection, System.Web, Version=2.0.0.0, Culture=neutral, PublicKeyToken=b03f5f7f11d50a3a" />
|
||||
<section name="membership" type="System.Web.Configuration.MembershipSection, System.Web, Version=2.0.0.0, Culture=neutral, PublicKeyToken=b03f5f7f11d50a3a" />
|
||||
<section name="mobileControls" type="System.Configuration.IgnoreSection, System.Configuration, Version=2.0.0.0, Culture=neutral, PublicKeyToken=b77a5c561934e089" />
|
||||
<section name="deviceFilters" type="System.Configuration.IgnoreSection, System.Configuration, Version=2.0.0.0, Culture=neutral, PublicKeyToken=b77a5c561934e089" />
|
||||
<section name="pages" type="System.Web.Configuration.PagesSection, System.Web, Version=2.0.0.0, Culture=neutral, PublicKeyToken=b03f5f7f11d50a3a" />
|
||||
<section name="profile" type="System.Web.Configuration.ProfileSection, System.Web, Version=2.0.0.0, Culture=neutral, PublicKeyToken=b03f5f7f11d50a3a" />
|
||||
<section name="roleManager" type="System.Web.Configuration.RoleManagerSection, System.Web, Version=2.0.0.0, Culture=neutral, PublicKeyToken=b03f5f7f11d50a3a" />
|
||||
<section name="sessionState" type="System.Web.Configuration.SessionStateSection, System.Web, Version=2.0.0.0, Culture=neutral, PublicKeyToken=b03f5f7f11d50a3a" />
|
||||
<section name="siteMap" type="System.Web.Configuration.SiteMapSection, System.Web, Version=2.0.0.0, Culture=neutral, PublicKeyToken=b03f5f7f11d50a3a" />
|
||||
<section name="trace" type="System.Web.Configuration.TraceSection, System.Web, Version=2.0.0.0, Culture=neutral, PublicKeyToken=b03f5f7f11d50a3a" />
|
||||
<section name="urlMappings" type="System.Web.Configuration.UrlMappingsSection, System.Web, Version=2.0.0.0, Culture=neutral, PublicKeyToken=b03f5f7f11d50a3a" />
|
||||
<section name="webControls" type="System.Web.Configuration.WebControlsSection, System.Web, Version=2.0.0.0, Culture=neutral, PublicKeyToken=b03f5f7f11d50a3a" />
|
||||
<section name="webServices" type="System.Web.Services.Configuration.WebServicesSection, System.Web.Services, Version=2.0.0.0, Culture=neutral, PublicKeyToken=b03f5f7f11d50a3a" />
|
||||
<section name="xhtmlConformance" type="System.Web.Services.Configuration.XhtmlConformanceSection, System.Web.Services, Version=2.0.0.0, Culture=neutral, PublicKeyToken=b03f5f7f11d50a3a" />
|
||||
<sectionGroup name="caching" type="System.Web.Configuration.SystemWebCachingSectionGroup, System.Web, Version=2.0.0.0, Culture=neutral, PublicKeyToken=b03f5f7f11d50a3a">
|
||||
<section name="cache" type="System.Web.Configuration.CacheSection, System.Web, Version=2.0.0.0, Culture=neutral, PublicKeyToken=b03f5f7f11d50a3a" />
|
||||
<section name="outputCache" type="System.Web.Configuration.OutputCacheSection, System.Web, Version=2.0.0.0, Culture=neutral, PublicKeyToken=b03f5f7f11d50a3a" />
|
||||
<section name="outputCacheSettings" type="System.Web.Configuration.OutputCacheSettingsSection, System.Web, Version=2.0.0.0, Culture=neutral, PublicKeyToken=b03f5f7f11d50a3a" />
|
||||
<section name="sqlCacheDependency" type="System.Web.Configuration.OutputCacheSettingsSection, System.Web, Version=2.0.0.0, Culture=neutral, PublicKeyToken=b03f5f7f11d50a3a" />
|
||||
</sectionGroup>
|
||||
</sectionGroup>
|
||||
<sectionGroup name="system.net" type="System.Net.Configuration.NetSectionGroup, System, Version=2.0.0.0, Culture=neutral, PublicKeyToken=b77a5c561934e089">
|
||||
<section name="authenticationModules" type="System.Net.Configuration.AuthenticationModulesSection, System, Version=2.0.0.0, Culture=neutral, PublicKeyToken=b77a5c561934e089" />
|
||||
<section name="connectionManagement" type="System.Net.Configuration.ConnectionManagementSection, System, Version=2.0.0.0, Culture=neutral, PublicKeyToken=b77a5c561934e089" />
|
||||
<section name="defaultProxy" type="System.Net.Configuration.DefaultProxySection, System, Version=2.0.0.0, Culture=neutral, PublicKeyToken=b77a5c561934e089" />
|
||||
<sectionGroup name="mailSettings" type="System.Net.Configuration.MailSettingsSectionGroup, System, Version=2.0.0.0, Culture=neutral, PublicKeyToken=b77a5c561934e089">
|
||||
<section name="smtp" type="System.Net.Configuration.SmtpSection, System, Version=2.0.0.0, Culture=neutral, PublicKeyToken=b77a5c561934e089" />
|
||||
</sectionGroup>
|
||||
<section name="requestCaching" type="System.Net.Configuration.RequestCachingSection, System, Version=2.0.0.0, Culture=neutral, PublicKeyToken=b77a5c561934e089" />
|
||||
<section name="settings" type="System.Net.Configuration.SettingsSection, System, Version=2.0.0.0, Culture=neutral, PublicKeyToken=b77a5c561934e089" />
|
||||
<section name="webRequestModules" type="System.Net.Configuration.WebRequestModulesSection, System, Version=2.0.0.0, Culture=neutral, PublicKeyToken=b77a5c561934e089" />
|
||||
</sectionGroup>
|
||||
<section name="system.drawing" type="System.Configuration.NameValueSectionHandler, System, Version=2.0.0.0, Culture=neutral, PublicKeyToken=b77a5c561934e089" />
|
||||
<sectionGroup name="mainsoft.drawing">
|
||||
<section name="icons" type="System.Configuration.NameValueSectionHandler, System, Version=2.0.0.0, Culture=neutral, PublicKeyToken=b77a5c561934e089" />
|
||||
<section name="codecs" type="System.Configuration.NameValueSectionHandler, System, Version=2.0.0.0, Culture=neutral, PublicKeyToken=b77a5c561934e089" />
|
||||
<section name="codecsmetadata" type="Mainsoft.Drawing.Configuration.ResolutionConfigurationHandler" />
|
||||
</sectionGroup>
|
||||
<sectionGroup name="mainsoft.directoryservices">
|
||||
<section name="settings" type="System.Configuration.NameValueSectionHandler, System, Version=2.0.0.0, Culture=neutral, PublicKeyToken=b77a5c561934e089"/>
|
||||
</sectionGroup>
|
||||
<sectionGroup name="Mainsoft.Data.Configuration">
|
||||
<section name="objectnameresolution"
|
||||
type="System.Data.Configuration.ObjectNameResolutionSectionHandler, System.Data" />
|
||||
<section name="switches"
|
||||
type="System.Configuration.NameValueSectionHandler, System, Version=2.0.0.0, Culture=neutral, PublicKeyToken=b77a5c561934e089" />
|
||||
<section name="OleDbProviders"
|
||||
type="Mainsoft.Data.Configuration.ProvidersSectionHandler, System.Data" />
|
||||
<section name="SqlClientProviders"
|
||||
type="Mainsoft.Data.Configuration.ProvidersSectionHandler, System.Data" />
|
||||
<section name="OracleClientProviders"
|
||||
type="Mainsoft.Data.Configuration.ProvidersSectionHandler, System.Data" />
|
||||
</sectionGroup>
|
||||
</configSections>
|
||||
|
||||
<configProtectedData defaultProvider="RsaProtectedConfigurationProvider">
|
||||
<providers>
|
||||
<add name="RsaProtectedConfigurationProvider" type="System.Configuration.RsaProtectedConfigurationProvider, System.Configuration, Version=2.0.0.0, Culture=neutral, PublicKeyToken=b03f5f7f11d50a3a"
|
||||
description="" keyContainerName="MonoFrameworkConfigurationKey" cspProviderName="" useMachineContainer="true" useOAEP="false" />
|
||||
<add name="DataProtectionConfigurationProvider" type="System.Configuration.DpapiProtectedConfigurationProvider, System.Configuration, Version=2.0.0.0, Culture=neutral, PublicKeyToken=b03f5f7f11d50a3a"
|
||||
description="" useMachineProtection="true" keyEntropy="" />
|
||||
</providers>
|
||||
</configProtectedData>
|
||||
|
||||
<system.net>
|
||||
<connectionManagement>
|
||||
<add address="*" maxconnection="2" />
|
||||
</connectionManagement>
|
||||
<authenticationModules>
|
||||
<add type="System.Net.BasicClient, System, Version=2.0.0.0, Culture=neutral, PublicKeyToken=b77a5c561934e089" />
|
||||
<add type="System.Net.DigestClient, System, Version=2.0.0.0, Culture=neutral, PublicKeyToken=b77a5c561934e089" />
|
||||
<!-- <add type="System.Net.NtlmClient, System, Version=2.0.0.0, Culture=neutral, PublicKeyToken=b77a5c561934e089" /> -->
|
||||
</authenticationModules>
|
||||
<webRequestModules>
|
||||
<add prefix="http" type="System.Net.HttpRequestCreator, System, Version=2.0.0.0, Culture=neutral, PublicKeyToken=b77a5c561934e089" />
|
||||
<add prefix="https" type="System.Net.HttpRequestCreator, System, Version=2.0.0.0, Culture=neutral, PublicKeyToken=b77a5c561934e089" />
|
||||
<add prefix="file" type="System.Net.FileWebRequestCreator, System, Version=2.0.0.0, Culture=neutral, PublicKeyToken=b77a5c561934e089" />
|
||||
<add prefix="ftp" type="System.Net.FtpRequestCreator, System, Version=2.0.0.0, Culture=neutral, PublicKeyToken=b77a5c561934e089" />
|
||||
</webRequestModules>
|
||||
<settings>
|
||||
<ipv6 enabled="false"/>
|
||||
</settings>
|
||||
</system.net>
|
||||
|
||||
<system.runtime.remoting>
|
||||
<application>
|
||||
<channels>
|
||||
<channel ref="http client" displayName="http client (delay loaded)" delayLoadAsClientChannel="true" />
|
||||
<channel ref="tcp client" displayName="tcp client (delay loaded)" delayLoadAsClientChannel="true" />
|
||||
<!-- <channel ref="ipc client" displayName="ipc client (delay loaded)" delayLoadAsClientChannel="true" /> -->
|
||||
</channels>
|
||||
</application>
|
||||
<channels>
|
||||
<channel id="http" type="System.Runtime.Remoting.Channels.Http.HttpChannel, System.Runtime.Remoting, Version=2.0.0.0, Culture=neutral, PublicKeyToken=b77a5c561934e089" />
|
||||
<channel id="http client" type="System.Runtime.Remoting.Channels.Http.HttpClientChannel, System.Runtime.Remoting, Version=2.0.0.0, Culture=neutral, PublicKeyToken=b77a5c561934e089" />
|
||||
<channel id="http server" type="System.Runtime.Remoting.Channels.Http.HttpServerChannel, System.Runtime.Remoting, Version=2.0.0.0, Culture=neutral, PublicKeyToken=b77a5c561934e089" />
|
||||
<channel id="tcp" type="System.Runtime.Remoting.Channels.Tcp.TcpChannel, System.Runtime.Remoting, Version=2.0.0.0, Culture=neutral, PublicKeyToken=b77a5c561934e089" />
|
||||
<channel id="tcp client" type="System.Runtime.Remoting.Channels.Tcp.TcpClientChannel, System.Runtime.Remoting, Version=2.0.0.0, Culture=neutral, PublicKeyToken=b77a5c561934e089" />
|
||||
<channel id="tcp server" type="System.Runtime.Remoting.Channels.Tcp.TcpServerChannel, System.Runtime.Remoting, Version=2.0.0.0, Culture=neutral, PublicKeyToken=b77a5c561934e089" />
|
||||
<!-- <channel id="ipc" type="System.Runtime.Remoting.Channels.Ipc.IpcChannel, System.Runtime.Remoting, Version=2.0.0.0, Culture=neutral, PublicKeyToken=b77a5c561934e089" />
|
||||
<channel id="ipc client" type="System.Runtime.Remoting.Channels.Ipc.IpcClientChannel, System.Runtime.Remoting, Version=2.0.0.0, Culture=neutral, PublicKeyToken=b77a5c561934e089" />
|
||||
<channel id="ipc server" type="System.Runtime.Remoting.Channels.Ipc.IpcServerChannel, System.Runtime.Remoting, Version=2.0.0.0, Culture=neutral, PublicKeyToken=b77a5c561934e089" /> -->
|
||||
</channels>
|
||||
<channelSinkProviders>
|
||||
<clientProviders>
|
||||
<formatter id="soap" type="System.Runtime.Remoting.Channels.SoapClientFormatterSinkProvider, System.Runtime.Remoting, Version=2.0.0.0, Culture=neutral, PublicKeyToken=b77a5c561934e089" />
|
||||
<formatter id="binary" type="System.Runtime.Remoting.Channels.BinaryClientFormatterSinkProvider, System.Runtime.Remoting, Version=2.0.0.0, Culture=neutral, PublicKeyToken=b77a5c561934e089" />
|
||||
</clientProviders>
|
||||
<serverProviders>
|
||||
<formatter id="soap" type="System.Runtime.Remoting.Channels.SoapServerFormatterSinkProvider, System.Runtime.Remoting, Version=2.0.0.0, Culture=neutral, PublicKeyToken=b77a5c561934e089" />
|
||||
<formatter id="binary" type="System.Runtime.Remoting.Channels.BinaryServerFormatterSinkProvider, System.Runtime.Remoting, Version=2.0.0.0, Culture=neutral, PublicKeyToken=b77a5c561934e089" />
|
||||
<provider id="wsdl" type="System.Runtime.Remoting.MetadataServices.SdlChannelSinkProvider, System.Runtime.Remoting, Version=2.0.0.0, Culture=neutral, PublicKeyToken=b77a5c561934e089" />
|
||||
</serverProviders>
|
||||
</channelSinkProviders>
|
||||
</system.runtime.remoting>
|
||||
|
||||
<appSettings>
|
||||
<!--<add key="yourkey" value="your value" /> -->
|
||||
<!--<remove key="a key defined higher in the hierarchy" /> -->
|
||||
<!--<clear/> Removes all defined settings -->
|
||||
</appSettings>
|
||||
<system.diagnostics>
|
||||
<trace autoflush="false" indentsize="4" />
|
||||
</system.diagnostics>
|
||||
<system.drawing>
|
||||
</system.drawing>
|
||||
|
||||
<connectionStrings>
|
||||
<add name="EmbeddedCloudscape" connectionString="JdbcDriverClassName=org.apache.derby.jdbc.EmbeddedDriver;JdbcURL=jdbc:derby:|DataDirectory|aspnetdb;create=true" providerName="System.Data.OleDb" />
|
||||
</connectionStrings>
|
||||
<system.data>
|
||||
<DbProviderFactories>
|
||||
<add name="OleDb Data Provider" support="2" invariant="System.Data.OleDb" description=".Net Framework Data Provider for OleDb" type="System.Data.OleDb.OleDbFactory, System.Data" />
|
||||
<add name="OracleClient Data Provider" support="2" invariant="System.Data.OracleClient" description=".Net Framework Data Provider for Oracle" type="System.Data.OracleClient.OracleClientFactory, System.Data.OracleClient" />
|
||||
<add name="SqlClient Data Provider" support="2" invariant="System.Data.SqlClient" description=".Net Framework Data Provider for SqlServer" type="System.Data.SqlClient.SqlClientFactory, System.Data" />
|
||||
</DbProviderFactories>
|
||||
</system.data>
|
||||
<system.web>
|
||||
<authorization>
|
||||
<allow users="*" />
|
||||
</authorization>
|
||||
<httpHandlers>
|
||||
<add verb="*" path="Trace.axd" type="System.Web.Handlers.TraceHandler, System.Web, Version=2.0.0.0, Culture=neutral, PublicKeyToken=b03f5f7f11d50a3a" />
|
||||
<add verb="*" path="trace.axd" type="System.Web.Handlers.TraceHandler, System.Web, Version=2.0.0.0, Culture=neutral, PublicKeyToken=b03f5f7f11d50a3a" />
|
||||
<add verb="*" path="*.aspx" type="System.Web.UI.PageHandlerFactory, System.Web, Version=2.0.0.0, Culture=neutral, PublicKeyToken=b03f5f7f11d50a3a" />
|
||||
<add verb="*" path="*.asmx" validate="false" type="System.Web.Services.Protocols.WebServiceHandlerFactory, System.Web.Services, Version=2.0.0.0, Culture=neutral, PublicKeyToken=b03f5f7f11d50a3a" />
|
||||
<!-- <add verb="*" path="*.ashx" type="System.Web.UI.SimpleHandlerFactory, System.Web, Version=2.0.0.0, Culture=neutral, PublicKeyToken=b03f5f7f11d50a3a" /> -->
|
||||
<add verb="*" path="*.ashx" type="System.Web.UI.PageHandlerFactory, System.Web, Version=2.0.0.0, Culture=neutral, PublicKeyToken=b03f5f7f11d50a3a" />
|
||||
<add verb="GET" path="WebResource.axd" type="System.Web.Handlers.AssemblyResourceLoader, System.Web, Version=2.0.0.0, Culture=neutral, PublicKeyToken=b03f5f7f11d50a3a" />
|
||||
<add verb="*" path="*.master" type="System.Web.HttpForbiddenHandler, System.Web, Version=2.0.0.0, Culture=neutral, PublicKeyToken=b03f5f7f11d50a3a" />
|
||||
<add verb="*" path="*.resources" type="System.Web.HttpForbiddenHandler, System.Web, Version=2.0.0.0, Culture=neutral, PublicKeyToken=b03f5f7f11d50a3a" />
|
||||
<add verb="*" path="*.skin" type="System.Web.HttpForbiddenHandler, System.Web, Version=2.0.0.0, Culture=neutral, PublicKeyToken=b03f5f7f11d50a3a" />
|
||||
<add verb="*" path="*.browser" type="System.Web.HttpForbiddenHandler, System.Web, Version=2.0.0.0, Culture=neutral, PublicKeyToken=b03f5f7f11d50a3a" />
|
||||
<add verb="*" path="*.sitemap" type="System.Web.HttpForbiddenHandler, System.Web, Version=2.0.0.0, Culture=neutral, PublicKeyToken=b03f5f7f11d50a3a" />
|
||||
<add verb="*" path="*.webinfo" type="System.Web.HttpForbiddenHandler, System.Web, Version=2.0.0.0, Culture=neutral, PublicKeyToken=b03f5f7f11d50a3a" />
|
||||
<add verb="*" path="*.resx" type="System.Web.HttpForbiddenHandler, System.Web, Version=2.0.0.0, Culture=neutral, PublicKeyToken=b03f5f7f11d50a3a" />
|
||||
<add verb="*" path="*.asax" type="System.Web.HttpForbiddenHandler, System.Web, Version=2.0.0.0, Culture=neutral, PublicKeyToken=b03f5f7f11d50a3a" />
|
||||
<add verb="*" path="*.ascx" type="System.Web.HttpForbiddenHandler, System.Web, Version=2.0.0.0, Culture=neutral, PublicKeyToken=b03f5f7f11d50a3a" />
|
||||
<add verb="*" path="*.config" type="System.Web.HttpForbiddenHandler, System.Web, Version=2.0.0.0, Culture=neutral, PublicKeyToken=b03f5f7f11d50a3a" />
|
||||
<add verb="*" path="*.Config" type="System.Web.HttpForbiddenHandler, System.Web, Version=2.0.0.0, Culture=neutral, PublicKeyToken=b03f5f7f11d50a3a" />
|
||||
<add verb="*" path="*.cs" type="System.Web.HttpForbiddenHandler, System.Web, Version=2.0.0.0, Culture=neutral, PublicKeyToken=b03f5f7f11d50a3a" />
|
||||
<add verb="*" path="*.vb" type="System.Web.HttpForbiddenHandler, System.Web, Version=2.0.0.0, Culture=neutral, PublicKeyToken=b03f5f7f11d50a3a" />
|
||||
<add verb="*" path="*.csproj" type="System.Web.HttpForbiddenHandler, System.Web, Version=2.0.0.0, Culture=neutral, PublicKeyToken=b03f5f7f11d50a3a" />
|
||||
<add verb="*" path="*.vbproj" type="System.Web.HttpForbiddenHandler, System.Web, Version=2.0.0.0, Culture=neutral, PublicKeyToken=b03f5f7f11d50a3a" />
|
||||
<add verb="*" path="*.licx" type="System.Web.HttpForbiddenHandler, System.Web, Version=2.0.0.0, Culture=neutral, PublicKeyToken=b03f5f7f11d50a3a" />
|
||||
<add verb="*" path="*.dll" type="System.Web.HttpForbiddenHandler, System.Web, Version=2.0.0.0, Culture=neutral, PublicKeyToken=b03f5f7f11d50a3a" />
|
||||
<add verb="*" path="*.jar" type="System.Web.HttpForbiddenHandler, System.Web, Version=2.0.0.0, Culture=neutral, PublicKeyToken=b03f5f7f11d50a3a" />
|
||||
<add verb="*" path="*.rem" type="System.Runtime.Remoting.Channels.Http.HttpRemotingHandlerFactory, System.Runtime.Remoting, Culture=neutral, PublicKeyToken=b77a5c561934e089" validate="false" />
|
||||
<add verb="*" path="*.soap" type="System.Runtime.Remoting.Channels.Http.HttpRemotingHandlerFactory, System.Runtime.Remoting, Culture=neutral, PublicKeyToken=b77a5c561934e089" validate="false" />
|
||||
<add verb="GET,HEAD" path="*" type="System.Web.StaticFileHandler, System.Web, Version=2.0.0.0, Culture=neutral, PublicKeyToken=b03f5f7f11d50a3a" />
|
||||
<add verb="*" path="*" type="System.Web.HttpMethodNotAllowedHandler, System.Web, Version=2.0.0.0, Culture=neutral, PublicKeyToken=b03f5f7f11d50a3a" />
|
||||
</httpHandlers>
|
||||
<httpModules>
|
||||
<add name="OutputCache" type="System.Web.Caching.OutputCacheModule" />
|
||||
<add name="Session" type="System.Web.SessionState.SessionStateModule" />
|
||||
<!--add name="WindowsAuthentication" type="System.Web.Security.WindowsAuthenticationModule" /-->
|
||||
<add name="FormsAuthentication" type="System.Web.Security.FormsAuthenticationModule" />
|
||||
<!--add name="PassportAuthentication" type="System.Web.Security.PassportAuthenticationModule" /-->
|
||||
<add name="RoleManager" type="System.Web.Security.RoleManagerModule" />
|
||||
<add name="UrlAuthorization" type="System.Web.Security.UrlAuthorizationModule" />
|
||||
<!--add name="FileAuthorization" type="System.Web.Security.FileAuthorizationModule" /-->
|
||||
<add name="AnonymousIdentification" type="System.Web.Security.AnonymousIdentificationModule" />
|
||||
<add name="Profile" type="System.Web.Profile.ProfileModule" />
|
||||
</httpModules>
|
||||
<machineKey validationKey="AutoGenerate" decryptionKey="AutoGenerate" validation="SHA1" />
|
||||
<globalization requestEncoding="utf-8"
|
||||
responseEncoding="utf-8"
|
||||
fileEncoding="utf-8"/>
|
||||
<!--
|
||||
culture="en-US"
|
||||
uiculture="en-US" />
|
||||
-->
|
||||
<sessionState
|
||||
mode="Custom"
|
||||
customProvider="ServletSessionStateStore"
|
||||
sessionIDManagerType="Mainsoft.Web.SessionState.ServletSessionIDManager">
|
||||
<providers>
|
||||
<add name="ServletSessionStateStore"
|
||||
type="Mainsoft.Web.SessionState.ServletSessionStateStoreProvider" />
|
||||
</providers>
|
||||
</sessionState>
|
||||
<webServices>
|
||||
<protocols>
|
||||
<add name="HttpSoap"/>
|
||||
<add name="HttpSoap12"/>
|
||||
<add name="HttpPostLocalhost"/>
|
||||
<add name="Documentation"/>
|
||||
</protocols>
|
||||
<wsdlHelpGenerator href="DefaultWsdlHelpGenerator.aspx" />
|
||||
</webServices>
|
||||
<webControls clientScriptsLocation="/web_scripts" />
|
||||
<compilation debug="false" defaultLanguage="c#" explicit="true" strict="false" >
|
||||
<compilers>
|
||||
<compiler language="cs;c#;csharp" extension=".cs" warningLevel="1" compilerOptions=""
|
||||
type="Microsoft.CSharp.CSharpCodeProvider, System, Version=2.0.0.0, Culture=neutral, PublicKeyToken=b77a5c561934e089" />
|
||||
<compiler language="vb;vbs;visualbasic;vbscript" extension=".vb"
|
||||
warningLevel="1" compilerOptions=""
|
||||
type="Microsoft.VisualBasic.VBCodeProvider, System, Version=2.0.0.0, Culture=neutral, PublicKeyToken=b77a5c561934e089" />
|
||||
</compilers>
|
||||
<assemblies>
|
||||
<!--<add assembly="mscorlib" /> -->
|
||||
<add assembly="System" />
|
||||
<add assembly="System.Xml" />
|
||||
<add assembly="System.Configuration" />
|
||||
<add assembly="System.Data" />
|
||||
<add assembly="System.Web" />
|
||||
<add assembly="System.Web.Services" />
|
||||
<add assembly="System.Drawing" />
|
||||
<add assembly="*" /> <!-- Add assemblies in bin directory -->
|
||||
</assemblies>
|
||||
</compilation>
|
||||
<httpRuntime executionTimeout="90"
|
||||
maxRequestLength="4096"
|
||||
useFullyQualifiedRedirectUrl="false"
|
||||
minFreeThreads="8"
|
||||
minLocalRequestFreeThreads="4"
|
||||
appRequestQueueLimit="100" />
|
||||
<clientTarget>
|
||||
<add alias="ie5" userAgent="Mozilla/4.0 (compatible; MSIE 5.5; Windows NT 4.0)" />
|
||||
<add alias="ie4" userAgent="Mozilla/4.0 (compatible; MSIE 4.0; Windows NT 4.0)" />
|
||||
<add alias="uplevel" userAgent="Mozilla/4.0 (compatible; MSIE 4.0; Windows NT 4.0)" />
|
||||
<add alias="downlevel" userAgent="Unknown" />
|
||||
</clientTarget>
|
||||
|
||||
<siteMap defaultProvider="AspNetXmlSiteMapProvider">
|
||||
<providers>
|
||||
<add name="AspNetXmlSiteMapProvider"
|
||||
description="Default site map provider that reads in .sitemap xml files."
|
||||
type="System.Web.XmlSiteMapProvider, System.Web, Version=2.0.0.0, Culture=neutral, PublicKeyToken=b03f5f7f11d50a3a"
|
||||
siteMapFile="Web.sitemap" />
|
||||
<add name="AspNetConfigXmlSiteMapProvider"
|
||||
description="Default site map provider for AspNet configuration utility."
|
||||
type="Mainsoft.Web.AspnetConfig.CustomXmlSiteMapProvider"
|
||||
siteMapFile="web.sitemap" />
|
||||
</providers>
|
||||
</siteMap>
|
||||
<membership defaultProvider="AspNetCloudscapeMembershipProvider">
|
||||
<providers>
|
||||
<add name="AspNetCloudscapeMembershipProvider" connectionStringName="EmbeddedCloudscape" applicationName="/" type="Mainsoft.Web.Security.CloudscapeMembershipProvider, Mainsoft.Web" enablePasswordRetrieval="false" enablePasswordReset="true" requiresQuestionAndAnswer="true" requiresUniqueEmail="false" passwordFormat="Hashed" maxInvalidPasswordAttempts="5" minRequiredPasswordLength="7" minRequiredNonalphanumericCharacters="1" passwordAttemptWindow="10" passwordStrengthRegularExpression="" />
|
||||
</providers>
|
||||
</membership>
|
||||
<profile defaultProvider="AspNetCloudscapeProfileProvider">
|
||||
<providers>
|
||||
<add name="AspNetCloudscapeProfileProvider" connectionStringName="EmbeddedCloudscape" applicationName="/" type="Mainsoft.Web.Profile.CloudscapeProfileProvider, Mainsoft.Web" />
|
||||
</providers>
|
||||
</profile>
|
||||
<roleManager defaultProvider="AspNetCloudscapeRoleProvider">
|
||||
<providers>
|
||||
<add name="AspNetCloudscapeRoleProvider" connectionStringName="EmbeddedCloudscape" applicationName="/" type="Mainsoft.Web.Security.CloudscapeRoleProvider, Mainsoft.Web" />
|
||||
</providers>
|
||||
</roleManager>
|
||||
</system.web>
|
||||
|
||||
<Mainsoft.Data.Configuration>
|
||||
<objectnameresolution>
|
||||
<!-- CATALOG.SCHEMA.NAME-->
|
||||
<!-- "^\s*((((\[\s*(?<CATALOG>(\s*[^\[\]\s])+)\s*\])|(?<CATALOG>(\w|!|\#|\$)*(\s*(\w|!|\#|\$)+)*))\s*\.\s*)?((\[(?<SCHEMA>(\s*[^\[\]\s])+)\s*\])|(?<SCHEMA>(\w|!|\#|\$)*(\s*(\w|!|\#|\$)+)*))\s*\.\s*)?((\[(?<NAME>(\s*[^\[\]\s])+)\s*\])|(?<NAME>(\w|!|\#|\$)+(\s*(\w|!|\#|\$)+)*))\s*$" -->
|
||||
<!-- <add dbname="<name returned by server>" match="^\s*((((\[\s*(?<CATALOG>(\s*[^\[\]\s])+)\s*\])|(?<CATALOG>(\w|!|\#|\$)*(\s*(\w|!|\#|\$)+)*))\s*\.\s*)?((\[(?<SCHEMA>(\s*[^\[\]\s])+)\s*\])|(?<SCHEMA>(\w|!|\#|\$)*(\s*(\w|!|\#|\$)+)*))\s*\.\s*)?((\[(?<NAME>(\s*[^\[\]\s])+)\s*\])|(?<NAME>(\w|!|\#|\$)+(\s*(\w|!|\#|\$)+)*))\s*$" priority="1"/> -->
|
||||
</objectnameresolution>
|
||||
<OleDbProviders>
|
||||
|
||||
<!-- Microsoft SQLServer driver 2000 -->
|
||||
<provider>
|
||||
<add key="url" value = "jdbc:microsoft:sqlserver://${servername}:${port};DatabaseName=${database}" />
|
||||
<add key="driverClassName" value = "com.microsoft.jdbc.sqlserver.SQLServerDriver" />
|
||||
<add key="id" value = "SQLJDBC2000" />
|
||||
<add key="type" value = "Mainsoft.Data.Jdbc.Providers.OleDbSqlServerProvider2000, System.Data" />
|
||||
<add key="keyMapping" value = "serverName=data source,server,address,addr;user=user id,user,uid;password=password,pwd;database=initial catalog,database;loginTimeout=connect timeout,connection timeout;" />
|
||||
<add key="keyExclude" value="provider,jndi-datasource-name,naming-provider-url,naming-factory-initial,jdbcdriverclassname,jdbcurl" />
|
||||
</provider>
|
||||
|
||||
<!-- Microsoft SQLServer driver 2005 -->
|
||||
<provider>
|
||||
<add key="url" value = "jdbc:sqlserver://${servername}" />
|
||||
<add key="driverClassName" value = "com.microsoft.sqlserver.jdbc.SQLServerDriver" />
|
||||
<add key="id" value = "SQLJDBC2005" />
|
||||
<add key="type" value = "Mainsoft.Data.Jdbc.Providers.OleDbSqlServerProvider2005, System.Data" />
|
||||
<add key="keyMapping" value = "serverName=data source,server,address,addr;user=user id,user,uid;password=password,pwd;database=initial catalog,database;loginTimeout=connect timeout,connection timeout;" />
|
||||
<add key="keyExclude" value="provider,jndi-datasource-name,naming-provider-url,naming-factory-initial,jdbcdriverclassname,jdbcurl" />
|
||||
<add key="keyUnsupported" value="AttachDBFilename" />
|
||||
</provider>
|
||||
|
||||
<!-- Microsoft SQLServer driver 2005 (default) -->
|
||||
<provider>
|
||||
<add key="url" value = "jdbc:sqlserver://${servername}" />
|
||||
<add key="driverClassName" value = "com.microsoft.sqlserver.jdbc.SQLServerDriver" />
|
||||
<add key="id" value = "SQLOLEDB.1" />
|
||||
<add key="type" value = "Mainsoft.Data.Jdbc.Providers.OleDbSqlServerProvider2005, System.Data" />
|
||||
<add key="keyMapping" value = "serverName=data source,server,address,addr;user=user id,user,uid;password=password,pwd;database=initial catalog,database;loginTimeout=connect timeout,connection timeout;" />
|
||||
<add key="keyExclude" value="provider,jndi-datasource-name,naming-provider-url,naming-factory-initial,jdbcdriverclassname,jdbcurl" />
|
||||
<add key="keyUnsupported" value="AttachDBFilename" />
|
||||
</provider>
|
||||
|
||||
<!-- Oracle driver -->
|
||||
<provider>
|
||||
<add key="url" value = "jdbc:oracle:thin:@//${servername}:${port}/${servicename}" />
|
||||
<add key="driverClassName" value = "oracle.jdbc.OracleDriver" />
|
||||
<add key="port" value = "1521" />
|
||||
<add key="id" value = "MSDAORA.1" />
|
||||
<add key="type" value = "Mainsoft.Data.Jdbc.Providers.OleDbOracleProvider, System.Data" />
|
||||
<add key="keyMapping" value = "servername=hostname;user=user id,user,uid;password=password,pwd;servicename=data source,sid;loginTimeout=connect timeout,connection timeout" />
|
||||
<add key="keyExclude" value="provider,jndi-datasource-name,naming-provider-url,naming-factory-initial,jdbcdriverclassname,jdbcurl" />
|
||||
</provider>
|
||||
|
||||
<!-- IMB DB2 driver -->
|
||||
<provider>
|
||||
<add key="url" value = "jdbc:db2://${servername}:${port}/${database}" />
|
||||
<add key="driverClassName" value = "com.ibm.db2.jcc.DB2Driver" />
|
||||
<add key="port" value = "50000" />
|
||||
<add key="id" value = "IBMDADB2.1" />
|
||||
<add key="type" value = "Mainsoft.Data.Jdbc.Providers.OleDbDB2Provider, System.Data" />
|
||||
<add key="keyMapping" value = "servername=hostname;user=user id,user,uid;password=password,pwd;database=data source;loginTimeout=connect timeout,connection timeout;" />
|
||||
<add key="keyExclude" value="provider,jndi-datasource-name,naming-provider-url,naming-factory-initial,jdbcdriverclassname,jdbcurl" />
|
||||
</provider>
|
||||
</OleDbProviders>
|
||||
<SqlClientProviders>
|
||||
|
||||
<!-- Microsoft SQLServer driver 2000 -->
|
||||
<provider>
|
||||
<add key="url" value = "jdbc:microsoft:sqlserver://${servername}:${port};DatabaseName=${database}" />
|
||||
<add key="driverClassName" value = "com.microsoft.jdbc.sqlserver.SQLServerDriver" />
|
||||
<add key="id" value = "SQLJDBC2000" />
|
||||
<add key="type" value = "Mainsoft.Data.Jdbc.Providers.OleDbSqlServerProvider2000, System.Data" />
|
||||
<add key="keyMapping" value = "serverName=data source,server,address,addr;user=user id,user,uid;password=password,pwd;database=initial catalog,database;loginTimeout=connect timeout,connection timeout;" />
|
||||
<add key="keyExclude" value="provider,jndi-datasource-name,naming-provider-url,naming-factory-initial,jdbcdriverclassname,jdbcurl" />
|
||||
</provider>
|
||||
|
||||
<!-- Microsoft SQLServer driver 2005 -->
|
||||
<provider>
|
||||
<add key="url" value = "jdbc:sqlserver://${servername}" />
|
||||
<add key="driverClassName" value = "com.microsoft.sqlserver.jdbc.SQLServerDriver" />
|
||||
<add key="id" value = "SQLJDBC2005" />
|
||||
<add key="type" value = "Mainsoft.Data.Jdbc.Providers.OleDbSqlServerProvider2005, System.Data" />
|
||||
<add key="keyMapping" value = "serverName=data source,server,address,addr;user=user id,user,uid;password=password,pwd;database=initial catalog,database;loginTimeout=connect timeout,connection timeout;" />
|
||||
<add key="keyExclude" value="provider,jndi-datasource-name,naming-provider-url,naming-factory-initial,jdbcdriverclassname,jdbcurl" />
|
||||
</provider>
|
||||
|
||||
<!-- Microsoft SQLServer driver 2005 (default) -->
|
||||
<provider>
|
||||
<add key="url" value = "jdbc:sqlserver://${servername}" />
|
||||
<add key="driverClassName" value = "com.microsoft.sqlserver.jdbc.SQLServerDriver" />
|
||||
<add key="id" value = "SQLCLIENT" />
|
||||
<add key="type" value = "Mainsoft.Data.Jdbc.Providers.OleDbSqlServerProvider2005, System.Data" />
|
||||
<add key="keyMapping" value = "serverName=data source,server,address,addr;user=user id,user,uid;password=password,pwd;database=initial catalog,database;loginTimeout=connect timeout,connection timeout;" />
|
||||
<add key="keyExclude" value="provider,jndi-datasource-name,naming-provider-url,naming-factory-initial,jdbcdriverclassname,jdbcurl" />
|
||||
</provider>
|
||||
</SqlClientProviders>
|
||||
|
||||
<OracleClientProviders>
|
||||
|
||||
<!-- Oracle driver -->
|
||||
<provider>
|
||||
<add key="url" value = "jdbc:oracle:thin:@//${servername}:${port}/${servicename}" />
|
||||
<add key="driverClassName" value = "oracle.jdbc.OracleDriver" />
|
||||
<add key="port" value = "1521" />
|
||||
<add key="id" value = "ORACLECLIENT" />
|
||||
<add key="type" value = "Mainsoft.Data.Jdbc.Providers.OracleProvider, System.Data.OracleClient" />
|
||||
<add key="keyMapping" value = "servername=hostname;user=user id,user,uid;password=password,pwd;servicename=data source,sid;loginTimeout=connect timeout,connection timeout" />
|
||||
<add key="keyExclude" value="provider,jndi-datasource-name,naming-provider-url,naming-factory-initial,jdbcdriverclassname,jdbcurl" />
|
||||
</provider>
|
||||
</OracleClientProviders>
|
||||
</Mainsoft.Data.Configuration>
|
||||
|
||||
<mainsoft.directoryservices>
|
||||
<settings>
|
||||
<add key="servername" value="localhost"/>
|
||||
<add key="port" value="389"/>
|
||||
<add key="securitymech" value="1.2.840.113554.1.2.2"/>
|
||||
<add key="securityappname" value="com.mainsoft.system.directoryservices"/>
|
||||
<add key="authenticationmech" value="GSSAPI"/>
|
||||
</settings>
|
||||
</mainsoft.directoryservices>
|
||||
|
||||
<mainsoft.drawing>
|
||||
<icons>
|
||||
<add key="Application" value="System.Drawing.resources.icons.application.png"/>
|
||||
<add key="Asterisk" value="System.Drawing.resources.icons.asterisk.png"/>
|
||||
<add key="Error" value="System.Drawing.resources.icons.error.png"/>
|
||||
<add key="Exclamation" value="System.Drawing.resources.icons.exclamation.png"/>
|
||||
<add key="Hand" value="System.Drawing.resources.icons.hand.png"/>
|
||||
<add key="Information" value="System.Drawing.resources.icons.information.png"/>
|
||||
<add key="Question" value="System.Drawing.resources.icons.question.png"/>
|
||||
<add key="Warning" value="System.Drawing.resources.icons.warning.png"/>
|
||||
<add key="WinLogo" value="System.Drawing.resources.icons.winlogo.png"/>
|
||||
</icons>
|
||||
<codecs>
|
||||
<!-- This mimetypes are plugin depenand, for now jai_imageio.jar -->
|
||||
<!-- and java built in imageio specified -->
|
||||
<add key="557cf400-1a04-11d3-9a73-0000f81ef32e" value="image/bmp, image/x-bmp, image/x-windows-bmp"/>
|
||||
<add key="557cf406-1a04-11d3-9a73-0000f81ef32e" value="image/png"/>
|
||||
<add key="557cf402-1a04-11d3-9a73-0000f81ef32e" value="image/gif"/>
|
||||
<add key="557cf401-1a04-11d3-9a73-0000f81ef32e" value="image/jpeg"/>
|
||||
<add key="557cf405-1a04-11d3-9a73-0000f81ef32e" value="image/tiff"/>
|
||||
</codecs>
|
||||
<codecsmetadata>
|
||||
<imageformat name="Bmp">
|
||||
<xresolution default="96">//PixelsPerMeter/X</xresolution>
|
||||
<yresolution default="96">//PixelsPerMeter/Y</yresolution>
|
||||
<unitstype default="meter"></unitstype>
|
||||
<unitscale value="meter" name="meter">.0254</unitscale>
|
||||
</imageformat>
|
||||
<imageformat name="Jpeg">
|
||||
<xresolution default="96">//JPEGvariety/app0JFIF/@Xdensity</xresolution>
|
||||
<yresolution default="96">//JPEGvariety/app0JFIF/@Ydensity</yresolution>
|
||||
<unitstype default="1">//JPEGvariety/app0JFIF/@resUnits</unitstype>
|
||||
<unitscale value="0" name="na">1.0</unitscale>
|
||||
<unitscale value="1" name="inch">1.0</unitscale>
|
||||
<unitscale value="2" name="cm">25.4</unitscale>
|
||||
</imageformat>
|
||||
<imageformat name="Png">
|
||||
<xresolution default="96">//pHYs/@pixelsPerUnitXAxis</xresolution>
|
||||
<yresolution default="96">//pHYs/@pixelsPerUnitYAxis</yresolution>
|
||||
<unitstype default="inch">//pHYs/@unitSpecifier</unitstype>
|
||||
<unitscale value="meter" name="meter">.0254</unitscale>
|
||||
<unitscale value="inch" name="inch">1.0</unitscale>
|
||||
<unitscale value="unknown" name="na">1.0</unitscale>
|
||||
</imageformat>
|
||||
<imageformat name="Tiff">
|
||||
<xresolution default="96">//TIFFField[@name='XResolution']/TIFFRationals/TIFFRational/@value</xresolution>
|
||||
<yresolution default="96">//TIFFField[@name='YResolution']/TIFFRationals/TIFFRational/@value</yresolution>
|
||||
<unitstype default="2">//TIFFField[@name='ResolutionUnit']/TIFFShorts/TIFFShort/@value</unitstype>
|
||||
<unitscale value="1" name="na">1.0</unitscale>
|
||||
<unitscale value="2" name="inch">1.0</unitscale>
|
||||
<unitscale value="3" name="cm">25.4</unitscale>
|
||||
</imageformat>
|
||||
</codecsmetadata>
|
||||
</mainsoft.drawing>
|
||||
</configuration>
|
||||
@@ -1,141 +0,0 @@
|
||||
<?xml version="1.0" encoding="utf-8"?>
|
||||
|
||||
<configuration>
|
||||
|
||||
<system.web>
|
||||
<authorization>
|
||||
<allow users="*" />
|
||||
</authorization>
|
||||
<httpHandlers>
|
||||
<add verb="*" path="Trace.axd" type="System.Web.Handlers.TraceHandler, System.Web, Version=2.0.0.0, Culture=neutral, PublicKeyToken=b03f5f7f11d50a3a" />
|
||||
<add verb="*" path="*.aspx" type="System.Web.UI.PageHandlerFactory, System.Web, Version=2.0.0.0, Culture=neutral, PublicKeyToken=b03f5f7f11d50a3a" />
|
||||
<add verb="*" path="*.asmx" validate="false" type="System.Web.Services.Protocols.WebServiceHandlerFactory, System.Web.Services, Version=2.0.0.0, Culture=neutral, PublicKeyToken=b03f5f7f11d50a3a" />
|
||||
<add verb="*" path="*.ashx" type="System.Web.UI.SimpleHandlerFactory, System.Web, Version=2.0.0.0, Culture=neutral, PublicKeyToken=b03f5f7f11d50a3a" />
|
||||
<add verb="GET" path="WebResource.axd" type="System.Web.Handlers.AssemblyResourceLoader, System.Web, Version=2.0.0.0, Culture=neutral, PublicKeyToken=b03f5f7f11d50a3a" />
|
||||
<add verb="*" path="*.master" type="System.Web.HttpForbiddenHandler, System.Web, Version=2.0.0.0, Culture=neutral, PublicKeyToken=b03f5f7f11d50a3a" />
|
||||
<add verb="*" path="*.resources" type="System.Web.HttpForbiddenHandler, System.Web, Version=2.0.0.0, Culture=neutral, PublicKeyToken=b03f5f7f11d50a3a" />
|
||||
<add verb="*" path="*.skin" type="System.Web.HttpForbiddenHandler, System.Web, Version=2.0.0.0, Culture=neutral, PublicKeyToken=b03f5f7f11d50a3a" />
|
||||
<add verb="*" path="*.browser" type="System.Web.HttpForbiddenHandler, System.Web, Version=2.0.0.0, Culture=neutral, PublicKeyToken=b03f5f7f11d50a3a" />
|
||||
<add verb="*" path="*.sitemap" type="System.Web.HttpForbiddenHandler, System.Web, Version=2.0.0.0, Culture=neutral, PublicKeyToken=b03f5f7f11d50a3a" />
|
||||
<add verb="*" path="*.webinfo" type="System.Web.HttpForbiddenHandler, System.Web, Version=2.0.0.0, Culture=neutral, PublicKeyToken=b03f5f7f11d50a3a" />
|
||||
<add verb="*" path="*.resx" type="System.Web.HttpForbiddenHandler, System.Web, Version=2.0.0.0, Culture=neutral, PublicKeyToken=b03f5f7f11d50a3a" />
|
||||
<add verb="*" path="*.asax" type="System.Web.HttpForbiddenHandler, System.Web, Version=2.0.0.0, Culture=neutral, PublicKeyToken=b03f5f7f11d50a3a" />
|
||||
<add verb="*" path="*.ascx" type="System.Web.HttpForbiddenHandler, System.Web, Version=2.0.0.0, Culture=neutral, PublicKeyToken=b03f5f7f11d50a3a" />
|
||||
<add verb="*" path="*.config" type="System.Web.HttpForbiddenHandler, System.Web, Version=2.0.0.0, Culture=neutral, PublicKeyToken=b03f5f7f11d50a3a" />
|
||||
<add verb="*" path="*.Config" type="System.Web.HttpForbiddenHandler, System.Web, Version=2.0.0.0, Culture=neutral, PublicKeyToken=b03f5f7f11d50a3a" />
|
||||
<add verb="*" path="*.cs" type="System.Web.HttpForbiddenHandler, System.Web, Version=2.0.0.0, Culture=neutral, PublicKeyToken=b03f5f7f11d50a3a" />
|
||||
<add verb="*" path="*.vb" type="System.Web.HttpForbiddenHandler, System.Web, Version=2.0.0.0, Culture=neutral, PublicKeyToken=b03f5f7f11d50a3a" />
|
||||
<add verb="*" path="*.csproj" type="System.Web.HttpForbiddenHandler, System.Web, Version=2.0.0.0, Culture=neutral, PublicKeyToken=b03f5f7f11d50a3a" />
|
||||
<add verb="*" path="*.vbproj" type="System.Web.HttpForbiddenHandler, System.Web, Version=2.0.0.0, Culture=neutral, PublicKeyToken=b03f5f7f11d50a3a" />
|
||||
<add verb="*" path="*.licx" type="System.Web.HttpForbiddenHandler, System.Web, Version=2.0.0.0, Culture=neutral, PublicKeyToken=b03f5f7f11d50a3a" />
|
||||
<add verb="*" path="*.dll" type="System.Web.HttpForbiddenHandler, System.Web, Version=2.0.0.0, Culture=neutral, PublicKeyToken=b03f5f7f11d50a3a" />
|
||||
<add verb="*" path="*.rem" type="System.Runtime.Remoting.Channels.Http.HttpRemotingHandlerFactory, System.Runtime.Remoting, Culture=neutral, PublicKeyToken=b77a5c561934e089" validate="false" />
|
||||
<add verb="*" path="*.soap" type="System.Runtime.Remoting.Channels.Http.HttpRemotingHandlerFactory, System.Runtime.Remoting, Culture=neutral, PublicKeyToken=b77a5c561934e089" validate="false" />
|
||||
<add verb="GET,HEAD" path="*" type="System.Web.StaticFileHandler, System.Web, Version=2.0.0.0, Culture=neutral, PublicKeyToken=b03f5f7f11d50a3a" />
|
||||
<add verb="*" path="*" type="System.Web.HttpMethodNotAllowedHandler, System.Web, Version=2.0.0.0, Culture=neutral, PublicKeyToken=b03f5f7f11d50a3a" />
|
||||
</httpHandlers>
|
||||
<httpModules>
|
||||
<add name="FormsAuthentication" type="System.Web.Security.FormsAuthenticationModule, System.Web, Version=2.0.0.0, Culture=neutral, PublicKeyToken=b03f5f7f11d50a3a" />
|
||||
<add name="OutputCache" type="System.Web.Caching.OutputCacheModule, System.Web, Version=2.0.0.0, Culture=neutral, PublicKeyToken=b03f5f7f11d50a3a" />
|
||||
<add name="RoleManager" type="System.Web.Security.RoleManagerModule, System.Web, Version=2.0.0.0, Culture=neutral, PublicKeyToken=b03f5f7f11d50a3a" />
|
||||
<add name="Session" type="System.Web.SessionState.SessionStateModule, System.Web, Version=2.0.0.0, Culture=neutral, PublicKeyToken=b03f5f7f11d50a3a" />
|
||||
<add name="UrlAuthorization" type="System.Web.Security.UrlAuthorizationModule, System.Web, Version=2.0.0.0, Culture=neutral, PublicKeyToken=b03f5f7f11d50a3a" />
|
||||
</httpModules>
|
||||
<authentication mode="Forms">
|
||||
<forms name=".MONOAUTH" loginUrl="login.aspx" protection="All" timeout="30" path="/">
|
||||
<credentials passwordFormat="Clear">
|
||||
<!--<user name="gonzalo" password="gonz"/>-->
|
||||
</credentials>
|
||||
</forms>
|
||||
</authentication>
|
||||
<machineKey validationKey="AutoGenerate" decryptionKey="AutoGenerate" validation="SHA1" />
|
||||
<globalization requestEncoding="utf-8"
|
||||
responseEncoding="utf-8"
|
||||
fileEncoding="utf-8"/>
|
||||
<!--
|
||||
culture="en-US"
|
||||
uiculture="en-US" />
|
||||
-->
|
||||
<sessionState mode="InProc" />
|
||||
<webServices>
|
||||
<protocols>
|
||||
<add name="HttpSoap"/>
|
||||
<add name="HttpSoap12"/>
|
||||
<add name="HttpPost"/>
|
||||
<add name="HttpGet"/>
|
||||
<add name="Documentation"/>
|
||||
</protocols>
|
||||
<wsdlHelpGenerator href="DefaultWsdlHelpGenerator.aspx" />
|
||||
</webServices>
|
||||
<pages>
|
||||
<namespaces>
|
||||
<add namespace="System" />
|
||||
<add namespace="System.Collections" />
|
||||
<add namespace="System.Collections.Specialized" />
|
||||
<add namespace="System.Configuration" />
|
||||
<add namespace="System.Text" />
|
||||
<add namespace="System.Text.RegularExpressions" />
|
||||
<add namespace="System.Web" />
|
||||
<add namespace="System.Web.Caching" />
|
||||
<add namespace="System.Web.SessionState" />
|
||||
<add namespace="System.Web.Security" />
|
||||
<add namespace="System.Web.Profile" />
|
||||
<add namespace="System.Web.UI" />
|
||||
<add namespace="System.Web.UI.WebControls" />
|
||||
<!-- <add namespace="System.Web.UI.WebControls.WebParts" /> -->
|
||||
<add namespace="System.Web.UI.HtmlControls" />
|
||||
</namespaces>
|
||||
</pages>
|
||||
<webControls clientScriptsLocation="/web_scripts" />
|
||||
<compilation debug="false" defaultLanguage="c#" explicit="true" strict="false" >
|
||||
<compilers>
|
||||
<compiler language="cs;c#;csharp" extension=".cs" warningLevel="1" compilerOptions=""
|
||||
type="Microsoft.CSharp.CSharpCodeProvider, System, Version=2.0.0.0, Culture=neutral, PublicKeyToken=b77a5c561934e089" />
|
||||
<compiler language="vb;vbs;visualbasic;vbscript" extension=".vb"
|
||||
warningLevel="1" compilerOptions=""
|
||||
type="Microsoft.VisualBasic.VBCodeProvider, System, Version=2.0.0.0, Culture=neutral, PublicKeyToken=b77a5c561934e089" />
|
||||
</compilers>
|
||||
<assemblies>
|
||||
<!--<add assembly="mscorlib" /> -->
|
||||
<add assembly="System" />
|
||||
<add assembly="System.Xml" />
|
||||
<add assembly="System.Configuration" />
|
||||
<add assembly="System.Data" />
|
||||
<add assembly="System.Web" />
|
||||
<add assembly="System.Web.Services" />
|
||||
<add assembly="System.Drawing" />
|
||||
<add assembly="*" /> <!-- Add assemblies in bin directory -->
|
||||
</assemblies>
|
||||
<expressionBuilders>
|
||||
<add expressionPrefix="Resources"
|
||||
type="System.Web.Compilation.ResourceExpressionBuilder, System.Web, Version=2.0.0.0, Culture=neutral, PublicKeyToken=b03f5f7f11d50a3a" />
|
||||
<add expressionPrefix="ConnectionStrings"
|
||||
type="System.Web.Compilation.ConnectionStringsExpressionBuilder, System.Web, Version=2.0.0.0, Culture=neutral, PublicKeyToken=b03f5f7f11d50a3a" />
|
||||
<add expressionPrefix="AppSettings"
|
||||
type="System.Web.Compilation.AppSettingsExpressionBuilder, System.Web, Version=2.0.0.0, Culture=neutral, PublicKeyToken=b03f5f7f11d50a3a" />
|
||||
</expressionBuilders>
|
||||
</compilation>
|
||||
<httpRuntime executionTimeout="90"
|
||||
maxRequestLength="4096"
|
||||
useFullyQualifiedRedirectUrl="false"
|
||||
minFreeThreads="8"
|
||||
minLocalRequestFreeThreads="4"
|
||||
appRequestQueueLimit="100" />
|
||||
<clientTarget>
|
||||
<add alias="ie5" userAgent="Mozilla/4.0 (compatible; MSIE 5.5; Windows NT 4.0)" />
|
||||
<add alias="ie4" userAgent="Mozilla/4.0 (compatible; MSIE 4.0; Windows NT 4.0)" />
|
||||
<add alias="uplevel" userAgent="Mozilla/4.0 (compatible; MSIE 4.0; Windows NT 4.0)" />
|
||||
<add alias="downlevel" userAgent="Unknown" />
|
||||
</clientTarget>
|
||||
|
||||
<siteMap enabled="false">
|
||||
<providers>
|
||||
<add name="AspNetXmlSiteMapProvider"
|
||||
description="Default site map provider that reads in .sitemap xml files."
|
||||
type="System.Web.XmlSiteMapProvider, System.Web, Version=2.0.0.0, Culture=neutral, PublicKeyToken=b03f5f7f11d50a3a"
|
||||
siteMapFile="Web.sitemap" />
|
||||
</providers>
|
||||
</siteMap>
|
||||
</system.web>
|
||||
|
||||
</configuration>
|
||||
@@ -1,15 +0,0 @@
|
||||
EXTRA_DIST = \
|
||||
aot-compiler.txt \
|
||||
assembly-bundle \
|
||||
embedded-api \
|
||||
exceptions \
|
||||
gc-issues \
|
||||
jit-thoughts \
|
||||
jit-trampolines \
|
||||
local-regalloc.txt \
|
||||
mini-doc.txt \
|
||||
mini-porting.txt \
|
||||
opcode-decomp.txt \
|
||||
object-layout \
|
||||
unmanaged-calls \
|
||||
stack-alignment
|
||||
@@ -1,302 +0,0 @@
|
||||
|
||||
Here "abc" stays for "array bounds check", or "array bound checks", or
|
||||
some combination of the two...
|
||||
|
||||
------------------------------------------------------------------------------
|
||||
USAGE
|
||||
|
||||
Simply use the "abcrem" optimization invoking mono.
|
||||
|
||||
To see if bound checks are actually removed, use "mono -v" and grep for
|
||||
"ARRAY-ACCESS" in the output, there should be a message for each check
|
||||
that has been removed.
|
||||
|
||||
To trace the algorithm execution, use "-v -v -v", and be prepared to be
|
||||
totally submersed by debugging messages...
|
||||
|
||||
------------------------------------------------------------------------------
|
||||
EFFECTIVENESS
|
||||
|
||||
The abc removal code can now always remove bound checks from "clean"
|
||||
array scans in loops, and generally anyway there are clear conditions that
|
||||
already state that the index is "safe".
|
||||
|
||||
To be clearer, and give an idea of what the algorithm can and cannot do
|
||||
without describing it in detail... keep in mind that only "redunant" checks
|
||||
cannot be removed. By "redundant", I mean "already explicitly checked" in
|
||||
the method code.
|
||||
|
||||
Unfortunately, analyzing complex expressions is not so easy (see below for
|
||||
details), so the capabilities of this "abc remover" are limited.
|
||||
|
||||
These are simple guidelines:
|
||||
- Only expressions of the following kinds are handled:
|
||||
- constant
|
||||
- variable [+/- constant]
|
||||
- Only comparisons between "handled" expressions are understood.
|
||||
- "switch" statements are not yet handled.
|
||||
|
||||
This means that code like this will be handled well:
|
||||
|
||||
for (int i = 0; i < a.Length; i++) {
|
||||
a [i] = .....
|
||||
}
|
||||
|
||||
The "i" variable could be declared out of the "for", the "for" could be a
|
||||
"while", and maybe even implemented with "goto", the array could be scanned
|
||||
in reverse order, and everything would still work.
|
||||
I could have a temporary variable storing the array length, and check on
|
||||
it inside the loop, and the abc removal would still occurr, like this:
|
||||
|
||||
int i = 0;
|
||||
int l = a.Length;
|
||||
while ( i < l ) {
|
||||
a [i] ......
|
||||
}
|
||||
|
||||
or this:
|
||||
|
||||
int l = a.Length;
|
||||
for (int i = l; i > 0; i--) {
|
||||
a [i] = .....
|
||||
}
|
||||
|
||||
The following two examples would work:
|
||||
|
||||
for (int i = 0; i < (a.Length -1); i++) .....
|
||||
for (int i = 0; i < a.Length; i += 2) .....
|
||||
|
||||
But just something like this
|
||||
|
||||
int delta = -1;
|
||||
for (int i = 0; i < (a.Length + delta); i++) .....
|
||||
|
||||
or like this
|
||||
|
||||
int delta = +2;
|
||||
for (int i = 0; i < a.Length; i += delta) .....
|
||||
|
||||
would not work, the check would stay there, sorry :-(
|
||||
(unless a combination of cfold, consprop and copyprop is used, too, which
|
||||
would make the constant value of "delta" explicit).
|
||||
|
||||
Just to make you understand how things are tricky... this would work!
|
||||
|
||||
int limit = a.Length - 1;
|
||||
for (int i = 0; i < limit; i++) {
|
||||
a [i] = .....
|
||||
}
|
||||
|
||||
|
||||
A detailed explanation of the reason why things are done like this is given
|
||||
below...
|
||||
|
||||
------------------------------------------------------------------------------
|
||||
THE ALGORITHM
|
||||
|
||||
This array bound check removal (abc removal) algorithm is based on
|
||||
symbolic execution concepts. I handle the removal like an "unreachable
|
||||
code elimination" (and in fact the optimization could be extended to remove
|
||||
also other unreachable sections of code, due to branches that "always go the
|
||||
same way").
|
||||
|
||||
In symbolic execution, variables do not have actual (numeric) values, but
|
||||
instead symbolic expressions (like "a", or "x+y").
|
||||
Also, branch conditions are handled like symbolic conditions (like "i<k"),
|
||||
which state relations between variable values.
|
||||
|
||||
The SSA representation inside mini is somewhat close to a symbolic
|
||||
representation of the execution of the compiled method.
|
||||
Particularly, the representation of variable values is exactly a symbolic
|
||||
one. It is enough to find all CEE_STIND_* instructions which store to a
|
||||
local variable, and their second argument is exactly the variable value.
|
||||
Actually, "cfg->vars [<variable-index>]->def" should contain exactly
|
||||
those store instructions, and the "get_variable_value_from_ssa_store"
|
||||
function extracts the variable value from there.
|
||||
|
||||
On the other hand, the conditions under which each basic block is
|
||||
executed are not made fully explicit.
|
||||
|
||||
However, it is not difficult to make them so.
|
||||
Each BB that has more than one exit BB, in practice must end either with
|
||||
a conditional branch instruction or with a switch instruction.
|
||||
In the first case, the BB has exactly two exit BBs, and their execution
|
||||
conditions are easy to get from the condition of the branch (see the
|
||||
"get_relation_from_branch_instruction" function, and expecially the end of
|
||||
"analyze_block" in abcremoval.c.
|
||||
If there is a switch, the jump condition of every exit BB is the equality
|
||||
of the switch argument with the particular index associated with its case
|
||||
(but the current implementation does not handle switch statements yet).
|
||||
|
||||
These individual conditions are in practice associated to each arc that
|
||||
connects BBs in the CFG (with the simple case that unconditional branches
|
||||
have a "TRUE" condition, because they always happen).
|
||||
|
||||
So, for each BB, its *proper* entry condition is the union of all the
|
||||
conditions associated to arcs that enter the BB. The "union" is like a
|
||||
logical "or", in the sense that either of the condition could be true,
|
||||
they are not necessarily all true. This means that if I can enter a BB
|
||||
in two ways, and in one case I know that "x>0", and in the other that
|
||||
"x==0", actually in the BB I know that "x>=0", which is a weaker
|
||||
condition (the union of the two).
|
||||
|
||||
Also, the *complete* entry condition for a BB is the "intersection" of all
|
||||
the entry conditions of its dominators. This is true because each dominator
|
||||
is the only way to reach the BB, so the entry condition of each dominator
|
||||
must be true if the control flow reached the BB. This translates to the
|
||||
logical "and" of all the "proper" conditions of the BBs met walking up in the
|
||||
dominator tree. So, if one says "x>0", and another "x==1", then I know
|
||||
that "x==1", which is a stronger condition (the intersection of the two).
|
||||
Note that, if the two conditions were "x>0" and "x==0", then the block would
|
||||
be unreachable (the intersection is empty), because some branch is impossible.
|
||||
|
||||
Another observation is that, inside each BB, every variable is subject to the
|
||||
complete entry condition of that very same BB, and not the one in which it is
|
||||
defined (with the "complete entry condition" being the thing I defined before,
|
||||
sorry if these terms "proper" and "complete" are strange, I found nothing
|
||||
better).
|
||||
This happens because the branch conditions are related to the control flow.
|
||||
I can define "i=a", and if I am in a BB where "a>0", then "i>0", but not
|
||||
otherwise.
|
||||
|
||||
So, intuitively, if the available conditions say "i>=0", and i is used as an
|
||||
index in an array access, then the lower bound check can be omitted.
|
||||
If the condition also says "(i>=0)&&(i<array.length)", the abc removal can
|
||||
occur.
|
||||
|
||||
So, a complete solution to the problem of abc removal would be the following:
|
||||
for each array access, build a system of equations containing:
|
||||
[1] all the symbolic variable definitions
|
||||
[2] the complete entry condition of the BB in which the array access occurs
|
||||
[3] the two "goal functions" ("index >=0" and "index < array.length")
|
||||
If the system is valid for *each possible* variable value, then the goal
|
||||
functions are always true, and the abc can be removed.
|
||||
|
||||
All this discussion is useful to give a precise specification to the problem
|
||||
we are trying to solve.
|
||||
The trouble is that, in the general case, the resulting system of equations
|
||||
is like a predicate in first order logic, which is semi-decidable, and its
|
||||
general solution is anyway too complex to be attempted in a JIT compiler
|
||||
(which should not contain a full fledged theorem prover).
|
||||
|
||||
Therefore, we must cut some corner.
|
||||
|
||||
|
||||
By the way, there is also another big problem, which is caused by "recursive"
|
||||
symbolic definitions. These definition can (and generally do) happen every
|
||||
time there is a loop. For instance, in the following piece of code
|
||||
|
||||
for ( int i = 0; i < array.length; i++ ) {
|
||||
Console.WriteLine( "array [i] = " + array [i] );
|
||||
}
|
||||
|
||||
one of the definitions of i is a PHI that can be either 0 or "i + 1".
|
||||
|
||||
Now, we know that mathematically "i = i + 1" does not make sense, and in
|
||||
fact symbolic values are not "equations", they are "symbolic definitions".
|
||||
|
||||
The actual symbolic value of i is a generic "n", where "n" is the number of
|
||||
iterations of the loop, but this is terrible to handle (and in more complex
|
||||
examples the symbolic value of i simply cannot be written, because i is
|
||||
calculated in an iterative way).
|
||||
|
||||
However, the definition "i = i + 1" tells us something about i: it tells us
|
||||
that i "grows". So (from the PHI definition) we know that i is either 0, or
|
||||
"grows". This is enough to tell that "i>=0", which is what we want!
|
||||
It is important to note that recursive definitions can only occurr inside
|
||||
PHI definitions, because actually a variable cannot be defined *only* in terms
|
||||
of itself!
|
||||
|
||||
|
||||
At this point, I can explain which corners I want to cut to make the
|
||||
problem solvable. It will not remove all the abc that could theoretically
|
||||
be removed, but at least it will work.
|
||||
|
||||
The easiest way to cut corners is to only handle expressions which are
|
||||
"reasonably simple", and ignore the rest.
|
||||
Keep in mind that ignoring an expression is not harmful in itself.
|
||||
The algorithm will be simply "less powerful", because it will ignore
|
||||
conditions that could have caused to the removal of an abc, but will
|
||||
not remove checks "by mistake" (so the resulting code will be in any case
|
||||
correct).
|
||||
|
||||
The expressions we handle are the following (all of integer type):
|
||||
- constant
|
||||
- variable
|
||||
- variable + constant
|
||||
- constant + variable
|
||||
- variable - constant
|
||||
|
||||
And, of course, PHI definitions.
|
||||
Any other expression causes the introduction of an "any" value in the
|
||||
evaluation, which makes all values that depend from it unknown as well.
|
||||
|
||||
We will call these kind of definitions "summarizable" definitions.
|
||||
|
||||
In a first attempt, we can consider only branch conditions that have the
|
||||
simplest possible form (the comparison of two summarizable expressions).
|
||||
|
||||
We can also simplify the effect of variable definitions, keeping only
|
||||
what is relevant to know: their value range with respect to zero and with
|
||||
respect to the length of the array we are currently handling.
|
||||
|
||||
One particular note on PHI functions: they work (obviously) like the logical
|
||||
"or" of their definitions, and therefore are equivalent to the "logical or"
|
||||
of the summarization of their definitions.
|
||||
|
||||
About recursive definitions (which, believe me, are the worst thing in all
|
||||
this mess), we handle only "monotonic" ones. That is, we try to understand
|
||||
if the recursive definition (which, as we said above, must happen because
|
||||
of a loop) always "grows" or "gets smaller". In all other cases, we decide
|
||||
we cannot handle it.
|
||||
|
||||
|
||||
One critical thing, once we have defined all these data structures, is how
|
||||
the evaluation is actually performed.
|
||||
|
||||
In a first attempt I coded a "brute force" approach, which for each BB
|
||||
tried to examine all possible conditions between all variables, filling
|
||||
a sort of "evaluation matrix". The problem was that the complexity of this
|
||||
evaluation was quadratic (or worse) on the number of variables, and that
|
||||
many wariables were examined even if they were not involved in any array
|
||||
access.
|
||||
|
||||
Following the ABCD paper (http://citeseer.ist.psu.edu/bodik00abcd.html),
|
||||
I rewrote the algorithm in a more "sparse" way.
|
||||
Now, the main data structure is a graph of relations between variables, and
|
||||
each attempt to remove a check performs a traversal of the graph, looking
|
||||
for a path from the index to the array length that satisfies the properties
|
||||
"index >= 0" and "index < length". If such a path is found, the check is
|
||||
removed. It is true that in theory *each* traversal has a complexity which
|
||||
is exponential on the number of variables, but in practice the graph is not
|
||||
very connected, so the traversal terminates quickly.
|
||||
|
||||
|
||||
Then, the algorithm to optimize one method looks like this:
|
||||
|
||||
[1] Preparation:
|
||||
[1a] Build the SSA representation.
|
||||
[1b] Prepare the evaluation graph (empty)
|
||||
[1b] Summarize each varible definition, and put the resulting relations
|
||||
in the evaluation graph
|
||||
[2] Analyze each BB, starting from the entry point and following the
|
||||
dominator tree:
|
||||
[2a] Summarize its entry condition, and put the resulting relations
|
||||
in the evaluation graph (this is the reason why the BBs are examined
|
||||
following the dominator tree, so that conditions are added to the
|
||||
graph in a "cumulative" way)
|
||||
[2b] Scan the BB instructions, and for each array access perform step [3]
|
||||
[2c] Process children BBs following the dominator tree (step [2])
|
||||
[2d] Remove from the evaluation area the conditions added at step [2a]
|
||||
(so that backtracking along the tree the area is properly cleared)
|
||||
[3] Attempt the removal:
|
||||
[3a] Summarize the index expression, to see if we can handle it; there
|
||||
are three cases: the index is either a constant, or a variable (with
|
||||
an optional delta) or cannot be handled (is a "any")
|
||||
[3b] If the index can be handled, traverse the evaluation area searching
|
||||
a path from the index variable to the array length (if the index is
|
||||
a constant, just examine the array length to see if it has some
|
||||
relation with this constant)
|
||||
[3c] Use the results of step [3b] to decide if the check is redundant
|
||||
|
||||
|
||||
@@ -1,173 +0,0 @@
|
||||
Mono Ahead Of Time Compiler
|
||||
===========================
|
||||
|
||||
The Ahead of Time compilation feature in Mono allows Mono to
|
||||
precompile assemblies to minimize JIT time, reduce memory
|
||||
usage at runtime and increase the code sharing across multiple
|
||||
running Mono application.
|
||||
|
||||
To precompile an assembly use the following command:
|
||||
|
||||
mono --aot -O=all assembly.exe
|
||||
|
||||
The `--aot' flag instructs Mono to ahead-of-time compile your
|
||||
assembly, while the -O=all flag instructs Mono to use all the
|
||||
available optimizations.
|
||||
|
||||
* Position Independent Code
|
||||
---------------------------
|
||||
|
||||
On x86 and x86-64 the code generated by Ahead-of-Time compiled
|
||||
images is position-independent code. This allows the same
|
||||
precompiled image to be reused across multiple applications
|
||||
without having different copies: this is the same way in which
|
||||
ELF shared libraries work: the code produced can be relocated
|
||||
to any address.
|
||||
|
||||
The implementation of Position Independent Code had a
|
||||
performance impact on Ahead-of-Time compiled images but
|
||||
compiler bootstraps are still faster than JIT-compiled images,
|
||||
specially with all the new optimizations provided by the Mono
|
||||
engine.
|
||||
|
||||
* How to support Position Independent Code in new Mono Ports
|
||||
------------------------------------------------------------
|
||||
|
||||
Generated native code needs to reference various runtime
|
||||
structures/functions whose address is only known at run
|
||||
time. JITted code can simple embed the address into the native
|
||||
code, but AOT code needs to do an indirection. This
|
||||
indirection is done through a table called the Global Offset
|
||||
Table (GOT), which is similar to the GOT table in the Elf
|
||||
spec. When the runtime saves the AOT image, it saves some
|
||||
information for each method describing the GOT table entries
|
||||
used by that method. When loading a method from an AOT image,
|
||||
the runtime will fill out the GOT entries needed by the
|
||||
method.
|
||||
|
||||
* Computing the address of the GOT
|
||||
|
||||
Methods which need to access the GOT first need to compute its
|
||||
address. On the x86 it is done by code like this:
|
||||
|
||||
call <IP + 5>
|
||||
pop ebx
|
||||
add <OFFSET TO GOT>, ebx
|
||||
<save got addr to a register>
|
||||
|
||||
The variable representing the got is stored in
|
||||
cfg->got_var. It is allways allocated to a global register to
|
||||
prevent some problems with branches + basic blocks.
|
||||
|
||||
* Referencing GOT entries
|
||||
|
||||
Any time the native code needs to access some other runtime
|
||||
structure/function (i.e. any time the backend calls
|
||||
mono_add_patch_info ()), the code pointed by the patch needs
|
||||
to load the value from the got. For example, instead of:
|
||||
|
||||
call <ABSOLUTE ADDR>
|
||||
it needs to do:
|
||||
call *<OFFSET>(<GOT REG>)
|
||||
|
||||
Here, the <OFFSET> can be 0, it will be fixed up by the AOT compiler.
|
||||
|
||||
For more examples on the changes required, see
|
||||
|
||||
svn diff -r 37739:38213 mini-x86.c
|
||||
|
||||
* The Precompiled File Format
|
||||
-----------------------------
|
||||
|
||||
We use the native object format of the platform. That way it
|
||||
is possible to reuse existing tools like objdump and the
|
||||
dynamic loader. All we need is a working assembler, i.e. we
|
||||
write out a text file which is then passed to gas (the gnu
|
||||
assembler) to generate the object file.
|
||||
|
||||
The precompiled image is stored in a file next to the original
|
||||
assembly that is precompiled with the native extension for a shared
|
||||
library (on Linux its ".so" to the generated file).
|
||||
|
||||
For example: basic.exe -> basic.exe.so; corlib.dll -> corlib.dll.so
|
||||
|
||||
The following things are saved in the object file and can be
|
||||
looked up using the equivalent to dlsym:
|
||||
|
||||
mono_assembly_guid
|
||||
|
||||
A copy of the assembly GUID.
|
||||
|
||||
mono_aot_version
|
||||
|
||||
The format of the AOT file format.
|
||||
|
||||
mono_aot_opt_flags
|
||||
|
||||
The optimizations flags used to build this
|
||||
precompiled image.
|
||||
|
||||
method_infos
|
||||
|
||||
Contains additional information needed by the runtime for using the
|
||||
precompiled method, like the GOT entries it uses.
|
||||
|
||||
method_info_offsets
|
||||
|
||||
Maps method indexes to offsets in the method_infos array.
|
||||
|
||||
mono_icall_table
|
||||
|
||||
A table that lists all the internal calls
|
||||
references by the precompiled image.
|
||||
|
||||
mono_image_table
|
||||
|
||||
A list of assemblies referenced by this AOT
|
||||
module.
|
||||
|
||||
method_offsets
|
||||
|
||||
The equivalent to a procedure linkage table.
|
||||
|
||||
* Performance considerations
|
||||
----------------------------
|
||||
|
||||
Using AOT code is a trade-off which might lead to higher or slower performance,
|
||||
depending on a lot of circumstances. Some of these are:
|
||||
|
||||
- AOT code needs to be loaded from disk before being used, so cold startup of
|
||||
an application using AOT code MIGHT be slower than using JITed code. Warm
|
||||
startup (when the code is already in the machines cache) should be faster.
|
||||
Also, JITing code takes time, and the JIT compiler also need to load
|
||||
additional metadata for the method from the disk, so startup can be faster
|
||||
even in the cold startup case.
|
||||
- AOT code is usually compiled with all optimizations turned on, while JITted
|
||||
code is usually compiled with default optimizations, so the generated code
|
||||
in the AOT case should be faster.
|
||||
- JITted code can directly access runtime data structures and helper functions,
|
||||
while AOT code needs to go through an indirection (the GOT) to access them,
|
||||
so it will be slower and somewhat bigger as well.
|
||||
- When JITting code, the JIT compiler needs to load a lot of metadata about
|
||||
methods and types into memory.
|
||||
- JITted code has better locality, meaning that if A method calls B, then
|
||||
the native code for A and B is usually quite close in memory, leading to
|
||||
better cache behaviour thus improved performance. In contrast, the native
|
||||
code of methods inside the AOT file is in a somewhat random order.
|
||||
|
||||
* Future Work
|
||||
-------------
|
||||
|
||||
- Currently, the runtime needs to setup some data structures and fill out
|
||||
GOT entries before a method is first called. This means that even calls to
|
||||
a method whose code is in the same AOT image need to go through the GOT,
|
||||
instead of using a direct call.
|
||||
- On x86, the generated code uses call 0, pop REG, add GOTOFFSET, REG to
|
||||
materialize the GOT address. Newer versions of gcc use a separate function
|
||||
to do this, maybe we need to do the same.
|
||||
- Currently, we get vtable addresses from the GOT. Another solution would be
|
||||
to store the data from the vtables in the .bss section, so accessing them
|
||||
would involve less indirection.
|
||||
|
||||
|
||||
|
||||
@@ -1,57 +0,0 @@
|
||||
|
||||
HOWTO bundle assemblies inside the mono runtime.
|
||||
Paolo Molaro ([email protected])
|
||||
|
||||
* Intent
|
||||
|
||||
Bundling assemblies inside the mono runtime may be useful for a number
|
||||
of reasons:
|
||||
|
||||
* creating a standalone complete runtime that can be more easily
|
||||
distributed
|
||||
|
||||
* having an application run against a known set of assemblies
|
||||
that has been tested
|
||||
|
||||
Of course, there are drawbacks, too: if there has been fixes
|
||||
to the assemblies, replacing them means recompiling the
|
||||
runtime as well and if there are other mono apps, unless they
|
||||
use the same mono binary, there will be less opportunities for
|
||||
the operating system to optimize memory usage. So use this
|
||||
feature only when really needed.
|
||||
|
||||
* Creating the Bundle
|
||||
|
||||
To bundle a set of assemblies, you need to create a file that
|
||||
lists the assembly names and the relative files. Empty lines
|
||||
and lines starting with # are ignored:
|
||||
|
||||
== cut cut ==
|
||||
# Sample bundle template
|
||||
mscorlib: /path/to/mscorlib/assembly.dll
|
||||
myapp: /path/to/myapp.exe
|
||||
== cut cut ==
|
||||
|
||||
Next you need to build the mono runtime using a special configure option:
|
||||
|
||||
./configure --with-bundle=/path/to/bundle/template
|
||||
|
||||
The path to the template should be an absolute path.
|
||||
|
||||
The script metadata/make-bundle.pl will take the specifie
|
||||
assemblies and embed them inside the runtime where the loading
|
||||
routines can find them before searching for them on disk.
|
||||
|
||||
* Open Issues
|
||||
|
||||
There are still two issues to solve:
|
||||
|
||||
* config files: sometimes they are needed but they are
|
||||
not yet bundled inside the library ()
|
||||
|
||||
* building with the included libgc makes it not
|
||||
possible to build a mono binary statically linked to
|
||||
libmono: this needs to be fixed to make bundles
|
||||
really useful.
|
||||
|
||||
|
||||
@@ -1,293 +0,0 @@
|
||||
|
||||
Embedding the Mono runtime, preliminary version
|
||||
Miguel de Icaza ([email protected]),
|
||||
Paolo Molaro ([email protected])
|
||||
|
||||
|
||||
This document describes how to embed the Mono runtime in your
|
||||
application, and how to invoke CIL methods from C, and how to
|
||||
invoke C code from CIL. Both the JIT and interpreter can be
|
||||
embedded in very similar ways so most of what is described
|
||||
here can be used in either case.
|
||||
|
||||
* IMPORTANT
|
||||
|
||||
This document is now outdated, see:
|
||||
|
||||
http://www.mono-project.com/Embedding_Mono
|
||||
|
||||
For an up-to-date version of this document
|
||||
|
||||
* Embedding the runtime.
|
||||
|
||||
Embedding the runtime consists of various steps:
|
||||
|
||||
* Compiling and linking the Mono runtime
|
||||
|
||||
* Initializing the Mono runtime
|
||||
|
||||
* Optionally expose C code to the C#/CIL universe.
|
||||
|
||||
These are discussed in detail next.
|
||||
|
||||
** Compiling and Linking
|
||||
|
||||
To embed the runtime, you have to link your code against the
|
||||
Mono runtime libraries. To do this, you want to pass the
|
||||
flags returned by pkg-config to your compiler:
|
||||
|
||||
pkg-config --cflags --libs mono
|
||||
|
||||
is used to get the flags for the JIT runtime and
|
||||
|
||||
pkg-config --cflags --libs mint
|
||||
|
||||
for the interpreted runtime.
|
||||
|
||||
Like this:
|
||||
|
||||
gcc sample.c `pkg-config --cflags --libs mono`
|
||||
|
||||
You can separate the compilation flags from the linking flags, for
|
||||
instance, you can use the following macros in your makefile:
|
||||
|
||||
CFLAGS=`pkg-config --cflags mono`
|
||||
LDFLAGS=`pkg-config --libs mono`
|
||||
|
||||
** Initializing the Mono runtime
|
||||
|
||||
To initialize the JIT runtime, call mono_jit_init, like this:
|
||||
|
||||
#include <mono/mini/jit.h>
|
||||
|
||||
MonoDomain *domain;
|
||||
|
||||
domain = mono_jit_init ("domain-name");
|
||||
|
||||
For the interpreted runtime use mono_interp_init instead:
|
||||
|
||||
#include <mono/interpreter/embed.h>
|
||||
|
||||
MonoDomain *domain;
|
||||
|
||||
domain = mono_interp_init ("domain-name");
|
||||
|
||||
That will return a MonoDomain where your code will be
|
||||
executed. You can create multiple domains. Each domain is
|
||||
isolated from the other domains and code in one domain will
|
||||
not interfere with code in other domains. This is useful if
|
||||
you want to host different applications in your program.
|
||||
|
||||
Now, it is necessary to transfer control to Mono, and setup
|
||||
the threading infrastructure, you do this like this:
|
||||
|
||||
void *user_data = NULL;
|
||||
|
||||
mono_runtime_exec_managed_code (domain, main_thread_handler, user_data);
|
||||
|
||||
Where your main_thread_handler can load your assembly and execute it:
|
||||
|
||||
static void main_thread_handler (gpointer user_data)
|
||||
|
||||
MonoAssembly *assembly;
|
||||
|
||||
assembly = mono_domain_assembly_open (domain, "file.dll");
|
||||
if (!assembly)
|
||||
error ();
|
||||
|
||||
In the above example, the contents of `file.dll' will be
|
||||
loaded into the domain. This only loads the code, but it will
|
||||
not execute anything yet. You can replace `file.dll' with
|
||||
another transport file, like `file.exe'
|
||||
|
||||
To start executing code, you must invoke a method in the
|
||||
assembly, or if you have provided a static Main method (an
|
||||
entry point), you can use the convenience function:
|
||||
|
||||
retval = mono_jit_exec (domain, assembly, argc - 1, argv + 1);
|
||||
|
||||
or when using the interpreter use:
|
||||
|
||||
retval = mono_interp_exec (domain, assembly, argc - 1, argv + 1);
|
||||
|
||||
If you want to invoke a different method, look at the
|
||||
`Invoking Methods in the CIL universe' section later on.
|
||||
|
||||
** Shutting down the runtime
|
||||
|
||||
To shutdown the Mono runtime, you have to clean up all the
|
||||
domains that were created, use this function:
|
||||
|
||||
mono_jit_cleanup (domain);
|
||||
|
||||
Or in the case of the interpreted runtime use:
|
||||
|
||||
mono_interp_cleanup (domain);
|
||||
|
||||
** Applications that use threads.
|
||||
|
||||
The Boehm GC system needs to catch your calls to the pthreads
|
||||
layer, so in each file where you use pthread.h you should
|
||||
include the <gc/gc.h> file.
|
||||
|
||||
If you can not do this for any reasons, just remember that you
|
||||
can not store pointers to Mono Objects on the stack, you can
|
||||
store them safely in the heap, or in global variables though
|
||||
|
||||
* Exposing C code to the CIL universe
|
||||
|
||||
The Mono runtime provides two mechanisms to expose C code to
|
||||
the CIL universe: internal calls and native C code. Internal
|
||||
calls are tightly integrated with the runtime, and have the
|
||||
least overhead, as they use the same data types that the
|
||||
runtime uses.
|
||||
|
||||
The other option is to use the Platform Invoke (P/Invoke) to
|
||||
call C code from the CIL universe, using the standard P/Invoke
|
||||
mechanisms.
|
||||
|
||||
To register an internal call, use this call in the C code:
|
||||
|
||||
mono_add_internal_call ("Hello::Sample", sample);
|
||||
|
||||
Now, you need to declare this on the C# side:
|
||||
|
||||
using System;
|
||||
using System.Runtime.CompilerServices;
|
||||
|
||||
class Hello {
|
||||
[MethodImplAttribute(MethodImplOptions.InternalCall)]
|
||||
extern static string Sample ();
|
||||
}
|
||||
|
||||
Since this routine returns a string, here is the C definition:
|
||||
|
||||
static MonoString*
|
||||
Sample ()
|
||||
{
|
||||
return mono_string_new (mono_domain_get (), "Hello!");
|
||||
}
|
||||
|
||||
Notice that we have to return a `MonoString', and we use the
|
||||
`mono_string_new' API call to obtain this from a string.
|
||||
|
||||
* Invoking Methods in the CIL universe
|
||||
|
||||
Calling a method in the CIL universe from C requires a number of steps:
|
||||
|
||||
* Obtaining the MonoMethod handle to the method.
|
||||
|
||||
* The method invocation.
|
||||
|
||||
** Obtaining a MonoMethod
|
||||
|
||||
To get a MonoMethod there are several ways.
|
||||
|
||||
You can get a MonoClass (the structure representing a type)
|
||||
using:
|
||||
|
||||
MonoClass *
|
||||
mono_class_from_name (MonoImage *image, const char* name_space, const char *name);
|
||||
|
||||
and then loop in the returned class method array until you get
|
||||
the one you're looking for. There are examples of such
|
||||
searches as static functions in several C files in
|
||||
metadata/*.c: we need to expose one through the API and remove
|
||||
the duplicates.
|
||||
|
||||
The other, simpler, way is to use the functions in
|
||||
debug-helpers.h: there are examples of their use in monograph,
|
||||
mint and the jit as well. You basically use a string
|
||||
description of the method, like:
|
||||
|
||||
"System.Object:GetHashCode()"
|
||||
|
||||
and create a MonoMethodDesc out of it with:
|
||||
|
||||
MonoMethodDesc* mono_method_desc_new (const char *name, gboolean include_namespace);
|
||||
|
||||
You can then use:
|
||||
|
||||
MonoMethod* mono_method_desc_search_in_class (MonoMethodDesc *desc, MonoClass *klass);
|
||||
MonoMethod* mono_method_desc_search_in_image (MonoMethodDesc *desc, MonoImage *image);
|
||||
|
||||
to search for the method in a class or in an image. You would
|
||||
tipically do this just once at the start of the program and
|
||||
store the result for reuse somewhere.
|
||||
|
||||
** Invoking a Method
|
||||
|
||||
There are two functions to call a managed method:
|
||||
|
||||
MonoObject*
|
||||
mono_runtime_invoke (MonoMethod *method, void *obj, void **params,
|
||||
MonoObject **exc);
|
||||
and
|
||||
MonoObject*
|
||||
mono_runtime_invoke_array (MonoMethod *method, void *obj, MonoArray *params,
|
||||
MonoObject **exc);
|
||||
|
||||
obj is the 'this' pointer, it should be NULL for static
|
||||
methods, a MonoObject* for object instances and a pointer to
|
||||
the value type for value types.
|
||||
|
||||
These functions can be used in both the JIT and the interpreted
|
||||
environments.
|
||||
|
||||
The params array contains the arguments to the method with the
|
||||
same convention: MonoObject* pointers for object instances and
|
||||
pointers to the value type otherwise. The _invoke_array
|
||||
variant takes a C# object[] as the params argument (MonoArray
|
||||
*params): in this case the value types are boxed inside the
|
||||
respective reference representation.
|
||||
|
||||
From unmanaged code you'll usually use the
|
||||
mono_runtime_invoke() variant.
|
||||
|
||||
Note that this function doesn't handle virtual methods for
|
||||
you, it will exec the exact method you pass: we still need to
|
||||
expose a function to lookup the derived class implementation
|
||||
of a virtual method (there are examples of this in the code,
|
||||
though).
|
||||
|
||||
You can pass NULL as the exc argument if you don't want to
|
||||
catch exceptions, otherwise, *exc will be set to the exception
|
||||
thrown, if any. if an exception is thrown, you can't use the
|
||||
MonoObject* result from the function.
|
||||
|
||||
If the method returns a value type, it is boxed in an object
|
||||
reference.
|
||||
|
||||
We have plans for providing an additional method that returns
|
||||
an unmanaged->managed thunk like this:
|
||||
|
||||
void* mono_method_get_unmanaged_thunk (MonoMethod *method);
|
||||
|
||||
You'll be able to store the returned pointer in a function
|
||||
pointer with the proper signature and call that directly from
|
||||
C:
|
||||
|
||||
typedef gint32 (*GetHashCode) (MonoObject *obj);
|
||||
|
||||
GetHashCode func = mono_method_get_unmanaged_thunk (System_Object_GetHashCode_method);
|
||||
|
||||
gint32 hashvalue = func (myobject);
|
||||
|
||||
It may not be possible to manage exceptions in that case,
|
||||
though. I need to think more about it.
|
||||
|
||||
** Threading issues
|
||||
|
||||
If your application creates threads on its own, and you want them to
|
||||
be able to call code into the CIL universe with Mono, you have to
|
||||
register the thread with Mono before issuing the call.
|
||||
|
||||
To do so, call the mono_thread_attach() function before you execute
|
||||
any managed code from the thread
|
||||
|
||||
* Samples
|
||||
|
||||
See the sample programs in mono/sample/embed for examples of
|
||||
embedding the Mono runtime in your application.
|
||||
|
||||
|
||||
@@ -1,253 +0,0 @@
|
||||
|
||||
Exception Handling In the Mono Runtime
|
||||
--------------------------------------
|
||||
|
||||
Introduction
|
||||
------------
|
||||
|
||||
There are many types of exceptions which the runtime needs to handle. These
|
||||
are:
|
||||
- exceptions thrown from managed code using the 'throw' or 'rethrow' CIL
|
||||
instructions.
|
||||
- exceptions thrown by some IL instructions like InvalidCastException thrown
|
||||
by the 'castclass' CIL instruction.
|
||||
- exceptions thrown by runtime code
|
||||
- synchronous signals received while in managed code
|
||||
- synchronous signals received while in native code
|
||||
- asynchronous signals
|
||||
|
||||
Since exception handling is very arch dependent, parts of the exception
|
||||
handling code reside in the arch specific exceptions-<ARCH>.c files. The
|
||||
architecture independent parts are in mini-exceptions.c. The different
|
||||
exception types listed above are generated in different parts of the runtime,
|
||||
but ultimately, they all end up in the mono_handle_exception () function in
|
||||
mini-exceptions.c.
|
||||
|
||||
Exceptions throw programmatically from managed code
|
||||
---------------------------------------------------
|
||||
|
||||
These exceptions are thrown from managed code using 'throw' or 'rethrow' CIL
|
||||
instructions. The JIT compiler will translate them to a call to a helper
|
||||
function called 'mono_arch_throw/rethrow_exception'. These helper functions do
|
||||
not exist at compile time, they are created dynamically at run time by the
|
||||
code in the exceptions-<ARCH>.c files. They perform various stack
|
||||
manipulation magic, then call a helper function usually named throw_exception (), which
|
||||
does further processing in C code, then calls mono_handle_exception () to do the rest.
|
||||
|
||||
Exceptions thrown implicitly from managed code
|
||||
----------------------------------------------
|
||||
|
||||
These exceptions are thrown by some IL instructions when something goes wrong.
|
||||
When the JIT needs to throw such an exception, it emits a forward conditional
|
||||
branch and remembers its position, along with the exception which needs to
|
||||
be emitted. This is usually done in macros named EMIT_COND_SYSTEM_EXCEPTION in
|
||||
the mini-<ARCH>.c files. After the machine code for the method is emitted, the
|
||||
JIT calls the arch dependent mono_arch_emit_exceptions () function which will
|
||||
add the exception throwing code to the end of the method, and patches up the
|
||||
previous forward branches so they will point to this code. This has the
|
||||
advantage that the rarely-executed exception throwing code is kept separate
|
||||
from the method body, leading to better icache performance.
|
||||
The exception throwing code braches to the dynamically generated
|
||||
mono_arch_throw_corlib_exception helper function, which will create the
|
||||
proper exception object, does some stack manipulation, then calls
|
||||
throw_exception ().
|
||||
|
||||
Exceptions thrown by runtime code
|
||||
---------------------------------
|
||||
|
||||
These exceptions are usually thrown by the implementations of InternalCalls
|
||||
(icalls). First an appropriate exception object is created with the help of
|
||||
various helper functions in metadata/exception.c, which has a separate helper
|
||||
function for allocating each kind of exception object used by the runtime code.
|
||||
Then the mono_raise_exception () function is called to actually throw the
|
||||
exception. That function never returns.
|
||||
|
||||
An example:
|
||||
if (something_is_wrong)
|
||||
mono_raise_exception (mono_get_exception_index_out_of_range ());
|
||||
|
||||
mono_raise_exception () simply passes the exception to the JIT side through
|
||||
an API, where it will be received by helper created by mono_arch_throw_exception (). From now on, it is treated as an exception thrown from managed code.
|
||||
|
||||
Synchronous signals
|
||||
-------------------
|
||||
|
||||
For performance reasons, the runtime does not do same checks required by the
|
||||
CLI spec. Instead, it relies on the CPU to do them. The two main checks which
|
||||
are omitted are null-pointer checks, and arithmetic checks. When a null
|
||||
pointer is dereferenced by JITted code, the CPU will notify the kernel through
|
||||
an interrupt, and the kernel will send a SIGSEGV signal to the process. The
|
||||
runtime installs a signal handler for SIGSEGV, which is
|
||||
sigsegv_signal_handler () in mini.c. The signal handler creates the appropriate
|
||||
exception object and calls mono_handle_exception () with it. Arithmetic
|
||||
exceptions like division by zero are handled similarly.
|
||||
|
||||
Synchronous signals in native code
|
||||
----------------------------------
|
||||
|
||||
Receiving a signal such as SIGSEGV while in native code means something very
|
||||
bad has happened. Because of this, the runtime will abort after trying to print a
|
||||
managed plus a native stack trace. The logic is in the mono_handle_native_sigsegv ()
|
||||
function.
|
||||
Note that there are two kinds of native code which can be the source of the signal:
|
||||
- code inside the runtime
|
||||
- code inside a native library loaded by an application, ie. libgtk+
|
||||
|
||||
Stack overflow checking
|
||||
-----------------------
|
||||
|
||||
Stack overflow exceptions need special handling. When a thread overflows its
|
||||
stack, the kernel sends it a normal SIGSEGV signal, but the signal handler
|
||||
tries to execute on the same as the thread leading to a further SIGSEGV which
|
||||
will terminate the thread. A solution is to use an alternative signal stack
|
||||
supported by UNIX operating systems through the sigaltstack (2) system call.
|
||||
When a thread starts up, the runtime will install an altstack using the
|
||||
mono_setup_altstack () function in mini-exceptions.c. When a SIGSEGV is
|
||||
received, the signal handler checks whenever the fault address is near the
|
||||
bottom of the threads normal stack. If it is, a StackOverflowException is
|
||||
created instead of a NullPointerException. This exception is handled like
|
||||
any other exception, with some minor differences.
|
||||
Working sigaltstack support is very much os/kernel/libc dependent, so it is
|
||||
disabled by default.
|
||||
|
||||
Asynchronous signals
|
||||
--------------------
|
||||
|
||||
Async signals are used by the runtime to notify a thread that it needs to
|
||||
change its state somehow. Currently, it is used for implementing
|
||||
thread abort/suspend/resume.
|
||||
|
||||
Handling async signals correctly is a very hard problem, since the receiving
|
||||
thread can be in basically any state upon receipt of the signal. It can
|
||||
execute managed code, native code, it can hold various managed/native locks, or
|
||||
it can be in a process of acquiring them, it can be starting up, shutting down
|
||||
etc. Most of the C APIs used by the runtime are not asynch-signal safe,
|
||||
meaning it is not safe to call them from an async signal handler. In
|
||||
particular, the pthread locking functions are not async-safe, so if a
|
||||
signal handler interrupted code which was in the process of acquiring a lock,
|
||||
and the signal handler tries to acquire a lock, the thread will deadlock.
|
||||
Unfortunately, the current signal handling code does acquire locks, so
|
||||
sometimes it does deadlock.
|
||||
|
||||
When receiving an async signal, the signal handler first tries to determine
|
||||
whenever the thread was executing managed code when it was interrupted. If
|
||||
it did, then it is safe to interrupt it, so a ThreadAbortException is
|
||||
constructed and thrown. If the thread was executing native code, then it is
|
||||
generally not safe to interrupt it. In this case, the runtime sets a flag
|
||||
then returns from the signal handler. That flag is checked every time the
|
||||
runtime returns from native code to managed code, and the exception is thrown
|
||||
then. Also, a platform specific mechanism is used to cause the thread to
|
||||
interrupt any blocking operation it might be doing.
|
||||
|
||||
The async signal handler is in sigusr1_signal_handler () in mini.c, while
|
||||
the logic which determines whenever an exception is safe to be thrown is in
|
||||
mono_thread_request_interruption ().
|
||||
|
||||
Stack unwinding during exception handling
|
||||
-----------------------------------------
|
||||
|
||||
The execution state of a thread during exception handling is stored in an
|
||||
arch-specific structure called MonoContext. This structure contains the values
|
||||
of all the CPU registers relevant during exception handling, which
|
||||
usually means:
|
||||
- IP (instruction pointer)
|
||||
- SP (stack pointer)
|
||||
- FP (frame pointer)
|
||||
- callee saved registers
|
||||
|
||||
Callee saved registers are the registers which are required by any procedure
|
||||
to be saved/restored before/after using them. They are usually defined by
|
||||
each platforms ABI (Application Binary Interface). For example, on x86, they
|
||||
are EBX, ESI and EDI.
|
||||
|
||||
The code which calls mono_handle_exception () is required to construct the
|
||||
initial MonoContext. How this is done depends on the caller. For exceptions
|
||||
thrown from managed code, the mono_arch_throw_exception helper function
|
||||
saves the values of the required registers and passes them to throw_exception (), which will save them in the MonoContext structure. For exceptions thrown from
|
||||
signal handlers, the MonoContext stucture is initialized from the signal info
|
||||
received from the kernel.
|
||||
|
||||
During exception handling, the runtime needs to 'unwind' the stack, i.e.
|
||||
given the state of the thread at a stack frame, construct the state at its
|
||||
callers. Since this is platform specific, it is done by a platform specific
|
||||
function called mono_arch_find_jit_info ().
|
||||
|
||||
Two kinds of stack frames need handling:
|
||||
- Managed frames are easier. The JIT will store some information about each
|
||||
managed method, like which callee-saved registers it uses. Based on this
|
||||
information, mono_arch_find_jit_info () can find the values of the registers
|
||||
on the thread stack, and restore them.
|
||||
- Native frames are problematic, since we have no information about how to
|
||||
unwind through them. Some compilers generate unwind information for code,
|
||||
some don't. Also, there is no general purpose library to obtain and decode
|
||||
this unwind information. So the runtime uses a different solution. When
|
||||
managed code needs to call into native code, it does through a
|
||||
managed->native wrapper function, which is generated by the JIT. This
|
||||
function is responsible for saving the machine state into a per-thread
|
||||
structure called MonoLMF (Last Managed Frame). These LMF structures are
|
||||
stored on the threads stack, and are linked together using one of their
|
||||
fields. When the unwinder encounters a native frame, it simply pops
|
||||
one entry of the LMF 'stack', and uses it to restore the frame state to the
|
||||
moment before control passed to native code. In effect, all successive native
|
||||
frames are skipped together.
|
||||
|
||||
Problems/future work
|
||||
--------------------
|
||||
|
||||
1. Async signal safety
|
||||
----------------------
|
||||
|
||||
The current async signal handling code is not async safe, so it can and does
|
||||
deadlock in practice. It needs to be rewritten to avoid taking locks at least
|
||||
until it can determine that it was interrupting managed code.
|
||||
|
||||
Another problem is the managed stack frame unwinding code. It blindly assumes
|
||||
that if the IP points into a managed frame, then all the callee saved
|
||||
registers + the stack pointer are saved on the stack. This is not true if
|
||||
the thread was interrupted while executing the method prolog/epilog.
|
||||
|
||||
2. Raising exceptions from native code
|
||||
--------------------------------------
|
||||
|
||||
Currently, exceptions are raised by calling mono_raise_exception () in
|
||||
the middle of runtime code. This has two problems:
|
||||
- No cleanup is done, ie. if the caller of the function which throws an
|
||||
exception has taken locks, or allocated memory, that is not cleaned up. For
|
||||
this reason, it is only safe to call mono_raise_exception () 'very close' to
|
||||
managed code, ie. in the icall functions themselves.
|
||||
- To allow mono_raise_exception () to unwind through native code, we need to
|
||||
save the LMF structures which can add a lot of overhead even in the common
|
||||
case when no exception is thrown. So this is not zero-cost exception handling.
|
||||
|
||||
An alternative might be to use a JNI style set-pending-exception API.
|
||||
Runtime code could call mono_set_pending_exception (), then return to its
|
||||
caller with an error indication allowing the caller to clean up. When execution
|
||||
returns to managed code, then managed->native wrapper could check whenever
|
||||
there is a pending exception and throw it if neccesary. Since we already check
|
||||
for pending thread interruption, this would have no overhead, allowing us
|
||||
to drop the LMF saving/restoring code, or significant parts of it.
|
||||
|
||||
4. libunwind
|
||||
------------
|
||||
|
||||
There is an OSS project called libunwind which is a standalone stack unwinding
|
||||
library. It is currently in development, but it is used by default by gcc on
|
||||
ia64 for its stack unwinding. The mono runtime also uses it on ia64. It has
|
||||
several advantages in relation to our current unwinding code:
|
||||
- it has a platform independent API, i.e. the same unwinding code can be used
|
||||
on multiple platforms.
|
||||
- it can generate unwind tables which are correct at every instruction, i.e.
|
||||
can be used for unwinding from async signals.
|
||||
- given sufficient unwind info generated by a C compiler, it can unwind through
|
||||
C code.
|
||||
- most of its API is async-safe
|
||||
- it implements the gcc C++ exception handling API, so in theory it can
|
||||
be used to implement mixed-language exception handling (i.e. C++ exception
|
||||
caught in mono, mono exception caught in C++).
|
||||
- it is MIT licensed
|
||||
|
||||
The biggest problem with libuwind is its platform support. ia64 support is
|
||||
complete/well tested, while support for other platforms is missing/incomplete.
|
||||
|
||||
http://www.hpl.hp.com/research/linux/libunwind/
|
||||
|
||||
-110
@@ -1,110 +0,0 @@
|
||||
Exception Implementation in the Mono Runtime
|
||||
Dietmar Maurer ([email protected])
|
||||
(C) 2001 Ximian, Inc.
|
||||
|
||||
Exception implementation (jit):
|
||||
===============================
|
||||
|
||||
Stack unwinding:
|
||||
================
|
||||
|
||||
We record the code address (start_address, size) of all methods. That way it is
|
||||
possible to map an instruction pointer (IP) to the method information needed
|
||||
for unwinding the stack:
|
||||
|
||||
We also save a Last Managed Frame (LMF) structure at each call from managed to
|
||||
unmanaged code. That way we can recover from exceptions inside unmanaged code.
|
||||
|
||||
void handle_exception ((struct sigcontext *ctx, gpointer obj)
|
||||
{
|
||||
if (ctx->bp < mono_end_of_stack) {
|
||||
/* unhandled exception */
|
||||
abort ();
|
||||
}
|
||||
|
||||
info = mono_jit_info_table_find (mono_jit_info_table, ctx->ip);
|
||||
|
||||
if (info) { // we are inside managed code
|
||||
|
||||
if (ch = find_catch_handler ())
|
||||
execute_catch_handler (ch, ctx, obj);
|
||||
|
||||
execute_all_finally_handler ();
|
||||
|
||||
// restore register, including IP and Frame pointer
|
||||
ctx = restore_caller_saved_registers_from_ctx (ji, ctx);
|
||||
|
||||
// continue unwinding
|
||||
handle_exception (ctx, obj);
|
||||
|
||||
} else {
|
||||
|
||||
lmf = get_last_managed_frame ();
|
||||
|
||||
// restore register, including IP and Frame pointer
|
||||
ctx = restore_caller_saved_registers_from_lmf (ji, lmf);
|
||||
|
||||
// continue unwinding
|
||||
handle_exception (ctx, obj);
|
||||
}
|
||||
}
|
||||
|
||||
|
||||
Code generation:
|
||||
================
|
||||
|
||||
leave: is simply translated into a branch to the target. If the leave
|
||||
instruction is inside a finally block (but not inside another handler)
|
||||
we call the finally handler before we branch to the target.
|
||||
|
||||
finally/endfinally, filter/endfilter: is translated into subroutine ending with
|
||||
a "return" statement. The subroutine does not save EBP, because we need access
|
||||
to the local variables of the enclosing method. Its is possible that
|
||||
instructions inside those handlers modify the stack pointer, thus we save the
|
||||
stack pointer at the start of the handler, and restore it at the end. We have
|
||||
to use a "call" instruction to execute such finally handlers. This makes it
|
||||
also possible to execute them inside the stack unwinding code. The exception
|
||||
object for filters is passed in a local variable (cfg->exvar).
|
||||
|
||||
throw: we first save all regs into a sigcontext struct and then call the stack
|
||||
unwinding code.
|
||||
|
||||
catch handler: catch hanlders are always called from the stack unwinding
|
||||
code. The exception object is passed in a local variable (cfg->exvar).
|
||||
|
||||
gcc support for Exceptions
|
||||
==========================
|
||||
|
||||
gcc supports exceptions in files compiled with the -fexception option. gcc
|
||||
generates DWARF exceptions tables in that case, so it is possible to unwind the
|
||||
stack. The method to read those exception tables is contained in libgcc.a, and
|
||||
in newer versions of glibc (glibc 2.2.5 for example), and it is called
|
||||
__frame_state_for(). Another usable glibc function is backtrace_symbols() which
|
||||
returns the function name corresponding to a code address.
|
||||
|
||||
We dynamically check if those features are available using g_module_symbol(),
|
||||
and we use them only when available. If not available we use the LMF as
|
||||
fallback.
|
||||
|
||||
Using gcc exception information prevents us from saving the LMF at each native
|
||||
call, so this is a way to speed up native calls. This is especially valuable
|
||||
for internal calls, because we can make sure that all internal calls are
|
||||
compiled with -fexceptions (we compile the whole mono runtime with that
|
||||
option).
|
||||
|
||||
All native function are able to call function without exception tables, and so
|
||||
we are unable to restore all caller saved registers if an exception is raised
|
||||
in such function. Well, its possible if the previous function already saves all
|
||||
registers. So we only omit the the LMF if a function has an exception table
|
||||
able to restore all caller saved registers.
|
||||
|
||||
One problem is that gcc almost never saves all caller saved registers, because
|
||||
it is just unnecessary in normal situations. But there is a trick forcing gcc
|
||||
to save all register, we just need to call __builtin_unwind_init() at the
|
||||
beginning of a function. That way gcc generates code to save all caller saved
|
||||
register on the stack.
|
||||
|
||||
|
||||
|
||||
|
||||
|
||||
@@ -1,173 +0,0 @@
|
||||
Rules for opening shared files
|
||||
==============================
|
||||
|
||||
File is already open, with share set to none:
|
||||
|
||||
Can not open again
|
||||
|
||||
|
||||
File is already open for reading, with read share:
|
||||
|
||||
Can open for reading only, share must include read (can have write too)
|
||||
|
||||
|
||||
File is already open for reading, with write share:
|
||||
|
||||
Can open for writing only, share must include read (can have write too)
|
||||
|
||||
|
||||
File is already open for reading, with read + write share:
|
||||
|
||||
Can open for read, writing or both, share must include read (can have write too)
|
||||
|
||||
|
||||
File is already open for writing, with read share:
|
||||
|
||||
Can open for reading only, share must include write (can have read too)
|
||||
|
||||
|
||||
File is already open for writing, with write share:
|
||||
|
||||
Can open for writing only, share must include write (can have read too)
|
||||
|
||||
|
||||
File is already open for writing, with read + write share:
|
||||
|
||||
Can open for reading, writing or both, share must include write (can have read too)
|
||||
|
||||
|
||||
File is already open for reading + writing, with read share:
|
||||
|
||||
Can open for reading only, share must be read + write
|
||||
|
||||
|
||||
File is already open for reading + writing, with write share:
|
||||
|
||||
Can open for for writing only, share must be read + write
|
||||
|
||||
|
||||
File is already open for reading + writing, with read + write share:
|
||||
|
||||
Can open for read, writing or both, share must be read + write
|
||||
|
||||
|
||||
|
||||
Executive Summary
|
||||
-----------------
|
||||
|
||||
Second open must have access within first share, must set second share to at least first access
|
||||
|
||||
|
||||
|
||||
|
||||
Documenting code
|
||||
----------------
|
||||
|
||||
|
||||
#include <stdio.h>
|
||||
#include <windows.h>
|
||||
|
||||
int access[] = {
|
||||
GENERIC_READ,
|
||||
GENERIC_WRITE,
|
||||
GENERIC_READ | GENERIC_WRITE
|
||||
};
|
||||
|
||||
char *access_names[] = {
|
||||
"G_READ",
|
||||
"G_WRITE",
|
||||
"G_READ|G_WRITE"
|
||||
};
|
||||
|
||||
int share[] = {
|
||||
FILE_SHARE_READ,
|
||||
FILE_SHARE_WRITE,
|
||||
FILE_SHARE_READ | FILE_SHARE_WRITE
|
||||
};
|
||||
|
||||
char *share_names[] = {
|
||||
"SHARE_READ",
|
||||
"SHARE_WRITE",
|
||||
"SHARE_READ|SHARE_WRITE"
|
||||
};
|
||||
|
||||
void lockfiles(int access1, int share1, int access2, int share2)
|
||||
{
|
||||
HANDLE h1, h2;
|
||||
BOOL ret;
|
||||
|
||||
if (access2 == 0 && share2 == 0) {
|
||||
printf("\n");
|
||||
printf("%22.22s\n%22.22s", access_names[access1], share_names[share1]);
|
||||
}
|
||||
|
||||
h1 = CreateFile("lockedfile",
|
||||
access[access1],
|
||||
share[share1],
|
||||
NULL, OPEN_ALWAYS, FILE_ATTRIBUTE_NORMAL, NULL);
|
||||
if (h1 == INVALID_HANDLE_VALUE) {
|
||||
printf("Open1 failed: %d\n", GetLastError());
|
||||
return;
|
||||
}
|
||||
|
||||
h2 = CreateFile("lockedfile",
|
||||
access[access2],
|
||||
share[share2],
|
||||
NULL, OPEN_ALWAYS, FILE_ATTRIBUTE_NORMAL, NULL);
|
||||
if (h2 == INVALID_HANDLE_VALUE) {
|
||||
printf(" %4.4s", "");
|
||||
} else {
|
||||
printf(" %4.4s", "OK");
|
||||
CloseHandle(h2);
|
||||
}
|
||||
|
||||
CloseHandle(h1);
|
||||
}
|
||||
|
||||
int main(int argc, char **argv)
|
||||
{
|
||||
int i, j, k, l;
|
||||
|
||||
printf("\t\t\t\t\t\t\tSecond Open\n");
|
||||
printf("%22.22s G_RE G_RE G_RE G_WR G_WR G_WR G_RW G_RW G_RW\n", "");
|
||||
printf("%22.22s S_RE S_WR S_RW S_RE S_WR S_RW S_RE S_WR S_RW", "First open --v ");
|
||||
for (i = 0; i < 3; i++) {
|
||||
for (j = 0; j < 3; j++) {
|
||||
for (k = 0; k < 3; k++) {
|
||||
for (l = 0; l < 3; l++) {
|
||||
lockfiles(i, j, k, l);
|
||||
}
|
||||
}
|
||||
}
|
||||
}
|
||||
|
||||
return(0);
|
||||
}
|
||||
|
||||
|
||||
|
||||
Code output
|
||||
-----------
|
||||
|
||||
Second Open
|
||||
G_RE G_RE G_RE G_WR G_WR G_WR G_RW G_RW G_RW
|
||||
First open --v S_RE S_WR S_RW S_RE S_WR S_RW S_RE S_WR S_RW
|
||||
G_READ
|
||||
SHARE_READ OK OK
|
||||
G_READ
|
||||
SHARE_WRITE OK OK
|
||||
G_READ
|
||||
SHARE_READ|SHARE_WRITE OK OK OK OK OK OK
|
||||
G_WRITE
|
||||
SHARE_READ OK OK
|
||||
G_WRITE
|
||||
SHARE_WRITE OK OK
|
||||
G_WRITE
|
||||
SHARE_READ|SHARE_WRITE OK OK OK OK OK OK
|
||||
G_READ|G_WRITE
|
||||
SHARE_READ OK
|
||||
G_READ|G_WRITE
|
||||
SHARE_WRITE OK
|
||||
G_READ|G_WRITE
|
||||
SHARE_READ|SHARE_WRITE OK OK OK
|
||||
|
||||
@@ -1,31 +0,0 @@
|
||||
* GC issues you need to be careful about when hacking on the mono runtime.
|
||||
|
||||
mono currently uses the Boehm garbage collection library. This is a conservative
|
||||
GC package: this means that the memory is searched for possible memory references
|
||||
to chunks allocated with the GC. Not all the memory is searched, but only the memory
|
||||
allocated with the GC itself (unless you use the 'atomic' variant of the allocation
|
||||
routines), the stack and global variables. Also, if the last reference to an object
|
||||
is stored in an area of themory that is not searched, the object may be freed resulting
|
||||
in memory corruption ind segfaults.
|
||||
|
||||
In particular, memory allocated with system's malloc() is not searched, so you need to be
|
||||
careful NOT to store object references in memory allocated with malloc() (unless you are sure
|
||||
that the object reference will be live at the same time in some other area under the control
|
||||
of the GC (on the stack or in a global variable, for example). Since g_malloc()
|
||||
ultimately calls system malloc() the data structures in GLib are not safe to
|
||||
use to store object references.
|
||||
|
||||
Occasionally, you'll need to store some object reference from C code: in this case,
|
||||
you must make sure that the store location is searched by the GC. You can safely
|
||||
use thread local storage areas, global variables, stack variables. If you need a more
|
||||
complicated data structure, you can use a hash table: MonoGHashTable.
|
||||
This hash table has the same interface as GHashTable from GLib, just stick the "mono_"
|
||||
prefix in function calls and the "Mono" prefix in the hash table type name.
|
||||
This hash table ensures that object references stored in it are tracked by the GC, as long
|
||||
as the pointer to the hash is tracked itself.
|
||||
|
||||
Other data structures that are allocated with the GC and are safe to use to store pointers
|
||||
to GC-allocated memory, are MonoDomain (keeps track of many domain specfic objects)
|
||||
and MonoVTable (referenced by MonoDomain: keeps track of the static data of a type
|
||||
since that can hold references to objects).
|
||||
|
||||
@@ -1,100 +0,0 @@
|
||||
Handling GC allocated objects in C
|
||||
|
||||
As part of an effort to improve our GC, we need to keep track
|
||||
precisely of where objects are stored, so we can incrementally move
|
||||
from the current conservative GC to a more advanced precise and moving GC.
|
||||
Previously, all global C variables were considered GC roots, but this makes
|
||||
the GC less efficient and increases the chances false references are found
|
||||
to GC memory, hence retaining more memory than needed.
|
||||
We need to tell the GC that some object is supposed to be kept alive
|
||||
as if it was referenced in a global variable.
|
||||
|
||||
For Mono embedders
|
||||
------------------
|
||||
|
||||
In C#, if you say:
|
||||
class T {
|
||||
static object o;
|
||||
}
|
||||
|
||||
Any object which is stored in `o' is considered to be alive -- it will
|
||||
not be collected. `o' is a member of the root set for the GC.
|
||||
|
||||
However, in C code, this is not the case. If you have:
|
||||
|
||||
static MonoObject* o = NULL;
|
||||
|
||||
The object in `o' will *NOT* be scanned.
|
||||
|
||||
If you need to store an object in a C variable and prevent it from being
|
||||
collected, you need to acquire a GC handle for it.
|
||||
|
||||
guint32 handle = mono_gchandle_new (my_object, TRUE);
|
||||
|
||||
TRUE means the object will be pinned, so it won't move in memory
|
||||
when we'll use a moving GC. You can access the MonoObject* referenced by
|
||||
a handle with:
|
||||
|
||||
MonoObject* obj = mono_gchandle_get_target (handle);
|
||||
|
||||
When you don't need the handle anymore you need to call:
|
||||
|
||||
mono_gchandle_free (handle);
|
||||
|
||||
Note that if you assign a new object to the C var, you need to get a new
|
||||
handle, it's not enough to store a new object in the C var.
|
||||
|
||||
So code that looked like this:
|
||||
|
||||
static MonoObject* o = NULL;
|
||||
...
|
||||
o = mono_object_new (...);
|
||||
/* use o */
|
||||
...
|
||||
/* when done to allow the GC to collect o */
|
||||
o = NULL;
|
||||
|
||||
should now be changed to:
|
||||
|
||||
static guint32 o_handle;
|
||||
...
|
||||
MonoObject *o = mono_object_new (...);
|
||||
o_handle = mono_gchandle_new (o, TRUE);
|
||||
/* use o or mono_gchandle_get_target (o_handle) */
|
||||
...
|
||||
/* when done to allow the GC to collect o */
|
||||
mono_gchandle_free (o_handle);
|
||||
|
||||
|
||||
For Mono runtime developers
|
||||
---------------------------
|
||||
|
||||
There are two kinds of static vars used to store pointers to GC memory
|
||||
that we need to consider:
|
||||
*) objects
|
||||
*) other memory chunks allocated with GC_MALLOC().
|
||||
|
||||
Objects should be dealt with the GC handle support as detailed above.
|
||||
Other items should register the static pointer as an area to be considered
|
||||
part of the root set with the following:
|
||||
|
||||
static gpointer my_gc_data = NULL;
|
||||
...
|
||||
MONO_GC_REGISTER_ROOT (my_gc_data);
|
||||
my_gc_data = GC_MALLOC (...);
|
||||
|
||||
Note that this registration is not necessary for *LOCAL* variables,
|
||||
as they are stored on the stack. It is only necessary for global variables,
|
||||
as they are not a part of the GC's root set.
|
||||
|
||||
Once you have done the MONO_GC_REGISTER_ROOT, the variable is just like
|
||||
a static variable in C#. To keep an object alive, you have the variable reference
|
||||
the GC memory, to remove the reference, set the variable to NULL.
|
||||
|
||||
As we prepare the code for a precise GC, GC_MALLOC () will not be used anymore
|
||||
in this way in most cases: we'll have a mechanism to specify exactly where
|
||||
references to GC memory is stored. This mechanism is now available with the new GC,
|
||||
see usages of mono_gc_alloc_fixed (), mono_gc_register_root () and
|
||||
mono_gc_make_descr_from_bitmap().
|
||||
See also docs/precise-gc for additional info.
|
||||
|
||||
@@ -1,82 +0,0 @@
|
||||
Internal Call Topics
|
||||
|
||||
* Introduction
|
||||
|
||||
The Common Language Infrastructure allows for methods to be
|
||||
implemented in unmanaged code. Unlike the Platform Invocation
|
||||
services which provide marshalling and unmarshalling of data
|
||||
from managed to unmanaged and viceversa the Internal calls do
|
||||
not perform any kind of marshalling.
|
||||
|
||||
* Basic Type mapping
|
||||
|
||||
The following lists how the C# types are exposed to the C API.
|
||||
|
||||
C# type C type
|
||||
-----------------------------
|
||||
char gunichar2
|
||||
bool MonoBoolean
|
||||
sbyte signed char
|
||||
byte guchar
|
||||
short gint16
|
||||
ushort guint16
|
||||
int gint32
|
||||
uint guint32
|
||||
long gint64
|
||||
ulong guint64
|
||||
IntPtr/UIntPtr gpointer
|
||||
object MonoObject*
|
||||
string MonoString*
|
||||
|
||||
* Pointers
|
||||
|
||||
For ref and out paramaters you'll use the corresponding
|
||||
pointer type.
|
||||
|
||||
So if you have a C# type listed as "ref int", you should use
|
||||
"int *" in your implementation.
|
||||
|
||||
* Arrays
|
||||
|
||||
Arrays of any type must be described with a MonoArray* and the
|
||||
elements must be accessed with the mono_array_* macros.
|
||||
|
||||
* Other Structures
|
||||
|
||||
Any other type that has a matching C structure representation,
|
||||
should use a pointer to the struct instead of a generic
|
||||
MonoObject pointer.
|
||||
|
||||
* Instance Methods.
|
||||
|
||||
Instance methods that are internal calls will receive as first argument
|
||||
the instance object, so you must account for it in the C method signature:
|
||||
|
||||
[MethodImplAttribute(MethodImplOptions.InternalCall)]
|
||||
public extern override int GetHashCode ();
|
||||
|
||||
becomes:
|
||||
|
||||
gint32 ves_icall_System_String_GetHashCode (MonoString *this);
|
||||
|
||||
* How to hook internal calls with the runtime
|
||||
|
||||
Once you require an internal call in corlib, you need to
|
||||
create a C implementation for it and register it in a
|
||||
table in metadata/icall-def.h. See the top of that file
|
||||
for more information.
|
||||
|
||||
If there are overloaded methods, you need also to
|
||||
specify the signature of _all_ of them:
|
||||
|
||||
[MethodImplAttribute(MethodImplOptions.InternalCall)]
|
||||
public extern override void DoSomething ();
|
||||
[MethodImplAttribute(MethodImplOptions.InternalCall)]
|
||||
public extern override void DoSomething (bool useful);
|
||||
|
||||
should be mapped with the following method names:
|
||||
|
||||
"DoSomething()", ves_icall_Namespace_ClassName_DoSomething,
|
||||
"DoSomething(bool)", ves_icall_Namespace_ClassName_DoSomething_bool,
|
||||
|
||||
|
||||
@@ -1,75 +0,0 @@
|
||||
Mono Intermediate Representation Documentation
|
||||
|
||||
Operation: OP_ADDCC_IMM
|
||||
|
||||
Add immediate that will set the carry flag.
|
||||
|
||||
dreg:
|
||||
Destination register
|
||||
inst_imm
|
||||
Immediate value to add.
|
||||
sreg1:
|
||||
Source register to add.
|
||||
|
||||
Operation: OP_CALL_HANDLER.
|
||||
|
||||
cil_code:
|
||||
Points to the CIL where the LEAVE or LEAVE_S
|
||||
instruction was found.
|
||||
|
||||
inst_target_bb:
|
||||
The target basic block for this invocation.
|
||||
|
||||
This instruction must call the target basic block.
|
||||
|
||||
Operation: OP_CISINST
|
||||
|
||||
Implements the CEE_MONO_CISINST opcode that is decoded from
|
||||
the CIL stream.
|
||||
|
||||
This opcode takes as input an object reference and a class,
|
||||
and leaves on the assigned register:
|
||||
|
||||
0. if the object is an instance of the class,
|
||||
1. if the object is not instance of the class,
|
||||
2. if the object is a proxy whose type cannot be determined.
|
||||
|
||||
Operation: OP_CCASTCLASS
|
||||
|
||||
Implements the CEE_MONO_CCASTCLASS opcode that is decoded from
|
||||
the CIL stream.
|
||||
|
||||
This opcode takes as input an object reference and a class,
|
||||
and leaves on the assigned register:
|
||||
|
||||
0. if the object is an instance of the class,
|
||||
1. if the object is a proxy whose type cannot be determined
|
||||
|
||||
throws an InvalidCastException exception otherwise.
|
||||
|
||||
Operation: OP_LOCALLOC
|
||||
inst_left:
|
||||
The value
|
||||
ins->inst_left = *sp;
|
||||
ins->cil_code = ip;
|
||||
|
||||
This is the equivalent of alloca() in a C implementation: it
|
||||
allocates a bunch of bytes on the stack dynamically. Local
|
||||
variables are allocated statically in the stack instead.
|
||||
|
||||
It is implemented by moving the stack pointer according to the
|
||||
platform ABI: you may need to keep a specific frame register
|
||||
to address local variables when LOCALLOC is used (the PPC code
|
||||
does this, for example: ifyou're doing the s390 port I suggest
|
||||
starting from that)
|
||||
|
||||
Operation: OP_SUBCC_IMM
|
||||
|
||||
Substract immediate that will set the borrow flag.
|
||||
|
||||
dreg:
|
||||
Destination register
|
||||
inst_imm
|
||||
Immediate value to add.
|
||||
sreg1:
|
||||
Source register to add.
|
||||
@@ -1,283 +0,0 @@
|
||||
Register Allocation
|
||||
===================
|
||||
|
||||
The current JIT implementation uses a tree matcher to generate code. We use a
|
||||
simple algorithm to allocate registers in trees, and limit the number of used
|
||||
temporary register to 4 when evaluating trees. So we can use 2 registers for
|
||||
global register allocation.
|
||||
|
||||
Register Allocation for Trees
|
||||
=============================
|
||||
|
||||
We always evaluate trees from left to right. When there are no more registers
|
||||
available we need to spill values to memory. Here is the simplified algorithm.
|
||||
|
||||
gboolean
|
||||
tree_allocate_regs (tree, exclude_reg)
|
||||
{
|
||||
if (!tree_allocate_regs (tree->left, -1))
|
||||
return FALSE;
|
||||
|
||||
if (!tree_allocate_regs (tree->right, -1)) {
|
||||
|
||||
tree->left->spilled == TRUE;
|
||||
|
||||
free_used_regs (tree->left);
|
||||
|
||||
if (!tree_allocate_regs (tree->right, tree->left->reg))
|
||||
return FALSE;
|
||||
}
|
||||
|
||||
free_used_regs (tree->left);
|
||||
free_used_regs (tree->right);
|
||||
|
||||
/* try to allocate a register (reg != exclude_reg) */
|
||||
if ((tree->reg = next_free_reg (exclude_reg)) != -1)
|
||||
return TRUE;
|
||||
|
||||
return FALSE;
|
||||
}
|
||||
|
||||
The emit routing actually spills the registers:
|
||||
|
||||
tree_emit (tree)
|
||||
{
|
||||
|
||||
tree_emit (tree->left);
|
||||
|
||||
if (tree->left->spilled)
|
||||
save_reg (tree->left->reg);
|
||||
|
||||
tree_emit (tree->right);
|
||||
|
||||
if (tree->left->spilled)
|
||||
restore_reg (tree->left->reg);
|
||||
|
||||
|
||||
emit_code (tree);
|
||||
}
|
||||
|
||||
|
||||
Global Register Allocation
|
||||
==========================
|
||||
|
||||
TODO.
|
||||
|
||||
Local Register Allocation
|
||||
=========================
|
||||
|
||||
This section describes the cross-platform local register allocator which is
|
||||
in the file mini-codegen.c.
|
||||
|
||||
The input to the allocator is a basic block which contains linear IL, ie.
|
||||
instructions of the form:
|
||||
|
||||
DEST <- SRC1 OP SRC2
|
||||
|
||||
where DEST, SRC1, and SRC2 are virtual registers (vregs). The job of the
|
||||
allocator is to assign hard or physical registers (hregs) to each virtual
|
||||
registers so the vreg references in the instructions can be replaced with their
|
||||
assigned hreg, allowing machine code to be generated later.
|
||||
|
||||
The allocator needs information about the number and types of arguments of
|
||||
instructions. It takes this information from the machine description files. It
|
||||
also needs arch specific information, like the number and type of the hard
|
||||
registers. It gets this information from arch-specific macros.
|
||||
|
||||
Currently, the vregs and hregs are partitioned into two classes: integer and
|
||||
floating point.
|
||||
|
||||
The allocator consists of two phases: In the first phase, a forward pass is
|
||||
made over the instructions, collecting liveness information for vregs. In the
|
||||
second phase, a backward pass is made over the instructions, assigning
|
||||
registers. This backward mode of operation makes understanding the allocator
|
||||
somewhat difficult to understand, but leads to better code in most cases.
|
||||
|
||||
Allocator state
|
||||
===============
|
||||
|
||||
The state of the allocator is stored in two arrays: iassign and isymbolic.
|
||||
iassign maps vregs to hregs, while isymbolic is the opposite.
|
||||
For a vreg, iassign [vreg] can contain the following values:
|
||||
|
||||
* -1 vreg has no assigned hreg
|
||||
|
||||
* hreg index (>= 0) vreg is assigned to the given hreg. This means
|
||||
later instructions (which we have already
|
||||
processed due to the backward direction) expect
|
||||
the value of vreg to be found in hreg.
|
||||
|
||||
* spill slot index (< -1) vreg is spilled to the given spill slot. This
|
||||
means later instructions expect the value of
|
||||
vreg to be found on the stack in the given
|
||||
spill slot.
|
||||
|
||||
Also, the allocator keeps track of which hregs are free and which are used.
|
||||
This information is stored in a bitmask called ifree_mask.
|
||||
|
||||
There is a similar set of data structures for floating point registers.
|
||||
|
||||
Spilling
|
||||
========
|
||||
|
||||
When an allocator needs a free hreg, but all of them are assigned, it needs to
|
||||
free up one of them. It does this by spilling the contents of the vreg which
|
||||
is currently assigned to the selected hreg. Since later instructions expect
|
||||
the vreg to be found in the selected hreg, the allocator emits a spill-load
|
||||
instruction to load the value from the spill slot into the hreg after the
|
||||
currently processed instruction. When the vreg which is spilled is a
|
||||
destination in an instruction, the allocator will emit a spill-store to store
|
||||
the value into the spill slot.
|
||||
|
||||
Fixed registers
|
||||
===============
|
||||
|
||||
Some architectures, notably x86/amd64 require that the arguments/results of
|
||||
some instructions be assigned to specific hregs. An example is the shift
|
||||
opcodes on x86, where the second argument must be in ECX. The allocator
|
||||
has support for this. It tries to allocate the vreg to the required hreg. If
|
||||
thats not possible, then it will emit compensation code which moves values to
|
||||
the correct registers before/after the instruction.
|
||||
|
||||
Fixed registers are mainly used on x86, but they are useful on more regular
|
||||
architectures on well, for example to model that after a call instruction, the
|
||||
return of the call is in a specific register.
|
||||
|
||||
A special case of fixed registers is two address architectures, like the x86,
|
||||
where the instructions place their results into their first argument. This is
|
||||
modelled in the allocator by allocating SRC1 and DEST to the same hreg.
|
||||
|
||||
Global registers
|
||||
================
|
||||
|
||||
Some variables might already be allocated to hardware registers during the
|
||||
global allocation phase. In this case, SRC1, SRC2 and DEST might already be
|
||||
a hardware register. The allocator needs to do nothing in this case, except
|
||||
when the architecture uses fixed registers, in which case it needs to emit
|
||||
compensation code.
|
||||
|
||||
Register pairs
|
||||
==============
|
||||
|
||||
64 bit arithmetic on 32 bit machines requires instructions whose arguments are
|
||||
not registers, but register pairs. The allocator has support for this, both
|
||||
for freely allocatable register pairs, and for register pairs which are
|
||||
constrained to specific hregs (EDX:EAX on x86).
|
||||
|
||||
Floating point stack
|
||||
====================
|
||||
|
||||
The x86 architecture uses a floating point register stack instead of a set of
|
||||
fp registers. The allocator supports this by keeping track of the height of the
|
||||
fp stack, and spilling/loading values from the stack as neccesary.
|
||||
|
||||
Calls
|
||||
=====
|
||||
|
||||
Calls need special handling for two reasons: first, they will clobber all
|
||||
caller-save registers, meaning their contents will need to be spilled. Also,
|
||||
some architectures pass arguments in registers. The registers used for
|
||||
passing arguments are usually the same as the ones used for local allocation,
|
||||
so the allocator needs to handle them specially. This is done as follows:
|
||||
the MonoInst for the call instruction contains a map mapping vregs which
|
||||
contain the argument values to hregs where the argument needs to be placed,
|
||||
like this (on amd64):
|
||||
|
||||
R33 -> RDI
|
||||
R34 -> RSI
|
||||
...
|
||||
|
||||
When the allocator processes the call instruction, it allocates the vregs
|
||||
in the map to their associated hregs. So the call instruction is processed as
|
||||
if having a variable number of arguments which fixed register assignments.
|
||||
|
||||
An example:
|
||||
|
||||
R33 <- 1
|
||||
R34 <- 2
|
||||
call
|
||||
|
||||
When the call instruction is processed, R33 is assigned to RDI, and R34 is
|
||||
assigned to RSI. Later, when the two assignment instructions are processed,
|
||||
R33 and R34 are already assigned to a hreg, so they are replaced with the
|
||||
associated hreg leading to the following final code:
|
||||
|
||||
RDI <- 1
|
||||
RSI <- 1
|
||||
call
|
||||
|
||||
Machine description files
|
||||
=========================
|
||||
|
||||
A typical entry in the machine description files looks like this:
|
||||
|
||||
shl: dest:i src1:i src2:s clob:1 len:2
|
||||
|
||||
The allocator is only interested in the dest,src1,src2 and clob fields.
|
||||
It understands the following values for the dest, src1, src2 fields:
|
||||
|
||||
i - integer register
|
||||
f - fp register
|
||||
b - base register (same as i, but the instruction does not modify the reg)
|
||||
m - fp register, even if an fp stack is used (no fp stack tracking)
|
||||
|
||||
It understands the following values for the clob field:
|
||||
|
||||
1 - sreg1 needs to be the same as dreg
|
||||
c - instruction clobbers the caller-save registers
|
||||
|
||||
Beside these values, an architecture can define additional values (like the 's'
|
||||
in the example). The allocator depends on a set of arch-specific macros to
|
||||
convert these values to information it needs during allocation.
|
||||
|
||||
Arch specific macros
|
||||
====================
|
||||
|
||||
These macros usually receive a value from the machine description file (like
|
||||
the 's' in the example). The examples below are for x86.
|
||||
|
||||
/*
|
||||
* A bitmask selecting the caller-save registers (these are used for local
|
||||
* allocation).
|
||||
*/
|
||||
#define MONO_ARCH_CALLEE_REGS X86_CALLEE_REGS
|
||||
|
||||
/*
|
||||
* A bitmask selecting the callee-saved registers (these are usually used for
|
||||
* global allocation).
|
||||
*/
|
||||
#define MONO_ARCH_CALLEE_SAVED_REGS X86_CALLER_REGS
|
||||
|
||||
/* Same for the floating point registers */
|
||||
#define MONO_ARCH_CALLEE_FREGS 0
|
||||
#define MONO_ARCH_CALLEE_SAVED_FREGS 0
|
||||
|
||||
/* Whenever the target uses a floating point stack */
|
||||
#define MONO_ARCH_USE_FPSTACK TRUE
|
||||
|
||||
/* The size of the floating point stack */
|
||||
#define MONO_ARCH_FPSTACK_SIZE 6
|
||||
|
||||
/*
|
||||
* Given a descriptor value from the machine description file, return the fixed
|
||||
* hard reg corresponding to that value.
|
||||
*/
|
||||
#define MONO_ARCH_INST_FIXED_REG(desc) ((desc == 's') ? X86_ECX : ((desc == 'a') ? X86_EAX : ((desc == 'd') ? X86_EDX : ((desc == 'y') ? X86_EAX : ((desc == 'l') ? X86_EAX : -1)))))
|
||||
|
||||
/*
|
||||
* A bitmask selecting the hregs which can be used for allocating sreg2 for
|
||||
* a given instruction.
|
||||
*/
|
||||
#define MONO_ARCH_INST_SREG2_MASK(ins) (((ins [MONO_INST_CLOB] == 'a') || (ins [MONO_INST_CLOB] == 'd')) ? (1 << X86_EDX) : 0)
|
||||
|
||||
/*
|
||||
* Given a descriptor value, return whenever it denotes a register pair.
|
||||
*/
|
||||
#define MONO_ARCH_INST_IS_REGPAIR(desc) (desc == 'l' || desc == 'L')
|
||||
|
||||
/*
|
||||
* Given a descriptor value, and the first register of a regpair, return a
|
||||
* bitmask selecting the hregs which can be used for allocating the second
|
||||
* register of the regpair.
|
||||
*/
|
||||
#define MONO_ARCH_INST_REGPAIR_REG2(desc,hreg1) (desc == 'l' ? X86_EDX : -1)
|
||||
@@ -1,125 +0,0 @@
|
||||
Just some thoughts for the JITer:
|
||||
|
||||
General issues:
|
||||
===============
|
||||
|
||||
We are designing a JIT compiler, so we have to consider two things:
|
||||
|
||||
- the quality of the generated code
|
||||
- the time needed to generate that code
|
||||
|
||||
The current approach is to keep the JITer as simple as possible, and thus as
|
||||
fast as possible. The generated code quality will suffer from that.
|
||||
|
||||
Register Allocation:
|
||||
====================
|
||||
|
||||
With lcc you can assign a fixed register to a tree before register
|
||||
allocation. For example this is needed by call, which return the value always
|
||||
in EAX on x86. The current implementation works without such system, due to
|
||||
special forest generation.
|
||||
|
||||
Different Register Sets:
|
||||
========================
|
||||
|
||||
Most processors have more that one register set, at least one for floating
|
||||
point values, and one for integers. Should we support architectures with more
|
||||
that two sets? Does someone knows such an architecture?
|
||||
|
||||
64bit Integer Values:
|
||||
=====================
|
||||
|
||||
I can imagine two different implementation. On possibility would be to treat
|
||||
long (64bit) values simply like any other value type. This implies that we
|
||||
call class methods for ALU operations like add or sub. Sure, this method will
|
||||
be be a bit inefficient.
|
||||
|
||||
The more performant solution is to allocate two 32bit registers for each 64bit
|
||||
value. We add a new non terminal to the monoburg grammar called "lreg". The
|
||||
register allocation routines takes care of this non terminal and allocates two
|
||||
32 bit registers for them.
|
||||
|
||||
Forest generation:
|
||||
==================
|
||||
|
||||
Consider the following code:
|
||||
|
||||
OPCODE: STACK LOCALS
|
||||
LDLOC.0 (5) [5,0]
|
||||
LDC.1 (5,1) [5,0]
|
||||
STLOC.0 (5) [1,0]
|
||||
STLOC.1 () [1,5]
|
||||
|
||||
A simple forest generation generates:
|
||||
|
||||
STLOC.0(LDC.1)
|
||||
STLOC.1(LDLOC.0)
|
||||
|
||||
Which is wrong, since it stores the wrong value (1 instead of 5). Instead we
|
||||
must generate something like:
|
||||
|
||||
STLOC.TMP(LDLOC.0)
|
||||
STLOC.0(LDC.1)
|
||||
STLOC.1(LDLOC.TMP)
|
||||
|
||||
Where STLOC.TMP saves the value into a new temporary variable.
|
||||
|
||||
We also need a similar solution for basic block boundaries when the stack depth
|
||||
is not zero. We can simply save those values to new temporary values. Consider
|
||||
the following basic block with one instruction:
|
||||
|
||||
LDLOC.1
|
||||
This should generate a tree like:
|
||||
|
||||
STLOC.TMP(LDLOC.1) Please notice that an intelligent register allocator can
|
||||
still allocate registers for those new variables.
|
||||
|
||||
DAG handling:
|
||||
=============
|
||||
|
||||
Monoburg can't handle DAGs, instead we need real trees as input for
|
||||
the code generator. So we have two problems:
|
||||
|
||||
1.) DUP instruction: This one is obvious - we need to store the value
|
||||
into a temporary variable to solve the problem.
|
||||
|
||||
2.) function calls: Chapter 12.8, page 343 of "A retargetable C compiler"
|
||||
explains that: "because listing a call node will give it a hidden reference
|
||||
from the code list". I don't understand that (can someone explain that?), but
|
||||
there is another reason to save return values to temporaries: Consider the
|
||||
following code:
|
||||
|
||||
x = f(y) + g(z); // all functions return integers
|
||||
|
||||
We could generate such a tree for this expression: STLOC(ADD(CALL,CALL))
|
||||
|
||||
The problem is that both calls returns the value in the same register,
|
||||
so it is non trivial to generate code for that tree. We must copy one
|
||||
register into another one, which make register allocation more complex.
|
||||
The easier solution is store the result of function calls to
|
||||
temporaries. This leads to the following forest:
|
||||
|
||||
STLOC(CALL)
|
||||
STLOC(CALL)
|
||||
STLOC(ADD (LDLOC, LDLOC))
|
||||
|
||||
This is what lcc is doing, if I understood 12.8, page 342, 343?
|
||||
|
||||
Possible Optimisations:
|
||||
=======================
|
||||
|
||||
Miguel said ORP does some optimisation on IL level, for example moving array
|
||||
bounds checking out of loops:
|
||||
|
||||
for (i = 0; i < N; i++) { check_range (a, i); a [i] = X; }
|
||||
|
||||
id transformed to:
|
||||
|
||||
if (in_range (a, 0, N)) { for (i = 0; i < N; i++) a[i] = X; }
|
||||
else for (i = 0; i < N; i++) { check_range (a, i); a [i] = X; }
|
||||
|
||||
The "else" is only to keep original semantics (exception handling).
|
||||
|
||||
We need loop detection logic in order to implement this (dominator tree).
|
||||
|
||||
AFAIK CACAO also implements this.
|
||||
@@ -1,52 +0,0 @@
|
||||
Author: Dietmar Maurer ([email protected])
|
||||
(C) 2001 Ximian, Inc.
|
||||
|
||||
Howto trigger JIT compilation
|
||||
=============================
|
||||
|
||||
The JIT translates CIL code to native code on a per method basis. For example
|
||||
if you have this simple program:
|
||||
|
||||
public class Test {
|
||||
public static void Main () {
|
||||
System.Console.WriteLine ("Hello");
|
||||
}
|
||||
}
|
||||
|
||||
the JIT first compiles the Main function. Unfortunately Main() contains another
|
||||
reference to System.Console.WriteLine(), so the JIT also needs the address for
|
||||
WriteLine() to generate a call instruction.
|
||||
|
||||
The simplest solution would be to JIT compile System.Console.WriteLine()
|
||||
to generate that address. But that would mean that we JIT compile half of our
|
||||
class library at once, since WriteLine() uses many other classes and function,
|
||||
and we have to call the JIT for each of them. Even worse there is the
|
||||
possibility of cyclic references, and we would end up in an endless loop.
|
||||
|
||||
Thus we need some kind of trampoline function for JIT compilation. Such a
|
||||
trampoline first calls the JIT compiler to create native code, and then jumps
|
||||
directly into that code. Whenever the JIT needs the address of a function (to
|
||||
emit a call instruction) it uses the address of those trampoline functions.
|
||||
|
||||
One drawback of this approach is that it requires an additional indirection. We
|
||||
always call the trampoline. Inside the trampoline we need to check if the
|
||||
method is already compiled or not, and when not compiled we start JIT
|
||||
compilation. After that we call the code. This process is quite time consuming
|
||||
and shows very bad performance.
|
||||
|
||||
The solution is to add some logic to the trampoline function to detect from
|
||||
where it is called. It is then possible for the JIT to patch the call
|
||||
instruction in the caller, so that it directly calls the JIT compiled code
|
||||
next time.
|
||||
|
||||
Implementation for x86
|
||||
======================
|
||||
|
||||
emit-x86.c (arch_create_jit_trampoline): return the JIT trampoline function
|
||||
|
||||
emit-x86.c (x86_magic_trampoline): contains the code to detect the caller and
|
||||
patch the call instruction.
|
||||
|
||||
emit-x86.c (arch_compile_method): JIT compile a method
|
||||
|
||||
|
||||
@@ -1,208 +0,0 @@
|
||||
|
||||
* Proposal for the local register allocator
|
||||
|
||||
The local register allocator deals with allocating registers
|
||||
for temporaries inside a single basic block, while the global
|
||||
register allocator is concerned with method-wide allocation of
|
||||
variables.
|
||||
The global register allocator uses callee-saved register for it's
|
||||
purpouse so that there is no need to save and restore these registers
|
||||
at call sites.
|
||||
|
||||
There are a number of issues the local allocator needs to deal with:
|
||||
*) some instructions expect operands in specific registers (for example
|
||||
the shl instruction on x86, or the call instruction with thiscall
|
||||
convention, or the equivalent call instructions on other architectures,
|
||||
such as the need to put output registers in %oX on sparc)
|
||||
*) some instructions deliver results only in specific registers (for example
|
||||
the div instruction on x86, or the call instructionson on almost all
|
||||
the architectures).
|
||||
*) it needs to know what registers may be clobbered by an instruction
|
||||
(such as in a method call)
|
||||
*) it should avoid excessive reloads or stores to improve performance
|
||||
|
||||
While which specific instructions have limitations is architecture-dependent,
|
||||
the problem shold be solved in an arch-independent way to reduce code duplication.
|
||||
The register allocator will be 'driven' by the arch-dependent code, but it's
|
||||
implementation should be arch-independent.
|
||||
|
||||
To improve the current local register allocator, we need to
|
||||
keep more state in it than the current setup that only keeps busy/free info.
|
||||
|
||||
Possible state information is:
|
||||
|
||||
free: the resgister is free to use and it doesn't contain useful info
|
||||
freeable: the register contains data loaded from a local (there is
|
||||
also info about _which_ local it contains) as a result from previous
|
||||
instructions (like, there was a store from the register to the local)
|
||||
moveable: it contains live data that is needed in a following instruction, but
|
||||
the contents may be moved to a different register
|
||||
busy: the register contains live data and it is placed there because
|
||||
the following instructions need it exactly in that register
|
||||
allocated: the register is used by the global allocator
|
||||
|
||||
The local register allocator will have the following interfaces:
|
||||
|
||||
int get_register ();
|
||||
Searches for a register in the free state. If it doesn't find it,
|
||||
searches for a freeable register. Sets the status to moveable.
|
||||
Looking for a 'free' register before a freeable one should allow for
|
||||
removing a few redundant loads (though I'm still unsure if such
|
||||
things should be delegated entirely to the peephole pass).
|
||||
|
||||
int get_register_force (int reg);
|
||||
Returns 'reg' if it is free or freeable. If it is moveable, it moves it
|
||||
to another free or freeable register.
|
||||
Sets the status of 'reg' to busy.
|
||||
|
||||
void set_register_freeable (int reg);
|
||||
Sets the status of 'reg' to freeable.
|
||||
|
||||
void set_register_free (int reg);
|
||||
Sets the status of 'reg' to free.
|
||||
|
||||
void will_clobber (int reg);
|
||||
Spills the register to the stack. Sets the status to freeable.
|
||||
After the clobbering has occurred, set the status to free.
|
||||
|
||||
void register_unspill (int reg);
|
||||
Un-spills register reg and sets the status to moveable.
|
||||
|
||||
FIXME: how is the 'local' information represented? Maybe a MonoInst* pointer.
|
||||
|
||||
Note: the register allocator will insert instructions in the basic block
|
||||
during it's operation.
|
||||
|
||||
* Examples
|
||||
|
||||
Given the tree (on x86 the right argument to shl needs to be in ecx):
|
||||
|
||||
store (local1, shl (local1, call (some_arg)))
|
||||
|
||||
At the start of the basic block, the registers are set to the free state.
|
||||
The sequence of instructions may be:
|
||||
instruction register status -> [%eax %ecx %edx]
|
||||
start free free free
|
||||
eax = load local1 mov free free
|
||||
/* call clobbers eax, ecx, edx */
|
||||
spill eax free free free
|
||||
call mov free free
|
||||
/* now eax contains the right operand of the shl */
|
||||
mov %eax -> %ecx free busy free
|
||||
un-spill mov busy free
|
||||
shl %cl, %eax mov free free
|
||||
|
||||
The resulting x86 code is:
|
||||
mov $fffc(%ebp), %eax
|
||||
mov %eax, $fff0(%ebp)
|
||||
push some_arg
|
||||
call func
|
||||
mov %eax, %ecx
|
||||
mov $fff0(%ebp), %eax
|
||||
shl %cl, %eax
|
||||
|
||||
Note that since shl could operate directly on memory, we could have:
|
||||
|
||||
push some_arg
|
||||
call func
|
||||
mov %eax, %ecx
|
||||
shl %cl, $fffc(%ebp)
|
||||
|
||||
The above example with loading the operand in a register is just to complicate
|
||||
the example and show that the algorithm should be able to handle it.
|
||||
|
||||
Let's take another example with the this-call call convention (the first argument
|
||||
is passed in %ecx).
|
||||
In this case, will_clobber() will be called only on %eax and %edx, while %ecx
|
||||
will be allocated with get_register_force ().
|
||||
Note: when a register is allocated with get_register_force(), it should be set
|
||||
to a different state as soon as possible.
|
||||
|
||||
store (local1, shl (local1, this-call (local1)))
|
||||
|
||||
instruction register status -> [%eax %ecx %edx]
|
||||
start free free free
|
||||
eax = load local1 mov free free
|
||||
/* force load in %ecx */
|
||||
ecx = load local1 mov busy free
|
||||
spill eax free busy free
|
||||
call mov free free
|
||||
/* now eax contains the right operand of the shl */
|
||||
mov %eax -> %ecx free busy free
|
||||
un-spill mov busy free
|
||||
shl %cl, %eax mov free free
|
||||
|
||||
What happens when a register that we need to allocate with get_register_force ()
|
||||
contains an operand for the next instruction?
|
||||
|
||||
instruction register status -> [%eax %ecx %edx]
|
||||
eax = load local0 mov free free
|
||||
ecx = load local1 mov mov free
|
||||
get_register_force (ecx) here.
|
||||
We have two options:
|
||||
mov %ecx, %edx
|
||||
or:
|
||||
spill %ecx
|
||||
The first option is way better (and allows the peephole pass to
|
||||
just load the value in %edx directly, instead of loading first to %ecx).
|
||||
This doesn't work, though, if the instruction clobbers the %edx register
|
||||
(like in a this-call). So, we first need to clobber the registers
|
||||
(so the state of %ecx changes to freebale and there is no issue
|
||||
with get_register_force ()).
|
||||
What if an instruction both clobbers a register and requires it as
|
||||
an operand? Lets' take the x86 idiv instruction as an example: it
|
||||
requires the dividend in edx:eax and returns the result in eax,
|
||||
with the modulus in edx.
|
||||
|
||||
store (local1, div (local1, local2))
|
||||
|
||||
instruction register status -> [%eax %ecx %edx]
|
||||
eax = load local0 mov free free
|
||||
will_clobber eax, edx free mov free
|
||||
force mov %ecx, %eax busy free free
|
||||
set %edx busy free busy
|
||||
idiv mov free free
|
||||
|
||||
Note: edx is set to free after idiv, because the modulus is not needed
|
||||
(if it was a rem, eax would have been freed).
|
||||
If we load the divisor before will_clobber(), we'll have to spill
|
||||
eax and reload it later. If we load it just after the idiv, there is no issue.
|
||||
In any case, the algorithm should give the correct results and allow the operation.
|
||||
|
||||
Working recursively on the isntructions there shouldn't be huge issues
|
||||
with this algorithm (though, of course, it's not optimal and it may
|
||||
introduce excessive spills or register moves). The advantage over the current
|
||||
local reg allocator is that:
|
||||
1) the number of spills/moves would be smaller anyway
|
||||
2) a separate peephole pass could be able to eliminate reg moves
|
||||
3) we'll be able to remove the 'forced' spills we currently do with
|
||||
the return value of method calls
|
||||
|
||||
* Issues
|
||||
|
||||
How to best integrate such a reg allocator with the burg stuff.
|
||||
|
||||
Think about a call os sparc with two arguments: they got into %o0 and %o1
|
||||
and each of them sets the register as busy. But what if the values to put there
|
||||
are themselves the result of a call? %o0 is no problem, but for all the
|
||||
next argument n the above algorithm would spill all the 0...n-1 registers...
|
||||
|
||||
* Papers
|
||||
|
||||
More complex solutions to the local register allocator problem:
|
||||
http://dimacs.rutgers.edu/TechnicalReports/abstracts/1997/97-33.html
|
||||
|
||||
Combining register allocation and instruction scheduling:
|
||||
http://citeseer.nj.nec.com/motwani95combining.html
|
||||
|
||||
More on LRA euristics:
|
||||
http://citeseer.nj.nec.com/liberatore97hardness.html
|
||||
|
||||
Linear-time optimal code scheduling for delayedload architectures
|
||||
http://www.cs.wisc.edu/~fischer/cs701.f01/inst.sched.ps.gz
|
||||
|
||||
Precise Register Allocation for Irregular Architectures
|
||||
http://citeseer.nj.nec.com/kong98precise.html
|
||||
|
||||
Allocate registers first to subtrees that need more of them.
|
||||
http://www.upb.de/cs/ag-kastens/compii/folien/comment401-409.2.pdf
|
||||
@@ -1,15 +0,0 @@
|
||||
This is a patch that can be applied to the magic file used by file(1) to
|
||||
recognize mono assemblies.
|
||||
Apply it to the magic file (usually in /usr/share/file/magic or
|
||||
/usr/share/misc/magic) and recompile it with file -C.
|
||||
|
||||
--- magic.old 2006-03-24 21:12:25.000000000 +0100
|
||||
+++ magic 2006-03-24 21:12:17.000000000 +0100
|
||||
@@ -7205,6 +7205,7 @@
|
||||
>>>>(0x3c.l+4) leshort 0x290 PA-RISC
|
||||
>>>>(0x3c.l+22) leshort&0x0100 >0 32-bit
|
||||
>>>>(0x3c.l+22) leshort&0x1000 >0 system file
|
||||
+>>>>(0x3c.l+232) lelong >0 Mono/.Net assembly
|
||||
|
||||
>>>>(0x3c.l+0xf8) string UPX0 \b, UPX compressed
|
||||
>>>>(0x3c.l+0xf8) search/0x140 PEC2 \b, PECompact2 compressed
|
||||
@@ -1,771 +0,0 @@
|
||||
|
||||
A new JIT compiler for the Mono Project
|
||||
|
||||
Miguel de Icaza (miguel@{ximian.com,gnome.org}),
|
||||
Paolo Molaro (lupus@{ximian.com,debian.org})
|
||||
|
||||
|
||||
* Abstract
|
||||
|
||||
Mini is a new compilation engine for the Mono runtime. The
|
||||
new engine is designed to bring new code generation
|
||||
optimizations, portability and pre-compilation.
|
||||
|
||||
In this document we describe the design decisions and the
|
||||
architecture of the new compilation engine.
|
||||
|
||||
* Introduction
|
||||
|
||||
Mono is a Open Source implementation of the .NET Framework: it
|
||||
is made up of a runtime engine that implements the ECMA Common
|
||||
Language Infrastructure (CLI), a set of compilers that target
|
||||
the CLI and a large collection of class libraries.
|
||||
|
||||
This article discusses the new code generation facilities that
|
||||
have been added to the Mono runtime.
|
||||
|
||||
First we discuss the overall architecture of the Mono runtime,
|
||||
and how code generation fits into it; Then we discuss the
|
||||
development and basic architecture of our first JIT compiler
|
||||
for the ECMA CIL framework. The next section covers the
|
||||
objectives for the work on the new JIT compiler, then we
|
||||
discuss the new features available in the new JIT compiler,
|
||||
and finally a technical description of the new code generation
|
||||
engine.
|
||||
|
||||
* Architecture of the Mono Runtime
|
||||
|
||||
The Mono runtime is an implementation of the ECMA Common
|
||||
Language Infrastructure (CLI), whose aim is to be a common
|
||||
platform for executing code in multiple languages.
|
||||
|
||||
Languages that target the CLI generate images that contain
|
||||
code in high-level intermediate representation called the
|
||||
"Common Intermediate Language". This intermediate language is
|
||||
rich enough to allow for programs and pre-compiled libraries
|
||||
to be reflected. The execution environment allows for an
|
||||
object oriented execution environment with single inheritance
|
||||
and multiple interface implementations.
|
||||
|
||||
This runtime provides a number of services for programs that
|
||||
are targeted to it: Just-in-Time compilation of CIL code into
|
||||
native code, garbage collection, thread management, I/O
|
||||
routines, single, double and decimal floating point,
|
||||
asynchronous method invocation, application domains, and a
|
||||
framework for building arbitrary RPC systems (remoting) and
|
||||
integration with system libraries through the Platform Invoke
|
||||
functionality.
|
||||
|
||||
The focus of this document is on the services provided by the
|
||||
Mono runtime to transform CIL bytecodes into code that is
|
||||
native to the underlying architecture.
|
||||
|
||||
The code generation interface is a set of macros that allow a
|
||||
C programmer to generate code on the fly, this is done
|
||||
through a set of macros found in the mono/jit/arch/ directory.
|
||||
These macros are used by the JIT compiler to generate native
|
||||
code.
|
||||
|
||||
The platform invocation code is interesting, as it generates
|
||||
CIL code on the fly to marshal parameters, and then this
|
||||
code is in turned processed by the JIT engine.
|
||||
|
||||
* Previous Experiences
|
||||
|
||||
Mono has built a JIT engine, which has been used to bootstrap
|
||||
Mono since January, 2002. This JIT engine has reasonable
|
||||
performance, and uses an tree pattern matching instruction
|
||||
selector based on the BURS technology. This JIT compiler was
|
||||
designed by Dietmar Maurer, Paolo Molaro and Miguel de Icaza.
|
||||
|
||||
The existing JIT compiler has three phases:
|
||||
|
||||
* Re-creation of the semantic tree from CIL
|
||||
byte-codes.
|
||||
|
||||
* Instruction selection, with a cost-driven
|
||||
engine.
|
||||
|
||||
* Code generation and register allocation.
|
||||
|
||||
It is also hooked into the rest of the runtime to provide
|
||||
services like marshaling, just-in-time compilation and
|
||||
invocation of "internal calls".
|
||||
|
||||
This engine constructed a collection of trees, which we
|
||||
referred to as the "forest of trees", this forest is created by
|
||||
"hydrating" the CIL instruction stream.
|
||||
|
||||
The first step was to identify the basic blocks on the method,
|
||||
and computing the control flow graph (cfg) for it. Once this
|
||||
information was computed, a stack analysis on each basic block
|
||||
was performed to create a forest of trees for each one of
|
||||
them.
|
||||
|
||||
So for example, the following statement:
|
||||
|
||||
int a, b;
|
||||
...
|
||||
b = a + 1;
|
||||
|
||||
Which would be represented in CIL as:
|
||||
|
||||
ldloc.0
|
||||
ldc.i4.1
|
||||
add
|
||||
stloc.1
|
||||
|
||||
After the stack analysis would create the following tree:
|
||||
|
||||
(STIND_I4 ADDR_L[EBX|2] (
|
||||
ADD (LDIND_I4 ADDR_L[ESI|1])
|
||||
CONST_I4[1]))
|
||||
|
||||
This tree contains information from the stack analysis: for
|
||||
instance, notice that the operations explicitly encode the
|
||||
data types they are operating on, there is no longer an
|
||||
ambiguity on the types, because this information has been
|
||||
inferred.
|
||||
|
||||
At this point the JIT would pass the constructed forest of
|
||||
trees to the architecture-dependent JIT compiler.
|
||||
|
||||
The architecture dependent code then performed register
|
||||
allocation (optionally using linear scan allocation for
|
||||
variables, based on life analysis).
|
||||
|
||||
Once variables had been assigned, a tree pattern matching with
|
||||
dynamic programming is used (the tree pattern matcher is
|
||||
custom build for each architecture, using a code
|
||||
generator: monoburg). The instruction selector used cost
|
||||
functions to select the best instruction patterns.
|
||||
|
||||
The instruction selector is able to produce instructions that
|
||||
take advantage of the x86 instruction indexing instructions
|
||||
for example.
|
||||
|
||||
One problem though is that the code emitter and the register
|
||||
allocator did not have any visibility outside the current
|
||||
tree, which meant that some redundant instructions were
|
||||
generated. A peephole optimizer with this architecture was
|
||||
hard to write, given the tree-based representation that is
|
||||
used.
|
||||
|
||||
This JIT was functional, but it did not provide a good
|
||||
architecture to base future optimizations on. Also the
|
||||
line between architecture neutral and architecture
|
||||
specific code and optimizations was hard to draw.
|
||||
|
||||
The JIT engine supported two code generation modes to support
|
||||
the two optimization modes for applications that host multiple
|
||||
application domains: generate code that will be shared across
|
||||
application domains, or generate code that will not be shared
|
||||
across application domains.
|
||||
|
||||
* Objectives of the new JIT engine.
|
||||
|
||||
We wanted to support a number of features that were missing:
|
||||
|
||||
* Ahead-of-time compilation.
|
||||
|
||||
The idea is to allow developers to pre-compile their code
|
||||
to native code to reduce startup time, and the working
|
||||
set that is used at runtime in the just-in-time compiler.
|
||||
|
||||
Although in Mono this has not been a visible problem, we
|
||||
wanted to pro-actively address this problem.
|
||||
|
||||
When an assembly (a Mono/.NET executable) is installed in
|
||||
the system, it would then be possible to pre-compile the
|
||||
code, and have the JIT compiler tune the generated code
|
||||
to the particular CPU on which the software is
|
||||
installed.
|
||||
|
||||
This is done in the Microsoft.NET world with a tool
|
||||
called ngen.exe
|
||||
|
||||
* Have a good platform for doing code optimizations.
|
||||
|
||||
The design called for a good architecture that would
|
||||
enable various levels of optimizations: some
|
||||
optimizations are better performed on high-level
|
||||
intermediate representations, some on medium-level and
|
||||
some at low-level representations.
|
||||
|
||||
Also it should be possible to conditionally turn these on
|
||||
or off. Some optimizations are too expensive to be used
|
||||
in just-in-time compilation scenarios, but these
|
||||
expensive optimizations can be turned on for
|
||||
ahead-of-time compilations or when using profile-guided
|
||||
optimizations on a subset of the executed methods.
|
||||
|
||||
* Reduce the effort required to port the Mono code
|
||||
generator to new architectures.
|
||||
|
||||
For Mono to gain wide adoption in the Unix world, it is
|
||||
necessary that the JIT engine works in most of today's
|
||||
commercial hardware platforms.
|
||||
|
||||
* Features of the new JIT engine.
|
||||
|
||||
The new JIT engine was architected by Dietmar Maurer and Paolo
|
||||
Molaro, based on the new objectives.
|
||||
|
||||
Mono provides a number of services to applications running
|
||||
with the new JIT compiler:
|
||||
|
||||
* Just-in-Time compilation of CLI code into native code.
|
||||
|
||||
* Ahead-of-Time compilation of CLI code, to reduce
|
||||
startup time of applications.
|
||||
|
||||
A number of software development features are also available:
|
||||
|
||||
* Execution time profiling (--profile)
|
||||
|
||||
Generates a report of the times consumed by routines,
|
||||
as well as the invocation times, as well as the
|
||||
callers.
|
||||
|
||||
* Memory usage profiling (--profile)
|
||||
|
||||
Generates a report of the memory usage by a program
|
||||
that is ran under the Mono JIT.
|
||||
|
||||
* Code coverage (--coverage)
|
||||
|
||||
* Execution tracing.
|
||||
|
||||
People who are interested in developing and improving the Mini
|
||||
JIT compiler will also find a few useful routines:
|
||||
|
||||
* Compilation times
|
||||
|
||||
This is used to time the execution time for the JIT
|
||||
when compiling a routine.
|
||||
|
||||
* Control Flow Graph and Dominator Tree drawing.
|
||||
|
||||
These are visual aids for the JIT developer: they
|
||||
render representations of the Control Flow graph, and
|
||||
for the more advanced optimizations, they draw the
|
||||
dominator tree graph.
|
||||
|
||||
This requires Dot (from the graphwiz package) and Ghostview.
|
||||
|
||||
* Code generator regression tests.
|
||||
|
||||
The engine contains support for running regression
|
||||
tests on the virtual machine, which is very helpful to
|
||||
developers interested in improving the engine.
|
||||
|
||||
* Optimization benchmark framework.
|
||||
|
||||
The JIT engine will generate graphs that compare
|
||||
various benchmarks embedded in an assembly, and run the
|
||||
various tests with different optimization flags.
|
||||
|
||||
This requires Perl, GD::Graph.
|
||||
|
||||
* Flexibility
|
||||
|
||||
This is probably the most important component of the new code
|
||||
generation engine. The internals are relatively easy to
|
||||
replace and update, even large passes can be replaced and
|
||||
implemented differently.
|
||||
|
||||
* New code generator
|
||||
|
||||
Compiling a method begins with the `mini_method_to_ir' routine
|
||||
that converts the CIL representation into a medium
|
||||
intermediate representation.
|
||||
|
||||
The mini_method_to_ir routine performs a number of operations:
|
||||
|
||||
* Flow analysis and control flow graph computation.
|
||||
|
||||
Unlike the previous version, stack analysis and control
|
||||
flow graphs are computed in a single pass in the
|
||||
mini_method_to_ir function, this is done for performance
|
||||
reasons: although the complexity increases, the benefit
|
||||
for a JIT compiler is that there is more time available
|
||||
for performing other optimizations.
|
||||
|
||||
* Basic block computation.
|
||||
|
||||
mini_method_to_ir populates the MonoCompile structure
|
||||
with an array of basic blocks each of which contains
|
||||
forest of trees made up of MonoInst structures.
|
||||
|
||||
* Inlining
|
||||
|
||||
Inlining is no longer restricted to methods containing
|
||||
one single basic block, instead it is possible to inline
|
||||
arbitrary complex methods.
|
||||
|
||||
The heuristics to choose what to inline are likely going
|
||||
to be tuned in the future.
|
||||
|
||||
* Method to opcode conversion.
|
||||
|
||||
Some method call invocations like `call Math.Sin' are
|
||||
transformed into an opcode: this transforms the call
|
||||
into a semantically rich node, which is later inline
|
||||
into an FPU instruction.
|
||||
|
||||
Various Array methods invocations are turned into
|
||||
opcodes as well (The Get, Set and Address methods)
|
||||
|
||||
* Tail recursion elimination
|
||||
|
||||
Basic blocks ****
|
||||
|
||||
The MonoInst structure holds the actual decoded instruction,
|
||||
with the semantic information from the stack analysis.
|
||||
MonoInst is interesting because initially it is part of a tree
|
||||
structure, here is a sample of the same tree with the new JIT
|
||||
engine:
|
||||
|
||||
(stind.i4 regoffset[0xffffffd4(%ebp)]
|
||||
(add (ldind.i4 regoffset[0xffffffd8(%ebp)])
|
||||
iconst[1]))
|
||||
|
||||
This is a medium-level intermediate representation (MIR).
|
||||
|
||||
Some complex opcodes are decomposed at this stage into a
|
||||
collection of simpler opcodes. Not every complex opcode is
|
||||
decomposed at this stage, as we need to preserve the semantic
|
||||
information during various optimization phases.
|
||||
|
||||
For example a NEWARR opcode carries the length and the type of
|
||||
the array that could be used later to avoid type checking or
|
||||
array bounds check.
|
||||
|
||||
There are a number of operations supported on this
|
||||
representation:
|
||||
|
||||
* Branch optimizations.
|
||||
|
||||
* Variable liveness.
|
||||
|
||||
* Loop optimizations: the dominator trees are
|
||||
computed, loops are detected, and their nesting
|
||||
level computed.
|
||||
|
||||
* Conversion of the method into static single assignment
|
||||
form (SSA form).
|
||||
|
||||
* Dead code elimination.
|
||||
|
||||
* Constant propagation.
|
||||
|
||||
* Copy propagation.
|
||||
|
||||
* Constant folding.
|
||||
|
||||
Once the above optimizations are optionally performed, a
|
||||
decomposition phase is used to turn some complex opcodes into
|
||||
internal method calls. In the initial version of the JIT
|
||||
engine, various operations on longs are emulated instead of
|
||||
being inlined. Also the newarr invocation is turned into a
|
||||
call to the runtime.
|
||||
|
||||
At this point, after computing variable liveness, it is
|
||||
possible to use the linear scan algorithm for allocating
|
||||
variables to registers. The linear scan pass uses the
|
||||
information that was previously gathered by the loop nesting
|
||||
and loop structure computation to favor variables in inner
|
||||
loops. This process updates the basic block `nesting' field
|
||||
which is later used during liveness analysis.
|
||||
|
||||
Stack space is then reserved for the local variables and any
|
||||
temporary variables generated during the various
|
||||
optimizations.
|
||||
|
||||
** Instruction selection
|
||||
|
||||
At this point, the BURS instruction selector is invoked to
|
||||
transform the tree-based representation into a list of
|
||||
instructions. This is done using a tree pattern matcher that
|
||||
is generated for the architecture using the `monoburg' tool.
|
||||
|
||||
Monoburg takes as input a file that describes tree patterns,
|
||||
which are matched against the trees that were produced by the
|
||||
engine in the previous stages.
|
||||
|
||||
The pattern matching might have more than one match for a
|
||||
particular tree. In this case, the match selected is the one
|
||||
whose cost is the smallest. A cost can be attached to each
|
||||
rule, and if no cost is provided, the implicit cost is one.
|
||||
Smaller costs are selected over higher costs.
|
||||
|
||||
The cost function can be used to select particular blocks of
|
||||
code for a given architecture, or by using a prohibitive high
|
||||
number to avoid having the rule match.
|
||||
|
||||
The various rules that our JIT engine uses transform a tree of
|
||||
MonoInsts into a list of monoinsts:
|
||||
|
||||
+-----------------------------------------------------------+
|
||||
| Tree List |
|
||||
| of ===> Instruction selection ===> of |
|
||||
| MonoInst MonoInst. |
|
||||
+-----------------------------------------------------------+
|
||||
|
||||
During this process various "types" of MonoInst kinds
|
||||
disappear and turned into lower-level representations. The
|
||||
JIT compiler just happens to reuse the same structure (this is
|
||||
done to reduce memory usage and improve memory locality).
|
||||
|
||||
The instruction selection rules are split in a number of
|
||||
files, each one with a particular purpose:
|
||||
|
||||
inssel.brg
|
||||
Contains the generic instruction selection
|
||||
patterns.
|
||||
|
||||
inssel-x86.brg
|
||||
Contains x86 specific rules.
|
||||
|
||||
inssel-ppc.brg
|
||||
Contains PowerPC specific rules.
|
||||
|
||||
inssel-long32.brg
|
||||
burg file for 64bit instructions on 32bit architectures.
|
||||
|
||||
inssel-long.brg
|
||||
burg file for 64bit architectures.
|
||||
|
||||
inssel-float.brg
|
||||
burg file for floating point instructions
|
||||
|
||||
For a given build, a set of those files would be included.
|
||||
For example, for the build of Mono on the x86, the following
|
||||
set is used:
|
||||
|
||||
inssel.brg inssel-x86.brg inssel-long32.brg inssel-float.brg
|
||||
|
||||
** Native method generation
|
||||
|
||||
The native method generation has a number of steps:
|
||||
|
||||
* Architecture specific register allocation.
|
||||
|
||||
The information about loop nesting that was
|
||||
previously gathered is used here to hint the
|
||||
register allocator.
|
||||
|
||||
* Generating the method prolog/epilog.
|
||||
|
||||
* Optionally generate code to introduce tracing facilities.
|
||||
|
||||
* Hooking into the debugger.
|
||||
|
||||
* Performing any pending fixups.
|
||||
|
||||
* Code generation.
|
||||
|
||||
*** Code Generation
|
||||
|
||||
The actual code generation is contained in the architecture
|
||||
specific portion of the compiler. The input to the code
|
||||
generator is each one of the basic blocks with its list of
|
||||
instructions that were produced in the instruction selection
|
||||
phase.
|
||||
|
||||
During the instruction selection phase, virtual registers are
|
||||
assigned. Just before the peephole optimization is performed,
|
||||
physical registers are assigned.
|
||||
|
||||
A simple peephole and algebraic optimizer is ran at this
|
||||
stage.
|
||||
|
||||
The peephole optimizer removes some redundant operations at
|
||||
this point. This is possible because the code generation at
|
||||
this point has visibility into the basic block that spans the
|
||||
original trees.
|
||||
|
||||
The algebraic optimizer performs some simple algebraic
|
||||
optimizations that replace expensive operations with cheaper
|
||||
operations if possible.
|
||||
|
||||
The rest of the code generation is fairly simple: a switch
|
||||
statement is used to generate code for each of the MonoInsts,
|
||||
in the mono/mini/mini-ARCH.c files, the method is called
|
||||
"mono_arch_output_basic_block".
|
||||
|
||||
We always try to allocate code in sequence, instead of just using
|
||||
malloc. This way we increase spatial locality which gives a massive
|
||||
speedup on most architectures.
|
||||
|
||||
*** Ahead of Time compilation
|
||||
|
||||
Ahead-of-Time compilation is a new feature of our new
|
||||
compilation engine. The compilation engine is shared by the
|
||||
Just-in-Time (JIT) compiler and the Ahead-of-Time compiler
|
||||
(AOT).
|
||||
|
||||
The difference is on the set of optimizations that are turned
|
||||
on for each mode: Just-in-Time compilation should be as fast
|
||||
as possible, while Ahead-of-Time compilation can take as long
|
||||
as required, because this is not done at a time critical
|
||||
time.
|
||||
|
||||
With AOT compilation, we can afford to turn all of the
|
||||
computationally expensive optimizations on.
|
||||
|
||||
After the code generation phase is done, the code and any
|
||||
required fixup information is saved into a file that is
|
||||
readable by "as" (the native assembler available on all
|
||||
systems). This assembly file is then passed to the native
|
||||
assembler, which generates a loadable module.
|
||||
|
||||
At execution time, when an assembly is loaded from the disk,
|
||||
the runtime engine will probe for the existence of a
|
||||
pre-compiled image. If the pre-compiled image exists, then it
|
||||
is loaded, and the method invocations are resolved to the code
|
||||
contained in the loaded module.
|
||||
|
||||
The code generated under the AOT scenario is slightly
|
||||
different than the JIT scenario. It generates code that is
|
||||
application-domain relative and that can be shared among
|
||||
multiple thread.
|
||||
|
||||
This is the same code generation that is used when the runtime
|
||||
is instructed to maximize code sharing on a multi-application
|
||||
domain scenario.
|
||||
|
||||
* SSA-based optimizations
|
||||
|
||||
SSA form simplifies many optimization because each variable
|
||||
has exactly one definition site. This means that each
|
||||
variable is only initialized once.
|
||||
|
||||
For example, code like this:
|
||||
|
||||
a = 1
|
||||
..
|
||||
a = 2
|
||||
call (a)
|
||||
|
||||
Is internally turned into:
|
||||
|
||||
a1 = 1
|
||||
..
|
||||
a2 = 2
|
||||
call (a2)
|
||||
|
||||
In the presence of branches, like:
|
||||
|
||||
if (x)
|
||||
a = 1
|
||||
else
|
||||
a = 2
|
||||
|
||||
call (a)
|
||||
|
||||
The code is turned into:
|
||||
|
||||
if (x)
|
||||
a1 = 1;
|
||||
else
|
||||
a2 = 2;
|
||||
a3 = phi (a1, a2)
|
||||
call (a3)
|
||||
|
||||
All uses of a variable are "dominated" by its definition
|
||||
|
||||
This representation is useful as it simplifies the
|
||||
implementation of a number of optimizations like conditional
|
||||
constant propagation, array bounds check removal and dead code
|
||||
elimination.
|
||||
|
||||
* Register allocation.
|
||||
|
||||
Global register allocation is performed on the medium
|
||||
intermediate representation just before instruction selection
|
||||
is performed on the method. Local register allocation is
|
||||
later performed at the basic-block level on the
|
||||
|
||||
Global register allocation uses the following input:
|
||||
|
||||
1) set of register-sized variables that can be allocated to a
|
||||
register (this is an architecture specific setting, for x86
|
||||
these registers are the callee saved register ESI, EDI and
|
||||
EBX).
|
||||
|
||||
2) liveness information for the variables
|
||||
|
||||
3) (optionally) loop info to favor variables that are used in
|
||||
inner loops.
|
||||
|
||||
During instruction selection phase, symbolic registers are
|
||||
assigned to temporary values in expressions.
|
||||
|
||||
Local register allocation assigns hard registers to the
|
||||
symbolic registers, and it is performed just before the code
|
||||
is actually emitted and is performed at the basic block level.
|
||||
A CPU description file describes the input registers, output
|
||||
registers, fixed registers and clobbered registers by each
|
||||
operation.
|
||||
|
||||
* BURG Code Generator Generator
|
||||
|
||||
monoburg was written by Dietmar Maurer. It is based on the
|
||||
papers from Christopher W. Fraser, Robert R. Henry and Todd
|
||||
A. Proebsting: "BURG - Fast Optimal Instruction Selection and
|
||||
Tree Parsing" and "Engineering a Simple, Efficient Code
|
||||
Generator Generator".
|
||||
|
||||
The original BURG implementation is unable to work on DAGs, instead only
|
||||
trees are allowed. Our monoburg implementations is able to generate tree
|
||||
matcher which works on DAGs, and we use this feature in the new
|
||||
JIT. This simplifies the code because we can directly pass DAGs and
|
||||
don't need to convert them to trees.
|
||||
|
||||
* Adding IL opcodes: an excercise (from a post by Paolo Molaro)
|
||||
|
||||
mini.c is the file that read the IL code stream and decides
|
||||
how any single IL instruction is implemented
|
||||
(mono_method_to_ir () func), so you always have to add an
|
||||
entry to the big switch inside the function: there are plenty
|
||||
of examples in that file.
|
||||
|
||||
An IL opcode can be implemented in a number of ways, depending
|
||||
on what it does and how it needs to do it.
|
||||
|
||||
Some opcodes are implemented using a helper function: one of
|
||||
the simpler examples is the CEE_STELEM_REF implementation.
|
||||
|
||||
In this case the opcode implementation is written in a C
|
||||
function. You will need to register the function with the jit
|
||||
before you can use it (mono_register_jit_call) and you need to
|
||||
emit the call to the helper using the mono_emit_jit_icall()
|
||||
function.
|
||||
|
||||
This is the simpler way to add a new opcode and it doesn't
|
||||
require any arch-specific change (though it's limited to what
|
||||
you can do in C code and the performance may be limited by the
|
||||
function call).
|
||||
|
||||
Other opcodes can be implemented with one or more of the already
|
||||
implemented low-level instructions.
|
||||
|
||||
An example is the OP_STRLEN opcode which implements
|
||||
String.Length using a simple load from memory. In this case
|
||||
you need to add a rule to the appropriate burg file,
|
||||
describing what are the arguments of the opcode and what is,
|
||||
if any, it's 'return' value.
|
||||
|
||||
The OP_STRLEN case is:
|
||||
|
||||
reg: OP_STRLEN (reg) {
|
||||
MONO_EMIT_LOAD_MEMBASE_OP (s, tree, OP_LOADI4_MEMBASE, state->reg1,
|
||||
state->left->reg1, G_STRUCT_OFFSET (MonoString, length));
|
||||
}
|
||||
|
||||
The above means: the OP_STRLEN takes a register as an argument
|
||||
and returns its value in a register. And the implementation
|
||||
of this is included in the braces.
|
||||
|
||||
The opcode returns a value in an integer register
|
||||
(state->reg1) by performing a int32 load of the length field
|
||||
of the MonoString represented by the input register
|
||||
(state->left->reg1): before the burg rules are applied, the
|
||||
internal representation is based on trees, so you get the
|
||||
left/right pointers (state->left and state->right
|
||||
respectively, the result is stored in state->reg1).
|
||||
|
||||
This instruction implementation doesn't require arch-specific
|
||||
changes (it is using the MONO_EMIT_LOAD_MEMBASE_OP which is
|
||||
available on all platforms), and usually the produced code is
|
||||
fast.
|
||||
|
||||
Next we have opcodes that must be implemented with new low-level
|
||||
architecture specific instructions (either because of performance
|
||||
considerations or because the functionality can't get implemented in
|
||||
other ways).
|
||||
|
||||
You also need a burg rule in this case, too. For example,
|
||||
consider the OP_CHECK_THIS opcode (used to raise an exception
|
||||
if the this pointer is null). The burg rule simply reads:
|
||||
|
||||
stmt: OP_CHECK_THIS (reg) {
|
||||
mono_bblock_add_inst (s->cbb, tree);
|
||||
}
|
||||
|
||||
Note that this opcode does not return a value (hence the
|
||||
"stmt") and it takes a register as input.
|
||||
|
||||
mono_bblock_add_inst (s->cbb, tree) just adds the instruction
|
||||
(the tree variable) to the current basic block (s->cbb). In
|
||||
mini this is the place where the internal representation
|
||||
switches from the tree format to the low-level format (the
|
||||
list of simple instructions).
|
||||
|
||||
In this case the actual opcode implementation is delegated to
|
||||
the arch-specific code. A low-level opcode needs an entry in
|
||||
the machine description (the *.md files in mini/). This entry
|
||||
describes what kind of registers are used if any by the
|
||||
instruction, as well as other details such as constraints or
|
||||
other hints to the low-level engine which are architecture
|
||||
specific.
|
||||
|
||||
cpu-pentium.md, for example has the following entry:
|
||||
|
||||
checkthis: src1:b len:3
|
||||
|
||||
This means the instruction uses an integer register as a base
|
||||
pointer (basically a load or store is done on it) and it takes
|
||||
3 bytes of native code to implement it.
|
||||
|
||||
Now you just need to provide the low-level implementation for
|
||||
the opcode in one of the mini-$arch.c files, in the
|
||||
mono_arch_output_basic_block() function. There is a big switch
|
||||
here too. The x86 implementation is:
|
||||
|
||||
case OP_CHECK_THIS:
|
||||
/* ensure ins->sreg1 is not NULL */
|
||||
x86_alu_membase_imm (code, X86_CMP, ins->sreg1, 0, 0);
|
||||
break;
|
||||
|
||||
If the $arch-codegen.h header file doesn't have the code to
|
||||
emit the low-level native code, you'll need to write that as
|
||||
well.
|
||||
|
||||
Complex opcodes with register constraints may require other
|
||||
changes to the local register allocator, but usually they are
|
||||
not needed.
|
||||
|
||||
* Future
|
||||
|
||||
Profile-based optimization is something that we are very
|
||||
interested in supporting. There are two possible usage
|
||||
scenarios:
|
||||
|
||||
* Based on the profile information gathered during
|
||||
the execution of a program, hot methods can be compiled
|
||||
with the highest level of optimizations, while bootstrap
|
||||
code and cold methods can be compiled with the least set
|
||||
of optimizations and placed in a discardable list.
|
||||
|
||||
* Code reordering: this profile-based optimization would
|
||||
only make sense for pre-compiled code. The profile
|
||||
information is used to re-order the assembly code on disk
|
||||
so that the code is placed on the disk in a way that
|
||||
increments locality.
|
||||
|
||||
This is the same principle under which SGI's cord program
|
||||
works.
|
||||
|
||||
The nature of the CIL allows the above optimizations to be
|
||||
easy to implement and deploy. Since we live and define our
|
||||
universe for these things, there are no interactions with
|
||||
system tools required, nor upgrades on the underlying
|
||||
infrastructure required.
|
||||
|
||||
Instruction scheduling is important for certain kinds of
|
||||
processors, and some of the framework exists today in our
|
||||
register allocator and the instruction selector to cope with
|
||||
this, but has not been finished. The instruction selection
|
||||
would happen at the same time as local register allocation. <
|
||||
@@ -1,461 +0,0 @@
|
||||
Mono JIT porting guide.
|
||||
Paolo Molaro ([email protected])
|
||||
|
||||
* Introduction
|
||||
|
||||
This documents describes the process of porting the mono JIT
|
||||
to a new CPU architecture. The new mono JIT has been designed
|
||||
to make porting easier though at the same time enable the port
|
||||
to take full advantage from the new architecture features and
|
||||
instructions. Knowledge of the mini architecture (described in
|
||||
the mini-doc.txt file) is a requirement for understanding this
|
||||
guide, as well as an earlier document about porting the mono
|
||||
interpreter (available on the web site).
|
||||
|
||||
There are six main areas that a port needs to implement to
|
||||
have a fully-functional JIT for a given architecture:
|
||||
|
||||
1) instruction selection
|
||||
2) native code emission
|
||||
3) call conventions and register allocation
|
||||
4) method trampolines
|
||||
5) exception handling
|
||||
6) minor helper methods
|
||||
|
||||
To take advantage of some not-so-common processor features
|
||||
(for example conditional execution of instructions as may be
|
||||
found on ARM or ia64), it may be needed to develop an
|
||||
high-level optimization, but doing so is not a requirement for
|
||||
getting the JIT to work.
|
||||
|
||||
We'll see in more details each of the steps required, note,
|
||||
though, that a new port may just as well start from a
|
||||
cut&paste of an existing port to a similar architecture (for
|
||||
example from x86 to amd64, or from powerpc to sparc).
|
||||
|
||||
The architecture specific code is split from the rest of the
|
||||
JIT, for example the x86 specific code and data is all
|
||||
included in the following files in the distribution:
|
||||
|
||||
mini-x86.h mini-x86.c
|
||||
inssel-x86.brg
|
||||
cpu-pentium.md
|
||||
tramp-x86.c
|
||||
exceptions-x86.c
|
||||
|
||||
I suggest a similar split for other architectures as well.
|
||||
|
||||
Note that this document is still incomplete: some sections are
|
||||
only sketched and some are missing, but the important info to
|
||||
get a port going is already described.
|
||||
|
||||
|
||||
* Architecture-specific instructions and instruction selection.
|
||||
|
||||
The JIT already provides a set of instructions that can be
|
||||
easily mapped to a great variety of different processor
|
||||
instructions. Sometimes it may be necessary or advisable to
|
||||
add a new instruction that represent more closely an
|
||||
instruction in the architecture. Note that a mini instruction
|
||||
can be used to represent also a short sequence of CPU
|
||||
low-level instructions, but note that each instruction
|
||||
represents the minimum amount of code the instruction
|
||||
scheduler will handle (i.e., the scheduler won't schedule the
|
||||
instructions that compose the low-level sequence as individual
|
||||
instructions, but just the whole sequence, as an indivisible
|
||||
block).
|
||||
|
||||
New instructions are created by adding a line in the
|
||||
mini-ops.h file, assigning an opcode and a name. To specify
|
||||
the input and output for the instruction, there are two
|
||||
different places, depending on the context in which the
|
||||
instruction gets used.
|
||||
|
||||
If the instruction is used in the tree representation, the
|
||||
input and output types are defined by the BURG rules in the
|
||||
*.brg files (the usual non-terminals are 'reg' to represent a
|
||||
normal register, 'lreg' to represent a register or two that
|
||||
hold a 64 bit value, freg for a floating point register).
|
||||
|
||||
If an instruction is used as a low-level CPU instruction, the
|
||||
info is specified in a machine description file. The
|
||||
description file is processed by the genmdesc program to
|
||||
provide a data structure that can be easily used from C code
|
||||
to query the needed info about the instruction.
|
||||
|
||||
As an example, let's consider the add instruction for both x86
|
||||
and ppc:
|
||||
|
||||
x86 version:
|
||||
add: dest:i src1:i src2:i len:2 clob:1
|
||||
ppc version:
|
||||
add: dest:i src1:i src2:i len:4
|
||||
|
||||
Note that the instruction takes two input integer registers on
|
||||
both CPU, but on x86 the first source register is clobbered
|
||||
(clob:1) and the length in bytes of the instruction differs.
|
||||
|
||||
Note that integer adds and floating point adds use different
|
||||
opcodes, unlike the IL language (64 bit add is done with two
|
||||
instructions on 32 bit architectures, using a add that sets
|
||||
the carry and an add with carry).
|
||||
|
||||
A specific CPU port may assign any meaning to the clob field
|
||||
for an instruction since the value will be processed in an
|
||||
arch-specific file anyway.
|
||||
|
||||
See the top of the existing cpu-pentium.md file for more info
|
||||
on other fields: the info may or may not be applicable to a
|
||||
different CPU, in this latter case the info can be ignored.
|
||||
|
||||
The code in mini.c together with the BURG rules in inssel.brg,
|
||||
inssel-float.brg and inssel-long32.brg provides general
|
||||
purpose mappings from the tree representation to a set of
|
||||
instructions that should be easily implemented in any
|
||||
architecture. To allow for additional arch-specific
|
||||
functionality, an arch-specific BURG file can be used: in this
|
||||
file arch-specific instructions can be selected that provide
|
||||
better performance than the general instructions or that
|
||||
provide functionality that is needed by the JIT but that
|
||||
cannot be expressed in a general enough way.
|
||||
|
||||
As an example, x86 has the special instruction "push" to make
|
||||
it easier to implement the default call convention (passing
|
||||
arguments on the stack): almost all the other architectures
|
||||
don't have such an instruction (and don't need it anyway), so
|
||||
we added a special rule in the inssel-x86.brg file for it.
|
||||
|
||||
So, one of the first things needed in a port is to write a
|
||||
cpu-$(arch).md machine description file and fill it with the
|
||||
needed info. As a start, only a few instructions can be
|
||||
specified, like the ones required to do simple integer
|
||||
operations. The default rules of the instruction selector will
|
||||
emit the common instructions and so we're ready to go for the
|
||||
next step in porting the JIT.
|
||||
|
||||
|
||||
*) Native code emission
|
||||
|
||||
Since the first step in porting mono to a new CPU is to port
|
||||
the interpreter, there should be already a file that allows
|
||||
the emission of binary native code in a buffer for the
|
||||
architecture. This file should be placed in the
|
||||
|
||||
mono/arch/$(arch)/
|
||||
|
||||
directory.
|
||||
|
||||
The bulk of the code emission happens in the mini-$(arch).c
|
||||
file, in a function called mono_arch_output_basic_block
|
||||
(). This function takes a basic block, walks the list of
|
||||
instructions in the block and emits the binary code for each.
|
||||
Optionally a peephole optimization pass is done on the basic
|
||||
block, but this can be left for later, when the port actually
|
||||
works.
|
||||
|
||||
This function is very simple, there is just a big switch on
|
||||
the instruction opcode and in the corresponding case the
|
||||
functions or macros to emit the binary native code are
|
||||
used. Note that in this function the lengths of the
|
||||
instructions are used to determine if the buffer for the code
|
||||
needs enlarging.
|
||||
|
||||
To complete the code emission for a method, a few other
|
||||
functions need implementing as well:
|
||||
|
||||
mono_arch_emit_prolog ()
|
||||
mono_arch_emit_epilog ()
|
||||
mono_arch_patch_code ()
|
||||
|
||||
mono_arch_emit_prolog () will emit the code to setup the stack
|
||||
frame for a method, optionally call the callbacks used in
|
||||
profiling and tracing, and move the arguments to their home
|
||||
location (in a caller-save register if the variable was
|
||||
allocated to one, or in a stack location if the argument was
|
||||
passed in a volatile register and wasn't allocated a
|
||||
non-volatile one). caller-save registers used by the function
|
||||
are saved in the prolog as well.
|
||||
|
||||
mono_arch_emit_epilog () will emit the code needed to return
|
||||
from the function, optionally calling the profiling or tracing
|
||||
callbacks. At this point the basic blocks or the code that was
|
||||
moved out of the normal flow for the function can be emitted
|
||||
as well (this is usually done to provide better info for the
|
||||
static branch predictor). In the epilog, caller-save
|
||||
registers are restored if they were used.
|
||||
|
||||
Note that, to help exception handling and stack unwinding,
|
||||
when there is a transition from managed to unmanaged code,
|
||||
some special processing needs to be done (basically, saving
|
||||
all the registers and setting up the links in the Last Managed
|
||||
Frame structure).
|
||||
|
||||
When the epilog has been emitted, the upper level code
|
||||
arranges for the buffer of memory that contains the native
|
||||
code to be copied in an area of executable memory and at this
|
||||
point, instructions that use relative addressing need to be
|
||||
patched to have the right offsets: this work is done by
|
||||
mono_arch_patch_code ().
|
||||
|
||||
|
||||
* Call conventions and register allocation
|
||||
|
||||
To account for the differences in the call conventions, a few functions need to
|
||||
be implemented.
|
||||
|
||||
mono_arch_allocate_vars () assigns to both arguments and local
|
||||
variables the offset relative to the frame register where they
|
||||
are stored, dead variables are simply discarded. The total
|
||||
amount of stack needed is calculated.
|
||||
|
||||
mono_arch_call_opcode () is the function that more closely
|
||||
deals with the call convention on a given system. For each
|
||||
argument to a function call, an instruction is created that
|
||||
actually puts the argument where needed, be it the stack or a
|
||||
specific register. This function can also re-arrange th order
|
||||
of evaluation when multiple arguments are involved if needed
|
||||
(like, on x86 arguments are pushed on the stack in reverse
|
||||
order). The function needs to carefully take into accounts
|
||||
platform specific issues, like how structures are returned as
|
||||
well as the differences in size and/or alignment of managed
|
||||
and corresponding unmanaged structures.
|
||||
|
||||
The other chunk of code that needs to deal with the call
|
||||
convention and other specifics of a CPU, is the local register
|
||||
allocator, implemented in a function named
|
||||
mono_arch_local_regalloc (). The local allocator deals with a
|
||||
basic block at a time and basically just allocates registers
|
||||
for temporary values during expression evaluation, spilling
|
||||
and unspilling as necessary.
|
||||
|
||||
The local allocator needs to take into account clobbering
|
||||
information, both during simple instructions and during
|
||||
function calls and it needs to deal with other
|
||||
architecture-specific weirdnesses, like instructions that take
|
||||
inputs only in specific registers or output only is some.
|
||||
|
||||
Some effort will be put later in moving most of the local
|
||||
register allocator to a common file so that the code can be
|
||||
shared more for similar, risc-like CPUs. The register
|
||||
allocator does a first pass on the instructions in a block,
|
||||
collecting liveness information and in a backward pass on the
|
||||
same list performs the actual register allocation, inserting
|
||||
the instructions needed to spill values, if necessary.
|
||||
|
||||
The cross-platform local register allocator is now implemented
|
||||
and it is documented in the jit-regalloc file.
|
||||
|
||||
When this part of code is implemented, some testing can be
|
||||
done with the generated code for the new architecture. Most
|
||||
helpful is the use of the --regression command line switch to
|
||||
run the regression tests (basic.cs, for example).
|
||||
|
||||
Note that the JIT will try to initialize the runtime, but it
|
||||
may not be able yet to compile and execute complex code:
|
||||
commenting most of the code in the mini_init() function in
|
||||
mini.c is needed to let the JIT just compile the regression
|
||||
tests. Also, using multiple -v switches on the command line
|
||||
makes the JIT dump an increasing amount of information during
|
||||
compilation.
|
||||
|
||||
Values loaded into registers need to be extened as needed by
|
||||
the ECMA specs:
|
||||
|
||||
*) integers smaller than 4 bytes are extended to int32 values
|
||||
*) 32 bit floats are extended to double precision (in particular
|
||||
this means that currently all the floating point operations operate
|
||||
on doubles)
|
||||
|
||||
* Method trampolines
|
||||
|
||||
To get better startup performance, the JIT actually compiles a
|
||||
method only when needed. To achieve this, when a call to a
|
||||
method is compiled, we actually emit a call to a magic
|
||||
trampoline. The magic trampoline is a function written in
|
||||
assembly that invokes the compiler to compile the given method
|
||||
and jumps to the newly compiled code, ensuring the arguments
|
||||
it received are passed correctly to the actual method.
|
||||
|
||||
Before jumping to the new code, though, the magic trampoline
|
||||
takes care of patching the call site so that next time the
|
||||
call will go directly to the method instead of the
|
||||
trampoline. How does this all work?
|
||||
|
||||
mono_arch_create_jit_trampoline () creates a small function
|
||||
that just preserves the arguments passed to it and adds an
|
||||
additional argument (the method to compile) before calling the
|
||||
generic trampoline. This small function is called the specific
|
||||
trampoline, because it is method-specific (the method to
|
||||
compile is hard-code in the instruction stream).
|
||||
|
||||
The generic trampoline saves all the arguments that could get
|
||||
clobbered and calls a C function that will do two things:
|
||||
|
||||
*) actually call the JIT to compile the method
|
||||
*) identify the calling code so that it can be patched to call directly
|
||||
the actual method
|
||||
|
||||
If the 'this' argument to a method is a boxed valuetype that
|
||||
is passed to a method that expects just a pointer to the data,
|
||||
an additional unboxing trampoline will need to be inserted as
|
||||
well.
|
||||
|
||||
|
||||
* Exception handling
|
||||
|
||||
Exception handling is likely the most difficult part of the
|
||||
port, as it needs to deal with unwinding (both managed and
|
||||
unmanaged code) and calling catch and filter blocks. It also
|
||||
needs to deal with signals, because mono takes advantage of
|
||||
the MMU in the CPU and of the operation system to handle
|
||||
dereferences of the NULL pointer. Some of the function needed
|
||||
to implement the mechanisms are:
|
||||
|
||||
mono_arch_get_throw_exception () returns a function that takes
|
||||
an exception object and invokes an arch-specific function that
|
||||
will enter the exception processing. To do so, all the
|
||||
relevant registers need to be saved and passed on.
|
||||
|
||||
mono_arch_handle_exception () this function takes the
|
||||
exception thrown and a context that describes the state of the
|
||||
CPU at the time the exception was thrown. The function needs
|
||||
to implement the exception handling mechanism, so it makes a
|
||||
search for an handler for the exception and if none is found,
|
||||
it follows the unhandled exception path (that can print a
|
||||
trace and exit or just abort the current thread). The
|
||||
difficulty here is to unwind the stack correctly, by restoring
|
||||
the register state at each call site in the call chain,
|
||||
calling finally, filters and handler blocks while doing so.
|
||||
|
||||
As part of exception handling a couple of internal calls need
|
||||
to be implemented as well.
|
||||
|
||||
ves_icall_get_frame_info () returns info about a specific
|
||||
frame.
|
||||
|
||||
mono_jit_walk_stack () walks the stack and calls a callback with info for
|
||||
each frame found.
|
||||
|
||||
ves_icall_get_trace () return an array of StackFrame objects.
|
||||
|
||||
** Code generation for filter/finally handlers
|
||||
|
||||
Filter and finally handlers are called from 2 different locations:
|
||||
|
||||
1.) from within the method containing the exception clauses
|
||||
2.) from the stack unwinding code
|
||||
|
||||
To make this possible we implement them like subroutines,
|
||||
ending with a "return" statement. The subroutine does not save
|
||||
the base pointer, because we need access to the local
|
||||
variables of the enclosing method. Its is possible that
|
||||
instructions inside those handlers modify the stack pointer,
|
||||
thus we save the stack pointer at the start of the handler,
|
||||
and restore it at the end. We have to use a "call" instruction
|
||||
to execute such finally handlers.
|
||||
|
||||
The MIR code for filter and finally handlers looks like:
|
||||
|
||||
OP_START_HANDLER
|
||||
...
|
||||
OP_END_FINALLY | OP_ENDFILTER(reg)
|
||||
|
||||
OP_START_HANDLER: should save the stack pointer somewhere
|
||||
OP_END_FINALLY: restores the stack pointers and returns.
|
||||
OP_ENDFILTER (reg): restores the stack pointers and returns the value in "reg".
|
||||
|
||||
** Calling finally/filter handlers
|
||||
|
||||
There is a special opcode to call those handler, its called
|
||||
OP_CALL_HANDLER. It simple emits a call instruction.
|
||||
|
||||
Its a bit more complex to call handler from outside (in the
|
||||
stack unwinding code), because we have to restore the whole
|
||||
context of the method first. After that we simply emit a call
|
||||
instruction to invoke the handler. Its usually possible to use
|
||||
the same code to call filter and finally handlers (see
|
||||
arch_get_call_filter).
|
||||
|
||||
** Calling catch handlers
|
||||
|
||||
Catch handlers are always called from the stack unwinding
|
||||
code. Unlike finally clauses or filters, catch handler never
|
||||
return. Instead we simply restore the whole context, and
|
||||
restart execution at the catch handler.
|
||||
|
||||
** Passing Exception objects to catch handlers and filters.
|
||||
|
||||
We use a local variable to store exception objects. The stack
|
||||
unwinding code must store the exception object into this
|
||||
variable before calling catch handler or filter.
|
||||
|
||||
* Minor helper methods
|
||||
|
||||
A few minor helper methods are referenced from the arch-independent code.
|
||||
Some of them are:
|
||||
|
||||
*) mono_arch_cpu_optimizations ()
|
||||
This function returns a mask of optimizations that
|
||||
should be enabled for the current CPU and a mask of
|
||||
optimizations that should be excluded, instead.
|
||||
|
||||
*) mono_arch_regname ()
|
||||
Returns the name for a numeric register.
|
||||
|
||||
*) mono_arch_get_allocatable_int_vars ()
|
||||
Returns a list of variables that can be allocated to
|
||||
the integer registers in the current architecture.
|
||||
|
||||
*) mono_arch_get_global_int_regs ()
|
||||
Returns a list of caller-save registers that can be
|
||||
used to allocate variables in the current method.
|
||||
|
||||
*) mono_arch_instrument_mem_needs ()
|
||||
*) mono_arch_instrument_prolog ()
|
||||
*) mono_arch_instrument_epilog ()
|
||||
Functions needed to implement the profiling interface.
|
||||
|
||||
|
||||
* Writing regression tests
|
||||
|
||||
Regression tests for the JIT should be written for any bug
|
||||
found in the JIT in one of the *.cs files in the mini
|
||||
directory. Eventually all the operations of the JIT should be
|
||||
tested (including the ones that get selected only when some
|
||||
specific optimization is enabled).
|
||||
|
||||
|
||||
* Platform specific optimizations
|
||||
|
||||
An example of a platform-specific optimization is the peephole
|
||||
optimization: we look at a small window of code at a time and
|
||||
we replace one or more instructions with others that perform
|
||||
better for the given architecture or CPU.
|
||||
|
||||
* 64 bit support tips, by Zoltan Varga ([email protected])
|
||||
|
||||
For a 64-bit port of the Mono runtime, you will typically do
|
||||
the following:
|
||||
|
||||
* need to use inssel-long.brg instead of
|
||||
inssel-long32.brg.
|
||||
|
||||
* need to implement lots of new opcodes:
|
||||
OP_I<OP> is 32 bit op
|
||||
OP_L<OP> and CEE_<OP> are 64 bit ops
|
||||
|
||||
|
||||
The 64 bit version of an existing port might share the code
|
||||
with the 32 bit port (for example SPARC/SPARV9), or it might
|
||||
be separate (x86/AMD64).
|
||||
|
||||
That will depend on the similarities of the two instructions
|
||||
sets/ABIs etc.
|
||||
|
||||
The runtime and most parts of the JIT are 64 bit clean
|
||||
at this point, so the only parts which require changing are
|
||||
the arch dependent files.
|
||||
|
||||
|
||||
|
||||
|
||||
@@ -1,98 +0,0 @@
|
||||
=pod
|
||||
|
||||
=head1 Internal design document for the mono_handle_d
|
||||
|
||||
This document is designed to hold the design of the mono_handle_d and
|
||||
not as an api reference.
|
||||
|
||||
=head2 Primary goal and purpose
|
||||
|
||||
The mono_handle_d is a process which takes care of the (de)allocation
|
||||
of scratch shared memory and handles (of files, threads, mutexes,
|
||||
sockets etc. see L<WapiHandleType>) and refcounts of the
|
||||
filehandles. It is designed to be run by a user and to be fast, thus
|
||||
minimal error checking on input is done and will most likely crash if
|
||||
given a faulty package. No effort has been, or should be, made to have
|
||||
the daemon talking to machine of different endianness/size of int.
|
||||
|
||||
=head2 How to start the daemon
|
||||
|
||||
To start the daemon you either run the mono_handle_d executable or try
|
||||
to attach to the shared memory segment via L<_wapi_shm_attach> which
|
||||
will start a daemon if one does not exist.
|
||||
|
||||
=head1 Internal details
|
||||
|
||||
The daemon works by opening a socket and listening to clients. These
|
||||
clients send packages over the socket complying to L<struct
|
||||
WapiHandleRequest>.
|
||||
|
||||
=head2 Possible requests
|
||||
|
||||
=over
|
||||
|
||||
=item WapiHandleRequest_New
|
||||
|
||||
Find a handle in the shared memory segment that is free and allocate
|
||||
it to the specified type. To destroy use
|
||||
L</WapiHandleRequest_Close>. A L<WapiHandleResponse> with
|
||||
.type=WapiHandleResponseType_New will be sent back with .u.new.handle
|
||||
set to the handle that was allocated. .u.new.type is the type that was
|
||||
requested.
|
||||
|
||||
=item WapiHandleRequestType_Open
|
||||
|
||||
Increase the ref count of an already created handle. A
|
||||
L<WapiHandleResponse> with .type=WapiHandleResponseType_Open will be sent
|
||||
back with .u.new.handle set to the handle, .u.new.type is set to the
|
||||
type of handle this is.
|
||||
|
||||
=item WapiHandleRequestType_Close
|
||||
|
||||
Decrease the ref count of an already created handle. A
|
||||
L<WapiHandleResponse> with .type=WapiHandleResponseType_Close will be
|
||||
sent back with .u.close.destroy set to TRUE if ref count for this
|
||||
client reached 0.
|
||||
|
||||
=item WapiHandleRequestType_Scratch
|
||||
|
||||
Allocate a shared memory area of size .u.scratch.length in bytes. A
|
||||
L<WapiHandleResponse> with .type=WapiHandleResponseType_Scratch will be
|
||||
sent back with .u.scratch.idx set to the index into the shared
|
||||
memory's scratch area where to memory begins. (works just like
|
||||
malloc(3))
|
||||
|
||||
=item WapiHandleRequestType_Scratch
|
||||
|
||||
Deallocate a shared memory area, this must have been allocated before
|
||||
deallocating. A L<WapiHandleResponse> with
|
||||
.type=WapiHandleResponseType_ScratchFree will be sent back (works just
|
||||
like free(3))
|
||||
|
||||
=back
|
||||
|
||||
=head1 Why a daemon
|
||||
|
||||
From an email:
|
||||
|
||||
Dennis: I just have one question about the daemon... Why does it
|
||||
exist? Isn't it better performancewise to just protect the shared area
|
||||
with a mutex when allocation a new handle/shared mem segment or
|
||||
changing refcnt? It will however be a less resilient to clients that
|
||||
crash (the deamon cleans up ref'd handles if socket closes)
|
||||
|
||||
Dick: It's precisely because with a mutex the shared memory segment
|
||||
can be left in a locked state. Also, it's not so easy to clean up
|
||||
shared memory without it (you can't just mark it deleted when creating
|
||||
it, because you can't attach any more readers to the same segment
|
||||
after that). I did some minimal performance testing, and I don't
|
||||
think the daemon is particularly slow.
|
||||
|
||||
|
||||
=head1 Authors
|
||||
|
||||
Documentaion: Dennis Haney
|
||||
|
||||
Implementation: Dick Porter
|
||||
|
||||
=cut
|
||||
@@ -1,68 +0,0 @@
|
||||
We need to switch to a new register allocator.
|
||||
The current one is split in a global and a local register allocator.
|
||||
The global one can assign only callee-saves registers and happens
|
||||
on the tree-based internal representation: it assigns local variables
|
||||
to hardware registers.
|
||||
The local one happens on the linear representation on a per basic
|
||||
block basis and assigns hard registers to virtual registers (which
|
||||
hold temporary values during expression executions) and it deals also
|
||||
with the platform-specific issues (fixed registers, call conventions).
|
||||
|
||||
Moving to a different register will help solve some of the performance
|
||||
issues introduced by the above split, make the register more easily
|
||||
portable and solve some of the issues generated by dealing with trees.
|
||||
|
||||
The general design ideas are below.
|
||||
|
||||
The new allocator should have a global view of all the method, so it can be
|
||||
able to assign variables also to some of the volatile registers if possible,
|
||||
even across basic blocks (this would improve performance).
|
||||
|
||||
The allocator would be driven by per-arch declarative data, so porting
|
||||
should be easier: an architecture needs to specify register classes,
|
||||
call convention and instructions requirements (similar to the gcc code).
|
||||
|
||||
The allocator should operate on the linear representation, this way it's
|
||||
easier and faster to track usages more correctly. We need to assign virtual
|
||||
registers on a per-method basis instead of per basic block. We can assign
|
||||
virtual registers to variables, too. Note that since we fix the stack offset
|
||||
of local vars only after this step (which happens after the burg rules are run),
|
||||
some of the burg rules that try to optimize the code won't apply anymore:
|
||||
the peephole code may need to be enhanced to do the optimizations instead.
|
||||
|
||||
We need to handle floating point registers in the global allocator, too.
|
||||
|
||||
The new allocator also needs to keep track precisely of which registers
|
||||
contain references or managed pointers to allow us to move to a precise GC.
|
||||
|
||||
It may be worth to use a single increasing set of integers for the virtual
|
||||
registers, with the class of the register stored separately (unless the
|
||||
current local allocator which keeps interger and fp registers separate).
|
||||
|
||||
Since this is a large task, we need to do it in steps as much as possible.
|
||||
The first is to run the register allocator _after_ the burg rules: this
|
||||
requires a rewrite of the liveness code, too, to use linear indexes instead
|
||||
of basic-block/tree number combinations. This can be done by:
|
||||
*) allocating virtual regs to all the locals that can be register allocated
|
||||
*) running the burg rules (some may require adjustments): the local virtual
|
||||
registers are assigned starting from global-virt-regs+1, instead of the current
|
||||
hardware-regs+1, so we can tell apart global and local virt regs.
|
||||
*) running the liveness/whatever code is needed to allocate the global registers
|
||||
*) allocate the rest of the local variables to stack slots
|
||||
*) continue with the current local allocator
|
||||
|
||||
This work could take 2-3 weeks.
|
||||
|
||||
The next step is to define the kind of declarative data an architecture needs
|
||||
and assigning virtual regs to all the registers and making the allocator
|
||||
assign from the volatile registers, too.
|
||||
Note that some of the code that is currently emitted in the arch-specific
|
||||
code, will need to be emitted as instructions that the reg allocator
|
||||
can inspect: think of a method that returns the first argument which is
|
||||
received in a register: the current code copies it to either a local slot or
|
||||
to a global reg in the prolog an copies it back to the return register
|
||||
int he basic block, but since neither the regallocator nor the peephole code
|
||||
knows about the prolog code, the first store cannot be optimized away.
|
||||
The gcc code has some example of how to specify register classes in a
|
||||
declarative way.
|
||||
|
||||
@@ -1,63 +0,0 @@
|
||||
Author: Dietmar Maurer ([email protected])
|
||||
(C) 2001 Ximian, Inc.
|
||||
|
||||
Object and VTable layout
|
||||
========================
|
||||
|
||||
The first pointer inside an Object points to a MonoVtable structure. Objects
|
||||
also contains a MonoThreadsSync structure which is used by the mono Thread
|
||||
implementation.
|
||||
|
||||
typedef struct {
|
||||
MonoVTable *vtable;
|
||||
MonoThreadsSync synchronisation;
|
||||
|
||||
/* object specific data goes here */
|
||||
} MonoObject;
|
||||
|
||||
The MonoVtable contains the vtable, interface offsets and a pointer to static
|
||||
class data. Each object/vtable belongs to exactly one AppDomain.
|
||||
|
||||
typedef struct {
|
||||
MonoClass *klass;
|
||||
MonoDomain *domain;
|
||||
gpointer *interface_offsets;
|
||||
/* a pointer to static data */
|
||||
gpointer data;
|
||||
/* the variable sized vtable is included at the end */
|
||||
gpointer vtable [0];
|
||||
} MonoVTable;
|
||||
|
||||
The MonoClass contains domain independent Class infos.
|
||||
|
||||
typedef struct {
|
||||
/* various class infos */
|
||||
MonoClass *parent;
|
||||
const char *name;
|
||||
const char *name_space;
|
||||
...
|
||||
} MonoClass;
|
||||
|
||||
|
||||
Calling virtual functions:
|
||||
==========================
|
||||
|
||||
Each MonoMethod (if virtual) has an associated slot, which is an index into the
|
||||
VTable. So we can use the following code to compute the address of a virtual
|
||||
function:
|
||||
|
||||
method_addr = object->vtable->vtable [method->slot];
|
||||
|
||||
|
||||
Calling interface methods:
|
||||
==========================
|
||||
|
||||
Each interface class is associated with an unique ID. The following code
|
||||
computes the address of an interface function:
|
||||
|
||||
method_addr = *(object->vtable->interface_offsets [interface_id] + method->slot*4);
|
||||
|
||||
|
||||
|
||||
|
||||
|
||||
@@ -1,113 +0,0 @@
|
||||
|
||||
* How to handle complex IL opcodes in an arch-independent way
|
||||
|
||||
Many IL opcodes are very simple: add, ldind etc.
|
||||
Such opcodes can be implemented with a single cpu instruction
|
||||
in most architectures (on some, a group of IL instructions
|
||||
can be converted to a single cpu op).
|
||||
There are many IL opcodes, though, that are more complex, but
|
||||
can be expressed as a series of trees or a single tree of
|
||||
simple operations. Such simple operations are architecture-independent.
|
||||
It makes sense to decompose such complex IL instructions in their
|
||||
simpler equivalent so that we gain in several ways:
|
||||
*) porting effort is easier, because only the simple instructions
|
||||
need to be implemented in arch-specific code
|
||||
*) we could apply BURG rules to the trees and do pattern matching
|
||||
on them to optimize the expressions according to the host cpu
|
||||
|
||||
The issue is: where do we do such conversion from coarse opcodes to
|
||||
simple expressions?
|
||||
|
||||
* Doing the conversion in method_to_ir ()
|
||||
|
||||
Some of these conversions can certainly be done in method_to_ir (),
|
||||
but it's not always easy to decide which are better done there and
|
||||
which in a different pass.
|
||||
For example, let's take ldlen: in the mono implementation, ldlen
|
||||
can be simply implemented with a load from a fixed position in the
|
||||
array object:
|
||||
|
||||
len = [reg + maxlen_offset]
|
||||
|
||||
However, ldlen carries also semantics information: the result is the
|
||||
length of the array, and since in the CLR arrays are of fixed size,
|
||||
this information can be useful to later do bounds check removal.
|
||||
If we convert this opcode in method_to_ir () we lost some useful
|
||||
information for further optimizations.
|
||||
|
||||
In some other ways, decomposing an opcode in method_to_ir() may
|
||||
allow for better optimizations later on (need to come up with an
|
||||
example here ...).
|
||||
|
||||
* Doing the conversion in inssel.brg
|
||||
|
||||
Some conversion may be done inside the burg rules: this has the
|
||||
disadvantage that the instruction selector is not run again on
|
||||
the resulting expression tree and we could miss some optimization
|
||||
(this is what effectively happens with the coarse opcodes in the old
|
||||
jit). This may also interfere with an efficient local register allocator.
|
||||
It may be possible to add an extension in monoburg that allows a rule
|
||||
such as:
|
||||
|
||||
recheck: LDLEN (reg) {
|
||||
create an expression tree representing LDLEN
|
||||
and return it
|
||||
}
|
||||
|
||||
When the monoburg label process gets back a recheck, it will run
|
||||
the labeling again on the resulting expression tree.
|
||||
If this is possible at all (and in an efficient way) is a
|
||||
question for dietmar:-)
|
||||
It should be noted, though, that this may not always work, since
|
||||
some complex IL opcodes may require a series of expression trees
|
||||
and handling such cases in monoburg could become quite hairy.
|
||||
For example, think of opcode that need to do multiple actions on the
|
||||
same object: this basically means a DUP...
|
||||
On the other end, if a complex opcode needs a DUP, monoburg doesn't
|
||||
actually need to create trees if it emits the instructions in
|
||||
the correct sequence and maintains the right values in the registers
|
||||
(usually the values that need a DUP are not changed...). How
|
||||
this integrates with the current register allocator is not clear, since
|
||||
that assigns registers based on the rule, but the instructions emitted
|
||||
by the rules may be different (this already happens with the current JIT
|
||||
where a MULT is replaced with lea etc...).
|
||||
|
||||
* Doing it in a separate pass.
|
||||
|
||||
Doing the conversion in a separate pass over the instructions
|
||||
is another alternative. This can be done right after method_to_ir ()
|
||||
or after the SSA pass (since the IR after the SSA pass should look
|
||||
almost like the IR we get back from method_to_ir ()).
|
||||
|
||||
This has the following advantages:
|
||||
*) monoburg will handle only the simple opcodes (makes porting easier)
|
||||
*) the instruction selection will be run on all the additional trees
|
||||
*) it's easier to support coarse opcodes that produce multiple expression
|
||||
trees (and apply the monoburg selector on all of them)
|
||||
*) the SSA optimizer will see the original opcodes and will be able to use
|
||||
the semantic info associated with them
|
||||
|
||||
The disadvantage is that this is a separate pass on the code and
|
||||
it takes time (how much has not been measured yet, though).
|
||||
|
||||
With this approach, we may also be able to have C implementations
|
||||
of some of the opcodes: this pass would insert a function call to
|
||||
the C implementation (for example in the cases when first porting
|
||||
to a new arch and implemenating some stuff may be too hard in asm).
|
||||
|
||||
* Extended basic blocks
|
||||
|
||||
IL code needs a lot of checks, bounds checks, overflow checks,
|
||||
type checks and so on. This potentially increases by a lot
|
||||
the number of basic blocks in a control flow graph. However,
|
||||
all such blocks end up with a throw opcode that gives control to the
|
||||
exception handling mechanism.
|
||||
After method_to_ir () a MonoBasicBlock can be considered a sort
|
||||
of extended basic block where the additional exits don't point
|
||||
to basic blocks in the same procedure (at least when the method
|
||||
doesn't have exception tables).
|
||||
We need to make sure the passes following method_to_ir () can cope
|
||||
with such kinds of extended basic blocks (especially the passes
|
||||
that we need to apply to all the methods: as a start, we could
|
||||
skip SSA optimizations for methods with exception clauses...)
|
||||
|
||||
@@ -1,97 +0,0 @@
|
||||
While the Boehm GC is quite good, we need to move to a
|
||||
precise, generational GC for better performance and smaller
|
||||
memory usage (no false-positives memory retentions with big
|
||||
allocations).
|
||||
|
||||
The first working implementation is committed in metadata/sgen-gc.c
|
||||
as of May, 2006. This is a two-generations moving collector and it is
|
||||
currently used to shake out all the issues in the runtime that need to
|
||||
be fixed in order to support precise generational and moving collectors.
|
||||
|
||||
The two main issues are:
|
||||
1) identify as precisely as possible all the pointers to managed objects
|
||||
2) insert write barriers to be able to account for pointers in the old
|
||||
generation pointing to objects in the newer generations
|
||||
|
||||
Point 1 is mostly complete. The runtime can register additional roots
|
||||
with the GC as needed and it provides to the GC precise info on the
|
||||
objects layout. In particular with the new precise GC it is not possible to
|
||||
store GC-allocated memory in IntPtr or UIntPtr fields (in fact, the new GC
|
||||
can allocate only objects and not GC-tracked untyped blobs of memory
|
||||
as the Boehm GC can do). Precise info is tracked also for static fields.
|
||||
What is currently missing here is:
|
||||
*) precise info for ThreadStatic and ContextStatic storage (this also requires
|
||||
better memory management for these sub-heaps)
|
||||
*) precise info for HANDLE_NORMAL gc handles
|
||||
*) precise info for thread stacks (this requires storing the info about
|
||||
managed stack frames along with the jitted code for a method and doing the
|
||||
stack walk for the active threads, considering conservatively the unmanaged
|
||||
stack frames and precisely the managed ones. mono_jit_info_table_find () must
|
||||
be made lock-free for this to work). Precise type info must be maintained
|
||||
for all the local variables. Precise type info should be maintained also
|
||||
for registers.
|
||||
Note that this is not a correctness issue, but a performance one. The more
|
||||
pointers to objects we can deal with precisely, the more effective the GC
|
||||
will be, since it will be able to move the objects. The first two todo items
|
||||
are mostly trivial, while handling precisely the thread stacks is complex to
|
||||
implement and to test and it has a cpu and memory use runtime penalty.
|
||||
In practice we need to be able to describe to the GC _all_ the memory
|
||||
locations that can hold a pointer to a managed object and we must tell it also
|
||||
if that location can contain:
|
||||
*) a pointer to the start of an object or NULL (typically a field of an object)
|
||||
*) a pinning pointer to an object (typically the result of the fixed statment in C#)
|
||||
*) a pointer to the managed heap or to other locations (a typical stack location)
|
||||
Since we need to provide to the GC all the locations it's not possible anymore to
|
||||
store any object in unmanaged memory if it is not explicitly pinned for the entire
|
||||
time the object is stored there. With the Boehm GC this was possible if the object
|
||||
was kept alive in some way, but with the new GC it is not valid anymore, because
|
||||
objects can move: the object will be kept alive because of the other reference, but the
|
||||
pointer in unmanaged memory won't be updated to the new location where the object
|
||||
has been moved.
|
||||
|
||||
Most of the work for inserting write barrier calls is already done as well,
|
||||
but there may be still bugs in this area. In particular for it to work,
|
||||
the correct IL opcodes must be used when storing an object in a field or
|
||||
array element (most of the marshal.c code needs to be reviewed to use
|
||||
stind.ref instead of stind.i/stind.u when needed). When this is done, the
|
||||
JIT will take care of automatically inserting the write barriers.
|
||||
What the JIT does automatically for managed code, must be done manually
|
||||
in the runtime C code that deals with storing fields in objects and arrays
|
||||
or otherwise any operation that could change a pointer in the old generation
|
||||
to point to an object in the new generation. Sample cases are as follows:
|
||||
|
||||
*) when using C structs that map to managed objects the following macro
|
||||
must be used to store an object in a field (the macro must not be used
|
||||
when storing non-objects and it should not be used when storing NULL values):
|
||||
|
||||
MONO_OBJECT_SETREF(obj,fieldname,value)
|
||||
where obj is the pointer to the object, fieldname is the name of the field in
|
||||
the C struct and value is a MonoObject*. Note that obj must be a correctly
|
||||
typed pointer to a struct that embeds MonoObject as the first field and
|
||||
have fieldname as a field.
|
||||
|
||||
*) when setting the element of an array of references to an object, use the
|
||||
following macro:
|
||||
|
||||
mono_array_setref (array,index,value)
|
||||
|
||||
*) when copying a number of references from an array to another:
|
||||
|
||||
mono_array_memcpy_refs (dest,destidx,src,srcidx,count)
|
||||
|
||||
*) when copying a struct that may containe reference fields, use:
|
||||
|
||||
void mono_value_copy (gpointer dest, gpointer src, MonoClass *klass)
|
||||
|
||||
*) when it is unknown if a pointer points to the stack or to the heap and an
|
||||
object needs to be stored through it, use:
|
||||
|
||||
void mono_gc_wbarrier_generic_store (gpointer ptr, MonoObject* value)
|
||||
|
||||
Note that the support for write barriers in the runtime could be
|
||||
used to enable also the generational features of the Boehm GC.
|
||||
|
||||
Some more documentation on the new GC is available at:
|
||||
http://www.mono-project.com/Compacting_GC
|
||||
|
||||
|
||||
@@ -1,16 +0,0 @@
|
||||
<h1>Mono 1.0 Release Notes</h1>
|
||||
|
||||
<h2>What does Mono Include</h2>
|
||||
|
||||
<h2>Missing functionality</h2>
|
||||
|
||||
<p>COM support.
|
||||
|
||||
<p>EnterpriseServices are non-existant.
|
||||
|
||||
<p>Windows.Forms is only available as a preview, it is not
|
||||
completed nor stable.
|
||||
|
||||
<h3>Assembly: System.Drawing</h3>
|
||||
|
||||
<p>System.Drawing.Printing is not supported.
|
||||
-253
@@ -1,253 +0,0 @@
|
||||
Runtime support for Remoting
|
||||
============================
|
||||
|
||||
The runtime supports a special objects called "TransparentProxy". You can
|
||||
create objects of this type by calling GetTransparentProxy() on a "RealProxy"
|
||||
object.
|
||||
|
||||
LDFLD/STFLD for transparent proxies
|
||||
===================================
|
||||
|
||||
Access to fields must be redirected to the remote object. System.Object has
|
||||
some special methods for that:
|
||||
|
||||
void FieldGetter (string typeName, string fieldName, ref object val);
|
||||
|
||||
void FieldSetter (string typeName, string fieldName, object val);
|
||||
|
||||
This methods are never called on actual object. The are only used to pack
|
||||
LDFLD/STFLD operations into method call messages, which are then passed to the
|
||||
RealProxy::Invoke() method.
|
||||
|
||||
There are two helper methods which can be used by the JIT and the interpreter
|
||||
to convert LDFLD/STFLD operations into messages and then call
|
||||
RealProxy::Invoke(): mono_store_remote_field() and mono_load_remote_field().
|
||||
|
||||
Cross app domain optimizations
|
||||
==============================
|
||||
|
||||
The new implementation of the cross app domain channel makes a minimal use of
|
||||
the remoting infrastructure. The idea is to create remoting wrappers specific
|
||||
for cross app domain calls, which take the input paramers, switch the domain
|
||||
and dispatch the call in the new domain.
|
||||
|
||||
When an vtable for a proxy needs to be created, the runtime checks if the proxy
|
||||
is referencing an object that belongs to another domain in the same process.
|
||||
In such case, the fast xdomain wrapper is returned instead of the regular one.
|
||||
|
||||
The xdomain wrapper will have a different structure depending on the signature
|
||||
of the method it wraps, since different types have different marshalling needs.
|
||||
There are four types of marshalling, the first one is the fastest, the last one
|
||||
is the slowest:
|
||||
|
||||
1) No marshalling at all: this is for primitive types.
|
||||
|
||||
2) Internal copy of the object in the new domain: some system types can
|
||||
be copied from one domain to the other by the runtime. This currently
|
||||
applies to arrays of primitive types (or arrays of values that can be
|
||||
internally copied), String and StringBuilder. We can add more types in
|
||||
the future.
|
||||
|
||||
3) Internal copy for Out parameters. It is a specific case of the previous
|
||||
type, when an input parameter has the [Out] attribute, which means that the
|
||||
content of the object that is marshalled into the new domain, needs to be
|
||||
copied over the instance of the original object. This applies to arrays
|
||||
of primitive types and StringBuilder. This is used, for example, to be able
|
||||
to call methods such as Stream.Read ([Out]buffer, pos, lengh) across domains.
|
||||
|
||||
4) Serialization. The value is serialized in one domain and deserialized in the
|
||||
other one.
|
||||
|
||||
The xdomain wrapper will be generated according to the marshalling needs of
|
||||
each parameter.
|
||||
|
||||
The cross domain wrapper is divided in two methods. The first method (the
|
||||
wrapper itself) takes the input parameters and serializes those that need to
|
||||
be serialized. After that, sets the new domain and calls to a second method
|
||||
in the new domain, which deserializes the parameters, makes a local copy of
|
||||
those that don't need serialization, and dispatches the call to the real
|
||||
object. Then, the inverse sequence is followed: return values are serialized,
|
||||
flow returns to the first method, which changes the domain again and
|
||||
deserializes the values.
|
||||
|
||||
Sample wrapper
|
||||
--------------
|
||||
|
||||
This are examples of cross domain wrappers in pseudo-C# code.
|
||||
The first example is for a method with the following signature:
|
||||
|
||||
ArrayList Test (int a, string b, ArrayList c, ref ArrayList d, ref string e, ref int f)
|
||||
|
||||
Of course, the wrapper has the same signature:
|
||||
|
||||
ArrayList Test_xdomain_invoke (int a, string b, ArrayList c, ref ArrayList d, ref string e, ref int f)
|
||||
{
|
||||
int loc_new_domainid, loc_old_domainid;
|
||||
ArrayList loc_return;
|
||||
byte[] loc_serialized_array;
|
||||
|
||||
// Save thread domain data
|
||||
Context loc_context = Thread.CurrentContext;
|
||||
if (loc_context.IsDefaultContext) {
|
||||
return Test_remoting_invoke (a, b, c, ref d, ref e, ref f);
|
||||
}
|
||||
object loc_datastore = Thread.ResetDataStoreStatus ();
|
||||
|
||||
// Create the array that will hold the parameters to be serialized
|
||||
object[] loc_array = new object [3]; // +1 to store the return value
|
||||
loc_array [0] = c;
|
||||
loc_array [1] = d;
|
||||
|
||||
// Serialize parameters
|
||||
loc_serialized_array = RemotingServices.SerializeCallData (loc_Array);
|
||||
|
||||
// Get the target domain id and change the domain
|
||||
RealProxy loc_real_proxy = ((TransparentProxy)this).rp;
|
||||
loc_new_domainid = loc_real_proxy->target_domain_id;
|
||||
|
||||
loc_old_domainid = mono_remoting_set_domain_by_id (loc_new_domainid);
|
||||
|
||||
string e_copy = e;
|
||||
/* The following is an indirect call made into the target domain */
|
||||
Test_xdomain_dispatch (rp, ref loc_serialized_array, out loc_serialized_exc, a, b, ref e_copy, ref f);
|
||||
|
||||
// Switch context
|
||||
mono_remoting_set_domain_by_id (loc_old_domainid);
|
||||
|
||||
// Restore thread domain data
|
||||
mono_context_set (loc_context);
|
||||
Thread.RestoreDataStoreStatus (loc_datastore);
|
||||
|
||||
if (loc_serialized_exc != null) {
|
||||
Exception ex = (Exception) RemotingServices.DeserializeCallData (loc_serialized_exc);
|
||||
ex.FixRemotingException ();
|
||||
throw ex;
|
||||
}
|
||||
|
||||
// copy back non-serialized output parametars
|
||||
e = mono_marshal_xdomain_copy_value (e_copy);
|
||||
|
||||
// Deserialize out parameters
|
||||
loc_serialized_array = mono_marshal_xdomain_copy_value (loc_serialized_array);
|
||||
loc_array = RemotingServices.DeserializeObject (loc_serialized_array);
|
||||
d = loc_array [1];
|
||||
mono_thread_force_interruption_checkpoint ();
|
||||
return loc_array [2];
|
||||
}
|
||||
|
||||
void Test_xdomain_dispatch (RealProxy rp, ref byte[] loc_call_data, out byte[] loc_exc_data, int a, string b, ref string e, ref int f)
|
||||
{
|
||||
// Deserialize parameters
|
||||
try {
|
||||
// Clean the call context
|
||||
CallContext.SetCurrentCallContext (null);
|
||||
|
||||
// Deserialize call data
|
||||
if (loc_call_data != null) {
|
||||
loc_call_data = mono_marshal_xdomain_copy_value (loc_call_data);
|
||||
loc_array = RemotingServices.DeserializeCallData (loc_call_data);
|
||||
}
|
||||
|
||||
// Get the target object
|
||||
object target = rp.GetAppDomainTarget ();
|
||||
|
||||
// Load the arguments
|
||||
b = mono_marshal_xdomain_copy_value (b);
|
||||
|
||||
// Make the call to the real object
|
||||
mono_thread_force_interruption_checkpoint ();
|
||||
loc_return = target.Test (a, b, loc_array[0], ref loc_array[1], ref e, ref f);
|
||||
|
||||
// Serialize the return values
|
||||
// Reset parameters in the array that don't need to be serialized back
|
||||
loc_array [0] = null;
|
||||
// Add the return value to the array
|
||||
loc_array [2] = loc_return;
|
||||
// Serialize
|
||||
loc_call_data = RemotingServices.SerializeCallData (loc_array);
|
||||
loc_exc_data = null;
|
||||
}
|
||||
catch (Exception ex) {
|
||||
loc_exc_data = RemotingServices.SerializeExceptionData (ex);
|
||||
}
|
||||
}
|
||||
|
||||
|
||||
Another example
|
||||
---------------
|
||||
|
||||
This is another example of a method with more simple parameters:
|
||||
|
||||
int SimpleTest_xdomain_invoke (int a)
|
||||
{
|
||||
int loc_new_domainid, loc_old_domainid;
|
||||
int loc_return;
|
||||
byte[] loc_serialized_array;
|
||||
|
||||
// Save thread domain data
|
||||
Context loc_context = Thread.CurrentContext;
|
||||
if (loc_context.IsDefaultContext) {
|
||||
return SimpleTest_remoting_invoke (a, b, c, ref d, ref e, ref f);
|
||||
}
|
||||
object loc_datastore = Thread.ResetDataStoreStatus ();
|
||||
|
||||
// Serialize parameters. This will only serialize LogicalContext data if needed.
|
||||
loc_serialized_array = RemotingServices.SerializeCallData (null);
|
||||
|
||||
// Get the target domain id and change the domain
|
||||
RealProxy loc_real_proxy = ((TransparentProxy)this).rp;
|
||||
loc_new_domainid = loc_real_proxy->target_domain_id;
|
||||
|
||||
loc_old_domainid = mono_remoting_set_domain_by_id (loc_new_domainid);
|
||||
|
||||
/* The following is an indirect call made into the target domain */
|
||||
loc_return = SimpleTest_xdomain_dispatch (rp, ref loc_serialized_array, out loc_serialized_exc, a);
|
||||
|
||||
// Switch domain
|
||||
mono_remoting_set_domain_by_id (loc_old_domainid);
|
||||
|
||||
// Restore thread domain data
|
||||
mono_context_set (loc_context);
|
||||
Thread.RestoreDataStoreStatus (loc_datastore);
|
||||
|
||||
if (loc_serialized_exc != null) {
|
||||
Exception ex = (Exception) RemotingServices.DeserializeCallData (loc_serialized_exc);
|
||||
ex.FixRemotingException ();
|
||||
throw ex;
|
||||
}
|
||||
|
||||
RemotingServices.DeserializeCallData (loc_serialized_array);
|
||||
return loc_return [2];
|
||||
}
|
||||
|
||||
|
||||
int SimpleTest_xdomain_dispatch (RealProxy rp, ref byte[] loc_call_data, out byte[] loc_exc_data, int a)
|
||||
{
|
||||
int loc_return;
|
||||
|
||||
// Deserialize parameters
|
||||
try {
|
||||
// Clean the call context
|
||||
CallContext.SetCurrentCallContext (null);
|
||||
|
||||
// Deserialize call data
|
||||
if (loc_call_data != null) {
|
||||
loc_call_data = mono_marshal_xdomain_copy_value (loc_call_data);
|
||||
RemotingServices.DeserializeCallData (loc_call_data);
|
||||
}
|
||||
|
||||
// Get the target object
|
||||
object target = rp.GetAppDomainTarget ();
|
||||
|
||||
// Make the call to the real object
|
||||
loc_return = target.Test (a);
|
||||
|
||||
loc_call_data = RemotingServices.SerializeCallData (loc_Array);
|
||||
loc_exc_data = null;
|
||||
}
|
||||
catch (Exception ex) {
|
||||
loc_exc_data = RemotingServices.SerializeExceptionData (ex);
|
||||
}
|
||||
return loc_return;
|
||||
}
|
||||
|
||||
-250
@@ -1,250 +0,0 @@
|
||||
|
||||
SSAPRE stands for "SSA based Partial Redundancy Elimination".
|
||||
|
||||
The algorithm is explained in this paper:
|
||||
|
||||
Partial Redundancy Elimination in SSA Form (1999)
|
||||
Robert Kennedy, Sun Chan, SHIN-MING LIU, RAYMOND LO, PENG TU, FRED CHOW
|
||||
ACM Transactions on Programming Languages and Systems
|
||||
|
||||
http://citeseer.ist.psu.edu/kennedy99partial.html
|
||||
|
||||
In this document I give a gentle introduction to the concept of "partial"
|
||||
redundancies, and I explain the basic design decisions I took in implementing
|
||||
SSAPRE, but the paper is essential to understand the code.
|
||||
|
||||
Partial Redundancy Elimination (or PRE) is an optimization that (guess what?)
|
||||
tries to remove redundant computations.
|
||||
It achieves this by saving the result of "not redundant" evaluations of
|
||||
expressions into appositely created temporary variables, so that "redundant"
|
||||
evaluations can be replaced by a load from the appropriate variable.
|
||||
|
||||
Of course, on register starved architectures (x86) a temporary could cost more
|
||||
than the evaluation itself... PRE guarantees that the live range of the
|
||||
introduced variables is the minimal possible, but the added pressure on the
|
||||
register allocator can be an issue.
|
||||
|
||||
The nice thing about PRE is that it not only removes "full" redundancies, but
|
||||
also "partial" ones.
|
||||
A full redundancy is easy to spot, and straightforward to handle, like in the
|
||||
following example (in every example here, the "expression" is "a + b"):
|
||||
|
||||
int FullRedundancy1 (int a, int b) {
|
||||
int v1 = a + b;
|
||||
int v2 = a + b;
|
||||
return v1 + v2;
|
||||
}
|
||||
|
||||
PRE would transform it like this:
|
||||
|
||||
int FullRedundancy1 (int a, int b) {
|
||||
int t = a + b;
|
||||
int v1 = t;
|
||||
int v2 = t;
|
||||
return v1 + v2;
|
||||
}
|
||||
|
||||
Of course, either a copy propagation pass or a register allocator smart enough
|
||||
to remove unneeded variables would be necessary afterwords.
|
||||
|
||||
Another example of full redundancy is the following:
|
||||
|
||||
int FullRedundancy2 (int a, int b) {
|
||||
int v1;
|
||||
|
||||
if (a >= 0) {
|
||||
v1 = a + b; // BB1
|
||||
} else {
|
||||
a = -a; // BB2
|
||||
v1 = a + b;
|
||||
}
|
||||
|
||||
int v2 = a + b; // BB3
|
||||
return v1 + v2;
|
||||
}
|
||||
|
||||
Here the two expressions in BB1 and BB2 are *not* the same thing (a is
|
||||
modified in BB2), but both are redundant with the expression in BB3, so the
|
||||
code can be transformed like this:
|
||||
|
||||
int FullRedundancy2 (int a, int b) {
|
||||
int v1;
|
||||
int t;
|
||||
|
||||
if (a >= 0) {
|
||||
t = a + b; // BB1
|
||||
v1 = t;
|
||||
} else {
|
||||
a = -a; // BB2
|
||||
t = a + b;
|
||||
v1 = t;
|
||||
}
|
||||
|
||||
int v2 = t; // BB3
|
||||
return v1 + v2;
|
||||
}
|
||||
|
||||
Note that there are still two occurrences of the expression, while it can be
|
||||
easily seen that one (at the beginning of BB3) would suffice.
|
||||
This, however, is not a redundancy for PRE, because there is no path in the
|
||||
CFG where the expression is evaluated twice.
|
||||
Maybe this other kind of redundancy (which affects code size, and not the
|
||||
computations that are actually performed) would be eliminated by code hoisting,
|
||||
but I should check it; anyway, it is not a PRE related thing.
|
||||
|
||||
An example of partial redundancy, on the other hand, is the following:
|
||||
|
||||
int PartialRedundancy (int a, int b) {
|
||||
int v1;
|
||||
|
||||
if (a >= 0) {
|
||||
v1 = a + b; // BB1
|
||||
} else {
|
||||
v1 = 0; // BB2
|
||||
}
|
||||
|
||||
int v2 = a + b; // BB3
|
||||
return v1 + v2;
|
||||
}
|
||||
|
||||
The redundancy is partial because the expression is computed more than once
|
||||
along some path in the CFG, not all paths.
|
||||
In fact, on the path BB1 - BB3 the expression is computed twice, but on the
|
||||
path BB2 - BB3 it is computed only once.
|
||||
In this case, PRE must insert new occurrences of the expression in order to
|
||||
obtain a full redundancy, and then use temporary variables as before.
|
||||
Adding a computation in BB2 would do the job.
|
||||
|
||||
One nice thing about PRE is that loop invariants can be seen as partial
|
||||
redundancies.
|
||||
The idea is that you can get into the loop from two locations: from before the
|
||||
loop (at the 1st iteration), and from inside the loop itself (at any other
|
||||
iteration). If there is a computation inside the loop that is in fact a loop
|
||||
invariant, PRE will spot this, and will handle the BB before the loop as a
|
||||
place where to insert a new computation to get a full redundancy.
|
||||
At this point, the computation inside the loop would be replaced by an use of
|
||||
the temporary stored before the loop, effectively performing "loop invariant
|
||||
code motion".
|
||||
|
||||
Now, this is what PRE does to the code.
|
||||
|
||||
But how does it work?
|
||||
|
||||
In "classic" solutions, PRE is formulated as a data flow analysis problem.
|
||||
The Muchnick provides a detailed description of the algorithm in this way (it
|
||||
is by far the most complex problem of this kind in the whole book).
|
||||
The point is that this algorithm does not exploit the SSA form.
|
||||
In fact, it has to perform all that amount of data flow analysis exactly
|
||||
because it does not take advantage of the work already done if you have put
|
||||
the program into SSA form.
|
||||
|
||||
The SSAPRE algorithm, on the other hand, is designed with SSA in mind.
|
||||
It fully exploits the properties of SSA variables, it also explicitly reuses
|
||||
some data structures that must have been computed when building the SSA form,
|
||||
and takes great care to output its code in that form already (which means that
|
||||
the temporaries it introduces are already "versioned", with all the phi
|
||||
variables correctly placed).
|
||||
|
||||
The main concept used in this algorithm is the "Factored Redundancy Graph" (or
|
||||
FRG in short). Basically, for each given expression, this graph shows all its
|
||||
occurrences in the program, and redundant ones are linked to their
|
||||
"representative occurrence" (the 1st occurrence met in a CFG traversal).
|
||||
The central observation is that the FRG is "factored" because each expression
|
||||
occurrence has exactly one representative occurrence, in the same way as the
|
||||
SSA form is a "factored" use-definition graph (each use is related to exactly
|
||||
one definition).
|
||||
And in fact building the FRG is much like building an SSA representation, with
|
||||
PHI nodes and all.
|
||||
By the way, I use "PHI" for "PHI expression occurrences", and "phi" for the
|
||||
usual phi definitions in SSA, because the paper uses an uppercase phi greek
|
||||
letter for PHI occurrences (while the lowercase one is standard in SSA).
|
||||
|
||||
The really interesting point is that the FRG for a given expression has exactly
|
||||
the same "shape" of the use-definition graph for the temporary var that must
|
||||
be introduced to remove the redundancy, and this is why SSAPRE can easily emit
|
||||
its output code in correct SSA form.
|
||||
|
||||
One particular characteristic of the SSAPRE algorithm is that it is "sparse",
|
||||
in the sense that it operates on expressions individually, looking only at the
|
||||
specific nodes it needs. This is in contrast to the classical way of solving
|
||||
data flow analysis problems, which is to operate globally, using data
|
||||
structures that work "in parallel" on all the entities they operate on (in
|
||||
practice bit sets, with for instance one bit per variable, or one bit per
|
||||
expression occurrence, you get the idea). This is handy (it exploits the
|
||||
parallelism of bit operations), but in general setting up those data
|
||||
structures is time consuming, and if the number of the things represented by
|
||||
the bits is not fixed in advance the code can get quite messy (bit sets must
|
||||
become growable).
|
||||
Moreover, applying special handling to individual expressions becomes a very
|
||||
tricky thing.
|
||||
|
||||
SSAPRE, on the other hand, looks at the whole program (method in our case) only
|
||||
once, when it scans the code to collect (and classify) all expression
|
||||
occurrences.
|
||||
From here on, it operates on one expression at a time, looking only at its
|
||||
specific data structures (which, for each expression, are much smaller than
|
||||
the whole program, so the operations are fast).
|
||||
|
||||
This approach has another advantage: the data structures used to operate on
|
||||
one expressions can be recycled when operating on other expressions, making
|
||||
the memory usage of the compiler lower, and (also important) avoiding losing
|
||||
time with memory allocations at all.
|
||||
This reflects directly on the design of those data structures.
|
||||
We can better see these advantages following which data structures are used
|
||||
during the application of SSAPRE to a method.
|
||||
|
||||
The steps that are performed are the following:
|
||||
|
||||
* Initialization: scan the whole program, collect all the occurrences, and
|
||||
build a worklist of expressions to be processed (each worklist entry
|
||||
describes all the occurrences of the given expression).
|
||||
Here the data structures are the following:
|
||||
- One struct (the working area), containing the worklist and other
|
||||
"global" data. The worklist itself contains an entry for each expression
|
||||
which in turn has an entry for each occurrence.
|
||||
- One "info" struct for each BB, containing interesting dominance and CFG
|
||||
related properties of the BB.
|
||||
|
||||
Then, for each entry in the worklist, these operations are performed:
|
||||
|
||||
* PHI placement: find where the PHI nodes of the FRG must be placed.
|
||||
* Renaming: assign appropriate "redundancy classes" to all occurrences (it
|
||||
is like assigning variable versions when building an SSA form).
|
||||
* Analyze: compute various flags in PHI nodes (which are the only places
|
||||
that define where additional computations may be added).
|
||||
This conceptually is composed of two data flow analysis passes, which in
|
||||
practice only scan the PHI nodes in the FRG, not the whole code, so they
|
||||
are not that heavy.
|
||||
* Finalize: make so that the FRG is exactly like the use-def graph for the
|
||||
temporary that will be introduced (it generally must be reshaped a bit
|
||||
according to the flags computed in the previous step).
|
||||
This is also made of two steps, but more for implementation reasons than
|
||||
for conceptual ones.
|
||||
* Code motion: actually update the code using the FRG.
|
||||
Here, what's needed is the following:
|
||||
- PHI occurrences (and some flags sbout them)
|
||||
- PHI argument occurrences (and some flags sbout them)
|
||||
- The renaming stack
|
||||
In practice, one can observe that each BB can have at most one PHI (we work
|
||||
on one expression at a time), and also one PHI argument (which we consider
|
||||
occurring at the end of the BB). Therefore, we do not have separate structures
|
||||
for these, but store them directly in the BB infos (which are kept for the
|
||||
whole SSAPRE invocation).
|
||||
The renaming stack is managed directly as a list of occurrences, with
|
||||
special handling for PHI nodes (which, being represented directly by their
|
||||
BB, are not "occurrences").
|
||||
|
||||
|
||||
So far, the only two missing things (with respect to SSAPRE in the paper) are
|
||||
unneeded PHIs eliminantion and the handling of "composite" expressions.
|
||||
Otherwise, the implementation is complete.
|
||||
|
||||
Other interesting issues are:
|
||||
- SSAPRE has the assumption that:
|
||||
- each SSA variable is related to one "original" (not SSA) variable, and
|
||||
- no more than one version of each originsl variable is live at the same time
|
||||
in the CFG.
|
||||
It would be better to relax these assumptions.
|
||||
- SSAPRE operates on "syntactic" redundancies, not on "values".
|
||||
GVNPRE (or other means of merging GVN) would be a nice alternative, see
|
||||
"http://www.cs.purdue.edu/homes/vandrutj/papers/thesis.pdf".
|
||||
@@ -1,33 +0,0 @@
|
||||
Size and alignment requirements of stack values
|
||||
===============================================
|
||||
|
||||
P ... System.IntPtr
|
||||
I1 ... System.Int8
|
||||
I2 ... System.Int16
|
||||
I4 ... System.Int32
|
||||
I8 ... System.Int64
|
||||
F ... System.Single
|
||||
D ... System.Double
|
||||
LD ... native long double
|
||||
|
||||
-----------------------------------------------------------
|
||||
ARCH | P | I1 | I2 | I4 | I8 | F | D | LD |
|
||||
-----------------------------------------------------------
|
||||
X86 | 4/4 | 4/4 | 4/4 | 4/4 | 8/4 | 4/4 | 8/4 |12/4 |
|
||||
-----------------------------------------------------------
|
||||
X86/W32 | 4/4 | 4/4 | 4/4 | 4/4 | 8/4 | 4/4 | 8/4 |12/4 |
|
||||
-----------------------------------------------------------
|
||||
ARM | 4/4 | 4/4 | 4/4 | 4/4 | 8/4 | 4/4 | 8/4 | 8/4 |
|
||||
-----------------------------------------------------------
|
||||
M68K | 4/4 | 4/4 | 4/4 | 4/4 | 8/4 | 4/4 | 8/4 |12/4 |
|
||||
-----------------------------------------------------------
|
||||
ALPHA | 8/8 | 8/8 | 8/8 | 8/8 | 8/8 | 8/8 | 8/8 | 8/8 |
|
||||
-----------------------------------------------------------
|
||||
SPARC | 4/4 | 4/4 | 4/4 | 4/4 | 8/8 | 4/4 | 8/8 |16/8 |
|
||||
-----------------------------------------------------------
|
||||
SPARC64 | 8/8 | 8/8 | 8/8 | 8/8 | 8/8 | 8/8 | 8/8 |16/16|
|
||||
-----------------------------------------------------------
|
||||
MIPS | 4/4 | 4/4 | 4/4 | 4/4 | ?/? | 4/4 | 8/8 | 8/8 |
|
||||
-----------------------------------------------------------
|
||||
| | | | | | | | |
|
||||
-----------------------------------------------------------
|
||||
@@ -1,425 +0,0 @@
|
||||
<?xml version="1.0" encoding="UTF-8" standalone="no"?>
|
||||
<!-- Created with Inkscape (http://www.inkscape.org/) -->
|
||||
<svg
|
||||
xmlns:dc="http://purl.org/dc/elements/1.1/"
|
||||
xmlns:cc="http://web.resource.org/cc/"
|
||||
xmlns:rdf="http://www.w3.org/1999/02/22-rdf-syntax-ns#"
|
||||
xmlns:svg="http://www.w3.org/2000/svg"
|
||||
xmlns="http://www.w3.org/2000/svg"
|
||||
xmlns:sodipodi="http://inkscape.sourceforge.net/DTD/sodipodi-0.dtd"
|
||||
xmlns:inkscape="http://www.inkscape.org/namespaces/inkscape"
|
||||
width="744.09448819"
|
||||
height="1052.3622047"
|
||||
id="svg2"
|
||||
sodipodi:version="0.32"
|
||||
inkscape:version="0.42.2"
|
||||
sodipodi:docbase="/home/miguel/mono/gc"
|
||||
sodipodi:docname="fragmentation.svg"
|
||||
inkscape:export-filename="/tmp/fragmentation.png"
|
||||
inkscape:export-xdpi="90.000000"
|
||||
inkscape:export-ydpi="90.000000">
|
||||
<defs
|
||||
id="defs4" />
|
||||
<sodipodi:namedview
|
||||
id="base"
|
||||
pagecolor="#ffffff"
|
||||
bordercolor="#666666"
|
||||
borderopacity="1.0"
|
||||
inkscape:pageopacity="0.0"
|
||||
inkscape:pageshadow="2"
|
||||
inkscape:zoom="1.6081777"
|
||||
inkscape:cx="225.44672"
|
||||
inkscape:cy="575.14344"
|
||||
inkscape:document-units="px"
|
||||
inkscape:current-layer="layer1"
|
||||
inkscape:window-width="1388"
|
||||
inkscape:window-height="998"
|
||||
inkscape:window-x="0"
|
||||
inkscape:window-y="27" />
|
||||
<metadata
|
||||
id="metadata7">
|
||||
<rdf:RDF>
|
||||
<cc:Work
|
||||
rdf:about="">
|
||||
<dc:format>image/svg+xml</dc:format>
|
||||
<dc:type
|
||||
rdf:resource="http://purl.org/dc/dcmitype/StillImage" />
|
||||
</cc:Work>
|
||||
</rdf:RDF>
|
||||
</metadata>
|
||||
<g
|
||||
inkscape:label="Layer 1"
|
||||
inkscape:groupmode="layer"
|
||||
id="layer1">
|
||||
<g
|
||||
id="g2181"
|
||||
transform="translate(0.000000,5.340576e-5)"
|
||||
inkscape:export-filename="/tmp/compacting.png"
|
||||
inkscape:export-xdpi="124.46000"
|
||||
inkscape:export-ydpi="124.46000">
|
||||
<rect
|
||||
y="336.88107"
|
||||
x="40.380459"
|
||||
height="33.335033"
|
||||
width="150.56403"
|
||||
id="rect1306"
|
||||
style="opacity:1.0000000;fill:#bf0000;fill-opacity:0.28961745;fill-rule:evenodd;stroke:#e97500;stroke-width:0.96217525;stroke-miterlimit:4.0000000;stroke-dasharray:none;stroke-opacity:1.0000000" />
|
||||
<text
|
||||
id="text1308"
|
||||
y="356.82397"
|
||||
x="112.17029"
|
||||
style="font-size:12.000000px;font-style:normal;font-weight:normal;fill:#000000;fill-opacity:1.0000000;stroke:none;stroke-width:1.0000000px;stroke-linecap:butt;stroke-linejoin:miter;stroke-opacity:1.0000000;font-family:Bitstream Vera Sans"
|
||||
xml:space="preserve"><tspan
|
||||
y="356.82397"
|
||||
x="112.17029"
|
||||
id="tspan1310"
|
||||
sodipodi:role="line">a</tspan></text>
|
||||
<text
|
||||
id="text1312"
|
||||
y="357.98737"
|
||||
x="210.86664"
|
||||
style="font-size:12.000000px;font-style:normal;font-weight:normal;fill:#000000;fill-opacity:1.0000000;stroke:none;stroke-width:1.0000000px;stroke-linecap:butt;stroke-linejoin:miter;stroke-opacity:1.0000000;font-family:Bitstream Vera Sans"
|
||||
xml:space="preserve"><tspan
|
||||
y="357.98737"
|
||||
x="210.86664"
|
||||
id="tspan1314"
|
||||
sodipodi:role="line">b</tspan></text>
|
||||
<rect
|
||||
y="336.67050"
|
||||
x="191.33643"
|
||||
height="33.686447"
|
||||
width="47.111221"
|
||||
id="rect1320"
|
||||
style="opacity:1.0000000;fill:#009f9d;fill-opacity:0.28961745;fill-rule:evenodd;stroke:#3a57e9;stroke-width:0.54104435;stroke-miterlimit:4.0000000;stroke-dasharray:none;stroke-opacity:1.0000000" />
|
||||
<text
|
||||
id="text2066"
|
||||
y="356.79828"
|
||||
x="258.88504"
|
||||
style="font-size:12.000000px;font-style:normal;font-weight:normal;fill:#000000;fill-opacity:1.0000000;stroke:none;stroke-width:1.0000000px;stroke-linecap:butt;stroke-linejoin:miter;stroke-opacity:1.0000000;font-family:Bitstream Vera Sans"
|
||||
xml:space="preserve"><tspan
|
||||
y="356.79828"
|
||||
x="258.88504"
|
||||
id="tspan2068"
|
||||
sodipodi:role="line">c</tspan></text>
|
||||
<rect
|
||||
y="332.71930"
|
||||
x="36.785717"
|
||||
height="42.142857"
|
||||
width="252.85715"
|
||||
id="rect2087"
|
||||
style="opacity:1.0000000;fill:#97ff9f;fill-opacity:0.0000000;fill-rule:evenodd;stroke:#e93a3a;stroke-width:1.0000000;stroke-miterlimit:4.0000000;stroke-dasharray:none;stroke-opacity:1.0000000" />
|
||||
<rect
|
||||
y="336.67966"
|
||||
x="238.58723"
|
||||
height="33.686447"
|
||||
width="47.111221"
|
||||
id="rect2070"
|
||||
style="opacity:1.0000000;fill:#009f9d;fill-opacity:0.28961745;fill-rule:evenodd;stroke:#3a57e9;stroke-width:0.54104435;stroke-miterlimit:4.0000000;stroke-dasharray:none;stroke-opacity:1.0000000" />
|
||||
</g>
|
||||
<g
|
||||
id="g2193"
|
||||
transform="translate(0.000000,-1.451759)"
|
||||
inkscape:export-filename="/tmp/compacting.png"
|
||||
inkscape:export-xdpi="124.46000"
|
||||
inkscape:export-ydpi="124.46000">
|
||||
<text
|
||||
id="text2095"
|
||||
y="407.98737"
|
||||
x="210.86664"
|
||||
style="font-size:12.000000px;font-style:normal;font-weight:normal;fill:#000000;fill-opacity:1.0000000;stroke:none;stroke-width:1.0000000px;stroke-linecap:butt;stroke-linejoin:miter;stroke-opacity:1.0000000;font-family:Bitstream Vera Sans"
|
||||
xml:space="preserve"><tspan
|
||||
y="407.98737"
|
||||
x="210.86664"
|
||||
id="tspan2097"
|
||||
sodipodi:role="line">b</tspan></text>
|
||||
<rect
|
||||
y="386.67050"
|
||||
x="191.33643"
|
||||
height="33.686447"
|
||||
width="47.111221"
|
||||
id="rect2099"
|
||||
style="opacity:1.0000000;fill:#009f9d;fill-opacity:0.28961745;fill-rule:evenodd;stroke:#3a57e9;stroke-width:0.54104435;stroke-miterlimit:4.0000000;stroke-dasharray:none;stroke-opacity:1.0000000" />
|
||||
<text
|
||||
id="text2101"
|
||||
y="406.79828"
|
||||
x="258.88504"
|
||||
style="font-size:12.000000px;font-style:normal;font-weight:normal;fill:#000000;fill-opacity:1.0000000;stroke:none;stroke-width:1.0000000px;stroke-linecap:butt;stroke-linejoin:miter;stroke-opacity:1.0000000;font-family:Bitstream Vera Sans"
|
||||
xml:space="preserve"><tspan
|
||||
y="406.79828"
|
||||
x="258.88504"
|
||||
id="tspan2103"
|
||||
sodipodi:role="line">c</tspan></text>
|
||||
<rect
|
||||
y="386.67966"
|
||||
x="238.58722"
|
||||
height="33.686447"
|
||||
width="47.111221"
|
||||
id="rect2107"
|
||||
style="opacity:1.0000000;fill:#009f9d;fill-opacity:0.28961745;fill-rule:evenodd;stroke:#3a57e9;stroke-width:0.54104435;stroke-miterlimit:4.0000000;stroke-dasharray:none;stroke-opacity:1.0000000" />
|
||||
<rect
|
||||
y="382.36215"
|
||||
x="37.142860"
|
||||
height="42.142857"
|
||||
width="252.85715"
|
||||
id="rect2105"
|
||||
style="opacity:1.0000000;fill:#97ff9f;fill-opacity:0.0000000;fill-rule:evenodd;stroke:#e93a3a;stroke-width:1.0000000;stroke-miterlimit:4.0000000;stroke-dasharray:none;stroke-opacity:1.0000000" />
|
||||
</g>
|
||||
<g
|
||||
id="g2202"
|
||||
transform="translate(0.000000,-1.117897)"
|
||||
inkscape:export-filename="/tmp/compacting.png"
|
||||
inkscape:export-xdpi="124.46000"
|
||||
inkscape:export-ydpi="124.46000">
|
||||
<text
|
||||
id="text2109"
|
||||
y="455.84454"
|
||||
x="210.86664"
|
||||
style="font-size:12.000000px;font-style:normal;font-weight:normal;fill:#000000;fill-opacity:1.0000000;stroke:none;stroke-width:1.0000000px;stroke-linecap:butt;stroke-linejoin:miter;stroke-opacity:1.0000000;font-family:Bitstream Vera Sans"
|
||||
xml:space="preserve"><tspan
|
||||
y="455.84454"
|
||||
x="210.86664"
|
||||
id="tspan2111"
|
||||
sodipodi:role="line">b</tspan></text>
|
||||
<rect
|
||||
y="434.52768"
|
||||
x="191.33643"
|
||||
height="33.686447"
|
||||
width="47.111221"
|
||||
id="rect2113"
|
||||
style="opacity:1.0000000;fill:#009f9d;fill-opacity:0.28961745;fill-rule:evenodd;stroke:#3a57e9;stroke-width:0.54104435;stroke-miterlimit:4.0000000;stroke-dasharray:none;stroke-opacity:1.0000000" />
|
||||
<text
|
||||
id="text2115"
|
||||
y="454.65546"
|
||||
x="258.88504"
|
||||
style="font-size:12.000000px;font-style:normal;font-weight:normal;fill:#000000;fill-opacity:1.0000000;stroke:none;stroke-width:1.0000000px;stroke-linecap:butt;stroke-linejoin:miter;stroke-opacity:1.0000000;font-family:Bitstream Vera Sans"
|
||||
xml:space="preserve"><tspan
|
||||
y="454.65546"
|
||||
x="258.88504"
|
||||
id="tspan2117"
|
||||
sodipodi:role="line">c</tspan></text>
|
||||
<rect
|
||||
y="434.53683"
|
||||
x="238.58722"
|
||||
height="33.686447"
|
||||
width="47.111221"
|
||||
id="rect2119"
|
||||
style="opacity:1.0000000;fill:#009f9d;fill-opacity:0.28961745;fill-rule:evenodd;stroke:#3a57e9;stroke-width:0.54104435;stroke-miterlimit:4.0000000;stroke-dasharray:none;stroke-opacity:1.0000000" />
|
||||
<rect
|
||||
y="434.44754"
|
||||
x="41.444386"
|
||||
height="33.686447"
|
||||
width="47.111221"
|
||||
id="rect2127"
|
||||
style="opacity:1.0000000;fill:#009f9d;fill-opacity:0.28961745;fill-rule:evenodd;stroke:#3a57e9;stroke-width:0.54104435;stroke-miterlimit:4.0000000;stroke-dasharray:none;stroke-opacity:1.0000000" />
|
||||
<rect
|
||||
y="430.21933"
|
||||
x="37.142857"
|
||||
height="42.142857"
|
||||
width="252.85715"
|
||||
id="rect2121"
|
||||
style="opacity:1.0000000;fill:#97ff9f;fill-opacity:0.0000000;fill-rule:evenodd;stroke:#e93a3a;stroke-width:1.0000000;stroke-miterlimit:4.0000000;stroke-dasharray:none;stroke-opacity:1.0000000" />
|
||||
<text
|
||||
id="text2123"
|
||||
y="455.7644"
|
||||
x="60.974598"
|
||||
style="font-size:12.000000px;font-style:normal;font-weight:normal;fill:#000000;fill-opacity:1.0000000;stroke:none;stroke-width:1.0000000px;stroke-linecap:butt;stroke-linejoin:miter;stroke-opacity:1.0000000;font-family:Bitstream Vera Sans"
|
||||
xml:space="preserve"><tspan
|
||||
y="455.76440"
|
||||
x="60.974598"
|
||||
id="tspan2125"
|
||||
sodipodi:role="line">d</tspan></text>
|
||||
</g>
|
||||
<g
|
||||
id="g2214"
|
||||
transform="translate(0.000000,0.287437)"
|
||||
inkscape:export-filename="/tmp/compacting.png"
|
||||
inkscape:export-xdpi="124.46000"
|
||||
inkscape:export-ydpi="124.46000">
|
||||
<text
|
||||
id="text2133"
|
||||
y="502.63025"
|
||||
x="211.58092"
|
||||
style="font-size:12.000000px;font-style:normal;font-weight:normal;fill:#000000;fill-opacity:1.0000000;stroke:none;stroke-width:1.0000000px;stroke-linecap:butt;stroke-linejoin:miter;stroke-opacity:1.0000000;font-family:Bitstream Vera Sans"
|
||||
xml:space="preserve"><tspan
|
||||
y="502.63025"
|
||||
x="211.58092"
|
||||
id="tspan2135"
|
||||
sodipodi:role="line">b</tspan></text>
|
||||
<rect
|
||||
y="481.31339"
|
||||
x="192.05070"
|
||||
height="33.686447"
|
||||
width="47.111221"
|
||||
id="rect2137"
|
||||
style="opacity:1.0000000;fill:#009f9d;fill-opacity:0.28961745;fill-rule:evenodd;stroke:#3a57e9;stroke-width:0.54104435;stroke-miterlimit:4.0000000;stroke-dasharray:none;stroke-opacity:1.0000000" />
|
||||
<rect
|
||||
y="477.00504"
|
||||
x="37.857136"
|
||||
height="42.142857"
|
||||
width="252.85715"
|
||||
id="rect2147"
|
||||
style="opacity:1.0000000;fill:#97ff9f;fill-opacity:0.0000000;fill-rule:evenodd;stroke:#e93a3a;stroke-width:1.0000000;stroke-miterlimit:4.0000000;stroke-dasharray:none;stroke-opacity:1.0000000" />
|
||||
<rect
|
||||
y="481.23325"
|
||||
x="42.158665"
|
||||
height="33.686447"
|
||||
width="47.111221"
|
||||
id="rect2145"
|
||||
style="opacity:1.0000000;fill:#009f9d;fill-opacity:0.28961745;fill-rule:evenodd;stroke:#3a57e9;stroke-width:0.54104435;stroke-miterlimit:4.0000000;stroke-dasharray:none;stroke-opacity:1.0000000" />
|
||||
<text
|
||||
id="text2149"
|
||||
y="502.55011"
|
||||
x="61.688877"
|
||||
style="font-size:12.000000px;font-style:normal;font-weight:normal;fill:#000000;fill-opacity:1.0000000;stroke:none;stroke-width:1.0000000px;stroke-linecap:butt;stroke-linejoin:miter;stroke-opacity:1.0000000;font-family:Bitstream Vera Sans"
|
||||
xml:space="preserve"><tspan
|
||||
y="502.55011"
|
||||
x="61.688877"
|
||||
id="tspan2151"
|
||||
sodipodi:role="line">d</tspan></text>
|
||||
</g>
|
||||
<rect
|
||||
style="opacity:1.0000000;fill:#97ff9f;fill-opacity:0.0000000;fill-rule:evenodd;stroke:#e93a3a;stroke-width:0.99986458;stroke-miterlimit:4.0000000;stroke-dasharray:none;stroke-opacity:1.0000000"
|
||||
id="rect2163"
|
||||
width="252.78864"
|
||||
height="42.142857"
|
||||
x="38.244465"
|
||||
y="525.57648"
|
||||
inkscape:export-filename="/tmp/compacting.png"
|
||||
inkscape:export-xdpi="124.46000"
|
||||
inkscape:export-ydpi="124.46000" />
|
||||
<text
|
||||
xml:space="preserve"
|
||||
style="font-size:12.000000px;font-style:normal;font-weight:normal;fill:#000000;fill-opacity:1.0000000;stroke:none;stroke-width:1.0000000px;stroke-linecap:butt;stroke-linejoin:miter;stroke-opacity:1.0000000;font-family:Bitstream Vera Sans"
|
||||
x="109.33745"
|
||||
y="551.20172"
|
||||
id="text2153"
|
||||
inkscape:export-filename="/tmp/compacting.png"
|
||||
inkscape:export-xdpi="124.46000"
|
||||
inkscape:export-ydpi="124.46000"><tspan
|
||||
sodipodi:role="line"
|
||||
id="tspan2155"
|
||||
x="109.33745"
|
||||
y="551.20172">b</tspan></text>
|
||||
<rect
|
||||
style="opacity:1.0000000;fill:#009f9d;fill-opacity:0.28961745;fill-rule:evenodd;stroke:#3a57e9;stroke-width:0.54104435;stroke-miterlimit:4.0000000;stroke-dasharray:none;stroke-opacity:1.0000000"
|
||||
id="rect2157"
|
||||
width="47.111221"
|
||||
height="33.686447"
|
||||
x="89.807236"
|
||||
y="529.88483"
|
||||
inkscape:export-filename="/tmp/compacting.png"
|
||||
inkscape:export-xdpi="124.46000"
|
||||
inkscape:export-ydpi="124.46000" />
|
||||
<rect
|
||||
style="opacity:1.0000000;fill:#009f9d;fill-opacity:0.28961745;fill-rule:evenodd;stroke:#3a57e9;stroke-width:0.54104435;stroke-miterlimit:4.0000000;stroke-dasharray:none;stroke-opacity:1.0000000"
|
||||
id="rect2165"
|
||||
width="47.111221"
|
||||
height="33.686447"
|
||||
x="42.515812"
|
||||
y="529.80469"
|
||||
inkscape:export-filename="/tmp/compacting.png"
|
||||
inkscape:export-xdpi="124.46000"
|
||||
inkscape:export-ydpi="124.46000" />
|
||||
<text
|
||||
xml:space="preserve"
|
||||
style="font-size:12.000000px;font-style:normal;font-weight:normal;fill:#000000;fill-opacity:1.0000000;stroke:none;stroke-width:1.0000000px;stroke-linecap:butt;stroke-linejoin:miter;stroke-opacity:1.0000000;font-family:Bitstream Vera Sans"
|
||||
x="62.046024"
|
||||
y="551.12158"
|
||||
id="text2167"
|
||||
inkscape:export-filename="/tmp/compacting.png"
|
||||
inkscape:export-xdpi="124.46000"
|
||||
inkscape:export-ydpi="124.46000"><tspan
|
||||
sodipodi:role="line"
|
||||
id="tspan2169"
|
||||
x="62.046024"
|
||||
y="551.12158">d</tspan></text>
|
||||
<rect
|
||||
style="opacity:1.0000000;fill:#bf0000;fill-opacity:0.28961745;fill-rule:evenodd;stroke:#e97500;stroke-width:0.96217525;stroke-miterlimit:4.0000000;stroke-dasharray:none;stroke-opacity:1.0000000"
|
||||
id="rect2171"
|
||||
width="150.56403"
|
||||
height="33.335033"
|
||||
x="137.73921"
|
||||
y="529.98041"
|
||||
inkscape:export-filename="/tmp/compacting.png"
|
||||
inkscape:export-xdpi="124.46000"
|
||||
inkscape:export-ydpi="124.46000" />
|
||||
<text
|
||||
xml:space="preserve"
|
||||
style="font-size:12.000000px;font-style:normal;font-weight:normal;fill:#000000;fill-opacity:1.0000000;stroke:none;stroke-width:1.0000000px;stroke-linecap:butt;stroke-linejoin:miter;stroke-opacity:1.0000000;font-family:Bitstream Vera Sans"
|
||||
x="209.3181"
|
||||
y="549.92334"
|
||||
id="text2177"
|
||||
inkscape:export-filename="/tmp/compacting.png"
|
||||
inkscape:export-xdpi="124.46000"
|
||||
inkscape:export-ydpi="124.46000"><tspan
|
||||
sodipodi:role="line"
|
||||
id="tspan2179"
|
||||
x="209.31810"
|
||||
y="549.92334">e</tspan></text>
|
||||
<text
|
||||
xml:space="preserve"
|
||||
style="font-size:12.000000px;font-style:normal;font-weight:normal;fill:#000000;fill-opacity:1.0000000;stroke:none;stroke-width:1.0000000px;stroke-linecap:butt;stroke-linejoin:miter;stroke-opacity:1.0000000;font-family:Bitstream Vera Sans"
|
||||
x="18.364119"
|
||||
y="358.15894"
|
||||
id="text2235"
|
||||
inkscape:export-filename="/tmp/compacting.png"
|
||||
inkscape:export-xdpi="124.46000"
|
||||
inkscape:export-ydpi="124.46000"><tspan
|
||||
sodipodi:role="line"
|
||||
id="tspan2237"
|
||||
x="18.364119"
|
||||
y="358.15894">3</tspan></text>
|
||||
<text
|
||||
xml:space="preserve"
|
||||
style="font-size:12.000000px;font-style:normal;font-weight:normal;fill:#000000;fill-opacity:1.0000000;stroke:none;stroke-width:1.0000000px;stroke-linecap:butt;stroke-linejoin:miter;stroke-opacity:1.0000000;font-family:Bitstream Vera Sans"
|
||||
x="18.077009"
|
||||
y="406.35583"
|
||||
id="text2239"
|
||||
inkscape:export-filename="/tmp/compacting.png"
|
||||
inkscape:export-xdpi="124.46000"
|
||||
inkscape:export-ydpi="124.46000"><tspan
|
||||
sodipodi:role="line"
|
||||
id="tspan2241"
|
||||
x="18.077009"
|
||||
y="406.35583">4</tspan></text>
|
||||
<text
|
||||
xml:space="preserve"
|
||||
style="font-size:12.000000px;font-style:normal;font-weight:normal;fill:#000000;fill-opacity:1.0000000;stroke:none;stroke-width:1.0000000px;stroke-linecap:butt;stroke-linejoin:miter;stroke-opacity:1.0000000;font-family:Bitstream Vera Sans"
|
||||
x="18.452009"
|
||||
y="454.46191"
|
||||
id="text2243"
|
||||
inkscape:export-filename="/tmp/compacting.png"
|
||||
inkscape:export-xdpi="124.46000"
|
||||
inkscape:export-ydpi="124.46000"><tspan
|
||||
sodipodi:role="line"
|
||||
id="tspan2245"
|
||||
x="18.452009"
|
||||
y="454.46191">5</tspan></text>
|
||||
<text
|
||||
xml:space="preserve"
|
||||
style="font-size:12.000000px;font-style:normal;font-weight:normal;fill:#000000;fill-opacity:1.0000000;stroke:none;stroke-width:1.0000000px;stroke-linecap:butt;stroke-linejoin:miter;stroke-opacity:1.0000000;font-family:Bitstream Vera Sans"
|
||||
x="18.15904"
|
||||
y="502.73206"
|
||||
id="text2247"
|
||||
inkscape:export-filename="/tmp/compacting.png"
|
||||
inkscape:export-xdpi="124.46000"
|
||||
inkscape:export-ydpi="124.46000"><tspan
|
||||
sodipodi:role="line"
|
||||
id="tspan2249"
|
||||
x="18.159040"
|
||||
y="502.73206">6</tspan></text>
|
||||
<text
|
||||
xml:space="preserve"
|
||||
style="font-size:12.000000px;font-style:normal;font-weight:normal;fill:#000000;fill-opacity:1.0000000;stroke:none;stroke-width:1.0000000px;stroke-linecap:butt;stroke-linejoin:miter;stroke-opacity:1.0000000;font-family:Bitstream Vera Sans"
|
||||
x="18.428572"
|
||||
y="551.02197"
|
||||
id="text2251"
|
||||
inkscape:export-xdpi="124.46000"
|
||||
inkscape:export-ydpi="124.46000"
|
||||
inkscape:export-filename="/tmp/compacting.png"><tspan
|
||||
sodipodi:role="line"
|
||||
id="tspan2253"
|
||||
x="18.428572"
|
||||
y="551.02197">7</tspan></text>
|
||||
</g>
|
||||
</svg>
|
||||
|
Before Width: | Height: | Size: 18 KiB |
@@ -1,857 +0,0 @@
|
||||
<?xml version="1.0" encoding="UTF-8" standalone="no"?>
|
||||
<!-- Created with Inkscape (http://www.inkscape.org/) -->
|
||||
<svg
|
||||
xmlns:dc="http://purl.org/dc/elements/1.1/"
|
||||
xmlns:cc="http://web.resource.org/cc/"
|
||||
xmlns:rdf="http://www.w3.org/1999/02/22-rdf-syntax-ns#"
|
||||
xmlns:svg="http://www.w3.org/2000/svg"
|
||||
xmlns="http://www.w3.org/2000/svg"
|
||||
xmlns:sodipodi="http://inkscape.sourceforge.net/DTD/sodipodi-0.dtd"
|
||||
xmlns:inkscape="http://www.inkscape.org/namespaces/inkscape"
|
||||
width="744.09448819"
|
||||
height="1052.3622047"
|
||||
id="svg2324"
|
||||
sodipodi:version="0.32"
|
||||
inkscape:version="0.42.2"
|
||||
sodipodi:docbase="/home/miguel/mono/gc"
|
||||
sodipodi:docname="gcmem.svg">
|
||||
<defs
|
||||
id="defs2326">
|
||||
<marker
|
||||
inkscape:stockid="DistanceIn"
|
||||
orient="auto"
|
||||
refY="0.0"
|
||||
refX="0.0"
|
||||
id="DistanceIn"
|
||||
style="overflow:visible">
|
||||
<g
|
||||
transform="scale(0.6,0.6) translate(8,0)"
|
||||
id="g987">
|
||||
<path
|
||||
sodipodi:nodetypes="ccccc"
|
||||
id="path974"
|
||||
d="M 0.0,0.0 L 5.0,-5.0 L -12.5,0.0 L 5.0,5.0 L 0.0,0.0 z "
|
||||
style="fill-rule:evenodd;stroke:#000000;stroke-width:1.0pt;marker-start:none" />
|
||||
<path
|
||||
id="path976"
|
||||
d="M -14.759949,-7 L -14.759949,65"
|
||||
style="fill:none;fill-opacity:0.75000000;fill-rule:evenodd;stroke:#000000;stroke-width:1.2pt;marker-start:none" />
|
||||
</g>
|
||||
</marker>
|
||||
<marker
|
||||
inkscape:stockid="Arrow1Mstart"
|
||||
orient="auto"
|
||||
refY="0.0"
|
||||
refX="0.0"
|
||||
id="Arrow1Mstart"
|
||||
style="overflow:visible">
|
||||
<path
|
||||
sodipodi:nodetypes="ccccc"
|
||||
id="path2397"
|
||||
d="M 0.0,0.0 L 5.0,-5.0 L -12.5,0.0 L 5.0,5.0 L 0.0,0.0 z "
|
||||
style="fill-rule:evenodd;stroke:#000000;stroke-width:1.0pt;marker-start:none"
|
||||
transform="scale(0.4)" />
|
||||
</marker>
|
||||
<marker
|
||||
inkscape:stockid="Dot_m"
|
||||
orient="auto"
|
||||
refY="0.0"
|
||||
refX="0.0"
|
||||
id="Dot_m"
|
||||
style="overflow:visible">
|
||||
<path
|
||||
id="path39"
|
||||
d="M -2.5,-1.0 C -2.5,1.7600000 -4.7400000,4.0 -7.5,4.0 C -10.260000,4.0 -12.5,1.7600000 -12.5,-1.0 C -12.5,-3.7600000 -10.260000,-6.0 -7.5,-6.0 C -4.7400000,-6.0 -2.5,-3.7600000 -2.5,-1.0 z "
|
||||
style="fill-rule:evenodd;stroke:#000000;stroke-width:1.0pt;marker-start:none;marker-end:none"
|
||||
transform="scale(0.4) translate(7.125493, 1)" />
|
||||
</marker>
|
||||
<marker
|
||||
inkscape:stockid="Arrow2Mend"
|
||||
orient="auto"
|
||||
refY="0.0"
|
||||
refX="0.0"
|
||||
id="Arrow2Mend"
|
||||
style="overflow:visible;">
|
||||
<path
|
||||
sodipodi:nodetypes="cccc"
|
||||
id="path2389"
|
||||
style="font-size:12.0;fill-rule:evenodd;stroke-width:0.62500000;stroke-linejoin:round;"
|
||||
d="M 8.7185878,4.0337352 L -2.2072895,0.016013256 L 8.7185884,-4.0017078 C 6.9730900,-1.6296469 6.9831476,1.6157441 8.7185878,4.0337352 z "
|
||||
transform="scale(0.6) rotate(180) translate(-5,0)" />
|
||||
</marker>
|
||||
<marker
|
||||
inkscape:stockid="Arrow2Lend"
|
||||
orient="auto"
|
||||
refY="0.0"
|
||||
refX="0.0"
|
||||
id="Arrow2Lend"
|
||||
style="overflow:visible;">
|
||||
<path
|
||||
sodipodi:nodetypes="cccc"
|
||||
id="path2392"
|
||||
style="font-size:12.0;fill-rule:evenodd;stroke-width:0.62500000;stroke-linejoin:round;"
|
||||
d="M 8.7185878,4.0337352 L -2.2072895,0.016013256 L 8.7185884,-4.0017078 C 6.9730900,-1.6296469 6.9831476,1.6157441 8.7185878,4.0337352 z "
|
||||
transform="scale(1.1) rotate(180) translate(-5,0)" />
|
||||
</marker>
|
||||
<marker
|
||||
inkscape:stockid="TriangleOutL"
|
||||
orient="auto"
|
||||
refY="0.0"
|
||||
refX="0.0"
|
||||
id="TriangleOutL"
|
||||
style="overflow:visible">
|
||||
<path
|
||||
sodipodi:nodetypes="cccc"
|
||||
id="path2462"
|
||||
d="M 5.77,0.0 L -2.88,5.0 L -2.88,-5.0 L 5.77,0.0 z "
|
||||
style="fill-rule:evenodd;stroke:#000000;stroke-width:1.0pt;marker-start:none"
|
||||
transform="scale(0.8)" />
|
||||
</marker>
|
||||
<marker
|
||||
inkscape:stockid="Arrow1Lstart"
|
||||
orient="auto"
|
||||
refY="0.0"
|
||||
refX="0.0"
|
||||
id="Arrow1Lstart"
|
||||
style="overflow:visible">
|
||||
<path
|
||||
sodipodi:nodetypes="ccccc"
|
||||
id="path2535"
|
||||
d="M 0.0,0.0 L 5.0,-5.0 L -12.5,0.0 L 5.0,5.0 L 0.0,0.0 z "
|
||||
style="fill-rule:evenodd;stroke:#000000;stroke-width:1.0pt;marker-start:none"
|
||||
transform="scale(0.8)" />
|
||||
</marker>
|
||||
</defs>
|
||||
<sodipodi:namedview
|
||||
id="base"
|
||||
pagecolor="#ffffff"
|
||||
bordercolor="#666666"
|
||||
borderopacity="1.0"
|
||||
inkscape:pageopacity="0.0"
|
||||
inkscape:pageshadow="2"
|
||||
inkscape:zoom="1.3000000"
|
||||
inkscape:cx="345.54184"
|
||||
inkscape:cy="316.03559"
|
||||
inkscape:document-units="px"
|
||||
inkscape:current-layer="layer1"
|
||||
inkscape:window-width="1388"
|
||||
inkscape:window-height="998"
|
||||
inkscape:window-x="0"
|
||||
inkscape:window-y="27" />
|
||||
<metadata
|
||||
id="metadata2329">
|
||||
<rdf:RDF>
|
||||
<cc:Work
|
||||
rdf:about="">
|
||||
<dc:format>image/svg+xml</dc:format>
|
||||
<dc:type
|
||||
rdf:resource="http://purl.org/dc/dcmitype/StillImage" />
|
||||
</cc:Work>
|
||||
</rdf:RDF>
|
||||
</metadata>
|
||||
<g
|
||||
inkscape:label="Layer 1"
|
||||
inkscape:groupmode="layer"
|
||||
id="layer1">
|
||||
<g
|
||||
id="g2356"
|
||||
transform="translate(-637.4063,306.0762)">
|
||||
<rect
|
||||
y="582.59204"
|
||||
x="312.92154"
|
||||
height="119.77635"
|
||||
width="198.44141"
|
||||
id="rect2342"
|
||||
style="opacity:1.0000000;fill:#3a3a3a;fill-opacity:0.20765026;fill-rule:evenodd;stroke:#000000;stroke-width:0.56134999;stroke-miterlimit:4.0000000;stroke-dasharray:none;stroke-opacity:1.0000000" />
|
||||
<text
|
||||
id="text2344"
|
||||
y="699.81897"
|
||||
x="523.83838"
|
||||
style="font-size:12.000000px;font-style:normal;font-weight:normal;fill:#000000;fill-opacity:1.0000000;stroke:none;stroke-width:1.0000000px;stroke-linecap:butt;stroke-linejoin:miter;stroke-opacity:1.0000000;font-family:Bitstream Vera Sans"
|
||||
xml:space="preserve"><tspan
|
||||
y="699.81897"
|
||||
x="523.83838"
|
||||
id="tspan2346"
|
||||
sodipodi:role="line">stack_start</tspan></text>
|
||||
<text
|
||||
id="text2348"
|
||||
y="593.75293"
|
||||
x="523.83838"
|
||||
style="font-size:12.000000px;font-style:normal;font-weight:normal;fill:#000000;fill-opacity:1.0000000;stroke:none;stroke-width:1.0000000px;stroke-linecap:butt;stroke-linejoin:miter;stroke-opacity:1.0000000;font-family:Bitstream Vera Sans"
|
||||
xml:space="preserve"><tspan
|
||||
y="593.75293"
|
||||
x="523.83838"
|
||||
id="tspan2350"
|
||||
sodipodi:role="line">stack_end</tspan></text>
|
||||
<text
|
||||
id="text2352"
|
||||
y="646.71393"
|
||||
x="366.79654"
|
||||
style="font-size:12.000000px;font-style:normal;font-weight:normal;fill:#000000;fill-opacity:1.0000000;stroke:none;stroke-width:1.0000000px;stroke-linecap:butt;stroke-linejoin:miter;stroke-opacity:1.0000000;font-family:Bitstream Vera Sans"
|
||||
xml:space="preserve"><tspan
|
||||
y="646.71393"
|
||||
x="366.79654"
|
||||
id="tspan2354"
|
||||
sodipodi:role="line">Thread N stack</tspan></text>
|
||||
</g>
|
||||
<rect
|
||||
style="opacity:1.0000000;fill:#3a3a3a;fill-opacity:0.20765026;fill-rule:evenodd;stroke:#000000;stroke-width:0.54655713;stroke-miterlimit:4.0000000;stroke-dasharray:none;stroke-opacity:1.0000000"
|
||||
id="rect2392"
|
||||
width="198.44141"
|
||||
height="113.54674"
|
||||
x="-348.07538"
|
||||
y="167.00903" />
|
||||
<rect
|
||||
style="opacity:1.0000000;fill:#3a3a3a;fill-opacity:0.20765026;fill-rule:evenodd;stroke:#000000;stroke-width:0.39553967;stroke-miterlimit:4.0000000;stroke-dasharray:none;stroke-opacity:1.0000000"
|
||||
id="rect2367"
|
||||
width="198.44141"
|
||||
height="59.468048"
|
||||
x="-348.22467"
|
||||
y="166.96149" />
|
||||
<text
|
||||
xml:space="preserve"
|
||||
style="font-size:12.000000px;font-style:normal;font-weight:normal;fill:#000000;fill-opacity:1.0000000;stroke:none;stroke-width:1.0000000px;stroke-linecap:butt;stroke-linejoin:miter;stroke-opacity:1.0000000;font-family:Bitstream Vera Sans"
|
||||
x="-142.24655"
|
||||
y="223.79724"
|
||||
id="text2369"><tspan
|
||||
sodipodi:role="line"
|
||||
id="tspan2371"
|
||||
x="-142.24655"
|
||||
y="223.79724">info->stack_start</tspan></text>
|
||||
<text
|
||||
xml:space="preserve"
|
||||
style="font-size:12.000000px;font-style:normal;font-weight:normal;fill:#000000;fill-opacity:1.0000000;stroke:none;stroke-width:1.0000000px;stroke-linecap:butt;stroke-linejoin:miter;stroke-opacity:1.0000000;font-family:Bitstream Vera Sans"
|
||||
x="-142.24655"
|
||||
y="179.88089"
|
||||
id="text2373"><tspan
|
||||
sodipodi:role="line"
|
||||
id="tspan2375"
|
||||
x="-142.24655"
|
||||
y="179.88089">info->stack_end</tspan></text>
|
||||
<text
|
||||
xml:space="preserve"
|
||||
style="font-size:12.000000px;font-style:normal;font-weight:normal;fill:#000000;fill-opacity:1.0000000;stroke:none;stroke-width:1.0000000px;stroke-linecap:butt;stroke-linejoin:miter;stroke-opacity:1.0000000;font-family:Bitstream Vera Sans"
|
||||
x="-294.34967"
|
||||
y="201.16916"
|
||||
id="text2388"><tspan
|
||||
sodipodi:role="line"
|
||||
id="tspan2390"
|
||||
x="-294.34967"
|
||||
y="201.16916">Thread 1 stack</tspan></text>
|
||||
<path
|
||||
style="fill:none;fill-opacity:0.75000000;fill-rule:evenodd;stroke:#000000;stroke-width:0.86822808;stroke-linecap:butt;stroke-linejoin:miter;marker-start:none;marker-end:url(#TriangleOutL);stroke-miterlimit:4.0000000;stroke-dasharray:none;stroke-opacity:1.0000000"
|
||||
d="M -249.00397,238.28619 C -249.00397,269.24665 -249.00397,269.24665 -249.00397,269.24665"
|
||||
id="path2405" />
|
||||
<text
|
||||
xml:space="preserve"
|
||||
style="font-size:12.000000px;font-style:normal;font-weight:normal;fill:#000000;fill-opacity:1.0000000;stroke:none;stroke-width:1.0000000px;stroke-linecap:butt;stroke-linejoin:miter;stroke-opacity:1.0000000;font-family:Bitstream Vera Sans"
|
||||
x="-142.24655"
|
||||
y="276.65912"
|
||||
id="text2553"><tspan
|
||||
sodipodi:role="line"
|
||||
id="tspan2555"
|
||||
x="-142.24655"
|
||||
y="276.65912">limit: stack bottom</tspan></text>
|
||||
<g
|
||||
id="g2664"
|
||||
transform="translate(-393.8247,105.6316)">
|
||||
<rect
|
||||
y="175.09026"
|
||||
x="45.884109"
|
||||
height="113.54674"
|
||||
width="198.44141"
|
||||
id="rect2666"
|
||||
style="opacity:1.0000000;fill:#3a3a3a;fill-opacity:0.20765026;fill-rule:evenodd;stroke:#000000;stroke-width:0.54655713;stroke-miterlimit:4.0000000;stroke-dasharray:none;stroke-opacity:1.0000000" />
|
||||
<rect
|
||||
y="175.04271"
|
||||
x="45.734818"
|
||||
height="59.468048"
|
||||
width="198.44141"
|
||||
id="rect2668"
|
||||
style="opacity:1.0000000;fill:#3a3a3a;fill-opacity:0.20765026;fill-rule:evenodd;stroke:#000000;stroke-width:0.39553967;stroke-miterlimit:4.0000000;stroke-dasharray:none;stroke-opacity:1.0000000" />
|
||||
<text
|
||||
id="text2670"
|
||||
y="231.87846"
|
||||
x="251.71294"
|
||||
style="font-size:12.000000px;font-style:normal;font-weight:normal;fill:#000000;fill-opacity:1.0000000;stroke:none;stroke-width:1.0000000px;stroke-linecap:butt;stroke-linejoin:miter;stroke-opacity:1.0000000;font-family:Bitstream Vera Sans"
|
||||
xml:space="preserve"><tspan
|
||||
y="231.87846"
|
||||
x="251.71294"
|
||||
id="tspan2672"
|
||||
sodipodi:role="line">info->stack_start</tspan></text>
|
||||
<text
|
||||
id="text2674"
|
||||
y="187.96211"
|
||||
x="251.71294"
|
||||
style="font-size:12.000000px;font-style:normal;font-weight:normal;fill:#000000;fill-opacity:1.0000000;stroke:none;stroke-width:1.0000000px;stroke-linecap:butt;stroke-linejoin:miter;stroke-opacity:1.0000000;font-family:Bitstream Vera Sans"
|
||||
xml:space="preserve"><tspan
|
||||
y="187.96211"
|
||||
x="251.71294"
|
||||
id="tspan2676"
|
||||
sodipodi:role="line">info->stack_end</tspan></text>
|
||||
<text
|
||||
id="text2678"
|
||||
y="209.25038"
|
||||
x="99.609818"
|
||||
style="font-size:12.000000px;font-style:normal;font-weight:normal;fill:#000000;fill-opacity:1.0000000;stroke:none;stroke-width:1.0000000px;stroke-linecap:butt;stroke-linejoin:miter;stroke-opacity:1.0000000;font-family:Bitstream Vera Sans"
|
||||
xml:space="preserve"><tspan
|
||||
y="209.25038"
|
||||
x="99.609818"
|
||||
id="tspan2680"
|
||||
sodipodi:role="line">Thread 2 stack</tspan></text>
|
||||
<path
|
||||
id="path2682"
|
||||
d="M 144.95552,246.36741 C 144.95552,277.32787 144.95552,277.32787 144.95552,277.32787"
|
||||
style="fill:none;fill-opacity:0.75000000;fill-rule:evenodd;stroke:#000000;stroke-width:0.86822808;stroke-linecap:butt;stroke-linejoin:miter;marker-start:none;marker-end:url(#TriangleOutL);stroke-miterlimit:4.0000000;stroke-dasharray:none;stroke-opacity:1.0000000" />
|
||||
<text
|
||||
id="text2684"
|
||||
y="284.74033"
|
||||
x="251.71294"
|
||||
style="font-size:12.000000px;font-style:normal;font-weight:normal;fill:#000000;fill-opacity:1.0000000;stroke:none;stroke-width:1.0000000px;stroke-linecap:butt;stroke-linejoin:miter;stroke-opacity:1.0000000;font-family:Bitstream Vera Sans"
|
||||
xml:space="preserve"><tspan
|
||||
y="284.74033"
|
||||
x="251.71294"
|
||||
id="tspan2686"
|
||||
sodipodi:role="line">limit: stack bottom</tspan></text>
|
||||
</g>
|
||||
<rect
|
||||
style="opacity:1.0000000;fill:#000000;fill-opacity:0.098360606;fill-rule:evenodd;stroke:#000000;stroke-width:0.57452667;stroke-miterlimit:4.0000000;stroke-dasharray:none;stroke-opacity:1.0000000"
|
||||
id="rect2699"
|
||||
width="198.44141"
|
||||
height="125.46541"
|
||||
x="-347.82306"
|
||||
y="449.85883" />
|
||||
<text
|
||||
xml:space="preserve"
|
||||
style="font-size:12.000000px;font-style:normal;font-weight:normal;fill:#000000;fill-opacity:1.0000000;stroke:none;stroke-width:1.0000000px;stroke-linecap:butt;stroke-linejoin:miter;stroke-opacity:1.0000000;font-family:Bitstream Vera Sans"
|
||||
x="-312.09747"
|
||||
y="515.71747"
|
||||
id="text2701"><tspan
|
||||
sodipodi:role="line"
|
||||
id="tspan2703"
|
||||
x="-312.09747"
|
||||
y="515.71747">Program, Data, Heap</tspan></text>
|
||||
<rect
|
||||
style="opacity:1.0000000;fill:#97ff9f;fill-opacity:0.0000000;fill-rule:evenodd;stroke:#000000;stroke-width:1.2500000;stroke-miterlimit:4.0000000;stroke-dasharray:none;stroke-opacity:1.0000000"
|
||||
id="rect1477"
|
||||
width="496.99463"
|
||||
height="95.744583"
|
||||
x="24.575632"
|
||||
y="255.69751"
|
||||
inkscape:export-filename="/tmp/gcmemsection.png"
|
||||
inkscape:export-xdpi="90.000000"
|
||||
inkscape:export-ydpi="90.000000" />
|
||||
<rect
|
||||
style="fill:#000000;fill-opacity:0.21311475;fill-rule:evenodd;stroke:none;stroke-width:1.2500000;stroke-miterlimit:4.0000000;stroke-dasharray:none;stroke-opacity:1.0000000"
|
||||
id="rect2462"
|
||||
width="369.79077"
|
||||
height="95.629486"
|
||||
x="24.974619"
|
||||
y="255.80048"
|
||||
inkscape:export-filename="/tmp/gcmemsection.png"
|
||||
inkscape:export-xdpi="90.000000"
|
||||
inkscape:export-ydpi="90.000000" />
|
||||
<g
|
||||
id="g2549"
|
||||
inkscape:export-filename="/tmp/gcmemsection.png"
|
||||
inkscape:export-xdpi="90.000000"
|
||||
inkscape:export-ydpi="90.000000">
|
||||
<rect
|
||||
y="435.98193"
|
||||
x="27.815228"
|
||||
height="104.85226"
|
||||
width="188.03888"
|
||||
id="rect2332"
|
||||
style="opacity:1.0000000;fill:#97ff9f;fill-opacity:0.0000000;fill-rule:evenodd;stroke:#000000;stroke-width:1.2500000;stroke-miterlimit:4.0000000;stroke-dasharray:none;stroke-opacity:1.0000000" />
|
||||
<text
|
||||
id="text2234"
|
||||
y="457.2435"
|
||||
x="78.252907"
|
||||
style="font-size:12.000000px;font-style:normal;font-weight:normal;fill:#000000;fill-opacity:1.0000000;stroke:none;stroke-width:1.0000000px;stroke-linecap:butt;stroke-linejoin:miter;stroke-opacity:1.0000000;font-family:Bitstream Vera Sans"
|
||||
xml:space="preserve"><tspan
|
||||
y="457.24350"
|
||||
x="78.252907"
|
||||
id="tspan2236"
|
||||
sodipodi:role="line">next_data</tspan></text>
|
||||
<path
|
||||
id="path2223"
|
||||
d="M 27.563951,470.57645 L 215.86873,470.57645 L 215.25735,470.57645"
|
||||
style="fill:none;fill-opacity:0.75000000;fill-rule:evenodd;stroke:#000000;stroke-width:1.2500000;stroke-linecap:butt;stroke-linejoin:miter;stroke-miterlimit:4.0000000;stroke-dasharray:none;stroke-opacity:1.0000000" />
|
||||
<path
|
||||
id="path2228"
|
||||
d="M 71.898961,435.92093 L 71.891321,470.94626 L 71.891321,470.94626"
|
||||
style="fill:none;fill-opacity:0.75000000;fill-rule:evenodd;stroke:#000000;stroke-width:1.2500000;stroke-linecap:butt;stroke-linejoin:miter;stroke-miterlimit:4.0000000;stroke-dasharray:none;stroke-opacity:1.0000000" />
|
||||
<text
|
||||
id="text2230"
|
||||
y="457.2435"
|
||||
x="37.966347"
|
||||
style="font-size:12.000000px;font-style:normal;font-weight:normal;fill:#000000;fill-opacity:1.0000000;stroke:none;stroke-width:1.0000000px;stroke-linecap:butt;stroke-linejoin:miter;stroke-opacity:1.0000000;font-family:Bitstream Vera Sans"
|
||||
xml:space="preserve"><tspan
|
||||
y="457.24350"
|
||||
x="37.966347"
|
||||
id="tspan2232"
|
||||
sodipodi:role="line">data</tspan></text>
|
||||
<text
|
||||
id="text2238"
|
||||
y="457.2435"
|
||||
x="151.77969"
|
||||
style="font-size:12.000000px;font-style:normal;font-weight:normal;fill:#000000;fill-opacity:1.0000000;stroke:none;stroke-width:1.0000000px;stroke-linecap:butt;stroke-linejoin:miter;stroke-opacity:1.0000000;font-family:Bitstream Vera Sans"
|
||||
xml:space="preserve"><tspan
|
||||
y="457.24350"
|
||||
x="151.77969"
|
||||
id="tspan2240"
|
||||
sodipodi:role="line">end_data</tspan></text>
|
||||
<path
|
||||
id="path2244"
|
||||
d="M 146.54159,435.92094 L 146.53395,470.94627 L 146.53395,470.94627"
|
||||
style="fill:none;fill-opacity:0.75000000;fill-rule:evenodd;stroke:#000000;stroke-width:1.2500000;stroke-linecap:butt;stroke-linejoin:miter;stroke-miterlimit:4.0000000;stroke-dasharray:none;stroke-opacity:1.0000000" />
|
||||
<text
|
||||
id="text2246"
|
||||
y="530.07721"
|
||||
x="180.5428"
|
||||
style="font-size:12.000000px;font-style:normal;font-weight:normal;fill:#000000;fill-opacity:1.0000000;stroke:none;stroke-width:1.0000000px;stroke-linecap:butt;stroke-linejoin:miter;stroke-opacity:1.0000000;font-family:Bitstream Vera Sans"
|
||||
xml:space="preserve"><tspan
|
||||
y="530.07721"
|
||||
x="180.54280"
|
||||
id="tspan2248"
|
||||
sodipodi:role="line">next</tspan></text>
|
||||
<text
|
||||
id="text2250"
|
||||
y="492.30292"
|
||||
x="140.99677"
|
||||
style="font-size:12.000000px;font-style:normal;font-weight:normal;fill:#000000;fill-opacity:1.0000000;stroke:none;stroke-width:1.0000000px;stroke-linecap:butt;stroke-linejoin:miter;stroke-opacity:1.0000000;font-family:Bitstream Vera Sans"
|
||||
xml:space="preserve"><tspan
|
||||
y="492.30292"
|
||||
x="140.99677"
|
||||
id="tspan2252"
|
||||
sodipodi:role="line">scan_starts</tspan></text>
|
||||
<path
|
||||
id="path2254"
|
||||
d="M 27.385382,505.50503 L 215.69016,505.50503 L 215.07878,505.50503"
|
||||
style="fill:none;fill-opacity:0.75000000;fill-rule:evenodd;stroke:#000000;stroke-width:1.2500000;stroke-linecap:butt;stroke-linejoin:miter;stroke-miterlimit:4.0000000;stroke-dasharray:none;stroke-opacity:1.0000000" />
|
||||
</g>
|
||||
<path
|
||||
style="fill:none;fill-opacity:0.75000000;fill-rule:evenodd;stroke:#000000;stroke-width:1.3321546px;stroke-linecap:butt;stroke-linejoin:miter;marker-mid:none;marker-end:url(#Arrow2Mend);stroke-opacity:1.0000000"
|
||||
d="M 49.940663,435.64439 C 39.609840,395.19706 25.024252,408.49467 24.510938,358.73205"
|
||||
id="path2420"
|
||||
sodipodi:nodetypes="cs"
|
||||
inkscape:export-filename="/tmp/gcmemsection.png"
|
||||
inkscape:export-xdpi="90.000000"
|
||||
inkscape:export-ydpi="90.000000" />
|
||||
<path
|
||||
style="fill:none;fill-opacity:0.75000000;fill-rule:evenodd;stroke:#000000;stroke-width:1.2130281px;stroke-linecap:butt;stroke-linejoin:miter;marker-mid:none;marker-end:url(#Arrow2Mend);stroke-opacity:1.0000000"
|
||||
d="M 110.07637,435.66483 C 100.30146,356.87037 395.42132,407.99704 394.99782,357.98613"
|
||||
id="path2424"
|
||||
sodipodi:nodetypes="cs"
|
||||
inkscape:export-filename="/tmp/gcmemsection.png"
|
||||
inkscape:export-xdpi="90.000000"
|
||||
inkscape:export-ydpi="90.000000" />
|
||||
<path
|
||||
style="fill:none;fill-opacity:0.75000000;fill-rule:evenodd;stroke:#000000;stroke-width:1.2048768px;stroke-linecap:butt;stroke-linejoin:miter;marker-mid:none;marker-end:url(#Arrow2Mend);stroke-opacity:1.0000000"
|
||||
d="M 178.51727,436.05781 C 177.24799,362.68132 519.42718,442.70358 521.51612,359.00377"
|
||||
id="path2426"
|
||||
sodipodi:nodetypes="cs"
|
||||
inkscape:export-filename="/tmp/gcmemsection.png"
|
||||
inkscape:export-xdpi="90.000000"
|
||||
inkscape:export-ydpi="90.000000" />
|
||||
<path
|
||||
style="fill:none;fill-opacity:0.75000000;fill-rule:evenodd;stroke:#000000;stroke-width:1.2617185;stroke-linecap:butt;stroke-linejoin:miter;stroke-miterlimit:4.0000000;stroke-dasharray:none;stroke-opacity:1.0000000"
|
||||
d="M 395.11375,255.80101 L 395.10611,351.10915 L 395.10611,351.10915"
|
||||
id="path2443"
|
||||
inkscape:export-filename="/tmp/gcmemsection.png"
|
||||
inkscape:export-xdpi="90.000000"
|
||||
inkscape:export-ydpi="90.000000" />
|
||||
<rect
|
||||
style="fill:#000000;fill-opacity:0.0000000;fill-rule:evenodd;stroke:#000000;stroke-width:1.2500000;stroke-miterlimit:4.0000000;stroke-dasharray:none;stroke-opacity:1.0000000"
|
||||
id="rect2466"
|
||||
width="22.752682"
|
||||
height="24.214773"
|
||||
x="305.75558"
|
||||
y="473.20383"
|
||||
inkscape:export-filename="/tmp/gcmemsection.png"
|
||||
inkscape:export-xdpi="90.000000"
|
||||
inkscape:export-ydpi="90.000000" />
|
||||
<rect
|
||||
style="fill:#000000;fill-opacity:0.0000000;fill-rule:evenodd;stroke:#000000;stroke-width:1.2500000;stroke-miterlimit:4.0000000;stroke-dasharray:none;stroke-opacity:1.0000000"
|
||||
id="rect2468"
|
||||
width="22.752682"
|
||||
height="24.214773"
|
||||
x="331.87048"
|
||||
y="473.20383"
|
||||
inkscape:export-filename="/tmp/gcmemsection.png"
|
||||
inkscape:export-xdpi="90.000000"
|
||||
inkscape:export-ydpi="90.000000" />
|
||||
<rect
|
||||
style="fill:#000000;fill-opacity:0.0000000;fill-rule:evenodd;stroke:#000000;stroke-width:1.2500000;stroke-miterlimit:4.0000000;stroke-dasharray:none;stroke-opacity:1.0000000"
|
||||
id="rect2472"
|
||||
width="22.752682"
|
||||
height="24.214773"
|
||||
x="357.98535"
|
||||
y="473.20383"
|
||||
inkscape:export-filename="/tmp/gcmemsection.png"
|
||||
inkscape:export-xdpi="90.000000"
|
||||
inkscape:export-ydpi="90.000000" />
|
||||
<rect
|
||||
style="fill:#000000;fill-opacity:0.0000000;fill-rule:evenodd;stroke:#000000;stroke-width:1.2500000;stroke-miterlimit:4.0000000;stroke-dasharray:none;stroke-opacity:1.0000000"
|
||||
id="rect2474"
|
||||
width="22.752682"
|
||||
height="24.214773"
|
||||
x="416.10025"
|
||||
y="473.20383"
|
||||
inkscape:export-filename="/tmp/gcmemsection.png"
|
||||
inkscape:export-xdpi="90.000000"
|
||||
inkscape:export-ydpi="90.000000" />
|
||||
<path
|
||||
style="fill:none;fill-opacity:0.75000000;fill-rule:evenodd;stroke:#000000;stroke-width:1.0000000;stroke-linecap:butt;stroke-linejoin:miter;marker-end:url(#Arrow2Mend);stroke-opacity:1.0000000;stroke-miterlimit:4.0000000;stroke-dasharray:none"
|
||||
d="M 215.70091,485.66660 C 295.43628,485.16153 295.43628,485.16153 295.43628,485.16153"
|
||||
id="path2478"
|
||||
inkscape:export-filename="/tmp/gcmemsection.png"
|
||||
inkscape:export-xdpi="90.000000"
|
||||
inkscape:export-ydpi="90.000000" />
|
||||
<text
|
||||
xml:space="preserve"
|
||||
style="font-size:12.000000px;font-style:normal;font-weight:normal;fill:#000000;fill-opacity:1.0000000;stroke:none;stroke-width:1.0000000px;stroke-linecap:butt;stroke-linejoin:miter;stroke-opacity:1.0000000;font-family:Bitstream Vera Sans"
|
||||
x="392.02042"
|
||||
y="492.73767"
|
||||
id="text2484"
|
||||
inkscape:export-filename="/tmp/gcmemsection.png"
|
||||
inkscape:export-xdpi="90.000000"
|
||||
inkscape:export-ydpi="90.000000"><tspan
|
||||
sodipodi:role="line"
|
||||
id="tspan2486"
|
||||
x="392.02042"
|
||||
y="492.73767">...</tspan></text>
|
||||
<text
|
||||
xml:space="preserve"
|
||||
style="font-size:12.000000px;font-style:normal;font-weight:normal;fill:#000000;fill-opacity:1.0000000;stroke:none;stroke-width:1.0000000px;stroke-linecap:butt;stroke-linejoin:miter;stroke-opacity:1.0000000;font-family:Bitstream Vera Sans"
|
||||
x="384.86813"
|
||||
y="529.10315"
|
||||
id="text2488"
|
||||
inkscape:export-filename="/tmp/gcmemsection.png"
|
||||
inkscape:export-xdpi="90.000000"
|
||||
inkscape:export-ydpi="90.000000"><tspan
|
||||
sodipodi:role="line"
|
||||
id="tspan2490"
|
||||
x="384.86813"
|
||||
y="529.10315">num_scan_starts</tspan></text>
|
||||
<path
|
||||
style="fill:none;fill-opacity:0.75000000;fill-rule:evenodd;stroke:#000000;stroke-width:1.2500000;stroke-linecap:butt;stroke-linejoin:miter;marker-mid:none;marker-end:url(#Arrow2Mend);stroke-opacity:1.0000000;stroke-miterlimit:4.0000000;stroke-dasharray:none"
|
||||
d="M 215.38958,526.54626 C 280.82585,525.11455 240.57890,595.19583 307.86943,597.31997"
|
||||
id="path2492"
|
||||
sodipodi:nodetypes="cs"
|
||||
inkscape:export-filename="/tmp/gcmemsection.png"
|
||||
inkscape:export-xdpi="90.000000"
|
||||
inkscape:export-ydpi="90.000000" />
|
||||
<g
|
||||
id="g2494"
|
||||
inkscape:export-filename="/tmp/gcmemsection.png"
|
||||
inkscape:export-xdpi="90.000000"
|
||||
inkscape:export-ydpi="90.000000"
|
||||
transform="matrix(0.495700,0.000000,0.000000,0.495700,304.0104,357.2198)">
|
||||
<rect
|
||||
y="435.98193"
|
||||
x="27.815228"
|
||||
height="104.85226"
|
||||
width="188.03888"
|
||||
id="rect2496"
|
||||
style="opacity:1.0000000;fill:#97ff9f;fill-opacity:0.0000000;fill-rule:evenodd;stroke:#000000;stroke-width:1.2500000;stroke-miterlimit:4.0000000;stroke-dasharray:none;stroke-opacity:1.0000000" />
|
||||
<text
|
||||
id="text2498"
|
||||
y="457.2435"
|
||||
x="78.252907"
|
||||
style="font-size:12.000000px;font-style:normal;font-weight:normal;fill:#000000;fill-opacity:1.0000000;stroke:none;stroke-width:1.0000000px;stroke-linecap:butt;stroke-linejoin:miter;stroke-opacity:1.0000000;font-family:Bitstream Vera Sans"
|
||||
xml:space="preserve"><tspan
|
||||
y="457.24350"
|
||||
x="78.252907"
|
||||
id="tspan2500"
|
||||
sodipodi:role="line">next_data</tspan></text>
|
||||
<path
|
||||
id="path2502"
|
||||
d="M 27.563951,470.57645 L 215.86873,470.57645 L 215.25735,470.57645"
|
||||
style="fill:none;fill-opacity:0.75000000;fill-rule:evenodd;stroke:#000000;stroke-width:1.2500000;stroke-linecap:butt;stroke-linejoin:miter;stroke-miterlimit:4.0000000;stroke-dasharray:none;stroke-opacity:1.0000000" />
|
||||
<path
|
||||
id="path2504"
|
||||
d="M 71.898961,435.92093 L 71.891321,470.94626 L 71.891321,470.94626"
|
||||
style="fill:none;fill-opacity:0.75000000;fill-rule:evenodd;stroke:#000000;stroke-width:1.2500000;stroke-linecap:butt;stroke-linejoin:miter;stroke-miterlimit:4.0000000;stroke-dasharray:none;stroke-opacity:1.0000000" />
|
||||
<text
|
||||
id="text2506"
|
||||
y="457.2435"
|
||||
x="37.966347"
|
||||
style="font-size:12.000000px;font-style:normal;font-weight:normal;fill:#000000;fill-opacity:1.0000000;stroke:none;stroke-width:1.0000000px;stroke-linecap:butt;stroke-linejoin:miter;stroke-opacity:1.0000000;font-family:Bitstream Vera Sans"
|
||||
xml:space="preserve"><tspan
|
||||
y="457.24350"
|
||||
x="37.966347"
|
||||
id="tspan2508"
|
||||
sodipodi:role="line">data</tspan></text>
|
||||
<text
|
||||
id="text2510"
|
||||
y="457.2435"
|
||||
x="151.77969"
|
||||
style="font-size:12.000000px;font-style:normal;font-weight:normal;fill:#000000;fill-opacity:1.0000000;stroke:none;stroke-width:1.0000000px;stroke-linecap:butt;stroke-linejoin:miter;stroke-opacity:1.0000000;font-family:Bitstream Vera Sans"
|
||||
xml:space="preserve"><tspan
|
||||
y="457.24350"
|
||||
x="151.77969"
|
||||
id="tspan2512"
|
||||
sodipodi:role="line">end_data</tspan></text>
|
||||
<path
|
||||
id="path2514"
|
||||
d="M 146.54159,435.92094 L 146.53395,470.94627 L 146.53395,470.94627"
|
||||
style="fill:none;fill-opacity:0.75000000;fill-rule:evenodd;stroke:#000000;stroke-width:1.2500000;stroke-linecap:butt;stroke-linejoin:miter;stroke-miterlimit:4.0000000;stroke-dasharray:none;stroke-opacity:1.0000000" />
|
||||
<text
|
||||
id="text2516"
|
||||
y="530.07721"
|
||||
x="180.5428"
|
||||
style="font-size:12.000000px;font-style:normal;font-weight:normal;fill:#000000;fill-opacity:1.0000000;stroke:none;stroke-width:1.0000000px;stroke-linecap:butt;stroke-linejoin:miter;stroke-opacity:1.0000000;font-family:Bitstream Vera Sans"
|
||||
xml:space="preserve"><tspan
|
||||
y="530.07721"
|
||||
x="180.54280"
|
||||
id="tspan2518"
|
||||
sodipodi:role="line">next</tspan></text>
|
||||
<text
|
||||
id="text2520"
|
||||
y="492.30292"
|
||||
x="140.99677"
|
||||
style="font-size:12.000000px;font-style:normal;font-weight:normal;fill:#000000;fill-opacity:1.0000000;stroke:none;stroke-width:1.0000000px;stroke-linecap:butt;stroke-linejoin:miter;stroke-opacity:1.0000000;font-family:Bitstream Vera Sans"
|
||||
xml:space="preserve"><tspan
|
||||
y="492.30292"
|
||||
x="140.99677"
|
||||
id="tspan2522"
|
||||
sodipodi:role="line">scan_starts</tspan></text>
|
||||
<path
|
||||
id="path2524"
|
||||
d="M 27.385382,505.50503 L 215.69016,505.50503 L 215.07878,505.50503"
|
||||
style="fill:none;fill-opacity:0.75000000;fill-rule:evenodd;stroke:#000000;stroke-width:1.2500000;stroke-linecap:butt;stroke-linejoin:miter;stroke-miterlimit:4.0000000;stroke-dasharray:none;stroke-opacity:1.0000000" />
|
||||
</g>
|
||||
<text
|
||||
xml:space="preserve"
|
||||
style="font-size:12.000000px;font-style:normal;font-weight:normal;fill:#000000;fill-opacity:1.0000000;stroke:none;stroke-width:1.0000000px;stroke-linecap:butt;stroke-linejoin:miter;stroke-opacity:1.0000000;font-family:Bitstream Vera Sans"
|
||||
x="261.43036"
|
||||
y="234.91617"
|
||||
id="text2528"
|
||||
inkscape:export-filename="/tmp/gcmemsection.png"
|
||||
inkscape:export-xdpi="90.000000"
|
||||
inkscape:export-ydpi="90.000000"><tspan
|
||||
sodipodi:role="line"
|
||||
id="tspan2530"
|
||||
x="261.43036"
|
||||
y="234.91617">size</tspan></text>
|
||||
<path
|
||||
style="fill:none;fill-opacity:0.75000000;fill-rule:evenodd;stroke:#000000;stroke-width:1.3180897;stroke-linecap:butt;stroke-linejoin:miter;marker-start:url(#Arrow1Mstart);stroke-miterlimit:4.0000000;stroke-dasharray:none;stroke-opacity:1.0000000"
|
||||
d="M 32.740631,230.44254 L 242.11872,230.44254 L 241.43892,230.44254"
|
||||
id="path2547"
|
||||
inkscape:export-filename="/tmp/gcmemsection.png"
|
||||
inkscape:export-xdpi="90.000000"
|
||||
inkscape:export-ydpi="90.000000" />
|
||||
<path
|
||||
style="fill:none;fill-opacity:0.75000000;fill-rule:evenodd;stroke:#000000;stroke-width:1.3275317;stroke-linecap:butt;stroke-linejoin:miter;marker-start:url(#Arrow1Mstart);stroke-miterlimit:4.0000000;stroke-dasharray:none;stroke-opacity:1.0000000"
|
||||
d="M 515.53150,230.44254 L 303.14294,230.44254 L 303.83251,230.44254"
|
||||
id="path2570"
|
||||
inkscape:export-filename="/tmp/gcmemsection.png"
|
||||
inkscape:export-xdpi="90.000000"
|
||||
inkscape:export-ydpi="90.000000" />
|
||||
<rect
|
||||
style="opacity:1.0000000;fill:#97ff9f;fill-opacity:0.0000000;fill-rule:evenodd;stroke:#000000;stroke-width:1.2500000;stroke-miterlimit:4.0000000;stroke-dasharray:none;stroke-opacity:1.0000000"
|
||||
id="rect2582"
|
||||
width="496.99463"
|
||||
height="95.744583"
|
||||
x="96.555573"
|
||||
y="672.34967"
|
||||
inkscape:export-filename="/tmp/gcmemsection.png"
|
||||
inkscape:export-xdpi="90.000000"
|
||||
inkscape:export-ydpi="90.000000" />
|
||||
<rect
|
||||
style="fill:#000000;fill-opacity:0.21311475;fill-rule:evenodd;stroke:none;stroke-width:1.2500000;stroke-miterlimit:4.0000000;stroke-dasharray:none;stroke-opacity:1.0000000"
|
||||
id="rect2584"
|
||||
width="369.79077"
|
||||
height="95.629486"
|
||||
x="96.954559"
|
||||
y="672.45264"
|
||||
inkscape:export-filename="/tmp/gcmemsection.png"
|
||||
inkscape:export-xdpi="90.000000"
|
||||
inkscape:export-ydpi="90.000000" />
|
||||
<g
|
||||
id="g2586"
|
||||
inkscape:export-filename="/tmp/gcmemsection.png"
|
||||
inkscape:export-xdpi="90.000000"
|
||||
inkscape:export-ydpi="90.000000"
|
||||
transform="translate(77.11341,416.8409)">
|
||||
<rect
|
||||
y="435.98193"
|
||||
x="27.815228"
|
||||
height="104.85226"
|
||||
width="188.03888"
|
||||
id="rect2588"
|
||||
style="opacity:1.0000000;fill:#97ff9f;fill-opacity:0.0000000;fill-rule:evenodd;stroke:#000000;stroke-width:1.2500000;stroke-miterlimit:4.0000000;stroke-dasharray:none;stroke-opacity:1.0000000" />
|
||||
<text
|
||||
id="text2590"
|
||||
y="457.2435"
|
||||
x="78.252907"
|
||||
style="font-size:12.000000px;font-style:normal;font-weight:normal;fill:#000000;fill-opacity:1.0000000;stroke:none;stroke-width:1.0000000px;stroke-linecap:butt;stroke-linejoin:miter;stroke-opacity:1.0000000;font-family:Bitstream Vera Sans"
|
||||
xml:space="preserve"><tspan
|
||||
y="457.24350"
|
||||
x="78.252907"
|
||||
id="tspan2592"
|
||||
sodipodi:role="line">next_data</tspan></text>
|
||||
<path
|
||||
id="path2594"
|
||||
d="M 27.563951,470.57645 L 215.86873,470.57645 L 215.25735,470.57645"
|
||||
style="fill:none;fill-opacity:0.75000000;fill-rule:evenodd;stroke:#000000;stroke-width:1.2500000;stroke-linecap:butt;stroke-linejoin:miter;stroke-miterlimit:4.0000000;stroke-dasharray:none;stroke-opacity:1.0000000" />
|
||||
<path
|
||||
id="path2596"
|
||||
d="M 71.898961,435.92093 L 71.891321,470.94626 L 71.891321,470.94626"
|
||||
style="fill:none;fill-opacity:0.75000000;fill-rule:evenodd;stroke:#000000;stroke-width:1.2500000;stroke-linecap:butt;stroke-linejoin:miter;stroke-miterlimit:4.0000000;stroke-dasharray:none;stroke-opacity:1.0000000" />
|
||||
<text
|
||||
id="text2598"
|
||||
y="457.2435"
|
||||
x="37.966347"
|
||||
style="font-size:12.000000px;font-style:normal;font-weight:normal;fill:#000000;fill-opacity:1.0000000;stroke:none;stroke-width:1.0000000px;stroke-linecap:butt;stroke-linejoin:miter;stroke-opacity:1.0000000;font-family:Bitstream Vera Sans"
|
||||
xml:space="preserve"><tspan
|
||||
y="457.24350"
|
||||
x="37.966347"
|
||||
id="tspan2600"
|
||||
sodipodi:role="line">data</tspan></text>
|
||||
<text
|
||||
id="text2602"
|
||||
y="457.2435"
|
||||
x="151.77969"
|
||||
style="font-size:12.000000px;font-style:normal;font-weight:normal;fill:#000000;fill-opacity:1.0000000;stroke:none;stroke-width:1.0000000px;stroke-linecap:butt;stroke-linejoin:miter;stroke-opacity:1.0000000;font-family:Bitstream Vera Sans"
|
||||
xml:space="preserve"><tspan
|
||||
y="457.24350"
|
||||
x="151.77969"
|
||||
id="tspan2604"
|
||||
sodipodi:role="line">end_data</tspan></text>
|
||||
<path
|
||||
id="path2606"
|
||||
d="M 146.54159,435.92094 L 146.53395,470.94627 L 146.53395,470.94627"
|
||||
style="fill:none;fill-opacity:0.75000000;fill-rule:evenodd;stroke:#000000;stroke-width:1.2500000;stroke-linecap:butt;stroke-linejoin:miter;stroke-miterlimit:4.0000000;stroke-dasharray:none;stroke-opacity:1.0000000" />
|
||||
<text
|
||||
id="text2608"
|
||||
y="530.07721"
|
||||
x="180.5428"
|
||||
style="font-size:12.000000px;font-style:normal;font-weight:normal;fill:#000000;fill-opacity:1.0000000;stroke:none;stroke-width:1.0000000px;stroke-linecap:butt;stroke-linejoin:miter;stroke-opacity:1.0000000;font-family:Bitstream Vera Sans"
|
||||
xml:space="preserve"><tspan
|
||||
y="530.07721"
|
||||
x="180.54280"
|
||||
id="tspan2610"
|
||||
sodipodi:role="line">next</tspan></text>
|
||||
<text
|
||||
id="text2612"
|
||||
y="492.30292"
|
||||
x="140.99677"
|
||||
style="font-size:12.000000px;font-style:normal;font-weight:normal;fill:#000000;fill-opacity:1.0000000;stroke:none;stroke-width:1.0000000px;stroke-linecap:butt;stroke-linejoin:miter;stroke-opacity:1.0000000;font-family:Bitstream Vera Sans"
|
||||
xml:space="preserve"><tspan
|
||||
y="492.30292"
|
||||
x="140.99677"
|
||||
id="tspan2614"
|
||||
sodipodi:role="line">scan_starts</tspan></text>
|
||||
<path
|
||||
id="path2616"
|
||||
d="M 27.385382,505.50503 L 215.69016,505.50503 L 215.07878,505.50503"
|
||||
style="fill:none;fill-opacity:0.75000000;fill-rule:evenodd;stroke:#000000;stroke-width:1.2500000;stroke-linecap:butt;stroke-linejoin:miter;stroke-miterlimit:4.0000000;stroke-dasharray:none;stroke-opacity:1.0000000" />
|
||||
</g>
|
||||
<path
|
||||
style="fill:none;fill-opacity:0.75000000;fill-rule:evenodd;stroke:#000000;stroke-width:1.2500000;stroke-linecap:round;stroke-linejoin:miter;marker-mid:none;marker-end:url(#Arrow2Mend);stroke-opacity:1.0000000;stroke-miterlimit:4.0000000;stroke-dasharray:none"
|
||||
d="M 390.69768,889.68866 C 331.80602,804.65889 96.803459,874.95173 98.410499,775.69915"
|
||||
id="path2618"
|
||||
sodipodi:nodetypes="cs"
|
||||
inkscape:export-filename="/tmp/gcmemsection.png"
|
||||
inkscape:export-xdpi="90.000000"
|
||||
inkscape:export-ydpi="90.000000" />
|
||||
<path
|
||||
style="fill:none;fill-opacity:0.75000000;fill-rule:evenodd;stroke:#000000;stroke-width:1.2500000;stroke-linecap:round;stroke-linejoin:round;marker-mid:none;marker-end:url(#Arrow2Mend);stroke-opacity:1.0000000;stroke-miterlimit:4.0000000;stroke-dasharray:none"
|
||||
d="M 415.68564,889.74159 C 415.11366,821.91550 190.04004,833.26343 189.29125,775.92074"
|
||||
id="path2620"
|
||||
sodipodi:nodetypes="cs"
|
||||
inkscape:export-filename="/tmp/gcmemsection.png"
|
||||
inkscape:export-xdpi="90.000000"
|
||||
inkscape:export-ydpi="90.000000" />
|
||||
<path
|
||||
style="fill:none;fill-opacity:0.75000000;fill-rule:evenodd;stroke:#000000;stroke-width:1.2500000;stroke-linecap:butt;stroke-linejoin:miter;marker-mid:none;marker-end:url(#Arrow2Mend);stroke-opacity:1.0000000;stroke-miterlimit:4.0000000;stroke-dasharray:none"
|
||||
d="M 441.13138,889.63261 C 442.23723,818.56405 333.26911,828.85620 330.24174,775.49808"
|
||||
id="path2622"
|
||||
sodipodi:nodetypes="cs"
|
||||
inkscape:export-filename="/tmp/gcmemsection.png"
|
||||
inkscape:export-xdpi="90.000000"
|
||||
inkscape:export-ydpi="90.000000" />
|
||||
<path
|
||||
style="fill:none;fill-opacity:0.75000000;fill-rule:evenodd;stroke:#000000;stroke-width:1.2617185;stroke-linecap:butt;stroke-linejoin:miter;stroke-miterlimit:4.0000000;stroke-dasharray:none;stroke-opacity:1.0000000"
|
||||
d="M 467.09369,672.45314 L 467.08605,767.76128 L 467.08605,767.76128"
|
||||
id="path2624"
|
||||
inkscape:export-filename="/tmp/gcmemsection.png"
|
||||
inkscape:export-xdpi="90.000000"
|
||||
inkscape:export-ydpi="90.000000" />
|
||||
<rect
|
||||
style="fill:#000000;fill-opacity:0.0000000;fill-rule:evenodd;stroke:#000000;stroke-width:1.2500000;stroke-miterlimit:4.0000000;stroke-dasharray:none;stroke-opacity:1.0000000"
|
||||
id="rect2626"
|
||||
width="22.752682"
|
||||
height="24.214773"
|
||||
x="377.73553"
|
||||
y="889.85596"
|
||||
inkscape:export-filename="/tmp/gcmemsection.png"
|
||||
inkscape:export-xdpi="90.000000"
|
||||
inkscape:export-ydpi="90.000000" />
|
||||
<rect
|
||||
style="fill:#000000;fill-opacity:0.0000000;fill-rule:evenodd;stroke:#000000;stroke-width:1.2500000;stroke-miterlimit:4.0000000;stroke-dasharray:none;stroke-opacity:1.0000000"
|
||||
id="rect2628"
|
||||
width="22.752682"
|
||||
height="24.214773"
|
||||
x="403.85040"
|
||||
y="889.85596"
|
||||
inkscape:export-filename="/tmp/gcmemsection.png"
|
||||
inkscape:export-xdpi="90.000000"
|
||||
inkscape:export-ydpi="90.000000" />
|
||||
<rect
|
||||
style="fill:#000000;fill-opacity:0.0000000;fill-rule:evenodd;stroke:#000000;stroke-width:1.2500000;stroke-miterlimit:4.0000000;stroke-dasharray:none;stroke-opacity:1.0000000"
|
||||
id="rect2630"
|
||||
width="22.752682"
|
||||
height="24.214773"
|
||||
x="429.96527"
|
||||
y="889.85596"
|
||||
inkscape:export-filename="/tmp/gcmemsection.png"
|
||||
inkscape:export-xdpi="90.000000"
|
||||
inkscape:export-ydpi="90.000000" />
|
||||
<rect
|
||||
style="fill:#000000;fill-opacity:0.0000000;fill-rule:evenodd;stroke:#000000;stroke-width:1.2500000;stroke-miterlimit:4.0000000;stroke-dasharray:none;stroke-opacity:1.0000000"
|
||||
id="rect2632"
|
||||
width="22.752682"
|
||||
height="24.214773"
|
||||
x="488.08020"
|
||||
y="889.85596"
|
||||
inkscape:export-filename="/tmp/gcmemsection.png"
|
||||
inkscape:export-xdpi="90.000000"
|
||||
inkscape:export-ydpi="90.000000" />
|
||||
<path
|
||||
style="fill:none;fill-opacity:0.75000000;fill-rule:evenodd;stroke:#000000;stroke-width:1.0000000;stroke-linecap:butt;stroke-linejoin:miter;marker-end:url(#Arrow2Mend);stroke-miterlimit:4.0000000;stroke-dasharray:none;stroke-opacity:1.0000000"
|
||||
d="M 292.81436,902.50755 C 372.54973,902.00248 372.54973,902.00248 372.54973,902.00248"
|
||||
id="path2634"
|
||||
inkscape:export-filename="/tmp/gcmemsection.png"
|
||||
inkscape:export-xdpi="90.000000"
|
||||
inkscape:export-ydpi="90.000000" />
|
||||
<text
|
||||
xml:space="preserve"
|
||||
style="font-size:12.000000px;font-style:normal;font-weight:normal;fill:#000000;fill-opacity:1.0000000;stroke:none;stroke-width:1.0000000px;stroke-linecap:butt;stroke-linejoin:miter;stroke-opacity:1.0000000;font-family:Bitstream Vera Sans"
|
||||
x="464.00037"
|
||||
y="903.38983"
|
||||
id="text2636"
|
||||
inkscape:export-filename="/tmp/gcmemsection.png"
|
||||
inkscape:export-xdpi="90.000000"
|
||||
inkscape:export-ydpi="90.000000"><tspan
|
||||
sodipodi:role="line"
|
||||
id="tspan2638"
|
||||
x="464.00037"
|
||||
y="903.38983">...</tspan></text>
|
||||
<text
|
||||
xml:space="preserve"
|
||||
style="font-size:12.000000px;font-style:normal;font-weight:normal;fill:#000000;fill-opacity:1.0000000;stroke:none;stroke-width:1.0000000px;stroke-linecap:butt;stroke-linejoin:miter;stroke-opacity:1.0000000;font-family:Bitstream Vera Sans"
|
||||
x="456.84808"
|
||||
y="945.75531"
|
||||
id="text2640"
|
||||
inkscape:export-filename="/tmp/gcmemsection.png"
|
||||
inkscape:export-xdpi="90.000000"
|
||||
inkscape:export-ydpi="90.000000"><tspan
|
||||
sodipodi:role="line"
|
||||
id="tspan2642"
|
||||
x="456.84808"
|
||||
y="945.75531">num_scan_starts</tspan></text>
|
||||
</g>
|
||||
</svg>
|
||||
|
Before Width: | Height: | Size: 42 KiB |
@@ -1,282 +0,0 @@
|
||||
<?xml version="1.0" encoding="UTF-8" standalone="no"?>
|
||||
<!-- Created with Inkscape (http://www.inkscape.org/) -->
|
||||
<svg
|
||||
xmlns:dc="http://purl.org/dc/elements/1.1/"
|
||||
xmlns:cc="http://web.resource.org/cc/"
|
||||
xmlns:rdf="http://www.w3.org/1999/02/22-rdf-syntax-ns#"
|
||||
xmlns:svg="http://www.w3.org/2000/svg"
|
||||
xmlns="http://www.w3.org/2000/svg"
|
||||
xmlns:sodipodi="http://inkscape.sourceforge.net/DTD/sodipodi-0.dtd"
|
||||
xmlns:inkscape="http://www.inkscape.org/namespaces/inkscape"
|
||||
width="800px"
|
||||
height="600px"
|
||||
id="svg2772"
|
||||
sodipodi:version="0.32"
|
||||
inkscape:version="0.42.2"
|
||||
sodipodi:docbase="/home/miguel/mono/gc"
|
||||
sodipodi:docname="overview.svg">
|
||||
<defs
|
||||
id="defs2774">
|
||||
<marker
|
||||
inkscape:stockid="Arrow2Lend"
|
||||
orient="auto"
|
||||
refY="0.0"
|
||||
refX="0.0"
|
||||
id="Arrow2Lend"
|
||||
style="overflow:visible;">
|
||||
<path
|
||||
sodipodi:nodetypes="cccc"
|
||||
id="path2392"
|
||||
style="font-size:12.0;fill-rule:evenodd;stroke-width:0.62500000;stroke-linejoin:round;"
|
||||
d="M 8.7185878,4.0337352 L -2.2072895,0.016013256 L 8.7185884,-4.0017078 C 6.9730900,-1.6296469 6.9831476,1.6157441 8.7185878,4.0337352 z "
|
||||
transform="scale(1.1) rotate(180) translate(-5,0)" />
|
||||
</marker>
|
||||
<marker
|
||||
inkscape:stockid="Arrow1Lstart"
|
||||
orient="auto"
|
||||
refY="0.0"
|
||||
refX="0.0"
|
||||
id="Arrow1Lstart"
|
||||
style="overflow:visible">
|
||||
<path
|
||||
sodipodi:nodetypes="ccccc"
|
||||
id="path2400"
|
||||
d="M 0.0,0.0 L 5.0,-5.0 L -12.5,0.0 L 5.0,5.0 L 0.0,0.0 z "
|
||||
style="fill-rule:evenodd;stroke:#000000;stroke-width:1.0pt;marker-start:none"
|
||||
transform="scale(0.8)" />
|
||||
</marker>
|
||||
<marker
|
||||
inkscape:stockid="Arrow1Mstart"
|
||||
orient="auto"
|
||||
refY="0.0"
|
||||
refX="0.0"
|
||||
id="Arrow1Mstart"
|
||||
style="overflow:visible">
|
||||
<path
|
||||
sodipodi:nodetypes="ccccc"
|
||||
id="path2397"
|
||||
d="M 0.0,0.0 L 5.0,-5.0 L -12.5,0.0 L 5.0,5.0 L 0.0,0.0 z "
|
||||
style="fill-rule:evenodd;stroke:#000000;stroke-width:1.0pt;marker-start:none"
|
||||
transform="scale(0.4)" />
|
||||
</marker>
|
||||
</defs>
|
||||
<sodipodi:namedview
|
||||
id="base"
|
||||
pagecolor="#ffffff"
|
||||
bordercolor="#666666"
|
||||
borderopacity="1.0"
|
||||
inkscape:pageopacity="0.0"
|
||||
inkscape:pageshadow="2"
|
||||
inkscape:zoom="1.0000000"
|
||||
inkscape:cx="408.00000"
|
||||
inkscape:cy="412.00000"
|
||||
inkscape:current-layer="layer1"
|
||||
inkscape:document-units="px"
|
||||
inkscape:window-width="1388"
|
||||
inkscape:window-height="998"
|
||||
inkscape:window-x="0"
|
||||
inkscape:window-y="27" />
|
||||
<metadata
|
||||
id="metadata2777">
|
||||
<rdf:RDF>
|
||||
<cc:Work
|
||||
rdf:about="">
|
||||
<dc:format>image/svg+xml</dc:format>
|
||||
<dc:type
|
||||
rdf:resource="http://purl.org/dc/dcmitype/StillImage" />
|
||||
</cc:Work>
|
||||
</rdf:RDF>
|
||||
</metadata>
|
||||
<g
|
||||
id="layer1"
|
||||
inkscape:label="Layer 1"
|
||||
inkscape:groupmode="layer">
|
||||
<rect
|
||||
style="fill:#000000;fill-opacity:0.21311475;fill-rule:evenodd;stroke:none;stroke-width:1.2500000;stroke-miterlimit:4.0000000;stroke-dasharray:none;stroke-opacity:1.0000000"
|
||||
id="rect2584"
|
||||
width="369.79077"
|
||||
height="95.629486"
|
||||
x="-604.89539"
|
||||
y="132.18524"
|
||||
inkscape:export-filename="/tmp/gcmemsection.png"
|
||||
inkscape:export-xdpi="90.000000"
|
||||
inkscape:export-ydpi="90.000000" />
|
||||
<text
|
||||
xml:space="preserve"
|
||||
style="font-size:15.094481px;font-style:normal;font-weight:normal;fill:#000000;fill-opacity:1.0000000;stroke:none;stroke-width:1.0000000px;stroke-linecap:butt;stroke-linejoin:miter;stroke-opacity:1.0000000;font-family:Bitstream Vera Sans"
|
||||
x="10.832281"
|
||||
y="76.351082"
|
||||
id="text2798"><tspan
|
||||
sodipodi:role="line"
|
||||
id="tspan2800"
|
||||
x="10.832281"
|
||||
y="76.351082">section_list</tspan></text>
|
||||
<text
|
||||
xml:space="preserve"
|
||||
style="font-size:20.107187px;font-style:normal;font-weight:normal;fill:#000000;fill-opacity:1.0000000;stroke:none;stroke-width:1.2500000;stroke-linecap:butt;stroke-linejoin:miter;stroke-miterlimit:4.0000000;stroke-dasharray:none;stroke-opacity:1.0000000;font-family:Bitstream Vera Sans"
|
||||
x="98.57534"
|
||||
y="38.764957"
|
||||
id="text2804"><tspan
|
||||
sodipodi:role="line"
|
||||
id="tspan2806"
|
||||
x="98.575340"
|
||||
y="38.764957">Old Generations:</tspan></text>
|
||||
<g
|
||||
id="g2814"
|
||||
transform="translate(2.000008,9.000000)">
|
||||
<rect
|
||||
inkscape:export-ydpi="90.000000"
|
||||
inkscape:export-xdpi="90.000000"
|
||||
inkscape:export-filename="/tmp/gcmemsection.png"
|
||||
y="205.35193"
|
||||
x="85.104614"
|
||||
height="85.296158"
|
||||
width="191.79076"
|
||||
id="rect2808"
|
||||
style="fill:#000000;fill-opacity:0.21311475;fill-rule:evenodd;stroke:#000000;stroke-width:1.0000000;stroke-miterlimit:4.0000000;stroke-dasharray:none;stroke-opacity:1.0000000" />
|
||||
<text
|
||||
id="text2810"
|
||||
y="255.49602"
|
||||
x="134.04068"
|
||||
style="font-size:20.107187px;font-style:normal;font-weight:normal;fill:#000000;fill-opacity:1.0000000;stroke:none;stroke-width:1.2500000;stroke-linecap:butt;stroke-linejoin:miter;stroke-miterlimit:4.0000000;stroke-dasharray:none;stroke-opacity:1.0000000;font-family:Bitstream Vera Sans"
|
||||
xml:space="preserve"><tspan
|
||||
y="255.49602"
|
||||
x="134.04068"
|
||||
id="tspan2812"
|
||||
sodipodi:role="line">Section 0</tspan></text>
|
||||
</g>
|
||||
<g
|
||||
id="g2830"
|
||||
transform="translate(-11.00000,-92.00000)">
|
||||
<rect
|
||||
inkscape:export-ydpi="90.000000"
|
||||
inkscape:export-xdpi="90.000000"
|
||||
inkscape:export-filename="/tmp/gcmemsection.png"
|
||||
y="211.35191"
|
||||
x="98.104622"
|
||||
height="85.296158"
|
||||
width="191.79076"
|
||||
id="rect2821"
|
||||
style="fill:#000000;fill-opacity:0.21311475;fill-rule:evenodd;stroke:#000000;stroke-width:1.0000000;stroke-miterlimit:4.0000000;stroke-dasharray:none;stroke-opacity:1.0000000" />
|
||||
<text
|
||||
id="text2823"
|
||||
y="261.496"
|
||||
x="147.30086"
|
||||
style="font-size:20.107187px;font-style:normal;font-weight:normal;fill:#000000;fill-opacity:1.0000000;stroke:none;stroke-width:1.2500000;stroke-linecap:butt;stroke-linejoin:miter;stroke-miterlimit:4.0000000;stroke-dasharray:none;stroke-opacity:1.0000000;font-family:Bitstream Vera Sans"
|
||||
xml:space="preserve"><tspan
|
||||
y="261.49600"
|
||||
x="147.30086"
|
||||
id="tspan2825"
|
||||
sodipodi:role="line">Section 1</tspan></text>
|
||||
</g>
|
||||
<path
|
||||
style="fill:none;fill-opacity:0.75000000;fill-rule:evenodd;stroke:#000000;stroke-width:1.2500000;stroke-linecap:butt;stroke-linejoin:miter;stroke-opacity:1.0000000;marker-start:none;marker-end:url(#Arrow2Lend);stroke-miterlimit:4.0000000;stroke-dasharray:none"
|
||||
d="M 48.000000,83.000000 C 43.000000,149.50000 75.000000,149.00000 75.000000,149.00000"
|
||||
id="path2835"
|
||||
sodipodi:nodetypes="cc" />
|
||||
<text
|
||||
xml:space="preserve"
|
||||
style="font-size:20.107187px;font-style:normal;font-weight:normal;fill:#000000;fill-opacity:1.0000000;stroke:none;stroke-width:1.2500000;stroke-linecap:butt;stroke-linejoin:miter;stroke-miterlimit:4.0000000;stroke-dasharray:none;stroke-opacity:1.0000000;font-family:Bitstream Vera Sans"
|
||||
x="340.95966"
|
||||
y="38.764957"
|
||||
id="text2843"><tspan
|
||||
sodipodi:role="line"
|
||||
id="tspan2845"
|
||||
x="340.95966"
|
||||
y="38.764957">New generation:</tspan></text>
|
||||
<g
|
||||
id="g2858"
|
||||
transform="translate(-9.000000,-111.0000)">
|
||||
<rect
|
||||
inkscape:export-ydpi="90.000000"
|
||||
inkscape:export-xdpi="90.000000"
|
||||
inkscape:export-filename="/tmp/gcmemsection.png"
|
||||
y="230.35193"
|
||||
x="337.10461"
|
||||
height="85.296158"
|
||||
width="191.79076"
|
||||
id="rect2849"
|
||||
style="fill:#000000;fill-opacity:0.21311475;fill-rule:evenodd;stroke:#000000;stroke-width:1.0000000;stroke-miterlimit:4.0000000;stroke-dasharray:none;stroke-opacity:1.0000000" />
|
||||
<text
|
||||
id="text2851"
|
||||
y="278.23788"
|
||||
x="392.74634"
|
||||
style="font-size:20.107187px;font-style:normal;font-weight:normal;fill:#000000;fill-opacity:1.0000000;stroke:none;stroke-width:1.2500000;stroke-linecap:butt;stroke-linejoin:miter;stroke-miterlimit:4.0000000;stroke-dasharray:none;stroke-opacity:1.0000000;font-family:Bitstream Vera Sans"
|
||||
xml:space="preserve"><tspan
|
||||
y="278.23788"
|
||||
x="392.74634"
|
||||
id="tspan2853"
|
||||
sodipodi:role="line">Nursery</tspan></text>
|
||||
</g>
|
||||
<path
|
||||
style="fill:none;fill-opacity:0.75000000;fill-rule:evenodd;stroke:#000000;stroke-width:1.2500000;stroke-linecap:butt;stroke-linejoin:miter;marker-start:none;marker-end:url(#Arrow2Lend);stroke-miterlimit:4.0000000;stroke-dasharray:none;stroke-opacity:1.0000000"
|
||||
d="M 83.203163,178.60032 C 23.635378,197.57995 77.069200,218.39965 77.069200,218.39965"
|
||||
id="path2863"
|
||||
sodipodi:nodetypes="cc" />
|
||||
<text
|
||||
xml:space="preserve"
|
||||
style="font-size:20.107187px;font-style:normal;font-weight:normal;fill:#000000;fill-opacity:1.0000000;stroke:none;stroke-width:1.2500000;stroke-linecap:butt;stroke-linejoin:miter;stroke-miterlimit:4.0000000;stroke-dasharray:none;stroke-opacity:1.0000000;font-family:Bitstream Vera Sans"
|
||||
x="567.95966"
|
||||
y="38.54715"
|
||||
id="text2865"><tspan
|
||||
sodipodi:role="line"
|
||||
id="tspan2867"
|
||||
x="567.95966"
|
||||
y="38.547150">Large Objects</tspan></text>
|
||||
<rect
|
||||
style="fill:#000000;fill-opacity:0.21311475;fill-rule:evenodd;stroke:#000000;stroke-width:1.2500000;stroke-miterlimit:4.0000000;stroke-dasharray:none;stroke-opacity:1.0000000"
|
||||
id="rect2871"
|
||||
width="32.620670"
|
||||
height="29.945086"
|
||||
x="606.68964"
|
||||
y="122.02747"
|
||||
inkscape:export-filename="/tmp/gcmemsection.png"
|
||||
inkscape:export-xdpi="90.000000"
|
||||
inkscape:export-ydpi="90.000000" />
|
||||
<text
|
||||
xml:space="preserve"
|
||||
style="font-size:15.094481px;font-style:normal;font-weight:normal;fill:#000000;fill-opacity:1.0000000;stroke:none;stroke-width:1.0000000px;stroke-linecap:butt;stroke-linejoin:miter;stroke-opacity:1.0000000;font-family:Bitstream Vera Sans"
|
||||
x="555.71997"
|
||||
y="76.351082"
|
||||
id="text2881"><tspan
|
||||
sodipodi:role="line"
|
||||
id="tspan2883"
|
||||
x="555.71997"
|
||||
y="76.351082">los_object_list</tspan></text>
|
||||
<rect
|
||||
style="fill:#000000;fill-opacity:0.21311475;fill-rule:evenodd;stroke:#000000;stroke-width:1.2500000;stroke-miterlimit:4.0000000;stroke-dasharray:none;stroke-opacity:1.0000000"
|
||||
id="rect2885"
|
||||
width="32.620670"
|
||||
height="29.945086"
|
||||
x="663.68964"
|
||||
y="122.02747"
|
||||
inkscape:export-filename="/tmp/gcmemsection.png"
|
||||
inkscape:export-xdpi="90.000000"
|
||||
inkscape:export-ydpi="90.000000" />
|
||||
<rect
|
||||
style="fill:#000000;fill-opacity:0.21311475;fill-rule:evenodd;stroke:#000000;stroke-width:1.2500000;stroke-miterlimit:4.0000000;stroke-dasharray:none;stroke-opacity:1.0000000"
|
||||
id="rect2887"
|
||||
width="32.620670"
|
||||
height="29.945086"
|
||||
x="721.68964"
|
||||
y="122.02747"
|
||||
inkscape:export-filename="/tmp/gcmemsection.png"
|
||||
inkscape:export-xdpi="90.000000"
|
||||
inkscape:export-ydpi="90.000000" />
|
||||
<path
|
||||
style="fill:none;fill-opacity:0.75000000;fill-rule:evenodd;stroke:#000000;stroke-width:1.1409233;stroke-linecap:butt;stroke-linejoin:miter;marker-start:none;marker-end:url(#Arrow2Lend);stroke-miterlimit:4.0000000;stroke-dasharray:none;stroke-opacity:1.0000000"
|
||||
d="M 568.83205,82.879132 C 563.66843,136.52413 596.71567,136.12079 596.71567,136.12079"
|
||||
id="path2889"
|
||||
sodipodi:nodetypes="cc" />
|
||||
<path
|
||||
style="fill:none;fill-opacity:0.75000000;fill-rule:evenodd;stroke:#000000;stroke-width:0.95145077;stroke-linecap:butt;stroke-linejoin:miter;marker-start:none;marker-end:url(#Arrow2Lend);stroke-miterlimit:4.0000000;stroke-dasharray:none;stroke-opacity:1.0000000"
|
||||
d="M 697.37385,136.93683 C 695.78127,137.13796 713.17398,137.03871 713.17398,137.03871"
|
||||
id="path2891"
|
||||
sodipodi:nodetypes="cc" />
|
||||
<path
|
||||
style="fill:none;fill-opacity:0.75000000;fill-rule:evenodd;stroke:#000000;stroke-width:0.95145077;stroke-linecap:butt;stroke-linejoin:miter;marker-start:none;marker-end:url(#Arrow2Lend);stroke-miterlimit:4.0000000;stroke-dasharray:none;stroke-opacity:1.0000000"
|
||||
d="M 640.15146,136.93683 C 638.55888,137.13796 655.95159,137.03871 655.95159,137.03871"
|
||||
id="path2893"
|
||||
sodipodi:nodetypes="cc" />
|
||||
</g>
|
||||
</svg>
|
||||
|
Before Width: | Height: | Size: 12 KiB |
@@ -1,761 +0,0 @@
|
||||
<?xml version="1.0" encoding="UTF-8" standalone="no"?>
|
||||
<!-- Created with Inkscape (http://www.inkscape.org/) -->
|
||||
<svg
|
||||
xmlns:dc="http://purl.org/dc/elements/1.1/"
|
||||
xmlns:cc="http://web.resource.org/cc/"
|
||||
xmlns:rdf="http://www.w3.org/1999/02/22-rdf-syntax-ns#"
|
||||
xmlns:svg="http://www.w3.org/2000/svg"
|
||||
xmlns="http://www.w3.org/2000/svg"
|
||||
xmlns:sodipodi="http://inkscape.sourceforge.net/DTD/sodipodi-0.dtd"
|
||||
xmlns:inkscape="http://www.inkscape.org/namespaces/inkscape"
|
||||
width="744.09448819"
|
||||
height="1052.3622047"
|
||||
id="svg2895"
|
||||
sodipodi:version="0.32"
|
||||
inkscape:version="0.42.2"
|
||||
sodipodi:docbase="/home/miguel/mono/gc"
|
||||
sodipodi:docname="roots.svg">
|
||||
<defs
|
||||
id="defs2897">
|
||||
<marker
|
||||
inkscape:stockid="Arrow2Mend"
|
||||
orient="auto"
|
||||
refY="0.0"
|
||||
refX="0.0"
|
||||
id="Arrow2Mend"
|
||||
style="overflow:visible;">
|
||||
<path
|
||||
sodipodi:nodetypes="cccc"
|
||||
id="path2389"
|
||||
style="font-size:12.0;fill-rule:evenodd;stroke-width:0.62500000;stroke-linejoin:round;"
|
||||
d="M 8.7185878,4.0337352 L -2.2072895,0.016013256 L 8.7185884,-4.0017078 C 6.9730900,-1.6296469 6.9831476,1.6157441 8.7185878,4.0337352 z "
|
||||
transform="scale(0.6) rotate(180) translate(-5,0)" />
|
||||
</marker>
|
||||
<marker
|
||||
inkscape:stockid="Arrow2Lend"
|
||||
orient="auto"
|
||||
refY="0.0"
|
||||
refX="0.0"
|
||||
id="Arrow2Lend"
|
||||
style="overflow:visible;">
|
||||
<path
|
||||
sodipodi:nodetypes="cccc"
|
||||
id="path2392"
|
||||
style="font-size:12.0;fill-rule:evenodd;stroke-width:0.62500000;stroke-linejoin:round;"
|
||||
d="M 8.7185878,4.0337352 L -2.2072895,0.016013256 L 8.7185884,-4.0017078 C 6.9730900,-1.6296469 6.9831476,1.6157441 8.7185878,4.0337352 z "
|
||||
transform="scale(1.1) rotate(180) translate(-5,0)" />
|
||||
</marker>
|
||||
</defs>
|
||||
<sodipodi:namedview
|
||||
id="base"
|
||||
pagecolor="#ffffff"
|
||||
bordercolor="#666666"
|
||||
borderopacity="1.0"
|
||||
inkscape:pageopacity="0.0"
|
||||
inkscape:pageshadow="2"
|
||||
inkscape:zoom="0.35000000"
|
||||
inkscape:cx="795.16964"
|
||||
inkscape:cy="595.84469"
|
||||
inkscape:document-units="px"
|
||||
inkscape:current-layer="layer1"
|
||||
inkscape:window-width="1388"
|
||||
inkscape:window-height="998"
|
||||
inkscape:window-x="0"
|
||||
inkscape:window-y="27" />
|
||||
<metadata
|
||||
id="metadata2900">
|
||||
<rdf:RDF>
|
||||
<cc:Work
|
||||
rdf:about="">
|
||||
<dc:format>image/svg+xml</dc:format>
|
||||
<dc:type
|
||||
rdf:resource="http://purl.org/dc/dcmitype/StillImage" />
|
||||
</cc:Work>
|
||||
</rdf:RDF>
|
||||
</metadata>
|
||||
<g
|
||||
inkscape:label="Layer 1"
|
||||
inkscape:groupmode="layer"
|
||||
id="layer1">
|
||||
<rect
|
||||
style="opacity:1.0000000;fill:#97ff9f;fill-opacity:0.0000000;fill-rule:evenodd;stroke:#000000;stroke-width:1.4505868;stroke-miterlimit:4.0000000;stroke-dasharray:none;stroke-opacity:1.0000000"
|
||||
id="rect2582"
|
||||
width="669.29736"
|
||||
height="95.744583"
|
||||
x="46.683918"
|
||||
y="777.24200"
|
||||
inkscape:export-filename="/tmp/roots.png"
|
||||
inkscape:export-xdpi="91.239998"
|
||||
inkscape:export-ydpi="91.239998" />
|
||||
<rect
|
||||
style="fill:#000000;fill-opacity:1.0000000;fill-rule:evenodd;stroke:#000000;stroke-width:1.2500000;stroke-miterlimit:4.0000000;stroke-dasharray:none;stroke-opacity:1.0000000"
|
||||
id="rect2584"
|
||||
width="27.900555"
|
||||
height="95.629486"
|
||||
x="46.834984"
|
||||
y="777.29956"
|
||||
inkscape:export-filename="/tmp/roots.png"
|
||||
inkscape:export-xdpi="91.239998"
|
||||
inkscape:export-ydpi="91.239998" />
|
||||
<rect
|
||||
style="fill:#000000;fill-opacity:0.0000000;fill-rule:evenodd;stroke:#000000;stroke-width:1.2500000;stroke-linecap:round;stroke-linejoin:round;stroke-miterlimit:4.0000000;stroke-dasharray:none;stroke-dashoffset:0.0000000;stroke-opacity:1.0000000"
|
||||
id="rect2908"
|
||||
width="192.52747"
|
||||
height="115.43071"
|
||||
x="56.774403"
|
||||
y="580.48413"
|
||||
inkscape:export-filename="/tmp/roots.png"
|
||||
inkscape:export-xdpi="91.239998"
|
||||
inkscape:export-ydpi="91.239998" />
|
||||
<g
|
||||
id="g2963"
|
||||
transform="translate(0.678249,-1.235298)"
|
||||
inkscape:export-filename="/tmp/roots.png"
|
||||
inkscape:export-xdpi="91.239998"
|
||||
inkscape:export-ydpi="91.239998">
|
||||
<text
|
||||
id="text2910"
|
||||
y="604.86456"
|
||||
x="72.848167"
|
||||
style="font-size:12.000000px;font-style:normal;font-weight:normal;fill:#000000;fill-opacity:1.0000000;stroke:none;stroke-width:1.0000000px;stroke-linecap:butt;stroke-linejoin:miter;stroke-opacity:1.0000000;font-family:Bitstream Vera Sans"
|
||||
xml:space="preserve"><tspan
|
||||
y="604.86456"
|
||||
x="72.848167"
|
||||
id="tspan2912"
|
||||
sodipodi:role="line">CPU Register References</tspan></text>
|
||||
<text
|
||||
id="text2914"
|
||||
y="631.28149"
|
||||
x="73.557152"
|
||||
style="font-size:12.000000px;font-style:normal;font-weight:normal;fill:#000000;fill-opacity:1.0000000;stroke:none;stroke-width:1.0000000px;stroke-linecap:butt;stroke-linejoin:miter;stroke-opacity:1.0000000;font-family:Bitstream Vera Sans"
|
||||
xml:space="preserve"><tspan
|
||||
id="tspan2918"
|
||||
y="631.28149"
|
||||
x="73.557152"
|
||||
sodipodi:role="line">Thread Local Variables</tspan></text>
|
||||
<text
|
||||
id="text2920"
|
||||
y="656.53534"
|
||||
x="72.73098"
|
||||
style="font-size:12.000000px;font-style:normal;font-weight:normal;fill:#000000;fill-opacity:1.0000000;stroke:none;stroke-width:1.0000000px;stroke-linecap:butt;stroke-linejoin:miter;stroke-opacity:1.0000000;font-family:Bitstream Vera Sans"
|
||||
xml:space="preserve"><tspan
|
||||
id="tspan2924"
|
||||
y="656.53534"
|
||||
x="72.730980"
|
||||
sodipodi:role="line">Static fields</tspan></text>
|
||||
<text
|
||||
id="text2926"
|
||||
y="680.6261"
|
||||
x="72.344261"
|
||||
style="font-size:12.000000px;font-style:normal;font-weight:normal;fill:#000000;fill-opacity:1.0000000;stroke:none;stroke-width:1.0000000px;stroke-linecap:butt;stroke-linejoin:miter;stroke-opacity:1.0000000;font-family:Bitstream Vera Sans"
|
||||
xml:space="preserve"><tspan
|
||||
y="680.62610"
|
||||
x="72.344261"
|
||||
id="tspan2928"
|
||||
sodipodi:role="line">Runtime object references</tspan></text>
|
||||
</g>
|
||||
<path
|
||||
style="fill:none;fill-opacity:0.75000000;fill-rule:evenodd;stroke:#000000;stroke-width:1.0148686px;stroke-linecap:butt;stroke-linejoin:miter;stroke-opacity:1.0000000"
|
||||
d="M 141.15688,696.28653 L 99.281852,736.43697 L 57.406801,776.58742"
|
||||
id="path2939"
|
||||
sodipodi:nodetypes="ccc"
|
||||
inkscape:export-filename="/tmp/roots.png"
|
||||
inkscape:export-xdpi="91.239998"
|
||||
inkscape:export-ydpi="91.239998" />
|
||||
<path
|
||||
style="fill:none;fill-opacity:0.75000000;fill-rule:evenodd;stroke:#000000;stroke-width:1.0046772px;stroke-linecap:butt;stroke-linejoin:miter;stroke-opacity:1.0000000"
|
||||
d="M 141.42136,696.03556 L 140.41120,776.58585 L 141.42136,696.03556 z "
|
||||
id="path2943"
|
||||
inkscape:export-filename="/tmp/roots.png"
|
||||
inkscape:export-xdpi="91.239998"
|
||||
inkscape:export-ydpi="91.239998" />
|
||||
<path
|
||||
style="fill:none;fill-opacity:0.75000000;fill-rule:evenodd;stroke:#000000;stroke-width:1.0069753px;stroke-linecap:butt;stroke-linejoin:miter;stroke-opacity:1.0000000"
|
||||
d="M 141.67310,696.54376 L 297.99580,777.59288 L 141.67310,696.54376 z "
|
||||
id="path2945"
|
||||
inkscape:export-filename="/tmp/roots.png"
|
||||
inkscape:export-xdpi="91.239998"
|
||||
inkscape:export-ydpi="91.239998" />
|
||||
<path
|
||||
style="fill:none;fill-opacity:0.75000000;fill-rule:evenodd;stroke:#000000;stroke-width:1.0000000px;stroke-linecap:butt;stroke-linejoin:miter;stroke-opacity:1.0000000"
|
||||
d="M 141.42136,695.77833 L 577.80726,776.59054"
|
||||
id="path2947"
|
||||
inkscape:export-filename="/tmp/roots.png"
|
||||
inkscape:export-xdpi="91.239998"
|
||||
inkscape:export-ydpi="91.239998" />
|
||||
<rect
|
||||
style="fill:#000000;fill-opacity:1.0000000;fill-rule:evenodd;stroke:#000000;stroke-width:1.2500000;stroke-miterlimit:4.0000000;stroke-dasharray:none;stroke-opacity:1.0000000"
|
||||
id="rect2957"
|
||||
width="18.257698"
|
||||
height="95.629486"
|
||||
x="130.87115"
|
||||
y="777.29956"
|
||||
inkscape:export-filename="/tmp/roots.png"
|
||||
inkscape:export-xdpi="91.239998"
|
||||
inkscape:export-ydpi="91.239998" />
|
||||
<rect
|
||||
style="fill:#000000;fill-opacity:1.0000000;fill-rule:evenodd;stroke:#000000;stroke-width:1.2500000;stroke-miterlimit:4.0000000;stroke-dasharray:none;stroke-opacity:1.0000000"
|
||||
id="rect2959"
|
||||
width="50.757698"
|
||||
height="95.629486"
|
||||
x="274.94327"
|
||||
y="777.29956"
|
||||
inkscape:export-filename="/tmp/roots.png"
|
||||
inkscape:export-xdpi="91.239998"
|
||||
inkscape:export-ydpi="91.239998" />
|
||||
<rect
|
||||
style="fill:#000000;fill-opacity:1.0000000;fill-rule:evenodd;stroke:#000000;stroke-width:1.2500000;stroke-miterlimit:4.0000000;stroke-dasharray:none;stroke-opacity:1.0000000"
|
||||
id="rect2961"
|
||||
width="29.686272"
|
||||
height="95.629486"
|
||||
x="563.54974"
|
||||
y="777.29956"
|
||||
inkscape:export-filename="/tmp/roots.png"
|
||||
inkscape:export-xdpi="91.239998"
|
||||
inkscape:export-ydpi="91.239998" />
|
||||
<rect
|
||||
style="fill:#000000;fill-opacity:0.21311475;fill-rule:evenodd;stroke:#000000;stroke-width:1.2500000;stroke-miterlimit:4.0000000;stroke-dasharray:none;stroke-opacity:1.0000000"
|
||||
id="rect2991"
|
||||
width="27.900555"
|
||||
height="95.629486"
|
||||
x="182.01932"
|
||||
y="777.29956"
|
||||
inkscape:export-filename="/tmp/roots.png"
|
||||
inkscape:export-xdpi="91.239998"
|
||||
inkscape:export-ydpi="91.239998" />
|
||||
<rect
|
||||
style="fill:#000000;fill-opacity:0.21311475;fill-rule:evenodd;stroke:#000000;stroke-width:1.2500000;stroke-miterlimit:4.0000000;stroke-dasharray:none;stroke-opacity:1.0000000"
|
||||
id="rect3004"
|
||||
width="27.900555"
|
||||
height="95.629486"
|
||||
x="378.19257"
|
||||
y="777.29956"
|
||||
inkscape:export-filename="/tmp/roots.png"
|
||||
inkscape:export-xdpi="91.239998"
|
||||
inkscape:export-ydpi="91.239998" />
|
||||
<rect
|
||||
style="fill:#000000;fill-opacity:0.21311475;fill-rule:evenodd;stroke:#000000;stroke-width:1.2500000;stroke-miterlimit:4.0000000;stroke-dasharray:none;stroke-opacity:1.0000000"
|
||||
id="rect3006"
|
||||
width="27.900555"
|
||||
height="95.629486"
|
||||
x="482.47830"
|
||||
y="777.29956"
|
||||
inkscape:export-filename="/tmp/roots.png"
|
||||
inkscape:export-xdpi="91.239998"
|
||||
inkscape:export-ydpi="91.239998" />
|
||||
<rect
|
||||
style="fill:#000000;fill-opacity:0.21311475;fill-rule:evenodd;stroke:#000000;stroke-width:0.97463667;stroke-miterlimit:4.0000000;stroke-dasharray:none;stroke-opacity:1.0000000"
|
||||
id="rect3008"
|
||||
width="16.962049"
|
||||
height="95.629486"
|
||||
x="638.66180"
|
||||
y="777.29956"
|
||||
inkscape:export-filename="/tmp/roots.png"
|
||||
inkscape:export-xdpi="91.239998"
|
||||
inkscape:export-ydpi="91.239998" />
|
||||
<g
|
||||
id="g3115"
|
||||
transform="translate(202.3879,-322.8571)"
|
||||
inkscape:export-filename="/tmp/nursery.png"
|
||||
inkscape:export-xdpi="91.239998"
|
||||
inkscape:export-ydpi="91.239998">
|
||||
<g
|
||||
transform="translate(-428.5714,398.5714)"
|
||||
id="g3100">
|
||||
<rect
|
||||
style="fill:#000000;fill-opacity:0.21176471;fill-rule:evenodd;stroke:#000000;stroke-width:1.2500000;stroke-miterlimit:4.0000000;stroke-dasharray:none;stroke-opacity:1.0000000"
|
||||
id="rect2985"
|
||||
width="15.082790"
|
||||
height="13.979280"
|
||||
x="510.61618"
|
||||
y="99.134712"
|
||||
inkscape:export-filename="/tmp/roots.png"
|
||||
inkscape:export-xdpi="91.239998"
|
||||
inkscape:export-ydpi="91.239998" />
|
||||
<text
|
||||
xml:space="preserve"
|
||||
style="font-size:15.756983px;font-style:normal;font-weight:normal;fill:#000000;fill-opacity:1.0000000;stroke:none;stroke-width:1.0000000px;stroke-linecap:butt;stroke-linejoin:miter;stroke-opacity:1.0000000;font-family:Bitstream Vera Sans"
|
||||
x="534.28992"
|
||||
y="110.82124"
|
||||
id="text2987"
|
||||
inkscape:export-filename="/tmp/roots.png"
|
||||
inkscape:export-xdpi="91.239998"
|
||||
inkscape:export-ydpi="91.239998"><tspan
|
||||
sodipodi:role="line"
|
||||
id="tspan2989"
|
||||
x="534.28992"
|
||||
y="110.82124">Live Objects</tspan></text>
|
||||
</g>
|
||||
<g
|
||||
transform="translate(-282.8963,371.4286)"
|
||||
id="g3105">
|
||||
<rect
|
||||
style="fill:#000000;fill-opacity:1.0000000;fill-rule:evenodd;stroke:#000000;stroke-width:1.2500000;stroke-miterlimit:4.0000000;stroke-dasharray:none;stroke-opacity:1.0000000"
|
||||
id="rect3010"
|
||||
width="15.082790"
|
||||
height="13.979280"
|
||||
x="510.61618"
|
||||
y="127.17164"
|
||||
inkscape:export-filename="/tmp/roots.png"
|
||||
inkscape:export-xdpi="91.239998"
|
||||
inkscape:export-ydpi="91.239998" />
|
||||
<text
|
||||
xml:space="preserve"
|
||||
style="font-size:15.756983px;font-style:normal;font-weight:normal;fill:#000000;fill-opacity:1.0000000;stroke:none;stroke-width:1.0000000px;stroke-linecap:butt;stroke-linejoin:miter;stroke-opacity:1.0000000;font-family:Bitstream Vera Sans"
|
||||
x="534.28992"
|
||||
y="138.85815"
|
||||
id="text3012"
|
||||
inkscape:export-filename="/tmp/roots.png"
|
||||
inkscape:export-xdpi="91.239998"
|
||||
inkscape:export-ydpi="91.239998"><tspan
|
||||
sodipodi:role="line"
|
||||
id="tspan3014"
|
||||
x="534.28992"
|
||||
y="138.85815">Pinned objects</tspan></text>
|
||||
</g>
|
||||
<g
|
||||
transform="translate(-118.5714,344.2857)"
|
||||
id="g3110">
|
||||
<rect
|
||||
style="fill:#000000;fill-opacity:0.0000000;fill-rule:evenodd;stroke:#000000;stroke-width:1.2500000;stroke-miterlimit:4.0000000;stroke-dasharray:none;stroke-opacity:1.0000000"
|
||||
id="rect3016"
|
||||
width="15.082790"
|
||||
height="13.979280"
|
||||
x="510.61618"
|
||||
y="155.20856"
|
||||
inkscape:export-filename="/tmp/roots.png"
|
||||
inkscape:export-xdpi="91.239998"
|
||||
inkscape:export-ydpi="91.239998" />
|
||||
<text
|
||||
xml:space="preserve"
|
||||
style="font-size:15.756983px;font-style:normal;font-weight:normal;fill:#000000;fill-opacity:1.0000000;stroke:none;stroke-width:1.0000000px;stroke-linecap:butt;stroke-linejoin:miter;stroke-opacity:1.0000000;font-family:Bitstream Vera Sans"
|
||||
x="534.9516"
|
||||
y="166.89508"
|
||||
id="text3018"
|
||||
inkscape:export-filename="/tmp/roots.png"
|
||||
inkscape:export-xdpi="91.239998"
|
||||
inkscape:export-ydpi="91.239998"><tspan
|
||||
sodipodi:role="line"
|
||||
id="tspan3020"
|
||||
x="534.95160"
|
||||
y="166.89508">Garbage</tspan></text>
|
||||
</g>
|
||||
</g>
|
||||
<path
|
||||
style="fill:none;fill-opacity:0.75000000;fill-rule:evenodd;stroke:#000000;stroke-width:1.2500000;stroke-linecap:butt;stroke-linejoin:miter;marker-end:url(#Arrow2Mend);stroke-miterlimit:4.0000000;stroke-dasharray:none;stroke-dashoffset:0.0000000;stroke-opacity:1.0000000"
|
||||
d="M 137.92030,871.86711 C 188.66513,922.95790 194.93685,877.96303 194.93685,877.96303"
|
||||
id="path3022"
|
||||
sodipodi:nodetypes="cc"
|
||||
inkscape:export-filename="/tmp/roots.png"
|
||||
inkscape:export-xdpi="91.239998"
|
||||
inkscape:export-ydpi="91.239998" />
|
||||
<path
|
||||
style="fill:none;fill-opacity:0.75000000;fill-rule:evenodd;stroke:#000000;stroke-width:1.4878695;stroke-linecap:butt;stroke-linejoin:miter;marker-end:url(#Arrow2Mend);stroke-miterlimit:4.0000000;stroke-dasharray:none;stroke-dashoffset:0.0000000;stroke-opacity:1.0000000"
|
||||
d="M 578.24777,873.42803 C 511.53352,930.94739 498.89508,879.52395 498.89508,879.52395"
|
||||
id="path3030"
|
||||
sodipodi:nodetypes="cc"
|
||||
inkscape:export-filename="/tmp/roots.png"
|
||||
inkscape:export-xdpi="91.239998"
|
||||
inkscape:export-ydpi="91.239998" />
|
||||
<path
|
||||
style="fill:none;fill-opacity:0.75000000;fill-rule:evenodd;stroke:#000000;stroke-width:1.2500000;stroke-linecap:butt;stroke-linejoin:miter;marker-end:url(#Arrow2Mend);stroke-miterlimit:4.0000000;stroke-dasharray:none;stroke-dashoffset:0.0000000;stroke-opacity:1.0000000"
|
||||
d="M 579.45614,874.14232 C 638.45729,925.94739 644.82958,878.80967 644.82958,878.80967"
|
||||
id="path3032"
|
||||
sodipodi:nodetypes="cc"
|
||||
inkscape:export-filename="/tmp/roots.png"
|
||||
inkscape:export-xdpi="91.239998"
|
||||
inkscape:export-ydpi="91.239998" />
|
||||
<path
|
||||
style="fill:none;fill-opacity:0.75000000;fill-rule:evenodd;stroke:#000000;stroke-width:1.2500000;stroke-linecap:butt;stroke-linejoin:miter;marker-end:url(#Arrow2Mend);stroke-miterlimit:4.0000000;stroke-dasharray:none;stroke-dashoffset:0.0000000;stroke-opacity:1.0000000"
|
||||
d="M 494.45285,873.73905 C 407.69664,931.25841 391.26142,879.83497 391.26142,879.83497"
|
||||
id="path3034"
|
||||
sodipodi:nodetypes="cc"
|
||||
inkscape:export-filename="/tmp/roots.png"
|
||||
inkscape:export-xdpi="91.239998"
|
||||
inkscape:export-ydpi="91.239998" />
|
||||
<rect
|
||||
style="opacity:1.0000000;fill:#97ff9f;fill-opacity:0.0000000;fill-rule:evenodd;stroke:#000000;stroke-width:1.4505868;stroke-miterlimit:4.0000000;stroke-dasharray:none;stroke-opacity:1.0000000"
|
||||
id="rect3046"
|
||||
width="669.29736"
|
||||
height="95.744583"
|
||||
x="22.945324"
|
||||
y="209.49988"
|
||||
inkscape:export-filename="/tmp/nursery.png"
|
||||
inkscape:export-xdpi="91.239998"
|
||||
inkscape:export-ydpi="91.239998" />
|
||||
<rect
|
||||
style="fill:#000000;fill-opacity:0.21176471;fill-rule:evenodd;stroke:#000000;stroke-width:1.2500000;stroke-miterlimit:4.0000000;stroke-dasharray:none;stroke-opacity:1.0000000"
|
||||
id="rect3048"
|
||||
width="27.900555"
|
||||
height="95.629486"
|
||||
x="23.096386"
|
||||
y="209.55743"
|
||||
inkscape:export-filename="/tmp/nursery.png"
|
||||
inkscape:export-xdpi="91.239998"
|
||||
inkscape:export-ydpi="91.239998" />
|
||||
<rect
|
||||
style="fill:#000000;fill-opacity:1.0000000;fill-rule:evenodd;stroke:#000000;stroke-width:1.2500000;stroke-miterlimit:4.0000000;stroke-dasharray:none;stroke-opacity:1.0000000"
|
||||
id="rect3050"
|
||||
width="18.257698"
|
||||
height="95.629486"
|
||||
x="107.13255"
|
||||
y="209.55743"
|
||||
inkscape:export-filename="/tmp/nursery.png"
|
||||
inkscape:export-xdpi="91.239998"
|
||||
inkscape:export-ydpi="91.239998" />
|
||||
<rect
|
||||
style="fill:#000000;fill-opacity:0.21176471;fill-rule:evenodd;stroke:#000000;stroke-width:1.2500000;stroke-miterlimit:4.0000000;stroke-dasharray:none;stroke-opacity:1.0000000"
|
||||
id="rect3052"
|
||||
width="50.757698"
|
||||
height="95.629486"
|
||||
x="251.20467"
|
||||
y="209.55743"
|
||||
inkscape:export-filename="/tmp/nursery.png"
|
||||
inkscape:export-xdpi="91.239998"
|
||||
inkscape:export-ydpi="91.239998" />
|
||||
<rect
|
||||
style="fill:#000000;fill-opacity:0.21176471;fill-rule:evenodd;stroke:#000000;stroke-width:1.2500000;stroke-miterlimit:4.0000000;stroke-dasharray:none;stroke-opacity:1.0000000"
|
||||
id="rect3054"
|
||||
width="29.686272"
|
||||
height="95.629486"
|
||||
x="539.81110"
|
||||
y="209.55743"
|
||||
inkscape:export-filename="/tmp/nursery.png"
|
||||
inkscape:export-xdpi="91.239998"
|
||||
inkscape:export-ydpi="91.239998" />
|
||||
<rect
|
||||
style="fill:#000000;fill-opacity:1.0000000;fill-rule:evenodd;stroke:#000000;stroke-width:1.2500000;stroke-miterlimit:4.0000000;stroke-dasharray:none;stroke-opacity:1.0000000"
|
||||
id="rect3056"
|
||||
width="27.900555"
|
||||
height="95.629486"
|
||||
x="158.28072"
|
||||
y="209.55743"
|
||||
inkscape:export-filename="/tmp/nursery.png"
|
||||
inkscape:export-xdpi="91.239998"
|
||||
inkscape:export-ydpi="91.239998" />
|
||||
<rect
|
||||
style="fill:#000000;fill-opacity:0.21176471;fill-rule:evenodd;stroke:#000000;stroke-width:1.2500000;stroke-miterlimit:4.0000000;stroke-dasharray:none;stroke-opacity:1.0000000"
|
||||
id="rect3058"
|
||||
width="27.900555"
|
||||
height="95.629486"
|
||||
x="354.45398"
|
||||
y="209.55743"
|
||||
inkscape:export-filename="/tmp/nursery.png"
|
||||
inkscape:export-xdpi="91.239998"
|
||||
inkscape:export-ydpi="91.239998" />
|
||||
<rect
|
||||
style="fill:#000000;fill-opacity:1.0000000;fill-rule:evenodd;stroke:#000000;stroke-width:1.2500000;stroke-miterlimit:4.0000000;stroke-dasharray:none;stroke-opacity:1.0000000"
|
||||
id="rect3060"
|
||||
width="27.900555"
|
||||
height="95.629486"
|
||||
x="458.73972"
|
||||
y="209.55743"
|
||||
inkscape:export-filename="/tmp/nursery.png"
|
||||
inkscape:export-xdpi="91.239998"
|
||||
inkscape:export-ydpi="91.239998" />
|
||||
<rect
|
||||
style="fill:#000000;fill-opacity:0.21176471;fill-rule:evenodd;stroke:#000000;stroke-width:1.2500000;stroke-miterlimit:4.0000000;stroke-dasharray:none;stroke-opacity:1.0000000"
|
||||
id="rect3062"
|
||||
width="67.113373"
|
||||
height="95.629486"
|
||||
x="616.36401"
|
||||
y="209.55743"
|
||||
inkscape:export-filename="/tmp/nursery.png"
|
||||
inkscape:export-xdpi="91.239998"
|
||||
inkscape:export-ydpi="91.239998" />
|
||||
<rect
|
||||
style="opacity:1.0000000;fill:#97ff9f;fill-opacity:0.0000000;fill-rule:evenodd;stroke:#000000;stroke-width:1.2500000;stroke-miterlimit:4.0000000;stroke-dasharray:none;stroke-opacity:1.0000000"
|
||||
id="rect3070"
|
||||
width="664.46503"
|
||||
height="95.744583"
|
||||
x="26.226122"
|
||||
y="376.36218"
|
||||
inkscape:export-filename="/tmp/nursery.png"
|
||||
inkscape:export-xdpi="91.239998"
|
||||
inkscape:export-ydpi="91.239998" />
|
||||
<text
|
||||
xml:space="preserve"
|
||||
style="font-size:17.390287px;font-style:normal;font-weight:normal;fill:#000000;fill-opacity:1.0000000;stroke:none;stroke-width:1.0000000px;stroke-linecap:butt;stroke-linejoin:miter;stroke-opacity:1.0000000;font-family:Bitstream Vera Sans"
|
||||
x="27.714634"
|
||||
y="188.57069"
|
||||
id="text3072"
|
||||
inkscape:export-filename="/tmp/nursery.png"
|
||||
inkscape:export-xdpi="91.239998"
|
||||
inkscape:export-ydpi="91.239998"><tspan
|
||||
sodipodi:role="line"
|
||||
id="tspan3074"
|
||||
x="27.714634"
|
||||
y="188.57069">Nursery</tspan></text>
|
||||
<path
|
||||
style="fill:none;fill-opacity:0.75000000;fill-rule:evenodd;stroke:#000000;stroke-width:1.2500000;stroke-linecap:butt;stroke-linejoin:miter;marker-end:url(#Arrow2Mend);stroke-miterlimit:4.0000000;stroke-dasharray:none;stroke-opacity:1.0000000"
|
||||
d="M 38.932235,305.42360 C 429.52601,373.97550 429.52601,373.97550 429.52601,373.97550"
|
||||
id="path3080"
|
||||
inkscape:export-filename="/tmp/nursery.png"
|
||||
inkscape:export-xdpi="91.239998"
|
||||
inkscape:export-ydpi="91.239998" />
|
||||
<rect
|
||||
style="fill:#000000;fill-opacity:0.21176471;fill-rule:evenodd;stroke:#000000;stroke-width:1.2500000;stroke-miterlimit:4.0000000;stroke-dasharray:none;stroke-opacity:1.0000000"
|
||||
id="rect3082"
|
||||
width="27.900555"
|
||||
height="95.629486"
|
||||
x="422.33337"
|
||||
y="376.38739"
|
||||
inkscape:export-filename="/tmp/nursery.png"
|
||||
inkscape:export-xdpi="91.239998"
|
||||
inkscape:export-ydpi="91.239998" />
|
||||
<rect
|
||||
style="fill:#000000;fill-opacity:0.21176471;fill-rule:evenodd;stroke:#000000;stroke-width:1.2500000;stroke-miterlimit:4.0000000;stroke-dasharray:none;stroke-opacity:1.0000000"
|
||||
id="rect3084"
|
||||
width="50.757698"
|
||||
height="95.629486"
|
||||
x="450.34406"
|
||||
y="376.38739"
|
||||
inkscape:export-filename="/tmp/nursery.png"
|
||||
inkscape:export-xdpi="91.239998"
|
||||
inkscape:export-ydpi="91.239998" />
|
||||
<rect
|
||||
style="fill:#000000;fill-opacity:0.21176471;fill-rule:evenodd;stroke:#000000;stroke-width:1.2500000;stroke-miterlimit:4.0000000;stroke-dasharray:none;stroke-opacity:1.0000000"
|
||||
id="rect3086"
|
||||
width="27.900555"
|
||||
height="95.629486"
|
||||
x="501.12524"
|
||||
y="376.38739"
|
||||
inkscape:export-filename="/tmp/nursery.png"
|
||||
inkscape:export-xdpi="91.239998"
|
||||
inkscape:export-ydpi="91.239998" />
|
||||
<path
|
||||
style="fill:none;fill-opacity:0.75000000;fill-rule:evenodd;stroke:#000000;stroke-width:1.2500000;stroke-linecap:butt;stroke-linejoin:miter;marker-end:url(#Arrow2Mend);stroke-miterlimit:4.0000000;stroke-dasharray:none;stroke-opacity:1.0000000"
|
||||
d="M 278.36297,305.36424 C 467.63468,373.52980 467.63468,373.52980 467.63468,373.52980"
|
||||
id="path3088"
|
||||
inkscape:export-filename="/tmp/nursery.png"
|
||||
inkscape:export-xdpi="91.239998"
|
||||
inkscape:export-ydpi="91.239998" />
|
||||
<path
|
||||
style="fill:none;fill-opacity:0.75000000;fill-rule:evenodd;stroke:#000000;stroke-width:1.2500000;stroke-linecap:butt;stroke-linejoin:miter;marker-end:url(#Arrow2Mend);stroke-miterlimit:4.0000000;stroke-dasharray:none;stroke-opacity:1.0000000"
|
||||
d="M 368.98559,305.36818 C 510.35219,374.03095 510.35219,374.03095 510.35219,374.03095"
|
||||
id="path3090"
|
||||
inkscape:export-filename="/tmp/nursery.png"
|
||||
inkscape:export-xdpi="91.239998"
|
||||
inkscape:export-ydpi="91.239998" />
|
||||
<rect
|
||||
style="fill:#000000;fill-opacity:0.21176471;fill-rule:evenodd;stroke:#000000;stroke-width:1.2500000;stroke-miterlimit:4.0000000;stroke-dasharray:none;stroke-opacity:1.0000000"
|
||||
id="rect3092"
|
||||
width="29.686272"
|
||||
height="95.629486"
|
||||
x="529.02173"
|
||||
y="376.38739"
|
||||
inkscape:export-filename="/tmp/nursery.png"
|
||||
inkscape:export-xdpi="91.239998"
|
||||
inkscape:export-ydpi="91.239998" />
|
||||
<path
|
||||
style="fill:none;fill-opacity:0.75000000;fill-rule:evenodd;stroke:#000000;stroke-width:1.2500000;stroke-linecap:butt;stroke-linejoin:miter;marker-end:url(#Arrow2Mend);stroke-miterlimit:4.0000000;stroke-dasharray:none;stroke-opacity:1.0000000"
|
||||
d="M 556.19390,305.83615 C 543.35713,370.53254 543.35713,370.53254 543.35713,370.53254"
|
||||
id="path3096"
|
||||
inkscape:export-filename="/tmp/nursery.png"
|
||||
inkscape:export-xdpi="91.239998"
|
||||
inkscape:export-ydpi="91.239998" />
|
||||
<path
|
||||
style="fill:none;fill-opacity:0.75000000;fill-rule:evenodd;stroke:#000000;stroke-width:1.2500000;stroke-linecap:butt;stroke-linejoin:miter;marker-end:url(#Arrow2Mend);stroke-miterlimit:4.0000000;stroke-dasharray:none;stroke-opacity:1.0000000"
|
||||
d="M 662.57239,304.85879 C 591.02693,373.02510 591.02693,373.02510 591.02693,373.02510"
|
||||
id="path3098"
|
||||
inkscape:export-filename="/tmp/nursery.png"
|
||||
inkscape:export-xdpi="91.239998"
|
||||
inkscape:export-ydpi="91.239998" />
|
||||
<g
|
||||
id="g3135"
|
||||
transform="translate(954.7939,-183.4489)"
|
||||
inkscape:export-filename="/tmp/nursery.png"
|
||||
inkscape:export-xdpi="91.239998"
|
||||
inkscape:export-ydpi="91.239998">
|
||||
<g
|
||||
transform="translate(-460.0000,398.5714)"
|
||||
id="g3137"
|
||||
inkscape:export-filename="/tmp/nursery-pinned.png"
|
||||
inkscape:export-xdpi="91.239998"
|
||||
inkscape:export-ydpi="91.239998">
|
||||
<rect
|
||||
style="fill:#000000;fill-opacity:0.21176471;fill-rule:evenodd;stroke:#000000;stroke-width:1.2500000;stroke-miterlimit:4.0000000;stroke-dasharray:none;stroke-opacity:1.0000000"
|
||||
id="rect3139"
|
||||
width="15.082790"
|
||||
height="13.979280"
|
||||
x="510.61618"
|
||||
y="99.134712"
|
||||
inkscape:export-filename="/tmp/roots.png"
|
||||
inkscape:export-xdpi="91.239998"
|
||||
inkscape:export-ydpi="91.239998" />
|
||||
<text
|
||||
xml:space="preserve"
|
||||
style="font-size:15.756983px;font-style:normal;font-weight:normal;fill:#000000;fill-opacity:1.0000000;stroke:none;stroke-width:1.0000000px;stroke-linecap:butt;stroke-linejoin:miter;stroke-opacity:1.0000000;font-family:Bitstream Vera Sans"
|
||||
x="534.28992"
|
||||
y="110.82124"
|
||||
id="text3141"
|
||||
inkscape:export-filename="/tmp/roots.png"
|
||||
inkscape:export-xdpi="91.239998"
|
||||
inkscape:export-ydpi="91.239998"><tspan
|
||||
sodipodi:role="line"
|
||||
id="tspan3143"
|
||||
x="534.28992"
|
||||
y="110.82124">Live Objects</tspan></text>
|
||||
</g>
|
||||
<g
|
||||
transform="translate(-312.2437,371.4286)"
|
||||
id="g3145"
|
||||
inkscape:export-filename="/tmp/nursery-pinned.png"
|
||||
inkscape:export-xdpi="91.239998"
|
||||
inkscape:export-ydpi="91.239998">
|
||||
<rect
|
||||
style="fill:#000000;fill-opacity:1.0000000;fill-rule:evenodd;stroke:#000000;stroke-width:1.2500000;stroke-miterlimit:4.0000000;stroke-dasharray:none;stroke-opacity:1.0000000"
|
||||
id="rect3147"
|
||||
width="15.082790"
|
||||
height="13.979280"
|
||||
x="510.61618"
|
||||
y="127.17164"
|
||||
inkscape:export-filename="/tmp/roots.png"
|
||||
inkscape:export-xdpi="91.239998"
|
||||
inkscape:export-ydpi="91.239998" />
|
||||
<text
|
||||
xml:space="preserve"
|
||||
style="font-size:15.756983px;font-style:normal;font-weight:normal;fill:#000000;fill-opacity:1.0000000;stroke:none;stroke-width:1.0000000px;stroke-linecap:butt;stroke-linejoin:miter;stroke-opacity:1.0000000;font-family:Bitstream Vera Sans"
|
||||
x="534.28992"
|
||||
y="138.85815"
|
||||
id="text3149"
|
||||
inkscape:export-filename="/tmp/roots.png"
|
||||
inkscape:export-xdpi="91.239998"
|
||||
inkscape:export-ydpi="91.239998"><tspan
|
||||
sodipodi:role="line"
|
||||
id="tspan3151"
|
||||
x="534.28992"
|
||||
y="138.85815">Pinned objects</tspan></text>
|
||||
</g>
|
||||
<g
|
||||
id="g3186"
|
||||
transform="translate(-31.42857,0.000000)"
|
||||
inkscape:export-filename="/tmp/nursery-pinned.png"
|
||||
inkscape:export-xdpi="91.239998"
|
||||
inkscape:export-ydpi="91.239998">
|
||||
<rect
|
||||
style="fill:#000000;fill-opacity:0.0000000;fill-rule:evenodd;stroke:#000000;stroke-width:1.2500000;stroke-miterlimit:4.0000000;stroke-dasharray:none;stroke-opacity:1.0000000"
|
||||
id="rect3155"
|
||||
width="15.082790"
|
||||
height="13.979280"
|
||||
x="392.04477"
|
||||
y="499.49426"
|
||||
inkscape:export-filename="/tmp/roots.png"
|
||||
inkscape:export-xdpi="91.239998"
|
||||
inkscape:export-ydpi="91.239998" />
|
||||
<text
|
||||
xml:space="preserve"
|
||||
style="font-size:15.756983px;font-style:normal;font-weight:normal;fill:#000000;fill-opacity:1.0000000;stroke:none;stroke-width:1.0000000px;stroke-linecap:butt;stroke-linejoin:miter;stroke-opacity:1.0000000;font-family:Bitstream Vera Sans"
|
||||
x="416.38019"
|
||||
y="511.18079"
|
||||
id="text3157"
|
||||
inkscape:export-filename="/tmp/roots.png"
|
||||
inkscape:export-xdpi="91.239998"
|
||||
inkscape:export-ydpi="91.239998"><tspan
|
||||
sodipodi:role="line"
|
||||
id="tspan3159"
|
||||
x="416.38019"
|
||||
y="511.18079">Free Memory</tspan></text>
|
||||
</g>
|
||||
</g>
|
||||
<rect
|
||||
style="opacity:1.0000000;fill:#97ff9f;fill-opacity:0.0000000;fill-rule:evenodd;stroke:#000000;stroke-width:1.4505868;stroke-miterlimit:4.0000000;stroke-dasharray:none;stroke-opacity:1.0000000"
|
||||
id="rect3161"
|
||||
width="669.29736"
|
||||
height="95.744583"
|
||||
x="775.35132"
|
||||
y="348.90802"
|
||||
inkscape:export-filename="/tmp/nursery-pinned.png"
|
||||
inkscape:export-xdpi="91.239998"
|
||||
inkscape:export-ydpi="91.239998" />
|
||||
<rect
|
||||
style="fill:#000000;fill-opacity:1.0000000;fill-rule:evenodd;stroke:#000000;stroke-width:1.2500000;stroke-miterlimit:4.0000000;stroke-dasharray:none;stroke-opacity:1.0000000"
|
||||
id="rect3165"
|
||||
width="18.257698"
|
||||
height="95.629486"
|
||||
x="859.53857"
|
||||
y="348.96558"
|
||||
inkscape:export-filename="/tmp/nursery-pinned.png"
|
||||
inkscape:export-xdpi="91.239998"
|
||||
inkscape:export-ydpi="91.239998" />
|
||||
<rect
|
||||
style="fill:#000000;fill-opacity:1.0000000;fill-rule:evenodd;stroke:#000000;stroke-width:1.2500000;stroke-miterlimit:4.0000000;stroke-dasharray:none;stroke-opacity:1.0000000"
|
||||
id="rect3171"
|
||||
width="27.900555"
|
||||
height="95.629486"
|
||||
x="910.68671"
|
||||
y="348.96558"
|
||||
inkscape:export-filename="/tmp/nursery-pinned.png"
|
||||
inkscape:export-xdpi="91.239998"
|
||||
inkscape:export-ydpi="91.239998" />
|
||||
<rect
|
||||
style="fill:#000000;fill-opacity:1.0000000;fill-rule:evenodd;stroke:#000000;stroke-width:1.2500000;stroke-miterlimit:4.0000000;stroke-dasharray:none;stroke-opacity:1.0000000"
|
||||
id="rect3175"
|
||||
width="27.900555"
|
||||
height="95.629486"
|
||||
x="1211.1458"
|
||||
y="348.96558"
|
||||
inkscape:export-filename="/tmp/nursery-pinned.png"
|
||||
inkscape:export-xdpi="91.239998"
|
||||
inkscape:export-ydpi="91.239998" />
|
||||
<text
|
||||
xml:space="preserve"
|
||||
style="font-size:17.390287px;font-style:normal;font-weight:normal;fill:#000000;fill-opacity:1.0000000;stroke:none;stroke-width:1.0000000px;stroke-linecap:butt;stroke-linejoin:miter;stroke-opacity:1.0000000;font-family:Bitstream Vera Sans"
|
||||
x="776.12061"
|
||||
y="327.97885"
|
||||
id="text3179"
|
||||
inkscape:export-filename="/tmp/nursery-pinned.png"
|
||||
inkscape:export-xdpi="91.239998"
|
||||
inkscape:export-ydpi="91.239998"><tspan
|
||||
sodipodi:role="line"
|
||||
id="tspan3181"
|
||||
x="776.12061"
|
||||
y="327.97885">Nursery</tspan></text>
|
||||
<rect
|
||||
style="fill:#000000;fill-opacity:0.21176471;fill-rule:evenodd;stroke:#000000;stroke-width:1.2500000;stroke-miterlimit:4.0000000;stroke-dasharray:none;stroke-opacity:1.0000000"
|
||||
id="rect3191"
|
||||
width="67.113373"
|
||||
height="95.629486"
|
||||
x="558.71350"
|
||||
y="376.38739"
|
||||
inkscape:export-filename="/tmp/nursery.png"
|
||||
inkscape:export-xdpi="91.239998"
|
||||
inkscape:export-ydpi="91.239998" />
|
||||
<rect
|
||||
style="fill:#000000;fill-opacity:0.21176471;fill-rule:evenodd;stroke:#000000;stroke-width:1.2500000;stroke-miterlimit:4.0000000;stroke-dasharray:none;stroke-opacity:1.0000000"
|
||||
id="rect3193"
|
||||
width="396.27408"
|
||||
height="95.629486"
|
||||
x="26.046309"
|
||||
y="376.15903"
|
||||
inkscape:export-filename="/tmp/nursery.png"
|
||||
inkscape:export-xdpi="91.239998"
|
||||
inkscape:export-ydpi="91.239998" />
|
||||
<text
|
||||
xml:space="preserve"
|
||||
style="font-size:17.390287px;font-style:normal;font-weight:normal;fill:#000000;fill-opacity:1.0000000;stroke:none;stroke-width:1.2500000;stroke-linecap:butt;stroke-linejoin:miter;stroke-opacity:1.0000000;font-family:Bitstream Vera Sans;stroke-miterlimit:4.0000000;stroke-dasharray:none"
|
||||
x="28.444891"
|
||||
y="361.90738"
|
||||
id="text3204"
|
||||
inkscape:export-filename="/tmp/nursery.png"
|
||||
inkscape:export-xdpi="91.239998"
|
||||
inkscape:export-ydpi="91.239998"><tspan
|
||||
sodipodi:role="line"
|
||||
id="tspan3206"
|
||||
x="28.444891"
|
||||
y="361.90738">Old generation</tspan></text>
|
||||
<text
|
||||
xml:space="preserve"
|
||||
style="font-size:18.176956px;font-style:normal;font-weight:normal;fill:#000000;fill-opacity:1.0000000;stroke:none;stroke-width:1.2500000;stroke-linecap:butt;stroke-linejoin:miter;stroke-opacity:1.0000000;font-family:Bitstream Vera Sans;stroke-miterlimit:4.0000000;stroke-dasharray:none"
|
||||
x="58.242008"
|
||||
y="430.84366"
|
||||
id="text3208"
|
||||
inkscape:export-filename="/tmp/nursery.png"
|
||||
inkscape:export-xdpi="91.239998"
|
||||
inkscape:export-ydpi="91.239998"><tspan
|
||||
sodipodi:role="line"
|
||||
id="tspan3210"
|
||||
x="58.242008"
|
||||
y="430.84366">Objects from the previous generation</tspan></text>
|
||||
</g>
|
||||
</svg>
|
||||
|
Before Width: | Height: | Size: 35 KiB |
@@ -1,266 +0,0 @@
|
||||
<?xml version="1.0" encoding="UTF-8" standalone="no"?>
|
||||
<!-- Created with Inkscape (http://www.inkscape.org/) -->
|
||||
<svg
|
||||
xmlns:dc="http://purl.org/dc/elements/1.1/"
|
||||
xmlns:cc="http://web.resource.org/cc/"
|
||||
xmlns:rdf="http://www.w3.org/1999/02/22-rdf-syntax-ns#"
|
||||
xmlns:svg="http://www.w3.org/2000/svg"
|
||||
xmlns="http://www.w3.org/2000/svg"
|
||||
xmlns:sodipodi="http://inkscape.sourceforge.net/DTD/sodipodi-0.dtd"
|
||||
xmlns:inkscape="http://www.inkscape.org/namespaces/inkscape"
|
||||
width="744.09448819"
|
||||
height="1052.3622047"
|
||||
id="svg2324"
|
||||
sodipodi:version="0.32"
|
||||
inkscape:version="0.42.2"
|
||||
sodipodi:docbase="/home/miguel/mono/gc"
|
||||
sodipodi:docname="stacks.svg">
|
||||
<defs
|
||||
id="defs2326">
|
||||
<marker
|
||||
inkscape:stockid="TriangleOutL"
|
||||
orient="auto"
|
||||
refY="0.0"
|
||||
refX="0.0"
|
||||
id="TriangleOutL"
|
||||
style="overflow:visible">
|
||||
<path
|
||||
sodipodi:nodetypes="cccc"
|
||||
id="path2462"
|
||||
d="M 5.77,0.0 L -2.88,5.0 L -2.88,-5.0 L 5.77,0.0 z "
|
||||
style="fill-rule:evenodd;stroke:#000000;stroke-width:1.0pt;marker-start:none"
|
||||
transform="scale(0.8)" />
|
||||
</marker>
|
||||
<marker
|
||||
inkscape:stockid="Arrow1Lstart"
|
||||
orient="auto"
|
||||
refY="0.0"
|
||||
refX="0.0"
|
||||
id="Arrow1Lstart"
|
||||
style="overflow:visible">
|
||||
<path
|
||||
sodipodi:nodetypes="ccccc"
|
||||
id="path2535"
|
||||
d="M 0.0,0.0 L 5.0,-5.0 L -12.5,0.0 L 5.0,5.0 L 0.0,0.0 z "
|
||||
style="fill-rule:evenodd;stroke:#000000;stroke-width:1.0pt;marker-start:none"
|
||||
transform="scale(0.8)" />
|
||||
</marker>
|
||||
</defs>
|
||||
<sodipodi:namedview
|
||||
id="base"
|
||||
pagecolor="#ffffff"
|
||||
bordercolor="#666666"
|
||||
borderopacity="1.0"
|
||||
inkscape:pageopacity="0.0"
|
||||
inkscape:pageshadow="2"
|
||||
inkscape:zoom="0.98994949"
|
||||
inkscape:cx="247.73586"
|
||||
inkscape:cy="588.43222"
|
||||
inkscape:document-units="px"
|
||||
inkscape:current-layer="layer1"
|
||||
inkscape:window-width="1388"
|
||||
inkscape:window-height="998"
|
||||
inkscape:window-x="0"
|
||||
inkscape:window-y="27" />
|
||||
<metadata
|
||||
id="metadata2329">
|
||||
<rdf:RDF>
|
||||
<cc:Work
|
||||
rdf:about="">
|
||||
<dc:format>image/svg+xml</dc:format>
|
||||
<dc:type
|
||||
rdf:resource="http://purl.org/dc/dcmitype/StillImage" />
|
||||
</cc:Work>
|
||||
</rdf:RDF>
|
||||
</metadata>
|
||||
<g
|
||||
inkscape:label="Layer 1"
|
||||
inkscape:groupmode="layer"
|
||||
id="layer1">
|
||||
<rect
|
||||
style="opacity:1.0000000;fill:#97ff9f;fill-opacity:0.0000000;fill-rule:evenodd;stroke:#000000;stroke-width:1.0371026;stroke-miterlimit:4.0000000;stroke-dasharray:none;stroke-opacity:1.0000000"
|
||||
id="rect2332"
|
||||
width="198.44141"
|
||||
height="408.83401"
|
||||
x="46.241261"
|
||||
y="174.59003" />
|
||||
<g
|
||||
id="g2356"
|
||||
transform="translate(-27.27417,130.3097)">
|
||||
<rect
|
||||
y="582.59204"
|
||||
x="312.92154"
|
||||
height="119.77635"
|
||||
width="198.44141"
|
||||
id="rect2342"
|
||||
style="opacity:1.0000000;fill:#3a3a3a;fill-opacity:0.20765026;fill-rule:evenodd;stroke:#000000;stroke-width:0.56134999;stroke-miterlimit:4.0000000;stroke-dasharray:none;stroke-opacity:1.0000000" />
|
||||
<text
|
||||
id="text2344"
|
||||
y="699.81897"
|
||||
x="523.83838"
|
||||
style="font-size:12.000000px;font-style:normal;font-weight:normal;fill:#000000;fill-opacity:1.0000000;stroke:none;stroke-width:1.0000000px;stroke-linecap:butt;stroke-linejoin:miter;stroke-opacity:1.0000000;font-family:Bitstream Vera Sans"
|
||||
xml:space="preserve"><tspan
|
||||
y="699.81897"
|
||||
x="523.83838"
|
||||
id="tspan2346"
|
||||
sodipodi:role="line">stack_start</tspan></text>
|
||||
<text
|
||||
id="text2348"
|
||||
y="593.75293"
|
||||
x="523.83838"
|
||||
style="font-size:12.000000px;font-style:normal;font-weight:normal;fill:#000000;fill-opacity:1.0000000;stroke:none;stroke-width:1.0000000px;stroke-linecap:butt;stroke-linejoin:miter;stroke-opacity:1.0000000;font-family:Bitstream Vera Sans"
|
||||
xml:space="preserve"><tspan
|
||||
y="593.75293"
|
||||
x="523.83838"
|
||||
id="tspan2350"
|
||||
sodipodi:role="line">stack_end</tspan></text>
|
||||
<text
|
||||
id="text2352"
|
||||
y="646.71393"
|
||||
x="366.79654"
|
||||
style="font-size:12.000000px;font-style:normal;font-weight:normal;fill:#000000;fill-opacity:1.0000000;stroke:none;stroke-width:1.0000000px;stroke-linecap:butt;stroke-linejoin:miter;stroke-opacity:1.0000000;font-family:Bitstream Vera Sans"
|
||||
xml:space="preserve"><tspan
|
||||
y="646.71393"
|
||||
x="366.79654"
|
||||
id="tspan2354"
|
||||
sodipodi:role="line">Thread N stack</tspan></text>
|
||||
</g>
|
||||
<rect
|
||||
style="opacity:1.0000000;fill:#3a3a3a;fill-opacity:0.20765026;fill-rule:evenodd;stroke:#000000;stroke-width:0.54655713;stroke-miterlimit:4.0000000;stroke-dasharray:none;stroke-opacity:1.0000000"
|
||||
id="rect2392"
|
||||
width="198.44141"
|
||||
height="113.54674"
|
||||
x="45.884109"
|
||||
y="175.09026" />
|
||||
<rect
|
||||
style="opacity:1.0000000;fill:#3a3a3a;fill-opacity:0.20765026;fill-rule:evenodd;stroke:#000000;stroke-width:0.39553967;stroke-miterlimit:4.0000000;stroke-dasharray:none;stroke-opacity:1.0000000"
|
||||
id="rect2367"
|
||||
width="198.44141"
|
||||
height="59.468048"
|
||||
x="45.734818"
|
||||
y="175.04271" />
|
||||
<text
|
||||
xml:space="preserve"
|
||||
style="font-size:12.000000px;font-style:normal;font-weight:normal;fill:#000000;fill-opacity:1.0000000;stroke:none;stroke-width:1.0000000px;stroke-linecap:butt;stroke-linejoin:miter;stroke-opacity:1.0000000;font-family:Bitstream Vera Sans"
|
||||
x="251.71294"
|
||||
y="231.87846"
|
||||
id="text2369"><tspan
|
||||
sodipodi:role="line"
|
||||
id="tspan2371"
|
||||
x="251.71294"
|
||||
y="231.87846">info->stack_start</tspan></text>
|
||||
<text
|
||||
xml:space="preserve"
|
||||
style="font-size:12.000000px;font-style:normal;font-weight:normal;fill:#000000;fill-opacity:1.0000000;stroke:none;stroke-width:1.0000000px;stroke-linecap:butt;stroke-linejoin:miter;stroke-opacity:1.0000000;font-family:Bitstream Vera Sans"
|
||||
x="251.71294"
|
||||
y="187.96211"
|
||||
id="text2373"><tspan
|
||||
sodipodi:role="line"
|
||||
id="tspan2375"
|
||||
x="251.71294"
|
||||
y="187.96211">info->stack_end</tspan></text>
|
||||
<text
|
||||
xml:space="preserve"
|
||||
style="font-size:12.000000px;font-style:normal;font-weight:normal;fill:#000000;fill-opacity:1.0000000;stroke:none;stroke-width:1.0000000px;stroke-linecap:butt;stroke-linejoin:miter;stroke-opacity:1.0000000;font-family:Bitstream Vera Sans"
|
||||
x="99.609818"
|
||||
y="209.25038"
|
||||
id="text2388"><tspan
|
||||
sodipodi:role="line"
|
||||
id="tspan2390"
|
||||
x="99.609818"
|
||||
y="209.25038">Thread 1 stack</tspan></text>
|
||||
<path
|
||||
style="fill:none;fill-opacity:0.75000000;fill-rule:evenodd;stroke:#000000;stroke-width:0.86822808;stroke-linecap:butt;stroke-linejoin:miter;marker-start:none;marker-end:url(#TriangleOutL);stroke-miterlimit:4.0000000;stroke-dasharray:none;stroke-opacity:1.0000000"
|
||||
d="M 144.95552,246.36741 C 144.95552,277.32787 144.95552,277.32787 144.95552,277.32787"
|
||||
id="path2405" />
|
||||
<text
|
||||
xml:space="preserve"
|
||||
style="font-size:12.000000px;font-style:normal;font-weight:normal;fill:#000000;fill-opacity:1.0000000;stroke:none;stroke-width:1.0000000px;stroke-linecap:butt;stroke-linejoin:miter;stroke-opacity:1.0000000;font-family:Bitstream Vera Sans"
|
||||
x="251.71294"
|
||||
y="284.74033"
|
||||
id="text2553"><tspan
|
||||
sodipodi:role="line"
|
||||
id="tspan2555"
|
||||
x="251.71294"
|
||||
y="284.74033">limit: stack bottom</tspan></text>
|
||||
<g
|
||||
id="g2664"
|
||||
transform="translate(0.134777,113.7128)">
|
||||
<rect
|
||||
y="175.09026"
|
||||
x="45.884109"
|
||||
height="113.54674"
|
||||
width="198.44141"
|
||||
id="rect2666"
|
||||
style="opacity:1.0000000;fill:#3a3a3a;fill-opacity:0.20765026;fill-rule:evenodd;stroke:#000000;stroke-width:0.54655713;stroke-miterlimit:4.0000000;stroke-dasharray:none;stroke-opacity:1.0000000" />
|
||||
<rect
|
||||
y="175.04271"
|
||||
x="45.734818"
|
||||
height="59.468048"
|
||||
width="198.44141"
|
||||
id="rect2668"
|
||||
style="opacity:1.0000000;fill:#3a3a3a;fill-opacity:0.20765026;fill-rule:evenodd;stroke:#000000;stroke-width:0.39553967;stroke-miterlimit:4.0000000;stroke-dasharray:none;stroke-opacity:1.0000000" />
|
||||
<text
|
||||
id="text2670"
|
||||
y="231.87846"
|
||||
x="251.71294"
|
||||
style="font-size:12.000000px;font-style:normal;font-weight:normal;fill:#000000;fill-opacity:1.0000000;stroke:none;stroke-width:1.0000000px;stroke-linecap:butt;stroke-linejoin:miter;stroke-opacity:1.0000000;font-family:Bitstream Vera Sans"
|
||||
xml:space="preserve"><tspan
|
||||
y="231.87846"
|
||||
x="251.71294"
|
||||
id="tspan2672"
|
||||
sodipodi:role="line">info->stack_start</tspan></text>
|
||||
<text
|
||||
id="text2674"
|
||||
y="187.96211"
|
||||
x="251.71294"
|
||||
style="font-size:12.000000px;font-style:normal;font-weight:normal;fill:#000000;fill-opacity:1.0000000;stroke:none;stroke-width:1.0000000px;stroke-linecap:butt;stroke-linejoin:miter;stroke-opacity:1.0000000;font-family:Bitstream Vera Sans"
|
||||
xml:space="preserve"><tspan
|
||||
y="187.96211"
|
||||
x="251.71294"
|
||||
id="tspan2676"
|
||||
sodipodi:role="line">info->stack_end</tspan></text>
|
||||
<text
|
||||
id="text2678"
|
||||
y="209.25038"
|
||||
x="99.609818"
|
||||
style="font-size:12.000000px;font-style:normal;font-weight:normal;fill:#000000;fill-opacity:1.0000000;stroke:none;stroke-width:1.0000000px;stroke-linecap:butt;stroke-linejoin:miter;stroke-opacity:1.0000000;font-family:Bitstream Vera Sans"
|
||||
xml:space="preserve"><tspan
|
||||
y="209.25038"
|
||||
x="99.609818"
|
||||
id="tspan2680"
|
||||
sodipodi:role="line">Thread 2 stack</tspan></text>
|
||||
<path
|
||||
id="path2682"
|
||||
d="M 144.95552,246.36741 C 144.95552,277.32787 144.95552,277.32787 144.95552,277.32787"
|
||||
style="fill:none;fill-opacity:0.75000000;fill-rule:evenodd;stroke:#000000;stroke-width:0.86822808;stroke-linecap:butt;stroke-linejoin:miter;marker-start:none;marker-end:url(#TriangleOutL);stroke-miterlimit:4.0000000;stroke-dasharray:none;stroke-opacity:1.0000000" />
|
||||
<text
|
||||
id="text2684"
|
||||
y="284.74033"
|
||||
x="251.71294"
|
||||
style="font-size:12.000000px;font-style:normal;font-weight:normal;fill:#000000;fill-opacity:1.0000000;stroke:none;stroke-width:1.0000000px;stroke-linecap:butt;stroke-linejoin:miter;stroke-opacity:1.0000000;font-family:Bitstream Vera Sans"
|
||||
xml:space="preserve"><tspan
|
||||
y="284.74033"
|
||||
x="251.71294"
|
||||
id="tspan2686"
|
||||
sodipodi:role="line">limit: stack bottom</tspan></text>
|
||||
</g>
|
||||
<rect
|
||||
style="opacity:1.0000000;fill:#000000;fill-opacity:0.098360606;fill-rule:evenodd;stroke:#000000;stroke-width:0.57452667;stroke-miterlimit:4.0000000;stroke-dasharray:none;stroke-opacity:1.0000000"
|
||||
id="rect2699"
|
||||
width="198.44141"
|
||||
height="125.46541"
|
||||
x="46.136436"
|
||||
y="457.94003" />
|
||||
<text
|
||||
xml:space="preserve"
|
||||
style="font-size:12.000000px;font-style:normal;font-weight:normal;fill:#000000;fill-opacity:1.0000000;stroke:none;stroke-width:1.0000000px;stroke-linecap:butt;stroke-linejoin:miter;stroke-opacity:1.0000000;font-family:Bitstream Vera Sans"
|
||||
x="81.862022"
|
||||
y="523.79871"
|
||||
id="text2701"><tspan
|
||||
sodipodi:role="line"
|
||||
id="tspan2703"
|
||||
x="81.862022"
|
||||
y="523.79871">Program, Data, Heap</tspan></text>
|
||||
</g>
|
||||
</svg>
|
||||
|
Before Width: | Height: | Size: 11 KiB |
@@ -1,113 +0,0 @@
|
||||
|
||||
1. Thread safety of metadata structures
|
||||
----------------------------------------
|
||||
|
||||
1.1 Synchronization of read-only data
|
||||
-------------------------------------
|
||||
|
||||
Read-only data is data which is not modified after creation, like the
|
||||
actual binary metadata in the metadata tables.
|
||||
|
||||
There are three kinds of threads with regards to read-only data:
|
||||
- readers
|
||||
- the creator of the data
|
||||
- the destroyer of the data
|
||||
|
||||
Most threads are readers.
|
||||
|
||||
- synchronization between readers is not neccesary
|
||||
- synchronization between the writers is done using locks.
|
||||
- synchronization between the readers and the creator is done by not exposing
|
||||
the data to readers before it is fully constructed.
|
||||
- synchronization between the readers and the destroyer: TBD.
|
||||
|
||||
1.2 Deadlock prevention plan
|
||||
----------------------------
|
||||
|
||||
Hold locks for the shortest time possible. Avoid calling functions inside
|
||||
locks which might obtain global locks (i.e. locks known outside this module).
|
||||
|
||||
1.3 Locks
|
||||
----------
|
||||
|
||||
1.3.1 Simple locks
|
||||
------------------
|
||||
|
||||
There are a lot of global data structures which can be protected by a 'simple' lock. Simple means:
|
||||
- the lock protects only this data structure or it only protects the data structures in a given C module.
|
||||
An example would be the appdomains list in domain.c
|
||||
- the lock is only held for a short amount of time, and no other lock is acquired inside this simple lock. Thus there is
|
||||
no possibility of deadlock.
|
||||
|
||||
1.3.2 The class loader lock
|
||||
---------------------------
|
||||
|
||||
This locks is held by the class loading routines in class.c and loader.c. It
|
||||
protects the various caches inside MonoImage which are used by these modules.
|
||||
|
||||
1.3.3 The domain lock
|
||||
---------------------
|
||||
|
||||
Each appdomain has a lock which protects the per-domain data structures.
|
||||
|
||||
1.3.4 The locking hierarchy
|
||||
---------------------------
|
||||
|
||||
It is useful to model locks by a locking hierarchy, which is a relation between locks, which is reflexive, transitive,
|
||||
and antisymmetric, in other words, a lattice. If a thread wants to acquire a lock B, while already holding A, it can only
|
||||
do it if A < B. If all threads work this way, then no deadlocks can occur.
|
||||
|
||||
Our locking hierarchy so far looks like this:
|
||||
<DOMAIN LOCK>
|
||||
\
|
||||
<CLASS LOADER LOCK>
|
||||
\ \
|
||||
<SIMPLE LOCK 1> <SIMPLE LOCK 2>
|
||||
|
||||
1.4 Notes
|
||||
----------
|
||||
|
||||
Some common scenarios:
|
||||
- if a function needs to access a data structure, then it should lock it itself, and do not count on its caller locking it.
|
||||
So for example, the image->class_cache hash table would be locked by mono_class_get().
|
||||
|
||||
- there are lots of places where a runtime data structure is created and stored in a cache. In these places, care must be
|
||||
taken to avoid multiple threads creating the same runtime structure, for example, two threads might call mono_class_get ()
|
||||
with the same class name. There are two choices here:
|
||||
|
||||
<enter mutex>
|
||||
<check that item is created>
|
||||
if (created) {
|
||||
<leave mutex>
|
||||
return item
|
||||
}
|
||||
<create item>
|
||||
<store it in cache>
|
||||
<leave mutex>
|
||||
|
||||
This is the easiest solution, but it requires holding the lock for the whole time which might create a scalability problem, and could also lead to deadlock.
|
||||
|
||||
<enter mutex>
|
||||
<check that item is created>
|
||||
<leave mutex>
|
||||
if (created) {
|
||||
return item
|
||||
}
|
||||
<create item>
|
||||
<enter mutex>
|
||||
<check that item is created>
|
||||
if (created) {
|
||||
/* Another thread already created and stored the same item */
|
||||
<free our item>
|
||||
<leave mutex>
|
||||
return orig item
|
||||
}
|
||||
else {
|
||||
<store item in cache>
|
||||
<leave mutex>
|
||||
return item
|
||||
}
|
||||
|
||||
This solution does not present scalability problems, but the created item might be hard to destroy (like a MonoClass).
|
||||
|
||||
- lazy initialization of hashtables etc. is not thread safe
|
||||
-156
@@ -1,156 +0,0 @@
|
||||
|
||||
Threading in Mono
|
||||
=================
|
||||
|
||||
0. Terminology
|
||||
--------------
|
||||
|
||||
"Main thread" - The initial OS-native thread that the
|
||||
application started with.
|
||||
|
||||
"Helper thread" - A native thread created internally
|
||||
by the runtime, such as the finalizer thread, or an
|
||||
asynchronous delegate invocation thread. These
|
||||
threads can run managed code.
|
||||
|
||||
"Primary CLR thread" - The native thread that called
|
||||
the Main() method when executing an assembly.
|
||||
|
||||
"Secondary CLR thread" - A native thread created by a
|
||||
program that instantiates a System.Threading.Thread object
|
||||
and calls its Start() method.
|
||||
|
||||
1. Thread exit behaviour in the standalone mono runtime
|
||||
-------------------------------------------------------
|
||||
|
||||
The correct behaviour of the runtime should be:
|
||||
|
||||
a) If Main() returns, the runtime should wait for all
|
||||
foreground secondary CLR threads to finish. The
|
||||
wording in the class documentation states: "Once all
|
||||
foreground threads belonging to a process have
|
||||
terminated, the common language runtime ends the
|
||||
process by invoking Abort on any background threads
|
||||
that are still alive." Testing seems to indicate that
|
||||
the background thread can't cancel the Abort by
|
||||
catching the ThreadAbortException and calling
|
||||
ResetAbort here. Indeed, not even the finally block
|
||||
seems to be executed.
|
||||
|
||||
b) if any of the primary CLR thread, a secondary CLR
|
||||
thread or a helper thread calls
|
||||
System.Environment.Exit(), the application should
|
||||
terminate immediately without waiting for foreground
|
||||
primary or secondary CLR threads to finish.
|
||||
|
||||
c) if the primary CLR thread throws an uncaught
|
||||
exception, the application should terminate
|
||||
immediately without waiting for secondary CLR threads
|
||||
to finish. This might be implemented internally by
|
||||
pretending that all the running secondary CLR threads
|
||||
are background threads.
|
||||
|
||||
d) if a secondary CLR thread throws an uncaught
|
||||
exception that thread should terminate and all other
|
||||
threads should continue to execute.
|
||||
|
||||
e) if a helper thread throws an uncaught exception and
|
||||
that thread happens to be the GC finalizer thread,
|
||||
testing seems to indicate that the exception stack
|
||||
trace is displayed as normal, and the exception is
|
||||
then ignored (as though there is a try {} catch{}
|
||||
around all finalizers that just prints the stack
|
||||
trace.) Calling Abort() on the GC finalizer thread
|
||||
also does not cause it to exit: it behaves as though
|
||||
the ThreadAbortException is caught and ResetAbort is
|
||||
called. Asynchronous delegate helper threads should
|
||||
behave as secondary CLR threads, but uncaught
|
||||
exceptions should be rethrown on the thread that calls
|
||||
EndInvoke().
|
||||
|
||||
|
||||
The difficulties happen with cases b) and c):
|
||||
|
||||
The current implementation of
|
||||
System.Environment.Exit() calls exit(2) directly,
|
||||
which is rather unfriendly: it prevents any runtime
|
||||
cleanup, statistics gathering, etc. and is pretty
|
||||
obnoxious to embedded code.
|
||||
|
||||
The current exception handling code calls ExitThread()
|
||||
(emulated with pthread_exit() in the io-layer) if an
|
||||
exception is not caught.
|
||||
|
||||
When called from the main thread, both POSIX
|
||||
pthread_exit() and w32 ExitThread() block if there are
|
||||
other threads still running (in the w32 case, if there
|
||||
are other foreground threads still running; threads
|
||||
can set as background.) If the main thread is also
|
||||
the primary CLR thread, then the application will
|
||||
block until all other threads (including helper
|
||||
threads) terminate. Some helper threads will not
|
||||
terminate until specifically told to by the runtime:
|
||||
for example, the GC finalizer thread needs to run
|
||||
until all of the primary and secondary CLR threads
|
||||
have finished.
|
||||
|
||||
Also, if the main thread is also the primary CLR
|
||||
thread, the runtime loses the opportunity to do any
|
||||
cleaning up. Adding a special case to call exit(2)
|
||||
instead of ExitThread() in the primary CLR thread
|
||||
suffers from the same problems as
|
||||
System.Environment.Exit() calling exit(2).
|
||||
|
||||
|
||||
The simple solution is to run the primary CLR thread
|
||||
in a new native thread, leaving the main thread free
|
||||
for housekeeping duties. There still needs to be some
|
||||
special handling for the case where the primary CLR
|
||||
thread fails to catch an exception: the secondary CLR
|
||||
threads then need to be terminated.
|
||||
|
||||
When the primary and secondary CLR threads have all
|
||||
terminated, the helper threads can be killed off and
|
||||
the runtime can clean itself up and exit.
|
||||
|
||||
|
||||
|
||||
2. Thread initialisation
|
||||
------------------------
|
||||
|
||||
Threads have to undergo some initialisation before
|
||||
managed code can be executed. A
|
||||
System.Threading.Thread object must be created, and
|
||||
the thread details need to be stored so that the
|
||||
threads can be managed later. The JIT needs to record
|
||||
the last managed frame stack pointer in a TLS slot,
|
||||
and the current Thread object is also recorded.
|
||||
|
||||
New threads created by managed calls to
|
||||
System.Threading.Thread methods will have all needed
|
||||
initialisation performed. Threads created by the
|
||||
runtime with calls to mono_thread_create() will too.
|
||||
Existing threads can be passed to the runtime; these
|
||||
must call mono_thread_attach() before any CLR code can
|
||||
be executed on that thread.
|
||||
|
||||
|
||||
3. Constraints on embedding the Mono runtime
|
||||
--------------------------------------------
|
||||
|
||||
The discussion above concerning application behaviour
|
||||
in the event of threads terminating, whether by
|
||||
returning from the start function, throwing uncaught
|
||||
exceptions or by calling System.Environment.Exit(),
|
||||
only really applies to the standalone Mono runtime.
|
||||
|
||||
An embedding application should specify what behaviour
|
||||
is required when, for example,
|
||||
System.Environment.Exit() is called. The application
|
||||
is also responsible for its own thread management, and
|
||||
it should be prepared for any of the primary CLR
|
||||
thread or secondary CLR threads to terminate at any
|
||||
time. The application should also take into account
|
||||
that the runtime will create helper threads as needed,
|
||||
as this may cause pthread_exit() or ExitThread() to
|
||||
block indefinitely, as noted above.
|
||||
@@ -1,261 +0,0 @@
|
||||
|
||||
Purpose
|
||||
|
||||
Especially when inlining is active, it can happen that temporary
|
||||
variables add pressure to the register allocator, producing bad
|
||||
code.
|
||||
|
||||
The idea is that some of these temporaries can be totally eliminated
|
||||
my moving the MonoInst tree that defines them directly to the use
|
||||
point in the code (so the name "tree mover").
|
||||
|
||||
Please note that this is *not* an optimization: it is mostly a
|
||||
workaround to issues we have in the regalloc.
|
||||
Actually, with the new linear IR this will not be possible at all
|
||||
(there will be no more trees in the code!).
|
||||
Anyway, this workaround turns out to be useful in the current state
|
||||
of things...
|
||||
|
||||
-----------------------------------------------------------------------
|
||||
|
||||
Base logic
|
||||
|
||||
If a local is defined by a value which is a proper expression (a tree
|
||||
of MonoInst, not just another local or a constant), and this definition
|
||||
is used only once, the tree can be moved directly to the use location,
|
||||
and the definition eliminated.
|
||||
Of course, none of the variables used in the tree must be defined in
|
||||
the code path between the definition and the use, and the tree must be
|
||||
free of side effects.
|
||||
We do not handle the cases when the tree is just a local or a constant
|
||||
because they are handled by copyprop and consprop, respectively.
|
||||
|
||||
To make things simpler, we restrict the tree move to the case when:
|
||||
- the definition and the use are in the same BB, and
|
||||
- the use is followed by another definition in the same BB (it is not
|
||||
possible that the 1st value is used again), or alternatively there
|
||||
is no BB in the whole CFG that contains a use of this local before a
|
||||
definition (so, again, there is no code path that can lead to a
|
||||
subsequent use).
|
||||
|
||||
To handle this, we maintain an ACT array (Available Copy Tree, similar
|
||||
to the ACP), where we store the "state" of every local.
|
||||
Ideally, every local can be in the following state:
|
||||
[E] Undefined (by a tree, it could be in the ACP but we don't care).
|
||||
[D] Defined (by a tree), and waiting for a use.
|
||||
[U] Used, with a tree definition available in the same BB, but still
|
||||
without a definition following the use (always in the same BB).
|
||||
Of course state [E] (empty) is the initial one.
|
||||
|
||||
Besides, there are two sort of "meta states", or flags:
|
||||
[W] Still waiting for a use or definition in this BB (we have seen no
|
||||
occurrence of the local yet).
|
||||
[X] Used without being previously defined in the same BB (note that if
|
||||
there is a definition that precedes the use in the same BB, even if
|
||||
the definition is not a tree or is not available because of side
|
||||
effects or because the tree value has changed the local is not in
|
||||
state [X]).
|
||||
Also note that state [X] is a sort of "global" condition, which if set
|
||||
in one BB will stay valid for the whole CFG, even if the local will
|
||||
otherwise change state. The idea of flagging a local as [X] is that if
|
||||
there is a definition/use pair that reaches the end of a BB, it could
|
||||
be that there is a CFG path that then leads to the BB flagging it as
|
||||
[X] (which contains a use), so the tree cannot be moved.
|
||||
So state [X] will always be set, and never examined in all the state
|
||||
transitions we will describe.
|
||||
In practice, we use flag [W] to set state [X]: if, when traversing a
|
||||
BB, we find a use for a local in state [W], then that local is flagged
|
||||
[X].
|
||||
|
||||
|
||||
For each BB, we initialize all states to [E] and [W], and then we
|
||||
traverse the code one inst at a time, and update the variable states
|
||||
in the ACT in the following ways:
|
||||
|
||||
[Definition]
|
||||
- Flag [W] is cleared.
|
||||
- All "affected trees" are killed (go from state [D] to [E]).
|
||||
The "affected trees" are the trees which contain (use) the defined
|
||||
local, and the rationale is that the tree value changed, so the
|
||||
tree is no longer available.
|
||||
- If the local was in state [U], *that* tree move is marked "safe"
|
||||
(because *this* definition makes us sure that the previous tree
|
||||
cannot be used again in any way).
|
||||
The idea is that "safe" moves can happen even if the local is
|
||||
flagged [X], because the second definition "covers" the use.
|
||||
The tree move is then saved in the "todo" list (and the affecting
|
||||
nodes are cleared).
|
||||
- If the local was defined by a tree, it goes to state [D], the tree
|
||||
is recorded, and all the locals used in it are marked as "affecting
|
||||
this tree" (of course these markers are lists, because each local
|
||||
could affect more than one tree).
|
||||
|
||||
[IndirectDefinition]
|
||||
- All potentially affected trees (in state [D]) are killed.
|
||||
|
||||
[Use]
|
||||
- If the local is still [W], it is flagged [X] (the [W] goes away).
|
||||
- If the local is in state [D], it goes to state [U].
|
||||
The tree move must not yet be recorded in the "todo" list, it still
|
||||
stays in the ACT slot belonging to this local.
|
||||
Anyway, the "affecting" nodes are updated, because now a definition
|
||||
of a local used in this tree will affect only "indirect" (or also
|
||||
"propagated") moves, but not *this* move (see below).
|
||||
- If the local is in state [U], then the tree cannot be moved (it is
|
||||
used two times): the move is canceled, and the state goes [E].
|
||||
- If the local is in state [E], the use is ignored.
|
||||
|
||||
[IndirectUse]
|
||||
- All potentially affected trees (in state [D] or [U]) are killed.
|
||||
|
||||
[SideEffect]
|
||||
- Tree is marked as "unmovable".
|
||||
|
||||
Then, at the end of the BB, for each ACT slot:
|
||||
- If state is [U], the tree move is recorded in the "todo" list, but
|
||||
flagged "unsafe".
|
||||
- Anyway, state goes to [E], the [W] flag is set, and all "affecting"
|
||||
lists are cleared (we get ready to traverse the next BB).
|
||||
Finally, when all BBs has been scanned, we traverse the "todo" list,
|
||||
moving all "safe" entries, and moving "unsafe" ones only if their ACT
|
||||
slot is not flagged [X].
|
||||
|
||||
So far, so good.
|
||||
But there are two issues that make things harder :-(
|
||||
|
||||
The first is the concept of "indirect tree move".
|
||||
It can happen that a tree is scheduled for moving, and its destination
|
||||
is a use that is located in a second tree, which could also be moved.
|
||||
The main issue is that a definition of a variable of the 1st tree on
|
||||
the path between the definition and the use of the 2nd one must prevent
|
||||
the move.
|
||||
But which move? The 1st or the 2nd?
|
||||
Well, any of the two!
|
||||
The point is, the 2nd move must be prevented *only* if the 1st one
|
||||
happens: if it is aborted (for an [X] flag or any other reason), the
|
||||
2nd move is OK, and vice versa...
|
||||
We must handle this in the following way:
|
||||
- The ACT must still remember if a slot is scheduled for moving in
|
||||
this BB, and if it is, all the locals used in the tree.
|
||||
We say that the slot is in state [M].
|
||||
Note that [M] is (like [X] and [W]) a sort of "meta state": a local
|
||||
is flagged [M] when it goes to state [U], and the flag is cleared
|
||||
when the tree move is cancelled
|
||||
- A tree that uses a local whose slot is in state [M] is also using all
|
||||
the locals used by the tree in state [M], but the use is "indirect".
|
||||
These use nodes are also included in the "affecting" lists.
|
||||
- The definition of a variable used in an "indirect" way has the
|
||||
effect of "linking" the two involved tree moves, saying that only one
|
||||
of the two can happen in practice, but not both.
|
||||
- When the 2nd tree is scheduled for moving, the 1st one is *still* in
|
||||
state [M], because a third move could "carry it forward", and all the
|
||||
*three* moves should be mutually exclusive (to be safe!).
|
||||
|
||||
The second tricky complication is the "tree forwarding" that can happen
|
||||
when copyprop is involved.
|
||||
It is conceptually similar to the "indirect tree move".
|
||||
Only, the 2nd tree is not really a tree, it is just the local defined
|
||||
in the 1st tree move.
|
||||
It can happen that copyprop will propagate the definition.
|
||||
We cannot make treeprop do the same job of copyprop, because copyprop
|
||||
has less constraints, and is therefore more powerful in its scope.
|
||||
The main issue is that treeprop cannot propagate a tree to *two* uses,
|
||||
while copyprop is perfectly capable of propagating one definition to
|
||||
two (or more) different places.
|
||||
So we must let copyprop do its job otherwise we'll miss optimizations,
|
||||
but we must also make it play safe with treeprop.
|
||||
Let's clarify with an example:
|
||||
a = v1 + v2; //a is defined by a tree, state [D], uses v2 and v2
|
||||
b = a; //a is used, state [U] with move scheduled, and
|
||||
//b is defined by a, ACP[b] is a, and b is in state [DC]
|
||||
c = b + v3; // b is used, goes to state [U]
|
||||
The real trouble is that copyprop happens *immediately*, while treeprop
|
||||
is deferred to the end of the CFG traversal.
|
||||
So, in the 3rd statement, the "b" is immediately turned into an "a" by
|
||||
copyprop, regardless of what treeprop will do.
|
||||
Anyway, if we are careful, this is not so bad.
|
||||
First of all, we must "accept" the fact that in the 3rd statement the
|
||||
"b" is in fact an "a", as treeprop must happen *after* copyprop.
|
||||
The real problem is that "a" is used twice: in the 2nd and 3rd lines.
|
||||
In our usual setup, the 2nd line would set it to [U], and the 3rd line
|
||||
would kill the move (and set "a" to [E]).
|
||||
I have tried to play tricks, and reason as of copyprop didn't happen,
|
||||
but everything becomes really messy.
|
||||
Instead, we should note that the 2nd line is very likely to be dead.
|
||||
At least in this BB, copyprop will turn all "b"s into "a"s as long as
|
||||
it can, and when it cannot, it will be because either "a" or "b" have
|
||||
been redefined, which would be after the tree move anyway.
|
||||
So, the reasoning gets different: let's pretend that "b" will be dead.
|
||||
This will make the "a" use in the 2nd statement useless, so there we
|
||||
can "reset" "a" to [D], but also take note that if "b" will end up
|
||||
not being dead, the tree move associated to this [D] must be aborted.
|
||||
We can detect this in the following way:
|
||||
- Either "b" is used before being defined in this BB, or
|
||||
- It will be flagged "unsafe".
|
||||
Both things are very easy to check.
|
||||
The only quirk is that the "affecting" lists must not be cleared when
|
||||
a slot goes to state [U], because a "propagation" could put it back
|
||||
to state [D] (where those lists are needed, because it can be killed
|
||||
by a definition to a used slot).
|
||||
|
||||
-----------------------------------------------------------------------
|
||||
|
||||
Implementation notes
|
||||
|
||||
All the implementation runs inside the existing mono_local_cprop
|
||||
function, and a separate memory pool is used to hold the temporary
|
||||
data.
|
||||
|
||||
A struct, MonoTreeMover, contains the pointers to the pool, the ACT,
|
||||
the list of scheduled moves and auxiliary things.
|
||||
This struct is allocated if the tree move pass is requested, and is
|
||||
then passed along to all the involved functions, which are therefore
|
||||
aware of the tree mover state.
|
||||
|
||||
The ACT is an array of slots, obviously one per local.
|
||||
Each slot is of type MonoTreeMoverActSlot, and contains the used and
|
||||
affected locals, a pointer to the pending tree move and the "waiting"
|
||||
and "unsafe" flags.
|
||||
|
||||
The "affecting" lists a built from "dependency nodes", of type
|
||||
MonoTreeMoverDependencyNode.
|
||||
Each of the nodes contains the used and affected local, and is in
|
||||
two lists: the locals used by a slot, and the locals affected by a
|
||||
slot (obviously a different one).
|
||||
So, each node means: "variable x is used in tree t, so a definition
|
||||
of x affects tree t".
|
||||
The "affecting" lists are doubly linked, to allow for O(1) deletion.
|
||||
The "used" lists are simply linked, but when they are mantained there
|
||||
is always a pointer to the last element to allow for O(1) list moving.
|
||||
When a used list is dismissed (which happens often, any time a node is
|
||||
killed), its nodes are unlinked from their respective affecting lists
|
||||
and are then put in a "free" list in the MonoTreeMover to be reused.
|
||||
|
||||
Each tree move is represented by a struct (MonoTreeMoverTreeMove),
|
||||
which contains:
|
||||
- the definition and use points,
|
||||
- the "affected" moves (recall the concept of "indirect tree move"),
|
||||
- the "must be dead" slots (recall "tree forwarding"). and
|
||||
- a few utility flags.
|
||||
The tree moves stays in the relevant ACT slot until it is ready to be
|
||||
scheduled for moving, at which point it is put in a list in the
|
||||
MonoTreeMover.
|
||||
The tree moves structs are reused when they are killed, so there is
|
||||
also a "free" list for them in the MonoTreeMover.
|
||||
|
||||
The tree mover code has been added to all the relevant functions that
|
||||
participate in consprop and copyprop, particularly:
|
||||
- mono_cprop_copy_values takes care of variable uses (transitions from
|
||||
states [D] to [U] and [U] to [E] because of killing),
|
||||
- mono_cprop_invalidate_values takes care of side effects (indirect
|
||||
accesses, calls...),
|
||||
- mono_local_cprop_bb sets up and cleans the traversals for each BB,
|
||||
and for each MonoInst it takes care of variable definitions.
|
||||
To each of them has been added a MonoTreeMover parameter, which is not
|
||||
NULL if the tree mover is running.
|
||||
After mono_local_cprop_bb has run for all BBs, the MonoTreeMover has
|
||||
the list of all the pending moves, which must be walked to actually
|
||||
perform the moves (when possible, because "unsafe" flags, "affected"
|
||||
moves and "must be dead" slots can still have their effects, which
|
||||
must be handled now because they are fully known only at the end of
|
||||
the CFG traversal).
|
||||
@@ -1,135 +0,0 @@
|
||||
Author: Dietmar Maurer ([email protected])
|
||||
(C) 2001 Ximian, Inc.
|
||||
|
||||
More about PInvoke and Internal calls
|
||||
=====================================
|
||||
|
||||
1.) What is PInvoke
|
||||
|
||||
PInvoke stands for Platform Invoke. It is possible to call functions contained
|
||||
in native shared libraries, for example you can declare:
|
||||
|
||||
[DllImport("cygwin1.dll", EntryPoint="puts"]
|
||||
public static extern int puts (string name);
|
||||
|
||||
If you then call "puts(...)" it invokes the native "puts" functions in
|
||||
"cygwin1.dll". It is also possible to specify several marshalling attributes
|
||||
for the arguments, for example you can specify that they puts() function expect
|
||||
ts the string in Ansi encoding by setting the CharSet attribute field:
|
||||
|
||||
[DllImport("cygwin1.dll", EntryPoint="puts", CharSet=CharSet.Ansi)]
|
||||
public static extern int puts (string name);
|
||||
|
||||
2.) What are internal calls
|
||||
|
||||
Some class library functions are implemented in C, because it is either not
|
||||
possible to implement them in C# or because of performance gains. Internal
|
||||
functions are contained in the mono executable itself. Here is an example form
|
||||
our array implementation:
|
||||
|
||||
[MethodImplAttribute(MethodImplOptions.InternalCall)]
|
||||
public extern int GetRank ();
|
||||
|
||||
If you call this GetRank() function it invokes
|
||||
ves_icall_System_Array_GetRank() inside the mono runtime.
|
||||
|
||||
If you write your own runtime environment you can add internal calls with
|
||||
mono_add_internal_call().
|
||||
|
||||
|
||||
2.) Runtime considerations
|
||||
|
||||
Invoking native (unmanaged) code has several implications:
|
||||
|
||||
- We need to handle exceptions inside unmanaged code. The JIT simply saves some
|
||||
informations at each transition from managed to unmanaged code (in a linked
|
||||
list), called Last Managed Frame (LMF). If an exception occurs the runtime
|
||||
first looks if the exception was inside managed code. If not there must be a
|
||||
LMF entry which contains all necessary information to unwind the stack.
|
||||
|
||||
Creation of those LMF structure clearly involves some overhead, so calling
|
||||
into unmanaged code is not as cheap as it looks like at first glance. Maybe
|
||||
we can introduce a special attribute to avoid the creation of LMF on internal
|
||||
call methods that cant raise exceptions.
|
||||
|
||||
- PInvoke has the possibility to convert argument types. For example Strings
|
||||
are marshalled as Char*. So each String argument is translated into a
|
||||
char*. The encoding is specified in the CharSet of the DllImport attribute.
|
||||
|
||||
|
||||
3.) When/how does the runtime call unmanaged PInvoke code
|
||||
|
||||
- LDFTN, CALLI, Delegate::Invoke, Delegate::BeginInvoke: We must generate
|
||||
wrapper code when we load the function with LDFTN, so that all arguments are
|
||||
marshalled in the right format. We also need to save/restore the LMF.
|
||||
|
||||
- MethodBase::Invoke (runtime invoke): We need to marshal all arguments in
|
||||
they right format and save/restore the LMF
|
||||
|
||||
- CALL: We need to marshal all arguments in they right format and save/restore
|
||||
the LMF
|
||||
|
||||
The easiest way to implement this is to always create a wrapper function for
|
||||
PInvoke calls, which takes care of argument marshalling and LMF save/restore.
|
||||
|
||||
4.) When/how does the runtime call unmanaged internal calls
|
||||
|
||||
We don't need to convert any arguments, so we need only take care of the LMF
|
||||
structure.
|
||||
|
||||
- LDFTN, CALLI, Delegate::Invoke, Delegate::BeginInvoke: We must generate
|
||||
wrapper code when we load the function with LDFTN which saves/restores the
|
||||
LMF.
|
||||
|
||||
- MethodBase::Invoke (runtime invoke): We need to save/restore the LMF.
|
||||
|
||||
- CALL: We need to save/restore the LMF.
|
||||
|
||||
- CALLVIRT (through the vtable): We must generate wrapper code to save/restore
|
||||
the LMF.
|
||||
|
||||
Please notice that we can call internal function with CALLVIRT, i.e. we can
|
||||
call those function through a VTable. But we cant know in advance if a vtable
|
||||
slot contains an internal call or managed code. So again it is best to generate
|
||||
a wrapper functions for internal calls in order to save/restore the LMF.
|
||||
|
||||
Unfortunately we need to push all arguments 2 times, because we have to save
|
||||
the LMF, and the LMF is currently allocated on the stack. So the stack looks
|
||||
like:
|
||||
|
||||
--------------------
|
||||
| method arguments |
|
||||
--------------------
|
||||
| LMF |
|
||||
--------------------
|
||||
| copied arguments |
|
||||
--------------------
|
||||
|
||||
AFAIK this is the way ORP works. Another way is to allocate the LMF not on the
|
||||
stack, but then we have additional overhead to allocate/free LMF structures
|
||||
(and another call to arch_get_lmf_addr).
|
||||
|
||||
Maybe it is possible to avoid this addiotional copy for internal calls by
|
||||
including the LMF in the C function signature. Lets say we hav a puts()
|
||||
function which is a internal call:
|
||||
|
||||
ves_icall_puts (MonoString *string);
|
||||
|
||||
If we simply modify that to include the LMF we can avoid to copy all arguments:
|
||||
|
||||
ves_icall_puts (MonoLMF lmf, MonoString *string);
|
||||
|
||||
But this depends somehow on the calling conventions, and I don't know if that
|
||||
works on all plattforms?
|
||||
|
||||
|
||||
5.) What is stored in the LMF
|
||||
|
||||
- all caller saved registers (since we can trust unmanaged code)
|
||||
- the instruction pointer of the last managed instruction
|
||||
- a MonoMethod pointer for the unmanaged function
|
||||
- the address of the thread local lfm_addr pointer (to avoid another call to
|
||||
arch_get_lmf_addr when restoring LMF)
|
||||
|
||||
The LMF is allocated on the stack, so we also know the stack position for
|
||||
stack unwinding.
|
||||
@@ -1,5 +0,0 @@
|
||||
|
||||
Name: Standard libraries in a .NET setup
|
||||
Description: References all the standard .NET libraries for compilation
|
||||
Version: @VERSION@
|
||||
Libs: -r:Accessibility.dll -r:cscompmgd.dll -r:Microsoft.JScript.dll -r:Microsoft.VisualC.dll -r:Microsoft.Vsa.dll -r:System.Configuration.Install.dll -r:System.Data.dll -r:System.Data.OracleClient.dll -r:System.Design.dll -r:System.DirectoryServices.dll -r:System.dll -r:System.Drawing.Design.dll -r:System.Drawing.dll -r:System.EnterpriseServices.dll -r:System.Management.dll -r:System.Messaging.dll -r:System.Runtime.Remoting.dll -r:System.Runtime.Serialization.Formatters.Soap.dll -r:System.Security.dll -r:System.ServiceProcess.dll -r:System.Web.dll -r:System.Web.Services.dll -r:System.Windows.Forms.dll -r:System.Xml.dll
|
||||
Whitespace-only changes.
@@ -1,17 +0,0 @@
|
||||
Permission is hereby granted, free of charge, to any person obtaining a copy
|
||||
of this software and associated documentation files (the "Software"), to
|
||||
deal in the Software without restriction, including without limitation the
|
||||
rights to use, copy, modify, merge, publish, distribute, sublicense, and/or
|
||||
sell copies of the Software, and to permit persons to whom the Software is
|
||||
furnished to do so, subject to the following conditions:
|
||||
|
||||
The above copyright notice and this permission notice shall be included in
|
||||
all copies or substantial portions of the Software.
|
||||
|
||||
THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
|
||||
IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
|
||||
FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
|
||||
AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
|
||||
LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING
|
||||
FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS
|
||||
IN THE SOFTWARE.
|
||||
-909
@@ -1,909 +0,0 @@
|
||||
2007-01-27 Robert Jordan <[email protected]>
|
||||
|
||||
* test/Makefile.am: Add linker option to be able to
|
||||
load symbols from the main program.
|
||||
* test/module.c: Clean-ups.
|
||||
|
||||
2007-01-26 Robert Jordan <[email protected]>
|
||||
|
||||
* configure.ac: Add PLATFORM_WIN32 conditional.
|
||||
* src/Makefile.ac: Use PLATFORM_WIN32 conditional for psapi, iconv
|
||||
* test/module.c, test/tests.h, test/Makefile.am: New test for gmodule.
|
||||
* src/gmodule.h: Add G_MODULE_{IMPORT|EXPORT} defines.
|
||||
* src/gmodule.c (g_module_symbol): Implement in-proc symbol lookup
|
||||
for Win32.
|
||||
* src/gmodule.c: Add GModule.main_module, consider it in
|
||||
g_module_close ().
|
||||
* src/gpath.c (g_get_home_dir): Add dummy Win32 implementation to
|
||||
fix the build.
|
||||
|
||||
2006-11-03 Miguel de Icaza <[email protected]>
|
||||
|
||||
* src/gpath.c (g_path_get_dirname): If the pathname starts with a
|
||||
"/", return the "/".
|
||||
|
||||
* test/string-util.c (test_strlcpy): Add new test.
|
||||
|
||||
* src/gunicode.c (g_filename_from_utf8): g_strlcpy needs the full
|
||||
size, with the extra zero at the end; Fixes the stack trace
|
||||
issue.
|
||||
|
||||
2006-10-30 Miguel de Icaza <[email protected]>
|
||||
|
||||
* test/utf8.c (test_utf8_seq): Add new failing test.
|
||||
|
||||
2006-10-30 Atsushi Enomoto <[email protected]>
|
||||
|
||||
* src/gutf8.c : several fixes:
|
||||
- fixed incorrect mb_size clear and mb_remain computation.
|
||||
- initialize items_written to 0 for error case.
|
||||
- in utf8_to_utf16_len differentiate error messages completely.
|
||||
- in g_utf8_to_utf16 use guchar instead of gchar.
|
||||
* test/utf8.c : added test case string in test_utf8_seq() to
|
||||
both test_utf8_to_utf16() and test_utf16_to_utf8().
|
||||
|
||||
2006-10-21 Miguel de Icaza <[email protected]>
|
||||
|
||||
* src/gunicode.c (g_filename_from_utf8): Use g_strlcpy here.
|
||||
|
||||
* src/gmarkup.c (g_markup_parse_context_parse): Do not dereference
|
||||
null values here. This gets things a little bit further in
|
||||
corlib, but not too far.
|
||||
|
||||
* src/gdir.c (g_dir_read_name): Do not return . or ..
|
||||
|
||||
* src/gstr.c (g_ascii_xdigit_value): Make this into a function,
|
||||
thanks to Paolo for pointing the problem with the double macro
|
||||
expansion.
|
||||
|
||||
* src/gmodule.c (g_module_open): Actually return NULL if we fail
|
||||
to load the module (was hiding the real bug in the pinvoke tests).
|
||||
|
||||
(g_module_build_path): Do not prepend "lib" if the "lib" is part
|
||||
of the call.
|
||||
|
||||
* src/gstr.c (g_strsplit): this routine has some non-expected
|
||||
behavior, if the string begins with the delimiter, it will return
|
||||
an empty first string, unlike strtok
|
||||
|
||||
* src/gpath.c (g_path_get_dirname): Return "." as a dirname for
|
||||
paths that do not contain a directory.
|
||||
|
||||
2006-10-18 Gonzalo Paniagua Javier <[email protected]>
|
||||
|
||||
* test/array.c: new test for insertion in the middle of other values.
|
||||
* src/garray.c: fixed destination index.
|
||||
|
||||
2006-10-18 Miguel de Icaza <[email protected]>
|
||||
|
||||
* src/gpath.c (g_build_path): Do not append terminator if the next
|
||||
string is empty.
|
||||
|
||||
* src/gutf8.c (g_utf8_to_utf16): Include trailing zero as
|
||||
documented.
|
||||
(g_utf16_to_utf8): Include trailing zero as documented.
|
||||
|
||||
2006-10-17 Miguel de Icaza <[email protected]>
|
||||
|
||||
* src/gstr.c (g_strdown): Actually move.
|
||||
|
||||
* src/gmarkup.c (g_markup_parse_context_parse): Accept dots in the
|
||||
sequence, reset the state after a closing element.
|
||||
|
||||
* src/garray.c (g_array_insert_vals): Shift the elements the
|
||||
correct amount.
|
||||
|
||||
(g_array_insert_vals): Should actually use the
|
||||
number of elements to insert.
|
||||
|
||||
* test/array.c: Add new test case, this was happening in the JIT.
|
||||
|
||||
* Add _GNU_SOURCE at configure time, remove from sources.
|
||||
|
||||
* src/gstr.c (g_strsplit): Empty strings return a 0 value vector.
|
||||
|
||||
* src/glib.h (G_MAXINT64, G_MININT64): Add another set of macros
|
||||
for the support stuff.
|
||||
|
||||
Move private prototypes elsewhere
|
||||
|
||||
* src/glib.h (g_thread_init): Adding missing brace
|
||||
(g_list_next): remove ; from the macro definition.
|
||||
|
||||
2006-10-17 Miguel de Icaza <[email protected]>
|
||||
|
||||
* src/gutf8.c: internal methods
|
||||
|
||||
* src/ghashtable.c: internal methods.
|
||||
|
||||
2006-10-16 Miguel de Icaza <[email protected]>
|
||||
|
||||
* src/gerror.c (g_propagate_error): Implement.
|
||||
|
||||
* src/gstr.c (g_strjoinv, g_ascii_strncasecmp): implement.
|
||||
|
||||
* test/string-util.c (test_ascii_strncasecmp): test
|
||||
|
||||
2006-10-15 Miguel de Icaza <[email protected]>
|
||||
|
||||
* configure.in: Fix detection of platforms the [3456] stuff does
|
||||
not work inside autoconf.
|
||||
|
||||
* src/eglib-config.h.in: Make G_BREAKPOINT into a function-macro
|
||||
|
||||
* src/glib.h (offsetof): Mono sources depend on this, bring this
|
||||
from the standard definition. Redefine G_STRUCT_OFFSET in terms
|
||||
of this.
|
||||
|
||||
* src/glib.h (G_STRUCT_OFFSET): fix macro definition.
|
||||
fix typo.
|
||||
|
||||
* src/sizes.c: Add test.
|
||||
|
||||
* src/gshell.c: Make it build
|
||||
|
||||
2006-10-14 Miguel de Icaza <[email protected]>
|
||||
|
||||
* src/glib.h: add various _TO_LE and _FROM_LE macros.
|
||||
|
||||
* test/endian.c: tests for endian conversion macros.
|
||||
|
||||
2006-10-09 Miguel de Icaza <[email protected]>
|
||||
|
||||
* src/gmodule.h: Move definitions of gmodule to gmodule.h because
|
||||
Mono expects it there.
|
||||
|
||||
Mon Oct 9 12:59:16 CEST 2006 Paolo Molaro <[email protected]>
|
||||
|
||||
* src/ghashtable.c: s/to_prime/g_spaced_primes_closest/g
|
||||
and put the array in readonly memory.
|
||||
* src/gstr.c: fixed the build and made array const.
|
||||
* src/gmodule.c: fixed thinko.
|
||||
|
||||
2006-10-08 Miguel de Icaza <[email protected]>
|
||||
|
||||
* src/gstr.c (g_strdup): should allow NULL as an argument.
|
||||
|
||||
2006-10-08 Gonzalo Paniagua Javier <[email protected]>
|
||||
|
||||
* test/string-util.c:
|
||||
* TODO:
|
||||
* src/gstr.c:
|
||||
* src/glib.h: implemented g_strescape.
|
||||
|
||||
2006-10-08 Gonzalo Paniagua Javier <[email protected]>
|
||||
|
||||
* test/string-util.c:
|
||||
* configure.ac:
|
||||
* TODO:
|
||||
* src/gstr.c:
|
||||
* src/glib.h: implemented g_strlcpy.
|
||||
|
||||
2006-10-08 Gonzalo Paniagua Javier <[email protected]>
|
||||
|
||||
* test/string-util.c:
|
||||
* TODO:
|
||||
* src/gstr.c:
|
||||
* src/glib.h: implemented g_strdelimit.
|
||||
|
||||
2006-10-07 Gonzalo Paniagua Javier <[email protected]>
|
||||
|
||||
* test/spawn.c: add search path flag when running ls.
|
||||
* src/gspawn.c: g_spawn_command_line_sync searches the program in the
|
||||
PATH if it's not an absolute path.
|
||||
|
||||
2006-10-07 Gonzalo Paniagua Javier <[email protected]>
|
||||
|
||||
* test/string-util.c:
|
||||
* src/glib.h: implement g_ascii_xdigit_value and tests.
|
||||
|
||||
2006-10-06 Miguel de Icaza <[email protected]>
|
||||
|
||||
* src/gstr.c (g_ascii_strdown): Implement.
|
||||
|
||||
* str/glib.c (g_log_set_handler): empty.
|
||||
(g_printerr): empty.
|
||||
(GMemVTable): define, empty, ignored.
|
||||
(G_USEC_PER_SEC) :-)
|
||||
|
||||
* src/gunicode.c (g_convert): Add bytes_read, bytes_written
|
||||
support; Small fixes to avoid valgrind errors.
|
||||
|
||||
(g_utf8_validate): Add, based on the libxml code.
|
||||
|
||||
gstr.c: implement g_strdown.
|
||||
|
||||
2006-10-05 Miguel de Icaza <[email protected]>
|
||||
|
||||
* src/gunicode.c: Some work in progress to implement g_convert
|
||||
(which is needed by g_locale_to_utf8).
|
||||
|
||||
2006-09-18 Miguel de Icaza <[email protected]>
|
||||
|
||||
* test/string-util.c (test_filename_from_uri): tests for new
|
||||
methods.
|
||||
|
||||
* src/gstr.c (g_filename_to_uri, g_filename_from_uri): implement.
|
||||
|
||||
2006-09-14 Atsushi Enomoto <[email protected]>
|
||||
|
||||
* src/gutf8.c, test/utf8.c : EOL fix.
|
||||
|
||||
2006-09-04 Miguel de Icaza <[email protected]>
|
||||
|
||||
* src/gmarkup.c: The leak fixing commit.
|
||||
|
||||
* src/gmarkup.c (g_markup_parse_context_end_parse): Add missing
|
||||
method.
|
||||
(g_markup_parse_context_free): Implement.
|
||||
(parse_attributes): Store the value, not the attribute name
|
||||
twice.
|
||||
Properly check the /> section.
|
||||
(g_markup_parse_context_parse): When checking for error, use the
|
||||
"error!=NULL && *error != NULL" upon return from callbacks,
|
||||
it is only then that its valid to check for *error for error
|
||||
conditions.
|
||||
(g_markup_parse_context_parse): Add comment processing.
|
||||
|
||||
Only release one element of the list.
|
||||
|
||||
* test/markup.c: Incorporate the kind of code that is used in Mono
|
||||
for domain loading; Will test the rest later.
|
||||
|
||||
2006-09-01 Miguel de Icaza <[email protected]>
|
||||
|
||||
* src/gmarkup.c (g_markup_parse_context_parse): Add text parsing
|
||||
support, and end-element support; not tested yet.
|
||||
|
||||
2006-09-01 Atsushi Enomoto <[email protected]>
|
||||
|
||||
* gutf8.c : bad allocation size. multiply sizeof gchar/gunichar2.
|
||||
|
||||
2006-09-01 Atsushi Enomoto <[email protected]>
|
||||
|
||||
* gutf8.c : when error is null, utf8_to_utf16_len() and
|
||||
utf16_to_utf8_len() could return -1, so return NULL for those
|
||||
cases in g_utf8_to_utf16() and g_utf16_to_utf8().
|
||||
|
||||
2006-09-01 Miguel de Icaza <[email protected]>
|
||||
|
||||
* src/gmarkup.c: Builds and does minimal parsing.
|
||||
|
||||
* test/markup.c: Sample test cases I have been using
|
||||
|
||||
2006-08-31 Atsushi Enomoto <[email protected]>
|
||||
|
||||
* src/gerror.h,
|
||||
src/gerror.c : added g_set_error().
|
||||
* src/gutf8.c :
|
||||
g_utf8_to_utf16() and g_utf16_to_utf8() implementation.
|
||||
* src/glib.h : added all above, and some dependent bits.
|
||||
* src/Makefile.am : added gutf8.c.
|
||||
* TODO: removed above.
|
||||
* test/Makefile.am,
|
||||
test/tests.h : added utf8 tests.
|
||||
* test/utf8.c : test for g_utf8_to_utf16 and g_utf16_to_utf8.
|
||||
It still needs more tests e.g. for multibytes.
|
||||
|
||||
2006-08-31 Gonzalo Paniagua Javier <[email protected]>
|
||||
|
||||
* src/gspawn.c: small touch-ups and make read/write EINTR-proof.
|
||||
|
||||
2006-08-31 Gonzalo Paniagua Javier <[email protected]>
|
||||
|
||||
* test/file.c: remove useless test.
|
||||
|
||||
* test/spawn.c: new g_spawn_async_with_pipes test.
|
||||
* src/glib.h: Modified file.
|
||||
* src/gspawn.c: implemented g_spawn_async_with_pipes. Needs fine tuning.
|
||||
|
||||
2006-08-28 Gonzalo Paniagua Javier <[email protected]>
|
||||
|
||||
* TODO: Modified file.
|
||||
* test/tests.h:
|
||||
* test/pattern.c:
|
||||
* test/dir.c:
|
||||
* test/Makefile.am:
|
||||
* src/Makefile.am:
|
||||
* src/glib.h:
|
||||
* src/gdir.c:
|
||||
* src/gfile.c: implemented g_dir_*, unix version.
|
||||
|
||||
2006-08-27 Gonzalo Paniagua Javier <[email protected]>
|
||||
|
||||
* src/glib.h:
|
||||
* test/Makefile.am: Modified file.
|
||||
* test/tests.h:
|
||||
* src/Makefile.am: Modified file.
|
||||
* test/pattern.c:
|
||||
* src/gpattern.c: implemented the 3 pattern matching functions used.
|
||||
|
||||
* test/ptrarray.c: fix the compare function to work with qsort.
|
||||
|
||||
* test/file.c:
|
||||
* test/path.c:
|
||||
* src/gspawn.c:
|
||||
* src/gpath.c: made valgrind happy.
|
||||
|
||||
2006-08-26 Gonzalo Paniagua Javier <[email protected]>
|
||||
|
||||
* test/file.c:
|
||||
* src/glib.h:
|
||||
* src/gfile.c: implemented g_file_test. Changed the default mask to
|
||||
.XXXXXX. Add tests.
|
||||
|
||||
2006-08-26 Raja R Harinath <[email protected]>
|
||||
|
||||
* src/sort.frag.h (digit): Declare here based on externally
|
||||
provided typedef 'list_node'.
|
||||
(MAX_DIGITS): Use 'sizeof (list_node)'.
|
||||
* src/gslist.c (list_node): Declare instead of 'digit'.
|
||||
* src/glist.c: Likewise.
|
||||
|
||||
* test/slist.c (verify_sort): Verify the length of the list too.
|
||||
(test_slist_sort): Free the correct list.
|
||||
* test/list.c: Likewise.
|
||||
* src/sort.frag.h (MAX_DIGITS): Rename from N_DIGITS.
|
||||
(combine_sort): Change 'max_pos' argument to more natural
|
||||
'n_digits'.
|
||||
(increment): Likewise. Use 'n_digits' to avoid reading at an
|
||||
offset that hasn't been initialized.
|
||||
(do_sort): Remove memset.
|
||||
|
||||
2006-08-25 Gonzalo Paniagua Javier <[email protected]>
|
||||
|
||||
* TODO:
|
||||
* test/file.c:
|
||||
* src/glib.h:
|
||||
* src/gfile.c: implement g_file_open_tmp.
|
||||
|
||||
2006-08-25 Gonzalo Paniagua Javier <[email protected]>
|
||||
|
||||
* TODO:
|
||||
* src/glib.h:
|
||||
* src/gdate.c: New file.
|
||||
* src/gfile.c: New file.
|
||||
* src/Makefile.am: implemented g_file_get_contents and
|
||||
g_get_current_time.
|
||||
|
||||
* test/tests.h:
|
||||
* test/file.c: New file.
|
||||
* test/Makefile.am: tests for the above.
|
||||
|
||||
2006-08-26 Raja R Harinath <[email protected]>
|
||||
|
||||
* src/sort.frag.h: Add copyright notice and some explanation.
|
||||
(increment): Remove null check.
|
||||
(combine_digits): Add 'list' argument to seed the summation.
|
||||
(do_sort): Use the empty or singleton tail as the seed, rather
|
||||
than calling 'increment'.
|
||||
|
||||
2006-08-25 Raja R Harinath <[email protected]>
|
||||
|
||||
* TODO: Remove 'List' entries.
|
||||
* src/Makefile.am (libeglib_la_SOURCES): Add sort.frag.h.
|
||||
* src/sort.frag.h: New. Implements a "generic" bottom-up "counting"
|
||||
mergesort that works both on singly- and doubly-linked lists.
|
||||
* src/gslist.c (g_slist_sort): Use it.
|
||||
* src/glist.c (g_list_sort): Likewise.
|
||||
* src/glib.h (g_slist_sort, g_list_sort): Declare.
|
||||
* test/slist.c, test/list.c: Add basic testcases.
|
||||
|
||||
2006-08-25 Gonzalo Paniagua Javier <[email protected]>
|
||||
|
||||
* src/gspawn.c: propagate errors from reads.
|
||||
* src/gpath.c: an empty PATH is like a NULL one.
|
||||
|
||||
2006-08-25 Gonzalo Paniagua Javier <[email protected]>
|
||||
|
||||
* test/tests.h:
|
||||
* test/timer.c:
|
||||
* test/Makefile.am:
|
||||
* TODO:
|
||||
* src/glib.h:
|
||||
* src/gtimer.c:
|
||||
* src/Makefile.am: implemented GTimer.
|
||||
|
||||
2006-08-25 Gonzalo Paniagua Javier <[email protected]>
|
||||
|
||||
* test/tests.h:
|
||||
* test/Makefile.am:
|
||||
* test/spawn.c:
|
||||
* src/gspawn.c:
|
||||
* src/glib.h:
|
||||
* src/Makefile.am: initial implentation of g_spawn_command_line_sync.
|
||||
Still need better error handling, but works for the most part.
|
||||
|
||||
2006-08-25 Gonzalo Paniagua Javier <[email protected]>
|
||||
|
||||
* src/garray.c: grow faster so that the 'big' test does not crawl.
|
||||
|
||||
2006-08-25 Gonzalo Paniagua Javier <[email protected]>
|
||||
|
||||
* test/shell.c:
|
||||
* src/gqueue.c: plugged leaks.
|
||||
|
||||
2006-08-25 Gonzalo Paniagua Javier <[email protected]>
|
||||
|
||||
* test/path.c:
|
||||
* src/gpath.c: when PATH is not defined, the current dir is used.
|
||||
See execvp(3).
|
||||
|
||||
2006-08-25 Alp Toker <[email protected]>
|
||||
|
||||
* src/gstr.c: g_strv_length() should return guint, not gint
|
||||
* src/glib.h: Add g_strv_length() prototype
|
||||
|
||||
2006-08-24 Miguel de Icaza <[email protected]>
|
||||
|
||||
* src/gpath.c (g_get_home_dir, g_get_tmp_dir, g_get_user_name,
|
||||
g_get_prgname, g_set_prgname): implemented.
|
||||
|
||||
* test/ Fix leaks.
|
||||
|
||||
* src/gpath.c (g_get_current_dir): Implement.
|
||||
|
||||
(g_find_program_in_path, g_path_is_absolute): implement.
|
||||
|
||||
Add g_path_get_dirname, g_path_get_basename
|
||||
|
||||
* src/gpath.c: Path routines
|
||||
|
||||
2006-08-23 Miguel de Icaza <[email protected]>
|
||||
|
||||
* src/gerror.c: Implement.
|
||||
|
||||
* src/glist.c (g_list_sort): Remove routine instead of hoping that
|
||||
it wont crash when we run it.
|
||||
|
||||
2006-08-23 Raja R Harinath <[email protected]>
|
||||
|
||||
* src/glist.c (g_list_insert_before): Avoid non-head declaration.
|
||||
|
||||
* test/slist.c (test_slist_insert_before): Add.
|
||||
* src/gslist.c (g_slist_insert_before): Append if 'sibling' is null.
|
||||
|
||||
* test/list.c (test_list_insert_before): Add test for return value
|
||||
of g_list_insert_before.
|
||||
* test/Makefile.am (test_eglib_LDADD): Refer to the .la file so as
|
||||
to rebuild test if eglib changes.
|
||||
* src/glist.c (new_node, disconnect_node): New helpers that
|
||||
maintain doubly-linked list invariants.
|
||||
(g_list_prepend, g_list_append): Express in terms of new_node.
|
||||
(g_list_insert_before): Likewise. Fix return value when inserting
|
||||
in the middle of the list.
|
||||
(g_list_concat): Reorganize to make more compact.
|
||||
(g_list_nth): Likewise.
|
||||
(g_list_nth_data): Don't segfault if 'n' is too large.
|
||||
(g_list_remove): Rewrite using _find and disconnect_node.
|
||||
(g_list_remove_link): Don't traverse list: use disconnect_node.
|
||||
(g_list_insert_sorted): Rewrite to make more compact. Use new_node.
|
||||
(g_list_copy): Likewise.
|
||||
(_prepend, _concat): Remove.
|
||||
* src/gslist.c (insert_after, find_prev, find_prev_link):
|
||||
New helpers.
|
||||
(g_slist_copy): Simplify slightly, using insert_after.
|
||||
(g_slist_concat): Reorganize to make more compact.
|
||||
(g_slist_find): Likewise.
|
||||
(g_slist_insert_sorted): Likewise.
|
||||
(g_slist_remove): Rewrite using find_prev.
|
||||
(g_slist_remove_link): Rewrite using find_prev_link.
|
||||
(g_slist_remove_all, g_slist_insert_before): New.
|
||||
|
||||
2006-08-21 Duncan Mak <[email protected]>
|
||||
|
||||
* src/gqueue.c: GQueue implementation.
|
||||
* src/glib.h: Add prototypes.
|
||||
* src/Makefile.am (libeglib_la_SOURCES): Include gqueue.c.
|
||||
|
||||
* test/queue.c:
|
||||
* test/Makefile.am (SOURCES):
|
||||
* test/tests.h (DEFINE_TEST_GROUP_INIT_H): add tests for GQueue.
|
||||
|
||||
2006-08-21 Aaron Bockover <[email protected]>
|
||||
|
||||
* src/gstr.c: fixed bug/invalid read/write on malloc-only case (no
|
||||
realloc/delimiter token not found); use memcpy instead of strncpy for
|
||||
better performance
|
||||
|
||||
* test/test.c (run_group): allow running specific tests under a group;
|
||||
added copied g_strsplit/g_strfreev from EGlib source as eg_strsplit
|
||||
and eg_strfreev to avoid performance skews in the driver
|
||||
|
||||
* test/driver.c: allow user-specified group name to contain specific
|
||||
test to run under the group as 'group_name:test1,test2,...testN'
|
||||
|
||||
* test/string-util.c: Added more g_strsplit tests
|
||||
|
||||
* test/slist.c:
|
||||
* test/ptrarray.c:
|
||||
* test/fake.c:
|
||||
* test/string.c:
|
||||
* test/list.c:
|
||||
* test/array.c:
|
||||
* test/hashtable.c: make test names shorter (no need to prefix with
|
||||
the group since it runs under the group)
|
||||
|
||||
2006-08-21 Miguel de Icaza <[email protected]>
|
||||
|
||||
* src/glib.h (g_hash_table_new_full): Add missing prototype.
|
||||
Replace g_free(x) with plain free, so it can be used as a function
|
||||
argument.
|
||||
Add ABS
|
||||
|
||||
* src/ghashtable.c: Add rehashing.
|
||||
|
||||
* test/hashtable.c: Add a bunch of extra tests.
|
||||
|
||||
* src/goutput.c: Fix g_log so it actually formats the data.
|
||||
|
||||
* src/ghashtable.c (g_hash_table_new): The glib test suite
|
||||
uncovered a bunch of bugs, the g_hash_table_new should actually
|
||||
have parameters.
|
||||
|
||||
(g_hash_table_remove, g_hash_table_foreach_remove): Fixed bugs
|
||||
uncovered.
|
||||
|
||||
2006-08-20 Aaron Bockover <[email protected]>
|
||||
|
||||
* src/gmisc.c: added g_setenv, g_getenv, g_unsetenv
|
||||
|
||||
* src/gstr.c: added g_snprintf, g_sprintf, g_fprintf, g_printf
|
||||
|
||||
* src/glib.h: added macros for above va_args printf functions
|
||||
|
||||
* src/Makefile.am: added gmisc.c
|
||||
|
||||
* test/whats-implemented: script to see what needs to be implemented
|
||||
|
||||
2006-08-20 Chris Toshok <[email protected]>
|
||||
|
||||
* test/array.c (test_array_big): add a test from the glib
|
||||
documentation.
|
||||
|
||||
2006-08-20 Chris Toshok <[email protected]>
|
||||
|
||||
* test/tests.h: add array tests to the mix.
|
||||
|
||||
* test/array.c: a few array tests.
|
||||
|
||||
* src/glib.h: add array prototypes.
|
||||
|
||||
* src/garray.c: initial array foo.
|
||||
|
||||
* test/Makefile.am (SOURCES): add array.c
|
||||
|
||||
* src/Makefile.am (libeglib_la_SOURCES): add garray.c
|
||||
|
||||
2006-08-19 Aaron Bockover <[email protected]>
|
||||
|
||||
* src/gstring.c: optimize and generalize reallocation by providing
|
||||
a GROW_IF_NECESSARY macro, do not use strcpy/strcat as they are
|
||||
very, very slow; GString is now much closer to GLib's implementation
|
||||
in terms of performance
|
||||
|
||||
* test/string.c: added speed-specific tests to beat on reallocation code
|
||||
|
||||
* test/test-both: run make if the test drivers don't exist
|
||||
|
||||
2006-08-19 Jonathan Chambers <[email protected]>
|
||||
|
||||
* src/gmodule.c: Add gmodule support for windows and fix
|
||||
windows build. Contribution is licensed as MIT/X11.
|
||||
|
||||
2006-08-19 Aaron Bockover <[email protected]>
|
||||
|
||||
* test/driver.c: Added --debug mode that allows for testing all paths
|
||||
of the driver without actually running real tests; runs only the 'fake'
|
||||
test, which does nothing; useful for running the driver through valgrind
|
||||
|
||||
* test/Makefile.am:
|
||||
* test/tests.h:
|
||||
* test/fake.c: Added fake test for valgrinding the driver
|
||||
|
||||
* test/ptrarray.c: update sort test
|
||||
|
||||
2006-08-19 Aaron Bockover <[email protected]>
|
||||
|
||||
* test/test-both: added --help
|
||||
|
||||
2006-08-19 Aaron Bockover <[email protected]>
|
||||
|
||||
* test/driver.c: added -n mode to show only raw global run times,
|
||||
which is useful for scripts (test-both --speed-compare)
|
||||
|
||||
* test/test-both: added --speed-compare mode
|
||||
|
||||
* test/README: updated with information on --speed-compare
|
||||
|
||||
2006-08-19 Aaron Bockover <[email protected]>
|
||||
|
||||
* test/test.c: do not print times if -t is not passed
|
||||
|
||||
* test/driver.c: removed use of GList from the driver to avoid skews due
|
||||
to performance differences between GLib and EGLib
|
||||
|
||||
2006-08-19 Aaron Bockover <[email protected]>
|
||||
|
||||
* test/test.c: Perform iterations at the test level, only output one
|
||||
report for all iterations of tests in a group to produce more usable
|
||||
output; add timing for the tests and group; added get_timestamp for
|
||||
easy code timing
|
||||
|
||||
* test/test.h: Removed run_test as it should only be called from
|
||||
run_group, added get_timestamp
|
||||
|
||||
* test/Makefile.am: Added -DDRIVER_NAME
|
||||
|
||||
* test/test-both: simple script to run both drivers with the same options
|
||||
|
||||
* test/driver.c: Iterations are now run at the test level, show a global
|
||||
status (OK/FAIL) indicator
|
||||
|
||||
* test/README: Updated
|
||||
|
||||
* configure.ac: Renamed from configure.in as configure.in naming
|
||||
convention is deprecated in favor of configure.ac
|
||||
|
||||
* autogen.sh: s/configure.in/configure.ac/
|
||||
|
||||
2006-08-19 Miguel de Icaza <[email protected]>
|
||||
|
||||
* Makefile.am: Removed MAINTAINERCLEANFILES that was too
|
||||
aggresive, it failed make distcheck and the resulting tarball was
|
||||
not buildable.
|
||||
|
||||
* src/glib.h: remove the various GPOINTER_TO_*, G*_TO_POINTER,
|
||||
GSIZE_FORMAT macros, and move them into src/eglib-config.h
|
||||
|
||||
Moved also gssize and gsize to be arch specific. This should fix
|
||||
the 32/64 problems that Jon Chambers reported.
|
||||
|
||||
* configure.in: test for pointer size, define the various values
|
||||
depending on 32 vs 32/64 worlds, might need further porting in the
|
||||
future.
|
||||
|
||||
Change package name to eglib
|
||||
|
||||
* test/slist.c, test/list.c, test/hashtable.c: Update tests to use
|
||||
FAILURE macro.
|
||||
|
||||
* test/string-util.c: fix leak for valgrind tests.
|
||||
|
||||
* test/tests.h: New size test, for testing datatypes.
|
||||
|
||||
* test/sizes.c: New tests.
|
||||
|
||||
2006-08-19 Aaron Bockover <[email protected]>
|
||||
|
||||
* test/README: Added quick guide on adding new tests/groups to the
|
||||
driver and some examples on how to perform various tests with the driver
|
||||
|
||||
2006-08-18 Aaron Bockover <[email protected]>
|
||||
|
||||
* test/driver.c: Added getopt support and code timing, among other
|
||||
nice features to make testing/profiling easier
|
||||
|
||||
* test/test.c: Add support for suppressing output (quiet) and
|
||||
define RESULT, FAILED, and OK
|
||||
|
||||
* src/glib.h:
|
||||
* src/glist.c: Added g_list_nth_data implementation
|
||||
|
||||
* test/slist.c:
|
||||
* test/string-util.c:
|
||||
* test/ptrarray.c:
|
||||
* test/string.c:
|
||||
* test/hashtable.c:
|
||||
* test/list.c: Use RESULT, FAILURE, and OK for tests
|
||||
|
||||
2006-08-18 Miguel de Icaza <[email protected]>
|
||||
|
||||
* src/gstring.c (g_string_truncate): Implement truncate.
|
||||
(g_string_prepend): implement.
|
||||
|
||||
Fix various bugs uncovered by new tests.
|
||||
|
||||
* src/glib.h: introduce gssize type, the signed one. Important.
|
||||
|
||||
* src/eglib-config.h (G_OS_): Add the G_OS_UNIX and G_OS_WIN32
|
||||
defines that we can use to check on the host OS.
|
||||
|
||||
2006-08-18 Aaron Bockover <[email protected]>
|
||||
|
||||
* test/test.[ch]:
|
||||
* test/driver.c: Support pass/fail logging on tests to show group report
|
||||
|
||||
2006-08-18 Aaron Bockover <[email protected]>
|
||||
|
||||
* test/test.c:
|
||||
* test/test.h: Added result() to be used in place of g_strdup_printf(),
|
||||
it's shorter to write and allows the duped string to be freed safely;
|
||||
added license header to file
|
||||
|
||||
* test/driver.c: Added license header to file
|
||||
|
||||
* test/string-util.c:
|
||||
* test/ptrarray.c:
|
||||
* test/string.c:
|
||||
* test/list.c: Use result() in place of g_strdup_printf(), it's nicer
|
||||
|
||||
2006-08-18 Aaron Bockover <[email protected]>
|
||||
|
||||
* src/gptrarray.c: Implemented g_ptr_array_sort
|
||||
|
||||
* test/ptrarray.c: Added sort test
|
||||
|
||||
* test/driver.c: Added --help; support running N iterations and allow
|
||||
selecting which test groups to run; uses the test group table in tests.h
|
||||
|
||||
* test/tests.h: Added group table
|
||||
|
||||
* test/test.h:
|
||||
* test/test.c: Using a Group structure and table, removed run_groups
|
||||
as we only need run_group now
|
||||
|
||||
* test/slist.h: Removed, not needed, tests/groups defined in tests.h
|
||||
|
||||
2006-08-18 Miguel de Icaza <[email protected]>
|
||||
|
||||
* src/unicode.c: New file, to host unicode code, it will throw as
|
||||
this code is no longer used in the Mono runtime anyways.
|
||||
|
||||
* src/glib.h: Use stdint.h types, a lot of the good stuff is
|
||||
replicated by glib.
|
||||
|
||||
2006-08-18 Duncan Mak <[email protected]>
|
||||
|
||||
* src/glist.c (g_list_remove, g_list_remove_link): Implemented.
|
||||
|
||||
* src/gslist.c (g_slist_remove): Remember to set the next pointer
|
||||
to NULL when the item to remove is the first item in the list.
|
||||
|
||||
2006-08-18 Duncan Mak <[email protected]>
|
||||
|
||||
* src/glist.c: Implemented. Missing remove,
|
||||
remove_link and insert_before.
|
||||
|
||||
* test/list.c: Tests for GList.
|
||||
|
||||
2006-08-17 Aaron Bockover <[email protected]>
|
||||
|
||||
* src/gptrarray.c: Implemented g_ptr_array_remove and
|
||||
g_ptr_array_remove_index
|
||||
|
||||
* test/other: Removed, rewritten in Makefile.am
|
||||
|
||||
* test/Makefile.am: Build test-eglib against local eglib and
|
||||
test-glib against GLib 2.0 (replaces 'other')
|
||||
|
||||
* test/ptrarray.c: Added tests for g_ptr_array_remove and
|
||||
g_ptr_array_remove_index
|
||||
|
||||
2006-08-17 Duncan Mak <[email protected]>
|
||||
|
||||
* src/gslist.c: Added MIT license.
|
||||
(g_slist_insert_sorted): Forgot the case where the data is
|
||||
appended to the end of the list.
|
||||
|
||||
* test/slist.c (test_slist_insert_sorted): Fix the test.
|
||||
|
||||
2006-08-17 Aaron Bockover <[email protected]>
|
||||
|
||||
* src/gptrarray.c: Added g_ptr_array_set_size implementation
|
||||
|
||||
* test/ptrarray.c: Added test for g_ptr_array_set_size
|
||||
|
||||
2006-08-17 Miguel de Icaza <[email protected]>
|
||||
|
||||
* src/glib.h: A handful of extra macros
|
||||
|
||||
* configure.in, src/eglib-config.h.in: Set some system-specific
|
||||
settings that are probed at configure time.
|
||||
|
||||
2006-08-17 Aaron Bockover <[email protected]>
|
||||
|
||||
* src/gptrarray.c: Added beginnings of GPtrArray (alloc, free, add, iterate)
|
||||
|
||||
* src/glib.h: Added GPtrArray signatures
|
||||
|
||||
* src/Makefile.am: Added gptrarray.c to build
|
||||
|
||||
* test/ptrarray.c:
|
||||
* test/tests.h:
|
||||
* test/driver.c:
|
||||
* test/Makefile.am: Add ptrarray tests for available functionality
|
||||
|
||||
2006-08-17 Aaron Bockover <[email protected]>
|
||||
|
||||
* test/test.h:
|
||||
* test/test.c: Added group iterator/test driver functionality
|
||||
|
||||
* test/driver.c: Added groups to run using new test functionality
|
||||
|
||||
* test/slist.h:
|
||||
* test/hashtable.h:
|
||||
* test/string-util.h: Test group definitions for string util/hashtable
|
||||
|
||||
* test/slist.c:
|
||||
* test/str.c:
|
||||
* test/hash.c: Added test definition table
|
||||
|
||||
* test/Makefile.am: Added -Wall -Werror -D_FORTIFY_SOURCE=2
|
||||
|
||||
* src/gstr.c: Added implementation for g_str_has_prefix, g_str_has_suffix
|
||||
|
||||
* src/glib.h: Added missing function signatures
|
||||
|
||||
* src/Makefile.am: added -D_FORTIFY_SOURCE=2
|
||||
|
||||
2006-08-17 Duncan Mak <[email protected]>
|
||||
|
||||
* src/gslist.c (g_slist_remove_link): I misread the function
|
||||
signature. Re-implemented.
|
||||
(g_slist_delete_link): Implemented.
|
||||
(g_slist_reverse): Implemented.
|
||||
(g_slist_insert_sorted): Implemented.
|
||||
|
||||
2006-08-17 Duncan Mak <[email protected]>
|
||||
|
||||
* src/gslist.c (g_slist_find):
|
||||
(g_slist_length):
|
||||
(g_slist_remove):
|
||||
(g_slist_remove_link): Implemented.
|
||||
|
||||
* test/slist.c: Tests for GSList.
|
||||
|
||||
2006-08-17 Raja R Harinath <[email protected]>
|
||||
|
||||
* src/gslist.c (g_slist_free_1): New. Free a single list node.
|
||||
(g_slist_free): Use it to free the list nodes. Don't free the
|
||||
data, since the list doesn't own it.
|
||||
(g_slist_append): Convert into a one-liner.
|
||||
(g_slist_foreach): Remove redundant null check.
|
||||
(g_slist_last): Actually return the last node.
|
||||
(g_slist_copy): Simplify.
|
||||
* src/gslist.h (g_slist_free_1): Add.
|
||||
|
||||
2006-08-16 Duncan Mak <[email protected]>
|
||||
|
||||
* src/gslist.c:
|
||||
|
||||
* src/gslist.h: First attempt at implementing GSList, incomplete.
|
||||
|
||||
* src/Makefile.am (libeglib_la_SOURCES): add gslist.c
|
||||
* src/glib.h: Add GFunc definition. #include the new gslist.h.
|
||||
|
||||
2006-08-16 Miguel de Icaza <[email protected]>
|
||||
|
||||
* src/Makefile.am: Added -Wall,-Werror, corrected lots of
|
||||
mistakes.
|
||||
|
||||
* src/gstring.c: Gstring implementation.
|
||||
|
||||
* test/str.c (test_gstring): string tests.
|
||||
|
||||
2006-08-16 Aaron Bockover <[email protected]>
|
||||
|
||||
* src/gstr.c: Added g_strsplit implementation
|
||||
|
||||
* test/driver.c: Run the split test
|
||||
|
||||
* test/str.c: Added a test for g_strsplit
|
||||
|
||||
* Makefile.am:
|
||||
* src/Makefile.am:
|
||||
* test/Makefile.am: Added MAINTAINERCLEANFILES
|
||||
|
||||
2006-08-16 Miguel de Icaza <[email protected]>
|
||||
|
||||
* src/gouput.c: Implement some output routines, update missing
|
||||
progress.
|
||||
|
||||
* test: Add test driver, and initial tests.
|
||||
|
||||
2006-08-15 Miguel de Icaza <[email protected]>
|
||||
|
||||
* src/ghashtable.c: Implement most of this, it is completely
|
||||
untested at this point.
|
||||
|
||||
@@ -1,4 +0,0 @@
|
||||
SUBDIRS = src test
|
||||
|
||||
EXTRA_DIST = autogen.sh README NEWS AUTHORS ChangeLog
|
||||
|
||||
Whitespace-only changes.
@@ -1,40 +0,0 @@
|
||||
|
||||
The purpose of eglib is to be an X11-licensed subset of glib that can
|
||||
be used with Mono when the Mono runtime is explicitly relicensed under
|
||||
a different license by Novell.
|
||||
|
||||
The implementation is done from the public documentation available here:
|
||||
|
||||
http://developer.gnome.org/doc/API/2.0/glib/
|
||||
|
||||
Currently this is only being built standalone, use:
|
||||
|
||||
./autogen.sh --prefix=/tmp/test
|
||||
|
||||
Currently all the definitions go into a single file: glib.h, there are
|
||||
no separate files, please try to follow the convetions in the source code
|
||||
|
||||
* Tests
|
||||
|
||||
Please read the README in tests/
|
||||
|
||||
* Plans: short and long term.
|
||||
|
||||
The short term plans for eglib is to allow Mono to optionally
|
||||
build with it instead of using glib, gmodule and gthread, but
|
||||
the default build will continue to be done against glib 2.0.
|
||||
|
||||
Our first target is to make this work with Linux, other
|
||||
platforms will follow after that.
|
||||
|
||||
In the long-term (Mono 2.0) we are considering dropping glib
|
||||
as a dependency, considering that Mono requires a modern Unix
|
||||
system to run anyways (for its thread support) it would allow
|
||||
us to fix some of the glib API limitations we have to live
|
||||
with (explicit thread support for example), rework the API to
|
||||
use types from stdint.h and we would be able to drop three
|
||||
external shared libraries.
|
||||
|
||||
This would reduce memory usage for the handful of routines
|
||||
that we use from glib, dynamic linker overhead for those and
|
||||
would allow us to tune the implementation to Mono's needs.
|
||||
-34
@@ -1,34 +0,0 @@
|
||||
* Missing code
|
||||
|
||||
* Process launching
|
||||
3 g_shell_quote
|
||||
1 g_shell_unquote
|
||||
|
||||
----------------------------------------------------------------------
|
||||
|
||||
* Should implement, for better performance:
|
||||
|
||||
Macros:
|
||||
6 G_UNLIKELY
|
||||
4 G_LIKELY
|
||||
|
||||
* Unimplemented, not supported currently:
|
||||
|
||||
g_unichar_tolower Used for deprecated unmanaged string collation
|
||||
g_unichar_type Used for deprecated unmanaged string collation
|
||||
|
||||
* Dead Code
|
||||
|
||||
The GMainLoop code was no longer in use in Mono.
|
||||
|
||||
* Windows implementations needed
|
||||
|
||||
Directory, File manipulation:
|
||||
|
||||
g_dir_open, g_dir_close, g_dir_read_name
|
||||
|
||||
We're missing a native windows implementation. The unix one is in place.
|
||||
|
||||
* Information retrieval
|
||||
1 g_win32_getlocale
|
||||
|
||||
@@ -1,136 +0,0 @@
|
||||
#!/bin/sh
|
||||
# Run this to generate all the initial makefiles, etc.
|
||||
# Ripped off from GNOME macros version
|
||||
|
||||
DIE=0
|
||||
|
||||
srcdir=`dirname $0`
|
||||
test -z "$srcdir" && srcdir=.
|
||||
|
||||
if [ -n "$MONO_PATH" ]; then
|
||||
# from -> /mono/lib:/another/mono/lib
|
||||
# to -> /mono /another/mono
|
||||
for i in `echo ${MONO_PATH} | tr ":" " "`; do
|
||||
i=`dirname ${i}`
|
||||
if [ -n "{i}" -a -d "${i}/share/aclocal" ]; then
|
||||
ACLOCAL_FLAGS="-I ${i}/share/aclocal $ACLOCAL_FLAGS"
|
||||
fi
|
||||
if [ -n "{i}" -a -d "${i}/bin" ]; then
|
||||
PATH="${i}/bin:$PATH"
|
||||
fi
|
||||
done
|
||||
export PATH
|
||||
fi
|
||||
|
||||
(autoconf --version) < /dev/null > /dev/null 2>&1 || {
|
||||
echo
|
||||
echo "**Error**: You must have \`autoconf' installed to compile Mono."
|
||||
echo "Download the appropriate package for your distribution,"
|
||||
echo "or get the source tarball at ftp://ftp.gnu.org/pub/gnu/"
|
||||
DIE=1
|
||||
}
|
||||
|
||||
if [ -z "$LIBTOOL" ]; then
|
||||
LIBTOOL=`which glibtool 2>/dev/null`
|
||||
if [ ! -x "$LIBTOOL" ]; then
|
||||
LIBTOOL=`which libtool`
|
||||
fi
|
||||
fi
|
||||
|
||||
(grep "^AM_PROG_LIBTOOL" $srcdir/configure.ac >/dev/null) && {
|
||||
($LIBTOOL --version) < /dev/null > /dev/null 2>&1 || {
|
||||
echo
|
||||
echo "**Error**: You must have \`libtool' installed to compile Mono."
|
||||
echo "Get ftp://ftp.gnu.org/pub/gnu/libtool-1.2d.tar.gz"
|
||||
echo "(or a newer version if it is available)"
|
||||
DIE=1
|
||||
}
|
||||
}
|
||||
|
||||
grep "^AM_GNU_GETTEXT" $srcdir/configure.ac >/dev/null && {
|
||||
grep "sed.*POTFILES" $srcdir/configure.ac >/dev/null || \
|
||||
(gettext --version) < /dev/null > /dev/null 2>&1 || {
|
||||
echo
|
||||
echo "**Error**: You must have \`gettext' installed to compile Mono."
|
||||
echo "Get ftp://alpha.gnu.org/gnu/gettext-0.10.35.tar.gz"
|
||||
echo "(or a newer version if it is available)"
|
||||
DIE=1
|
||||
}
|
||||
}
|
||||
|
||||
(automake --version) < /dev/null > /dev/null 2>&1 || {
|
||||
echo
|
||||
echo "**Error**: You must have \`automake' installed to compile Mono."
|
||||
echo "Get ftp://ftp.gnu.org/pub/gnu/automake-1.3.tar.gz"
|
||||
echo "(or a newer version if it is available)"
|
||||
DIE=1
|
||||
NO_AUTOMAKE=yes
|
||||
}
|
||||
|
||||
|
||||
# if no automake, don't bother testing for aclocal
|
||||
test -n "$NO_AUTOMAKE" || (aclocal --version) < /dev/null > /dev/null 2>&1 || {
|
||||
echo
|
||||
echo "**Error**: Missing \`aclocal'. The version of \`automake'"
|
||||
echo "installed doesn't appear recent enough."
|
||||
echo "Get ftp://ftp.gnu.org/pub/gnu/automake-1.3.tar.gz"
|
||||
echo "(or a newer version if it is available)"
|
||||
DIE=1
|
||||
}
|
||||
|
||||
if test "$DIE" -eq 1; then
|
||||
exit 1
|
||||
fi
|
||||
|
||||
if test -z "$*"; then
|
||||
echo "**Warning**: I am going to run \`configure' with no arguments."
|
||||
echo "If you wish to pass any to it, please specify them on the"
|
||||
echo \`$0\'" command line."
|
||||
echo
|
||||
fi
|
||||
|
||||
case $CC in
|
||||
xlc )
|
||||
am_opt=--include-deps;;
|
||||
esac
|
||||
|
||||
|
||||
if grep "^AM_PROG_LIBTOOL" configure.ac >/dev/null; then
|
||||
if test -z "$NO_LIBTOOLIZE" ; then
|
||||
echo "Running libtoolize..."
|
||||
${LIBTOOL}ize --force --copy
|
||||
fi
|
||||
fi
|
||||
|
||||
echo "Running aclocal $ACLOCAL_FLAGS ..."
|
||||
aclocal $ACLOCAL_FLAGS || {
|
||||
echo
|
||||
echo "**Error**: aclocal failed. This may mean that you have not"
|
||||
echo "installed all of the packages you need, or you may need to"
|
||||
echo "set ACLOCAL_FLAGS to include \"-I \$prefix/share/aclocal\""
|
||||
echo "for the prefix where you installed the packages whose"
|
||||
echo "macros were not found"
|
||||
exit 1
|
||||
}
|
||||
|
||||
if grep "^AM_CONFIG_HEADER" configure.ac >/dev/null; then
|
||||
echo "Running autoheader..."
|
||||
autoheader || { echo "**Error**: autoheader failed."; exit 1; }
|
||||
fi
|
||||
|
||||
echo "Running automake --gnu $am_opt ..."
|
||||
automake --add-missing --gnu $am_opt ||
|
||||
{ echo "**Error**: automake failed."; exit 1; }
|
||||
echo "Running autoconf ..."
|
||||
autoconf || { echo "**Error**: autoconf failed."; exit 1; }
|
||||
|
||||
|
||||
conf_flags="--enable-maintainer-mode --enable-compile-warnings" #--enable-iso-c
|
||||
|
||||
if test x$NOCONFIGURE = x; then
|
||||
echo Running $srcdir/configure $conf_flags "$@" ...
|
||||
$srcdir/configure $conf_flags "$@" \
|
||||
&& echo Now type \`make\' to compile $PKG_NAME || exit 1
|
||||
else
|
||||
echo Skipping configure process.
|
||||
fi
|
||||
@@ -1,83 +0,0 @@
|
||||
AC_INIT(README)
|
||||
AC_CANONICAL_SYSTEM
|
||||
|
||||
AM_CONFIG_HEADER(config.h)
|
||||
AM_INIT_AUTOMAKE(eglib,0.1)
|
||||
AM_MAINTAINER_MODE
|
||||
|
||||
AC_PROG_CC
|
||||
AM_PROG_LIBTOOL
|
||||
CFLAGS='-g -O0 -D_GNU_SOURCE'
|
||||
AC_SUBST(CFLAGS)
|
||||
GNUC_PRETTY=
|
||||
GNUC_UNUSED=
|
||||
BREAKPOINT="G_STMT_START { } G_STMT_END"
|
||||
if test x$GCC = xyes; then
|
||||
GNUC_UNUSED='__attribute__((__unused__))'
|
||||
GNUC_NORETURN='__attribute__((__noreturn__))'
|
||||
echo targte_cpu=$target_cpu
|
||||
case $target_cpu in
|
||||
i*86) BREAKPOINT="G_STMT_START { __asm__ (\"int \$03\"); } G_STMT_END" ;;
|
||||
esac
|
||||
fi
|
||||
AC_SUBST(GNUC_PRETTY)
|
||||
AC_SUBST(GNUC_UNUSED)
|
||||
AC_SUBST(GNUC_NORETURN)
|
||||
AC_SUBST(BREAKPOINT)
|
||||
|
||||
AC_C_BIGENDIAN([ORDER=G_BIG_ENDIAN],[ORDER=G_LITTLE_ENDIAN])
|
||||
AC_SUBST(ORDER)
|
||||
|
||||
case $host in
|
||||
*-*-msdos* | *-*-go32* | *-*-mingw32* | *-*-cygwin* | *-*-windows*)
|
||||
PATHSEP='\\'
|
||||
SEARCHSEP=';'
|
||||
OS="WIN32"
|
||||
;;
|
||||
*)
|
||||
PATHSEP='/'
|
||||
SEARCHSEP=':'
|
||||
OS="UNIX"
|
||||
;;
|
||||
esac
|
||||
|
||||
AC_SUBST(PATHSEP)
|
||||
AC_SUBST(SEARCHSEP)
|
||||
AC_SUBST(OS)
|
||||
AM_CONDITIONAL(PLATFORM_WIN32, test x$OS = xWIN32)
|
||||
|
||||
AC_CHECK_SIZEOF(int)
|
||||
AC_CHECK_SIZEOF(void *)
|
||||
AC_CHECK_FUNCS(strlcpy)
|
||||
|
||||
if test $ac_cv_sizeof_void_p != $ac_cv_sizeof_int; then
|
||||
GPOINTER_TO_INT="((gint)(long) (ptr))"
|
||||
GPOINTER_TO_UINT="((guint)(long) (ptr))"
|
||||
GINT_TO_POINTER="((gpointer)(glong) (v))"
|
||||
GUINT_TO_POINTER="((gpointer)(gulong) (v))"
|
||||
GSIZE="long"
|
||||
GSIZE_FORMAT='"lu"'
|
||||
G_GUINT64_FORMAT='"lu"'
|
||||
else
|
||||
GPOINTER_TO_INT="((gint) (ptr))"
|
||||
GPOINTER_TO_UINT="((guint) (ptr))"
|
||||
GINT_TO_POINTER="((gpointer) (v))"
|
||||
GUINT_TO_POINTER="((gpointer) (v))"
|
||||
GSIZE="int"
|
||||
GSIZE_FORMAT='"u"'
|
||||
G_GUINT64_FORMAT='"llu"'
|
||||
fi
|
||||
AC_SUBST(GPOINTER_TO_INT)
|
||||
AC_SUBST(GPOINTER_TO_UINT)
|
||||
AC_SUBST(GINT_TO_POINTER)
|
||||
AC_SUBST(GUINT_TO_POINTER)
|
||||
AC_SUBST(GSIZE)
|
||||
AC_SUBST(GSIZE_FORMAT)
|
||||
AC_SUBST(G_GUINT64_FORMAT)
|
||||
|
||||
AC_OUTPUT([
|
||||
Makefile
|
||||
src/Makefile
|
||||
src/eglib-config.h
|
||||
test/Makefile
|
||||
])
|
||||
@@ -1,45 +0,0 @@
|
||||
noinst_LTLIBRARIES = libeglib.la
|
||||
|
||||
libeglib_la_SOURCES = \
|
||||
eglib-config.h \
|
||||
sort.frag.h \
|
||||
glib.h \
|
||||
garray.c \
|
||||
gerror.c \
|
||||
ghashtable.c \
|
||||
gmem.c \
|
||||
gmodule.c \
|
||||
gmodule.h \
|
||||
goutput.c \
|
||||
gstr.c \
|
||||
gslist.c \
|
||||
gstring.c \
|
||||
gptrarray.c \
|
||||
glist.c \
|
||||
gmisc.c \
|
||||
gqueue.c \
|
||||
gpath.c \
|
||||
gshell.c \
|
||||
gspawn.c \
|
||||
gtimer.c \
|
||||
gdate.c \
|
||||
gfile.c \
|
||||
gpattern.c \
|
||||
gdir.c \
|
||||
gmarkup.c \
|
||||
gutf8.c \
|
||||
gunicode.c
|
||||
|
||||
libeglib_la_CFLAGS = -Wall -Werror -D_FORTIFY_SOURCE=2
|
||||
|
||||
INCLUDES = -I$(srcdir)
|
||||
|
||||
if PLATFORM_WIN32
|
||||
libeglib_la_LIBADD = -lm -liconv -lpsapi
|
||||
else
|
||||
libeglib_la_LIBADD = -lm
|
||||
endif
|
||||
|
||||
MAINTAINERCLEANFILES = Makefile.in
|
||||
|
||||
EXTRA_DIST = eglib-config.h.in
|
||||
@@ -1,23 +0,0 @@
|
||||
/*
|
||||
* System-dependent settings
|
||||
*/
|
||||
#define G_GNUC_PRETTY_FUNCTION @GNUC_PRETTY@
|
||||
#define G_GNUC_UNUSED @GNUC_UNUSED@
|
||||
#define G_BYTE_ORDER @ORDER@
|
||||
#define G_GNUC_NORETURN @GNUC_NORETURN@
|
||||
#define G_SEARCHPATH_SEPARATOR_S "@SEARCHSEP@"
|
||||
#define G_SEARCHPATH_SEPARATOR '@SEARCHSEP@'
|
||||
#define G_DIR_SEPARATOR '@PATHSEP@'
|
||||
#define G_DIR_SEPARATOR_S "@PATHSEP@"
|
||||
#define G_BREAKPOINT() @BREAKPOINT@
|
||||
#define G_OS_@OS@
|
||||
#define GPOINTER_TO_INT(ptr) @GPOINTER_TO_INT@
|
||||
#define GPOINTER_TO_UINT(ptr) @GPOINTER_TO_UINT@
|
||||
#define GINT_TO_POINTER(v) @GINT_TO_POINTER@
|
||||
#define GUINT_TO_POINTER(v) @GUINT_TO_POINTER@
|
||||
|
||||
typedef unsigned @GSIZE@ gsize;
|
||||
typedef signed @GSIZE@ gssize;
|
||||
|
||||
#define G_GSIZE_FORMAT @GSIZE_FORMAT@
|
||||
#define G_GUINT64_FORMAT @G_GUINT64_FORMAT@
|
||||
@@ -1,183 +0,0 @@
|
||||
/*
|
||||
* Arrays
|
||||
*
|
||||
* Author:
|
||||
* Chris Toshok ([email protected])
|
||||
*
|
||||
* (C) 2006 Novell, Inc.
|
||||
*
|
||||
* Permission is hereby granted, free of charge, to any person obtaining
|
||||
* a copy of this software and associated documentation files (the
|
||||
* "Software"), to deal in the Software without restriction, including
|
||||
* without limitation the rights to use, copy, modify, merge, publish,
|
||||
* distribute, sublicense, and/or sell copies of the Software, and to
|
||||
* permit persons to whom the Software is furnished to do so, subject to
|
||||
* the following conditions:
|
||||
*
|
||||
* The above copyright notice and this permission notice shall be
|
||||
* included in all copies or substantial portions of the Software.
|
||||
*
|
||||
* THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND,
|
||||
* EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
|
||||
* MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND
|
||||
* NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE
|
||||
* LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION
|
||||
* OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION
|
||||
* WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
|
||||
*/
|
||||
|
||||
#include <stdlib.h>
|
||||
#include <glib.h>
|
||||
|
||||
#define INITIAL_CAPACITY 16
|
||||
|
||||
#define element_offset(p,i) ((p)->array.data + (i) * (p)->element_size)
|
||||
#define element_length(p,i) ((i) * (p)->element_size)
|
||||
|
||||
typedef struct {
|
||||
GArray array;
|
||||
gboolean clear_;
|
||||
gboolean element_size;
|
||||
gboolean zero_terminated;
|
||||
gint capacity;
|
||||
} GArrayPriv;
|
||||
|
||||
static void
|
||||
ensure_capacity (GArrayPriv *priv,
|
||||
int capacity)
|
||||
{
|
||||
int new_capacity = MAX (priv->capacity, INITIAL_CAPACITY);
|
||||
|
||||
if (capacity < priv->capacity)
|
||||
return;
|
||||
|
||||
while (new_capacity < capacity) {
|
||||
new_capacity <<= 1;
|
||||
}
|
||||
capacity = new_capacity;
|
||||
priv->array.data = (gchar*)g_realloc (priv->array.data, element_length (priv, capacity));
|
||||
|
||||
if (priv->clear_) {
|
||||
memset (element_offset (priv, priv->capacity),
|
||||
0,
|
||||
element_length (priv, capacity - priv->capacity));
|
||||
}
|
||||
priv->capacity = capacity;
|
||||
}
|
||||
|
||||
GArray *
|
||||
g_array_new (gboolean zero_terminated,
|
||||
gboolean clear_,
|
||||
guint element_size)
|
||||
{
|
||||
GArrayPriv *rv = g_new0 (GArrayPriv, 1);
|
||||
rv->zero_terminated = zero_terminated;
|
||||
rv->clear_ = clear_;
|
||||
rv->element_size = element_size;
|
||||
|
||||
ensure_capacity (rv, INITIAL_CAPACITY);
|
||||
|
||||
return (GArray*)rv;
|
||||
}
|
||||
|
||||
gchar*
|
||||
g_array_free (GArray *array,
|
||||
gboolean free_segment)
|
||||
{
|
||||
gchar* rv = NULL;
|
||||
|
||||
g_return_val_if_fail (array != NULL, NULL);
|
||||
|
||||
if (free_segment)
|
||||
g_free (array->data);
|
||||
else
|
||||
rv = array->data;
|
||||
|
||||
g_free (array);
|
||||
|
||||
return rv;
|
||||
}
|
||||
|
||||
GArray *
|
||||
g_array_append_vals (GArray *array,
|
||||
gconstpointer data,
|
||||
guint len)
|
||||
{
|
||||
GArrayPriv *priv = (GArrayPriv*)array;
|
||||
|
||||
g_return_val_if_fail (array != NULL, NULL);
|
||||
|
||||
ensure_capacity (priv, priv->array.len + len + (priv->zero_terminated ? 1 : 0));
|
||||
|
||||
memmove (element_offset (priv, priv->array.len),
|
||||
data,
|
||||
element_length (priv, len));
|
||||
|
||||
priv->array.len += len;
|
||||
|
||||
if (priv->zero_terminated) {
|
||||
memset (element_offset (priv, priv->array.len),
|
||||
0,
|
||||
priv->element_size);
|
||||
}
|
||||
|
||||
return array;
|
||||
}
|
||||
|
||||
GArray*
|
||||
g_array_insert_vals (GArray *array,
|
||||
guint index_,
|
||||
gconstpointer data,
|
||||
guint len)
|
||||
{
|
||||
GArrayPriv *priv = (GArrayPriv*)array;
|
||||
guint extra = (priv->zero_terminated ? 1 : 0);
|
||||
|
||||
g_return_val_if_fail (array != NULL, NULL);
|
||||
|
||||
ensure_capacity (priv, array->len + len + extra);
|
||||
|
||||
/* first move the existing elements out of the way */
|
||||
memmove (element_offset (priv, index_ + len),
|
||||
element_offset (priv, index_),
|
||||
element_length (priv, array->len - index_));
|
||||
|
||||
/* then copy the new elements into the array */
|
||||
memmove (element_offset (priv, index_),
|
||||
data,
|
||||
element_length (priv, len));
|
||||
|
||||
array->len += len;
|
||||
|
||||
if (priv->zero_terminated) {
|
||||
memset (element_offset (priv, priv->array.len),
|
||||
0,
|
||||
priv->element_size);
|
||||
}
|
||||
|
||||
return array;
|
||||
}
|
||||
|
||||
GArray*
|
||||
g_array_remove_index (GArray *array,
|
||||
guint index_)
|
||||
{
|
||||
GArrayPriv *priv = (GArrayPriv*)array;
|
||||
|
||||
g_return_val_if_fail (array != NULL, NULL);
|
||||
|
||||
memmove (element_offset (priv, index_),
|
||||
element_offset (priv, index_ + 1),
|
||||
element_length (priv, array->len - index_));
|
||||
|
||||
array->len --;
|
||||
|
||||
if (priv->zero_terminated) {
|
||||
memset (element_offset (priv, priv->array.len),
|
||||
0,
|
||||
priv->element_size);
|
||||
}
|
||||
|
||||
return array;
|
||||
}
|
||||
|
||||
@@ -1,42 +0,0 @@
|
||||
/*
|
||||
* Date and time utility functions.
|
||||
*
|
||||
* Author:
|
||||
* Gonzalo Paniagua Javier ([email protected]
|
||||
*
|
||||
* (C) 2006 Novell, Inc.
|
||||
*
|
||||
* Permission is hereby granted, free of charge, to any person obtaining
|
||||
* a copy of this software and associated documentation files (the
|
||||
* "Software"), to deal in the Software without restriction, including
|
||||
* without limitation the rights to use, copy, modify, merge, publish,
|
||||
* distribute, sublicense, and/or sell copies of the Software, and to
|
||||
* permit persons to whom the Software is furnished to do so, subject to
|
||||
* the following conditions:
|
||||
*
|
||||
* The above copyright notice and this permission notice shall be
|
||||
* included in all copies or substantial portions of the Software.
|
||||
*
|
||||
* THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND,
|
||||
* EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
|
||||
* MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND
|
||||
* NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE
|
||||
* LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION
|
||||
* OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION
|
||||
* WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
|
||||
*/
|
||||
#include <stdio.h>
|
||||
#include <glib.h>
|
||||
#include <sys/time.h>
|
||||
|
||||
void
|
||||
g_get_current_time (GTimeVal *result)
|
||||
{
|
||||
struct timeval tv;
|
||||
|
||||
g_return_if_fail (result != NULL);
|
||||
gettimeofday (&tv, NULL);
|
||||
result->tv_sec = tv.tv_sec;
|
||||
result->tv_usec = tv.tv_usec;
|
||||
}
|
||||
|
||||
@@ -1,110 +0,0 @@
|
||||
/*
|
||||
* Directory utility functions.
|
||||
*
|
||||
* Author:
|
||||
* Gonzalo Paniagua Javier ([email protected])
|
||||
*
|
||||
* (C) 2006 Novell, Inc.
|
||||
*
|
||||
* Permission is hereby granted, free of charge, to any person obtaining
|
||||
* a copy of this software and associated documentation files (the
|
||||
* "Software"), to deal in the Software without restriction, including
|
||||
* without limitation the rights to use, copy, modify, merge, publish,
|
||||
* distribute, sublicense, and/or sell copies of the Software, and to
|
||||
* permit persons to whom the Software is furnished to do so, subject to
|
||||
* the following conditions:
|
||||
*
|
||||
* The above copyright notice and this permission notice shall be
|
||||
* included in all copies or substantial portions of the Software.
|
||||
*
|
||||
* THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND,
|
||||
* EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
|
||||
* MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND
|
||||
* NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE
|
||||
* LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION
|
||||
* OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION
|
||||
* WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
|
||||
*/
|
||||
#include <glib.h>
|
||||
#include <stdio.h>
|
||||
#include <stdlib.h>
|
||||
#include <unistd.h>
|
||||
#include <errno.h>
|
||||
#include <sys/types.h>
|
||||
#include <sys/stat.h>
|
||||
#include <dirent.h>
|
||||
|
||||
struct _GDir {
|
||||
#ifdef G_OS_WIN32
|
||||
#else
|
||||
DIR *dir;
|
||||
#endif
|
||||
};
|
||||
|
||||
GDir *
|
||||
g_dir_open (const gchar *path, guint flags, GError **error)
|
||||
{
|
||||
#ifdef G_OS_WIN32
|
||||
return NULL;
|
||||
#else
|
||||
GDir *dir;
|
||||
|
||||
g_return_val_if_fail (path != NULL, NULL);
|
||||
g_return_val_if_fail (error == NULL || *error == NULL, NULL);
|
||||
|
||||
(void) flags; /* this is not used */
|
||||
dir = g_new (GDir, 1);
|
||||
dir->dir = opendir (path);
|
||||
if (dir->dir == NULL) {
|
||||
if (error) {
|
||||
gint err = errno;
|
||||
*error = g_error_new (G_LOG_DOMAIN, g_file_error_from_errno (err), strerror (err));
|
||||
}
|
||||
g_free (dir);
|
||||
return NULL;
|
||||
}
|
||||
return dir;
|
||||
#endif
|
||||
}
|
||||
|
||||
const gchar *
|
||||
g_dir_read_name (GDir *dir)
|
||||
{
|
||||
#ifdef G_OS_WIN32
|
||||
return NULL;
|
||||
#else
|
||||
struct dirent *entry;
|
||||
|
||||
g_return_val_if_fail (dir != NULL && dir->dir != NULL, NULL);
|
||||
do {
|
||||
entry = readdir (dir->dir);
|
||||
if (entry == NULL)
|
||||
return NULL;
|
||||
} while ((strcmp (entry->d_name, ".") == 0) || (strcmp (entry->d_name, "..") == 0));
|
||||
|
||||
return entry->d_name;
|
||||
#endif
|
||||
}
|
||||
|
||||
void
|
||||
g_dir_rewind (GDir *dir)
|
||||
{
|
||||
#ifdef G_OS_WIN32
|
||||
#else
|
||||
g_return_if_fail (dir != NULL && dir->dir != NULL);
|
||||
rewinddir (dir->dir);
|
||||
#endif
|
||||
}
|
||||
|
||||
void
|
||||
g_dir_close (GDir *dir)
|
||||
{
|
||||
#ifdef G_OS_WIN32
|
||||
#else
|
||||
g_return_if_fail (dir != NULL && dir->dir != NULL);
|
||||
closedir (dir->dir);
|
||||
dir->dir = NULL;
|
||||
g_free (dir);
|
||||
#endif
|
||||
}
|
||||
|
||||
@@ -1,80 +0,0 @@
|
||||
/*
|
||||
* gerror.c: Error support.
|
||||
*
|
||||
* Author:
|
||||
* Miguel de Icaza ([email protected])
|
||||
*
|
||||
* (C) 2006 Novell, Inc.
|
||||
*
|
||||
* Permission is hereby granted, free of charge, to any person obtaining
|
||||
* a copy of this software and associated documentation files (the
|
||||
* "Software"), to deal in the Software without restriction, including
|
||||
* without limitation the rights to use, copy, modify, merge, publish,
|
||||
* distribute, sublicense, and/or sell copies of the Software, and to
|
||||
* permit persons to whom the Software is furnished to do so, subject to
|
||||
* the following conditions:
|
||||
*
|
||||
* The above copyright notice and this permission notice shall be
|
||||
* included in all copies or substantial portions of the Software.
|
||||
*
|
||||
* THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND,
|
||||
* EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
|
||||
* MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND
|
||||
* NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE
|
||||
* LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION
|
||||
* OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION
|
||||
* WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
|
||||
*/
|
||||
#include <stdio.h>
|
||||
#include <stdarg.h>
|
||||
#include <string.h>
|
||||
#include <glib.h>
|
||||
|
||||
GError *
|
||||
g_error_new (gpointer domain, gint code, const char *format, ...)
|
||||
{
|
||||
va_list args;
|
||||
GError *err = g_new (GError, 1);
|
||||
|
||||
err->domain = domain;
|
||||
err->code = code;
|
||||
|
||||
va_start (args, format);
|
||||
if (vasprintf (&err->message, format, args) == -1)
|
||||
err->message = g_strdup_printf ("internal: invalid format string %s", format);
|
||||
va_end (args);
|
||||
|
||||
return err;
|
||||
}
|
||||
|
||||
void
|
||||
g_error_free (GError *error)
|
||||
{
|
||||
g_return_if_fail (error != NULL);
|
||||
|
||||
free (error->message);
|
||||
g_free (error);
|
||||
}
|
||||
|
||||
void
|
||||
g_set_error (GError **err, gpointer domain, gint code, const gchar *format, ...)
|
||||
{
|
||||
va_list args;
|
||||
|
||||
if (err) {
|
||||
va_start (args, format);
|
||||
*err = g_error_new (domain, code, format, args);
|
||||
va_end (args);
|
||||
}
|
||||
}
|
||||
|
||||
void
|
||||
g_propagate_error (GError **dest, GError *src)
|
||||
{
|
||||
if (dest == NULL){
|
||||
if (src)
|
||||
g_error_free (src);
|
||||
} else {
|
||||
*dest = src;
|
||||
}
|
||||
}
|
||||
@@ -1,245 +0,0 @@
|
||||
/*
|
||||
* File utility functions.
|
||||
*
|
||||
* Author:
|
||||
* Gonzalo Paniagua Javier ([email protected])
|
||||
*
|
||||
* (C) 2006 Novell, Inc.
|
||||
*
|
||||
* Permission is hereby granted, free of charge, to any person obtaining
|
||||
* a copy of this software and associated documentation files (the
|
||||
* "Software"), to deal in the Software without restriction, including
|
||||
* without limitation the rights to use, copy, modify, merge, publish,
|
||||
* distribute, sublicense, and/or sell copies of the Software, and to
|
||||
* permit persons to whom the Software is furnished to do so, subject to
|
||||
* the following conditions:
|
||||
*
|
||||
* The above copyright notice and this permission notice shall be
|
||||
* included in all copies or substantial portions of the Software.
|
||||
*
|
||||
* THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND,
|
||||
* EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
|
||||
* MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND
|
||||
* NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE
|
||||
* LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION
|
||||
* OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION
|
||||
* WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
|
||||
*/
|
||||
#include <glib.h>
|
||||
#include <stdio.h>
|
||||
#include <stdlib.h>
|
||||
#include <unistd.h>
|
||||
#include <errno.h>
|
||||
#include <sys/types.h>
|
||||
#include <sys/stat.h>
|
||||
#include <fcntl.h>
|
||||
|
||||
GFileError
|
||||
g_file_error_from_errno (gint err_no)
|
||||
{
|
||||
switch (err_no) {
|
||||
case EEXIST:
|
||||
return G_FILE_ERROR_EXIST;
|
||||
case EISDIR:
|
||||
return G_FILE_ERROR_ISDIR;
|
||||
case EACCES:
|
||||
return G_FILE_ERROR_ACCES;
|
||||
case ENAMETOOLONG:
|
||||
return G_FILE_ERROR_NAMETOOLONG;
|
||||
case ENOENT:
|
||||
return G_FILE_ERROR_NOENT;
|
||||
case ENOTDIR:
|
||||
return G_FILE_ERROR_NOTDIR;
|
||||
case ENXIO:
|
||||
return G_FILE_ERROR_NXIO;
|
||||
case ENODEV:
|
||||
return G_FILE_ERROR_NODEV;
|
||||
case EROFS:
|
||||
return G_FILE_ERROR_ROFS;
|
||||
#ifdef ETXTBSY
|
||||
case ETXTBSY:
|
||||
return G_FILE_ERROR_TXTBSY;
|
||||
#endif
|
||||
case EFAULT:
|
||||
return G_FILE_ERROR_FAULT;
|
||||
#ifdef ELOOP
|
||||
case ELOOP:
|
||||
return G_FILE_ERROR_LOOP;
|
||||
#endif
|
||||
case ENOSPC:
|
||||
return G_FILE_ERROR_NOSPC;
|
||||
case ENOMEM:
|
||||
return G_FILE_ERROR_NOMEM;
|
||||
case EMFILE:
|
||||
return G_FILE_ERROR_MFILE;
|
||||
case ENFILE:
|
||||
return G_FILE_ERROR_NFILE;
|
||||
case EBADF:
|
||||
return G_FILE_ERROR_BADF;
|
||||
case EINVAL:
|
||||
return G_FILE_ERROR_INVAL;
|
||||
case EPIPE:
|
||||
return G_FILE_ERROR_PIPE;
|
||||
case EAGAIN:
|
||||
return G_FILE_ERROR_AGAIN;
|
||||
case EINTR:
|
||||
return G_FILE_ERROR_INTR;
|
||||
case EIO:
|
||||
return G_FILE_ERROR_IO;
|
||||
case EPERM:
|
||||
return G_FILE_ERROR_PERM;
|
||||
case ENOSYS:
|
||||
return G_FILE_ERROR_NOSYS;
|
||||
default:
|
||||
return G_FILE_ERROR_FAILED;
|
||||
}
|
||||
}
|
||||
|
||||
#ifndef O_LARGEFILE
|
||||
#define OPEN_FLAGS (O_RDONLY)
|
||||
#else
|
||||
#define OPEN_FLAGS (O_RDONLY | O_LARGEFILE)
|
||||
#endif
|
||||
gboolean
|
||||
g_file_get_contents (const gchar *filename, gchar **contents, gsize *length, GError **error)
|
||||
{
|
||||
gchar *str;
|
||||
int fd;
|
||||
struct stat st;
|
||||
long offset;
|
||||
int nread;
|
||||
|
||||
g_return_val_if_fail (filename != NULL, FALSE);
|
||||
g_return_val_if_fail (contents != NULL, FALSE);
|
||||
g_return_val_if_fail (error == NULL || *error == NULL, FALSE);
|
||||
|
||||
*contents = NULL;
|
||||
if (length)
|
||||
*length = 0;
|
||||
|
||||
fd = open (filename, OPEN_FLAGS);
|
||||
if (fd == -1) {
|
||||
if (error != NULL) {
|
||||
int err = errno;
|
||||
*error = g_error_new (G_LOG_DOMAIN, g_file_error_from_errno (err), "Error opening file");
|
||||
}
|
||||
return FALSE;
|
||||
}
|
||||
|
||||
if (fstat (fd, &st) != 0) {
|
||||
if (error != NULL) {
|
||||
int err = errno;
|
||||
*error = g_error_new (G_LOG_DOMAIN, g_file_error_from_errno (err), "Error in fstat()");
|
||||
}
|
||||
close (fd);
|
||||
return FALSE;
|
||||
}
|
||||
|
||||
str = g_malloc (st.st_size + 1);
|
||||
offset = 0;
|
||||
do {
|
||||
nread = read (fd, str + offset, st.st_size - offset);
|
||||
if (nread > 0) {
|
||||
offset += nread;
|
||||
}
|
||||
} while ((nread > 0 && offset < st.st_size) || (nread == -1 && errno == EINTR));
|
||||
|
||||
close (fd);
|
||||
str [st.st_size] = '\0';
|
||||
if (length) {
|
||||
*length = st.st_size;
|
||||
}
|
||||
*contents = str;
|
||||
return TRUE;
|
||||
}
|
||||
|
||||
gint
|
||||
g_file_open_tmp (const gchar *tmpl, gchar **name_used, GError **error)
|
||||
{
|
||||
const static gchar *default_tmpl = ".XXXXXX";
|
||||
gchar *t;
|
||||
gint fd;
|
||||
gint len;
|
||||
|
||||
g_return_val_if_fail (error == NULL || *error == NULL, -1);
|
||||
|
||||
if (tmpl == NULL)
|
||||
tmpl = default_tmpl;
|
||||
|
||||
if (strchr (tmpl, G_DIR_SEPARATOR) != NULL) {
|
||||
if (error) {
|
||||
*error = g_error_new (G_LOG_DOMAIN, 24, "Template should not have any " G_DIR_SEPARATOR_S);
|
||||
}
|
||||
return -1;
|
||||
}
|
||||
|
||||
len = strlen (tmpl);
|
||||
if (len < 6 || strcmp (tmpl + len - 6, "XXXXXX")) {
|
||||
if (error) {
|
||||
*error = g_error_new (G_LOG_DOMAIN, 24, "Template should end with XXXXXX");
|
||||
}
|
||||
return -1;
|
||||
}
|
||||
|
||||
t = g_build_filename (g_get_tmp_dir (), tmpl, NULL);
|
||||
fd = mkstemp (t);
|
||||
if (fd == -1) {
|
||||
if (error) {
|
||||
int err = errno;
|
||||
*error = g_error_new (G_LOG_DOMAIN, g_file_error_from_errno (err), "Error in mkstemp()");
|
||||
}
|
||||
g_free (t);
|
||||
return -1;
|
||||
}
|
||||
|
||||
if (name_used) {
|
||||
*name_used = t;
|
||||
} else {
|
||||
g_free (t);
|
||||
}
|
||||
return fd;
|
||||
}
|
||||
|
||||
gboolean
|
||||
g_file_test (const gchar *filename, GFileTest test)
|
||||
{
|
||||
struct stat st;
|
||||
gboolean have_stat;
|
||||
|
||||
if (filename == NULL || test == 0)
|
||||
return FALSE;
|
||||
|
||||
have_stat = FALSE;
|
||||
#ifdef G_OS_WIN32
|
||||
#else
|
||||
if ((test & G_FILE_TEST_EXISTS) != 0) {
|
||||
if (access (filename, F_OK) == 0)
|
||||
return TRUE;
|
||||
}
|
||||
|
||||
if ((test & G_FILE_TEST_IS_EXECUTABLE) != 0) {
|
||||
if (access (filename, X_OK) == 0)
|
||||
return TRUE;
|
||||
}
|
||||
if ((test & G_FILE_TEST_IS_SYMLINK) != 0) {
|
||||
have_stat = (lstat (filename, &st) == 0);
|
||||
if (have_stat && S_ISLNK (st.st_mode))
|
||||
return TRUE;
|
||||
}
|
||||
#endif
|
||||
|
||||
if ((test & G_FILE_TEST_IS_REGULAR) != 0) {
|
||||
if (!have_stat)
|
||||
have_stat = (stat (filename, &st) == 0);
|
||||
if (have_stat && S_ISREG (st.st_mode))
|
||||
return TRUE;
|
||||
}
|
||||
if ((test & G_FILE_TEST_IS_DIR) != 0) {
|
||||
if (!have_stat)
|
||||
have_stat = (stat (filename, &st) == 0);
|
||||
if (have_stat && S_ISDIR (st.st_mode))
|
||||
return TRUE;
|
||||
}
|
||||
return FALSE;
|
||||
}
|
||||
|
||||
@@ -1,426 +0,0 @@
|
||||
/*
|
||||
* ghashtable.c: Hashtable implementation
|
||||
*
|
||||
* Author:
|
||||
* Miguel de Icaza ([email protected])
|
||||
*
|
||||
* (C) 2006 Novell, Inc.
|
||||
*
|
||||
* Permission is hereby granted, free of charge, to any person obtaining
|
||||
* a copy of this software and associated documentation files (the
|
||||
* "Software"), to deal in the Software without restriction, including
|
||||
* without limitation the rights to use, copy, modify, merge, publish,
|
||||
* distribute, sublicense, and/or sell copies of the Software, and to
|
||||
* permit persons to whom the Software is furnished to do so, subject to
|
||||
* the following conditions:
|
||||
*
|
||||
* The above copyright notice and this permission notice shall be
|
||||
* included in all copies or substantial portions of the Software.
|
||||
*
|
||||
* THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND,
|
||||
* EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
|
||||
* MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND
|
||||
* NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE
|
||||
* LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION
|
||||
* OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION
|
||||
* WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
|
||||
*/
|
||||
#include <stdio.h>
|
||||
#include <math.h>
|
||||
#include <glib.h>
|
||||
|
||||
typedef struct _Slot Slot;
|
||||
|
||||
struct _Slot {
|
||||
gpointer key;
|
||||
gpointer value;
|
||||
Slot *next;
|
||||
};
|
||||
|
||||
static gpointer KEYMARKER_REMOVED = &KEYMARKER_REMOVED;
|
||||
|
||||
struct _GHashTable {
|
||||
GHashFunc hash_func;
|
||||
GEqualFunc key_equal_func;
|
||||
|
||||
Slot **table;
|
||||
int table_size;
|
||||
int in_use;
|
||||
int threshold;
|
||||
int last_rehash;
|
||||
GDestroyNotify value_destroy_func, key_destroy_func;
|
||||
};
|
||||
|
||||
static const int prime_tbl[] = {
|
||||
11, 19, 37, 73, 109, 163, 251, 367, 557, 823, 1237,
|
||||
1861, 2777, 4177, 6247, 9371, 14057, 21089, 31627,
|
||||
47431, 71143, 106721, 160073, 240101, 360163,
|
||||
540217, 810343, 1215497, 1823231, 2734867, 4102283,
|
||||
6153409, 9230113, 13845163
|
||||
};
|
||||
|
||||
static gboolean
|
||||
test_prime (int x)
|
||||
{
|
||||
if ((x & 1) != 0) {
|
||||
int n;
|
||||
for (n = 3; n< (int)sqrt (x); n += 2) {
|
||||
if ((x % n) == 0)
|
||||
return FALSE;
|
||||
}
|
||||
return TRUE;
|
||||
}
|
||||
// There is only one even prime - 2.
|
||||
return (x == 2);
|
||||
}
|
||||
|
||||
static int
|
||||
calc_prime (int x)
|
||||
{
|
||||
int i;
|
||||
|
||||
for (i = (x & (~1))-1; i< G_MAXINT32; i += 2) {
|
||||
if (test_prime (i))
|
||||
return i;
|
||||
}
|
||||
return x;
|
||||
}
|
||||
|
||||
guint
|
||||
g_spaced_primes_closest (guint x)
|
||||
{
|
||||
int i;
|
||||
|
||||
for (i = 0; i < G_N_ELEMENTS (prime_tbl); i++) {
|
||||
if (x <= prime_tbl [i])
|
||||
return prime_tbl [i];
|
||||
}
|
||||
return calc_prime (x);
|
||||
}
|
||||
|
||||
GHashTable *
|
||||
g_hash_table_new (GHashFunc hash_func, GEqualFunc key_equal_func)
|
||||
{
|
||||
GHashTable *hash;
|
||||
|
||||
if (hash_func == NULL)
|
||||
hash_func = g_direct_hash;
|
||||
if (key_equal_func == NULL)
|
||||
key_equal_func = g_direct_equal;
|
||||
hash = g_new0 (GHashTable, 1);
|
||||
|
||||
hash->hash_func = hash_func;
|
||||
hash->key_equal_func = key_equal_func;
|
||||
|
||||
hash->table_size = g_spaced_primes_closest (1);
|
||||
hash->table = g_new0 (Slot *, hash->table_size);
|
||||
hash->last_rehash = hash->table_size;
|
||||
|
||||
return hash;
|
||||
}
|
||||
|
||||
GHashTable *
|
||||
g_hash_table_new_full (GHashFunc hash_func, GEqualFunc key_equal_func,
|
||||
GDestroyNotify key_destroy_func, GDestroyNotify value_destroy_func)
|
||||
{
|
||||
GHashTable *hash = g_hash_table_new (hash_func, key_equal_func);
|
||||
if (hash == NULL)
|
||||
return NULL;
|
||||
|
||||
hash->key_destroy_func = key_destroy_func;
|
||||
hash->value_destroy_func = value_destroy_func;
|
||||
|
||||
return hash;
|
||||
}
|
||||
|
||||
static void
|
||||
do_rehash (GHashTable *hash)
|
||||
{
|
||||
int current_size, i;
|
||||
Slot **table;
|
||||
|
||||
/* printf ("Resizing diff=%d slots=%d\n", hash->in_use - hash->last_rehash, hash->table_size); */
|
||||
hash->last_rehash = hash->table_size;
|
||||
current_size = hash->table_size;
|
||||
hash->table_size = g_spaced_primes_closest (hash->in_use);
|
||||
/* printf ("New size: %d\n", hash->table_size); */
|
||||
table = hash->table;
|
||||
hash->table = g_new0 (Slot *, hash->table_size);
|
||||
|
||||
for (i = 0; i < current_size; i++){
|
||||
Slot *s, *next;
|
||||
|
||||
for (s = table [i]; s != NULL; s = next){
|
||||
guint hashcode = ((*hash->hash_func) (s->key)) % hash->table_size;
|
||||
next = s->next;
|
||||
|
||||
s->next = hash->table [hashcode];
|
||||
hash->table [hashcode] = s;
|
||||
}
|
||||
}
|
||||
g_free (table);
|
||||
}
|
||||
|
||||
static void
|
||||
rehash (GHashTable *hash)
|
||||
{
|
||||
int diff = ABS (hash->last_rehash, hash->in_use);
|
||||
|
||||
/* These are the factors to play with to change the rehashing strategy */
|
||||
/* I played with them with a large range, and could not really get */
|
||||
/* something that was too good, maybe the tests are not that great */
|
||||
if (!(diff * 0.75 > hash->table_size * 2))
|
||||
return;
|
||||
do_rehash (hash);
|
||||
}
|
||||
|
||||
void
|
||||
g_hash_table_insert_replace (GHashTable *hash, gpointer key, gpointer value, gboolean replace)
|
||||
{
|
||||
guint hashcode;
|
||||
Slot *s;
|
||||
GEqualFunc equal;
|
||||
|
||||
g_return_if_fail (hash != NULL);
|
||||
|
||||
equal = hash->key_equal_func;
|
||||
if (hash->in_use >= hash->threshold)
|
||||
rehash (hash);
|
||||
|
||||
hashcode = ((*hash->hash_func) (key)) % hash->table_size;
|
||||
for (s = hash->table [hashcode]; s != NULL; s = s->next){
|
||||
if ((*equal) (s->key, key)){
|
||||
if (replace){
|
||||
if (hash->key_destroy_func != NULL)
|
||||
(*hash->key_destroy_func)(s->key);
|
||||
s->key = key;
|
||||
}
|
||||
if (hash->value_destroy_func != NULL)
|
||||
(*hash->value_destroy_func) (s->value);
|
||||
s->value = value;
|
||||
return;
|
||||
}
|
||||
}
|
||||
s = g_new (Slot, 1);
|
||||
s->key = key;
|
||||
s->value = value;
|
||||
s->next = hash->table [hashcode];
|
||||
hash->table [hashcode] = s;
|
||||
hash->in_use++;
|
||||
}
|
||||
|
||||
guint
|
||||
g_hash_table_size (GHashTable *hash)
|
||||
{
|
||||
g_return_val_if_fail (hash != NULL, 0);
|
||||
|
||||
return hash->in_use;
|
||||
}
|
||||
|
||||
gpointer
|
||||
g_hash_table_lookup (GHashTable *hash, gconstpointer key)
|
||||
{
|
||||
gpointer orig_key, value;
|
||||
|
||||
if (g_hash_table_lookup_extended (hash, key, &orig_key, &value))
|
||||
return value;
|
||||
else
|
||||
return NULL;
|
||||
}
|
||||
|
||||
gboolean
|
||||
g_hash_table_lookup_extended (GHashTable *hash, gconstpointer key, gpointer *orig_key, gpointer *value)
|
||||
{
|
||||
GEqualFunc equal;
|
||||
Slot *s;
|
||||
guint hashcode;
|
||||
|
||||
g_return_val_if_fail (hash != NULL, FALSE);
|
||||
equal = hash->key_equal_func;
|
||||
|
||||
hashcode = ((*hash->hash_func) (key)) % hash->table_size;
|
||||
|
||||
for (s = hash->table [hashcode]; s != NULL; s = s->next){
|
||||
if ((*equal)(s->key, key)){
|
||||
*orig_key = s->key;
|
||||
*value = s->value;
|
||||
return TRUE;
|
||||
}
|
||||
}
|
||||
return FALSE;
|
||||
}
|
||||
|
||||
void
|
||||
g_hash_table_foreach (GHashTable *hash, GHFunc func, gpointer user_data)
|
||||
{
|
||||
int i;
|
||||
|
||||
g_return_if_fail (hash != NULL);
|
||||
g_return_if_fail (func != NULL);
|
||||
|
||||
for (i = 0; i < hash->table_size; i++){
|
||||
Slot *s;
|
||||
|
||||
for (s = hash->table [i]; s != NULL; s = s->next)
|
||||
(*func)(s->key, s->value, user_data);
|
||||
}
|
||||
}
|
||||
|
||||
gpointer
|
||||
g_hash_table_find (GHashTable *hash, GHRFunc predicate, gpointer user_data)
|
||||
{
|
||||
int i;
|
||||
|
||||
g_return_val_if_fail (hash != NULL, NULL);
|
||||
g_return_val_if_fail (predicate != NULL, NULL);
|
||||
|
||||
for (i = 0; i < hash->table_size; i++){
|
||||
Slot *s;
|
||||
|
||||
for (s = hash->table [i]; s != NULL; s = s->next)
|
||||
if ((*predicate)(s->key, s->value, user_data))
|
||||
return s->value;
|
||||
}
|
||||
return NULL;
|
||||
}
|
||||
|
||||
gboolean
|
||||
g_hash_table_remove (GHashTable *hash, gconstpointer key)
|
||||
{
|
||||
GEqualFunc equal;
|
||||
Slot *s, *last;
|
||||
guint hashcode;
|
||||
|
||||
g_return_val_if_fail (hash != NULL, FALSE);
|
||||
equal = hash->key_equal_func;
|
||||
|
||||
hashcode = ((*hash->hash_func)(key)) % hash->table_size;
|
||||
last = NULL;
|
||||
for (s = hash->table [hashcode]; s != NULL; s = s->next){
|
||||
if ((*equal)(s->key, key)){
|
||||
if (hash->key_destroy_func != NULL)
|
||||
(*hash->key_destroy_func)(s->key);
|
||||
if (hash->value_destroy_func != NULL)
|
||||
(*hash->value_destroy_func)(s->value);
|
||||
if (last == NULL)
|
||||
hash->table [hashcode] = s->next;
|
||||
else
|
||||
last->next = s->next;
|
||||
g_free (s);
|
||||
hash->in_use--;
|
||||
return TRUE;
|
||||
}
|
||||
last = s;
|
||||
}
|
||||
return FALSE;
|
||||
}
|
||||
|
||||
guint
|
||||
g_hash_table_foreach_remove (GHashTable *hash, GHRFunc func, gpointer user_data)
|
||||
{
|
||||
int i;
|
||||
int count = 0;
|
||||
|
||||
g_return_val_if_fail (hash != NULL, 0);
|
||||
g_return_val_if_fail (func != NULL, 0);
|
||||
|
||||
for (i = 0; i < hash->table_size; i++){
|
||||
Slot *s, *last;
|
||||
|
||||
last = NULL;
|
||||
for (s = hash->table [i]; s != NULL; ){
|
||||
if ((*func)(s->key, s->value, user_data)){
|
||||
Slot *n;
|
||||
|
||||
if (hash->key_destroy_func != NULL)
|
||||
(*hash->key_destroy_func)(s->key);
|
||||
if (hash->value_destroy_func != NULL)
|
||||
(*hash->value_destroy_func)(s->value);
|
||||
if (last == NULL){
|
||||
hash->table [i] = s->next;
|
||||
n = s->next;
|
||||
} else {
|
||||
last->next = s->next;
|
||||
n = last->next;
|
||||
}
|
||||
g_free (s);
|
||||
hash->in_use--;
|
||||
count++;
|
||||
s = n;
|
||||
} else {
|
||||
last = s;
|
||||
s = s->next;
|
||||
}
|
||||
}
|
||||
}
|
||||
if (count > 0)
|
||||
rehash (hash);
|
||||
return count;
|
||||
}
|
||||
|
||||
void
|
||||
g_hash_table_destroy (GHashTable *hash)
|
||||
{
|
||||
int i;
|
||||
|
||||
g_return_if_fail (hash != NULL);
|
||||
|
||||
for (i = 0; i < hash->table_size; i++){
|
||||
Slot *s, *next;
|
||||
|
||||
for (s = hash->table [i]; s != NULL; s = next){
|
||||
next = s->next;
|
||||
|
||||
if (hash->key_destroy_func != NULL)
|
||||
(*hash->key_destroy_func)(s->key);
|
||||
if (hash->value_destroy_func != NULL)
|
||||
(*hash->value_destroy_func)(s->value);
|
||||
g_free (s);
|
||||
}
|
||||
}
|
||||
g_free (hash->table);
|
||||
|
||||
g_free (hash);
|
||||
}
|
||||
|
||||
gboolean
|
||||
g_direct_equal (gconstpointer v1, gconstpointer v2)
|
||||
{
|
||||
return v1 == v2;
|
||||
}
|
||||
|
||||
guint
|
||||
g_direct_hash (gconstpointer v1)
|
||||
{
|
||||
return GPOINTER_TO_UINT (v1);
|
||||
}
|
||||
|
||||
gboolean
|
||||
g_int_equal (gconstpointer v1, gconstpointer v2)
|
||||
{
|
||||
return GPOINTER_TO_INT (v1) == GPOINTER_TO_INT (v2);
|
||||
}
|
||||
|
||||
guint
|
||||
g_int_hash (gconstpointer v1)
|
||||
{
|
||||
return GPOINTER_TO_UINT(v1);
|
||||
}
|
||||
|
||||
gboolean
|
||||
g_str_equal (gconstpointer v1, gconstpointer v2)
|
||||
{
|
||||
return strcmp (v1, v2) == 0;
|
||||
}
|
||||
|
||||
guint
|
||||
g_str_hash (gconstpointer v1)
|
||||
{
|
||||
guint hash = 0;
|
||||
char *p = (char *) v1;
|
||||
|
||||
while (*p++)
|
||||
hash = (hash << 5) - (hash + *p);
|
||||
|
||||
return hash;
|
||||
}
|
||||
@@ -1,738 +0,0 @@
|
||||
#ifndef __GLIB_H
|
||||
#define __GLIB_H
|
||||
|
||||
#include <stdarg.h>
|
||||
#include <stdlib.h>
|
||||
#include <string.h>
|
||||
#include <stdio.h>
|
||||
#include <stdint.h>
|
||||
#include <stddef.h>
|
||||
#include <ctype.h>
|
||||
#include <eglib-config.h>
|
||||
|
||||
#ifndef offsetof
|
||||
# define offsetof(s_name,n_name) (size_t)(char *)&(((s_name*)0)->m_name)
|
||||
#endif
|
||||
|
||||
#define __EGLIB_X11 1
|
||||
/*
|
||||
* Basic data types
|
||||
*/
|
||||
typedef int gboolean;
|
||||
typedef int gint;
|
||||
typedef unsigned int guint;
|
||||
typedef short gshort;
|
||||
typedef unsigned short gushort;
|
||||
typedef long glong;
|
||||
typedef unsigned long gulong;
|
||||
typedef void * gpointer;
|
||||
typedef const void * gconstpointer;
|
||||
typedef char gchar;
|
||||
typedef unsigned char guchar;
|
||||
|
||||
/* Types defined in terms of the stdint.h */
|
||||
typedef int8_t gint8;
|
||||
typedef uint8_t guint8;
|
||||
typedef int16_t gint16;
|
||||
typedef uint16_t guint16;
|
||||
typedef int32_t gint32;
|
||||
typedef uint32_t guint32;
|
||||
typedef int64_t gint64;
|
||||
typedef uint64_t guint64;
|
||||
typedef float gfloat;
|
||||
typedef double gdouble;
|
||||
typedef uint16_t gunichar2;
|
||||
/*
|
||||
* Macros
|
||||
*/
|
||||
#define G_N_ELEMENTS(s) (sizeof(s) / sizeof ((s) [0]))
|
||||
|
||||
#define FALSE 0
|
||||
#define TRUE 1
|
||||
|
||||
#define G_MAXINT32 INT32_MAX
|
||||
#define G_MININT32 INT32_MIN
|
||||
#define G_MININT64 INT64_MIN
|
||||
#define G_MAXINT64 INT64_MAX
|
||||
|
||||
#define G_LITTLE_ENDIAN 1234
|
||||
#define G_BIG_ENDIAN 4321
|
||||
#define G_STMT_START do
|
||||
#define G_STMT_END while (0)
|
||||
|
||||
#define G_USEC_PER_SEC 1000000
|
||||
|
||||
#define ABS(a,b) (((a)>(b)) ? ((a)-(b)) : ((b)-(a)))
|
||||
|
||||
#define G_STRUCT_OFFSET(p_type,field) offsetof(p_type,field)
|
||||
|
||||
#define EGLIB_STRINGIFY(x) #x
|
||||
#define EGLIB_TOSTRING(x) EGLIB_STRINGIFY(x)
|
||||
#define G_STRLOC __FILE__ ":" EGLIB_TOSTRING(__LINE__) ":"
|
||||
|
||||
#define G_BEGIN_DECLS
|
||||
#define G_END_DECLS
|
||||
|
||||
#define G_CONST_RETURN const
|
||||
|
||||
/*
|
||||
* Allocation
|
||||
*/
|
||||
#define g_new(type,size) ((type *) malloc (sizeof (type) * (size)))
|
||||
#define g_new0(type,size) ((type *) calloc (sizeof (type), (size)))
|
||||
#define g_newa(type,size) ((type *) alloca (sizeof (type) * (size)))
|
||||
#define g_realloc(obj,size) realloc((obj), (size))
|
||||
#define g_malloc(x) malloc(x)
|
||||
#define g_try_malloc(x) malloc(x)
|
||||
#define g_try_realloc(obj,size) realloc((obj),(size))
|
||||
#define g_malloc0(x) calloc(1,x)
|
||||
#define g_memmove(dest,src,len) memmove (dest, src, len)
|
||||
#define g_renew(struct_type, mem, n_structs) realloc (mem, sizeof (struct_type) * n_structs)
|
||||
#define g_alloca(size) alloca (size)
|
||||
#define g_free free
|
||||
|
||||
gpointer g_memdup (gconstpointer mem, guint byte_size);
|
||||
gchar *g_strdup (const gchar *str);
|
||||
|
||||
typedef struct {
|
||||
gpointer (*malloc) (gsize n_bytes);
|
||||
gpointer (*realloc) (gpointer mem, gsize n_bytes);
|
||||
void (*free) (gpointer mem);
|
||||
gpointer (*calloc) (gsize n_blocks, gsize n_block_bytes);
|
||||
gpointer (*try_malloc) (gsize n_bytes);
|
||||
gpointer (*try_realloc) (gpointer mem, gsize n_bytes);
|
||||
} GMemVTable;
|
||||
|
||||
#define g_mem_set_vtable(x)
|
||||
/*
|
||||
* Misc.
|
||||
*/
|
||||
#define g_atexit(func) ((void) atexit (func))
|
||||
|
||||
const gchar * g_getenv(const gchar *variable);
|
||||
gboolean g_setenv(const gchar *variable, const gchar *value, gboolean overwrite);
|
||||
void g_unsetenv(const gchar *variable);
|
||||
|
||||
/*
|
||||
* Precondition macros
|
||||
*/
|
||||
#define g_return_if_fail(x) G_STMT_START { if (!(x)) { printf ("%s:%d: assertion '%s' failed", __FILE__, __LINE__, #x); return; } } G_STMT_END
|
||||
#define g_return_val_if_fail(x,e) G_STMT_START { if (!(x)) { printf ("%s:%d: assertion '%s' failed", __FILE__, __LINE__, #x); return (e); } } G_STMT_END
|
||||
|
||||
/*
|
||||
* Hashtables
|
||||
*/
|
||||
typedef struct _GHashTable GHashTable;
|
||||
typedef void (*GFunc) (gpointer data, gpointer user_data);
|
||||
typedef gint (*GCompareFunc) (gconstpointer a, gconstpointer b);
|
||||
typedef gint (*GCompareDataFunc) (gconstpointer a, gconstpointer b, gpointer user_data);
|
||||
typedef void (*GHFunc) (gpointer key, gpointer value, gpointer user_data);
|
||||
typedef gboolean (*GHRFunc) (gpointer key, gpointer value, gpointer user_data);
|
||||
typedef void (*GDestroyNotify) (gpointer data);
|
||||
typedef guint (*GHashFunc) (gconstpointer key);
|
||||
typedef gboolean (*GEqualFunc) (gconstpointer a, gconstpointer b);
|
||||
|
||||
GHashTable *g_hash_table_new (GHashFunc hash_func, GEqualFunc key_equal_func);
|
||||
GHashTable *g_hash_table_new_full (GHashFunc hash_func, GEqualFunc key_equal_func,
|
||||
GDestroyNotify key_destroy_func, GDestroyNotify value_destroy_func);
|
||||
void g_hash_table_insert_replace (GHashTable *hash, gpointer key, gpointer value, gboolean replace);
|
||||
guint g_hash_table_size (GHashTable *hash);
|
||||
gpointer g_hash_table_lookup (GHashTable *hash, gconstpointer key);
|
||||
gboolean g_hash_table_lookup_extended (GHashTable *hash, gconstpointer key, gpointer *orig_key, gpointer *value);
|
||||
void g_hash_table_foreach (GHashTable *hash, GHFunc func, gpointer user_data);
|
||||
gpointer g_hash_table_find (GHashTable *hash, GHRFunc predicate, gpointer user_data);
|
||||
gboolean g_hash_table_remove (GHashTable *hash, gconstpointer key);
|
||||
guint g_hash_table_foreach_remove (GHashTable *hash, GHRFunc func, gpointer user_data);
|
||||
void g_hash_table_destroy (GHashTable *hash);
|
||||
|
||||
guint g_spaced_primes_closest (guint x);
|
||||
|
||||
#define g_hash_table_insert(h,k,v) g_hash_table_insert_replace ((h),(k),(v),FALSE)
|
||||
#define g_hash_table_replace(h,k,v) g_hash_table_insert_replace ((h),(k),(v),TRUE)
|
||||
|
||||
gboolean g_direct_equal (gconstpointer v1, gconstpointer v2);
|
||||
guint g_direct_hash (gconstpointer v1);
|
||||
gboolean g_int_equal (gconstpointer v1, gconstpointer v2);
|
||||
guint g_int_hash (gconstpointer v1);
|
||||
gboolean g_str_equal (gconstpointer v1, gconstpointer v2);
|
||||
guint g_str_hash (gconstpointer v1);
|
||||
|
||||
#define g_assert(x) G_STMT_START { if (!(x)) g_error ("* Assertion at %s:%d, condition `%s' not met\n", __FILE__, __LINE__, #x); } G_STMT_END
|
||||
#define g_assert_not_reached() G_STMT_START { g_error ("* Assertion: should not be reached at %s:%d\n", __FILE__, __LINE__); } G_STMT_END
|
||||
|
||||
/*
|
||||
* Errors
|
||||
*/
|
||||
typedef struct {
|
||||
/* In the real glib, this is a GQuark, but we dont use/need that */
|
||||
gpointer domain;
|
||||
gint code;
|
||||
gchar *message;
|
||||
} GError;
|
||||
|
||||
void g_error_free (GError *error);
|
||||
GError *g_error_new (gpointer domain, gint code, const char *format, ...);
|
||||
void g_set_error (GError **err, gpointer domain, gint code, const gchar *format, ...);
|
||||
void g_propagate_error (GError **dest, GError *src);
|
||||
|
||||
/*
|
||||
* Strings utility
|
||||
*/
|
||||
gchar *g_strdup_printf (const gchar *format, ...);
|
||||
gchar *g_strdup_vprintf (const gchar *format, va_list args);
|
||||
gchar *g_strndup (const gchar *str, gsize n);
|
||||
const gchar *g_strerror (gint errnum);
|
||||
gchar *g_strndup (const gchar *str, gsize n);
|
||||
void g_strfreev (gchar **str_array);
|
||||
gchar *g_strconcat (const gchar *first, ...);
|
||||
gchar **g_strsplit (const gchar *string, const gchar *delimiter, gint max_tokens);
|
||||
gchar *g_strreverse (gchar *str);
|
||||
gboolean g_str_has_prefix (const gchar *str, const gchar *prefix);
|
||||
gboolean g_str_has_suffix (const gchar *str, const gchar *suffix);
|
||||
guint g_strv_length (gchar **str_array);
|
||||
gchar *g_strjoin (const gchar *separator, ...);
|
||||
gchar *g_strjoinv (const gchar *separator, gchar **str_array);
|
||||
gchar *g_strchug (gchar *str);
|
||||
gchar *g_strchomp (gchar *str);
|
||||
void g_strdown (gchar *string);
|
||||
|
||||
gchar *g_strdelimit (gchar *string, const gchar *delimiters, gchar new_delimiter);
|
||||
gchar *g_strescape (const gchar *source, const gchar *exceptions);
|
||||
|
||||
gchar *g_filename_to_uri (const gchar *filename, const gchar *hostname, GError **error);
|
||||
gchar *g_filename_from_uri (const gchar *uri, gchar **hostname, GError **error);
|
||||
|
||||
gint g_printf (gchar const *format, ...);
|
||||
gint g_fprintf (FILE *file, gchar const *format, ...);
|
||||
gint g_sprintf (gchar *string, gchar const *format, ...);
|
||||
gint g_snprintf (gchar *string, gulong n, gchar const *format, ...);
|
||||
#define g_vprintf vprintf
|
||||
#define g_vfprintf vfprintf
|
||||
#define g_vsprintf vsprintf
|
||||
#define g_vsnprintf vsnprintf
|
||||
#define g_vasprintf vasprintf
|
||||
|
||||
#ifdef HAVE_STRLCPY
|
||||
#define g_strlcpy strlcpy
|
||||
#else
|
||||
gsize g_strlcpy (gchar *dest, const gchar *src, gsize dest_size);
|
||||
#endif
|
||||
|
||||
gchar *g_ascii_strdown (const gchar *str, gssize len);
|
||||
gint g_ascii_strncasecmp (const gchar *s1, const gchar *s2, gsize n);
|
||||
gint g_ascii_xdigit_value (gchar c);
|
||||
#define g_ascii_isspace(c) (isspace (c) != 0)
|
||||
#define g_ascii_isalpha(c) (isalpha (c) != 0)
|
||||
#define g_ascii_isprint(c) (isprint (c) != 0)
|
||||
#define g_ascii_isxdigit(c) (isxdigit (c) != 0)
|
||||
|
||||
/* FIXME: g_strcasecmp supports utf8 unicode stuff */
|
||||
#define g_strcasecmp strcasecmp
|
||||
#define g_ascii_strcasecmp strcasecmp
|
||||
#define g_strncasecmp strncasecmp
|
||||
#define g_strstrip(a) g_strchug (g_strchomp (a))
|
||||
|
||||
#define G_STR_DELIMITERS "_-|> <."
|
||||
|
||||
/*
|
||||
* String type
|
||||
*/
|
||||
typedef struct {
|
||||
char *str;
|
||||
gsize len;
|
||||
gsize allocated_len;
|
||||
} GString;
|
||||
|
||||
GString *g_string_new (const gchar *init);
|
||||
GString *g_string_new_len (const gchar *init, gssize len);
|
||||
GString *g_string_sized_new (gsize default_size);
|
||||
gchar *g_string_free (GString *string, gboolean free_segment);
|
||||
GString *g_string_append (GString *string, const gchar *val);
|
||||
void g_string_printf (GString *string, const gchar *format, ...);
|
||||
void g_string_append_printf (GString *string, const gchar *format, ...);
|
||||
GString *g_string_append_c (GString *string, gchar c);
|
||||
GString *g_string_append (GString *string, const gchar *val);
|
||||
GString *g_string_append_len (GString *string, const gchar *val, gssize len);
|
||||
GString *g_string_truncate (GString *string, gsize len);
|
||||
GString *g_string_prepend (GString *string, const gchar *val);
|
||||
|
||||
#define g_string_sprintfa g_string_append_printf
|
||||
|
||||
/*
|
||||
* Lists
|
||||
*/
|
||||
typedef struct _GSList GSList;
|
||||
struct _GSList {
|
||||
gpointer data;
|
||||
GSList *next;
|
||||
};
|
||||
|
||||
GSList *g_slist_alloc (void);
|
||||
GSList *g_slist_append (GSList *list,
|
||||
gpointer data);
|
||||
GSList *g_slist_prepend (GSList *list,
|
||||
gpointer data);
|
||||
void g_slist_free (GSList *list);
|
||||
void g_slist_free_1 (GSList *list);
|
||||
GSList *g_slist_copy (GSList *list);
|
||||
GSList *g_slist_concat (GSList *list1,
|
||||
GSList *list2);
|
||||
void g_slist_foreach (GSList *list,
|
||||
GFunc func,
|
||||
gpointer user_data);
|
||||
GSList *g_slist_last (GSList *list);
|
||||
GSList *g_slist_find (GSList *list,
|
||||
gconstpointer data);
|
||||
GSList *g_slist_remove (GSList *list,
|
||||
gconstpointer data);
|
||||
GSList *g_slist_remove_all (GSList *list,
|
||||
gconstpointer data);
|
||||
GSList *g_slist_reverse (GSList *list);
|
||||
guint g_slist_length (GSList *list);
|
||||
GSList *g_slist_remove_link (GSList *list,
|
||||
GSList *link);
|
||||
GSList *g_slist_delete_link (GSList *list,
|
||||
GSList *link);
|
||||
GSList *g_slist_insert_sorted (GSList *list,
|
||||
gpointer data,
|
||||
GCompareFunc func);
|
||||
GSList *g_slist_insert_before (GSList *list,
|
||||
GSList *sibling,
|
||||
gpointer data);
|
||||
GSList *g_slist_sort (GSList *list,
|
||||
GCompareFunc func);
|
||||
#define g_slist_next(slist) ((slist) ? (((GSList *) (slist))->next) : NULL)
|
||||
|
||||
typedef struct _GList GList;
|
||||
struct _GList {
|
||||
gpointer data;
|
||||
GList *next;
|
||||
GList *prev;
|
||||
};
|
||||
|
||||
#define g_list_next(list) ((list) ? (((GList *) (list))->next) : NULL)
|
||||
|
||||
GList *g_list_alloc (void);
|
||||
GList *g_list_append (GList *list,
|
||||
gpointer data);
|
||||
GList *g_list_prepend (GList *list,
|
||||
gpointer data);
|
||||
void g_list_free (GList *list);
|
||||
void g_list_free_1 (GList *list);
|
||||
GList *g_list_copy (GList *list);
|
||||
guint g_list_length (GList *list);
|
||||
gint g_list_index (GList *list,
|
||||
gconstpointer data);
|
||||
GList *g_list_nth (GList *list,
|
||||
guint n);
|
||||
gpointer g_list_nth_data (GList *list,
|
||||
guint n);
|
||||
GList *g_list_last (GList *list);
|
||||
GList *g_list_concat (GList *list1,
|
||||
GList *list2);
|
||||
void g_list_foreach (GList *list,
|
||||
GFunc func,
|
||||
gpointer user_data);
|
||||
GList *g_list_first (GList *list);
|
||||
GList *g_list_find (GList *list,
|
||||
gconstpointer data);
|
||||
GList *g_list_remove (GList *list,
|
||||
gconstpointer data);
|
||||
GList *g_list_reverse (GList *list);
|
||||
GList *g_list_remove_link (GList *list,
|
||||
GList *link);
|
||||
GList *g_list_delete_link (GList *list,
|
||||
GList *link);
|
||||
GList *g_list_insert_sorted (GList *list,
|
||||
gpointer data,
|
||||
GCompareFunc func);
|
||||
GList *g_list_insert_before (GList *list,
|
||||
GList *sibling,
|
||||
gpointer data);
|
||||
GList *g_list_sort (GList *sort,
|
||||
GCompareFunc func);
|
||||
|
||||
/*
|
||||
* Array
|
||||
*/
|
||||
|
||||
typedef struct _GArray GArray;
|
||||
struct _GArray {
|
||||
gchar *data;
|
||||
gint len;
|
||||
};
|
||||
|
||||
GArray *g_array_new (gboolean zero_terminated, gboolean clear_, guint element_size);
|
||||
gchar* g_array_free (GArray *array, gboolean free_segment);
|
||||
GArray *g_array_append_vals (GArray *array, gconstpointer data, guint len);
|
||||
GArray* g_array_insert_vals (GArray *array, guint index_, gconstpointer data, guint len);
|
||||
GArray* g_array_remove_index (GArray *array, guint index_);
|
||||
|
||||
#define g_array_append_val(a,v) (g_array_append_vals((a),&(v),1))
|
||||
#define g_array_insert_val(a,i,v) (g_array_insert_vals((a),(i),&(v),1))
|
||||
#define g_array_index(a,t,i) *(t*)(((a)->data) + sizeof(t) * (i))
|
||||
|
||||
/*
|
||||
* Pointer Array
|
||||
*/
|
||||
|
||||
typedef struct _GPtrArray GPtrArray;
|
||||
struct _GPtrArray {
|
||||
gpointer *pdata;
|
||||
guint len;
|
||||
};
|
||||
|
||||
GPtrArray *g_ptr_array_new (void);
|
||||
GPtrArray *g_ptr_array_sized_new (guint reserved_size);
|
||||
void g_ptr_array_add (GPtrArray *array, gpointer data);
|
||||
gboolean g_ptr_array_remove (GPtrArray *array, gpointer data);
|
||||
gpointer g_ptr_array_remove_index (GPtrArray *array, guint index);
|
||||
gboolean g_ptr_array_remove_fast (GPtrArray *array, gpointer data);
|
||||
gpointer g_ptr_array_remove_index_fast (GPtrArray *array, gpointer data);
|
||||
void g_ptr_array_sort (GPtrArray *array, GCompareFunc compare_func);
|
||||
void g_ptr_array_sort_with_data (GPtrArray *array, GCompareDataFunc compare_func, gpointer user_data);
|
||||
void g_ptr_array_set_size (GPtrArray *array, gint length);
|
||||
gpointer *g_ptr_array_free (GPtrArray *array, gboolean free_seg);
|
||||
void g_ptr_array_foreach (GPtrArray *array, GFunc func, gpointer user_data);
|
||||
#define g_ptr_array_index(array,index) (array)->pdata[(index)]
|
||||
|
||||
/*
|
||||
* Queues
|
||||
*/
|
||||
typedef struct {
|
||||
GList *head;
|
||||
GList *tail;
|
||||
guint length;
|
||||
} GQueue;
|
||||
|
||||
gpointer g_queue_pop_head (GQueue *queue);
|
||||
void g_queue_push_head (GQueue *queue,
|
||||
gpointer data);
|
||||
gboolean g_queue_is_empty (GQueue *queue);
|
||||
GQueue *g_queue_new (void);
|
||||
void g_queue_free (GQueue *queue);
|
||||
|
||||
/*
|
||||
* Messages
|
||||
*/
|
||||
#ifndef G_LOG_DOMAIN
|
||||
#define G_LOG_DOMAIN ((gchar*) 0)
|
||||
#endif
|
||||
|
||||
typedef enum {
|
||||
G_LOG_FLAG_RECURSION = 1 << 0,
|
||||
G_LOG_FLAG_FATAL = 1 << 1,
|
||||
|
||||
G_LOG_LEVEL_ERROR = 1 << 2,
|
||||
G_LOG_LEVEL_CRITICAL = 1 << 3,
|
||||
G_LOG_LEVEL_WARNING = 1 << 4,
|
||||
G_LOG_LEVEL_MESSAGE = 1 << 5,
|
||||
G_LOG_LEVEL_INFO = 1 << 6,
|
||||
G_LOG_LEVEL_DEBUG = 1 << 7,
|
||||
|
||||
G_LOG_LEVEL_MASK = ~(G_LOG_FLAG_RECURSION | G_LOG_FLAG_FATAL)
|
||||
} GLogLevelFlags;
|
||||
|
||||
void g_print (const gchar *format, ...);
|
||||
GLogLevelFlags g_log_set_always_fatal (GLogLevelFlags fatal_mask);
|
||||
GLogLevelFlags g_log_set_fatal_mask (const gchar *log_domain, GLogLevelFlags fatal_mask);
|
||||
void g_logv (const gchar *log_domain, GLogLevelFlags log_level, const gchar *format, va_list args);
|
||||
void g_log (const gchar *log_domain, GLogLevelFlags log_level, const gchar *format, ...);
|
||||
|
||||
#define g_error(format...) g_log (G_LOG_DOMAIN, G_LOG_LEVEL_ERROR, format)
|
||||
#define g_critical(format...) g_log (G_LOG_DOMAIN, G_LOG_LEVEL_CRITICAL, format)
|
||||
#define g_warning(format...) g_log (G_LOG_DOMAIN, G_LOG_LEVEL_WARNING, format)
|
||||
#define g_message(format...) g_log (G_LOG_DOMAIN, G_LOG_LEVEL_MESSAGE, format)
|
||||
#define g_debug(format...) g_log (G_LOG_DOMAIN, G_LOG_LEVEL_DEBUG, format)
|
||||
|
||||
#define g_log_set_handler(a,b,c,d)
|
||||
#define g_printerr(format...) fprintf (stderr, format)
|
||||
/*
|
||||
* Conversions
|
||||
*/
|
||||
|
||||
gpointer g_convert_error_quark(void);
|
||||
|
||||
|
||||
/*
|
||||
* Unicode Manipulation: most of this is not used by Mono by default, it is
|
||||
* only used if the old collation code is activated, so this is only the
|
||||
* bare minimum to build.
|
||||
*/
|
||||
typedef guint32 gunichar;
|
||||
|
||||
typedef enum {
|
||||
G_UNICODE_LOWERCASE_LETTER,
|
||||
} GUnicodeType;
|
||||
|
||||
gunichar g_unichar_tolower (gunichar c);
|
||||
GUnicodeType g_unichar_type (gunichar c);
|
||||
|
||||
#ifndef MAX
|
||||
#define MAX(a,b) (((a)>(b)) ? (a) : (b))
|
||||
#endif
|
||||
|
||||
#ifndef MIN
|
||||
#define MIN(a,b) (((a)<(b)) ? (a) : (b))
|
||||
#endif
|
||||
|
||||
/* FIXME: Implement these two for gcc */
|
||||
#define G_LIKELY(x) (x)
|
||||
#define G_UNLIKELY(x) (x)
|
||||
|
||||
/*
|
||||
* Unicode conversion
|
||||
*/
|
||||
|
||||
#define G_CONVERT_ERROR g_convert_error_quark()
|
||||
|
||||
typedef enum {
|
||||
G_CONVERT_ERROR_NO_CONVERSION,
|
||||
G_CONVERT_ERROR_ILLEGAL_SEQUENCE,
|
||||
G_CONVERT_ERROR_FAILED,
|
||||
G_CONVERT_ERROR_PARTIAL_INPUT,
|
||||
G_CONVERT_ERROR_BAD_URI,
|
||||
G_CONVERT_ERROR_NOT_ABSOLUTE_PATH
|
||||
} GConvertError;
|
||||
|
||||
gunichar2 *g_utf8_to_utf16 (const gchar *str, glong len, glong *items_read, glong *items_written, GError **error);
|
||||
gchar *g_utf16_to_utf8 (const gunichar2 *str, glong len, glong *items_read, glong *items_written, GError **error);
|
||||
|
||||
/*
|
||||
* Path
|
||||
*/
|
||||
gchar *g_build_path (const gchar *separator, const gchar *first_element, ...);
|
||||
#define g_build_filename(x...) g_build_path(G_DIR_SEPARATOR_S, x)
|
||||
gchar *g_path_get_dirname (const gchar *filename);
|
||||
gchar *g_path_get_basename (const char *filename);
|
||||
gchar *g_find_program_in_path (const gchar *program);
|
||||
gchar *g_get_current_dir (void);
|
||||
gboolean g_path_is_absolute (const char *filename);
|
||||
|
||||
const gchar *g_get_home_dir (void);
|
||||
const gchar *g_get_tmp_dir (void);
|
||||
const gchar *g_get_user_name (void);
|
||||
gchar *g_get_prgname (void);
|
||||
void g_set_prgname (const gchar *prgname);
|
||||
|
||||
/*
|
||||
* Shell
|
||||
*/
|
||||
|
||||
gboolean g_shell_parse_argv (const gchar *command_line, gint *argcp, gchar ***argvp, GError **error);
|
||||
gchar *g_shell_unquote (const gchar *quoted_string, GError **error);
|
||||
gchar *g_shell_quote (const gchar *unquoted_string);
|
||||
|
||||
/*
|
||||
* Spawn
|
||||
*/
|
||||
typedef enum {
|
||||
G_SPAWN_LEAVE_DESCRIPTORS_OPEN = 1,
|
||||
G_SPAWN_DO_NOT_REAP_CHILD = 1 << 1,
|
||||
G_SPAWN_SEARCH_PATH = 1 << 2,
|
||||
G_SPAWN_STDOUT_TO_DEV_NULL = 1 << 3,
|
||||
G_SPAWN_STDERR_TO_DEV_NULL = 1 << 4,
|
||||
G_SPAWN_CHILD_INHERITS_STDIN = 1 << 5,
|
||||
G_SPAWN_FILE_AND_ARGV_ZERO = 1 << 6
|
||||
} GSpawnFlags;
|
||||
|
||||
typedef pid_t GPid;
|
||||
|
||||
typedef void (*GSpawnChildSetupFunc) (gpointer user_data);
|
||||
|
||||
gboolean g_spawn_command_line_sync (const gchar *command_line, gchar **standard_output, gchar **standard_error, gint *exit_status, GError **error);
|
||||
gboolean g_spawn_async_with_pipes (const gchar *working_directory, gchar **argv, gchar **envp, GSpawnFlags flags, GSpawnChildSetupFunc child_setup,
|
||||
gpointer user_data, GPid *child_pid, gint *standard_input, gint *standard_output, gint *standard_error, GError **error);
|
||||
|
||||
|
||||
/*
|
||||
* Timer
|
||||
*/
|
||||
typedef struct _GTimer GTimer;
|
||||
|
||||
GTimer *g_timer_new (void);
|
||||
void g_timer_destroy (GTimer *timer);
|
||||
gdouble g_timer_elapsed (GTimer *timer, gulong *microseconds);
|
||||
void g_timer_stop (GTimer *timer);
|
||||
void g_timer_start (GTimer *timer);
|
||||
|
||||
/*
|
||||
* Date and time
|
||||
*/
|
||||
typedef struct {
|
||||
glong tv_sec;
|
||||
glong tv_usec;
|
||||
} GTimeVal;
|
||||
|
||||
void g_get_current_time (GTimeVal *result);
|
||||
|
||||
/*
|
||||
* File
|
||||
*/
|
||||
|
||||
typedef enum {
|
||||
G_FILE_ERROR_EXIST,
|
||||
G_FILE_ERROR_ISDIR,
|
||||
G_FILE_ERROR_ACCES,
|
||||
G_FILE_ERROR_NAMETOOLONG,
|
||||
G_FILE_ERROR_NOENT,
|
||||
G_FILE_ERROR_NOTDIR,
|
||||
G_FILE_ERROR_NXIO,
|
||||
G_FILE_ERROR_NODEV,
|
||||
G_FILE_ERROR_ROFS,
|
||||
G_FILE_ERROR_TXTBSY,
|
||||
G_FILE_ERROR_FAULT,
|
||||
G_FILE_ERROR_LOOP,
|
||||
G_FILE_ERROR_NOSPC,
|
||||
G_FILE_ERROR_NOMEM,
|
||||
G_FILE_ERROR_MFILE,
|
||||
G_FILE_ERROR_NFILE,
|
||||
G_FILE_ERROR_BADF,
|
||||
G_FILE_ERROR_INVAL,
|
||||
G_FILE_ERROR_PIPE,
|
||||
G_FILE_ERROR_AGAIN,
|
||||
G_FILE_ERROR_INTR,
|
||||
G_FILE_ERROR_IO,
|
||||
G_FILE_ERROR_PERM,
|
||||
G_FILE_ERROR_NOSYS,
|
||||
G_FILE_ERROR_FAILED
|
||||
} GFileError;
|
||||
|
||||
typedef enum {
|
||||
G_FILE_TEST_IS_REGULAR = 1 << 0,
|
||||
G_FILE_TEST_IS_SYMLINK = 1 << 1,
|
||||
G_FILE_TEST_IS_DIR = 1 << 2,
|
||||
G_FILE_TEST_IS_EXECUTABLE = 1 << 3,
|
||||
G_FILE_TEST_EXISTS = 1 << 4
|
||||
} GFileTest;
|
||||
|
||||
|
||||
gboolean g_file_get_contents (const gchar *filename, gchar **contents, gsize *length, GError **error);
|
||||
GFileError g_file_error_from_errno (gint err_no);
|
||||
gint g_file_open_tmp (const gchar *tmpl, gchar **name_used, GError **error);
|
||||
gboolean g_file_test (const gchar *filename, GFileTest test);
|
||||
|
||||
/*
|
||||
* Pattern matching
|
||||
*/
|
||||
typedef struct _GPatternSpec GPatternSpec;
|
||||
GPatternSpec * g_pattern_spec_new (const gchar *pattern);
|
||||
void g_pattern_spec_free (GPatternSpec *pspec);
|
||||
gboolean g_pattern_match_string (GPatternSpec *pspec, const gchar *string);
|
||||
|
||||
/*
|
||||
* Directory
|
||||
*/
|
||||
typedef struct _GDir GDir;
|
||||
GDir *g_dir_open (const gchar *path, guint flags, GError **error);
|
||||
const gchar *g_dir_read_name (GDir *dir);
|
||||
void g_dir_rewind (GDir *dir);
|
||||
void g_dir_close (GDir *dir);
|
||||
|
||||
/*
|
||||
* GMarkup
|
||||
*/
|
||||
typedef struct _GMarkupParseContext GMarkupParseContext;
|
||||
|
||||
typedef enum
|
||||
{
|
||||
G_MARKUP_DO_NOT_USE_THIS_UNSUPPORTED_FLAG = 1 << 0,
|
||||
G_MARKUP_TREAT_CDATA_AS_TEXT = 1 << 1
|
||||
} GMarkupParseFlags;
|
||||
|
||||
typedef struct {
|
||||
void (*start_element) (GMarkupParseContext *context,
|
||||
const gchar *element_name,
|
||||
const gchar **attribute_names,
|
||||
const gchar **attribute_values,
|
||||
gpointer user_data,
|
||||
GError **error);
|
||||
|
||||
void (*end_element) (GMarkupParseContext *context,
|
||||
const gchar *element_name,
|
||||
gpointer user_data,
|
||||
GError **error);
|
||||
|
||||
void (*text) (GMarkupParseContext *context,
|
||||
const gchar *text,
|
||||
gsize text_len,
|
||||
gpointer user_data,
|
||||
GError **error);
|
||||
|
||||
void (*passthrough) (GMarkupParseContext *context,
|
||||
const gchar *passthrough_text,
|
||||
gsize text_len,
|
||||
gpointer user_data,
|
||||
GError **error);
|
||||
void (*error) (GMarkupParseContext *context,
|
||||
GError *error,
|
||||
gpointer user_data);
|
||||
} GMarkupParser;
|
||||
|
||||
GMarkupParseContext *g_markup_parse_context_new (const GMarkupParser *parser,
|
||||
GMarkupParseFlags flags,
|
||||
gpointer user_data,
|
||||
GDestroyNotify user_data_dnotify);
|
||||
void g_markup_parse_context_free (GMarkupParseContext *context);
|
||||
gboolean g_markup_parse_context_parse (GMarkupParseContext *context,
|
||||
const gchar *text, gssize text_len,
|
||||
GError **error);
|
||||
gboolean g_markup_parse_context_end_parse (GMarkupParseContext *context,
|
||||
GError **error);
|
||||
|
||||
/*
|
||||
* Character set conversion
|
||||
*/
|
||||
gboolean g_get_charset (G_CONST_RETURN char **charset);
|
||||
gchar *g_locale_to_utf8 (const gchar *opsysstring, gssize len,
|
||||
gsize *bytes_read, gsize *bytes_written,
|
||||
GError **error);
|
||||
gchar *g_locale_from_utf8 (const gchar *utf8string, gssize len, gsize *bytes_read,
|
||||
gsize *bytes_written, GError **error);
|
||||
gchar *g_filename_from_utf8 (const gchar *utf8string, gssize len, gsize *bytes_read,
|
||||
gsize *bytes_written, GError **error);
|
||||
gchar *g_convert (const gchar *str, gssize len,
|
||||
const gchar *to_codeset, const gchar *from_codeset,
|
||||
gsize *bytes_read, gsize *bytes_written, GError **error);
|
||||
gboolean g_utf8_validate (const gchar *str, gssize max_len, const gchar **end);
|
||||
|
||||
/*
|
||||
* Empty thread functions, not used by eglib
|
||||
*/
|
||||
#define g_thread_supported() TRUE
|
||||
#define g_thread_init(x) G_STMT_START { if (x != NULL) { g_error ("No vtable supported in g_thread_init"); } } G_STMT_END
|
||||
|
||||
#define GUINT16_SWAP_LE_BE(x) ((guint16) (((guint16) x) >> 8) | ((((guint16)(x)) & 0xff) << 8))
|
||||
#define GUINT32_SWAP_LE_BE(x) ((guint32) \
|
||||
( (((guint32) (x)) << 24)| \
|
||||
((((guint32) (x)) & 0xff0000) >> 8) | \
|
||||
((((guint32) (x)) & 0xff00) << 8) | \
|
||||
(((guint32) (x)) >> 24)) )
|
||||
|
||||
#define GUINT64_SWAP_LE_BE(x) ((guint64) (((guint64)(GUINT32_SWAP_LE_BE(((guint64)x) & 0xffffffff))) << 32) | \
|
||||
GUINT32_SWAP_LE_BE(((guint64)x) >> 32))
|
||||
|
||||
|
||||
|
||||
#if G_BYTE_ORDER == G_LITTLE_ENDIAN
|
||||
# define GUINT32_TO_LE(x) (x)
|
||||
# define GUINT64_TO_LE(x) (x)
|
||||
# define GUINT16_TO_LE(x) (x)
|
||||
#else
|
||||
# define GUINT32_TO_LE(x) GUINT32_SWAP_LE_BE(x)
|
||||
# define GUINT64_TO_LE(x) GUINT64_SWAP_LE_BE(x)
|
||||
# define GUINT16_TO_LE(x) GUINT16_SWAP_LE_BE(x)
|
||||
#endif
|
||||
|
||||
#define GUINT32_FROM_LE(x) (GUINT32_TO_LE (x))
|
||||
#define GUINT64_FROM_LE(x) (GUINT64_TO_LE (x))
|
||||
#define GUINT16_FROM_LE(x) (GUINT16_TO_LE (x))
|
||||
|
||||
#define _EGLIB_MAJOR 2
|
||||
#define _EGLIB_MIDDLE 4
|
||||
#define _EGLIB_MINOR 0
|
||||
|
||||
#define GLIB_CHECK_VERSION(a,b,c) ((a < _EGLIB_MAJOR) || (a == _EGLIB_MAJOR && (b < _EGLIB_MIDDLE || (b == _EGLIB_MIDDLE && c <= _EGLIB_MINOR))))
|
||||
|
||||
#endif
|
||||
|
||||
@@ -1,309 +0,0 @@
|
||||
/*
|
||||
* glist.c: Doubly-linked list implementation
|
||||
*
|
||||
* Authors:
|
||||
* Duncan Mak ([email protected])
|
||||
* Raja R Harinath ([email protected])
|
||||
*
|
||||
* Permission is hereby granted, free of charge, to any person obtaining
|
||||
* a copy of this software and associated documentation files (the
|
||||
* "Software"), to deal in the Software without restriction, including
|
||||
* without limitation the rights to use, copy, modify, merge, publish,
|
||||
* distribute, sublicense, and/or sell copies of the Software, and to
|
||||
* permit persons to whom the Software is furnished to do so, subject to
|
||||
* the following conditions:
|
||||
*
|
||||
* The above copyright notice and this permission notice shall be
|
||||
* included in all copies or substantial portions of the Software.
|
||||
*
|
||||
* THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND,
|
||||
* EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
|
||||
* MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND
|
||||
* NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE
|
||||
* LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION
|
||||
* OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION
|
||||
* WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
|
||||
*
|
||||
* (C) 2006 Novell, Inc.
|
||||
*/
|
||||
#include <stdio.h>
|
||||
#include <glib.h>
|
||||
|
||||
GList*
|
||||
g_list_alloc ()
|
||||
{
|
||||
return g_new0 (GList, 1);
|
||||
}
|
||||
|
||||
static inline GList*
|
||||
new_node (GList *prev, gpointer data, GList *next)
|
||||
{
|
||||
GList *node = g_list_alloc ();
|
||||
node->data = data;
|
||||
node->prev = prev;
|
||||
node->next = next;
|
||||
if (prev)
|
||||
prev->next = node;
|
||||
if (next)
|
||||
next->prev = node;
|
||||
return node;
|
||||
}
|
||||
|
||||
static inline GList*
|
||||
disconnect_node (GList *node)
|
||||
{
|
||||
if (node->next)
|
||||
node->next->prev = node->prev;
|
||||
if (node->prev)
|
||||
node->prev->next = node->next;
|
||||
return node;
|
||||
}
|
||||
|
||||
GList *
|
||||
g_list_prepend (GList *list, gpointer data)
|
||||
{
|
||||
return new_node (list ? list->prev : NULL, data, list);
|
||||
}
|
||||
|
||||
void
|
||||
g_list_free_1 (GList *list)
|
||||
{
|
||||
g_free (list);
|
||||
}
|
||||
|
||||
void
|
||||
g_list_free (GList *list)
|
||||
{
|
||||
while (list){
|
||||
GList *next = list->next;
|
||||
g_list_free_1 (list);
|
||||
list = next;
|
||||
}
|
||||
}
|
||||
|
||||
GList*
|
||||
g_list_append (GList *list, gpointer data)
|
||||
{
|
||||
GList *node = new_node (g_list_last (list), data, NULL);
|
||||
return list ? list : node;
|
||||
}
|
||||
|
||||
GList *
|
||||
g_list_concat (GList *list1, GList *list2)
|
||||
{
|
||||
if (list1 && list2) {
|
||||
list2->prev = g_list_last (list1);
|
||||
list2->prev->next = list2;
|
||||
}
|
||||
return list1 ? list1 : list2;
|
||||
}
|
||||
|
||||
guint
|
||||
g_list_length (GList *list)
|
||||
{
|
||||
guint length = 0;
|
||||
|
||||
while (list) {
|
||||
length ++;
|
||||
list = list->next;
|
||||
}
|
||||
|
||||
return length;
|
||||
}
|
||||
|
||||
GList*
|
||||
g_list_remove (GList *list, gconstpointer data)
|
||||
{
|
||||
GList *current = g_list_find (list, data);
|
||||
if (!current)
|
||||
return list;
|
||||
|
||||
if (current == list)
|
||||
list = list->next;
|
||||
g_list_free_1 (disconnect_node (current));
|
||||
|
||||
return list;
|
||||
}
|
||||
|
||||
GList*
|
||||
g_list_remove_link (GList *list, GList *link)
|
||||
{
|
||||
if (list == link)
|
||||
list = list->next;
|
||||
|
||||
disconnect_node (link);
|
||||
link->next = NULL;
|
||||
link->prev = NULL;
|
||||
|
||||
return list;
|
||||
}
|
||||
|
||||
GList*
|
||||
g_list_delete_link (GList *list, GList *link)
|
||||
{
|
||||
list = g_list_remove_link (list, link);
|
||||
g_list_free_1 (link);
|
||||
|
||||
return list;
|
||||
}
|
||||
|
||||
GList*
|
||||
g_list_find (GList *list, gconstpointer data)
|
||||
{
|
||||
while (list){
|
||||
if (list->data == data)
|
||||
return list;
|
||||
|
||||
list = list->next;
|
||||
}
|
||||
|
||||
return NULL;
|
||||
}
|
||||
|
||||
GList*
|
||||
g_list_reverse (GList *list)
|
||||
{
|
||||
GList *reverse = NULL;
|
||||
|
||||
while (list) {
|
||||
reverse = list;
|
||||
list = reverse->next;
|
||||
|
||||
reverse->next = reverse->prev;
|
||||
reverse->prev = list;
|
||||
}
|
||||
|
||||
return reverse;
|
||||
}
|
||||
|
||||
GList*
|
||||
g_list_first (GList *list)
|
||||
{
|
||||
if (!list)
|
||||
return NULL;
|
||||
|
||||
while (list->prev)
|
||||
list = list->prev;
|
||||
|
||||
return list;
|
||||
}
|
||||
|
||||
GList*
|
||||
g_list_last (GList *list)
|
||||
{
|
||||
if (!list)
|
||||
return NULL;
|
||||
|
||||
while (list->next)
|
||||
list = list->next;
|
||||
|
||||
return list;
|
||||
}
|
||||
|
||||
GList*
|
||||
g_list_insert_sorted (GList *list, gpointer data, GCompareFunc func)
|
||||
{
|
||||
GList *prev = NULL;
|
||||
GList *current;
|
||||
|
||||
if (!func)
|
||||
return list;
|
||||
|
||||
/* Invariant: !prev || func (prev->data, data) <= 0) */
|
||||
for (current = list; current; current = current->next) {
|
||||
if (func (current->data, data) > 0)
|
||||
break;
|
||||
prev = current;
|
||||
}
|
||||
|
||||
GList *node = new_node (prev, data, current);
|
||||
return list == current ? node : list;
|
||||
}
|
||||
|
||||
GList*
|
||||
g_list_insert_before (GList *list, GList *sibling, gpointer data)
|
||||
{
|
||||
if (sibling) {
|
||||
GList *node = new_node (sibling->prev, data, sibling);
|
||||
return list == sibling ? node : list;
|
||||
}
|
||||
return g_list_append (list, data);
|
||||
}
|
||||
|
||||
void
|
||||
g_list_foreach (GList *list, GFunc func, gpointer user_data)
|
||||
{
|
||||
while (list){
|
||||
(*func) (list->data, user_data);
|
||||
list = list->next;
|
||||
}
|
||||
}
|
||||
|
||||
gint
|
||||
g_list_index (GList *list, gconstpointer data)
|
||||
{
|
||||
gint index = 0;
|
||||
|
||||
while (list){
|
||||
if (list->data == data)
|
||||
return index;
|
||||
|
||||
index ++;
|
||||
list = list->next;
|
||||
}
|
||||
|
||||
return -1;
|
||||
}
|
||||
|
||||
GList*
|
||||
g_list_nth (GList *list, guint n)
|
||||
{
|
||||
for (; list; list = list->next) {
|
||||
if (n == 0)
|
||||
break;
|
||||
n--;
|
||||
}
|
||||
return list;
|
||||
}
|
||||
|
||||
gpointer
|
||||
g_list_nth_data (GList *list, guint n)
|
||||
{
|
||||
GList *node = g_list_nth (list, n);
|
||||
return node ? node->data : NULL;
|
||||
}
|
||||
|
||||
GList*
|
||||
g_list_copy (GList *list)
|
||||
{
|
||||
GList *copy = NULL;
|
||||
|
||||
if (list) {
|
||||
GList *tmp = new_node (NULL, list->data, NULL);
|
||||
copy = tmp;
|
||||
|
||||
for (list = list->next; list; list = list->next)
|
||||
tmp = new_node (tmp, list->data, NULL);
|
||||
}
|
||||
|
||||
return copy;
|
||||
}
|
||||
|
||||
typedef GList list_node;
|
||||
#include "sort.frag.h"
|
||||
|
||||
GList*
|
||||
g_list_sort (GList *list, GCompareFunc func)
|
||||
{
|
||||
GList *current;
|
||||
if (!list || !list->next)
|
||||
return list;
|
||||
list = do_sort (list, func);
|
||||
|
||||
/* Fixup: do_sort doesn't update 'prev' pointers */
|
||||
list->prev = NULL;
|
||||
for (current = list; current->next; current = current->next)
|
||||
current->next->prev = current;
|
||||
|
||||
return list;
|
||||
}
|
||||
@@ -1,446 +0,0 @@
|
||||
/*
|
||||
* gmakrup.c: Minimal XML markup reader.
|
||||
*
|
||||
* Unlike the GLib one, this can not be restarted with more text
|
||||
* as the Mono use does not require it.
|
||||
*
|
||||
* Actually, with further thought, I think that this could be made
|
||||
* to restart very easily. The pos == end condition would mean
|
||||
* "return to caller" and only at end parse this would be a fatal
|
||||
* error.
|
||||
*
|
||||
* Not that it matters to Mono, but it is very simple to change, there
|
||||
* is a tricky situation: there are a few places where we check p+n
|
||||
* in the source, and that would have to change to be progressive, instead
|
||||
* of depending on the string to be complete at that point, so we would
|
||||
* have to introduce extra states to cope with that.
|
||||
*
|
||||
* Author:
|
||||
* Miguel de Icaza ([email protected])
|
||||
*
|
||||
* (C) 2006 Novell, Inc.
|
||||
*
|
||||
* Permission is hereby granted, free of charge, to any person obtaining
|
||||
* a copy of this software and associated documentation files (the
|
||||
* "Software"), to deal in the Software without restriction, including
|
||||
* without limitation the rights to use, copy, modify, merge, publish,
|
||||
* distribute, sublicense, and/or sell copies of the Software, and to
|
||||
* permit persons to whom the Software is furnished to do so, subject to
|
||||
* the following conditions:
|
||||
*
|
||||
* The above copyright notice and this permission notice shall be
|
||||
* included in all copies or substantial portions of the Software.
|
||||
*
|
||||
* THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND,
|
||||
* EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
|
||||
* MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND
|
||||
* NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE
|
||||
* LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION
|
||||
* OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION
|
||||
* WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
|
||||
*/
|
||||
#include <stdio.h>
|
||||
#include <glib.h>
|
||||
|
||||
#define set_error(msg...) do { if (error != NULL) *error = g_error_new (GINT_TO_POINTER (1), 1, msg); } while (0);
|
||||
|
||||
typedef enum {
|
||||
START,
|
||||
START_ELEMENT,
|
||||
TEXT,
|
||||
FLUSH_TEXT,
|
||||
CLOSING_ELEMENT,
|
||||
COMMENT,
|
||||
SKIP_XML_DECLARATION
|
||||
} ParseState;
|
||||
|
||||
struct _GMarkupParseContext {
|
||||
GMarkupParser parser;
|
||||
gpointer user_data;
|
||||
GDestroyNotify user_data_dnotify;
|
||||
ParseState state;
|
||||
|
||||
/* Stores the name of the current element, so we can issue the end_element */
|
||||
GSList *level;
|
||||
|
||||
GString *text;
|
||||
};
|
||||
|
||||
GMarkupParseContext *
|
||||
g_markup_parse_context_new (const GMarkupParser *parser,
|
||||
GMarkupParseFlags flags,
|
||||
gpointer user_data,
|
||||
GDestroyNotify user_data_dnotify)
|
||||
{
|
||||
GMarkupParseContext *context = g_new0 (GMarkupParseContext, 1);
|
||||
|
||||
context->parser = *parser;
|
||||
context->user_data = user_data;
|
||||
context->user_data_dnotify = user_data_dnotify;
|
||||
|
||||
return context;
|
||||
}
|
||||
|
||||
void
|
||||
g_markup_parse_context_free (GMarkupParseContext *context)
|
||||
{
|
||||
GSList *l;
|
||||
|
||||
g_return_if_fail (context != NULL);
|
||||
|
||||
if (context->user_data_dnotify != NULL)
|
||||
(context->user_data_dnotify) (context->user_data);
|
||||
|
||||
if (context->text != NULL)
|
||||
g_string_free (context->text, TRUE);
|
||||
for (l = context->level; l; l = l->next)
|
||||
g_free (l->data);
|
||||
g_slist_free (context->level);
|
||||
g_free (context);
|
||||
}
|
||||
|
||||
static const char *
|
||||
skip_space (const char *p, const char *end)
|
||||
{
|
||||
for (; p < end && isspace (*p); p++)
|
||||
;
|
||||
return p;
|
||||
}
|
||||
|
||||
static const char *
|
||||
parse_value (const char *p, const char *end, char **value, GError **error)
|
||||
{
|
||||
const char *start;
|
||||
int l;
|
||||
|
||||
if (*p != '"'){
|
||||
set_error ("Expected the attribute value to start with a quote");
|
||||
return end;
|
||||
}
|
||||
start = ++p;
|
||||
for (; p < end && *p != '"'; p++)
|
||||
;
|
||||
if (p == end)
|
||||
return end;
|
||||
l = p - start;
|
||||
p++;
|
||||
*value = malloc (l + 1);
|
||||
if (*value == NULL)
|
||||
return end;
|
||||
strncpy (*value, start, l);
|
||||
(*value) [l] = 0;
|
||||
return p;
|
||||
}
|
||||
|
||||
static const char *
|
||||
parse_name (const char *p, const char *end, char **value)
|
||||
{
|
||||
const char *start = p;
|
||||
int l;
|
||||
|
||||
for (; p < end && isalnum (*p); p++)
|
||||
;
|
||||
if (p == end)
|
||||
return end;
|
||||
|
||||
l = p - start;
|
||||
*value = malloc (l + 1);
|
||||
if (*value == NULL)
|
||||
return end;
|
||||
strncpy (*value, start, l);
|
||||
(*value) [l] = 0;
|
||||
return p;
|
||||
}
|
||||
|
||||
static const char *
|
||||
parse_attributes (const char *p, const char *end, char ***names, char ***values, GError **error, int *full_stop, int state)
|
||||
{
|
||||
int nnames = 0;
|
||||
|
||||
while (TRUE){
|
||||
p = skip_space (p, end);
|
||||
if (p == end)
|
||||
return end;
|
||||
|
||||
if (*p == '>'){
|
||||
*full_stop = 0;
|
||||
return p;
|
||||
}
|
||||
if (state == SKIP_XML_DECLARATION && *p == '?' && ((p+1) < end) && *(p+1) == '>'){
|
||||
*full_stop = 0;
|
||||
return p+1;
|
||||
}
|
||||
|
||||
if (*p == '/' && ((p+1) < end && *(p+1) == '>')){
|
||||
*full_stop = 1;
|
||||
return p+1;
|
||||
} else {
|
||||
char *name, *value;
|
||||
|
||||
p = parse_name (p, end, &name);
|
||||
if (p == end)
|
||||
return p;
|
||||
|
||||
p = skip_space (p, end);
|
||||
if (p == end){
|
||||
free (name);
|
||||
return p;
|
||||
}
|
||||
if (*p != '='){
|
||||
set_error ("Expected an = after the attribute name `%s'", name);
|
||||
free (name);
|
||||
return end;
|
||||
}
|
||||
p++;
|
||||
p = skip_space (p, end);
|
||||
if (p == end){
|
||||
free (name);
|
||||
return end;
|
||||
}
|
||||
|
||||
p = parse_value (p, end, &value, error);
|
||||
if (p == end){
|
||||
free (name);
|
||||
return p;
|
||||
}
|
||||
|
||||
++nnames;
|
||||
*names = g_realloc (*names, sizeof (char **) * (nnames+1));
|
||||
*values = g_realloc (*values, sizeof (char **) * (nnames+1));
|
||||
(*names) [nnames-1] = name;
|
||||
(*values) [nnames-1] = value;
|
||||
(*names) [nnames] = NULL;
|
||||
(*values) [nnames] = NULL;
|
||||
}
|
||||
}
|
||||
}
|
||||
|
||||
static void
|
||||
destroy_parse_state (GMarkupParseContext *context)
|
||||
{
|
||||
GSList *p;
|
||||
|
||||
for (p = context->level; p != NULL; p = p->next)
|
||||
g_free (p->data);
|
||||
|
||||
g_slist_free (context->level);
|
||||
if (context->text != NULL)
|
||||
g_string_free (context->text, TRUE);
|
||||
context->text = NULL;
|
||||
context->level = NULL;
|
||||
}
|
||||
|
||||
gboolean
|
||||
g_markup_parse_context_parse (GMarkupParseContext *context,
|
||||
const gchar *text, gssize text_len,
|
||||
GError **error)
|
||||
{
|
||||
const char *p, *end;
|
||||
|
||||
g_return_val_if_fail (context != NULL, FALSE);
|
||||
g_return_val_if_fail (text != NULL, FALSE);
|
||||
g_return_val_if_fail (text_len >= 0, FALSE);
|
||||
|
||||
end = text + text_len;
|
||||
|
||||
for (p = text; p < end; p++){
|
||||
char c = *p;
|
||||
|
||||
switch (context->state){
|
||||
case START:
|
||||
if (c == ' ' || c == '\t' || c == '\f' || c == '\n')
|
||||
continue;
|
||||
if (c == '<'){
|
||||
if (p+1 < end && p [1] == '?'){
|
||||
context->state = SKIP_XML_DECLARATION;
|
||||
p++;
|
||||
} else
|
||||
context->state = START_ELEMENT;
|
||||
continue;
|
||||
}
|
||||
set_error ("Expected < to start the document");
|
||||
goto fail;
|
||||
|
||||
case SKIP_XML_DECLARATION:
|
||||
case START_ELEMENT: {
|
||||
const char *element_start = p, *element_end;
|
||||
char *ename = NULL;
|
||||
int full_stop = 0, l;
|
||||
gchar **names = NULL, **values = NULL;
|
||||
|
||||
for (; p < end && isspace (*p); p++)
|
||||
;
|
||||
if (p == end){
|
||||
set_error ("Unfinished element");
|
||||
goto fail;
|
||||
}
|
||||
|
||||
if (*p == '!' && (p+2 < end) && (p [1] == '-') && (p [2] == '-')){
|
||||
context->state = COMMENT;
|
||||
p += 2;
|
||||
break;
|
||||
}
|
||||
|
||||
if (!(isascii (*p) && isalpha (*p))){
|
||||
set_error ("Expected an element name");
|
||||
goto fail;
|
||||
}
|
||||
|
||||
for (++p; p < end && (isalnum (*p) || (*p == '.')); p++)
|
||||
;
|
||||
if (p == end){
|
||||
set_error ("Expected an element");
|
||||
goto fail;
|
||||
}
|
||||
element_end = p;
|
||||
|
||||
for (; p < end && isspace (*p); p++)
|
||||
;
|
||||
if (p == end){
|
||||
set_error ("Unfinished element");
|
||||
goto fail;
|
||||
}
|
||||
p = parse_attributes (p, end, &names, &values, error, &full_stop, context->state);
|
||||
if (p == end){
|
||||
if (names != NULL) {
|
||||
g_strfreev (names);
|
||||
g_strfreev (values);
|
||||
}
|
||||
/* Only set the error if parse_attributes did not */
|
||||
if (error != NULL && *error == NULL)
|
||||
set_error ("Unfinished sequence");
|
||||
goto fail;
|
||||
}
|
||||
l = element_end - element_start;
|
||||
ename = malloc (l + 1);
|
||||
if (ename == NULL)
|
||||
goto fail;
|
||||
strncpy (ename, element_start, l);
|
||||
ename [l] = 0;
|
||||
|
||||
if (context->state == START_ELEMENT)
|
||||
if (context->parser.start_element != NULL)
|
||||
context->parser.start_element (context, ename,
|
||||
(const gchar **) names,
|
||||
(const gchar **) values,
|
||||
context->user_data, error);
|
||||
|
||||
if (names != NULL){
|
||||
g_strfreev (names);
|
||||
g_strfreev (values);
|
||||
}
|
||||
|
||||
if (error != NULL && *error != NULL){
|
||||
free (ename);
|
||||
goto fail;
|
||||
}
|
||||
|
||||
if (full_stop){
|
||||
if (context->parser.end_element != NULL && context->state == START_ELEMENT){
|
||||
context->parser.end_element (context, ename, context->user_data, error);
|
||||
if (error != NULL && *error != NULL){
|
||||
free (ename);
|
||||
goto fail;
|
||||
}
|
||||
}
|
||||
free (ename);
|
||||
} else {
|
||||
context->level = g_slist_prepend (context->level, ename);
|
||||
}
|
||||
|
||||
context->state = TEXT;
|
||||
break;
|
||||
} /* case START_ELEMENT */
|
||||
|
||||
case TEXT: {
|
||||
if (c == '<'){
|
||||
context->state = FLUSH_TEXT;
|
||||
break;
|
||||
}
|
||||
if (context->parser.text != NULL){
|
||||
if (context->text == NULL)
|
||||
context->text = g_string_new ("");
|
||||
g_string_append_c (context->text, c);
|
||||
}
|
||||
break;
|
||||
}
|
||||
|
||||
case COMMENT:
|
||||
if (*p != '-')
|
||||
break;
|
||||
if (p+2 < end && (p [1] == '-') && (p [2] == '>')){
|
||||
context->state = TEXT;
|
||||
p += 2;
|
||||
break;
|
||||
}
|
||||
break;
|
||||
|
||||
case FLUSH_TEXT:
|
||||
if (context->parser.text != NULL){
|
||||
context->parser.text (context, context->text->str, context->text->len,
|
||||
context->user_data, error);
|
||||
if (error != NULL && *error != NULL)
|
||||
goto fail;
|
||||
}
|
||||
|
||||
if (c == '/')
|
||||
context->state = CLOSING_ELEMENT;
|
||||
else {
|
||||
p--;
|
||||
context->state = START_ELEMENT;
|
||||
}
|
||||
break;
|
||||
|
||||
case CLOSING_ELEMENT: {
|
||||
GSList *current = context->level;
|
||||
char *text;
|
||||
|
||||
if (context->level == NULL){
|
||||
set_error ("Too many closing tags, not enough open tags");
|
||||
goto fail;
|
||||
}
|
||||
|
||||
text = current->data;
|
||||
if (context->parser.end_element != NULL){
|
||||
context->parser.end_element (context, text, context->user_data, error);
|
||||
if (error != NULL && *error != NULL){
|
||||
free (text);
|
||||
goto fail;
|
||||
}
|
||||
}
|
||||
free (text);
|
||||
|
||||
while (p < end && *p != '>')
|
||||
p++;
|
||||
|
||||
context->level = context->level->next;
|
||||
g_slist_free_1 (current);
|
||||
context->state = TEXT;
|
||||
break;
|
||||
} /* case CLOSING_ELEMENT */
|
||||
|
||||
} /* switch */
|
||||
}
|
||||
|
||||
|
||||
return TRUE;
|
||||
fail:
|
||||
if (context->parser.error && error != NULL && *error)
|
||||
context->parser.error (context, *error, context->user_data);
|
||||
|
||||
destroy_parse_state (context);
|
||||
return FALSE;
|
||||
}
|
||||
|
||||
gboolean
|
||||
g_markup_parse_context_end_parse (GMarkupParseContext *context, GError **error)
|
||||
{
|
||||
g_return_val_if_fail (context != NULL, FALSE);
|
||||
|
||||
/*
|
||||
* In our case, we always signal errors during parse, not at the end
|
||||
* see the notes at the top of this file for details on how this
|
||||
* could be moved here
|
||||
*/
|
||||
return TRUE;
|
||||
}
|
||||
@@ -1,46 +0,0 @@
|
||||
/*
|
||||
* gmem.c: memory utility functions
|
||||
*
|
||||
* Author:
|
||||
* Gonzalo Paniagua Javier ([email protected])
|
||||
*
|
||||
* (C) 2006 Novell, Inc.
|
||||
*
|
||||
* Permission is hereby granted, free of charge, to any person obtaining
|
||||
* a copy of this software and associated documentation files (the
|
||||
* "Software"), to deal in the Software without restriction, including
|
||||
* without limitation the rights to use, copy, modify, merge, publish,
|
||||
* distribute, sublicense, and/or sell copies of the Software, and to
|
||||
* permit persons to whom the Software is furnished to do so, subject to
|
||||
* the following conditions:
|
||||
*
|
||||
* The above copyright notice and this permission notice shall be
|
||||
* included in all copies or substantial portions of the Software.
|
||||
*
|
||||
* THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND,
|
||||
* EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
|
||||
* MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND
|
||||
* NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE
|
||||
* LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION
|
||||
* OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION
|
||||
* WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
|
||||
*/
|
||||
#include <stdio.h>
|
||||
#include <string.h>
|
||||
#include <glib.h>
|
||||
|
||||
gpointer
|
||||
g_memdup (gconstpointer mem, guint byte_size)
|
||||
{
|
||||
gpointer ptr;
|
||||
|
||||
if (mem == NULL)
|
||||
return NULL;
|
||||
|
||||
ptr = g_malloc (byte_size);
|
||||
if (ptr != NULL)
|
||||
memcpy (ptr, mem, byte_size);
|
||||
|
||||
return ptr;
|
||||
}
|
||||
|
||||
@@ -1,49 +0,0 @@
|
||||
/*
|
||||
* gmisc.c: Misc functions with no place to go (right now)
|
||||
*
|
||||
* Author:
|
||||
* Aaron Bockover ([email protected])
|
||||
*
|
||||
* (C) 2006 Novell, Inc.
|
||||
*
|
||||
* Permission is hereby granted, free of charge, to any person obtaining
|
||||
* a copy of this software and associated documentation files (the
|
||||
* "Software"), to deal in the Software without restriction, including
|
||||
* without limitation the rights to use, copy, modify, merge, publish,
|
||||
* distribute, sublicense, and/or sell copies of the Software, and to
|
||||
* permit persons to whom the Software is furnished to do so, subject to
|
||||
* the following conditions:
|
||||
*
|
||||
* The above copyright notice and this permission notice shall be
|
||||
* included in all copies or substantial portions of the Software.
|
||||
*
|
||||
* THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND,
|
||||
* EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
|
||||
* MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND
|
||||
* NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE
|
||||
* LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION
|
||||
* OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION
|
||||
* WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
|
||||
*/
|
||||
|
||||
#include <stdlib.h>
|
||||
#include <glib.h>
|
||||
|
||||
const gchar *
|
||||
g_getenv(const gchar *variable)
|
||||
{
|
||||
return getenv(variable);
|
||||
}
|
||||
|
||||
gboolean
|
||||
g_setenv(const gchar *variable, const gchar *value, gboolean overwrite)
|
||||
{
|
||||
return setenv(variable, value, overwrite) == 0;
|
||||
}
|
||||
|
||||
void
|
||||
g_unsetenv(const gchar *variable)
|
||||
{
|
||||
unsetenv(variable);
|
||||
}
|
||||
|
||||
@@ -1,284 +0,0 @@
|
||||
/*
|
||||
* gmodule.c: dl* functions, glib style
|
||||
*
|
||||
* Author:
|
||||
* Gonzalo Paniagua Javier ([email protected])
|
||||
* Jonathan Chambers ([email protected])
|
||||
* Robert Jordan ([email protected])
|
||||
*
|
||||
* (C) 2006 Novell, Inc.
|
||||
* (C) 2006 Jonathan Chambers
|
||||
*
|
||||
* Permission is hereby granted, free of charge, to any person obtaining
|
||||
* a copy of this software and associated documentation files (the
|
||||
* "Software"), to deal in the Software without restriction, including
|
||||
* without limitation the rights to use, copy, modify, merge, publish,
|
||||
* distribute, sublicense, and/or sell copies of the Software, and to
|
||||
* permit persons to whom the Software is furnished to do so, subject to
|
||||
* the following conditions:
|
||||
*
|
||||
* The above copyright notice and this permission notice shall be
|
||||
* included in all copies or substantial portions of the Software.
|
||||
*
|
||||
* THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND,
|
||||
* EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
|
||||
* MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND
|
||||
* NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE
|
||||
* LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION
|
||||
* OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION
|
||||
* WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
|
||||
*/
|
||||
#include <glib.h>
|
||||
#include <gmodule.h>
|
||||
|
||||
#ifdef G_OS_UNIX
|
||||
#include <dlfcn.h>
|
||||
|
||||
/* For Linux and Solaris, need to add others as we port this */
|
||||
#define LIBPREFIX "lib"
|
||||
#define LIBSUFFIX ".so"
|
||||
|
||||
struct _GModule {
|
||||
void *handle;
|
||||
};
|
||||
|
||||
GModule *
|
||||
g_module_open (const gchar *file, GModuleFlags flags)
|
||||
{
|
||||
int f = 0;
|
||||
GModule *module;
|
||||
void *handle;
|
||||
|
||||
flags &= G_MODULE_BIND_MASK;
|
||||
if ((flags & G_MODULE_BIND_LAZY) != 0)
|
||||
f |= RTLD_LAZY;
|
||||
if ((flags & G_MODULE_BIND_LOCAL) != 0)
|
||||
f |= RTLD_LOCAL;
|
||||
|
||||
handle = dlopen (file, f);
|
||||
if (handle == NULL)
|
||||
return NULL;
|
||||
|
||||
module = g_new (GModule,1);
|
||||
module->handle = handle;
|
||||
|
||||
return module;
|
||||
}
|
||||
|
||||
gboolean
|
||||
g_module_symbol (GModule *module, const gchar *symbol_name, gpointer *symbol)
|
||||
{
|
||||
if (symbol_name == NULL || symbol == NULL)
|
||||
return FALSE;
|
||||
|
||||
if (module == NULL || module->handle == NULL)
|
||||
return FALSE;
|
||||
|
||||
*symbol = dlsym (module->handle, symbol_name);
|
||||
return (*symbol != NULL);
|
||||
}
|
||||
|
||||
const gchar *
|
||||
g_module_error (void)
|
||||
{
|
||||
return dlerror ();
|
||||
}
|
||||
|
||||
gboolean
|
||||
g_module_close (GModule *module)
|
||||
{
|
||||
void *handle;
|
||||
if (module == NULL || module->handle == NULL)
|
||||
return FALSE;
|
||||
|
||||
handle = module->handle;
|
||||
module->handle = NULL;
|
||||
g_free (module);
|
||||
return (0 == dlclose (handle));
|
||||
}
|
||||
|
||||
#elif defined (G_OS_WIN32)
|
||||
#include <windows.h>
|
||||
#include <psapi.h>
|
||||
|
||||
#define LIBSUFFIX ".dll"
|
||||
#define LIBPREFIX ""
|
||||
|
||||
struct _GModule {
|
||||
HMODULE handle;
|
||||
int main_module;
|
||||
};
|
||||
|
||||
GModule *
|
||||
g_module_open (const gchar *file, GModuleFlags flags)
|
||||
{
|
||||
GModule *module;
|
||||
module = g_malloc (sizeof (GModule));
|
||||
if (module == NULL)
|
||||
return NULL;
|
||||
|
||||
if (file != NULL) {
|
||||
module->main_module = FALSE;
|
||||
module->handle = LoadLibrary (file);
|
||||
if (!module->handle) {
|
||||
g_free (module);
|
||||
return NULL;
|
||||
}
|
||||
|
||||
} else {
|
||||
module->main_module = TRUE;
|
||||
module->handle = GetModuleHandle (NULL);
|
||||
}
|
||||
|
||||
return module;
|
||||
}
|
||||
|
||||
static gpointer
|
||||
w32_find_symbol (const gchar *symbol_name)
|
||||
{
|
||||
HMODULE *modules;
|
||||
DWORD buffer_size = sizeof (HMODULE) * 1024;
|
||||
DWORD needed, i;
|
||||
|
||||
modules = (HMODULE *) g_malloc (buffer_size);
|
||||
|
||||
if (modules == NULL)
|
||||
return NULL;
|
||||
|
||||
if (!EnumProcessModules (GetCurrentProcess (), modules,
|
||||
buffer_size, &needed)) {
|
||||
g_free (modules);
|
||||
return NULL;
|
||||
}
|
||||
|
||||
/* check whether the supplied buffer was too small, realloc, retry */
|
||||
if (needed > buffer_size) {
|
||||
g_free (modules);
|
||||
|
||||
buffer_size = needed;
|
||||
modules = (HMODULE *) g_malloc (buffer_size);
|
||||
|
||||
if (modules == NULL)
|
||||
return NULL;
|
||||
|
||||
if (!EnumProcessModules (GetCurrentProcess (), modules,
|
||||
buffer_size, &needed)) {
|
||||
g_free (modules);
|
||||
return NULL;
|
||||
}
|
||||
}
|
||||
|
||||
for (i = 0; i < needed / sizeof (HANDLE); i++) {
|
||||
gpointer proc = GetProcAddress (modules [i], symbol_name);
|
||||
if (proc != NULL) {
|
||||
g_free (modules);
|
||||
return proc;
|
||||
}
|
||||
}
|
||||
|
||||
g_free (modules);
|
||||
return NULL;
|
||||
}
|
||||
|
||||
gboolean
|
||||
g_module_symbol (GModule *module, const gchar *symbol_name, gpointer *symbol)
|
||||
{
|
||||
if (module == NULL || symbol_name == NULL || symbol == NULL)
|
||||
return FALSE;
|
||||
|
||||
if (module->main_module) {
|
||||
*symbol = GetProcAddress (module->handle, symbol_name);
|
||||
if (*symbol != NULL)
|
||||
return TRUE;
|
||||
|
||||
*symbol = w32_find_symbol (symbol_name);
|
||||
return *symbol != NULL;
|
||||
} else {
|
||||
*symbol = GetProcAddress (module->handle, symbol_name);
|
||||
return *symbol != NULL;
|
||||
}
|
||||
}
|
||||
|
||||
const gchar *
|
||||
g_module_error (void)
|
||||
{
|
||||
gchar* ret = NULL;
|
||||
TCHAR* buf = NULL;
|
||||
DWORD code = GetLastError ();
|
||||
|
||||
FormatMessage (FORMAT_MESSAGE_FROM_SYSTEM | FORMAT_MESSAGE_ALLOCATE_BUFFER, NULL,
|
||||
code, MAKELANGID(LANG_NEUTRAL, SUBLANG_DEFAULT), buf, 0, NULL);
|
||||
|
||||
ret = g_strdup (buf);
|
||||
LocalFree(buf);
|
||||
|
||||
return ret;
|
||||
}
|
||||
|
||||
gboolean
|
||||
g_module_close (GModule *module)
|
||||
{
|
||||
HMODULE handle;
|
||||
int main_module;
|
||||
|
||||
if (module == NULL || module->handle == NULL)
|
||||
return FALSE;
|
||||
|
||||
handle = module->handle;
|
||||
main_module = module->main_module;
|
||||
module->handle = NULL;
|
||||
g_free (module);
|
||||
return (main_module ? 1 : (0 == FreeLibrary (handle)));
|
||||
}
|
||||
|
||||
#else
|
||||
|
||||
#define LIBSUFFIX ""
|
||||
#define LIBPREFIX ""
|
||||
|
||||
GModule *
|
||||
g_module_open (const gchar *file, GModuleFlags flags)
|
||||
{
|
||||
g_error ("g_module_open not implemented on this platform");
|
||||
return NULL;
|
||||
}
|
||||
|
||||
gboolean
|
||||
g_module_symbol (GModule *module, const gchar *symbol_name, gpointer *symbol)
|
||||
{
|
||||
g_error ("g_module_open not implemented on this platform");
|
||||
return FALSE;
|
||||
}
|
||||
|
||||
const gchar *
|
||||
g_module_error (void)
|
||||
{
|
||||
g_error ("g_module_open not implemented on this platform");
|
||||
return NULL;
|
||||
}
|
||||
|
||||
gboolean
|
||||
g_module_close (GModule *module)
|
||||
{
|
||||
g_error ("g_module_open not implemented on this platform");
|
||||
return FALSE;
|
||||
}
|
||||
#endif
|
||||
|
||||
gchar *
|
||||
g_module_build_path (const gchar *directory, const gchar *module_name)
|
||||
{
|
||||
char *lib_prefix = "";
|
||||
|
||||
if (module_name == NULL)
|
||||
return NULL;
|
||||
|
||||
if (strncmp (module_name, "lib", 3) != 0)
|
||||
lib_prefix = LIBPREFIX;
|
||||
|
||||
if (directory && *directory){
|
||||
|
||||
return g_strdup_printf ("%s/%s%s" LIBSUFFIX, directory, lib_prefix, module_name);
|
||||
}
|
||||
return g_strdup_printf ("%s%s" LIBSUFFIX, lib_prefix, module_name);
|
||||
}
|
||||
@@ -1,30 +0,0 @@
|
||||
#ifndef __GLIB_GMODULE_H
|
||||
#define __GLIB_GMODULE_H
|
||||
|
||||
#include <glib.h>
|
||||
|
||||
#define G_MODULE_IMPORT extern
|
||||
#ifdef G_OS_WIN32
|
||||
#define G_MODULE_EXPORT __declspec(dllexport)
|
||||
#else
|
||||
#define G_MODULE_EXPORT
|
||||
#endif
|
||||
|
||||
/*
|
||||
* Modules
|
||||
*/
|
||||
typedef enum {
|
||||
G_MODULE_BIND_LAZY = 0x01,
|
||||
G_MODULE_BIND_LOCAL = 0x02,
|
||||
G_MODULE_BIND_MASK = 0x03
|
||||
} GModuleFlags;
|
||||
typedef struct _GModule GModule;
|
||||
|
||||
GModule *g_module_open (const gchar *file, GModuleFlags flags);
|
||||
gboolean g_module_symbol (GModule *module, const gchar *symbol_name,
|
||||
gpointer *symbol);
|
||||
const gchar *g_module_error (void);
|
||||
gboolean g_module_close (GModule *module);
|
||||
gchar * g_module_build_path (const gchar *directory, const gchar *module_name);
|
||||
|
||||
#endif
|
||||
@@ -1,91 +0,0 @@
|
||||
/*
|
||||
* Output and debugging functions
|
||||
*
|
||||
* Author:
|
||||
* Miguel de Icaza ([email protected])
|
||||
*
|
||||
* (C) 2006 Novell, Inc.
|
||||
* Permission is hereby granted, free of charge, to any person obtaining
|
||||
* a copy of this software and associated documentation files (the
|
||||
* "Software"), to deal in the Software without restriction, including
|
||||
* without limitation the rights to use, copy, modify, merge, publish,
|
||||
* distribute, sublicense, and/or sell copies of the Software, and to
|
||||
* permit persons to whom the Software is furnished to do so, subject to
|
||||
* the following conditions:
|
||||
*
|
||||
* The above copyright notice and this permission notice shall be
|
||||
* included in all copies or substantial portions of the Software.
|
||||
*
|
||||
* THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND,
|
||||
* EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
|
||||
* MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND
|
||||
* NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE
|
||||
* LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION
|
||||
* OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION
|
||||
* WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
|
||||
*/
|
||||
#include <stdio.h>
|
||||
#include <stdlib.h>
|
||||
#include <glib.h>
|
||||
|
||||
/* The current fatal levels, error is always fatal */
|
||||
static GLogLevelFlags fatal = G_LOG_LEVEL_ERROR;
|
||||
|
||||
void
|
||||
g_print (const gchar *format, ...)
|
||||
{
|
||||
va_list args;
|
||||
|
||||
va_start (args, format);
|
||||
vprintf (format, args);
|
||||
va_end (args);
|
||||
}
|
||||
|
||||
GLogLevelFlags
|
||||
g_log_set_always_fatal (GLogLevelFlags fatal_mask)
|
||||
{
|
||||
GLogLevelFlags old_fatal = fatal;
|
||||
|
||||
fatal |= fatal_mask;
|
||||
|
||||
return old_fatal;
|
||||
}
|
||||
|
||||
GLogLevelFlags
|
||||
g_log_set_fatal_mask (const gchar *log_domain, GLogLevelFlags fatal_mask)
|
||||
{
|
||||
/*
|
||||
* Mono does not use a G_LOG_DOMAIN currently, so we just assume things are fatal
|
||||
* if we decide to set G_LOG_DOMAIN (we probably should) we should implement
|
||||
* this.
|
||||
*/
|
||||
return fatal_mask;
|
||||
}
|
||||
|
||||
void
|
||||
g_logv (const gchar *log_domain, GLogLevelFlags log_level, const gchar *format, va_list args)
|
||||
{
|
||||
char *msg;
|
||||
|
||||
vasprintf (&msg, format, args);
|
||||
printf ("%s%s%s",
|
||||
log_domain != NULL ? log_domain : "",
|
||||
log_domain != NULL ? ": " : "",
|
||||
msg);
|
||||
free (msg);
|
||||
if (log_level & fatal)
|
||||
abort ();
|
||||
}
|
||||
|
||||
void
|
||||
g_log (const gchar *log_domain, GLogLevelFlags log_level, const gchar *format, ...)
|
||||
{
|
||||
char *fmt;
|
||||
va_list args;
|
||||
|
||||
va_start (args, format);
|
||||
g_logv (log_domain, log_level, format, args);
|
||||
fmt = g_strdup_printf (format, args);
|
||||
va_end (args);
|
||||
}
|
||||
|
||||
@@ -1,286 +0,0 @@
|
||||
/*
|
||||
* Portable Utility Functions
|
||||
*
|
||||
* Author:
|
||||
* Miguel de Icaza ([email protected])
|
||||
*
|
||||
* (C) 2006 Novell, Inc.
|
||||
*
|
||||
* Permission is hereby granted, free of charge, to any person obtaining
|
||||
* a copy of this software and associated documentation files (the
|
||||
* "Software"), to deal in the Software without restriction, including
|
||||
* without limitation the rights to use, copy, modify, merge, publish,
|
||||
* distribute, sublicense, and/or sell copies of the Software, and to
|
||||
* permit persons to whom the Software is furnished to do so, subject to
|
||||
* the following conditions:
|
||||
*
|
||||
* The above copyright notice and this permission notice shall be
|
||||
* included in all copies or substantial portions of the Software.
|
||||
*
|
||||
* THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND,
|
||||
* EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
|
||||
* MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND
|
||||
* NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE
|
||||
* LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION
|
||||
* OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION
|
||||
* WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
|
||||
*/
|
||||
#include <stdio.h>
|
||||
#include <glib.h>
|
||||
#include <unistd.h>
|
||||
#include <errno.h>
|
||||
#include <sys/types.h>
|
||||
#include <pwd.h>
|
||||
#include <pthread.h>
|
||||
|
||||
gchar *
|
||||
g_build_path (const gchar *separator, const gchar *first_element, ...)
|
||||
{
|
||||
GString *result;
|
||||
const char *s, *p, *next;
|
||||
int slen;
|
||||
va_list args;
|
||||
|
||||
g_return_val_if_fail (separator != NULL, NULL);
|
||||
g_return_val_if_fail (first_element != NULL, NULL);
|
||||
|
||||
result = g_string_sized_new (48);
|
||||
|
||||
slen = strlen (separator);
|
||||
|
||||
va_start (args, first_element);
|
||||
for (s = first_element; s != NULL; s = next){
|
||||
next = va_arg (args, char *);
|
||||
p = (s + strlen (s));
|
||||
|
||||
if (next && p - slen > s){
|
||||
for (; strncmp (p-slen, separator, slen) == 0; ){
|
||||
p -= slen;
|
||||
}
|
||||
}
|
||||
g_string_append_len (result, s, p - s);
|
||||
|
||||
if (next && *next){
|
||||
g_string_append (result, separator);
|
||||
|
||||
for (; strncmp (next, separator, slen) == 0; )
|
||||
next += slen;
|
||||
}
|
||||
}
|
||||
g_string_append_c (result, 0);
|
||||
va_end (args);
|
||||
|
||||
return g_string_free (result, FALSE);
|
||||
}
|
||||
|
||||
gchar *
|
||||
g_path_get_dirname (const gchar *filename)
|
||||
{
|
||||
char *p, *r;
|
||||
int count;
|
||||
g_return_val_if_fail (filename != NULL, NULL);
|
||||
|
||||
p = strrchr (filename, G_DIR_SEPARATOR);
|
||||
if (p == NULL)
|
||||
return g_strdup (".");
|
||||
if (p == filename)
|
||||
return g_strdup ("/");
|
||||
count = p - filename;
|
||||
r = g_malloc (count + 1);
|
||||
strncpy (r, filename, count);
|
||||
r [count] = 0;
|
||||
|
||||
return r;
|
||||
}
|
||||
|
||||
gchar *
|
||||
g_path_get_basename (const char *filename)
|
||||
{
|
||||
char *r;
|
||||
g_return_val_if_fail (filename != NULL, NULL);
|
||||
|
||||
/* Empty filename -> . */
|
||||
if (!*filename)
|
||||
return g_strdup (".");
|
||||
|
||||
/* No separator -> filename */
|
||||
r = strrchr (filename, G_DIR_SEPARATOR);
|
||||
if (r == NULL)
|
||||
return g_strdup (filename);
|
||||
|
||||
/* Trailing slash, remove component */
|
||||
if (r [1] == 0){
|
||||
char *copy = g_strdup (filename);
|
||||
copy [r-filename] = 0;
|
||||
r = strrchr (copy, G_DIR_SEPARATOR);
|
||||
|
||||
if (r == NULL){
|
||||
g_free (copy);
|
||||
return g_strdup ("/");
|
||||
}
|
||||
r = g_strdup (&r[1]);
|
||||
g_free (copy);
|
||||
return r;
|
||||
}
|
||||
|
||||
return g_strdup (&r[1]);
|
||||
}
|
||||
|
||||
gboolean
|
||||
g_path_is_absolute (const char *filename)
|
||||
{
|
||||
g_return_val_if_fail (filename != NULL, FALSE);
|
||||
return (*filename == '/');
|
||||
}
|
||||
|
||||
gchar *
|
||||
g_find_program_in_path (const gchar *program)
|
||||
{
|
||||
char *p = g_strdup (getenv ("PATH"));
|
||||
char *x = p, *l;
|
||||
gchar *curdir = NULL;
|
||||
char *save;
|
||||
|
||||
g_return_val_if_fail (program != NULL, NULL);
|
||||
|
||||
if (x == NULL || *x == '\0') {
|
||||
curdir = g_get_current_dir ();
|
||||
x = curdir;
|
||||
}
|
||||
|
||||
while ((l = strtok_r (x, G_SEARCHPATH_SEPARATOR_S, &save)) != NULL){
|
||||
char *probe_path;
|
||||
|
||||
x = NULL;
|
||||
probe_path = g_build_path (G_DIR_SEPARATOR_S, l, program, NULL);
|
||||
if (access (probe_path, X_OK) == 0){
|
||||
g_free (curdir);
|
||||
g_free (p);
|
||||
return probe_path;
|
||||
}
|
||||
g_free (probe_path);
|
||||
}
|
||||
g_free (curdir);
|
||||
g_free (p);
|
||||
return NULL;
|
||||
}
|
||||
|
||||
gchar *
|
||||
g_get_current_dir (void)
|
||||
{
|
||||
int s = 32;
|
||||
char *buffer = NULL, *r;
|
||||
gboolean fail;
|
||||
|
||||
do {
|
||||
buffer = g_realloc (buffer, s);
|
||||
r = getcwd (buffer, s);
|
||||
fail = (r == NULL && errno == ERANGE);
|
||||
if (fail) {
|
||||
s <<= 1;
|
||||
}
|
||||
} while (fail);
|
||||
|
||||
return r;
|
||||
}
|
||||
|
||||
#if defined (G_OS_UNIX)
|
||||
|
||||
static pthread_mutex_t home_lock = PTHREAD_MUTEX_INITIALIZER;
|
||||
static char *home_dir;
|
||||
|
||||
/* Give preference to /etc/passwd than HOME */
|
||||
const gchar *
|
||||
g_get_home_dir (void)
|
||||
{
|
||||
if (home_dir == NULL){
|
||||
uid_t uid;
|
||||
|
||||
pthread_mutex_lock (&home_lock);
|
||||
if (home_dir == NULL){
|
||||
struct passwd pwbuf, *track;
|
||||
char buf [4096];
|
||||
|
||||
uid = getuid ();
|
||||
|
||||
setpwent ();
|
||||
|
||||
while (getpwent_r (&pwbuf, buf, sizeof (buf), &track) == 0){
|
||||
if (pwbuf.pw_uid == uid){
|
||||
home_dir = g_strdup (pwbuf.pw_dir);
|
||||
break;
|
||||
}
|
||||
}
|
||||
endpwent ();
|
||||
if (home_dir == NULL)
|
||||
home_dir = getenv ("HOME");
|
||||
pthread_mutex_unlock (&home_lock);
|
||||
}
|
||||
}
|
||||
return home_dir;
|
||||
}
|
||||
|
||||
#elif defined (G_OS_WIN32)
|
||||
#include <windows.h>
|
||||
|
||||
const gchar *
|
||||
g_get_home_dir (void)
|
||||
{
|
||||
/* FIXME */
|
||||
return getenv ("HOME");
|
||||
}
|
||||
|
||||
#else
|
||||
|
||||
const gchar *
|
||||
g_get_home_dir (void)
|
||||
{
|
||||
g_error ("g_get_home_dir not implemented on this platform");
|
||||
return NULL;
|
||||
}
|
||||
|
||||
#endif
|
||||
|
||||
static char *tmp_dir;
|
||||
static pthread_mutex_t tmp_lock = PTHREAD_MUTEX_INITIALIZER;
|
||||
|
||||
const gchar *
|
||||
g_get_tmp_dir (void)
|
||||
{
|
||||
if (tmp_dir == NULL){
|
||||
pthread_mutex_lock (&tmp_lock);
|
||||
if (tmp_dir == NULL){
|
||||
tmp_dir = getenv ("TMPDIR");
|
||||
if (tmp_dir == NULL){
|
||||
tmp_dir = getenv ("TMP");
|
||||
if (tmp_dir == NULL){
|
||||
tmp_dir = getenv ("TEMP");
|
||||
if (tmp_dir == NULL)
|
||||
tmp_dir = "/tmp";
|
||||
}
|
||||
}
|
||||
}
|
||||
pthread_mutex_unlock (&tmp_lock);
|
||||
}
|
||||
return tmp_dir;
|
||||
}
|
||||
|
||||
const char *
|
||||
g_get_user_name (void)
|
||||
{
|
||||
return getenv ("USER");
|
||||
}
|
||||
|
||||
static char *name;
|
||||
|
||||
void
|
||||
g_set_prgname (const gchar *prgname)
|
||||
{
|
||||
name = g_strdup (prgname);
|
||||
}
|
||||
|
||||
gchar *
|
||||
g_get_prgname (void)
|
||||
{
|
||||
return name;
|
||||
}
|
||||
@@ -1,209 +0,0 @@
|
||||
/*
|
||||
* Simple pattern matching
|
||||
*
|
||||
* Author:
|
||||
* Gonzalo Paniagua Javier ([email protected]
|
||||
*
|
||||
* (C) 2006 Novell, Inc.
|
||||
*
|
||||
* Permission is hereby granted, free of charge, to any person obtaining
|
||||
* a copy of this software and associated documentation files (the
|
||||
* "Software"), to deal in the Software without restriction, including
|
||||
* without limitation the rights to use, copy, modify, merge, publish,
|
||||
* distribute, sublicense, and/or sell copies of the Software, and to
|
||||
* permit persons to whom the Software is furnished to do so, subject to
|
||||
* the following conditions:
|
||||
*
|
||||
* The above copyright notice and this permission notice shall be
|
||||
* included in all copies or substantial portions of the Software.
|
||||
*
|
||||
* THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND,
|
||||
* EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
|
||||
* MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND
|
||||
* NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE
|
||||
* LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION
|
||||
* OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION
|
||||
* WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
|
||||
*/
|
||||
#include <glib.h>
|
||||
#include <stdio.h>
|
||||
#include <stdlib.h>
|
||||
#include <unistd.h>
|
||||
#include <errno.h>
|
||||
|
||||
typedef enum {
|
||||
MATCH_LITERAL,
|
||||
MATCH_ANYCHAR,
|
||||
MATCH_ANYTHING,
|
||||
MATCH_ANYTHING_END
|
||||
} MatchType;
|
||||
|
||||
typedef struct {
|
||||
MatchType type;
|
||||
gchar *str;
|
||||
} PData;
|
||||
|
||||
struct _GPatternSpec {
|
||||
GSList *pattern;
|
||||
};
|
||||
|
||||
static GSList *
|
||||
compile_pattern (const gchar *pattern)
|
||||
{
|
||||
GSList *list;
|
||||
gint i, len;
|
||||
PData *data;
|
||||
gchar c;
|
||||
MatchType last = -1;
|
||||
GString *str;
|
||||
gboolean free_str;
|
||||
|
||||
if (pattern == NULL)
|
||||
return NULL;
|
||||
|
||||
data = NULL;
|
||||
list = NULL;
|
||||
free_str = TRUE;
|
||||
str = g_string_new ("");
|
||||
for (i = 0, len = strlen (pattern); i < len; i++) {
|
||||
c = pattern [i];
|
||||
if (c == '*' || c == '?') {
|
||||
if (str->len > 0) {
|
||||
data = g_new0 (PData, 1);
|
||||
data->type = MATCH_LITERAL;
|
||||
data->str = g_string_free (str, FALSE);
|
||||
list = g_slist_append (list, data);
|
||||
str = g_string_new ("");
|
||||
}
|
||||
|
||||
if (last == MATCH_ANYTHING && c == '*')
|
||||
continue;
|
||||
|
||||
data = g_new0 (PData, 1);
|
||||
data->type = (c == '*') ? MATCH_ANYTHING : MATCH_ANYCHAR;
|
||||
list = g_slist_append (list, data);
|
||||
last = data->type;
|
||||
} else {
|
||||
g_string_append_c (str, c);
|
||||
last = MATCH_LITERAL;
|
||||
}
|
||||
}
|
||||
|
||||
if (last == MATCH_ANYTHING && str->len == 0) {
|
||||
data->type = MATCH_ANYTHING_END;
|
||||
free_str = TRUE;
|
||||
} else if (str->len > 0) {
|
||||
data = g_new0 (PData, 1);
|
||||
data->type = MATCH_LITERAL;
|
||||
data->str = str->str;
|
||||
free_str = FALSE;
|
||||
list = g_slist_append (list, data);
|
||||
}
|
||||
g_string_free (str, free_str);
|
||||
return list;
|
||||
}
|
||||
|
||||
#ifdef DEBUG_PATTERN
|
||||
static void
|
||||
print_pattern (gpointer data, gpointer user_data)
|
||||
{
|
||||
PData *d = (PData *) data;
|
||||
|
||||
printf ("Type: %s", d->type == MATCH_LITERAL ? "literal" : d->type == MATCH_ANYCHAR ? "any char" : "anything");
|
||||
if (d->type == MATCH_LITERAL)
|
||||
printf (" String: %s", d->str);
|
||||
printf ("\n");
|
||||
}
|
||||
#endif
|
||||
|
||||
GPatternSpec *
|
||||
g_pattern_spec_new (const gchar *pattern)
|
||||
{
|
||||
GPatternSpec *spec;
|
||||
|
||||
g_return_val_if_fail (pattern != NULL, NULL);
|
||||
spec = g_new0 (GPatternSpec, 1);
|
||||
if (pattern) {
|
||||
spec->pattern = compile_pattern (pattern);
|
||||
#ifdef DEBUG_PATTERN
|
||||
g_slist_foreach (spec->pattern, print_pattern, NULL);
|
||||
printf ("\n");
|
||||
#endif
|
||||
}
|
||||
return spec;
|
||||
}
|
||||
|
||||
static void
|
||||
free_pdata (gpointer data, gpointer user_data)
|
||||
{
|
||||
PData *d = (PData *) data;
|
||||
|
||||
if (d->str)
|
||||
g_free (d->str);
|
||||
g_free (d);
|
||||
}
|
||||
|
||||
void
|
||||
g_pattern_spec_free (GPatternSpec *pspec)
|
||||
{
|
||||
if (pspec) {
|
||||
g_slist_foreach (pspec->pattern, free_pdata, NULL);
|
||||
g_slist_free (pspec->pattern);
|
||||
pspec->pattern = NULL;
|
||||
}
|
||||
g_free (pspec);
|
||||
}
|
||||
|
||||
static gboolean
|
||||
match_string (GSList *list, const gchar *str, gint idx, gint max)
|
||||
{
|
||||
gint len;
|
||||
|
||||
while (list && idx < max) {
|
||||
PData *data = (PData *) list->data;
|
||||
|
||||
if (data->type == MATCH_ANYTHING_END)
|
||||
return TRUE;
|
||||
|
||||
if (data->type == MATCH_LITERAL) {
|
||||
len = strlen (data->str);
|
||||
if (strncmp (&str [idx], data->str, len) != 0)
|
||||
return FALSE;
|
||||
idx += len;
|
||||
list = list->next;
|
||||
if (list) {
|
||||
/*
|
||||
* When recursing, we need this to avoid returning FALSE
|
||||
* because 'list' will not be NULL
|
||||
*/
|
||||
data = (PData *) list->data;
|
||||
if (data->type == MATCH_ANYTHING_END)
|
||||
return TRUE;
|
||||
}
|
||||
} else if (data->type == MATCH_ANYCHAR) {
|
||||
idx++;
|
||||
list = list->next;
|
||||
} else if (data->type == MATCH_ANYTHING) {
|
||||
while (idx < max) {
|
||||
if (match_string (list->next, str, idx++, max))
|
||||
return TRUE;
|
||||
}
|
||||
return FALSE;
|
||||
} else {
|
||||
g_assert_not_reached ();
|
||||
}
|
||||
}
|
||||
|
||||
return (list == NULL && idx >= max);
|
||||
}
|
||||
gboolean
|
||||
g_pattern_match_string (GPatternSpec *pspec, const gchar *string)
|
||||
{
|
||||
g_return_val_if_fail (pspec != NULL, FALSE);
|
||||
g_return_val_if_fail (string != NULL, FALSE);
|
||||
|
||||
if (pspec->pattern == NULL)
|
||||
return FALSE;
|
||||
return match_string (pspec->pattern, string, 0, strlen (string));
|
||||
}
|
||||
|
||||
@@ -1,182 +0,0 @@
|
||||
/*
|
||||
* Pointer Array
|
||||
*
|
||||
* Author:
|
||||
* Aaron Bockover ([email protected])
|
||||
*
|
||||
* (C) 2006 Novell, Inc.
|
||||
*
|
||||
* Permission is hereby granted, free of charge, to any person obtaining
|
||||
* a copy of this software and associated documentation files (the
|
||||
* "Software"), to deal in the Software without restriction, including
|
||||
* without limitation the rights to use, copy, modify, merge, publish,
|
||||
* distribute, sublicense, and/or sell copies of the Software, and to
|
||||
* permit persons to whom the Software is furnished to do so, subject to
|
||||
* the following conditions:
|
||||
*
|
||||
* The above copyright notice and this permission notice shall be
|
||||
* included in all copies or substantial portions of the Software.
|
||||
*
|
||||
* THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND,
|
||||
* EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
|
||||
* MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND
|
||||
* NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE
|
||||
* LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION
|
||||
* OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION
|
||||
* WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
|
||||
*/
|
||||
|
||||
#include <stdlib.h>
|
||||
#include <glib.h>
|
||||
|
||||
typedef struct _GPtrArrayPriv {
|
||||
gpointer *pdata;
|
||||
guint len;
|
||||
guint size;
|
||||
} GPtrArrayPriv;
|
||||
|
||||
static void
|
||||
g_ptr_array_grow(GPtrArrayPriv *array, guint length)
|
||||
{
|
||||
gint new_length = array->len + length;
|
||||
|
||||
g_return_if_fail(array != NULL);
|
||||
|
||||
if(new_length <= array->size) {
|
||||
return;
|
||||
}
|
||||
|
||||
array->size = 1;
|
||||
|
||||
while(array->size < new_length) {
|
||||
array->size <<= 1;
|
||||
}
|
||||
|
||||
array->size = MAX(array->size, 16);
|
||||
array->pdata = g_realloc(array->pdata, array->size * sizeof(gpointer));
|
||||
}
|
||||
|
||||
GPtrArray *
|
||||
g_ptr_array_new()
|
||||
{
|
||||
return g_ptr_array_sized_new(0);
|
||||
}
|
||||
|
||||
GPtrArray *
|
||||
g_ptr_array_sized_new(guint reserved_size)
|
||||
{
|
||||
GPtrArrayPriv *array = g_new0(GPtrArrayPriv, 1);
|
||||
|
||||
array->pdata = NULL;
|
||||
array->len = 0;
|
||||
array->size = 0;
|
||||
|
||||
if(reserved_size > 0) {
|
||||
g_ptr_array_grow(array, reserved_size);
|
||||
}
|
||||
|
||||
return (GPtrArray *)array;
|
||||
}
|
||||
|
||||
gpointer *
|
||||
g_ptr_array_free(GPtrArray *array, gboolean free_seg)
|
||||
{
|
||||
gpointer *data = NULL;
|
||||
|
||||
g_return_val_if_fail(array != NULL, NULL);
|
||||
|
||||
if(free_seg) {
|
||||
g_free(array->pdata);
|
||||
} else {
|
||||
data = array->pdata;
|
||||
}
|
||||
|
||||
g_free(array);
|
||||
|
||||
return data;
|
||||
}
|
||||
|
||||
void
|
||||
g_ptr_array_set_size(GPtrArray *array, gint length)
|
||||
{
|
||||
g_return_if_fail(array != NULL);
|
||||
|
||||
if(length > array->len) {
|
||||
g_ptr_array_grow((GPtrArrayPriv *)array, length);
|
||||
memset(array->pdata + array->len, 0, (length - array->len)
|
||||
* sizeof(gpointer));
|
||||
}
|
||||
|
||||
array->len = length;
|
||||
}
|
||||
|
||||
void
|
||||
g_ptr_array_add(GPtrArray *array, gpointer data)
|
||||
{
|
||||
g_return_if_fail(array != NULL);
|
||||
g_ptr_array_grow((GPtrArrayPriv *)array, 1);
|
||||
array->pdata[array->len++] = data;
|
||||
}
|
||||
|
||||
gpointer
|
||||
g_ptr_array_remove_index(GPtrArray *array, guint index)
|
||||
{
|
||||
gpointer removed_node;
|
||||
|
||||
g_return_val_if_fail(array != NULL, NULL);
|
||||
g_return_val_if_fail(index >= 0 || index < array->len, NULL);
|
||||
|
||||
removed_node = array->pdata[index];
|
||||
|
||||
if(index != array->len - 1) {
|
||||
g_memmove(array->pdata + index, array->pdata + index + 1,
|
||||
(array->len - index - 1) * sizeof(gpointer));
|
||||
}
|
||||
|
||||
array->len--;
|
||||
array->pdata[array->len] = NULL;
|
||||
|
||||
return removed_node;
|
||||
}
|
||||
|
||||
gboolean
|
||||
g_ptr_array_remove(GPtrArray *array, gpointer data)
|
||||
{
|
||||
guint i;
|
||||
|
||||
g_return_val_if_fail(array != NULL, FALSE);
|
||||
|
||||
for(i = 0; i < array->len; i++) {
|
||||
if(array->pdata[i] == data) {
|
||||
g_ptr_array_remove_index(array, i);
|
||||
return TRUE;
|
||||
}
|
||||
}
|
||||
|
||||
return FALSE;
|
||||
}
|
||||
|
||||
void
|
||||
g_ptr_array_foreach(GPtrArray *array, GFunc func, gpointer user_data)
|
||||
{
|
||||
gint i;
|
||||
|
||||
for(i = 0; i < array->len; i++) {
|
||||
func(g_ptr_array_index(array, i), user_data);
|
||||
}
|
||||
}
|
||||
|
||||
void
|
||||
g_ptr_array_sort(GPtrArray *array, GCompareFunc compare_func)
|
||||
{
|
||||
g_return_if_fail(array != NULL);
|
||||
qsort(array->pdata, array->len, sizeof(gpointer), compare_func);
|
||||
}
|
||||
|
||||
void
|
||||
g_ptr_array_sort_with_data(GPtrArray *array, GCompareDataFunc compare_func,
|
||||
gpointer user_data)
|
||||
{
|
||||
}
|
||||
|
||||
|
||||
@@ -1,91 +0,0 @@
|
||||
/*
|
||||
* gqueue.c: Queue
|
||||
*
|
||||
* Author:
|
||||
* Duncan Mak ([email protected])
|
||||
*
|
||||
* Permission is hereby granted, free of charge, to any person obtaining
|
||||
* a copy of this software and associated documentation files (the
|
||||
* "Software"), to deal in the Software without restriction, including
|
||||
* without limitation the rights to use, copy, modify, merge, publish,
|
||||
* distribute, sublicense, and/or sell copies of the Software, and to
|
||||
* permit persons to whom the Software is furnished to do so, subject to
|
||||
* the following conditions:
|
||||
*
|
||||
* The above copyright notice and this permission notice shall be
|
||||
* included in all copies or substantial portions of the Software.
|
||||
*
|
||||
* THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND,
|
||||
* EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
|
||||
* MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND
|
||||
* NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE
|
||||
* LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION
|
||||
* OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION
|
||||
* WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
|
||||
*
|
||||
* (C) 2006 Novell, Inc.
|
||||
*
|
||||
*/
|
||||
|
||||
#include <stdio.h>
|
||||
#include <glib.h>
|
||||
|
||||
gpointer
|
||||
g_queue_pop_head (GQueue *queue)
|
||||
{
|
||||
gpointer head = NULL;
|
||||
|
||||
if (queue->length != 0){
|
||||
GList *old_head;
|
||||
|
||||
old_head = queue->head;
|
||||
head = old_head->data;
|
||||
queue->head = old_head->next;
|
||||
queue->length--;
|
||||
g_list_free_1 (old_head);
|
||||
}
|
||||
|
||||
return head;
|
||||
}
|
||||
|
||||
gboolean
|
||||
g_queue_is_empty (GQueue *queue)
|
||||
{
|
||||
if (!queue)
|
||||
return TRUE;
|
||||
|
||||
return queue->length == 0;
|
||||
}
|
||||
|
||||
void
|
||||
g_queue_push_head (GQueue *queue, gpointer head)
|
||||
{
|
||||
if (!queue)
|
||||
return;
|
||||
|
||||
queue->head = g_list_prepend (queue->head, head);
|
||||
|
||||
if (!queue->tail)
|
||||
queue->tail = queue->head;
|
||||
|
||||
queue->length ++;
|
||||
}
|
||||
|
||||
GQueue *
|
||||
g_queue_new (void)
|
||||
{
|
||||
GQueue *queue = g_new0 (GQueue, 1);
|
||||
queue->length = 0;
|
||||
|
||||
return queue;
|
||||
}
|
||||
|
||||
void
|
||||
g_queue_free (GQueue *queue)
|
||||
{
|
||||
if (!queue)
|
||||
return;
|
||||
|
||||
g_list_free (queue->head);
|
||||
g_free (queue);
|
||||
}
|
||||
@@ -1,150 +0,0 @@
|
||||
/*
|
||||
* Shell utility functions.
|
||||
*
|
||||
* Author:
|
||||
* Gonzalo Paniagua Javier ([email protected]
|
||||
*
|
||||
* (C) 2006 Novell, Inc.
|
||||
*
|
||||
* Permission is hereby granted, free of charge, to any person obtaining
|
||||
* a copy of this software and associated documentation files (the
|
||||
* "Software"), to deal in the Software without restriction, including
|
||||
* without limitation the rights to use, copy, modify, merge, publish,
|
||||
* distribute, sublicense, and/or sell copies of the Software, and to
|
||||
* permit persons to whom the Software is furnished to do so, subject to
|
||||
* the following conditions:
|
||||
*
|
||||
* The above copyright notice and this permission notice shall be
|
||||
* included in all copies or substantial portions of the Software.
|
||||
*
|
||||
* THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND,
|
||||
* EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
|
||||
* MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND
|
||||
* NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE
|
||||
* LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION
|
||||
* OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION
|
||||
* WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
|
||||
*/
|
||||
#include <stdio.h>
|
||||
#include <glib.h>
|
||||
|
||||
static int
|
||||
split_cmdline (const gchar *cmdline, GPtrArray *array, GError **error)
|
||||
{
|
||||
gchar *ptr;
|
||||
gchar c;
|
||||
gboolean in_quote = FALSE;
|
||||
gboolean escaped = FALSE;
|
||||
gchar quote_char = '\0';
|
||||
GString *str;
|
||||
|
||||
str = g_string_new ("");
|
||||
ptr = (gchar *) cmdline;
|
||||
while ((c = *ptr++) != '\0') {
|
||||
if (escaped) {
|
||||
escaped = FALSE;
|
||||
if (!g_ascii_isspace (c))
|
||||
g_string_append_c (str, c);
|
||||
} else if (in_quote) {
|
||||
if (c == quote_char) {
|
||||
in_quote = FALSE;
|
||||
quote_char = '\0';
|
||||
g_ptr_array_add (array, g_string_free (str, FALSE));
|
||||
str = g_string_new ("");
|
||||
} else {
|
||||
g_string_append_c (str, c);
|
||||
}
|
||||
} else if (g_ascii_isspace (c)) {
|
||||
if (str->len > 0) {
|
||||
g_ptr_array_add (array, g_string_free (str, FALSE));
|
||||
str = g_string_new ("");
|
||||
}
|
||||
} else if (c == '\\') {
|
||||
escaped = TRUE;
|
||||
} else if (c == '\'' || c == '"') {
|
||||
in_quote = TRUE;
|
||||
quote_char = c;
|
||||
} else {
|
||||
g_string_append_c (str, c);
|
||||
}
|
||||
}
|
||||
|
||||
if (escaped) {
|
||||
if (error)
|
||||
*error = g_error_new (G_LOG_DOMAIN, 0, "Unfinished escape.");
|
||||
g_string_free (str, TRUE);
|
||||
return -1;
|
||||
}
|
||||
|
||||
if (in_quote) {
|
||||
if (error)
|
||||
*error = g_error_new (G_LOG_DOMAIN, 0, "Unfinished quote.");
|
||||
g_string_free (str, TRUE);
|
||||
return -1;
|
||||
}
|
||||
|
||||
if (str->len > 0) {
|
||||
g_ptr_array_add (array, g_string_free (str, FALSE));
|
||||
} else {
|
||||
g_string_free (str, TRUE);
|
||||
}
|
||||
g_ptr_array_add (array, NULL);
|
||||
return 0;
|
||||
}
|
||||
|
||||
gboolean
|
||||
g_shell_parse_argv (const gchar *command_line, gint *argcp, gchar ***argvp, GError **error)
|
||||
{
|
||||
GPtrArray *array;
|
||||
gint argc;
|
||||
gchar **argv;
|
||||
|
||||
g_return_val_if_fail (command_line, FALSE);
|
||||
g_return_val_if_fail (error == NULL || *error == NULL, FALSE);
|
||||
|
||||
array = g_ptr_array_new();
|
||||
if (split_cmdline (command_line, array, error)) {
|
||||
g_ptr_array_add (array, NULL);
|
||||
g_strfreev ((gchar **) array->pdata);
|
||||
g_ptr_array_free (array, FALSE);
|
||||
return FALSE;
|
||||
}
|
||||
|
||||
argc = array->len;
|
||||
argv = (gchar **) array->pdata;
|
||||
|
||||
if (argc == 1) {
|
||||
g_strfreev (argv);
|
||||
g_ptr_array_free (array, FALSE);
|
||||
return FALSE;
|
||||
}
|
||||
|
||||
if (argcp) {
|
||||
*argcp = array->len - 1;
|
||||
}
|
||||
|
||||
if (argvp) {
|
||||
*argvp = argv;
|
||||
} else {
|
||||
g_strfreev (argv);
|
||||
}
|
||||
|
||||
g_ptr_array_free (array, FALSE);
|
||||
return TRUE;
|
||||
}
|
||||
|
||||
gchar *
|
||||
g_shell_quote (const gchar *unquoted_string)
|
||||
{
|
||||
//g_error ("Not implemented");
|
||||
return g_strdup (unquoted_string);
|
||||
// return NULL;
|
||||
}
|
||||
|
||||
gchar *
|
||||
g_shell_unquote (const gchar *quoted_string, GError **error)
|
||||
{
|
||||
// g_error ("Not implemented");
|
||||
return g_strdup (quoted_string);
|
||||
// return NULL;
|
||||
}
|
||||
@@ -1,312 +0,0 @@
|
||||
/*
|
||||
* gslist.c: Singly-linked list implementation
|
||||
*
|
||||
* Authors:
|
||||
* Duncan Mak ([email protected])
|
||||
* Raja R Harinath ([email protected])
|
||||
*
|
||||
* Permission is hereby granted, free of charge, to any person obtaining
|
||||
* a copy of this software and associated documentation files (the
|
||||
* "Software"), to deal in the Software without restriction, including
|
||||
* without limitation the rights to use, copy, modify, merge, publish,
|
||||
* distribute, sublicense, and/or sell copies of the Software, and to
|
||||
* permit persons to whom the Software is furnished to do so, subject to
|
||||
* the following conditions:
|
||||
*
|
||||
* The above copyright notice and this permission notice shall be
|
||||
* included in all copies or substantial portions of the Software.
|
||||
*
|
||||
* THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND,
|
||||
* EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
|
||||
* MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND
|
||||
* NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE
|
||||
* LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION
|
||||
* OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION
|
||||
* WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
|
||||
*
|
||||
* (C) 2006 Novell, Inc.
|
||||
*/
|
||||
|
||||
#include <stdio.h>
|
||||
#include <glib.h>
|
||||
|
||||
GSList*
|
||||
g_slist_alloc (void)
|
||||
{
|
||||
return g_new0 (GSList, 1);
|
||||
}
|
||||
|
||||
void
|
||||
g_slist_free_1 (GSList *list)
|
||||
{
|
||||
g_free (list);
|
||||
}
|
||||
|
||||
GSList*
|
||||
g_slist_append (GSList *list, gpointer data)
|
||||
{
|
||||
return g_slist_concat (list, g_slist_prepend (NULL, data));
|
||||
}
|
||||
|
||||
/* This is also a list node constructor. */
|
||||
GSList*
|
||||
g_slist_prepend (GSList *list, gpointer data)
|
||||
{
|
||||
GSList *head = g_slist_alloc ();
|
||||
head->data = data;
|
||||
head->next = list;
|
||||
|
||||
return head;
|
||||
}
|
||||
|
||||
/*
|
||||
* Insert the given data in a new node after the current node.
|
||||
* Return new node.
|
||||
*/
|
||||
static inline GSList *
|
||||
insert_after (GSList *list, gpointer data)
|
||||
{
|
||||
list->next = g_slist_prepend (list->next, data);
|
||||
return list->next;
|
||||
}
|
||||
|
||||
/*
|
||||
* Return the node prior to the node containing 'data'.
|
||||
* If the list is empty, or the first node contains 'data', return NULL.
|
||||
* If no node contains 'data', return the last node.
|
||||
*/
|
||||
static inline GSList*
|
||||
find_prev (GSList *list, gconstpointer data)
|
||||
{
|
||||
GSList *prev = NULL;
|
||||
while (list) {
|
||||
if (list->data == data)
|
||||
break;
|
||||
prev = list;
|
||||
list = list->next;
|
||||
}
|
||||
return prev;
|
||||
}
|
||||
|
||||
/* like 'find_prev', but searches for node 'link' */
|
||||
static inline GSList*
|
||||
find_prev_link (GSList *list, GSList *link)
|
||||
{
|
||||
GSList *prev = NULL;
|
||||
while (list) {
|
||||
if (list == link)
|
||||
break;
|
||||
prev = list;
|
||||
list = list->next;
|
||||
}
|
||||
return prev;
|
||||
}
|
||||
|
||||
GSList*
|
||||
g_slist_insert_before (GSList *list, GSList *sibling, gpointer data)
|
||||
{
|
||||
GSList *prev = find_prev_link (list, sibling);
|
||||
|
||||
if (!prev)
|
||||
return g_slist_prepend (list, data);
|
||||
|
||||
insert_after (prev, data);
|
||||
return list;
|
||||
}
|
||||
|
||||
void
|
||||
g_slist_free (GSList *list)
|
||||
{
|
||||
while (list) {
|
||||
GSList *next = list->next;
|
||||
g_slist_free_1 (list);
|
||||
list = next;
|
||||
}
|
||||
}
|
||||
|
||||
GSList*
|
||||
g_slist_copy (GSList *list)
|
||||
{
|
||||
GSList *copy, *tmp;
|
||||
|
||||
if (!list)
|
||||
return NULL;
|
||||
|
||||
copy = g_slist_prepend (NULL, list->data);
|
||||
tmp = copy;
|
||||
|
||||
for (list = list->next; list; list = list->next)
|
||||
tmp = insert_after (tmp, list->data);
|
||||
|
||||
return copy;
|
||||
}
|
||||
|
||||
GSList*
|
||||
g_slist_concat (GSList *list1, GSList *list2)
|
||||
{
|
||||
if (!list1)
|
||||
return list2;
|
||||
|
||||
g_slist_last (list1)->next = list2;
|
||||
return list1;
|
||||
}
|
||||
|
||||
void
|
||||
g_slist_foreach (GSList *list, GFunc func, gpointer user_data)
|
||||
{
|
||||
while (list) {
|
||||
(*func) (list->data, user_data);
|
||||
list = list->next;
|
||||
}
|
||||
}
|
||||
|
||||
GSList*
|
||||
g_slist_last (GSList *list)
|
||||
{
|
||||
if (!list)
|
||||
return NULL;
|
||||
|
||||
while (list->next)
|
||||
list = list->next;
|
||||
|
||||
return list;
|
||||
}
|
||||
|
||||
GSList*
|
||||
g_slist_find (GSList *list, gconstpointer data)
|
||||
{
|
||||
for (; list; list = list->next)
|
||||
if (list->data == data)
|
||||
break;
|
||||
return list;
|
||||
}
|
||||
|
||||
guint
|
||||
g_slist_length (GSList *list)
|
||||
{
|
||||
guint length = 0;
|
||||
|
||||
while (list) {
|
||||
length ++;
|
||||
list = list->next;
|
||||
}
|
||||
|
||||
return length;
|
||||
}
|
||||
|
||||
GSList*
|
||||
g_slist_remove (GSList *list, gconstpointer data)
|
||||
{
|
||||
GSList *prev = find_prev (list, data);
|
||||
GSList *current = prev ? prev->next : list;
|
||||
|
||||
if (current) {
|
||||
if (prev)
|
||||
prev->next = current->next;
|
||||
else
|
||||
list = current->next;
|
||||
g_slist_free_1 (current);
|
||||
}
|
||||
|
||||
return list;
|
||||
}
|
||||
|
||||
GSList*
|
||||
g_slist_remove_all (GSList *list, gconstpointer data)
|
||||
{
|
||||
GSList *next = list;
|
||||
GSList *prev = NULL;
|
||||
GSList *current;
|
||||
|
||||
while (next) {
|
||||
GSList *tmp_prev = find_prev (next, data);
|
||||
if (tmp_prev)
|
||||
prev = tmp_prev;
|
||||
current = prev ? prev->next : list;
|
||||
|
||||
if (!current)
|
||||
break;
|
||||
|
||||
next = current->next;
|
||||
|
||||
if (prev)
|
||||
prev->next = next;
|
||||
else
|
||||
list = next;
|
||||
g_slist_free_1 (current);
|
||||
}
|
||||
|
||||
return list;
|
||||
}
|
||||
|
||||
GSList*
|
||||
g_slist_remove_link (GSList *list, GSList *link)
|
||||
{
|
||||
GSList *prev = find_prev_link (list, link);
|
||||
GSList *current = prev ? prev->next : list;
|
||||
|
||||
if (current) {
|
||||
if (prev)
|
||||
prev->next = current->next;
|
||||
else
|
||||
list = current->next;
|
||||
current->next = NULL;
|
||||
}
|
||||
|
||||
return list;
|
||||
}
|
||||
|
||||
GSList*
|
||||
g_slist_delete_link (GSList *list, GSList *link)
|
||||
{
|
||||
list = g_slist_remove_link (list, link);
|
||||
g_slist_free_1 (link);
|
||||
|
||||
return list;
|
||||
}
|
||||
|
||||
GSList*
|
||||
g_slist_reverse (GSList *list)
|
||||
{
|
||||
GSList *prev = NULL;
|
||||
while (list){
|
||||
GSList *next = list->next;
|
||||
list->next = prev;
|
||||
prev = list;
|
||||
list = next;
|
||||
}
|
||||
|
||||
return prev;
|
||||
}
|
||||
|
||||
GSList*
|
||||
g_slist_insert_sorted (GSList *list, gpointer data, GCompareFunc func)
|
||||
{
|
||||
GSList *prev = NULL;
|
||||
|
||||
if (!func)
|
||||
return list;
|
||||
|
||||
if (!list || func (list->data, data) > 0)
|
||||
return g_slist_prepend (list, data);
|
||||
|
||||
/* Invariant: func (prev->data, data) <= 0) */
|
||||
for (prev = list; prev->next; prev = prev->next)
|
||||
if (func (prev->next->data, data) > 0)
|
||||
break;
|
||||
|
||||
/* ... && (prev->next == 0 || func (prev->next->data, data) > 0)) */
|
||||
insert_after (prev, data);
|
||||
return list;
|
||||
}
|
||||
|
||||
typedef GSList list_node;
|
||||
#include "sort.frag.h"
|
||||
|
||||
GSList*
|
||||
g_slist_sort (GSList *list, GCompareFunc func)
|
||||
{
|
||||
if (!list || !list->next)
|
||||
return list;
|
||||
return do_sort (list, func);
|
||||
}
|
||||
@@ -1,414 +0,0 @@
|
||||
/*
|
||||
* Spawning processes.
|
||||
*
|
||||
* Author:
|
||||
* Gonzalo Paniagua Javier ([email protected]
|
||||
*
|
||||
* (C) 2006 Novell, Inc.
|
||||
*
|
||||
* Permission is hereby granted, free of charge, to any person obtaining
|
||||
* a copy of this software and associated documentation files (the
|
||||
* "Software"), to deal in the Software without restriction, including
|
||||
* without limitation the rights to use, copy, modify, merge, publish,
|
||||
* distribute, sublicense, and/or sell copies of the Software, and to
|
||||
* permit persons to whom the Software is furnished to do so, subject to
|
||||
* the following conditions:
|
||||
*
|
||||
* The above copyright notice and this permission notice shall be
|
||||
* included in all copies or substantial portions of the Software.
|
||||
*
|
||||
* THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND,
|
||||
* EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
|
||||
* MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND
|
||||
* NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE
|
||||
* LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION
|
||||
* OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION
|
||||
* WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
|
||||
*/
|
||||
#include <stdio.h>
|
||||
#include <stdlib.h>
|
||||
#include <errno.h>
|
||||
#include <unistd.h>
|
||||
#include <unistd.h>
|
||||
#include <fcntl.h>
|
||||
#include <sys/time.h>
|
||||
#include <sys/wait.h>
|
||||
#include <sys/types.h>
|
||||
#include <glib.h>
|
||||
|
||||
#define set_error(msg...) do { if (error != NULL) *error = g_error_new (G_LOG_DOMAIN, 1, msg); } while (0)
|
||||
#define set_error_cond(cond,msg...) do { if ((cond) && error != NULL) *error = g_error_new (G_LOG_DOMAIN, 1, msg); } while (0)
|
||||
#define set_error_status(status,msg...) do { if (error != NULL) *error = g_error_new (G_LOG_DOMAIN, status, msg); } while (0)
|
||||
#define NO_INTR(var,cmd) do { (var) = (cmd); } while ((var) == -1 && errno == EINTR)
|
||||
#define CLOSE_PIPE(p) do { close (p [0]); close (p [1]); } while (0)
|
||||
|
||||
static int
|
||||
safe_read (int fd, gchar *buffer, gint count, GError **error)
|
||||
{
|
||||
int res;
|
||||
|
||||
NO_INTR (res, read (fd, buffer, count));
|
||||
set_error_cond (res == -1, "Error reading from pipe.");
|
||||
return res;
|
||||
}
|
||||
|
||||
static int
|
||||
read_pipes (int outfd, gchar **out_str, int errfd, gchar **err_str, GError **error)
|
||||
{
|
||||
fd_set rfds;
|
||||
int res;
|
||||
gboolean out_closed;
|
||||
gboolean err_closed;
|
||||
GString *out = NULL;
|
||||
GString *err = NULL;
|
||||
gchar *buffer = NULL;
|
||||
gint nread;
|
||||
|
||||
out_closed = (outfd < 0);
|
||||
err_closed = (errfd < 0);
|
||||
if (out_str) {
|
||||
*out_str = NULL;
|
||||
out = g_string_new ("");
|
||||
}
|
||||
|
||||
if (err_str) {
|
||||
*err_str = NULL;
|
||||
err = g_string_new ("");
|
||||
}
|
||||
|
||||
do {
|
||||
if (out_closed && err_closed)
|
||||
break;
|
||||
|
||||
FD_ZERO (&rfds);
|
||||
if (!out_closed && outfd >= 0)
|
||||
FD_SET (outfd, &rfds);
|
||||
if (!err_closed && errfd >= 0)
|
||||
FD_SET (errfd, &rfds);
|
||||
|
||||
res = select (MAX (outfd, errfd) + 1, &rfds, NULL, NULL, NULL);
|
||||
if (res > 0) {
|
||||
if (buffer == NULL)
|
||||
buffer = g_malloc (1024);
|
||||
if (!out_closed && FD_ISSET (outfd, &rfds)) {
|
||||
nread = safe_read (outfd, buffer, 1024, error);
|
||||
if (nread < 0) {
|
||||
close (errfd);
|
||||
close (outfd);
|
||||
return -1;
|
||||
}
|
||||
g_string_append_len (out, buffer, nread);
|
||||
if (nread <= 0) {
|
||||
out_closed = TRUE;
|
||||
close (outfd);
|
||||
}
|
||||
}
|
||||
|
||||
if (!err_closed && FD_ISSET (errfd, &rfds)) {
|
||||
nread = safe_read (errfd, buffer, 1024, error);
|
||||
if (nread < 0) {
|
||||
close (errfd);
|
||||
close (outfd);
|
||||
return -1;
|
||||
}
|
||||
g_string_append_len (err, buffer, nread);
|
||||
if (nread <= 0) {
|
||||
err_closed = TRUE;
|
||||
close (errfd);
|
||||
}
|
||||
}
|
||||
}
|
||||
} while (res > 0 || (res == -1 && errno == EINTR));
|
||||
|
||||
g_free (buffer);
|
||||
if (out_str)
|
||||
*out_str = g_string_free (out, FALSE);
|
||||
|
||||
if (err_str)
|
||||
*err_str = g_string_free (err, FALSE);
|
||||
|
||||
return 0;
|
||||
}
|
||||
|
||||
static gboolean
|
||||
create_pipe (int *fds, GError **error)
|
||||
{
|
||||
if (pipe (fds) == -1) {
|
||||
set_error ("Error creating pipe.");
|
||||
return FALSE;
|
||||
}
|
||||
return TRUE;
|
||||
}
|
||||
|
||||
gboolean
|
||||
g_spawn_command_line_sync (const gchar *command_line,
|
||||
gchar **standard_output,
|
||||
gchar **standard_error,
|
||||
gint *exit_status,
|
||||
GError **error)
|
||||
{
|
||||
pid_t pid;
|
||||
gchar **argv;
|
||||
gint argc;
|
||||
int stdout_pipe [2] = { -1, -1 };
|
||||
int stderr_pipe [2] = { -1, -1 };
|
||||
int status;
|
||||
int res;
|
||||
|
||||
if (!g_shell_parse_argv (command_line, &argc, &argv, error))
|
||||
return FALSE;
|
||||
|
||||
if (standard_output && !create_pipe (stdout_pipe, error))
|
||||
return FALSE;
|
||||
|
||||
if (standard_error && !create_pipe (stderr_pipe, error)) {
|
||||
if (standard_output) {
|
||||
CLOSE_PIPE (stdout_pipe);
|
||||
}
|
||||
return FALSE;
|
||||
}
|
||||
|
||||
pid = fork ();
|
||||
if (pid == 0) {
|
||||
gint i;
|
||||
|
||||
if (standard_output) {
|
||||
close (stdout_pipe [0]);
|
||||
dup2 (stdout_pipe [1], STDOUT_FILENO);
|
||||
}
|
||||
|
||||
if (standard_error) {
|
||||
close (stderr_pipe [0]);
|
||||
dup2 (stderr_pipe [1], STDERR_FILENO);
|
||||
}
|
||||
for (i = getdtablesize () - 1; i >= 3; i--)
|
||||
close (i);
|
||||
|
||||
/* G_SPAWN_SEARCH_PATH is always enabled for g_spawn_command_line_sync */
|
||||
if (!g_path_is_absolute (argv [0])) {
|
||||
gchar *arg0;
|
||||
|
||||
arg0 = g_find_program_in_path (argv [0]);
|
||||
if (arg0 == NULL) {
|
||||
exit (1);
|
||||
}
|
||||
//g_free (argv [0]);
|
||||
argv [0] = arg0;
|
||||
}
|
||||
execv (argv [0], argv);
|
||||
exit (1); /* TODO: What now? */
|
||||
}
|
||||
|
||||
g_strfreev (argv);
|
||||
if (standard_output)
|
||||
close (stdout_pipe [1]);
|
||||
|
||||
if (standard_error)
|
||||
close (stderr_pipe [1]);
|
||||
|
||||
if (standard_output || standard_error) {
|
||||
res = read_pipes (stdout_pipe [0], standard_output, stderr_pipe [0], standard_error, error);
|
||||
if (res) {
|
||||
waitpid (pid, &status, WNOHANG); /* avoid zombie */
|
||||
return FALSE;
|
||||
}
|
||||
}
|
||||
|
||||
NO_INTR (res, waitpid (pid, &status, 0));
|
||||
|
||||
/* TODO: What if error? */
|
||||
if (WIFEXITED (status) && exit_status) {
|
||||
*exit_status = WEXITSTATUS (status);
|
||||
}
|
||||
|
||||
return TRUE;
|
||||
}
|
||||
|
||||
/*
|
||||
* This is the only use we have in mono/metadata
|
||||
!g_spawn_async_with_pipes (NULL, (char**)addr_argv, NULL, G_SPAWN_SEARCH_PATH, NULL, NULL, &child_pid, &ch_in, &ch_out, NULL, NULL)
|
||||
*/
|
||||
gboolean
|
||||
g_spawn_async_with_pipes (const gchar *working_directory,
|
||||
gchar **argv,
|
||||
gchar **envp,
|
||||
GSpawnFlags flags,
|
||||
GSpawnChildSetupFunc child_setup,
|
||||
gpointer user_data,
|
||||
GPid *child_pid,
|
||||
gint *standard_input,
|
||||
gint *standard_output,
|
||||
gint *standard_error,
|
||||
GError **error)
|
||||
{
|
||||
pid_t pid;
|
||||
int info_pipe [2];
|
||||
int in_pipe [2] = { -1, -1 };
|
||||
int out_pipe [2] = { -1, -1 };
|
||||
int err_pipe [2] = { -1, -1 };
|
||||
int status;
|
||||
|
||||
g_return_val_if_fail (argv != NULL, FALSE); /* Only mandatory arg */
|
||||
|
||||
if (!create_pipe (info_pipe, error))
|
||||
return FALSE;
|
||||
|
||||
if (standard_output && !create_pipe (out_pipe, error)) {
|
||||
CLOSE_PIPE (info_pipe);
|
||||
return FALSE;
|
||||
}
|
||||
|
||||
if (standard_error && !create_pipe (err_pipe, error)) {
|
||||
CLOSE_PIPE (info_pipe);
|
||||
CLOSE_PIPE (out_pipe);
|
||||
return FALSE;
|
||||
}
|
||||
|
||||
if (standard_input && !create_pipe (in_pipe, error)) {
|
||||
CLOSE_PIPE (info_pipe);
|
||||
CLOSE_PIPE (out_pipe);
|
||||
CLOSE_PIPE (err_pipe);
|
||||
return FALSE;
|
||||
}
|
||||
|
||||
pid = fork ();
|
||||
if (pid == -1) {
|
||||
CLOSE_PIPE (info_pipe);
|
||||
CLOSE_PIPE (out_pipe);
|
||||
CLOSE_PIPE (err_pipe);
|
||||
CLOSE_PIPE (in_pipe);
|
||||
set_error ("Error in fork ()");
|
||||
return FALSE;
|
||||
}
|
||||
|
||||
if (pid == 0) {
|
||||
/* No zombie left behind */
|
||||
if ((flags & G_SPAWN_DO_NOT_REAP_CHILD) == 0) {
|
||||
pid = fork ();
|
||||
}
|
||||
|
||||
if (pid != 0) {
|
||||
exit (pid == -1 ? 1 : 0);
|
||||
} else {
|
||||
gint i;
|
||||
int fd;
|
||||
gchar *arg0;
|
||||
gchar **actual_args;
|
||||
gint unused;
|
||||
|
||||
close (info_pipe [0]);
|
||||
close (in_pipe [1]);
|
||||
close (out_pipe [0]);
|
||||
close (err_pipe [0]);
|
||||
|
||||
/* when exec* succeeds, we want to close this fd, which will return
|
||||
* a 0 read on the parent. We're not supposed to keep it open forever.
|
||||
* If exec fails, we still can write the error to it before closing.
|
||||
*/
|
||||
fcntl (info_pipe [1], F_SETFD, FD_CLOEXEC);
|
||||
|
||||
if ((flags & G_SPAWN_DO_NOT_REAP_CHILD) == 0) {
|
||||
pid = getpid ();
|
||||
NO_INTR (unused, write (info_pipe [1], &pid, sizeof (pid_t)));
|
||||
}
|
||||
|
||||
if (working_directory && chdir (working_directory) == -1) {
|
||||
int err = errno;
|
||||
NO_INTR (unused, write (info_pipe [1], &err, sizeof (int)));
|
||||
exit (0);
|
||||
}
|
||||
|
||||
if (standard_output) {
|
||||
dup2 (out_pipe [1], STDOUT_FILENO);
|
||||
} else if ((flags & G_SPAWN_STDOUT_TO_DEV_NULL) != 0) {
|
||||
fd = open ("/dev/null", O_WRONLY);
|
||||
dup2 (fd, STDOUT_FILENO);
|
||||
}
|
||||
|
||||
if (standard_error) {
|
||||
dup2 (err_pipe [1], STDERR_FILENO);
|
||||
} else if ((flags & G_SPAWN_STDERR_TO_DEV_NULL) != 0) {
|
||||
fd = open ("/dev/null", O_WRONLY);
|
||||
dup2 (fd, STDERR_FILENO);
|
||||
}
|
||||
|
||||
if (standard_input) {
|
||||
dup2 (in_pipe [0], STDERR_FILENO);
|
||||
} else if ((flags & G_SPAWN_CHILD_INHERITS_STDIN) == 0) {
|
||||
fd = open ("/dev/null", O_RDONLY);
|
||||
dup2 (fd, STDERR_FILENO);
|
||||
}
|
||||
|
||||
if ((flags & G_SPAWN_LEAVE_DESCRIPTORS_OPEN) != 0) {
|
||||
for (i = getdtablesize () - 1; i >= 3; i--)
|
||||
close (i);
|
||||
}
|
||||
|
||||
actual_args = ((flags & G_SPAWN_FILE_AND_ARGV_ZERO) == 0) ? argv : argv + 1;
|
||||
if (envp == NULL)
|
||||
envp = environ;
|
||||
|
||||
if (child_setup)
|
||||
child_setup (user_data);
|
||||
|
||||
arg0 = argv [0];
|
||||
if (!g_path_is_absolute (arg0) || (flags & G_SPAWN_SEARCH_PATH) != 0) {
|
||||
arg0 = g_find_program_in_path (argv [0]);
|
||||
if (arg0 == NULL) {
|
||||
int err = ENOENT;
|
||||
write (info_pipe [1], &err, sizeof (int));
|
||||
exit (0);
|
||||
}
|
||||
}
|
||||
|
||||
execve (arg0, actual_args, envp);
|
||||
write (info_pipe [1], &errno, sizeof (int));
|
||||
exit (0);
|
||||
}
|
||||
} else if ((flags & G_SPAWN_DO_NOT_REAP_CHILD) == 0) {
|
||||
int w;
|
||||
/* Wait for the first child if two are created */
|
||||
NO_INTR (w, waitpid (pid, &status, 0));
|
||||
if (status == 1 || w == -1) {
|
||||
CLOSE_PIPE (info_pipe);
|
||||
CLOSE_PIPE (out_pipe);
|
||||
CLOSE_PIPE (err_pipe);
|
||||
CLOSE_PIPE (in_pipe);
|
||||
set_error ("Error in fork (): %d", status);
|
||||
return FALSE;
|
||||
}
|
||||
}
|
||||
close (info_pipe [1]);
|
||||
close (in_pipe [0]);
|
||||
close (out_pipe [1]);
|
||||
close (err_pipe [1]);
|
||||
|
||||
if ((flags & G_SPAWN_DO_NOT_REAP_CHILD) == 0) {
|
||||
int x;
|
||||
NO_INTR (x, read (info_pipe [0], &pid, sizeof (pid_t))); /* if we read < sizeof (pid_t)... */
|
||||
}
|
||||
|
||||
if (child_pid) {
|
||||
*child_pid = pid;
|
||||
}
|
||||
|
||||
if (read (info_pipe [0], &status, sizeof (int)) != 0) {
|
||||
close (info_pipe [0]);
|
||||
close (in_pipe [0]);
|
||||
close (out_pipe [1]);
|
||||
close (err_pipe [1]);
|
||||
set_error_status (status, "Error in exec (%d -> %s)", status, strerror (status));
|
||||
return FALSE;
|
||||
}
|
||||
|
||||
close (info_pipe [0]);
|
||||
if (standard_input)
|
||||
*standard_input = in_pipe [1];
|
||||
if (standard_output)
|
||||
*standard_output = out_pipe [0];
|
||||
if (standard_error)
|
||||
*standard_error = err_pipe [0];
|
||||
|
||||
return TRUE;
|
||||
}
|
||||
|
||||
@@ -1,704 +0,0 @@
|
||||
/*
|
||||
* gstr.c: String Utility Functions.
|
||||
*
|
||||
* Author:
|
||||
* Miguel de Icaza ([email protected])
|
||||
* Aaron Bockover ([email protected])
|
||||
*
|
||||
* (C) 2006 Novell, Inc.
|
||||
*
|
||||
* Permission is hereby granted, free of charge, to any person obtaining
|
||||
* a copy of this software and associated documentation files (the
|
||||
* "Software"), to deal in the Software without restriction, including
|
||||
* without limitation the rights to use, copy, modify, merge, publish,
|
||||
* distribute, sublicense, and/or sell copies of the Software, and to
|
||||
* permit persons to whom the Software is furnished to do so, subject to
|
||||
* the following conditions:
|
||||
*
|
||||
* The above copyright notice and this permission notice shall be
|
||||
* included in all copies or substantial portions of the Software.
|
||||
*
|
||||
* THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND,
|
||||
* EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
|
||||
* MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND
|
||||
* NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE
|
||||
* LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION
|
||||
* OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION
|
||||
* WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
|
||||
*/
|
||||
#include <stdio.h>
|
||||
#include <string.h>
|
||||
#include <ctype.h>
|
||||
#include <glib.h>
|
||||
|
||||
/* This is not a macro, because I dont want to put _GNU_SOURCE in the glib.h header */
|
||||
gchar *
|
||||
g_strndup (const gchar *str, gsize n)
|
||||
{
|
||||
return strndup (str, n);
|
||||
}
|
||||
|
||||
void
|
||||
g_strfreev (gchar **str_array)
|
||||
{
|
||||
gchar **orig = str_array;
|
||||
if (str_array == NULL)
|
||||
return;
|
||||
while (*str_array != NULL){
|
||||
g_free (*str_array);
|
||||
str_array++;
|
||||
}
|
||||
g_free (orig);
|
||||
}
|
||||
|
||||
guint
|
||||
g_strv_length(gchar **str_array)
|
||||
{
|
||||
gint length = 0;
|
||||
g_return_val_if_fail(str_array != NULL, 0);
|
||||
for(length = 0; str_array[length] != NULL; length++);
|
||||
return length;
|
||||
}
|
||||
|
||||
gboolean
|
||||
g_str_has_suffix(const gchar *str, const gchar *suffix)
|
||||
{
|
||||
gint str_length;
|
||||
gint suffix_length;
|
||||
|
||||
g_return_val_if_fail(str != NULL, FALSE);
|
||||
g_return_val_if_fail(suffix != NULL, FALSE);
|
||||
|
||||
str_length = strlen(str);
|
||||
suffix_length = strlen(suffix);
|
||||
|
||||
return suffix_length <= str_length ?
|
||||
strncmp(str + str_length - suffix_length, suffix, suffix_length) == 0 :
|
||||
FALSE;
|
||||
}
|
||||
|
||||
gboolean
|
||||
g_str_has_prefix(const gchar *str, const gchar *prefix)
|
||||
{
|
||||
gint str_length;
|
||||
gint prefix_length;
|
||||
|
||||
g_return_val_if_fail(str != NULL, FALSE);
|
||||
g_return_val_if_fail(prefix != NULL, FALSE);
|
||||
|
||||
str_length = strlen(str);
|
||||
prefix_length = strlen(prefix);
|
||||
|
||||
return prefix_length <= str_length ?
|
||||
strncmp(str, prefix, prefix_length) == 0 :
|
||||
FALSE;
|
||||
}
|
||||
|
||||
gchar *
|
||||
g_strdup_vprintf (const gchar *format, va_list args)
|
||||
{
|
||||
int n;
|
||||
char *ret;
|
||||
|
||||
n = vasprintf (&ret, format, args);
|
||||
if (n == -1)
|
||||
return NULL;
|
||||
|
||||
return ret;
|
||||
}
|
||||
|
||||
gchar *
|
||||
g_strdup_printf (const gchar *format, ...)
|
||||
{
|
||||
gchar *ret;
|
||||
va_list args;
|
||||
int n;
|
||||
|
||||
va_start (args, format);
|
||||
n = vasprintf (&ret, format, args);
|
||||
va_end (args);
|
||||
if (n == -1)
|
||||
return NULL;
|
||||
|
||||
return ret;
|
||||
}
|
||||
|
||||
const gchar *
|
||||
g_strerror (gint errnum)
|
||||
{
|
||||
return strerror (errnum);
|
||||
}
|
||||
|
||||
gchar *
|
||||
g_strconcat (const gchar *first, ...)
|
||||
{
|
||||
g_return_val_if_fail (first != NULL, NULL);
|
||||
va_list args;
|
||||
int total = 0;
|
||||
char *s, *ret;
|
||||
|
||||
total += strlen (first);
|
||||
va_start (args, first);
|
||||
for (s = va_arg (args, char *); s != NULL; s = va_arg(args, char *)){
|
||||
total += strlen (s);
|
||||
}
|
||||
va_end (args);
|
||||
|
||||
ret = g_malloc (total + 1);
|
||||
if (ret == NULL)
|
||||
return NULL;
|
||||
|
||||
ret [total] = 0;
|
||||
strcpy (ret, first);
|
||||
va_start (args, first);
|
||||
for (s = va_arg (args, char *); s != NULL; s = va_arg(args, char *)){
|
||||
strcat (ret, s);
|
||||
}
|
||||
va_end (args);
|
||||
|
||||
return ret;
|
||||
}
|
||||
|
||||
gchar **
|
||||
g_strsplit (const gchar *string, const gchar *delimiter, gint max_tokens)
|
||||
{
|
||||
gchar *string_c;
|
||||
gchar *strtok_save, **vector;
|
||||
gchar *token, *token_c;
|
||||
gint size = 1;
|
||||
gint token_length;
|
||||
|
||||
g_return_val_if_fail(string != NULL, NULL);
|
||||
g_return_val_if_fail(delimiter != NULL, NULL);
|
||||
g_return_val_if_fail(delimiter[0] != 0, NULL);
|
||||
|
||||
token_length = strlen(string);
|
||||
string_c = (gchar *)g_malloc(token_length + 1);
|
||||
memcpy(string_c, string, token_length);
|
||||
string_c[token_length] = 0;
|
||||
|
||||
if (strncmp (string_c, delimiter, strlen (delimiter)) == 0){
|
||||
vector = (gchar **) g_malloc (2 * sizeof (vector));
|
||||
vector [0] = g_strdup ("");
|
||||
size++;
|
||||
} else
|
||||
vector = NULL;
|
||||
token = (gchar *)strtok_r(string_c, delimiter, &strtok_save);
|
||||
|
||||
if (!(max_tokens > 0 && size >= max_tokens)){
|
||||
while(token != NULL) {
|
||||
token_length = strlen(token);
|
||||
token_c = (gchar *)g_malloc(token_length + 1);
|
||||
memcpy(token_c, token, token_length);
|
||||
token_c[token_length] = 0;
|
||||
|
||||
vector = vector == NULL ?
|
||||
(gchar **)g_malloc(2 * sizeof(vector)) :
|
||||
(gchar **)g_realloc(vector, (size + 1) * sizeof(vector));
|
||||
|
||||
vector[size - 1] = token_c;
|
||||
size++;
|
||||
|
||||
if(max_tokens > 0 && size >= max_tokens) {
|
||||
if(size > max_tokens) {
|
||||
break;
|
||||
}
|
||||
|
||||
token = *strtok_save ? strtok_save : NULL;
|
||||
} else {
|
||||
token = (gchar *)strtok_r(NULL, delimiter, &strtok_save);
|
||||
}
|
||||
}
|
||||
}
|
||||
|
||||
if (vector == NULL){
|
||||
vector = (gchar **) g_malloc (2 * sizeof (vector));
|
||||
vector [0] = NULL;
|
||||
} else if (size > 0){
|
||||
vector[size - 1] = NULL;
|
||||
}
|
||||
|
||||
g_free(string_c);
|
||||
string_c = NULL;
|
||||
|
||||
return vector;
|
||||
}
|
||||
|
||||
gchar *
|
||||
g_strreverse (gchar *str)
|
||||
{
|
||||
guint len, half;
|
||||
gint i;
|
||||
gchar c;
|
||||
|
||||
if (str == NULL)
|
||||
return NULL;
|
||||
|
||||
len = strlen (str);
|
||||
half = len / 2;
|
||||
len--;
|
||||
for (i = 0; i < half; i++, len--) {
|
||||
c = str [i];
|
||||
str [i] = str [len];
|
||||
str [len] = c;
|
||||
}
|
||||
return str;
|
||||
}
|
||||
|
||||
gchar *
|
||||
g_strjoin (const gchar *separator, ...)
|
||||
{
|
||||
va_list args;
|
||||
char *res, *s;
|
||||
int len, slen;
|
||||
|
||||
if (separator != NULL)
|
||||
slen = strlen (separator);
|
||||
else
|
||||
slen = 0;
|
||||
len = 0;
|
||||
va_start (args, separator);
|
||||
for (s = va_arg (args, char *); s != NULL; s = va_arg (args, char *)){
|
||||
len += strlen (s);
|
||||
len += slen;
|
||||
}
|
||||
va_end (args);
|
||||
if (len == 0)
|
||||
return g_strdup ("");
|
||||
|
||||
/* Remove the last separator */
|
||||
if (slen > 0 && len > 0)
|
||||
len -= slen;
|
||||
len++;
|
||||
res = g_malloc (len);
|
||||
va_start (args, separator);
|
||||
s = va_arg (args, char *);
|
||||
strcpy (res, s);
|
||||
for (s = va_arg (args, char *); s != NULL; s = va_arg (args, char *)){
|
||||
if (separator != NULL)
|
||||
strcat (res, separator);
|
||||
strcat (res, s);
|
||||
}
|
||||
va_end (args);
|
||||
|
||||
return res;
|
||||
}
|
||||
|
||||
gchar *
|
||||
g_strjoinv (const gchar *separator, gchar **str_array)
|
||||
{
|
||||
char *res;
|
||||
int slen, len, i;
|
||||
|
||||
if (separator != NULL)
|
||||
slen = strlen (separator);
|
||||
else
|
||||
slen = 0;
|
||||
|
||||
len = 0;
|
||||
for (i = 0; str_array [i] != NULL; i++){
|
||||
len += strlen (str_array [i]);
|
||||
len += slen;
|
||||
}
|
||||
if (len == 0)
|
||||
return g_strdup ("");
|
||||
if (slen > 0 && len > 0)
|
||||
len -= slen;
|
||||
len++;
|
||||
res = g_malloc (len);
|
||||
strcpy (res, str_array [0]);
|
||||
for (i = 1; str_array [i] != NULL; i++){
|
||||
if (separator != NULL)
|
||||
strcat (res, separator);
|
||||
strcat (res, str_array [i]);
|
||||
}
|
||||
return res;
|
||||
}
|
||||
|
||||
gchar *
|
||||
g_strchug (gchar *str)
|
||||
{
|
||||
gint len;
|
||||
gchar *tmp;
|
||||
|
||||
if (str == NULL)
|
||||
return NULL;
|
||||
|
||||
tmp = str;
|
||||
while (*tmp && isspace (*tmp)) tmp++;
|
||||
if (str != tmp) {
|
||||
len = strlen (str) - (tmp - str - 1);
|
||||
memmove (str, tmp, len);
|
||||
}
|
||||
return str;
|
||||
}
|
||||
|
||||
gchar *
|
||||
g_strchomp (gchar *str)
|
||||
{
|
||||
gchar *tmp;
|
||||
|
||||
if (str == NULL)
|
||||
return NULL;
|
||||
|
||||
tmp = str + strlen (str) - 1;
|
||||
while (*tmp && isspace (*tmp)) tmp--;
|
||||
*(tmp + 1) = '\0';
|
||||
return str;
|
||||
}
|
||||
|
||||
gint
|
||||
g_printf(gchar const *format, ...)
|
||||
{
|
||||
va_list args;
|
||||
gint ret;
|
||||
|
||||
va_start(args, format);
|
||||
ret = vprintf(format, args);
|
||||
va_end(args);
|
||||
|
||||
return ret;
|
||||
}
|
||||
|
||||
gint
|
||||
g_fprintf(FILE *file, gchar const *format, ...)
|
||||
{
|
||||
va_list args;
|
||||
gint ret;
|
||||
|
||||
va_start(args, format);
|
||||
ret = vfprintf(file, format, args);
|
||||
va_end(args);
|
||||
|
||||
return ret;
|
||||
}
|
||||
|
||||
gint
|
||||
g_sprintf(gchar *string, gchar const *format, ...)
|
||||
{
|
||||
va_list args;
|
||||
gint ret;
|
||||
|
||||
va_start(args, format);
|
||||
ret = vsprintf(string, format, args);
|
||||
va_end(args);
|
||||
|
||||
return ret;
|
||||
}
|
||||
|
||||
gint
|
||||
g_snprintf(gchar *string, gulong n, gchar const *format, ...)
|
||||
{
|
||||
va_list args;
|
||||
gint ret;
|
||||
|
||||
va_start(args, format);
|
||||
ret = vsnprintf(string, n, format, args);
|
||||
va_end(args);
|
||||
|
||||
return ret;
|
||||
}
|
||||
|
||||
static const char const hx [] = { '0', '1', '2', '3', '4', '5', '6', '7',
|
||||
'8', '9', 'A', 'B', 'C', 'D', 'E', 'F' };
|
||||
|
||||
static gboolean
|
||||
char_needs_encoding (char c)
|
||||
{
|
||||
if (((unsigned char)c) >= 0x80)
|
||||
return TRUE;
|
||||
|
||||
if ((c >= '@' && c <= 'Z') ||
|
||||
(c >= 'a' && c <= 'z') ||
|
||||
(c >= '&' && c < 0x3b) ||
|
||||
(c == '!') || (c == '$') || (c == '_') || (c == '=') || (c == '~'))
|
||||
return FALSE;
|
||||
return TRUE;
|
||||
}
|
||||
|
||||
gchar *
|
||||
g_filename_to_uri (const gchar *filename, const gchar *hostname, GError **error)
|
||||
{
|
||||
int n;
|
||||
char *ret, *rp;
|
||||
const char *p;
|
||||
|
||||
g_return_val_if_fail (filename != NULL, NULL);
|
||||
|
||||
if (hostname != NULL)
|
||||
g_warning ("eglib: g_filename_to_uri: hostname not handled");
|
||||
|
||||
if (*filename != '/'){
|
||||
if (error != NULL)
|
||||
*error = g_error_new (NULL, 2, "Not an absolute filename");
|
||||
|
||||
return NULL;
|
||||
}
|
||||
|
||||
n = strlen ("file://") + 1;
|
||||
for (p = filename; *p; p++){
|
||||
if (char_needs_encoding (*p))
|
||||
n += 3;
|
||||
else
|
||||
n++;
|
||||
}
|
||||
ret = g_malloc (n);
|
||||
strcpy (ret, "file://");
|
||||
for (p = filename, rp = ret + strlen (ret); *p; p++){
|
||||
if (char_needs_encoding (*p)){
|
||||
*rp++ = '%';
|
||||
*rp++ = hx [((unsigned char)(*p)) >> 4];
|
||||
*rp++ = hx [((unsigned char)(*p)) & 0xf];
|
||||
} else
|
||||
*rp++ = *p;
|
||||
}
|
||||
*rp = 0;
|
||||
return ret;
|
||||
}
|
||||
|
||||
static int
|
||||
decode (char p)
|
||||
{
|
||||
if (p >= '0' && p <= '9')
|
||||
return p - '0';
|
||||
if (p >= 'A' && p <= 'F')
|
||||
return p - 'A';
|
||||
if (p >= 'a' && p <= 'f')
|
||||
return p - 'a';
|
||||
g_assert_not_reached ();
|
||||
return 0;
|
||||
}
|
||||
|
||||
gchar *
|
||||
g_filename_from_uri (const gchar *uri, gchar **hostname, GError **error)
|
||||
{
|
||||
const char *p;
|
||||
char *r, *result;
|
||||
int flen = 0;
|
||||
|
||||
g_return_val_if_fail (uri != NULL, NULL);
|
||||
|
||||
if (hostname != NULL)
|
||||
g_warning ("eglib: g_filename_from_uri: hostname not handled");
|
||||
|
||||
if (strncmp (uri, "file:///", 8) != 0){
|
||||
if (error != NULL)
|
||||
*error = g_error_new (NULL, 2, "URI does not start with the file: scheme");
|
||||
return NULL;
|
||||
}
|
||||
|
||||
for (p = uri + 8; *p; p++){
|
||||
if (*p == '%'){
|
||||
if (p [1] && p [2] && isxdigit (p [1]) && isxdigit (p [2])){
|
||||
p += 2;
|
||||
} else {
|
||||
if (error != NULL)
|
||||
*error = g_error_new (NULL, 2, "URI contains an invalid escape sequence");
|
||||
return NULL;
|
||||
}
|
||||
}
|
||||
flen++;
|
||||
}
|
||||
flen++;
|
||||
|
||||
result = g_malloc (flen + 1);
|
||||
*result = '/';
|
||||
result [flen] = 0;
|
||||
|
||||
for (p = uri + 8, r = result + 1; *p; p++){
|
||||
if (*p == '%'){
|
||||
*r++ = (decode (p [1]) << 4) | decode (p [2]);
|
||||
p += 2;
|
||||
} else
|
||||
*r++ = *p;
|
||||
flen++;
|
||||
}
|
||||
return result;
|
||||
}
|
||||
|
||||
void
|
||||
g_strdown (gchar *string)
|
||||
{
|
||||
g_return_if_fail (string != NULL);
|
||||
|
||||
while (*string){
|
||||
*string = tolower (*string);
|
||||
string++;
|
||||
}
|
||||
}
|
||||
|
||||
gchar *
|
||||
g_ascii_strdown (const gchar *str, gssize len)
|
||||
{
|
||||
char *ret;
|
||||
int i;
|
||||
|
||||
g_return_val_if_fail (str != NULL, NULL);
|
||||
|
||||
if (len == -1)
|
||||
len = strlen (str);
|
||||
|
||||
ret = g_malloc (len + 1);
|
||||
for (i = 0; i < len; i++){
|
||||
guchar c = (guchar) str [i];
|
||||
if (c >= 'A' && c <= 'Z')
|
||||
c += 'a' - 'A';
|
||||
ret [i] = c;
|
||||
}
|
||||
ret [i] = 0;
|
||||
|
||||
return ret;
|
||||
}
|
||||
|
||||
gint
|
||||
g_ascii_strncasecmp (const gchar *s1, const gchar *s2, gsize n)
|
||||
{
|
||||
int i;
|
||||
|
||||
g_return_val_if_fail (s1 != NULL, 0);
|
||||
g_return_val_if_fail (s2 != NULL, 0);
|
||||
|
||||
for (i = 0; i < n; i++){
|
||||
gchar c1 = *s1++;
|
||||
gchar c2 = *s2++;
|
||||
|
||||
if (c1 == c2)
|
||||
continue;
|
||||
|
||||
if (c1 == 0)
|
||||
return -1;
|
||||
if (c2 == 0)
|
||||
return 1;
|
||||
return c1-c2;
|
||||
}
|
||||
return 0;
|
||||
}
|
||||
|
||||
gchar *
|
||||
g_strdelimit (gchar *string, const gchar *delimiters, gchar new_delimiter)
|
||||
{
|
||||
gchar *ptr;
|
||||
|
||||
g_return_val_if_fail (string != NULL, NULL);
|
||||
|
||||
if (delimiters == NULL)
|
||||
delimiters = G_STR_DELIMITERS;
|
||||
|
||||
for (ptr = string; *ptr; ptr++) {
|
||||
if (strchr (delimiters, *ptr))
|
||||
*ptr = new_delimiter;
|
||||
}
|
||||
|
||||
return string;
|
||||
}
|
||||
|
||||
#ifndef HAVE_STRLCPY
|
||||
gsize
|
||||
g_strlcpy (gchar *dest, const gchar *src, gsize dest_size)
|
||||
{
|
||||
gchar *d;
|
||||
const gchar *s;
|
||||
gchar c;
|
||||
gsize len;
|
||||
|
||||
g_return_val_if_fail (src != NULL, 0);
|
||||
g_return_val_if_fail (dest != NULL, 0);
|
||||
|
||||
len = dest_size;
|
||||
if (len == 0)
|
||||
return 0;
|
||||
|
||||
s = src;
|
||||
d = dest;
|
||||
while (--len) {
|
||||
c = *s++;
|
||||
*d++ = c;
|
||||
if (c == '\0')
|
||||
return (dest_size - len - 1);
|
||||
}
|
||||
|
||||
/* len is 0 i we get here */
|
||||
*d = '\0';
|
||||
/* we need to return the length of src here */
|
||||
while (*s++) ; /* instead of a plain strlen, we use 's' */
|
||||
return s - src - 1;
|
||||
}
|
||||
#endif
|
||||
|
||||
static const gchar escaped_dflt [256] = {
|
||||
1, 1, 1, 1, 1, 1, 1, 1, 'b', 't', 'n', 1, 'f', 'r', 1, 1,
|
||||
1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1,
|
||||
0, 0, '"', 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
|
||||
0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
|
||||
0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
|
||||
0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, '\\', 0, 0, 0,
|
||||
0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
|
||||
0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
|
||||
1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1,
|
||||
1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1,
|
||||
1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1,
|
||||
1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1,
|
||||
1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1,
|
||||
1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1,
|
||||
1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1,
|
||||
1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1
|
||||
};
|
||||
|
||||
gchar *
|
||||
g_strescape (const gchar *source, const gchar *exceptions)
|
||||
{
|
||||
gchar escaped [256];
|
||||
const gchar *ptr;
|
||||
gchar c;
|
||||
int op;
|
||||
gchar *result;
|
||||
gchar *res_ptr;
|
||||
|
||||
g_return_val_if_fail (source != NULL, NULL);
|
||||
|
||||
memcpy (escaped, escaped_dflt, 256);
|
||||
if (exceptions != NULL) {
|
||||
for (ptr = exceptions; *ptr; ptr++)
|
||||
escaped [(int) *ptr] = 0;
|
||||
}
|
||||
result = g_malloc (strlen (source) * 4 + 1); /* Worst case: everything octal. */
|
||||
res_ptr = result;
|
||||
for (ptr = source; *ptr; ptr++) {
|
||||
c = *ptr;
|
||||
op = escaped [(int) c];
|
||||
if (op == 0) {
|
||||
*res_ptr++ = c;
|
||||
} else {
|
||||
*res_ptr++ = '\\';
|
||||
if (op != 1) {
|
||||
*res_ptr++ = op;
|
||||
} else {
|
||||
*res_ptr++ = '0' + ((c >> 6) & 3);
|
||||
*res_ptr++ = '0' + ((c >> 3) & 7);
|
||||
*res_ptr++ = '0' + (c & 7);
|
||||
}
|
||||
}
|
||||
}
|
||||
*res_ptr = '\0';
|
||||
return result;
|
||||
}
|
||||
|
||||
gchar *
|
||||
g_strdup (const gchar *str)
|
||||
{
|
||||
if (str == NULL)
|
||||
return NULL;
|
||||
|
||||
return strdup (str);
|
||||
}
|
||||
|
||||
gint
|
||||
g_ascii_xdigit_value (gchar c)
|
||||
{
|
||||
return ((isxdigit (c) == 0) ? -1 :
|
||||
((c >= '0' && c <= '9') ? (c - '0') :
|
||||
((c >= 'a' && c <= 'f') ? (c - 'a' + 10) :
|
||||
(c - 'A' + 10))));
|
||||
}
|
||||
|
||||
|
||||
@@ -1,197 +0,0 @@
|
||||
/*
|
||||
* String functions
|
||||
*
|
||||
* Author:
|
||||
* Miguel de Icaza ([email protected])
|
||||
* Aaron Bockover ([email protected])
|
||||
*
|
||||
* (C) 2006 Novell, Inc.
|
||||
*
|
||||
* Permission is hereby granted, free of charge, to any person obtaining
|
||||
* a copy of this software and associated documentation files (the
|
||||
* "Software"), to deal in the Software without restriction, including
|
||||
* without limitation the rights to use, copy, modify, merge, publish,
|
||||
* distribute, sublicense, and/or sell copies of the Software, and to
|
||||
* permit persons to whom the Software is furnished to do so, subject to
|
||||
* the following conditions:
|
||||
*
|
||||
* The above copyright notice and this permission notice shall be
|
||||
* included in all copies or substantial portions of the Software.
|
||||
*
|
||||
* THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND,
|
||||
* EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
|
||||
* MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND
|
||||
* NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE
|
||||
* LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION
|
||||
* OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION
|
||||
* WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
|
||||
*/
|
||||
#include <stdio.h>
|
||||
#include <glib.h>
|
||||
|
||||
#define GROW_IF_NECESSARY(s,l) { \
|
||||
if(s->len + l >= s->allocated_len) { \
|
||||
s->allocated_len = (s->allocated_len + l + 16) * 2; \
|
||||
s->str = g_realloc(s->str, s->allocated_len); \
|
||||
} \
|
||||
}
|
||||
|
||||
GString *
|
||||
g_string_new_len (const gchar *init, gssize len)
|
||||
{
|
||||
GString *ret = g_new (GString, 1);
|
||||
|
||||
ret->len = len < 0 ? strlen(init) : len;
|
||||
ret->allocated_len = MAX(ret->len + 1, 16);
|
||||
ret->str = g_malloc(ret->allocated_len);
|
||||
memcpy(ret->str, init, ret->len);
|
||||
ret->str[ret->len] = 0;
|
||||
|
||||
return ret;
|
||||
}
|
||||
|
||||
GString *
|
||||
g_string_new (const gchar *init)
|
||||
{
|
||||
return g_string_new_len(init, -1);
|
||||
}
|
||||
|
||||
GString *
|
||||
g_string_sized_new (gsize default_size)
|
||||
{
|
||||
GString *ret = g_new (GString, 1);
|
||||
|
||||
ret->str = g_malloc (default_size);
|
||||
ret->str [0] = 0;
|
||||
ret->len = 0;
|
||||
ret->allocated_len = default_size;
|
||||
|
||||
return ret;
|
||||
}
|
||||
|
||||
gchar *
|
||||
g_string_free (GString *string, gboolean free_segment)
|
||||
{
|
||||
gchar *data;
|
||||
|
||||
g_return_val_if_fail (string != NULL, NULL);
|
||||
|
||||
data = string->str;
|
||||
g_free(string);
|
||||
|
||||
if(!free_segment) {
|
||||
return data;
|
||||
}
|
||||
|
||||
g_free(data);
|
||||
return NULL;
|
||||
}
|
||||
|
||||
GString *
|
||||
g_string_append_len (GString *string, const gchar *val, gssize len)
|
||||
{
|
||||
g_return_val_if_fail(string != NULL, NULL);
|
||||
g_return_val_if_fail(val != NULL, string);
|
||||
|
||||
if(len < 0) {
|
||||
len = strlen(val);
|
||||
}
|
||||
|
||||
GROW_IF_NECESSARY(string, len);
|
||||
memcpy(string->str + string->len, val, len);
|
||||
string->len += len;
|
||||
string->str[string->len] = 0;
|
||||
|
||||
return string;
|
||||
}
|
||||
|
||||
GString *
|
||||
g_string_append (GString *string, const gchar *val)
|
||||
{
|
||||
g_return_val_if_fail(string != NULL, NULL);
|
||||
g_return_val_if_fail(val != NULL, string);
|
||||
|
||||
return g_string_append_len(string, val, -1);
|
||||
}
|
||||
|
||||
GString *
|
||||
g_string_append_c (GString *string, gchar c)
|
||||
{
|
||||
g_return_val_if_fail(string != NULL, NULL);
|
||||
|
||||
GROW_IF_NECESSARY(string, 1);
|
||||
|
||||
string->str[string->len] = c;
|
||||
string->str[string->len + 1] = 0;
|
||||
string->len++;
|
||||
|
||||
return string;
|
||||
}
|
||||
|
||||
GString *
|
||||
g_string_prepend (GString *string, const gchar *val)
|
||||
{
|
||||
gssize len;
|
||||
|
||||
g_return_val_if_fail (string != NULL, string);
|
||||
g_return_val_if_fail (val != NULL, string);
|
||||
|
||||
len = strlen (val);
|
||||
|
||||
GROW_IF_NECESSARY(string, len);
|
||||
memmove(string->str + len, string->str, string->len + 1);
|
||||
memcpy(string->str, val, len);
|
||||
|
||||
return string;
|
||||
}
|
||||
|
||||
void
|
||||
g_string_append_printf (GString *string, const gchar *format, ...)
|
||||
{
|
||||
char *ret;
|
||||
va_list args;
|
||||
|
||||
g_return_if_fail (string != NULL);
|
||||
g_return_if_fail (format != NULL);
|
||||
|
||||
va_start (args, format);
|
||||
ret = g_strdup_vprintf (format, args);
|
||||
va_end (args);
|
||||
g_string_append (string, ret);
|
||||
|
||||
free (ret);
|
||||
}
|
||||
|
||||
void
|
||||
g_string_printf (GString *string, const gchar *format, ...)
|
||||
{
|
||||
va_list args;
|
||||
|
||||
g_return_if_fail (string != NULL);
|
||||
g_return_if_fail (format != NULL);
|
||||
|
||||
g_free (string->str);
|
||||
|
||||
va_start (args, format);
|
||||
string->str = g_strdup_vprintf (format, args);
|
||||
va_end (args);
|
||||
|
||||
string->len = strlen (string->str);
|
||||
string->allocated_len = string->len+1;
|
||||
}
|
||||
|
||||
GString *
|
||||
g_string_truncate (GString *string, gsize len)
|
||||
{
|
||||
g_return_val_if_fail (string != NULL, string);
|
||||
|
||||
/* Silent return */
|
||||
if (len < 0 || len >= string->len) {
|
||||
return string;
|
||||
}
|
||||
|
||||
string->len = len;
|
||||
string->str[len] = 0;
|
||||
return string;
|
||||
}
|
||||
|
||||
@@ -1,95 +0,0 @@
|
||||
/*
|
||||
* Timer
|
||||
*
|
||||
* Author:
|
||||
* Gonzalo Paniagua Javier ([email protected]
|
||||
*
|
||||
* (C) 2006 Novell, Inc.
|
||||
*
|
||||
* Permission is hereby granted, free of charge, to any person obtaining
|
||||
* a copy of this software and associated documentation files (the
|
||||
* "Software"), to deal in the Software without restriction, including
|
||||
* without limitation the rights to use, copy, modify, merge, publish,
|
||||
* distribute, sublicense, and/or sell copies of the Software, and to
|
||||
* permit persons to whom the Software is furnished to do so, subject to
|
||||
* the following conditions:
|
||||
*
|
||||
* The above copyright notice and this permission notice shall be
|
||||
* included in all copies or substantial portions of the Software.
|
||||
*
|
||||
* THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND,
|
||||
* EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
|
||||
* MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND
|
||||
* NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE
|
||||
* LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION
|
||||
* OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION
|
||||
* WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
|
||||
*/
|
||||
#include <glib.h>
|
||||
#include <sys/time.h>
|
||||
|
||||
struct _GTimer {
|
||||
struct timeval start;
|
||||
struct timeval stop;
|
||||
};
|
||||
|
||||
GTimer *g_timer_new (void)
|
||||
{
|
||||
GTimer *timer;
|
||||
|
||||
timer = g_new0 (GTimer, 1);
|
||||
g_timer_start (timer);
|
||||
return timer;
|
||||
}
|
||||
|
||||
void
|
||||
g_timer_destroy (GTimer *timer)
|
||||
{
|
||||
g_return_if_fail (timer != NULL);
|
||||
g_free (timer);
|
||||
}
|
||||
|
||||
void
|
||||
g_timer_start (GTimer *timer)
|
||||
{
|
||||
g_return_if_fail (timer != NULL);
|
||||
gettimeofday (&timer->start, NULL);
|
||||
memset (&timer->stop, 0, sizeof (struct timeval));
|
||||
}
|
||||
|
||||
void
|
||||
g_timer_stop (GTimer *timer)
|
||||
{
|
||||
g_return_if_fail (timer != NULL);
|
||||
gettimeofday (&timer->stop, NULL);
|
||||
}
|
||||
|
||||
gdouble
|
||||
g_timer_elapsed (GTimer *timer, gulong *microseconds)
|
||||
{
|
||||
struct timeval tv;
|
||||
gulong seconds;
|
||||
gulong usec;
|
||||
gdouble result;
|
||||
|
||||
g_return_val_if_fail (timer != NULL, 0.0);
|
||||
|
||||
if (timer->stop.tv_sec == 0 && timer->stop.tv_usec == 0) {
|
||||
gettimeofday (&tv, NULL);
|
||||
} else {
|
||||
tv = timer->stop;
|
||||
}
|
||||
|
||||
usec = tv.tv_usec - timer->start.tv_usec;
|
||||
seconds = tv.tv_sec - timer->start.tv_sec;
|
||||
if (microseconds) {
|
||||
if (usec < 0) {
|
||||
usec += 1000000;
|
||||
seconds--;
|
||||
}
|
||||
*microseconds = usec;
|
||||
}
|
||||
result = seconds * 1000000 + usec;
|
||||
return (result / 1000000);
|
||||
}
|
||||
|
||||
@@ -1,247 +0,0 @@
|
||||
/*
|
||||
* gunicode.c: Some Unicode routines
|
||||
*
|
||||
* Author:
|
||||
* Miguel de Icaza ([email protected])
|
||||
*
|
||||
* (C) 2006 Novell, Inc.
|
||||
*
|
||||
* utf8 validation code came from:
|
||||
* libxml2-2.6.26 licensed under the MIT X11 license
|
||||
*
|
||||
* Authors credit in libxml's string.c:
|
||||
* William Brack <[email protected]>
|
||||
* [email protected]
|
||||
*
|
||||
* Permission is hereby granted, free of charge, to any person obtaining
|
||||
* a copy of this software and associated documentation files (the
|
||||
* "Software"), to deal in the Software without restriction, including
|
||||
* without limitation the rights to use, copy, modify, merge, publish,
|
||||
* distribute, sublicense, and/or sell copies of the Software, and to
|
||||
* permit persons to whom the Software is furnished to do so, subject to
|
||||
* the following conditions:
|
||||
*
|
||||
* The above copyright notice and this permission notice shall be
|
||||
* included in all copies or substantial portions of the Software.
|
||||
*
|
||||
* THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND,
|
||||
* EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
|
||||
* MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND
|
||||
* NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE
|
||||
* LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION
|
||||
* OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION
|
||||
* WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
|
||||
*
|
||||
*/
|
||||
#include <stdio.h>
|
||||
#include <glib.h>
|
||||
#include <langinfo.h>
|
||||
#include <iconv.h>
|
||||
#include <errno.h>
|
||||
|
||||
static char *my_charset;
|
||||
static gboolean is_utf8;
|
||||
|
||||
GUnicodeType
|
||||
g_unichar_type (gunichar c)
|
||||
{
|
||||
g_error ("g_unichar_type is not implemented");
|
||||
return 0;
|
||||
}
|
||||
|
||||
gunichar
|
||||
g_unichar_tolower (gunichar c)
|
||||
{
|
||||
g_error ("g_unichar_type is not implemented");
|
||||
return 0;
|
||||
}
|
||||
|
||||
gchar *
|
||||
g_convert (const gchar *str, gssize len,
|
||||
const gchar *to_codeset, const gchar *from_codeset,
|
||||
gsize *bytes_read, gsize *bytes_written, GError **error)
|
||||
{
|
||||
iconv_t convertor;
|
||||
char *buffer, *result, *output;
|
||||
const char *strptr = (const char *) str;
|
||||
int str_len = len == -1 ? strlen (str) : len;
|
||||
int buffer_size;
|
||||
size_t left, out_left;
|
||||
|
||||
convertor = iconv_open (to_codeset, from_codeset);
|
||||
if (convertor == (iconv_t) -1){
|
||||
*bytes_written = 0;
|
||||
*bytes_read = 0;
|
||||
return NULL;
|
||||
}
|
||||
|
||||
buffer_size = str_len + 1 + 8;
|
||||
buffer = g_malloc (buffer_size);
|
||||
out_left = str_len;
|
||||
output = buffer;
|
||||
left = str_len;
|
||||
while (left > 0){
|
||||
int res = iconv (convertor, (char **) &strptr, &left, &output, &out_left);
|
||||
if (res == (size_t) -1){
|
||||
if (errno == E2BIG){
|
||||
char *n;
|
||||
int extra_space = 8 + left;
|
||||
int output_used = output - buffer;
|
||||
|
||||
buffer_size += extra_space;
|
||||
|
||||
n = g_realloc (buffer, buffer_size);
|
||||
|
||||
if (n == NULL){
|
||||
if (error != NULL)
|
||||
*error = g_error_new (NULL, G_CONVERT_ERROR_FAILED, "No memory left");
|
||||
g_free (buffer);
|
||||
result = NULL;
|
||||
goto leave;
|
||||
}
|
||||
buffer = n;
|
||||
out_left += extra_space;
|
||||
output = buffer + output_used;
|
||||
} else if (errno == EILSEQ){
|
||||
if (error != NULL)
|
||||
*error = g_error_new (NULL, G_CONVERT_ERROR_ILLEGAL_SEQUENCE, "Invalid multi-byte sequence on input");
|
||||
result = NULL;
|
||||
g_free (buffer);
|
||||
goto leave;
|
||||
} else if (errno == EINVAL){
|
||||
if (error != NULL)
|
||||
*error = g_error_new (NULL, G_CONVERT_ERROR_PARTIAL_INPUT, "Partial character sequence");
|
||||
result = NULL;
|
||||
g_free (buffer);
|
||||
goto leave;
|
||||
}
|
||||
}
|
||||
}
|
||||
if (bytes_read != NULL)
|
||||
*bytes_read = strptr - str;
|
||||
if (bytes_written != NULL)
|
||||
*bytes_written = output - buffer;
|
||||
*output = 0;
|
||||
result = buffer;
|
||||
leave:
|
||||
iconv_close (convertor);
|
||||
return result;
|
||||
}
|
||||
|
||||
/*
|
||||
* This is broken, and assumes an UTF8 system, but will do for eglib's first user
|
||||
*/
|
||||
gchar *
|
||||
g_filename_from_utf8 (const gchar *utf8string, gssize len, gsize *bytes_read, gsize *bytes_written, GError **error)
|
||||
{
|
||||
char *res;
|
||||
|
||||
if (len == -1)
|
||||
len = strlen (utf8string);
|
||||
|
||||
res = g_malloc (len + 1);
|
||||
g_strlcpy (res, utf8string, len + 1);
|
||||
return res;
|
||||
}
|
||||
|
||||
gboolean
|
||||
g_get_charset (G_CONST_RETURN char **charset)
|
||||
{
|
||||
if (my_charset == NULL){
|
||||
my_charset = g_strdup (nl_langinfo (CODESET));
|
||||
is_utf8 = strcmp (my_charset, "UTF-8") == 0;
|
||||
}
|
||||
|
||||
if (charset != NULL)
|
||||
*charset = my_charset;
|
||||
|
||||
return is_utf8;
|
||||
}
|
||||
|
||||
gchar *
|
||||
g_locale_to_utf8 (const gchar *opsysstring, gssize len, gsize *bytes_read, gsize *bytes_written, GError **error)
|
||||
{
|
||||
g_get_charset (NULL);
|
||||
|
||||
return g_convert (opsysstring, len, "UTF-8", my_charset, bytes_read, bytes_written, error);
|
||||
}
|
||||
|
||||
gchar *
|
||||
g_locale_from_utf8 (const gchar *utf8string, gssize len, gsize *bytes_read, gsize *bytes_written, GError **error)
|
||||
{
|
||||
g_get_charset (NULL);
|
||||
|
||||
return g_convert (utf8string, len, my_charset, "UTF-8", bytes_read, bytes_written, error);
|
||||
}
|
||||
/**
|
||||
* g_utf8_validate
|
||||
* @utf: Pointer to putative UTF-8 encoded string.
|
||||
*
|
||||
* Checks @utf for being valid UTF-8. @utf is assumed to be
|
||||
* null-terminated. This function is not super-strict, as it will
|
||||
* allow longer UTF-8 sequences than necessary. Note that Java is
|
||||
* capable of producing these sequences if provoked. Also note, this
|
||||
* routine checks for the 4-byte maximum size, but does not check for
|
||||
* 0x10ffff maximum value.
|
||||
*
|
||||
* Return value: true if @utf is valid.
|
||||
**/
|
||||
gboolean
|
||||
g_utf8_validate (const gchar *utf, gssize max_len, const gchar **end)
|
||||
{
|
||||
int ix;
|
||||
|
||||
g_return_val_if_fail (utf != NULL, FALSE);
|
||||
|
||||
if (max_len == -1)
|
||||
max_len = strlen (utf);
|
||||
|
||||
/*
|
||||
* utf is a string of 1, 2, 3 or 4 bytes. The valid strings
|
||||
* are as follows (in "bit format"):
|
||||
* 0xxxxxxx valid 1-byte
|
||||
* 110xxxxx 10xxxxxx valid 2-byte
|
||||
* 1110xxxx 10xxxxxx 10xxxxxx valid 3-byte
|
||||
* 11110xxx 10xxxxxx 10xxxxxx 10xxxxxx valid 4-byte
|
||||
*/
|
||||
for (ix = 0; ix < max_len;) { /* string is 0-terminated */
|
||||
unsigned char c;
|
||||
|
||||
c = utf[ix];
|
||||
if ((c & 0x80) == 0x00) { /* 1-byte code, starts with 10 */
|
||||
ix++;
|
||||
} else if ((c & 0xe0) == 0xc0) {/* 2-byte code, starts with 110 */
|
||||
if (((ix+1) >= max_len) || (utf[ix+1] & 0xc0 ) != 0x80){
|
||||
if (end != NULL)
|
||||
*end = &utf [ix];
|
||||
return FALSE;
|
||||
}
|
||||
ix += 2;
|
||||
} else if ((c & 0xf0) == 0xe0) {/* 3-byte code, starts with 1110 */
|
||||
if (((ix + 2) >= max_len) ||
|
||||
((utf[ix+1] & 0xc0) != 0x80) ||
|
||||
((utf[ix+2] & 0xc0) != 0x80)){
|
||||
if (end != NULL)
|
||||
*end = &utf [ix];
|
||||
return FALSE;
|
||||
}
|
||||
ix += 3;
|
||||
} else if ((c & 0xf8) == 0xf0) {/* 4-byte code, starts with 11110 */
|
||||
if (((ix + 3) >= max_len) ||
|
||||
((utf[ix+1] & 0xc0) != 0x80) ||
|
||||
((utf[ix+2] & 0xc0) != 0x80) ||
|
||||
((utf[ix+3] & 0xc0) != 0x80)){
|
||||
if (end != NULL)
|
||||
*end = &utf [ix];
|
||||
return FALSE;
|
||||
}
|
||||
ix += 4;
|
||||
} else {/* unknown encoding */
|
||||
if (end != NULL)
|
||||
*end = &utf [ix];
|
||||
return FALSE;
|
||||
}
|
||||
}
|
||||
|
||||
return TRUE;
|
||||
}
|
||||
Loaded 100 of 21251 files, more files were not shown because too many files have changed in this diff.
Show more
Reference in new issue
Block a user