Compare commits

..
3 Commits
Author SHA1 Message Date
nobody f4d7c3d9ef This commit was manufactured by cvs2svn to create tag 'MCS_0_20'.
svn path=/tags/MCS_0_20/mcs/; revision=11909
2003-02-24 00:08:31 +00:00
Martin Baulig 7f0542b133 Importing NUnit 1.11.
svn path=/branches/NUNIT/mcs/; revision=2713
2002-02-27 09:38:21 +00:00
nobody 9f187b5dd0 This commit was manufactured by cvs2svn to create branch 'NUNIT'.
svn path=/branches/NUNIT/mcs/; revision=2712
2002-02-27 09:38:18 +00:00
3035 changed files with 90165 additions and 371117 deletions

No files matched your search

-2
View File
@@ -15,5 +15,3 @@ Makefile.in
mono-*.tar.gz
stamp-h
stamp-h.in
mono.pc
mono.spec
-166
View File
@@ -1,169 +1,3 @@
2003-06-10 Dick Porter <[email protected]>
* acconfig.h:
* configure.in: Check for struct ip_mreq if struct ip_mreqn isn't
available.
2003-06-10 Zoltan Varga <[email protected]>
* configure.in: Define HAVE_GC_GCJ_MALLOC for included libgc.
2003-06-10 Martin Baulig <[email protected]>
* configure.in: Fall back to boehm if we don't have a libgc
subdirectory.
2003-06-10 Martin Baulig <[email protected]>
* configure.in: Make the libgc stuff actually work; we now create
a shared libmonogc.so when using the included libgc.
2003-06-09 Martin Baulig <[email protected]>
* configure.in: Only check for gc if --with-gc=boehm.
2003-06-08 Martin Baulig <[email protected]>
* configure.in: Tell libgc's configure about our threads library.
2003-06-08 Martin Baulig <[email protected]>
* libgc/: Integrate the libgc module here.
[Note: A simple `cvs update' won't work this time; you either need
to re-checkout the `mono' module or manually move the `libgc'
module here.]
* configure.in (--with-gc): Added `included' option to use the
included libgc. This is now also the default.
(LIBGC_CFLAGS, LIBGC_LIBS): Put the libgc stuff here and AC_SUBST it.
(INCLUDED_LIBGC): New automake conditional.
(USE_INCLUDED_LIBGC): #define this if appropriate.
* autogen.sh: Run libgc/autogen.sh.
* Makefile.am (SUBDIRS): Added libgc.
2003-06-05 Duncan Mak <[email protected]>
* mono.spec.in (Requires): Add libxml2 and libxslt dependency on
the package.
2003-05-19 Dick Porter <[email protected]>
* configure.in: Netbsd build fix by [email protected].
2003-05-10 Martin Willemoes Hansen <[email protected]>
* scripts/Makefile.am: Added monoresgen secutil sqlsharp
shell wrapper scripts.
2003-05-08 Zoltan Varga <[email protected]>
* mono/tests/Makefile.am:
- Compile with mcs.
- Disable some warnings.
- Added executables to clean target.
- Make testjit the default target.
- Print list of failed tests at the end of a test run.
- Abort tests when Ctrl-C is pressed.
* mono/tests/test-driver: Return with a special exit code when
SIGINT is detected.
* mono/tests/checked.cs: Make it compile.
2003-05-02 Miguel de Icaza <[email protected]>
* runtime/Makefile.am ($(monobins_DATA)): Use explicit file names
for the target exe binaries.
Copy cilc.exe and secutil.exe from the right paths to the right
location.
Add missing assemblies.
2003-05-02 Alp Toker <[email protected]>
* data/config.in: new dll mapping entry for libglade
2003-05-01 Duncan Mak <[email protected]>
* scripts/Makefile.am:
* runtime/Makefile.am: Install cilc and ilasm.
2003-04-29 Dietmar Maurer <[email protected]>
* mono/tests/Makefile.am (JITTEST_PROG): use mini/mono
2003-04-16 Charles Iliya Krempeaux <[email protected]>
* doc/web/team.xml : Added myself to it.
2003-04-10 Duncan Mak <[email protected]>
* doc/web/render-team-page.cs: Make the names of the element be
lowercase instead. BenM says this makes it XHTML compliant; heck,
I'm generating this from an XmlDocument already, why not make it
XHTML compliant?
2003-04-10 Duncan Mak <[email protected]>
* doc/web/render-team-page.cs (Compare): Correctly fix
ContributorComparer.
(RenderHtml): Add some SetAttribute loving to make it render prettier.
* doc/web/team.xml: Revert excessive indenting.
2003-04-07 Martin Baulig <[email protected]>
* mono/mini/: Added this directory to the build; install `mini'
and `libmini.la'.
2003-04-07 Duncan Mak <[email protected]>
* doc/web/render-team-page.cs: Fix ContributorComparer.
2003-04-04 Duncan Mak <[email protected]>
* doc/web/render-team-page.cs: Make it use 'none.png' if no image
are specified in the XML.
* doc/web/team.xml: Remove the comment.
* doc/web/render-team-page.cs: Make it not output a full HTML file.
2003-04-04 Duncan Mak <[email protected]>
* doc/web/commands:
* doc/web/makefile: Add team page information.
* doc/web/team.xml:
* doc/web/render-team-page.cs: Code for rendering a team page.
2003-04-02 Duncan Mak <[email protected]>
* doc/web/makefile: Add a new make target for generating a team
page on go-mono.com.
2003-04-04 Zoltan Varga <[email protected]>
* configure.in: Added check for GC_gcj_malloc.
2003-04-04 Martin Willemoes Hansen <[email protected]>
* man/sqlsharp.1: changed pass= to password= for the
PostgreSql provider.
>>>>>>> 1.166
2003-03-31 Gonzalo Paniagua Javier <[email protected]>
* data/machine.config: added SessionStateModule to httpModules section.
2003-02-13 Gonzalo Paniagua Javier <[email protected]>
* data/machine.config: added default sessionState section and handler.
2003-02-17 Daniel Morgan <[email protected]>
* doc/provider-factory: add new web page
+1 -3
View File
@@ -1,8 +1,6 @@
AUTOMAKE_OPTIONS = foreign
SUBDIRS = @libgc_dir@ mono doc docs runtime scripts man data
dnl EXTRA_SUBDIRS = libgc
SUBDIRS = mono doc docs runtime scripts man data
EXTRA_DIST= mono.pc.in mono.spec.in
-422
View File
@@ -1,425 +1,3 @@
Hello everyone!
We are releasing a new version of Mono, Mono 0.22. A new release
is made today because of the few recent bug-fixes that were committed
to CVS.
Source code and binaries for this release can be found on the
web page,
http://www.go-mono.com/download.html
The URLs for the sources are:
* MCS package (the Class Libraries, C# and VB.NET compiler
and other assorted tools written in Managed code):
http://www.go-mono.com/archive/mcs-0.22.tar.gz
* Mono package (the Runtime engine and JIT compiler):
http://www.go-mono.com/archive/mono-0.22.tar.gz
RPM packages for this release can be downloaded from the web-page
as well as from the 'Mono' channel on Red Carpet. Debian packages will
appear on the download page later, as well as an installer for our
Windows users.
Since last Thursday, 320 commits have been made to our CVS
repository. These following hackers contributed to Mono since version
0.21:
Aleksey Demakov, Alexandre Pigolkine, Atsushi Enomoto, Elan
Feingeld, Dick Porter, Dietmar Maurer, Duncan Mak, Gonzalo
Paniagua, Ian MacLean, Jackson Harper, Jean-Marc Andre, Jerome
Laban, Lluis Sanchez, Martin Baulig, Miguel de Icaza, Nick
Drochak, Paolo Molaro, Pedro Martinez, Per Ameng, Peter Williams,
Rafael Teixeira, Reggie Burnett, Sebastien Pouliot, Tim Coleman
and Zoltan Varga.
Highlights:
* The "MemoryStream" bug.
This bug affected a lot of classes, and made them crashy,
database code, XML parsing and a few others were
crashing. Thanks to Gonzalo for fixing this bug.
* System.Data:
More bug fixes from Aleksey and Tim.
* Reflection:
Zoltan continues to provide fixes to our Reflection.Emit code
to host IKVM.
* Remoting:
Lluis added support for activation using activation
attributes.
* PEToolkit:
Jackson imported the PEAPI package from the Queensland
University of Technology in Australia. This will replace the
existing Mono.PEToolkit for our ILasm back-end.
* Windows Forms:
More fixes from Reggie and Alexandre.
* System.Web.Mail:
Per has been working on this namespace. He announces recently
that all major parts of System.Web.Mail has now been implemented.
* System.Web.Mobile:
Gaurav continues to make progress here.
* Misc:
Ian MacLean contributed a /compile flag to monoresgen and
assorted bug-fixes and improvements from the rest of the team.
My name is Duncan Mak, and I just made my first Mono release.
-----------------------------------------------------------------------------
Hello everyone!
The Mono Team introduces the best Mono release so far we have
done. Thanks to everyone who contributed fixes, code, ideas, and bug
reports.
Mono 0.20 has been released, it is available at the usual location:
http://www.go-mono.com/download.html
This is a truly heroic release of Mono. Major architectural
chunks that were missing, or were miss-implemented have been fixed in
this release, and we are very proud of it. Please see the list of
features, because there is no short way of introducing just how good
this release is. A big thanks goes to Piers for setting up a
Tinderbox that monitors problems with the Mono CVS repository.
We released packages for SuSE 8.0, Mandrake 8.2, and various
Red Hat releases. It is also available from Red Carpet on the Mono
channel.
Source code for Mono, MCS, the Mono Debugger, XSP is available as
well from that web page. The sources are:
MCS package (Class Libraries, C# and VB.NET compiler and managed tools):
http://www.go-mono.com/archive/mcs-0.20.tar.gz
Mono package (Runtime engine, JIT compiler):
http://www.go-mono.com/archive/mono-0.20.tar.gz
XSP package (XSP test web server for ASP.NET webforms):
http://www.go-mono.com/archive/xsp-0.3.tar.gz
This release is brought to you by: Alvaro del Castillo, Alan Tam,
Alp Toker, Alejandro Sánchez, Alexandre Pigolkin, Atsushi Enomoto,
Brian Ritchie, Christopher Bockner, Daniel Lopez, Daniel Morgan,
Dennis Hayes, Dick Porter, Dietmar Maurer, Duncan Mak, Gaurav Vaish,
Gonzalo Paniagua, Jackson Harper, Jaime Anguiano, Jeff Stedfast,
Johannes Roith, John Sohn, Jonathan Pryor, "Lee Mallabone, "Lluis
Sanchez, "Marco Ridoni, Mark Crichton, Martin Baulig, Martin Willemoes
Hansen, Miguel de Icaza, Mike Kestner, Nick Drochak, Paolo Molaro,
Patrik Torstensson, Pedro Martinez, Per Arneng, Peter Williams, Petr
Danecek, Piers Haken, Radek Doulik, Rafael Teixeira, Rodrigo Moya,
Sebastien Pouliot, Tim Coleman, Ville Palo, and Zoltan Varga.
They commited 1810 changes to CVS patches in the past 33 days.
* New in this release
* Zoltan and IKVM
Zoltan's patches to run Jeroen's IKVM (the Java VM that
translates JVM bytecodes into .NET bytecodes) are in.
* Remoting.
The remoting team's patches that were held off on the previous
release are here. Lluis and Patrik have done a fantastic job
in getting remoting to work. Many low-level runtime engine
changes, and plenty of work on the class-library stuff.
Lluis has posted a couple of sample applications to the
mailing list, you can try those out.
The new release includes a working BinaryFormatter and
BinaryFormatterSink. It means that together with TcpChannel
it is possible to make remote calls with any type of
parameters and return values, including value types,
MarshalByRefObject types (that are properly
marshalled/unmarshalled), delegates, enums, etc.
RemotingConfiguration is partially implemented. It cannot read
from config files, but manual configuration using the api is
fully working.
Implemented full support for client activated types and for
well known objects (both singleton and single call).
Lease manager fully working (it manages the lifetime of server
objects).
Implemented interception of the new operator, so it is
possible to create a remote object using "new", if the type is
properly registered in RemotingConfiguration.
In Lluis' words: `Basically, 0.20 will have almost all needed
for a distributed application with Remoting'
* New threading semantics, IO-layer
Dick Porter in a couple of weeks has heroically redone much of
the threading support to match the .NET behavior (details are
on the .NET threading book as posted on the Mono site).
He also did a lot of bug fixes in the IO/threading space. The
threading implementation now contains a new and faster Monitor
implementation, as well as a correct Pulse()/Wait()
implementation.
GC thread finalization has been re-enabled. This means that
finalizers will be ran on a separate thread, as done in the
Microsoft.NET Framework. This might expose some bugs on
existing finalizer code.
* Moved to NUnit2
Nick and Gonzalo helped us move to the new NUnit2 platform for
all of our tests. A big applause goes to them.
* Cross Appdomain invocations work now.
ASP.NET and NUnit2 both used cross appdomain invocations, we
have fixed a number of problems, and they are now functional.
The AppDomain fixes and the Remoting fixes have allowed us to
remove a number of hacks in the ASP.NET implementation that
were previously there.
Implemented CrossAppDomainChannel, for calls between domains.
* C# Compiler and Debugging.
When generating debugging information in the compiler (with
-debug, -g or -debug+) the compiler will embed the debugging
information into the resulting executable instead of
generating a separate file. Very nice.
Generating debugging information has also improved vastly
performance-wise, and now it is possible to always use
debugging builds for software development.
A number of bugs were fixed on the compiler as well and
by using the Mono profiler we have reduced the memory
consumption and accelerated the compiler.
Thanks to Jackson, Martin, Paolo and for helping here.
* VB.NET Compiler.
Plenty of new features are included in the compiler in our
path to conformance. See <FIXME:get-url-for-posting> for
details on the status of the compiler, and the pieces missing.
* ILasm and Mono.PEToolkit.
Work on the IL assembler has resumed, but it is not yet ready
for production use. The Mono IL Assembler uses the
Mono.PEToolkit library done by Sergey and Jackson to
manipulate CIL image files.
* Cryptographic work.
Sebastien has provided a cert2spc and secutil tools for
certificate management. This is the first release that ships
an assembly for System.Security
Also a new internal assembly used only on Windows allows Mono
users to use the unmanaged crypto providers.
* System.XML
Atsushi has continued to improve the work on our XML
implementation: fixing bugs and more closely matching the
Microsoft implementation.
* More PowerPC/Alpha support.
Taylor Christopher has contributed more code generation macros
for PPC and Laramie Leavitt for Alpha.
* System.XML.Xsl
Gonzalo continued the implementation of our XSLT transformation
API (custom .NET functions are still missing though). It no
longer uses temporary files to apply transformations. Thanks
to an idea from Zdravko Tashev. Xslt Web controls work as
part of this fix.
* ASP.NET
Gonzalo has cleaned up a lot the code base, and now our test
server supports a --root and --virtual command line options
for better control.
Also, now we generate a much nicer error page on errors. We
are looking for volunteers to improve the default look of this
page.
Authentication is now supported
* Mobile Controls.
Gaurav Vaish continues on his quest to complete the
implementation of the Mobile controls. These controls are
required to run a stock IBuySpy application.
* Class Libraries:
New Mono.Posix class library that contains classes for working
on a Posix systems. Things like Unix domain sockets are here.
* System.Windows.Forms
Alexandre Pigolkine continues to contribute more code to our
Windows.Forms implementation. Currently it only runs on
Windows (or in Linux without GC enabled, due to the
pthread/Wine threading library mismatch. This is being
actively addressed as part of the Wine work due to the
movement to the new thread implementation available in RH 8.1).
* Database providers
Christopher Bockner has updated his DB2 database provider (now
with prepared statement functionality) and Tim Coleman has
continued work on the Oracle database provider (welcome back
Tim!)
* Database code.
Dan Morgan continues to develop core components in System.Data
(and now we welcome Alan Tam to the System.Data core hackers)
The SQL# tool now supports MySQLNet, Npgsql, DB2Client, and
Oracle clients.
* Runtime
mono --profile now performs memory allocation profiling too.
* Runtime fixes.
We now support multi-module with external file reference
assemblies.
The above in English means that we can now run Eiffel.NET code
in Mono.
* Monograph:
More statistics supported now.
* System.Web.Mail
Per has contributed the code for this namespace.
* Bugs
Plenty of bugs were closed.
-------------------------------------------------------------------------
Hello everyone!
We have made a new release of Mono available. Despite the fact
that we just did Mono 0.18, this release is packed with new features.
* Availability.
Mono 0.19 is available in package format from:
http://www.go-mono.com/download.html
We released packages for SuSE 8.0, Mandrake 8.2, Debian and various
Red Hat releases. It is also available from Red Carpet on the Mono
channel.
Source code for Mono, MCS, the Mono Debugger, XSP is available as
well from that web page.
* New in this release
* Remoting news:
Lluis has implemented and documented the Binary formatter
Woohoo! He has done a lot of work as well to support
remoting.
Patrik has also been working heavily on fixing a
number of remoting related bugs and missing features.
Ajay also implemented 1-d array serialization in System.Xml
* New database provider: IBM DB2
Christopher Bockner has contributed a DB2 data
provider for System.Data. We have a very complete
range of data providers.
* System.Web.Mobile
Gaurav has started work on this assembly, this will
allow us to run the unmodified reference ASP.NET
applications that were designed to support Mobile
browsing.
* System.Data and System.XML:
More implementation work on XmlDataDocument from Ville
and plenty of fixes from Atsushi.
* MacOS patches:
Paolo integrated John Duncan's and Benjamin Reed
patches to make Mono run on MacOS X out of the box.
* IsolatedStorage
The initial implementation of it was done by Jonathan
Pryor and included in this release.
* Compilers:
More work on the Mono Visual Basic compiler (it is now
included in the packages).
Plenty of bug fixes from Jackson, Miguel to the C#
compiler.
Patches from Francesco and Daniel to the VB.NET
support runtime.
* Debugger support
Plenty of updates to run the new Mono Debugger from Martin.
* Main missing bits:
Some of everyone's favorite patches or code chunks have not yet
been integrated, hopefully Mono 0.20 will have them:
* Zoltan's patch to run IKVM is not yet on this release
* Some parts of Patrik's remoting code did not make it to the
release either.
* Reggie's MySQL native provider is also missing.
Enjoy!
Miguel.
-------------------------------------------------------------------------
Hello everyone!
We have made a new release of Mono available. Despite the fact
-4
View File
@@ -5,7 +5,6 @@
#undef HAVE_SOL_TCP
#undef HAVE_IP_PKTINFO
#undef HAVE_STRUCT_IP_MREQN
#undef HAVE_STRUCT_IP_MREQ
#undef HAVE_PTHREAD_MUTEX_TIMEDLOCK
#undef USE_MONO_MUTEX
#undef HAVE_LARGE_FILE_SUPPORT
@@ -14,12 +13,9 @@
#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 NEED_LINK_UNLINK
#undef PTHREAD_POINTER_ID
#undef HAVE_GC_H
#undef HAVE_GC_GCJ_MALLOC
-6
View File
@@ -117,12 +117,6 @@ automake --add-missing --gnu $am_opt ||
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
+25 -101
View File
@@ -1,23 +1,9 @@
AC_INIT(README)
AC_CANONICAL_SYSTEM
AM_CONFIG_HEADER(config.h)
AM_INIT_AUTOMAKE(mono,0.25)
AM_INIT_AUTOMAKE(mono, 0.20)
AM_MAINTAINER_MODE
dnl
dnl libgc checks
dnl
gc_headers=no
gc=included
use_included_gc=no
if test -d $srcdir/libgc ; then
gc_default=included
else
gc_default=boehm
fi
#
# These are the flags that need to be stored in the mono.pc file for
# compiling code that will embed Mono
@@ -29,7 +15,6 @@ AC_SUBST(libmono_ldflags)
# Thread configuration inspired by sleepycat's db
AC_MSG_CHECKING([host platform characteristics])
libgc_threads=no
case "$host" in
*-*-mingw*|*-*-cygwin*)
platform_win32=yes
@@ -38,20 +23,8 @@ case "$host" in
HOST_CC="gcc"
CPPFLAGS="$CPPFLAGS -DGC_WIN32_THREADS -DWIN32_THREADS"
libdl=
libgc_threads=win32
gc_default=boehm
;;
*-*-*netbsd*)
platform_win32=no
CPPFLAGS="$CPPFLAGS -D_REENTRANT"
libmono_cflags="-D_REENTRANT"
LDFLAGS="$LDFLAGS -pthread"
libmono_ldflags="-pthread"
AC_DEFINE(NEED_LINK_UNLINK)
libdl=
libgc_threads=pthreads
;;
*-*-*freebsd*|*-*-*openbsd*)
*-*-*bsd*)
platform_win32=no
CPPFLAGS="$CPPFLAGS -D_THREAD_SAFE"
libmono_cflags="-D_THREAD_SAFE"
@@ -60,7 +33,6 @@ case "$host" in
AC_DEFINE(NEED_LINK_UNLINK)
AC_DEFINE(PTHREAD_POINTER_ID)
libdl=
libgc_threads=pthreads
;;
*-*-linux*)
platform_win32=no
@@ -68,14 +40,12 @@ case "$host" in
libmono_cflags="-DMONO_USE_EXC_TABLES -fexceptions -D_REENTRANT"
libmono_ldflags="-lpthread"
libdl="-ldl"
libgc_threads=pthreads
;;
*-*-solaris*)
platform_win32=no
CPPFLAGS="$CPPFLAGS -DGC_SOLARIS_THREADS -DGC_SOLARIS_PTHREADS -D_REENTRANT"
AC_DEFINE(NEED_LINK_UNLINK)
libmono_cflags="-D_REENTRANT"
libgc_threads=solaris
;;
*-*-darwin*)
platform_win32=no
@@ -86,8 +56,6 @@ case "$host" in
AC_DEFINE(NEED_LINK_UNLINK)
AC_DEFINE(PTHREAD_POINTER_ID)
libdl=
libgc_threads=no
gc_default=none
;;
*)
AC_MSG_WARN([*** Please add $host to configure.in checks!])
@@ -180,18 +148,16 @@ AC_SUBST(GLIB_LIBS)
AC_SUBST(GMODULE_CFLAGS)
AC_SUBST(GMODULE_LIBS)
AC_ARG_WITH(gc, [ --with-gc=boehm,included,none],[gc=$with_gc],[gc=$gc_default])
gc_headers=no
AC_CHECK_HEADERS(gc.h gc/gc.h, gc_headers=yes)
AC_CHECK_LIB(gc, GC_malloc, found_boehm="yes",,$libdl)
gc=auto
AC_ARG_WITH(gc, [ --with-gc=boehm,none],[gc=$with_gc])
LIBGC_CFLAGS=
LIBGC_LIBS=
libgc_dir=
case "x$gc" in
xboehm|xbohem|xyes)
AC_CHECK_HEADERS(gc.h gc/gc.h, gc_headers=yes)
AC_CHECK_LIB(gc, GC_malloc, found_boehm="yes",,$libdl)
if test "x$found_boehm" != "xyes"; then
AC_MSG_ERROR("GC requested but libgc not found! Install libgc or run configure with --with-gc=none.")
AC_MSG_ERROR("GC requested but libgc not found!")
fi
if test "x$gc_headers" != "xyes"; then
AC_MSG_ERROR("GC requested but header files not found! You may need to install them by hand.")
@@ -199,53 +165,27 @@ case "x$gc" in
AC_DEFINE(HAVE_BOEHM_GC)
AC_SUBST(HAVE_BOEHM_GC)
LIBGC_LIBS="-lgc $libdl"
AC_CHECK_FUNCS(GC_gcj_malloc)
LIBS="$LIBS -lgc $libdl"
;;
xincluded)
AC_CONFIG_SUBDIRS(libgc)
found_boehm=yes
gc_headers=yes
use_included_gc=yes
libgc_dir=libgc
LIBGC_CFLAGS='-I$(top_srcdir)/libgc/include'
LIBGC_LIBS='$(top_builddir)/libgc/libmonogc.la'
AC_DEFINE(HAVE_BOEHM_GC)
AC_SUBST(HAVE_BOEHM_GC)
AC_DEFINE(HAVE_GC_H)
AC_DEFINE(USE_INCLUDED_LIBGC)
# The included libgc contains GCJ support
AC_DEFINE(HAVE_GC_GCJ_MALLOC)
;;
xnone)
AC_MSG_WARN("Compiling mono without GC.")
;;
*)
AC_MSG_ERROR([Invalid argument to --with-gc.])
# If libgc was found, use it. Otherwise just warn.
if test "x$found_boehm" != "xyes"; then
AC_MSG_WARN("Compiling mono without GC.")
else
if test "x$gc_headers" != "xyes"; then
AC_MSG_ERROR("Found libgc but not its header files! You may need to install them by hand.")
fi
AC_DEFINE(HAVE_BOEHM_GC)
AC_SUBST(HAVE_BOEHM_GC)
LIBS="$LIBS -lgc $libdl"
gc="boehm"
fi
;;
esac
we_are_embedded_in_mono=yes
export we_are_embedded_in_mono
export libgc_threads
AM_CONDITIONAL(INCLUDED_LIBGC, test x$use_included_gc = xyes)
AC_SUBST(LIBGC_CFLAGS)
AC_SUBST(LIBGC_LIBS)
AC_SUBST(libgc_dir)
dnl
dnl End of libgc checks
dnl
if test x$platform_win32 = xno; then
dnl ******************************************************************
dnl *** Check for large file support ***
@@ -370,20 +310,8 @@ if test x$platform_win32 = xno; then
AC_MSG_RESULT(yes)
AC_DEFINE(HAVE_STRUCT_IP_MREQN)
], [
# We'll just have to try and use struct ip_mreq
# We'll just have to use struct ip_mreq
AC_MSG_RESULT(no)
AC_MSG_CHECKING(for struct ip_mreq)
AC_TRY_COMPILE([#include <netinet/in.h>], [
struct ip_mreq mreq;
mreq.imr_interface.s_addr = 0;
], [
# Yes, we have it...
AC_MSG_RESULT(yes)
AC_DEFINE(HAVE_STRUCT_IP_MREQ)
], [
# No multicast support
AC_MSG_RESULT(no)
])
])
dnl *****************************
@@ -567,15 +495,13 @@ fi
TARGET="unknown"
ACCESS_UNALIGNED="yes"
JIT_SUPPORTED=no
case "$host" in
#mips-sgi-irix5.* | mips-sgi-irix6.*) TARGET=MIPS; ACCESS_UNALIGNED="no";;
i*86-*-*) TARGET=X86; arch_target=x86; JIT_SUPPORTED=yes;;
i*86-*-*) TARGET=X86; arch_target=x86;;
sparc*-*-*) TARGET=SPARC; arch_target=sparc; ACCESS_UNALIGNED="no";;
#alpha*-*-linux* | alpha*-*-osf*) TARGET=ALPHA; ACCESS_UNALIGNED="no";;
#m68k-*-linux*) TARGET=M68K;;
macppc-*-openbsd* | powerpc-*-linux* | powerpc-*-openbsd* | powerpc-*-sysv* | powerpc-*-darwin*) TARGET=POWERPC; arch_target=ppc; JIT_SUPPORTED=yes;;
macppc-*-openbsd* | powerpc-*-linux* | powerpc-*-openbsd* | powerpc-*-sysv* | powerpc-*-darwin*) TARGET=POWERPC; arch_target=ppc;;
arm-*-linux-* | armv4l-*-linux-*) TARGET=ARM; arch_target=arm; ACCESS_UNALIGNED="no";;
s390-*-linux*) TARGET=S390; arch_target=s390; ACCESS_UNALIGNED="no";;
esac
@@ -599,8 +525,6 @@ AM_CONDITIONAL(POWERPC, test x$TARGET = xPOWERPC)
AM_CONDITIONAL(ARM, test x$TARGET = xARM)
AM_CONDITIONAL(S390, test x$TARGET = xS390)
AM_CONDITIONAL(JIT_SUPPORTED, test x$JIT_SUPPORTED = xyes)
LIBC="libc.so.6"
AC_SUBST(LIBC)
@@ -632,9 +556,9 @@ mono/tests/Makefile
mono/benchmark/Makefile
mono/monoburg/Makefile
mono/monograph/Makefile
mono/jit/Makefile
mono/io-layer/Makefile
mono/handles/Makefile
mono/mini/Makefile
runtime/Makefile
scripts/Makefile
man/Makefile
-2
View File
@@ -12,7 +12,5 @@
<dllmap dll="libgdk_pixbuf-2.0-0.dll" target="libgdk_pixbuf-2.0.so" />
<dllmap dll="libgtk-win32-2.0-0.dll" target="libgtk-x11-2.0.so" />
<dllmap dll="libgtk-win32-2.0-0.dll" target="libgtk-x11-2.0.so" />
<dllmap dll="libglade-2.0-0.dll" target="libglade-2.0.so" />
<dllmap dll="oci" target="clntsh" />
<dllmap dll="gtkhtml-3.0" target="libgtkhtml-3.0.so.2" />
</configuration>
-32
View File
@@ -19,38 +19,8 @@
type="System.Web.Configuration.AuthorizationConfigHandler, System.Web" />
<section name="globalization"
type="System.Web.Configuration.GlobalizationConfigurationHandler, System.Web" />
<section name="sessionState"
type="System.Web.SessionState.SessionStateSectionHandler, System.Web" />
</sectionGroup>
<sectionGroup name="system.net">
<section name="connectionManagement"
type="System.Net.Configuration.ConnectionManagementHandler, System" />
<section name="authenticationModules"
type="System.Net.Configuration.NetAuthenticationModuleHandler, System" />
<section name="defaultProxy"
type="System.Net.Configuration.DefaultProxyHandler, System" />
<section name="webRequestModules"
type="System.Net.Configuration.WebRequestModuleHandler, System" />
</sectionGroup>
</configSections>
<system.net>
<connectionManagement>
<add address="*" maxconnection="2" />
</connectionManagement>
<authenticationModules>
<add type="System.Net.BasicClient" />
</authenticationModules>
<defaultProxy>
<proxy />
<!-- bypassonlocal and proxyaddress are ok -->
<!-- usessystemdefault is not supported -->
</defaultProxy>
<webRequestModules>
<add prefix="http" type="System.Net.HttpRequestCreator, System" />
<add prefix="https" type="System.Net.HttpRequestCreator, System" />
<add prefix="file" type="System.Net.FileWebRequestCreator, System" />
</webRequestModules>
</system.net>
<system.web>
<httpHandlers>
<add verb="*" path="*.aspx" type="System.Web.UI.PageHandlerFactory, System.Web" />
@@ -63,7 +33,6 @@
<httpModules>
<add name="FormsAuthentication" type="System.Web.Security.FormsAuthenticationModule, System.Web" />
<add name="UrlAuthorization" type="System.Web.Security.UrlAuthorizationModule, System.Web" />
<add name="Session" type="System.Web.SessionState.SessionStateModule, System.Web" />
</httpModules>
<authentication mode="Forms">
<forms name=".MONOAUTH" loginUrl="login.aspx" protection="All" timeout="30" path="/">
@@ -80,7 +49,6 @@
culture="en-US"
uiculture="en-US" />
-->
<sessionState mode="InProc" />
</system.web>
<appSettings>
+1 -1
View File
@@ -5,7 +5,7 @@ WEB_FILES= \
oledb papers \
passport plans porting postgresql ppc projects rationale \
resources roadmap runtime sqlclient sqlite sybase tdsclient \
tds-providers status testing thanks tools \
tds-providers team status team testing thanks tools \
porting anoncvs monodoc-xml winforms
OTHERS= pending resources-pending todo mono-build.sh mono-build-w32.sh
+19 -13
View File
@@ -9,10 +9,8 @@
There is work underway for both systems. The Web Forms
support is more advanced at this point, and various ".aspx"
programs can be run using the Mono runtime, including IBuySpy.
ASP.NET works either embedded into
our XSP server test server or the mod_mono Apache module.
programs can be run using the Mono runtime (embedded into
either the XSP server or the mod_mono Apache module).
We are now working bug fixing and adding missing features
after making the whole pipeline compatible with MS.
@@ -21,15 +19,15 @@
SoapFormatter as part of the remoting infrastructure already
(contributed by Jesus), most people will be using the ASP.NET
Web Services support. Work for the supporting class libraries
just started recently.
The major missing element is a complete XmlSerializer.
just started recently.
** HttpRuntime
Patrik has authored most of the HttpRuntime support (both on
the System.Web and on the foundation).
We are currently working on this.
** XSP
This is where initial development of the .aspx/.ascx/.asax compiler
@@ -41,7 +39,7 @@
classes of this new server can be reused/extended to make an apache
module/cgi using mono (MonoWorkerRequest and MonoApplicationHost).
There is also a set of .aspx pages to test the server along with
There is also a bunch of .aspx pages to test the server along with
a few user controls under xsp/test.
You can check it out from CVS and run 'make install' to test it.
@@ -54,14 +52,22 @@
able to test them in real life: Gaurav and Leen worked very
hard on this namespace.
We can now render all HtmlControls and all WebControls.
We can now render all HtmlControls and almost all WebControls.
DataGrid and DataList controls are being finished by Gaurav.
Xml control needs some work on System.Xml related to XSL.
Help in making the controls better is appreciated.
** Extending ASP.NET
** ASP.NET and free controls.
Currently you have to reference in your ASP.NET the control
and all of its properties, which works fine if you have a GUI
designer, but is harder for people used to develop using text
editors.
We want to encourage developers to create open source controls
that can be used both on Mono's ASP.NET and Microsoft's ASP.NET.
Since we have a parser, we could extend this parser to allow
people to still use ASP.NET controls, using a simpler syntax.
For example people doing blogs and editing their templates
over the web probably do not want to use direct ASP.NET but a
wrapper around it.
* Web Forms: The pieces (historical)
-6
View File
@@ -1,9 +1,3 @@
* Mono Books
<a href="http://www.amazon.de/exec/obidos/ASIN/3827264928/qid=1050051051/sr=2-1/ref=sr_2_3_1/028-2755135-1623712">
Mono: .NET-kompatible Anwendungen mit dem Open Source-Framework
</a>
* C# Books
A Programmer's Introduction to C# - Second Edition: Eric Gunnerson
+7 -9
View File
@@ -1,15 +1,13 @@
* MCS: The Ximian C# compiler
The Mono C# compiler is considered feature complete at this
point and relatively mature. MCS is able to compile itself
and many more C# programs (there is a test suite included that
you can use). It is routinely used to compile Mono, roughly
half a million lines of C# code.
MCS is currently able to compile itself and many more C#
programs (there is a test suite included that you can use).
It is routinely used to compile Mono, roughly half a million
lines of C# code.
* Pending tasks
There are a few known bugs in the Mono C# compiler, but
they are very very few at this point,
We are in feature completion mode right now. There are still
a couple of areas that are not covered by the Mono compiler, but
they are very very few at this point (security attributes),
you can also browse the MCS <a href="http://bugzilla.ximian.com/buglist.cgi?product=Mono%2FMCS&bug_status=NEW&bug_status=ASSIGNED&bug_status=REOPENED&email1=&emailtype1=substring&emailassigned_to1=1&email2=&emailtype2=substring&emailreporter2=1&changedin=&chfieldfrom=&chfieldto=Now&chfieldvalue=&short_desc=&short_desc_type=substring&long_desc=&long_desc_type=substring&bug_file_loc=&bug_file_loc_type=substring&keywords=&keywords_type=anywords&op_sys_details=&op_sys_details_type=substring&version_details=&version_details_type=substring&cmdtype=doit&newqueryname=&order=Reuse+same+sort+as+last+time&form_name=query">bugs</a> from Bugzilla.
A test suite is maintained to track the progress of
+59 -151
View File
@@ -1,45 +1,25 @@
* CVS Access
Here we describe how one obtains commit access to the CVS repository
and the responsibilities that come with that access privilege.
If you are an active Mono developer, you can get a CVS account
that hosts the Mono source code. This web page contains
details about how to use the CVS server as well as the
policies to use it.
** What is CVS?
If you are not a developer, but want to track the development, please
see the <a href="anoncvs.html">AnonCVS</a> instructions.
Briefly, CVS is a system tool used to store and maintain files and
a history of their changes over time. The Mono source code and related
files are kept on a CVS server at Ximian.
** What Access?
We mean "commit" access. This is the privilege to make permanent
changes to the Mono source code and related files. You need an account
created by the CVS server administrator in order to commit changes to
the files on that server.
** How Does One Obtain Access?
Any active Mono developer can get a CVS account. Normally one is
considered an 'active' developer after sending several patches to the
mailing lists and/or bugzilla for review.
If you are not a developer, but want to access the latest sources,
please see the <a href="anoncvs.html">AnonCVS</a> instructions.
If you feel you are ready for a CVS account send an e-mail to
<a href="mailto:[email protected]">miguel</a> with your public OpenSSH
key for this purpose. Please specify if the key was generated with SSH
version 1 or version 2. Detailed instructions are below.
Send an e-mail to miguel with your public OpenSSH key for this
purpose. Please specify if the key was generated with SSH version 1
or version 2.
* Policies
It is necessary that everyone with CVS commit access respect and
adhere to the following rules. If you ask for and are granted CVS
access, you are agreeing to follow these policies.
Here are some policies about the use of the Mono CVS server.
** Code License
If you are about to commit code to a module, the code that is
being committed should be released under the same license as
being commited should be released under the same license as
the code that the module has.
Check the license if you are unsure, but it is basically:
@@ -48,105 +28,25 @@
If in doubt, check with the maintainers of the module, or send
mail to [email protected].
** Changing code
** Commiting code.
Even if you have CVS commit access, that doesn't mean you can change
code at will in any directory or module. Directories and Namespaces
have a sort of unofficial ownership. If you are not the owner of a
piece of code and you want to make changes/fixes to it, there are two
cases.
1) The change is a typo fix or a one-liner build or trivial fix. In
this case almost anyone can commit (always remembering to add the
proper changelog entry to explain the change). We say "almost anyone",
because changes to certain directories almost always should be reviewed
first. Such as changes to core stuff: corlib/System, System.Collections,
mini/, metadata/, System.IO.
If you are the maintainer for a piece of code, feel free to
commit code, and delegate the work to others.
2) The change is larger. In this case the patch *must* be sent to
mono-devel-list for review by the owner of the code and by the other
hackers. Always submit such patches to the list or bugzilla, although
you may put the owner of the code in the CC header. Hackers come and go.
Mailing a patch to only a personal address is a good way to get the
patch forgotten and missed. Plus, getting the patches reviewed as well
as reviewing them, is a good thing, so try to get used to it.
Use ChangeLog entries so we can keep textual descriptions of
your work, and use the contents of your ChangeLog file as the
CVS commit message (ie, paste the contents of this into the
editor buffer).
Note: If the patch is an addition of code and doesn't change any of the
existing code, the rules are slightly relaxed: there is more freedom
in committing such changes, if they don't interfere with the existing
codebase.
If you are making changes to someone else's code, please make
sure you get in touch with the maintainer of that code before
applying patches. You want to avoid commiting conflicting
work to someone else's code.
** Owning Code
Now, how do you get to be the owner of a chunk of code? The answer is
simple. You wrote the code, so you're the unofficial owner. There is
also another way. After sending a few patches for the code, the
owner (or the core developers of mono, if the owner somehow disappeared)
trusts you and tells you you're free to commit without getting his
review first.
Here is a (partial) list of namespaces/directories with their owners:
<ul>
<li>Debugger module and debug code in mono: martin
<li>mcs compiler: miguel, martin, ravi
<li>Reflection/Reflection.Emit: lupus, zoltan
<li>IO-layer: dick
<li>mini: lupus, dietmar
<li>test suite: nickd (though anyone should feel free to add test cases)
<li>System.IO: dick, ville
<li>security stuff: spouliot
<li>ilasm: jackson
<li>System.Web and related: gonzalo
<li>System.Xml: eno, piers
<li>Remoting: dietmar, lluis
<li>interop/marshal: dietmar
<li>threads: dick
</ul>
If you are the owner of a piece of code, feel free to commit code, and
delegate the work to others.
But, if you're not the owner of the code, committing a rewrite without
getting a review first is not good cvsitizenship (especially when the
rewrite claimed to fix bugs, but not a single regression test has been
added to the suite).
** Commit Rules
Once you know you can commit a patch (because of the rules above) there
are a few other small rules to follow:
<ul>
<li>Always add a changelog entry with a meaningful explanation
<li>If you fix a bug, add a regression test for it in the regression
suite
<li>Don't commit unrelated changes together with a fix: do fine-grained
commits
<li>Always check what you're committing: make sure you're only committing
what you need and make sure you don't change line endings and
whitespace. Do a 'cvs diff -u' of the files you're going to commit and
check the changes.
<li>Don't do reformatting commits, unless you're the original author of
the code
<li>When fixing bugs, don't follow the documentation blindly, it may
well be wrong. Test the behavior on the MS runtime or ask on the list
for discussion if unsure. Don't be afraid of having your changes
reviewed.
<li>Never remove copyright notices from the code
<li>Never remove licensing info from code
<li>Never commit code you didn't write yourself or code that doesn't
have a suitable license
<li>Follow the style conventions
<li>Keep an eye on performance considerations, especially for code in
core classes, ask on the list for guidance
<li>Do a regression test run and a bootstrapping build if making changes
to core functionality before committing. Do not commit code that would
break the compile, because that wastes everybody's time. Two things
Please do not commit code that would break the compile to the
CVS, because that normally wastes everybody's time. Two things
are important in this step: trying to build your sources and making
sure that you add all the new files before you do a commit.
</ul>
Also, remember to pat yourself on the back after the commit, smile and
think we're a step closer to a better free software world.
* Using CVS.
@@ -161,16 +61,14 @@
ssh-keygen -t rsa
</pre>
And mail <a href="mailto:[email protected]">miguel</a> the
id_rsa.pub file.
And mail me the id_rsa.pub file.
If you are using SSH version 1, run:
<pre>
ssh-keygen
</pre>
And mail <a href="mailto:[email protected]">miguel</a> your
identity.pub file.
And mail me your identity.pub file.
If you are using SSH from SSH Communications Security (they offer
a free SSH client for personal use), you have to use OpenSSH to
@@ -183,8 +81,7 @@
where the file id_XXX.pub is your public key file,
normally located under ~/.ssh/ or ~/.ssh2/.
Send to <a href="mailto:[email protected]">miguel</a> the
my_public_key.pub file.
Send to miguel the my_public_key.pub file.
The *exact* format for this file must be:
@@ -226,7 +123,7 @@
** Making patches
Usually you will want to make a patch to contribute, and let
other people review it before committing it. To obtain such a
other people review it before commiting it. To obtain such a
"patch", you type:
<pre>
@@ -235,25 +132,7 @@
mail [email protected] < file.diff
</pre>
** Committing your work
Once you get approval to commit to the CVS, or if you are
committing code that you are the maintainer of, you will want
to commit your code to CVS.
To do this, you have to "add" any new files that you created:
<pre>
cvs add new-file.cs
</pre>
And then commit your changes to the repository:
<pre>
cvs commit file-1.cs file-2.cs
</pre>
* Keeping track of changes.
** Keeping track of changes.
We provide two e-mail based mechanisms to keep track of
changes to the code base:
@@ -272,6 +151,28 @@
We hope to offer LXR and Bonsai in the future as well.
** Commiting your work
Once you get approval to commit to the CVS, or if you are
commiting code that you are the maintainer of, you will want
to commit your code to CVS.
To do this, you have to "add" any new files that you created:
<pre>
cvs add new-file.cs
</pre>
And then commit your changes to the repository:
<pre>
cvs commit file-1.cs file-2.cs
</pre>
* The Mailing Lists
To keep track of the various development and changes to the
CVS tree, you can subscribe to the [email protected].
To subscribe, send an email message to
[email protected] and in the body of the
message put `subscribe'.
@@ -284,3 +185,10 @@
the <a
href="mailto:[email protected]">[email protected]</a>
to receive the patches as they are checked into CVS.
** Recommendations
To build the sources, most of the type trying the `make' command
is enough. In some cases (the class libraries) we use nant, so
you need to run nant manually.
+1 -46
View File
@@ -16,8 +16,7 @@
the source code for Mono, you can start tracking down the
problem. Depending on how much time you have to devote to the
problem you could: <a href="http://bugzilla.ximian.com">File a
bug report</a> (read <a href="#goodbugreport">this</a>); track
down the problem and provide a better
bug report</a>; track down the problem and provide a better
<a href="http://bugzilla.ximian.com">bug report</a>; fix the
bug and provide a patch (you can <a
href="mailto:[email protected]">post it</a> to the <a
@@ -128,50 +127,6 @@
You can review the list of current bugs by going <a href="http://bugzilla.ximian.com/buglist.cgi?product=Mono%2FClass+Libraries&product=Mono%2FMCS&product=Mono%2FRuntime&bug_status=NEW&bug_status=ASSIGNED&bug_status=REOPENED&email1=&emailtype1=substring&emailassigned_to1=1&email2=&emailtype2=substring&emailreporter2=1&changedin=&chfieldfrom=&chfieldto=Now&chfieldvalue=&short_desc=&short_desc_type=substring&long_desc=&long_desc_type=substring&bug_file_loc=&bug_file_loc_type=substring&keywords=&keywords_type=anywords&op_sys_details=&op_sys_details_type=substring&version_details=&version_details_type=substring&cmdtype=doit&order=%27Importance%27&form_name=query">here</a>
<a name="goodbugreport"/>
** How to make good bug reports
A mail from Paolo to mono-devel-list contained this check list:
<ol>
* Submit a test case, the smaller it is, the better
* Use <a href="http://bugzilla.ximian.com">
http://bugzilla.ximian.com</a> to report the bug.
<p>In <b>addition</b> to bugzilla, posting to the list is
fine if the bug merits larger exposure or design
discussions to solve; posting to the list twice or more
is just a way to annoy people and make them waste time,
specially when you start a new thread about it.
* If the test involves libraries or assemblies that are
not part of mono, add info about where to download all
the dependencies, and how to compile/install them.
* If compiling the test case requires more than:
<pre> mcs test.cs </pre>
provide the <b>full command line</b> you used to compile
the test.
* If running the test requires more than:
<pre> mono test.exe </pre>
provide the <b>full command line</b> needed to replicate
the bug.
* Provide info about the version of the software you're
using (both mono and the operating system or relevant
libraries).
* Provide the output you expect the test case to produce.
* Provide the actual output <b>you</b> get from the test case.
</ol>
A good bug report complies with at least 6 items from the list.
If your bug report complies with 3 or less items, it is very
poor and it means it will take much more time to fix (when it's
not ignored).
** Small tasks
A few smaller tasks are here, dropped in no particular order:
+82 -167
View File
@@ -14,36 +14,38 @@
* Every classes are present.
* Most classes have their unit tests. Some tests like <code>
SymmetricAlgorithmTest</code> are generated by external
tools.
* MACTripleDES is compatible with the implementation shipped in
framework 1.0. Version 1.1 gives different results when the
MACed data is a multiple of BlockSize (8 bytes).
SymmetricAlgorithmTest</code> are generated by an external
tool.
</ul>
**** TODO
<ul>
* The current implementation of <code>CryptoStream</code> is
very limited and contain known bugs (<a
href="http://bugzilla.ximian.com/show_bug.cgi?id=40689">
40689</a>). The class need to be re-designed.
* Support for adding/modifying OID using the
<code>machine.config</code> configuration file (algorithms
are done).
* RNGCryptoServiceProvider is currently only working on Linux.
The current implementation reside in Mono's runtime and use
the <code>/dev/[u]random</code> device (which do not exists
under Windows). A Windows specific alternative is available
using the Mono.Security.Win32 assembly.
under Windows). A Windows alternative is in the work (see
Mono.Security.Win32 assembly section).
* Keypair persistance for RSA and DSA. This persistance must
somehow be linked with X509 certificate stores (in planning).
* <code>PasswordDeriveBytes.CryptDeriveKey</code> is included
in MS BCL to provide compatibility with existing Windows
in the BCL to provide compatibility with existing Windows
applications. The main problem is that the key derivation
algorithm can be different for every CSP (Crypto Service
Provider). However for compatibility we should provide an
implementation compatible with the MS CSP (most likely used).
* Analyse the current coverage of the unit tests on the
cryptographic classes and complete the unit tests.
* Optimizations (performance) on most class are possible. Some
have been done using the Community Edition of BoundChecker
(a free VisualStudio addon) - recommanded!
</ul>
**** Notes
@@ -51,16 +53,7 @@
* All cryptographic algorithms are entirely managed, including
classes named <code>*CryptoServiceProvider</code>, with the
exception of <code>RNGCryptoServiceProvider</code> (which
implementation resides in the runtime).
* There is a bug in the <code>PKCS1MaskGenerationMethod</code>
class (in both framework 1.0 and 1.1). This means our
implementation isn't compatible with MS (but is compatible with
PKCS#1 v.2.1). However we get OAEP padding for every platform!
* Look at assembly Mono.Security.Win32 if you require more
compatiblity with the Microsoft implementation (like accessing
a particuliar keypair container inside a specific CSP).
resides in the runtime).
</ul>
@@ -69,17 +62,17 @@
**** Status
<ul>
* X.509 certificates are parsed using 100% managed code
(using the Mono.Security.ASN1 class).
(using an internal ASN.1 class).
* Software Publisher Certificates (SPC) used by Authenticode
(tm) to sign assemblies are supported (extraction from PE
files) but <b>not yet</b> validated.
files) but <b>not</b> validated.
* Unit tests are generated from a set of existing certificates
* Tests are generated from a set of existing certificates
(about a dozen) each having different properties. Another
set of certificates (more than 700) are used for a more
complete test (but isn't part of the standard test suite for
size and time consideration, i.e. a 7.5Mb C# source file).
set of certificates (more than 300) are used for a more
complete test (but isn't part of the test suite for size
and time consideration).
</ul>
**** TODO
@@ -88,28 +81,26 @@
certificates from PE files but cannot validate the signature
nor the certificate chain (and we're still missing some trust
anchors). See Tools section for more information.
* Integration with CryptoAPI (on Windows) isn't possible as
long as the <code>X509Certificate(IntPtr)</code> constructor
isn't completed.
</ul>
**** Notes
<ul>
* Except for their structure <b>there are no validation of the
certificates</b> done by this class (this is by design and
isn't a restriction of Mono!). This means that certificate
signatures and validity dates are <b>never</b> checked
(except when used for Authenticode, i.e.
* <b>There's no validation of the certificates</b> done in this
class (this isn't a restriction of Mono!). This means that
certificate signatures and validity dates are <b>never</b>
checked (except when used for Authenticode, i.e.
<code>CreateFromSignedFile</code>).
* The newer X509Certificate class included in Microsoft's Web
Service Enhancement (WSE) is a little better (as it includes
CryptoAPI's validation) when <code>IsCurrent</code> is called.
See assembly <b>Microsoft.Web.Services</b> for more details.
* The class Mono.Security.X509.X509Certificate (in Mono.Security
assembly) is becoming a much better alternative - and will
continue to evolve to support the security tools.
* Microsoft implementation of <code>X509Certificate</code> is
done by using CryptoAPI (unmanaged code). From the exceptions
done by using CryptoAPI (unmanaged). From the exceptions
thrown Authenticode(tm) support is done via COM.
</ul>
@@ -124,10 +115,13 @@
**** Status
<ul>
* All classes are present but some (most Transforms) are only
* All classes are present but some (Transforms) are only
stubbed.
* Most classes have their unit tests.
* This assembly is present in CVS but only available when
building using NAnt (i.e. makefile are missing).
</ul>
**** TODO
@@ -138,86 +132,34 @@
signing (not because the transforms works). In the short
term <code>libxml2</code> could be used to provide C14N, but
in the long term a fully managed class would be much better.
</ul>
<hr>
** Assembly: Mono.Security
<b>Rational: </b>
This assembly provides the missing pieces to .NET security. On Windows
CryptoAPI is often used to provide much needed functionalities (like
some cryptographic algorithms, code signing, X.509 certificates). Mono,
for platform independance, implements these functionalities in 100%
managed code.
*** Namespace: Mono.Security
<ul>
* Structures (ASN1, PKCS7) and primitives (PKCS1).
</ul>
*** Namespace: Mono.Security.Authenticode
<ul>
* Code signing and verification.
* Support for SPC (Software Publisher Certificate) files and
PVK (Private Key) files.
</ul>
*** Namespace: Mono.Security.Cryptography
<ul>
* Additional algorithms: MD2, ARCFOUR (required for SSL)
* Convertion helpers
</ul>
*** Namespace: Mono.Security.X509
<ul>
* X.509 structures (certificate, CRL...) building and decoding.
</ul>
*** Namespace: Mono.Security.X509.Extensions
<ul>
* X.509 extensions (from public X.509 to private PKIX, Netsapce,
Microsoft, Entrust...).
</ul>
**** Status
<ul>
* Some part of the work has not yet been commited (still cleaning up).
* A big part of this assembly is also included inside Mono's
corlib. The classes are duplicated in this assembly so the
functionalities can be used without a dependency on Mono's
corlib (which depends on Mono's runtime).
* Unit test coverage isn't (yet) complete.
* Makefile for building under non-Windows operating systems.
</ul>
<hr>
** Assembly: Mono.Security.Win32
<b>Rational: </b>
This assembly goal is to provide maximum compatibility with CryptoAPI
to application running with Mono's runtime on the Windows operating
system.
<b>This assembly should NEVER be used directly by any application</b>
(e.g. referecing the assembly from a project).
<b>This assembly should NEVER be used directly by any application</b>.
The classes should only be used by modifying the <code>machine.config
</code> configuration file (and then only if this increased
compatibility is required by an application).
See the file <code><a href="http://cvs.hispalinux.es/cgi-bin/cvsweb/~checkout~/mcs/class/Mono.Security.Win32/README?rev=1.1&content-type=text/plain&cvsroot=mono">/mcs/class/Mono.Security.Win32/README</a></code>
for complete instructions.
*** Namespace: Mono.Security.Cryptography
**** Status
<ul>
* A RNGCryptoServiceProvider built on top of CryptoAPI. This
allows Windows users to get around the limitation of the
runtime RNG (which requires <code>/dev/[u]random/</code>).
* A RNGCryptoServiceProvider built on top of CryptoAPI.
* Wrapper classes for unmanaged versions of hash algorithms:
MD2, MD4, MD5 and SHA1 are supported. <b>note</b>: some
algorithms shouldn't be used in new design (MD4 is broken,
MD2 and MD5 aren't considered safe for some usage). They are
included to preserve interoperability with older applications
(e.g. some old, but still valid, X.509 certificates use MD2).
algorithms shouldn't be used in new design (MD4 is broken and
MD2 isn't considered safe). They are included to preserve
interoperability with older applications (e.g. some old, but
still valid, X.509 certificates use MD2).
</ul>
**** TODO
@@ -225,22 +167,11 @@
* Wrapper classes for unmanaged versions of symmetric
encryption algorithms (like DES, TripleDES, RC2 and others
present in default CSP).
* Wrapper classes for unmanaged versions of asymmetric
algorithms (like DSA and RSA) which persist their keypair
into the specified CSP.
</ul>
**** Ideas
<ul>
* Similar assemblies (e.g. <code>Mono.Security.XXX</code>)
could be created for <a href="http://www.openssl.org">OpenSSL</a>,
<a href="http://www.mozilla.org/projects/security/pki/nss/">NSS</a>,
<a href="http://www.eskimo.com/~weidai/cryptlib.html">crypto++</a>,
<a href="http://www.cryptlib.orion.co.nz/">cryptlib</a> ... for
improved performance and/or HSM (Hardware Security Module) support
under Linux and/or Windows.
</ul>
<hr>
** Assembly: Microsoft.Web.Services
@@ -248,34 +179,30 @@
Development Kit (WSDK) in it's beta days, is an add-on the .NET
framework that implements WS-Security (and other WS-* specifications).
It also includes improved support for XML Signature (replacing and/or
extending <code>System.Security.Cryptography.Xml</code>) and X.509
certificates classes.
extending <code>System.Security.Cryptography.Xml</code>) and X509
certificates.
Note: WSE is distributed as an add-on because some specifications,
like WS-Security, aren't yet completed by
<a href="http://www.oasis-open.org/committees/wss/">OASIS</a> or
other committees.
Note: WSE is distributed as an add-on because the WS-Security
specification isn't yet completed by
<a href="http://www.oasis-open.org/committees/wss/">OASIS</a>.
<b>[*] There are some licensing issues to consider before starting to
<b>There are some licensing issues to consider before stating to
implement WS-Security. All contributors must sign an agreement with
Microsoft before commiting anything related to WS-Security into CVS.
</b>
*** Namespace: Microsoft.Web.Services.Security [*]
*** Namespace: Microsoft.Web.Services.Timestamp [*]
*** Namespace: Microsoft.Web.Services.Security
**** Status
<ul>
* Nothing (yet) commited in CVS <b>[*]</b>.
* Nothing (yet) commited in CVS.
</ul>
*** Namespace: Microsoft.Web.Services.Security.X509
**** Status
<ul>
* Nothing (yet) commited in CVS. However the classes in this
namespace are outside WS-Security scope. So development, for
those classes, could be done without signing any agreements.
* Nothing (yet) commited in CVS.
</ul>
**** TODO
@@ -286,7 +213,21 @@
</ul>
<hr>
** Tools
** Other stuff
There are other, not so visible, uses of cryptography both inside and
outside the class library - such as:
<ul>
* SSL/TLS for secure communication (investigation under way).
* Assembly signing (and verification) using StrongNames.
* Assembly signing (and verification) using Authenticode(tm).
</ul>
*** Tools
There are many tools in the .NET framework that indirectly interacts
with some cryptographic classes. Mono will eventually need these tools.
@@ -295,7 +236,7 @@
**** Status
The following tools are complete (mostly complete):
The following tools are complete:
<ul>
* <code>secutil</code> is a tool to extract certificates and
strongnames from assemblies in a format that can be easily
@@ -304,72 +245,46 @@
* <code>cert2spc</code> is a tool to transform multiple X.509
certificates and CRLs into a Software Publisher Certificate
(SPC) file - which is a long name for a simple PKCS#7 file.
* <code>makecert</code> to create X.509 test certificates that
can be used (once transformed in SPC) to sign assemblies.
</ul>
Somewhat usable, somewhat incomplete:
**** TODO
The following tools are still missing or incomplete:
<ul>
* <code>sn</code> is a clone of the <code>sn</code> to manage
strongnames. Current version is limited to creating new keypairs
and converting values.
* <code>monosn</code> is a clone of the <code>sn</code> to manage
strongnames. This tools is part of the runtime (not the class
library) and as such is written in C and won't run without Mono.
</ul>
**** TODO
The following tools are still missing or largely incomplete:
<ul>
* <code>signcode</code> and <code>chktrust</code> (in progress)
for signing and validating Authenticode(tm) signatures on
assemblies (or any PE file).
* <code>makecert</code> to create X.509 test certificates that
can be used (once transformed in SPC) to sign assemblies.
* Other tools like a, GUI-based, certificate manager...
</ul>
Note that many of the tools requires the class library and/or the
runtime to be ready for them. E.g. StrongName and Authenticode signatures
tools are of limited use until supported by the runtime.
<hr>
** Other stuff
<ul>
* SSL/TLS for secure communication (a prototype is under way).
Some work is already visible in Mono.Security assembly (e.g.
RC4, RSAManaged ...).
</ul>
runtime to be ready for them.
<hr>
** How to Help
<ul>
* Complete any of the TODO (and feel good about it ;-).
Complete any of the TODO (and feel good about it ;-).
* Analyse the current coverage of the unit tests on the
cryptographic classes and complete the unit tests.
Add missing unit tests to classes or methods.
* Optimization can also be done on most algorithms as crypto
is never fast enough. Some have been done using the
Community Edition of BoundChecker (a free VisualStudio
addon) - recommanded! Just be sure to test every optimization
(using the unit test) carefully - it's so fast to break an
algorithm ;-).
Write some documentation on the cryptographic classes for MonkeyGuide
(as I'm not a good writer, at least in English, but you must be a good
reader if you got to this part).
* Write some documentation on the cryptographic classes for
the <a href="http://go-mono.com/tutorial/html/en/index.html">Mono
Handbook</a> as I'm not a very good writer (at least in English).
</ul>
Optimization can also be done on algorithms as crypto is never fast
enough. Just be sure to test every optimization (using the unit test)
carefully - it's so fast to break an algorithm ;-).
Contact Sebastien Pouliot (<a href="mailto:[email protected]">home</a>
, <a href="mailto:[email protected]">work</a>) if you need additional
informations about the status of the cryptographic classes.
<hr>
Last reviewed: June 11, 2003 (post mono 0.24)
Last reviewed: February 5, 2003 (post mono 0.19)
+105 -624
View File
@@ -16,619 +16,6 @@
<table>
<tbody>
<tr bgcolor="#DDDDDD">
<td>
<b>Release 0.25</b><br>
<a href="archive/mono-0.25.html">Release notes</a><br>
Jun 26, 2003
</td>
<td>
<table cellspacing="1" cellpadding="3">
<tr bgcolor="#BBBBBB">
<td>
<b>Source Code</b>
</td>
<td>
<ul>
<li><a href="archive/mcs-0.25.tar.gz">Mono Class Libraries and C# Compiler.</a>
<li><a href="archive/mono-0.25.tar.gz">Mono Runtime</a>
<li><a href="archive/xsp-0.4.tar.gz">XSP web server (0.4)</a>
<li><a href="archive/monodoc-0.4.tar.gz">MonoDoc 0.5</a>
<li><a href="archive/gtk-sharp-0.10.tar.gz">Gtk# 0.10</a>
</ul>
</td>
</tr>
<tr bgcolor="#BBBBBB">
<td>
<b>Source RPMs</b><br>
(No RPMS for XSP).
</td>
<td>
<ul>
<li><a href="archive/mono-0.25-1.src.rpm">mono-0.25-1.src.rpm</a>
</ul>
</td>
</tr>
<tr>
<td></td>
</tr>
<tr>
<td bgcolor="#999999">
<img src="images/redhat-36.gif"><b>Red Hat 9.0/x86</b>
<ul>
<li><a href="archive/redhat-90-i386/mono-0.25-1.i386.rpm">mono-0.25-1.i386.rpm</a>
<li><a href="archive/redhat-90-i386/mono-devel-0.25-1.i386.rpm">mono-devel-0.25-1.i386.rpm</a>
<li><a href="archive/redhat-90-i386/mono-debuginfo-0.25-1.i386.rpm">mono-debuginfo-0.25-1.i386.rpm</a>
<br>
<li><a href="archive/redhat-90-i386/gtk-sharp-0.9-1.i386.rpm">gtk-sharp-0.9-1.i386.rpm</a>
<li><a href="archive/redhat-90-i386/gtk-sharp-debuginfo-0.9-1.i386.rpm">gtk-sharp-debuginfo-0.9-1.i386.rpm</a>
<li><a href="archive/redhat-90-i386/monodoc-0.4-1.i386.rpm">monodoc-0.4-1.i386.rpm</a>
</ul>
</td>
<td bgcolor="#999999">
<img src="images/redhat-36.gif"><b>Red Hat 8.0/x86</b>
<ul>
<li><a href="archive/redhat-80-i386/mono-0.25-2.i386.rpm">mono-0.25-2.i386.rpm</a>
<li><a href="archive/redhat-80-i386/mono-devel-0.25-2.i386.rpm">mono-devel-0.25-2.i386.rpm</a>
<br>
<li><a href="archive/redhat-80-i386/gtk-sharp-0.9-1.i386.rpm">gtk-sharp-0.9-1.i386.rpm</a>
<li><a href="archive/redhat-80-i386/monodoc-0.4-1.i386.rpm">monodoc-0.4-1.i386.rpm</a>
</ul>
</td>
</tr>
<tr>
<td bgcolor="#999999">
<img src="images/debian-36.gif"><b>Debian</b>
<ul>
<li><a href="http://www.debianplanet.com/mono/">Debian Packages here.</a>
</ul>
</td>
<td bgcolor="#999999">
<img src="images/windows-36.gif"><b>Windows Setup Wizard (XP, 2000, NT)</b>
<ul>
<li><a href="archive/mono-0.25-win32-1.exe">Setup program.</a>
</ul>
</td>
</tr>
<tr>
<td bgcolor="#999999">
<img src="images/redhat-36.gif"><b>Red Hat 7.3/x86</b>
<ul>
<li><a href="archive/redhat-73-i386/mono-0.25-1.i386.rpm">mono-0.25-1.i386.rpm</a>
<li><a href="archive/redhat-73-i386/mono-devel-0.25-1.i386.rpm">mono-devel-0.25-1.i386.rpm</a>
</ul>
</td>
<td bgcolor="#999999">
<img src="images/mandrake-36.gif"><b>Mandrake 8.2/x86</b>
<ul>
<li><a href="archive/mandrake-82-i386/mono-0.25-1.i586.rpm">mono-0.25-1.i586.rpm</a>
<li><a href="archive/mandrake-82-i386/mono-devel-0.25-1.i586.rpm">mono-devel-0.25-1.i586.rpm</a>
</ul>
</td>
</tr>
<tr>
<td bgcolor="#999999">
<img src="images/suse-36.gif"><b>SuSE 8.2/x86</b>
<ul>
<li><a href="archive/suse-80-i386/mono-0.25-1.i386.rpm">mono-0.25-1.i386.rpm</a>
<li><a href="archive/suse-80-i386/mono-devel-0.25-1.i386.rpm">mono-devel-0.25-1.i386.rpm</a>
</ul>
</td>
</tr>
</table>
</td>
</tr>
<tr>
<tr bgcolor="#CCCCC">
<td>
<b>Regression Tests</b><br>
</td>
<td>
You can get binaries for the Mono Regression Test
Suite <a href="archive/mono-tests.tar.gz">here</a>
</td>
</tr>
</tr>
</tbody>
</table>
* Older Releases:
We provide binaries for older releases until we have packages for the new release.
<table>
<tbody>
<tr bgcolor="#DDDDDD">
<td>
<b>Release 0.24</b><br>
<a href="archive/mono-0.24.html">Release notes</a><br>
May 6, 2003
</td>
<td>
<table cellspacing="1" cellpadding="3">
<tr bgcolor="#BBBBBB">
<td>
<b>Source Code</b>
</td>
<td>
<ul>
<li><a href="archive/mcs-0.24.tar.gz">Mono Class Libraries and C# Compiler.</a>
<li><a href="archive/mono-0.24.tar.gz">Mono Runtime</a>
<li><a href="archive/gc6.1.tar.gz">Boehm GC 6.1</a>
<li><a href="archive/xsp-0.4.tar.gz">XSP web server (0.4)</a>
<li><a href="archive/monodoc-0.4.tar.gz">MonoDoc 0.4</a>
<li><a href="archive/gtk-sharp-0.9.tar.gz">Gtk# 0.9</a>
</ul>
</td>
</tr>
<tr bgcolor="#BBBBBB">
<td>
<b>Source RPMs</b><br>
(No RPMS for XSP).
</td>
<td>
<ul>
<li><a href="archive/libgc-6.1-1.src.rpm">libgc-6.1-1.src.rpm</a>
<li><a href="archive/mono-0.24-1.src.rpm">mono-0.24-1.src.rpm</a>
</ul>
</td>
</tr>
<tr>
<td></td>
</tr>
<tr>
<td bgcolor="#999999">
<img src="images/redhat-36.gif"><b>Red Hat 9.0/x86</b>
<ul>
<li><a href="archive/redhat-90-i386/libgc-6.1-1.i386.rpm">libgc-6.1-1.i386.rpm</a>
<li><a href="archive/redhat-90-i386/libgc-devel-6.1-1.i386.rpm">libgc-devel-6.1-1.i386.rpm</a>
<li><a href="archive/redhat-90-i386/mono-0.24-1.i386.rpm">mono-0.24-1.i386.rpm</a>
<li><a href="archive/redhat-90-i386/mono-devel-0.24-1.i386.rpm">mono-devel-0.24-1.i386.rpm</a>
<li><a href="archive/redhat-90-i386/mono-debuginfo-0.24-1.i386.rpm">mono-debuginfo-0.24-1.i386.rpm</a>
<br>
<li><a href="archive/redhat-90-i386/gtk-sharp-0.9-1.i386.rpm">gtk-sharp-0.9-1.i386.rpm</a>
<li><a href="archive/redhat-90-i386/gtk-sharp-debuginfo-0.9-1.i386.rpm">gtk-sharp-debuginfo-0.9-1.i386.rpm</a>
<li><a href="archive/redhat-90-i386/monodoc-0.4-1.i386.rpm">monodoc-0.4-1.i386.rpm</a>
</ul>
</td>
<td bgcolor="#999999">
<img src="images/redhat-36.gif"><b>Red Hat 8.0/x86</b>
<ul>
<li><a href="archive/redhat-80-i386/libgc-6.1-1.i386.rpm">libgc-6.1-1.i386.rpm</a>
<li><a href="archive/redhat-80-i386/libgc-devel-6.1-1.i386.rpm">libgc-devel-6.1-1.i386.rpm</a>
<li><a href="archive/redhat-80-i386/mono-0.24-2.i386.rpm">mono-0.24-2.i386.rpm</a>
<li><a href="archive/redhat-80-i386/mono-devel-0.24-2.i386.rpm">mono-devel-0.24-2.i386.rpm</a>
<br>
<li><a href="archive/redhat-80-i386/gtk-sharp-0.9-1.i386.rpm">gtk-sharp-0.9-1.i386.rpm</a>
<li><a href="archive/redhat-80-i386/monodoc-0.4-1.i386.rpm">monodoc-0.4-1.i386.rpm</a>
</ul>
</td>
</tr>
<tr>
<td bgcolor="#999999">
<img src="images/debian-36.gif"><b>Debian</b>
<ul>
<li><a href="http://www.debianplanet.com/mono/">Debian Packages here.</a>
</ul>
</td>
<td bgcolor="#999999">
<img src="images/windows-36.gif"><b>Windows Setup Wizard (XP, 2000, NT)</b>
<ul>
<li><a href="archive/mono-0.24-win32-1.exe">Setup program.</a>
</ul>
</td>
</tr>
<tr>
<td bgcolor="#999999">
<img src="images/redhat-36.gif"><b>Red Hat 7.3/x86</b>
<ul>
<li><a href="archive/redhat-73-i386/libgc-6.1-1.i386.rpm">libgc-6.1-1.i386.rpm</a>
<li><a href="archive/redhat-73-i386/libgc-devel-6.1-1.i386.rpm">libgc-devel-6.1-1.i386.rpm</a>
<li><a href="archive/redhat-73-i386/mono-0.24-1.i386.rpm">mono-0.24-1.i386.rpm</a>
<li><a href="archive/redhat-73-i386/mono-devel-0.24-1.i386.rpm">mono-devel-0.24-1.i386.rpm</a>
</ul>
</td>
<td bgcolor="#999999">
<img src="images/mandrake-36.gif"><b>Mandrake 8.2/x86</b>
<ul>
<li><a href="archive/mandrake-82-i386/libgc-6.1-1.i586.rpm">libgc-6.1-1.i586.rpm</a>
<li><a href="archive/mandrake-82-i386/libgc-devel-6.1-1.i586.rpm">libgc-devel-6.1-1.i586.rpm</a>
<li><a href="archive/mandrake-82-i386/mono-0.24-1.i586.rpm">mono-0.24-1.i586.rpm</a>
<li><a href="archive/mandrake-82-i386/mono-devel-0.24-1.i586.rpm">mono-devel-0.24-1.i586.rpm</a>
</ul>
</td>
</tr>
<tr>
<td bgcolor="#999999">
<img src="images/suse-36.gif"><b>SuSE 8.0/x86</b>
<ul>
<li><a href="archive/suse-80-i386/libgc-6.1-1.i386.rpm">libgc-6.1-1.i386.rpm</a>
<li><a href="archive/suse-80-i386/libgc-devel-6.1-1.i386.rpm">libgc-devel-6.1-1.i386.rpm</a>
<li><a href="archive/suse-80-i386/mono-0.24-1.i386.rpm">mono-0.24-1.i386.rpm</a>
<li><a href="archive/suse-80-i386/mono-devel-0.24-1.i386.rpm">mono-devel-0.24-1.i386.rpm</a>
</ul>
</td>
<td bgcolor="#999999">
<b>Linux s/390</b>
<ul>
<li><a href="archive/s390/libgc-6.1-1.s390.rpm">libgc-6.1-1.s390.rpm</a>
<li><a href="archive/s390/libgc-devel-6.1-1.s390.rpm">libgc-devel-6.1-1.s390.rpm</a>
<li><a href="archive/s390/mono-0.24-1.s390.rpm">mono-0.24-1.s390.rpm</a>
<li><a href="archive/s390/mono-devel-0.24-1.s390.rpm">mono-devel-0.24-1.s390.rpm</a>
</ul>
</td>
</tr>
</table>
</td>
</tr>
<tr>
<tr bgcolor="#CCCCC">
<td>
<b>Regression Tests</b><br>
</td>
<td>
You can get binaries for the Mono Regression Test
Suite <a href="archive/mono-tests.tar.gz">here</a>
</td>
</tr>
</tr>
</tbody>
</table>
<table>
<tbody>
<tr bgcolor="#DDDDDD">
<td>
<b>Release 0.23</b><br>
<a href="archive/mono-0.23">Release notes</a><br>
March 5, 2003
</td>
<td>
<table cellspacing="1" cellpadding="3">
<tr bgcolor="#BBBBBB">
<td>
<b>Source Code</b>
</td>
<td>
<ul>
<li><a href="archive/mcs-0.23.tar.gz">Mono Class Libraries and C# Compiler.</a>
<li><a href="archive/mono-0.23.tar.gz">Mono Runtime</a>
<li><a href="archive/gc6.1.tar.gz">Boehm GC 6.1</a>
<li><a href="archive/xsp-0.3.tar.gz">XSP web server (0.3)</a>
<li><a href="archive/mono-debugger-0.2.2.tar.gz">Mono Debugger 0.2.2</a>
</ul>
</td>
</tr>
<tr bgcolor="#BBBBBB">
<td>
<b>Source RPMs</b><br>
(No RPMS for XSP).
</td>
<td>
<ul>
<li><a href="archive/libgc-6.1-1.src.rpm">libgc-6.1-1.src.rpm</a>
<li><a href="archive/mono-0.23-1.src.rpm">mono-0.23-1.src.rpm</a>
</ul>
</td>
</tr>
<tr>
<td></td>
</tr>
<tr>
<td bgcolor="#999999">
<b>Red Hat 7.3/x86</b>
<ul>
<li><a href="archive/redhat-73-i386/libgc-6.1-1.i386.rpm">libgc-6.1-1.i386.rpm</a>
<li><a href="archive/redhat-73-i386/libgc-devel-6.1-1.i386.rpm">libgc-devel-6.1-1.i386.rpm</a>
<li><a href="archive/redhat-73-i386/mono-0.23-1.i386.rpm">mono-0.23-1.i386.rpm</a>
<li><a href="archive/redhat-73-i386/mono-devel-0.23-1.i386.rpm">mono-devel-0.23-1.i386.rpm</a>
</ul>
</td>
<td bgcolor="#999999">
<b>Red Hat 7.2/x86</b>
<ul>
<li><a href="archive/redhat-72-i386/libgc-6.1-1.i386.rpm">libgc-6.1-1.i386.rpm</a>
<li><a href="archive/redhat-72-i386/libgc-devel-6.1-1.i386.rpm">libgc-devel-6.1-1.i386.rpm</a>
<li><a href="archive/redhat-72-i386/mono-0.23-1.i386.rpm">mono-0.23-1.i386.rpm</a>
<li><a href="archive/redhat-72-i386/mono-devel-0.23-1.i386.rpm">mono-devel-0.23-1.i386.rpm</a>
</ul>
</td>
</tr>
<tr>
<td bgcolor="#999999">
<b>Red Hat 7.1/x86</b>
<ul>
<li><a href="archive/redhat-71-i386/libgc-6.1-1.i386.rpm">libgc-6.1-1.i386.rpm</a>
<li><a href="archive/redhat-71-i386/libgc-devel-6.1-1.i386.rpm">libgc-devel-6.1-1.i386.rpm</a>
<li><a href="archive/redhat-71-i386/mono-0.23-1.i386.rpm">mono-0.23-1.i386.rpm</a>
<li><a href="archive/redhat-71-i386/mono-devel-0.23-1.i386.rpm">mono-devel-0.23-1.i386.rpm</a>
</ul>
</td>
<td bgcolor="#999999">
<b>Mandrake 8.2/x86</b>
<ul>
<li><a href="archive/mandrake-82-i386/libgc-6.1-1.i586.rpm">libgc-6.1-1.i586.rpm</a>
<li><a href="archive/mandrake-82-i386/libgc-devel-6.1-1.i586.rpm">libgc-devel-6.1-1.i586.rpm</a>
<li><a href="archive/mandrake-82-i386/mono-0.23-1.i586.rpm">mono-0.23-1.i586.rpm</a>
<li><a href="archive/mandrake-82-i386/mono-devel-0.23-1.i586.rpm">mono-devel-0.23-1.i586.rpm</a>
</ul>
</td>
</tr>
<tr>
<td bgcolor="#999999">
<b>SuSE 8.0/x86</b>
<ul>
<li><a href="archive/suse-80-i386/libgc-6.1-1.i386.rpm">libgc-6.1-1.i386.rpm</a>
<li><a href="archive/suse-80-i386/libgc-devel-6.1-1.i386.rpm">libgc-devel-6.1-1.i386.rpm</a>
<li><a href="archive/suse-80-i386/mono-0.23-1.i386.rpm">mono-0.23-1.i386.rpm</a>
<li><a href="archive/suse-80-i386/mono-devel-0.23-1.i386.rpm">mono-devel-0.23-1.i386.rpm</a>
</ul>
</td>
<td bgcolor="#999999">
<b>Red Hat 8.0/x86</b>
<ul>
<li><a href="archive/redhat-80-i386/libgc-6.1-1.i386.rpm">libgc-6.1-1.i386.rpm</a>
<li><a href="archive/redhat-80-i386/libgc-devel-6.1-1.i386.rpm">libgc-devel-6.1-1.i386.rpm</a>
<li><a href="archive/redhat-80-i386/mono-0.23-1.i386.rpm">mono-0.23-1.i386.rpm</a>
<li><a href="archive/redhat-80-i386/mono-devel-0.23-1.i386.rpm">mono-devel-0.23-1.i386.rpm</a>
</ul>
</td>
</tr>
<tr>
<td bgcolor="#999999">
<b>Windows Setup Wizard (NT/2000/XP)</b>
<ul>
<li><a href="archive/mono-0.23-win32-2.exe">Mono-Setup</a>
</ul>
</td>
<td bgcolor="#999999">
<b>Linux S/390</b>
<ul>
<li><a href="archive/s390/libgc-6.1-1.s390.rpm">libgc-6.1-1.s390.rpm</a>
<li><a href="archive/s390/libgc-devel-6.1-1.s390.rpm">libgc-devel-6.1-1.s390.rpm</a>
<li><a href="archive/s390/mono-0.23-1.s390.rpm">mono-0.23-1.s390.rpm</a>
<li><a href="archive/s390/mono-devel-0.23-1.s390.rpm">mono-devel-0.23-1.s390.rpm</a>
</ul>
</td>
</tr>
</table>
</td>
</tr>
<tr>
<tr bgcolor="#CCCCC">
<td>
<b>Regression Tests</b><br>
</td>
<td>
You can get binaries for the Mono Regression Test
Suite <a href="archive/mono-tests.tar.gz">here</a>
</td>
</tr>
</tr>
</tbody>
</table>
<table>
<tbody>
<tr bgcolor="#DDDDDD">
<td>
<b>Release 0.22</b><br>
<a href="archive/mono-0.22">Release notes</a><br>
March 5, 2003
</td>
<td>
<table cellspacing="1" cellpadding="3">
<tr bgcolor="#BBBBBB">
<td>
<b>Source Code</b>
</td>
<td>
<ul>
<li><a href="archive/mcs-0.22.tar.gz">Mono Class Libraries and C# Compiler.</a>
<li><a href="archive/mono-0.22.tar.gz">Mono Runtime</a>
<li><a href="archive/gc6.1.tar.gz">Boehm GC 6.1</a>
<li><a href="archive/xsp-0.3.tar.gz">XSP web server (0.3)</a>
</ul>
</td>
</tr>
<tr bgcolor="#BBBBBB">
<td>
<b>Source RPMs</b><br>
(No RPMS for XSP).
</td>
<td>
<ul>
<li><a href="archive/libgc-6.1-1.src.rpm">libgc-6.1-1.src.rpm</a>
<li><a href="archive/mono-0.22-1.src.rpm">mono-0.22-1.src.rpm</a>
</ul>
</td>
</tr>
<tr>
<td></td>
</tr>
<tr>
<td bgcolor="#999999">
<b>Windows Setup Wizard (NT/2000/XP)</b>
<ul>
<li><a href="archive/mono-0.22-win32-1.exe">Mono-Setup</a>
</ul>
</td>
</tr>
</table>
</td>
</tr>
<tr>
<tr bgcolor="#CCCCC">
<td>
<b>Regression Tests</b><br>
</td>
<td>
You can get binaries for the Mono Regression Test
Suite <a href="archive/mono-tests.tar.gz">here</a>
</td>
</tr>
</tr>
</tbody>
</table>
<table>
<tbody>
<tr bgcolor="#DDDDDD">
<td>
<b>Release 0.21</b><br>
<a href="archive/mono-0.21">Release notes</a><br>
Feb 27th, 2003
</td>
<td>
<table cellspacing="1" cellpadding="3">
<tr bgcolor="#BBBBBB">
<td>
<b>Source Code</b>
</td>
<td>
<ul>
<li><a href="archive/mcs-0.21.tar.gz">Mono Class Libraries and C# Compiler.</a>
<li><a href="archive/mono-0.21.tar.gz">Mono Runtime</a>
<li><a href="archive/gc6.1.tar.gz">Boehm GC 6.1</a>
<li><a href="archive/xsp-0.3.tar.gz">XSP web server (0.3)</a>
</ul>
</td>
</tr>
<tr bgcolor="#BBBBBB">
<td>
<b>Source RPMs</b><br>
(No RPMS for XSP).
</td>
<td>
<ul>
<li><a href="archive/libgc-6.1-1.src.rpm">libgc-6.1-1.src.rpm</a>
<li><a href="archive/mono-0.21-1.src.rpm">mono-0.21-1.src.rpm</a>
</ul>
</td>
</tr>
<tr>
<td></td>
</tr>
<tr>
<td bgcolor="#999999">
<b>Debian packages</b>
<ul>
<li><a href="http://www.atoker.com/mono/">Alp's web site</a>
</ul>
</td>
</tr>
</table>
</td>
</tr>
<tr>
<tr bgcolor="#CCCCC">
<td>
<b>Regression Tests</b><br>
</td>
<td>
You can get binaries for the Mono Regression Test
Suite <a href="archive/mono-tests.tar.gz">here</a>
</td>
</tr>
</tr>
</tbody>
</table>
<table>
<tbody>
<tr bgcolor="#DDDDDD">
<td>
<b>Release 0.20</b><br>
<a href="archive/mono-0.20">Release notes</a><br>
Feb 20th, 2003
</td>
<td>
<table cellspacing="1" cellpadding="3">
<tr bgcolor="#BBBBBB">
<td>
<b>Source Code</b>
</td>
<td>
<ul>
<li><a href="archive/mcs-0.20.tar.gz">Mono Class Libraries and C# Compiler.</a>
<li><a href="archive/mono-0.20.tar.gz">Mono Runtime</a>
<li><a href="archive/gc6.1.tar.gz">Boehm GC 6.1</a>
<li><a href="archive/xsp-0.3.tar.gz">XSP web server (0.3)</a>
</ul>
</td>
</tr>
<tr bgcolor="#BBBBBB">
<td>
<b>Source RPMs</b><br>
(No RPMS for XSP).
</td>
<td>
<ul>
<li><a href="archive/libgc-6.1-1.src.rpm">libgc-6.1-1.src.rpm</a>
<li><a href="archive/mono-0.20-1.src.rpm">mono-0.20-1.src.rpm</a>
</ul>
</td>
</tr>
<tr>
<td></td>
</tr>
<tr>
<td bgcolor="#999999">
<b>Red Hat 8.0/x86</b>
<ul>
<li><a href="archive/redhat-80-i386/libgc-6.1-1.i386.rpm">libgc-6.1-1.i386.rpm</a>
<li><a href="archive/redhat-80-i386/libgc-devel-6.1-1.i386.rpm">libgc-devel-6.1-1.i386.rpm</a>
<li><a href="archive/redhat-80-i386/mono-0.20-1.i386.rpm">mono-0.20-1.i386.rpm</a>
<li><a href="archive/redhat-80-i386/mono-devel-0.20-1.i386.rpm">mono-devel-0.20-1.i386.rpm</a>
</ul>
</td>
<td bgcolor="#999999">
<b>Debian packages</b>
<ul>
<li><a href="http://www.atoker.com/mono/">Alp's web site</a>
</ul>
</td>
</tr>
<tr>
<td bgcolor="#999999">
<b>Windows Setup Wizard (NT/2000/XP)</b>
<ul>
<li><a href="archive/mono-0.20-stable-win32-2.exe">Mono-Setup</a>
</ul>
</td>
</tr>
</table>
</td>
</tr>
<tr>
<tr bgcolor="#CCCCC">
<td>
<b>Regression Tests</b><br>
</td>
<td>
You can get binaries for the Mono Regression Test
Suite <a href="archive/mono-tests.tar.gz">here</a>
</td>
</tr>
</tr>
</tbody>
</table>
<table>
<tbody>
<tr bgcolor="#DDDDDD">
<td>
<b>Release 0.19</b><br>
<a href="archive/mono-0.19">Release notes</a><br>
@@ -644,6 +31,9 @@
<ul>
<li><a href="archive/mcs-0.19.tar.gz">Mono Class Libraries and C# Compiler.</a>
<li><a href="archive/mono-0.19.tar.gz">Mono Runtime</a>
<li><a href="archive/gc6.1.tar.gz">Boehm GC 6.1</a>
<li><a href="archive/xsp-0.2.tar.gz">XSP web server</a> <b><font color="#dd0000">New!</font></b>
<li><a href="archive/mono-debugger-0.2.0.tar.gz">Mono Debugger 0.2.0</a> <b><font color="#dd0000">New!</font></b>
</ul>
</td>
</tr>
@@ -662,15 +52,106 @@
<tr>
<td></td>
</tr>
<tr>
<td bgcolor="#999999">
<b>Red Hat 7.3/x86</b>
<ul>
<li><a href="archive/redhat-73-i386/libgc-6.1-1.i386.rpm">libgc-6.1-1.i386.rpm</a>
<li><a href="archive/redhat-73-i386/libgc-devel-6.1-1.i386.rpm">libgc-devel-6.1-1.i386.rpm</a>
<li><a href="archive/redhat-73-i386/mono-0.19-1.i386.rpm">mono-0.19-1.i386.rpm</a>
<li><a href="archive/redhat-73-i386/mono-devel-0.19-1.i386.rpm">mono-devel-0.19-1.i386.rpm</a>
</ul>
</td>
<td bgcolor="#999999">
<b>Red Hat 7.2/x86</b>
<ul>
<li><a href="archive/redhat-72-i386/libgc-6.1-1.i386.rpm">libgc-6.1-1.i386.rpm</a>
<li><a href="archive/redhat-72-i386/libgc-devel-6.1-1.i386.rpm">libgc-devel-6.1-1.i386.rpm</a>
<li><a href="archive/redhat-72-i386/mono-0.19-1.i386.rpm">mono-0.19-1.i386.rpm</a>
<li><a href="archive/redhat-72-i386/mono-devel-0.19-1.i386.rpm">mono-devel-0.19-1.i386.rpm</a>
</ul>
</td>
</tr>
<tr>
<td bgcolor="#999999">
<b>Red Hat 7.1/x86</b>
<ul>
<li><a href="archive/redhat-71-i386/libgc-6.1-1.i386.rpm">libgc-6.1-1.i386.rpm</a>
<li><a href="archive/redhat-71-i386/libgc-devel-6.1-1.i386.rpm">libgc-devel-6.1-1.i386.rpm</a>
<li><a href="archive/redhat-71-i386/mono-0.19-1.i386.rpm">mono-0.19-1.i386.rpm</a>
<li><a href="archive/redhat-71-i386/mono-devel-0.19-1.i386.rpm">mono-devel-0.19-1.i386.rpm</a>
</ul>
</td>
<td bgcolor="#999999">
<b>Mandrake 8.2/x86</b>
<ul>
<li><a href="archive/mandrake-82-i386/libgc-6.1-1.i586.rpm">libgc-6.1-1.i586.rpm</a>
<li><a href="archive/mandrake-82-i386/libgc-devel-6.1-1.i586.rpm">libgc-devel-6.1-1.i586.rpm</a>
<li><a href="archive/mandrake-82-i386/mono-0.19-1.i586.rpm">mono-0.19-1.i586.rpm</a>
<li><a href="archive/mandrake-82-i386/mono-devel-0.19-1.i586.rpm">mono-devel-0.19-1.i586.rpm</a>
</ul>
</td>
</tr>
<tr>
<td bgcolor="#999999">
<b>SuSE 8.0/x86</b>
<ul>
<li><a href="archive/suse-80-i386/libgc-6.1-1.i386.rpm">libgc-6.1-1.i386.rpm</a>
<li><a href="archive/suse-80-i386/libgc-devel-6.1-1.i386.rpm">libgc-devel-6.1-1.i386.rpm</a>
<li><a href="archive/suse-80-i386/mono-0.19-1.i386.rpm">mono-0.19-1.i386.rpm</a>
<li><a href="archive/suse-80-i386/mono-devel-0.19-1.i386.rpm">mono-devel-0.19-1.i386.rpm</a>
</ul>
</td>
<td bgcolor="#999999">
<b>Red Hat 8.0/x86</b>
<ul>
<li><a href="archive/redhat-80-i386/libgc-6.1-1.i386.rpm">libgc-6.1-1.i386.rpm</a>
<li><a href="archive/redhat-80-i386/libgc-devel-6.1-1.i386.rpm">libgc-devel-6.1-1.i386.rpm</a>
<li><a href="archive/redhat-80-i386/mono-0.19-1.i386.rpm">mono-0.19-1.i386.rpm</a>
<li><a href="archive/redhat-80-i386/mono-devel-0.19-1.i386.rpm">mono-devel-0.19-1.i386.rpm</a>
</ul>
</td>
</tr>
<tr>
<td bgcolor="#999999">
<!-- <b>Windows Setup Wizard (NT/2000/XP)</b>␍ -->
<!-- <ul>␍ -->
<!-- <li><a href="archive/mono-0.19-stable.exe">Mono-Setup</a>␍ -->
<!-- </ul>␍ -->
<!-- </td>␍ -->
<td bgcolor="#999999">
<b>Debian packages</b>
<ul>
<li><a href="http://www.atoker.com/mono/">Alp's web site</a>
</ul>
</td>
</tr>
</table>
</td>
</tr>
<tr>
<tr bgcolor="#CCCCC">
<td>
<b>Regression Tests</b><br>
</td>
<td>
You can get binaries for the Mono Regression Test
Suite <a href="archive/mono-tests.tar.gz">here</a>
</td>
</tr>
</tr>
</tbody>
</table>
<br>
* Older Releases:
We provide binaries for older releases until we have packages for the new release.
<table>
<tbody>
<tr bgcolor="#DDDDDD">
<tr bgcolor="#DDDDDD">
<td>
<b>Release 0.18</b><br>
<a href="archive/mono-0.18">Release notes</a><br>
@@ -714,7 +195,7 @@
<table>
<tbody>
<tr bgcolor="#DDDDDD">
<tr bgcolor="#DDDDDD">
<td>
<b>Release 0.17</b><br>
<a href="archive/mono-0.17">Release notes</a><br>
@@ -769,7 +250,7 @@
<table>
<tbody>
<tr bgcolor="#DDDDDD">
<tr bgcolor="#DDDDDD">
<td>
<b>Release 0.16</b><br>
<a href="archive/mono-0.16">Release notes</a><br>
@@ -806,7 +287,7 @@
<tr>
<td bgcolor="#999999">
<b>Linux s390</b>
<ul>
<ul>
<li><a href="archive/s390/glib2-2.0.6-13.s390.rpm">glib2-2.0.6-13.s390.rpm</a>
<li><a href="archive/s390/glib2-devel-2.0.6-13.s390.rpm">glib2-devel-2.0.6-13.s390.rpm</a>
<li><a href="archive/s390/libgc-6.1alpha5-1.s390.rpm">libgc-6.1alpha5-1.s390.rpm</a>
@@ -827,7 +308,7 @@
<table>
<tbody>
<tr bgcolor="#DDDDDD">
<tr bgcolor="#DDDDDD">
<td>
<b>Release 0.15</b><br>
<a href="archive/mono-0.15">Release notes</a><br>
@@ -871,7 +352,7 @@
</td>
<td bgcolor="#999999">
<b>Red Hat null-8.0/x86</b>
<ul>
<ul>
<li><a href="archive/redhat-null-i386/libgc-6.1alpha5-1.i386.rpm">libgc-6.1alpha5-1.i386.rpm</a>
<li><a href="archive/redhat-null-i386/libgc-devel-6.1alpha5-1.i386.rpm">libgc-devel-6.1alpha5-1.i386.rpm</a>
<li><a href="archive/redhat-null-i386/mono-0.15-1.i386.rpm">mono-0.15-1.i386.rpm</a>
@@ -885,7 +366,7 @@
</tbody>
</table>
* Binaries for other platforms.
** Binaries for other platforms.
Already daily volunteer's made binaries:
@@ -1030,7 +511,7 @@
<pre>
make
</pre>
</ul>
</ul>
*** On Windows, to compile the mono runtime:
@@ -1096,8 +577,8 @@
`make maintainer-clean' after the update).
* Download, compile and install <a href="http://www.freedesktop.org/software/pkgconfig">pkg-config</a> from source.
(I had to change line 674 of
<nobr><tt>pkg-config-0.8.0/glib-1.2.8/gstrfuncs.c</tt></nobr> from
(I had to change line 674 of
<nobr><tt>pkg-config-0.8.0/glib-1.2.8/gstrfuncs.c</tt></nobr> from
<nobr><tt>extern char *strsignal (int sig);</tt></nobr> to
<nobr><tt>extern const char *strsignal (int sig);</tt></nobr>.
@@ -1115,7 +596,7 @@ make install
href="http://www.gimp.org/win32/libiconv-dev-20001007.zip">
http://www.gimp.org/win32/libiconv-dev-20001007.zip</a>.
* Download, compile and install the
<a href="ftp://ftp.gtk.org/pub/gtk/v2.0/glib-2.0.6.tar.gz">
glib 2.0</a> from source.
+1 -10
View File
@@ -107,7 +107,7 @@
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 &lt;gc/gc.h&gt; file.
include the <gc/gc.h> file.
* Exposing C code to the CIL universe
@@ -273,15 +273,6 @@
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
+65 -252
View File
@@ -4,7 +4,6 @@
<a href="#gui">Building GUI applications with Mono</a><br>
<a href="#msft">Mono and Microsoft</a><br>
<a href="#platforms">Mono platforms</a><br>
<a href="#compatibility">Compatibility</a></br>
<a href="#pnpproject">Mono and the Portable.NET Project</a><br>
<a href="#webservices">Web Services</a><br>
<a href="#asp">Mono and ASP.NET</a><br>
@@ -272,30 +271,6 @@ A: Gtk# is a set of bindings for the Gtk+ toolkit for C# (and other
CIL-enabled languages). System.Windows.Forms is an API defined
by Microsoft to build GUI applications.
Q: Why not implement System.Windows.Forms on top of Gtk# or Qt#?
A: There are several reasons for this.
First of all, Gtk+ and Qt are standard toolkits on Linux, and their
proponents want to use their favorite toolkits when writing
applications.
Related to this is the idea that System.Windows.Forms is
brain-dead in certain areas, such as internationalization.
System.Windows.Forms uses explicit sizes for all controls, as opposed
to Gtk+ and Qt which use a box/packing model, which can better deal with
the different string lengths different languages will have.
Next is compatibility. It is not possible to implement
System.Windows.Forms on top of Gtk+/Qt and have 100% compatibility,
because System.Windows.Forms exposes some Win32-isms, such as the
Win32 message loop. In order to maintain compatibility, Wine must be used,
and this is being done; see the
<a href="/winforms.html">System.Windows.Forms effort page</a>.
Additionally, Wine apps don't currently fit in -- visually -- with
Gtk+ or Qt apps.
Q: Will I be able to run my smart clients on systems powered by Mono?
A: As long as your applications are 100% .NET and do not make use
@@ -490,44 +465,6 @@ A: Mono requires Unicode versions of Win32 APIs to run,
Win32 libs. This is achieved by inserting -lunimono before
-lkerner32/user32 in the linker's specs file.
<a name="compatibility"></a>
** Compatibility
Q: Can Mono run applications developed with the Microsoft.NET fraemwork?
A: Yes, Mono can run applications developed with the Microsft .NET Framework
on Unix. There are a few caveats to keep in mind: Mono has not
been completed yet, so a few API calls might be missing; And in
some cases the Mono behavior *might* be incorrect.
Q: Will missing API entry points be implemented?
A: Yes, the goal of Mono is to implement precisely the .NET Framework
API (as well as compile-time selectable subsets, for those
interested in a lighter version of Mono).
Q: If the behavior of an API call is different, will you fix it?
A: Yes, we will. But we will need your assistance for this. If you find a bug
in the Mono implementation, please fill a bug report in <a
href="http://bugzilla.ximian.com">http://bugzilla.ximian.com</a>.
Do not assume we know about the problem, we might not, and using the bug tracking
system helps us organize the development process.
Q: Can I develop my applications on Windows, and deploy on a supported
Mono platform (like Linux)?
A: Yes, you can.
As of today, Mono is not 100% finished, so it is sometimes useful
to compile the code with Mono, to find out if your application
depends on unimplemented functionality.
Q: Will applications run out the box with Mono?
A: Sometimes they will. But sometimes a .NET application might invoke
Win32 API calls, or assume certain patterns that are not correct
for cross-platform applications.
<a name="pnpproject"></a>
** Mono and Portable.NET
@@ -540,22 +477,8 @@ A: Most of Mono is being written using C#, with only
It is easier to describe what is unique about Mono:
<ul>
<li> An advanced native-code compilation engine: Both
just-in-time compilation (JIT) and pre-compilation of CIL
bytecodes into native code are supported.
<li> A foundation for code optimization: The new code generator in
Mono builds on the experience of our first JIT engine, and enables
us to implement various advanced compiler optimization
tricks. With an SSA-framework, plenty of new optimizations are possible.
The current list of optimizations are: Peephole postpass,
Branch optimizations, Inline method calls, Constant folding, Constant
propagation, Copy propagation, Dead code elimination, Linear scan
global reg allocation, Conditional moves, Emit per-domain code,
Instruction scheduling, Intrinsic method implementations, Tail
recursion and tail calls, Loop related optimizations, Fast x86 FP
compares, Leaf procedures optimizations
<li> A Just-in-Time compiler engine. This is important for
making your applications fast.
<li> A self-hosting C# compiler written in C#, which is clean, easy
to maintain.
@@ -569,43 +492,38 @@ A: Most of Mono is being written using C#, with only
systems, while the interpreter works on SPARC, StrongARM,
s390 and PowerPC systems.
Our new compilation engine is being ported to the PowerPC.
<li> Supports Linux, BSD, Windows and Solaris at this point.
<li> Supports Linux, Windows and Solaris at this point.
<li> The JIT engine is written using a portable instruction
selector which not only generates good code but
selector which not only generates good code (we are told
that we are faster than Rotor, but it is hard to tell) but
is also the foundation to re-target the JIT engine to other
systems.
<li> Full support for remoting in the runtime.
The system employed is described in various compiler
books and it is very similar to what is described in the
book that covers LCC, the ANSI C retargetable C compiler.
<li> The JIT engine supports in-lining, constant folding and propagation,
<li> Full support for remoting in the runtime, but the class
libraries are still behind.
<li> The C# compiler, the JIT engine and the class libraries are
mature enough that the whole system has been self-hosting
since April 2002. This means that we develop Mono
completely with itself at this point.
mature enough that the whole system is self-hosting. This means that
we develop Mono completely with itself at this point.
By forcing ourselves to use our own code to develop our
tools, we bug fix problems rapidly, and the system is
overall more robust and tested than if we did not.
<li> We are not yet done, and there is a lot of work left to be
done
<li> We have a great community of developers, without which Mono
would not be possible.
<li> We are working on an ahead of time compilation mode to
pre-compile code for the target architecture (this is part
of our new code generation effort).
</ul>
In general, Mono is more mature and complete since it has been used
to develop itself, which is a big motivator for stability and
correctness, while Portable.NET remains pretty much an untested
platform.
Q: I hear Mono keeps changing the P/Invoke API, why?
A: We are just fixing our implementation to be compatible with the
Microsoft implementation. In other words, the Mono P/Invoke API is
more complete when compared to the Portable.NET version, hence
various pieces of software that depend on this extended
functionality fail to work properly with Portable.NET.
<a name="webservices"></a>
** Web Services
@@ -643,11 +561,10 @@ A: Yes. The CLI contains enough information about a class that
exposing it to other RPC systems (like CORBA) is really simple, and
does not even require support from an object.
<a href="http://remoting-corba.sourceforge.net/">Remoting.CORBA</a> is
a CORBA implementation that is gaining momentum.
Building an implementation of the Bonobo interfaces once this is ready
should be relatively simple.
We will be implementing CORBA inter-operation as an extension to the
Mono classes so that we can integrate with Bonobo, just like
Microsoft provides COM inter-operation classes and support
mechanisms.
Q: Can I serialize my objects to other things other than XML?
@@ -656,49 +573,21 @@ A: Yes, although the serializing tools have not yet been planned, and
Q: Will Mono use ORBit?
A: There are a few advantages in using ORBit, like reusing existing code
and leveraging all the work done on it. Michael Meeks has posted
a few <a href="http://lists.ximian.com/archives/public/mono-list/2002-September/008592.html">reasons</a>,
as well as some <a href="http://lists.ximian.com/archives/public/mono-list/2002-September/008657.html">ideas</a>
that could be used to reuse ORBit.
Most users are likely to choose a native .NET solution, like <a href="http://cvs.gnome.org/bonsai">Remoting.CORBA</a>
A: No. Mono will be using a new implementation of CORBA that isn't still started.
<a name="monodoc"></a>
** MonoDoc
Q: What is MonoDoc?
A: MonoDoc is a graphical documentation browser for the Mono class
libraries. Currently, monodoc consists of a Gtk# application and is
in heavy development.
A: MonoDoc is a graphical documentation editor and viewer. Currently, MonoDoc
consists of a Gtk# application and is in heavy development. There is also a
Qt# version of it.
<a name="devel"></a>
** Development Tools and Issues
Q: I am having trouble compiling a new version of Mono from CVS, it
complains about my runtime being out of sync.
A: Jonathan Pryor has provided the following answer:
To upgrade your class libraries and compiler, see the See
README.building in the MCS directory.
The single biggest source of confusion seems to be the "Your
runtime is out of sync" messages. Realize that this is *normal*
while BUILDING. Think about it: you're building a new class
library with the old runtime. If the new class library references
a function that the old runtime knows nothing about, the runtime
system issues this warning.
Basically what needs to happen is for a new mono runtime to be
compiled, then the corlib class library be compiled, and once this
is done, install the new runtime, followed by corlib.
Once this is done, you can continue building your entire
environment.
Q: Will it be possible to use the CLI features without using byte codes
or the JIT?
@@ -829,66 +718,29 @@ A: Replace the __stdcall attribute with the STDCALL macro, and include this
#define STDCALL __attribute__((stdcall))
#endif
Q: I want to be able to execute Mono binaries, without having to use the "mono"
command. How can I do this?
A: From Carlos Perelló:
<i>I think that the best solution is the binfmt feature with the
wrapper that exists with Debian packages at:
<a href="http://www.debianplanet.org/mono/dists/unstable/main/source/admin/">http://www.debianplanet.org/mono/dists/unstable/main/source/admin/</a>
If you want use it with Big endian machines, you should apply a patch
(<a href="http://carlos.pemas.net/debian/mono/binfmt-detector-cli.c.diff">http://carlos.pemas.net/debian/mono/binfmt-detector-cli.c.diff</a>)
It works really good and lets you use wine also, it reads the .exe file
headers and check if it's a .net executable.
This way you just execute: ./my-cool-mono-application.exe and it works
without the need of any wrapper.</i>
<a name="asp">
** Mono and ASP.NET
Q: Does Mono support ASP.NET?
Q: Is Mono supporting ASP.NET?
A: Yes.
Mono supports ASP.NET, we have shown an unmodified IBuySpy
installation running on Mono as well as various other programs. You can
try it yourself downloading the XSP server.
A: Yes. The development of the support for ASP.NET comes in various stages,
here is what Gonzalo has been working on: 1. The Parser. 2. Getting the
parser to generate output compatible with ASP.NET. 3. Running the sample
output with the real Microsoft runtime but using our generated page. 4.
Running the sample with our classes with the .NET runtime. 5. Running
our sample code with our classes with our runtime. This is the process
we are following. Currently Gonzalo has reached point 5.
Q: Do I need install cygwin to work on ASP.NET in mono or Linux is enough since
it is self host right now.
A: Linux is enough.
Q: How can I run ASP.NET-based applications with Mono?
A: You need the Mono runtime and a hosting web server. Currently we distribute a
small web server called `xsp' which is used to debug applications, or you can choose
to use Daniel's Apache 2 module.
Q: Any plan to make ASP.NET in mono works with Apache in Linux?.
A: Daniel has authored an Apache2 Module for Mono that hosts the ASP.NET runtime
and is available here: <a
href="http://apacheworld.org/modmono/">http://apacheworld.org/modmono/</a>
Q: Will you support Apache 1?
A: Modules developed for Apache 2 are not compatible with Apache 1.3
Daniel plans to support Apache 1.3 in the future but the current focus is on
Apache 2, because of the better support for threading and Windows.
Q: Can I run Apache 1 and Apache 2 on the same machine?
You can always keep a copy of Apache 2 running in paralell with your Apache
1.3 (either different port or using a reverse proxy).
You can also bind the two servers to different IP addresses on the
same physical machine.
A: Yes, we have plans to do so, but we need to wait for Patrik's patches to
HttpRuntime. Once that is there, writing a mod_mono should be trivial
(look at mono/samples/embed for a sample embedded application).
<a name="ado">
** Mono and ADO.NET
@@ -941,12 +793,12 @@ A: You can get very good tools for doing Java development on free
Q: Could Java target the CLI?
A: Yes, Java could target the CLI, Microsoft's J# compiler does that.
A: Yes, Java could target the CLI. We have details on a <a
href="ideas.html#guavac">project</a> that someone could take on to
make this happen.
The <a href="http://weblog.ikvm.net/">IKVM</a> project builds a
Java runtime that works on top of .NET and on top of Mono. IKVM is
essentially a JIT compiler that translates from JVM bytecodes into
CIL instructions, and then lets the native JIT engine take over.
Microsoft has an implementation of the Java language called J# that
can target the CIL execution engine.
Q: Is it possible to write a JVM byte code to CIL converter?
@@ -968,8 +820,6 @@ A: Yes, it is possible. Here are a few starting point:
be translated into the equivalent "meaning" in CLR-land.
</ul>
See also the <a href="http://weblog.ikvm.net/">IKVM project</a>
Q: Could mono become a hybrid CIL/java platform?
A: No. It is quite far from the philosophy of the project. The idea of Mono
@@ -984,8 +834,9 @@ A: No. It is quite far from the philosophy of the project. The idea of Mono
Q: Do you plan to implement a Javascript compiler?
A: Yes. The beginnings of the JScript compiler can be found on CVS.
Cesar coordinates this effort.
A: Yes. Eto Demerzal has started a Rhino port to C#.
After this is completed, we will begin developing
the JavaScript compiler.
Q: Can Mono or .NET share system classes (loaded from mscore.dll and other
libs) or will it behave like Sun's Java VM?
@@ -1027,13 +878,10 @@ A: Embracing a good technology is good. Extending technologies in
encourage you to make those classes operate correctly well in both
Mono and .NET.
Today Mono ships with a number of extra libraries that were
developed either by members of the Mono community, or other
groups.
Q: Is there any way I can develop the class libraries using Linux yet?
A: Yes. Mono has been selfhosting since March 2002.
A: Yes. Some class libraries can be developed on Linux. Search for
Paolo's post (he lists which classes can be compiled fine now).
Q: Is there any way I can install a known working copy of mono in /usr,
and an experimental copy somewhere else, and have both copies use
@@ -1265,61 +1113,27 @@ Q: Could patents be used to completely disable Mono (either submarine
patents filed now, or changes made by Microsoft specifically to
create patent problems)?
A: First some background information.
A: No. First, its basic functional capabilities have pre-existed too
long to be held up by patents. The basic components of Mono are
technologically equivalent to Sun's Java technology, which has been
around for years.
The .NET Framework is divided in two parts: the ECMA/ISO covered
technologies and the other technologies developed on top of it like
ADO.NET, ASP.NET and Windows.Forms.
Mono will also implement multi-language and
multi-architecture support, but there are previous technologies
such as UCSD p-code and ANDF that also support multiple languages
using a common intermediate language. The libraries are similar
to other language's libraries, so again, they're too similar to
be patentable in large measure.
Mono implements the ECMA/ISO covered parts, as well as being a
project that aims to implement the higher level blocks like
ASP.NET, ADO.NET and Windows.Forms.
The Mono project has gone beyond both of those components and has
developed and integrated third party class libraries, the most
important being: Debugging APIs, integration with the Gnome
platform (Accessibility, Pango rendering, Gdk/Gtk, Glade, GnomeUI),
Mozilla, OpenGL, extensive database support (Microsoft only
supports a couple of providers out of the box, while Mono has
support for 11 different providers), our POSIX integration
libraries and finally the embedded API (used to add scripting to
applications and host the CLI, or for example as an embedded
runtime in Apache).
The core of the .NET Framework, and what has been patented by
Microsoft falls under the ECMA/ISO submission. Jim Miller at
Microsoft has made a statement on the patents covering ISO/ECMA,
(he is one of the inventors listed in the patent): <a
href="https://mailserver.di.unipi.it/pipermail/dotnet-sscli/msg00218.html">here</a>.
Basically a grant is given to anyone who want to implement those
components for free and for any purpose.
The controversial elements are the ASP.NET, ADO.NET and
Windows.Forms subsets. Those are convenient for people who need
full compatibility with the Windows platform, but are not required
for the open source Mono platform, nor integration with today's
Mono's rich support of Linux.
The Mono strategy for dealing with these technologies is as
follows: (1) work around the patent by using a different
implementation techinque that retains the API, but changes the
mechanism; if that is not possible, we would (2) remove the pieces
of code that were covered by those patents, and also (3) find prior
art that would render the patent useless.
However, if Microsoft does patent some technology, then our plan is
to either (1) work around it, (2) chop out patented pieces, (3)
find prior art that would render the patent useless.
Not providing a patented capability would weaken the
interoperability, but it would still provide the free software /
open source software community with good development tools, which
is the primary reason for developing Mono.
The patents do not apply in countries where software patents are
not allowed.
For Linux server and desktop development, we only need the ECMA
components, and things that we have developed (like Gtk#) or Apache
integration.
<a name="etc"></a>
** Miscellaneous Questions
@@ -1406,8 +1220,7 @@ A: There are several but one that is free software and uses MCS is the one
Q: Is it possible to use Visual C++ with Mono?.
A: It's possible to run VC++ generated apps under Mono, but we do not
provide a Manager C++ compiler ourselves.
A: Well, It's possible to run VC++ generated apps under Mono though.
<a name="problems"></a>
** Mono Common Problems
+3 -11
View File
@@ -6,17 +6,10 @@
libraries that are part of the
<a href="http://www.gnome.org">GNOME</a> platform .
* Wiki
There is a <a
href="http://www.nullenvoid.com/gtksharp/wiki/index.php/">Gtk#
Wiki</a>. You are encouraged to contribute to it.
** API of Gtk#
The Gtk# API is documented using the ECMA XML document format, you can read
more about it <a href="documentation.html">here</a>. You can
also use the MonoDoc tool that ships with Gtk# documentation.
The API is browsable
<a href="http://primates.ximian.com/~tvgm/gtk-sharp-docs/">here</a>
** Where to learn more.
@@ -43,8 +36,7 @@
** GTK# On Windows
<p>Look at our Wiki for installation instructions <a href="http://www.nullenvoid.com/gtksharp/wiki/index.php/InstallingBeginnersGuide">here</a>
<p>There is a Windows Installer for GTK# <a href="http://www.sport-huettn.de/mono/gtk-sharp-0.6-stable-2.exe">here</a>.
<p>If you want to build GTK# yourself on Windows:
-8
View File
@@ -13,14 +13,6 @@ Some of them may start contributing because they want a mention in the
* Mono Hackers
** Zoltan Varga
Zoltan has contributed significantly to Mono, with bug reports and bug
fixes as well as pushing the envelope of the things that can be done in
and with the mono runtime: the gcc-based ngen compiler, code coverage
and more recently his work with Reflection.Emit that got mono to the
point of running the IKVM Java virtual machine.
** Sergey Chaban
Sergey has been a long time contributor to the project, from the early
+12 -2
View File
@@ -56,7 +56,6 @@ TODO=multimedia
<a name="projects">
** Projects
This list of projects ideas is outdated
TODO=guavac,Java compiler for .NET
* You could take one of the existing Java compilers
@@ -69,8 +68,19 @@ TODO=guavac,Java compiler for .NET
it could be compiled with the Microsoft Managed C++
compiler and produce a .NET executable with it.
TODO=CORBA,CORBA implementation
* Build a CORBA interoperability engine for the CLR.
You do not need to do all of the work, just talking
the protocol will get us a long way (<a
href="http://www.omg.org">The OMG site</a> has the
CORBA specs).
Get in touch with David Taylor (dtaylo11 at bigpond
dot net dot au) as he has been working on this
project.
TODO=Bonobo,Bonobo for Mono
* Once <a href="http://remoting-corba.sourceforge.net/">CORBA</a> is done, implement the Bonobo interfaces
* Once CORBA is done, implement the Bonobo interfaces
to allow people to use Bonobo components in Mono and
Mono components with Bonobo. The best of both worlds!
+1517 -328
View File
File diff suppressed because it is too large. Load diff
-11
View File
@@ -30,7 +30,6 @@
<ul>
* <a href="#Tachy">Tachy</a> (scheme-like)
* <a href="#python">Python</a>
</ul>
<a name="Java">
@@ -104,16 +103,6 @@
A subset of Scheme language called <a
href="http://radio.weblogs.com/0101156/stories/2002/03/19/tachy.html">Tachy</a>
<a name="Python">
** Python
<a href="mailto:[email protected]">Brian Lloyd</a> is
working on linking the Python runtime with the .NET runtime.
More information on the PS.NET project can be found <a
href="http://www.zope.org/Members/Brian/PythonNet/index_html">here</a>.
An FAQ document is available <a
href="http://www.zope.org/Members/Brian/PythonNet/FAQ.html">here</a>.
* Missing languages
Here is a list of a few languages that we would like to see
+7 -53
View File
@@ -2,20 +2,11 @@
Most of the mailing lists are in english, but there is also
Mono Hispano that has lists in Spanish. <a
href="http://www.monohispano.org/mailman/listinfo/mono-hispano">Mono Hispano list</a>
href="http://mono.es.gnome.org/mailman/listinfo/mono-hispano">Mono Hispano list</a>
There are a number of mailing lists for Mono in English:
<table border=1>
<tr>
<td>
<b><a
href="http://lists.ximian.com/mailman/listinfo/mono-announce-list">mono-announce-list</a></b>
</td>
<td>
Announcements of Mono developments.
</td>
</tr>
<table>
<tr>
<td>
<b><a
@@ -28,39 +19,11 @@
<tr>
<td>
<b><a
href="http://lists.ximian.com/mailman/listinfo/mono-devel-list">mono-devel-list</a></b>
</td>
<td>
A mailing list specifically dedicated to discussions
about developing Mono and programming *with* Mono.
Programmers that work on Mono are _strongly_ encouraged
to join this list. Third-party programmers interested
in running or compiling their managed applications with
Mono or that are interested in using mono-specific
technologies should join the list as well.
<p>
Examples of on-topic arguments are:
<ul>
<li>proposals and patches for new features for the mono runtime and programs
<li>discussions about bugs in the mono runtime and programs
<li>discussions about future directions
<li>embedding API, scripting language bridges
<li>mono/mcs build issues
<li>programming with mono-specific assemblies
<li>discussions about third-party compilers that target and/or use directly the CLR
<li>discussions about getting a managed application run with mono
</ul>
<p>Topics that are better discussed on other mailing lists:
<ul>
<li> general C# questions (use the specific lists at develop.com)
<li> issues that are already covered by a more specific mono
mailing list (like System.Windows.Forms or Gtk#)
<li> success reports about new apps running on mono, including
runtime/buildtime support for new programming languages (use
mono-list to reach a wider audience)
</ul>
href="http://lists.ximian.com/mailman/listinfo/mono-announce-list">mono-announce-list</a></b>
</td>
<td>
Announcements of Mono developments.
</td>
</tr>
<tr>
<td>
@@ -77,7 +40,7 @@
href="http://lists.ximian.com/mailman/listinfo/mono-patches">mono-patches</a></b>
</td>
<td>
Track the CVS activity of Mono on this mailing list (patches are sent to recipients). <p>
Track the CVS activity of Mono on this mailing list (patches are sent to recipients).
You can get <a href="http://www.go-mono.com/snapshots">daily snapshots</a> as well.
</td>
</tr>
@@ -117,15 +80,6 @@
Used to discuss the Windows.Forms implementatation for Mono using Wine.
</td>
</tr>
<tr>
<td>
<b><a
href="http://lists.ximian.com/mailman/listinfo/gtk-sharp-list">gtk-sharp-list</a></b>
</td>
<td>
Used to discuss the Gtk bindings for Mono (<a href="http://gtk-sharp.sf.net">Gtk#</a>).
</td>
</tr>
</table>
Other mailing lists of interest:
+17 -27
View File
@@ -155,37 +155,27 @@ export PKG_CONFIG_PATH
# /usr/local/include and /usr/local/lib to CPPFLAGS and LDFLAGS. We could
# skip this if it would add /usr/include and /usr/lib, but leaving it
# shouldnt break anything.
#
# Actually, it does break stuff :-( gcc 3.2 prints gratuitous warnings
# and configure fails to find header files because of this cpp output.
if [ ! -f /usr/include/iconv.h ]; then
iconvdirs="/usr/local/include"
for i in $iconvdirs
do
if [ -f $i/iconv.h ]; then
iconvh_dir=$i
break
fi
done
if [ -z "$iconvh_dir" ]; then
echo "Can't find iconv headers (looked in $iconvdirs)"
exit -1
iconvdirs="/usr/include /usr/local/include"
for i in $iconvdirs
do
if [ -f $i/iconv.h ]; then
iconvh_dir=$i
break
fi
done
iconvlib_dir=`echo $iconvh_dir | sed -e 's/include/lib/'`
echo "Adding $iconvh_dir to CPPFLAGS"
echo "Adding $iconvlib_dir to LDFLAGS"
CPPFLAGS="$CPPFLAGS -I$here/install/include -I$iconvh_dir"
LDFLAGS="$LDFLAGS -L$here/install/lib -L$iconvlib_dir"
else
CPPFLAGS="$CPPFLAGS -I$here/install/include"
LDFLAGS="$LDFLAGS -L$here/install/lib"
if [ -z "$iconvh_dir" ]; then
echo "Can't find iconv headers (looked in $iconvdirs)"
exit -1
fi
iconvlib_dir=`echo $iconvh_dir | sed -e 's/include/lib/'`
echo "Adding $iconvh_dir to CPPFLAGS"
echo "Adding $iconvlib_dir to LDFLAGS"
CPPFLAGS="$CPPFLAGS -I$here/install/include -I$iconvh_dir"
LDFLAGS="$LDFLAGS -L$here/install/lib -L$iconvlib_dir"
export CPPFLAGS
export LDFLAGS
+2 -2
View File
@@ -190,8 +190,8 @@
dbcmd.CommandText = sql;
IDataReader reader = dbcmd.ExecuteReader();
while(reader.Read()) {
string FirstName = (string) reader["firstname"];
string LastName = (string) reader["lastname"];
string FirstName = reader["firstname"];
string LastName = reader["lastname"];
Console.WriteLine("Name: " +
FirstName + " " + LastName);
}
-1507
View File
File diff suppressed because it is too large. Load diff
+2 -2
View File
@@ -2,7 +2,7 @@
<ul>
<li><a href="http://www.monohispano.org">Mono
<li><a href="http://mono.es.gnome.org">Mono
Hispano</a>: The spanish-speaking community of Mono
developers and users. They have quite a number of
unique documents and tutorials.
@@ -31,4 +31,4 @@
</ul>
-15
View File
@@ -1,15 +0,0 @@
#!/bin/sh
MANAGED_CALLS=`gdb -silent $1 -pid $2 << EOF | awk '/.* in \?\? \(\)/ {printf("call print_method_from_ip(%s)\n", $2);}'
set height 0
thread apply all bt
quit
EOF`
gdb -silent $1 -pid $2 << EOF
set height 0
thread apply all bt
$MANAGED_CALLS
quit
EOF
+7 -33
View File
@@ -18,7 +18,7 @@
standard GNOME interfaces for easily creating reusable,
language independent components, controls and compound
documents. This technology is known as <a
href="http://developer.ximian.com/articles/whitepapers/bonobo">Bonobo</a>.
href="http://developer.ximian.com/tech/bonobo.html">Bonobo</a>.
Interfaces to Bonobo exist for C, Perl, Python, and
Java.
@@ -134,51 +134,25 @@
** What makes up Mono?
There are various pieces that make up Mono today:
There are various pieces that will make up Mono:
<ul>
* A C# compiler.
* The Virtual Execution System: that has the
* The Virtual Execution System: that will have the
Just-in-Time compiler, garbage collector, loader,
threading engine.
A byte code interpreter is provided for quickly
A byte code interpreter will be provided for quickly
porting Mono to new systems and debugging the JIT
purposes, but it is not intended to be the ideal
execution environment.
* An implemenation of the .NET class libraries:
Remoting, Reflection, Reflection.Emit, Xml, Xpath,
Xslt, Xml Serialization, Web Services support.
* An implemenation of the .NET class library.
* Cross platform class libraries for data access:
Postgress, MySQL, DB2, TDS, Sybase, Oracle, ODBC and
Gnome's GDA.
* Visual development tools.
* Unix class libraries: Mono.Posix
* Gnome-specific class libraries: The Gtk# family.
* A code pre-compiler to generate native code ahead of
time.
* Gtk# a toolkit to develop GNOME applications on Unix
and Windows.
* An implementation of the Remoting infrastructure in
.NET
</ul>
Other work-in-progress components:
<ul>
* A VB.NET compiler and JScript compilers are in the works.
* Web services on the server side.
* We are planning to include Remoting.CORBA as part of
Mono standard distribution.
* A CIL GCC frontend.
</ul>
** Why use GNOME components?
+2 -15
View File
@@ -28,16 +28,11 @@
The Mono Tutorial:
<a href="http://go-mono.com/tutorial/">GNOME.NET Tutorial</a>
<a href="http://http://go-mono.com/gnometutorial/">GNOME.NET Tutorial</a>
and other useful tutorials (Gtk#, Glade#, Embeded, etc) (in Spanish) at
<a href="http://www.monohispano.org">The Mono Hispano site</a>.
Community site for Mono at <a href="http://www.gotmono.com">Got Mono</a>
Wikis: <a href="http://www.nullenvoid.com/gtksharp/wiki">Gtk# Wiki</a>
and <a href="http://www.nullenvoid.com/mono/wiki">Mono Wiki</a>.
<a href="http://mono.es.gnome.org">The Mono Hispano site</a>.
Sergey's web page on Mono resources:
@@ -47,10 +42,6 @@
<a href="http://www.gotdotnet.com">Got Dot Net</a>
Got Mono:
<a href="http://www.gotmono.com">Got Mono</a>
MonoMail:
<a href="http://sourceforge.net/projects/monomail/">http://sourceforge.net/projects/monomail/</a>
@@ -145,10 +136,6 @@
href="http://xmarks.sourceforge.net/doc.html">XMarks DOC.NET:</a> For
creating online documentation you can browse for your own classes.
* <a
href="http://www.cl.cam.ac.uk/~jds31/research/gccnet/">GCC .NET backend</a>.
Jeremy Singer has developed a .NET backend for GCC. This is research work.
</ul>
<li><b>Class Libraries</b></li>
+20 -14
View File
@@ -1,10 +1,9 @@
* The Mono runtime
The Mono runtime engine is considered feature complete.
It implements a Just-in-Time compiler engine for the CIL
virtual machine, the class loader, the garbage collector,
threading system and metadata access libraries.
The Mono runtime implements a JIT engine for the CIL virtual
machine (as well as a byte code interpreter, this is to
quickly port it to new systems), the class loader, the garbage
collector, threading system and metadata access libraries.
We currently have two runtimes:
@@ -17,7 +16,8 @@
easy-to-port runtime engine.
</ul>
We are using the Boehm conservative garbage collector.
Currently we are using the Bohem conservative garbage
collector.
The Mono runtime can be used as a stand-alone process, or it
can be <a href="embedded-api">embedded into applications</a> (see
@@ -31,7 +31,7 @@
href="http://primates.ximian.com/~lupus/slides/jit/">slides
here</a>
** Current JIT Engine: technical details (<b>updated, July 8th, 2002</b>)
** Current JIT Engine (<b>updated, July 8th, 2002</b>)
The JIT engine uses a code-generator generator approach for
compilation. Given the properties of CIL byte codes, we can
@@ -84,11 +84,18 @@
** Garbage Collection
We are using the Boehm conservative GC. We might consider
adopting other GC engines in the future, like the Intel ORP GC
engine. The Intel ORP GC engine as it provides a precise
Currently we are using the Boehm conservative GC. Although our plans
are to move to the Intel ORP GC engine, our plans on a next generation
dual-JIT engine have to be taken into account.
We will be using the Intel ORP GC engine as it provides a precise
garbage collector engine, similar to what is available on the
.NET environment.
.NET environment.
Although using a conservative garbage collector like Bohem's
would work, all the type information is available at runtime,
so we can actually implement a better collector than a
conservative collector.
<ul>
* Garbage collection list and FAQ:<br>
@@ -112,7 +119,7 @@
The ECMA runtime and the .NET runtime assume an IO model and a
threading model that is very similar to the Win32 API.
Dick Porter has developed WAPI: the Mono abstraction layer
Dick Porter has been working on the Mono abstraction layer
that allows our runtime to execute code that depend on this
behaviour.
@@ -141,8 +148,7 @@
as well as talking to system libraries.
Initially we used libffi, but it was fairly slow, so we have
reused parts of the JIT work to create efficient PInvoke
trampolines.
reused parts of the JIT work to create efficient PInvoke trampolines.
** Remoting
+2 -57
View File
@@ -51,14 +51,6 @@
</tr>
</table>
** Eclipse running with Mono
Zoltan Varga made the Java VM for .NET <a
href="http://www.ikvm.net">IKVM</a> run <a
href="http://www.eclipse.org">Eclipse</a>, the IBM Open Source IDE.
<a href="images/ikvm-screenshot.png"><img src="images/ikvm-screenshot-thumb.png"></a>
** Mono Basic
The Mono Basic compiler ships with the Mono distribution.
@@ -127,7 +119,7 @@
<table border=1>
<tr>
<td>
<img src="http://go-mono.com/images/sqlsharp.png">
<img src="http://go-mono.com/images/sqlsharp.png"></a>
</td>
</tr>
<tr>
@@ -142,55 +134,8 @@
<table border=1>
<tr>
<td>
<img src="http://go-mono.com/images/skynet.png">
<img src="http://go-mono.com/images/skynet.png"></a>
</td>
</tr>
</table>
** Windows.Forms
Windows.Forms running with Wine on Linux:
<table border=1>
<tr>
<td>
<a href="http://go-mono.com/images/WINESWF.JPG"><img src="http://go-mono.com/images/WINESWF-thumb.JPG"></a>
</td>
</tr>
</table>
** Mono running on the iPaq
<table border=1>
<tr>
<td>
<img src="images/familiar-mint-hello.png">
</td>
</tr>
</table>
** Mono Certificate Viewer
<table border=1>
<tr>
<td>
<img src="images/swf-certview.png">
</td>
</tr>
<tr>
<td>
running on Windows using SWF
</td>
</tr>
<tr>
<td>
<img src="images/gtk-certview.png">
</td>
</tr>
<tr>
<td>
running on Linux (RH9) using GTK#
</td>
</tr>
</table>
+2
View File
@@ -0,0 +1,2 @@
* The MonoNet Team
+49 -10
View File
@@ -24,7 +24,7 @@
<b>mcs/class/doc/TemplateTest.cs</b>
Save a copy of this file in the appropriate test subdirecty
(see below), and replace all the {text} markers with
(see below), and replace all the [text] markers with
appropriate code. Comments in the template are there to guide
you. You should also look at existing tests to see how other
people have written them.
@@ -41,22 +41,29 @@
the appropriate sub-directory under Test for the class you are
testing.
Once your test class is complete, you need to add it to the
AllTests.cs file in the same directory as your new test. Add a
call to "suite.AddTest()" passing the name of your new test
class's suite property as the parameter. You will see
examples in the AllTests.cs file, so just copy and paste
inside there.
Once all of that is done, you can do a 'make test' from the top mcs
directory. Your test class will be automagically included in the
build and the tests will be run along with all the others.
* Tips on writing Unit tests.
You should look at the <a href="http://nunit.org">NUnit documentation</a>,
as it is a fantastic product, and includes fantastic documentation,
but here are some tips for those of you who are already reading
You should look at the NUnit documentation, as it is a
fantastic product, and includes fantastic documentation, but
here are some tips for those of you who are already reading
this web page.
** Provide an unique error message for Assert()
Include an unique message for each Assert() so that when the assert
fails, it is trivial to locate it in the source. Otherwise, it may be
fails, it is trivial to locate the failing one. Otherwise, it may be
difficult to determine which part of the test is failing. A good way
to ensure unique messages is to use something like #A01, #A02 etc.
@@ -97,10 +104,43 @@
AssertEquals ("A01", myTicks[0], t1.Ticks);
</pre>
** Constructors
When writing your testcase, please make sure to provide a constructor
which takes no arguments:
<pre>
public class DateTimeTest : TestCase
{
public DateTimeTest() : base ("[MonoTests.System.DateTimeTest]") {}
public DateTimeTest (string name): base(name) {}
public static ITest Suite
{
get {
TestSuite suite = new TestSuite ();
return suite;
}
}
}
</pre>
** Namespace
Please keep the namespace within each test directory consistent - all
tests which are referenced in the same AllTests.cs must be in the same
namespace. Of course you can use subnamespaces as you like -
especially for subdirectories of your testsuite.
For instance, if your AllTests.cs is in namespace "MonoTests" and you
have a subdirectory called "System", you can put all the tests in that
dir into namespace "MonoTests.System".
** Test your test with the Microsoft runtime
If possible, try to run your testsuite with the Microsoft runtime on
.NET on Windows and make sure all tests in it pass. This is especially
Windows and make sure all tests in it pass. This is especially
important if you're writing a totally new testcase - without this
check you can never be sure that your testcase contains no bugs ....
@@ -111,10 +151,9 @@
result when run with the Microsoft runtime - either because there is a
bug in their runtime or something is misleading or wrong in their
documentation. In this case, please put a detailed description of the
problem to mcs/class/doc/API-notes and do also report it to the
<a href="mailing-lists">mailing list</a> - we'll forward this to the
Microsoft people from time to time to help them fix their documentation
and runtime.
problem to mcs/class/doc/API-notes and do also report it to the list -
we'll forward this to the Microsoft people from time to time to help
them fix their documentation and runtime.
** Unit tests.
+1 -2
View File
@@ -2,9 +2,7 @@
1,FAQ,faq.html,faq.src
1,News archive,http://monoevo.sf.net/mwn/archives.html
1,Screenshots,screenshots.html,screenshots.src
1,Team,team.html,team.src
1,Other sites,other.html,other.src
1,Old News,oldnews.html,oldnews.src
0,Mono,rationale.html,rationale.src
1,Runtime,runtime.html,runtime.src
2,Embedding,embedded-api.html,embedded-api.src
@@ -21,6 +19,7 @@
1,Hackers,hackers.html,hackers.src
1,Documentation,documentation.html,documentation.src
1,Class Docs,classlib-doc.html,classlib-doc.src
1,Doc format,monodoc-xml.html,monodoc-xml.src
1,Test Suite,testing.html,testing.src
1,Tools,tools.html,tools.src
1,Porting,porting.html,porting.src
+1 -1
View File
@@ -212,7 +212,7 @@ function clickHandler (evt)
if (evt.ctrlKey)
{
var strRoot = 'http://cvs.hispalinux.es/cgi-bin/cvsweb/mcs/class/';
var strExtra = '?cvsroot=mono';
var strExtra = '?cvsroot=Mono';
if (strAssembly)
{
Binary file not shown.

Before

Width:  |  Height:  |  Size: 32 KiB

Binary file not shown.

Before

Width:  |  Height:  |  Size: 14 KiB

+15 -30
View File
@@ -1,9 +1,5 @@
ifeq ($(findstring CYGWIN,$(shell uname)),)
CSC=mcs
RUN_MONO=mono
else
CSC=csc /nologo
endif
CSCRIPT = $(SYSTEMROOT)/system32/cscript.exe
CSC=csc
CORCOMPARE=../../../mcs/tools/corcompare
@@ -38,7 +34,6 @@ OBJECTS= \
deploy/ideas.html \
deploy/ibmdb2.html \
deploy/index.html \
deploy/oldnews.html \
deploy/java.html \
deploy/jit-debug.html \
deploy/languages.html \
@@ -59,7 +54,6 @@ OBJECTS= \
deploy/runtime.html \
deploy/screenshots.html \
deploy/status.html \
deploy/team.html \
deploy/testing.html \
deploy/tools.html \
deploy/winforms.html \
@@ -79,7 +73,7 @@ OBJECTS= \
deploy/class-status-Cscompmgd.html \
deploy/class-library.html \
deploy/classlib-doc.html
#2,Configuration.Install,class-status-System.Configuration.Install.html,class-status-System.Configuration.Install.src,cm/cormissing.css,cm/cormissing.js
#2,Runtime.Remoting,class-status-System.Runtime.Remoting.html,class-status-System.Runtime.Remoting.src,cm/cormissing.css,cm/cormissing.js
@@ -90,10 +84,9 @@ NON_HTML_SOURCES= \
../mono-build.sh \
../mono-build-w32.sh
all: $(OBJECTS) deploy/index.rss ../team
all: $(OBJECTS) deploy/index.rss
perl process.pl commands template.html.in deploy
-mkdir deploy/team
cp team/*png deploy/team
tutorial: mono-beginning.html.stamp mono-beginning.pdf
cp -a mono-beginning mono-beginning.xml mono-beginning.pdf deploy
@@ -109,24 +102,18 @@ mono-beginning.xml: ../mono-beginning.xml
cp ../mono-beginning.xml .
deploy/index.rss: mono-rss.exe ../index
$(RUN_MONO) ./mono-rss.exe ../index deploy/index.rss
./mono-rss.exe ../index deploy/index.rss
mono-rss.exe: mono-rss.cs rss.cs
$(CSC) mono-rss.cs rss.cs
../team: render-team-page.exe team.xml
$(RUN_MONO) ./render-team-page.exe team.xml "../team"
render-team-page.exe: render-team-page.cs
$(CSC) render-team-page.cs
clean:
rm -f $(OBJECTS) $(patsubst deploy/%.html,src/%.src, $(OBJECTS)) src/*.xml src/*.html.in ../class-status-* ../class-status
push:
cp -f $(NON_HTML_SOURCES) deploy
echo scp -P 2200 -r deploy/* www@www.go-mono.com:/web/cvsmodules/mono
(cd deploy; rsync --verbose --recursive --checksum --update --rsh='ssh' . www@www.go-mono.com:/web/cvsmodules/mono )
echo scp -P 2200 -r deploy/* www@www.ximian.com:/web/cvsmodules/mono
(cd deploy; rsync --verbose --recursive --checksum --update --rsh='ssh -p 2200' . www@www.ximian.com:/web/cvsmodules/mono )
push2:
scp -r deploy/* primates:public_html/xxx
@@ -135,34 +122,32 @@ $(OBJECTS): $(patsubst deploy/%.html,src/%.src, $(OBJECTS))
#.PRECIOUS: $(patsubst deploy/%.html,src/%.src, $(OBJECTS))
transform.exe: transform.cs
$(CSC) transform.cs
.PRECIOUS: src/%.src
src/%.src: ../% commands template.html.in #makefile
src/%.src: ../% commands makefile template.html.in
perl htmlify $< > $@
.PRECIOUS: ../class-status-%
../class-status-%: src/%.html.in ../class-status.in
cat ../class-status.in $< > $@
.PRECIOUS: src/%.html.in
src/%.html.in: src/%.xml transform.exe $(CORCOMPARE)/cormissing.xsl
$(RUN_MONO) ./transform.exe $< $(CORCOMPARE)/cormissing.xsl > $@
src/%.html.in: src/%.xml $(CORCOMPARE)/transform.js $(CORCOMPARE)/cormissing.xsl
$(CSCRIPT) /nologo $(CORCOMPARE)/transform.js $< $(CORCOMPARE)/cormissing.xsl > $@
.PRECIOUS: src/%.xml
src/%.xml: ../../../mcs/class/lib/%.dll $(CORCOMPARE)/CorCompare.exe
$(RUN_MONO) $(CORCOMPARE)/CorCompare.exe -x $@ $<
$(CORCOMPARE)/CorCompare.exe -x $@ $<
src/corlib.xml: ../../../mcs/class/lib/corlib_cmp.dll $(CORCOMPARE)/CorCompare.exe
$(RUN_MONO) $(CORCOMPARE)/CorCompare.exe -f corlib -ms mscorlib -x $@ $<
$(CORCOMPARE)/CorCompare.exe -f corlib -ms mscorlib -x $@ $<
src/System.Security.xml: ../../../mcs/class/lib/System.Security_cmp.dll $(CORCOMPARE)/CorCompare.exe
$(RUN_MONO) $(CORCOMPARE)/CorCompare.exe -f System.Security -ms System.Security -x $@ $<
../class-status: ../class-status.in
cp -f $< $@
-352
View File
@@ -1,352 +0,0 @@
//
// RenderTeamPage.cs - Renders an HTML page with team member information from an XML file
//
// Author: Duncan Mak ([email protected])
//
// (C) Copyright 2003, Ximian Inc.
//
using System;
using System.Collections;
using System.IO;
using System.Text;
using System.Xml;
class Write {
static Contributor [] list;
static public XmlNamespaceManager nsmgr;
static void Main (string [] args)
{
if (args.Length != 2) {
Console.WriteLine ("write.exe <input.xml> <output.html>");
Environment.Exit (0);
}
string input = args [0];
string output = args [1];
XmlDocument document = new XmlDocument ();
document.Load (input);
nsmgr = new XmlNamespaceManager (document.NameTable);
nsmgr.AddNamespace ("t", "http://go-mono.org/team.xsd");
XmlNodeList contributors = document.SelectNodes ("/t:contributors/t:contributor", nsmgr);
list = new Contributor [contributors.Count];
Page p = new Page ();
int count = 0;
foreach (XmlNode n in contributors) {
list [count] = new Contributor (n, p.Document);
count ++;
}
Array.Sort (list, new ContributorComparer ());
int length = list.Length % 2 == 0 ? list.Length : list.Length + 1;
int i = 0;
while (i < length) {
try {
p.AddRow (list [i].RenderHtml (), list [i + 1].RenderHtml ());
} catch (IndexOutOfRangeException) {
p.AddRow (list [i].RenderHtml (), null);
}
i += 2;
}
p.Write (output);
}
}
public class ContributorComparer : IComparer
{
public int Compare (object x, object y)
{
return String.Compare (x.ToString (), y.ToString ());
}
}
class Contributor {
public Name name;
public string email;
public string image;
public string location;
public string organization;
public string description;
public string[] tasks;
public XmlDocument document;
public Contributor (XmlNode node, XmlDocument document)
{
name = GetName (node);
image = GetImage (node);
email = GetField (node, "t:e-mail");
location = GetField (node, "t:location");
organization = GetField (node, "t:organization");
description = GetField (node, "t:description");
tasks = GetTasks (node);
this.document = document;
}
public override string ToString ()
{
return name.ToString ();
}
public static string GetImage (XmlNode node)
{
string result = GetField (node, "t:image");
if (result == String.Empty)
return "none.png";
else
return result;
}
public static string GetField (XmlNode node, string selector)
{
XmlNode result = node.SelectSingleNode (selector, Write.nsmgr);
if (result == null)
return String.Empty;
return result.InnerText;
}
public static Name GetName (XmlNode node)
{
string first_name = GetField (node, "t:name/t:first-name");
string last_name = GetField (node, "t:name/t:last-name");
return new Name (first_name, last_name);
}
public static string [] GetTasks (XmlNode node)
{
XmlNodeList nodes = node.SelectNodes ("t:tasks/t:task", Write.nsmgr);
string [] result = new string [nodes.Count];
int i = 0;
foreach (XmlNode n in nodes) {
result [i] = n.InnerText;
i++;
}
return result;
}
public XmlElement RenderHtml ()
{
XmlElement root = document.CreateElement ("td");
XmlElement table = document.CreateElement ("table");
table.SetAttribute ("cellPadding", "0");
table.SetAttribute ("border", "0");
XmlElement tr = document.CreateElement ("tr");
XmlElement td = document.CreateElement ("td");
td.SetAttribute ("bgcolor", "#c3cda7");
td.SetAttribute ("valign", "top");
td.SetAttribute ("width", "1%");
tr.AppendChild (td);
table.AppendChild (tr);
root.AppendChild (table);
XmlElement img = document.CreateElement ("img");
img.SetAttribute ("align", "top");
img.SetAttribute ("border", "0");
img.SetAttribute ("height", "48");
img.SetAttribute ("width", "48");
img.SetAttribute ("src", "team/" + image);
td.AppendChild (img);
td = document.CreateElement ("TD");
td.SetAttribute ("bgcolor", "#c3cda7");
td.SetAttribute ("valign", "bottom");
td.SetAttribute ("width", "100%");
tr.AppendChild (td);
td.AppendChild (name.ToXml (document));
td.AppendChild (document.CreateElement ("br"));
td.AppendChild (RenderEmail ());
tr = document.CreateElement ("tr");
table.AppendChild (tr);
td = document.CreateElement ("td");
td.SetAttribute ("bgcolor", "#f5f8e4");
td.SetAttribute ("valign", "top");
tr.AppendChild (td);
td.AppendChild (RenderLabel ("Location: "));
td = document.CreateElement ("td");
td.SetAttribute ("bgcolor", "#f5f8e4");
td.SetAttribute ("valign", "top");
tr.AppendChild (td);
td.AppendChild (document.CreateTextNode (location));
tr = document.CreateElement ("tr");
table.AppendChild (tr);
td = document.CreateElement ("td");
td.SetAttribute ("bgcolor", "#f5f8e4");
td.SetAttribute ("valign", "top");
tr.AppendChild (td);
td.AppendChild (RenderLabel ("Description: "));
td = document.CreateElement ("td");
td.SetAttribute ("bgcolor", "#f5f8e4");
td.SetAttribute ("valign", "top");
tr.AppendChild (td);
td.AppendChild (document.CreateTextNode (description));
tr = document.CreateElement ("tr");
table.AppendChild (tr);
td = document.CreateElement ("td");
td.SetAttribute ("bgcolor", "#f5f8e4");
td.SetAttribute ("valign", "top");
tr.AppendChild (td);
td.AppendChild (RenderLabel ("Tasks: "));
td = document.CreateElement ("td");
td.SetAttribute ("bgcolor", "#f5f8e4");
td.SetAttribute ("valign", "top");
tr.AppendChild (td);
td.AppendChild (RenderTasks ());
return root;
}
public XmlNode RenderTasks ()
{
XmlElement element = document.CreateElement ("ol");
element.SetAttribute ("type", "I");
foreach (string task in tasks) {
XmlElement li = document.CreateElement ("li");
li.AppendChild (document.CreateTextNode (task));
element.AppendChild (li);
}
return element;
}
public XmlNode RenderEmail ()
{
XmlElement a = document.CreateElement ("a");
a.SetAttribute ("href", "mailto:" + email);
XmlElement font = document.CreateElement ("font");
font.SetAttribute ("size", "3");
XmlText t = document.CreateTextNode (email);
a.AppendChild (font);
font.AppendChild (t);
return a;
}
public XmlNode RenderLabel (string label)
{
string text = String.Format ("{0}: ", label);
XmlElement element = document.CreateElement ("b");
XmlText t = document.CreateTextNode (label );
element.AppendChild (t);
return element;
}
}
class Page {
XmlDocument document;
XmlElement tbody;
public Page ()
{
document = new XmlDocument ();
XmlElement table = document.CreateElement ("table");
document.AppendChild (table);
tbody = document.CreateElement ("tbody");
table.AppendChild (tbody);
}
public XmlDocument Document {
get { return document; }
}
public void AddRow (XmlNode left, XmlNode right)
{
if (left == null && right == null)
return;
XmlElement tr = document.CreateElement ("tr");
tbody.AppendChild (tr);
tr.AppendChild (left);
if (right == null)
tr.AppendChild (document.CreateElement ("td"));
else {
tr.SetAttribute ("valign", "top");
tr.AppendChild (right);
}
}
public void Write (TextWriter text_writer)
{
XmlTextWriter writer = new XmlTextWriter (text_writer);
writer.Formatting = Formatting.Indented;
document.WriteContentTo (writer);
writer.Flush ();
}
public void Write (string filename)
{
XmlTextWriter writer = new XmlTextWriter (filename, Encoding.Default);
writer.Formatting = Formatting.Indented;
document.WriteContentTo (writer);
writer.Flush ();
}
}
class Name {
string first_name;
string last_name;
public Name (string a, string b)
{
this.first_name = a;
this.last_name = b;
}
public override string ToString ()
{
if (first_name == null && last_name == null)
return String.Empty;
return first_name + " " + last_name;
}
public XmlNode ToXml (XmlDocument document)
{
XmlElement element = document.CreateElement ("font");
element.SetAttribute ("size", "3");
XmlElement b = document.CreateElement ("B");
XmlText t = document.CreateTextNode (ToString ());
b.AppendChild (t);
element.AppendChild (b);
return element;
}
}
-1440
View File
File diff suppressed because it is too large. Load diff
-30
View File
@@ -1,30 +0,0 @@
<?xml version="1.0" encoding="iso-8859-1" ?>
<xs:schema id="contributors" targetNamespace="http://go-mono.org/team.xsd" xmlns="http://go-mono.org/team.xsd" xmlns:xs="http://www.w3.org/2001/XMLSchema">
<xs:element name="contributor">
<xs:complexType>
<xs:sequence>
<xs:element name="name" minOccurs="0" maxOccurs="1">
<xs:complexType>
<xs:sequence>
<xs:element name="first-name" type="xs:string" minOccurs="0" maxOccurs="1" />
<xs:element name="last-name" type="xs:string" minOccurs="0" maxOccurs="1" />
</xs:sequence>
</xs:complexType>
</xs:element>
<xs:element name="e-mail" type="xs:string" minOccurs="0" maxOccurs="1" />
<xs:element name="image" type="xs:string" minOccurs="0" maxOccurs="1" />
<xs:element name="location" type="xs:string" minOccurs="0" maxOccurs="1" />
<xs:element name="organization" type="xs:string" minOccurs="0" maxOccurs="1" />
<xs:element name="description" type="xs:string" minOccurs="0" maxOccurs="1" />
<xs:element name="tasks" minOccurs="0" maxOccurs="1">
<xs:complexType>
<xs:sequence>
<xs:element name="task" type="xs:string" nillable="true" minOccurs="0" maxOccurs="unbounded" />
</xs:sequence>
</xs:complexType>
</xs:element>
</xs:sequence>
</xs:complexType>
</xs:element>
</xs:schema>
Binary file not shown.

Before

Width:  |  Height:  |  Size: 6.4 KiB

Binary file not shown.

Before

Width:  |  Height:  |  Size: 4.2 KiB

Binary file not shown.

Before

Width:  |  Height:  |  Size: 3.1 KiB

Binary file not shown.

Before

Width:  |  Height:  |  Size: 1.0 KiB

Binary file not shown.

Before

Width:  |  Height:  |  Size: 4.9 KiB

Binary file not shown.

Before

Width:  |  Height:  |  Size: 4.3 KiB

Binary file not shown.

Before

Width:  |  Height:  |  Size: 4.4 KiB

Binary file not shown.

Before

Width:  |  Height:  |  Size: 4.3 KiB

Binary file not shown.

Before

Width:  |  Height:  |  Size: 6.4 KiB

Binary file not shown.

Before

Width:  |  Height:  |  Size: 3.3 KiB

Binary file not shown.

Before

Width:  |  Height:  |  Size: 4.1 KiB

Binary file not shown.

Before

Width:  |  Height:  |  Size: 5.1 KiB

Binary file not shown.

Before

Width:  |  Height:  |  Size: 5.0 KiB

Binary file not shown.

Before

Width:  |  Height:  |  Size: 2.7 KiB

Binary file not shown.

Before

Width:  |  Height:  |  Size: 5.6 KiB

Binary file not shown.

Before

Width:  |  Height:  |  Size: 4.6 KiB

Binary file not shown.

Before

Width:  |  Height:  |  Size: 5.7 KiB

Binary file not shown.

Before

Width:  |  Height:  |  Size: 5.0 KiB

Binary file not shown.

Before

Width:  |  Height:  |  Size: 5.4 KiB

Binary file not shown.

Before

Width:  |  Height:  |  Size: 4.5 KiB

-20
View File
@@ -1,20 +0,0 @@
using System;
using System.Xml;
using System.Xml.Xsl;
namespace Transform
{
class Transform
{
public static void Main (string [] rgstrArgs)
{
XmlDocument xml = new XmlDocument ();
xml.Load (rgstrArgs [0]);
XslTransform xsl = new XslTransform ();
xsl.Load (rgstrArgs [1]);
xsl.Transform (xml, null, Console.Out);
}
}
}
-47
View File
@@ -1,42 +1,5 @@
* System.Windows.Forms
Currently Windows.Forms support is not finished.
The System.Windows.Forms effort is taking two paths:
<ul>
<li>Win32/Wine-based: This effort will use the Win32
API, and use a stub program to run the with Wine.
This allows applications that use P/Invoke to
function, and event delivery through the Wndproc
method to work for the most advanced and custom
applications. This is the path of best compatibility.
Also, work on a Gtk-based rendered for Wine will be
done, to make the user interface integrate with your
desktop look.
<li>Gtk# based: This effort will build a subset of
Windows.Forms that uses Gtk#. This gives a better
integration with the desktop, but will not be
completely compatible with the Windows edition. In
particular code that uses P/Invoke to call into Win32
or overwrite the Wndproc method to achieve special
effects will not work.
</ul>
* Win32/Wine edition.
Currently (May 21st, 2003) to get the Windows.Forms support
working, you need a Mono installation from CVS, and you need
to install Wine plus the <a
href="http://www.openlinksw.com">OpenLink patch</a>, and
define the environment variable "SWF" (export SWF=1 from your
shell).
<table>
<tr>
<td>
System.Windows.Forms is currently being implemented using the
Win32 API, we will be using <a
href="http://www.winehq.com">WineLib</a> on Unix systems to
@@ -51,16 +14,6 @@
it use the Gtk+ themes on X11 and Cocoa on MacOS to render the
widgets, and get the native look and feel on each of these
platforms.
</td>
<td>
<a href="images/WINESWF.JPG"><img src="images/WINESWF-mini.JPG"></a>
</td>
</table>
* Gtk# based
The code is contained in CVS.
There are no current plans to support embedded devices, but
Gtk/FrameBuffer is an option. If you have suggestions or
-44
View File
@@ -1,44 +0,0 @@
Mono Ahead Of Time Compiler
===========================
The new mono JIT has sophisticated optimization features. It uses SSA and has a
pluggable architecture for further optimizations. This makes it possible and
efficient to use the JIT also for AOT compilation.
* 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.
* file names: we simply add ".so" to the generated file. For example:
basic.exe -> basic.exe.so
corlib.dll -> corlib.dll.so
* staring the AOT compiler: mini --aot assembly_name
The following things are saved in the object file:
* version infos:
* native code: this is labeled with method_XXXXXXXX: where XXXXXXXX is the
hexadecimal token number of the method.
* additional informations needed by the runtime: For example we need to store
the code length and the exception tables. We also need a way to patch
constants only available at runtime (for example vtable and class
addresses). This is stored i a binary blob labeled method_info_XXXXXXXX:
PROBLEMS:
- all precompiled methods must be domain independent, or we add patch infos to
patch the target doamin.
- the main problem is how to patch runtime related addresses, for example:
- current application domain
- string objects loaded with LDSTR
- address of MonoClass data
- static field offsets
- method addreses
- virtual function and interface slots
+11 -12
View File
@@ -56,20 +56,19 @@ 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).
finally/endfinally: is translated into subroutine ending with a "return"
statement. The subroutine does not save EBP/ESP, because we need access to the
local variables of the enclosing method. We have to use a "call"
instruction to execute such finally handlers. This makes it possible to
execute them inside the stack unwinding code.
throw: we first save all regs into a sigcontext struct and then call the stack
unwinding code.
throw: we first save all regs into a sigcontext struct (we pass the
exception object in register ECX), and then call the stack unwinding
code.
catch handler: receives the exception object in ECX. They store that
object into a local variable, so that rethrow can access the object.
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
==========================
-208
View File
@@ -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
-653
View File
@@ -1,653 +0,0 @@
A new JIT compiler for the Mono Project
Miguel de Icaza (miguel@{ximian.com,gnome.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.
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
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.
* 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.
-349
View File
@@ -1,349 +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.
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.
* 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.
-113
View File
@@ -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...)
-156
View File
@@ -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 -2
View File
@@ -1,5 +1,4 @@
man_MANS = mcs.1 mono.1 monostyle.1 mono-config.5 sqlsharp.1 oldmono.1 ilasm.1 \
cert2spc.1 cilc.1
man_MANS = mcs.1 mono.1 monostyle.1 mono-config.5 sqlsharp.1
EXTRA_DIST = $(man_MANS)
-21
View File
@@ -1,21 +0,0 @@
.TH "cilc" 1
.SH NAME
cilc \- Mono CIL-to-C binding generator
.SH SYNOPSIS
.B cilc
[options]
.I assembly
.I target
.SH DESCRIPTION
cilc is the Mono CIL-to-C binding generator. It takes a CIL assembly as input
and generates a directory of C sources which, when compiled, provide a C
interface to the classes contained within that assembly by means of a shared
object library.
.PP
Generated sources make use of the Mono embedding API. Thus a complete Mono
development environment must be available on the development system and a
complete Mono runtime environment must be available on target systems.
.SH AUTHOR
Written by Alp Toker <[email protected]>
.SH SEE ALSO
mono(1)
-44
View File
@@ -1,44 +0,0 @@
.TH "ilasm" 1
.SH NAME
ilasm \- Mono IL assembler
.SH SYNOPSIS
.B ilasm
[option] [source-files]
.SH DESCRIPTION
ilasm is the Mono ILAsm assembler. You can pass one or more options to
drive the compiler, and a set of source files.
The Mono ILAsm assembler accepts options starting with / or - for mosted
options.
The Mono ILAsm assembler generates images (.exe and .dll files) that contain
CIL byte code that can be executed by any system that implemented a Common
Language Infrastructure virtual machine.
.SH OPTIONS
.TP
.B \//out:<file_name>
Specify the output file name.
.TP
.B \//exe
Generate an exe
.TP
.B \//dll
Generate a library
.TP
.B \//scan_only
Just scan the IL code and display tokens.
.TP
.B \//show_tokens
Show tokens as they are parsed.
.TP
.B \//show_method_def
Display method information when a method is defined.
.TP
.B \//show_method_ref
Display method information when a method is referenced
.TP
.B \--about
Display information about ilasm
.TP
.B \--version
Display ilasm version
+5 -10
View File
@@ -59,10 +59,11 @@ or can be used by methods that have been tagged with the Conditional
attribute.
.TP
.I \-debug, \-debug+, \-g
Generate debugging information. To obtain stack traces with debugging
information, you need to invoke the mono runtime with the `--debug'
flag. This debugging information is stored inside the assembly as a
resource.
Generate debugging information. The debugging information is stored
in a file with the extension .dbg (if you install system wide
assemblies, you need to install this file as well). To get stack
traces with debugging information, you need to invoke the mono runtime
with the `--debug' flag.
.TP
.I \-debug-
Do not generate debugging information.
@@ -152,12 +153,6 @@ comma.
.I \-v
Debugging. Turns on verbose yacc parsing.
.TP
.I \-v2
Turns on C# 2.0 language features.
.TP
.I \-\-version
Shows the compiler version.
.TP
.I \-\-
Use this to stop option parsing, and allow option-looking parameters
to be passed on the command line.
+101 -160
View File
@@ -1,200 +1,141 @@
.\"
.\" mono manual page.
.\" (C) 2003 Ximian, Inc.
.\" (C) Ximian, Inc.
.\" Author:
.\" Miguel de Icaza ([email protected])
.\"
.de Sp \" Vertical space (when we can't use .PP)
.if t .sp .5v
.if n .sp
..
.TH Mono "Mono 1.0"
.SH NAME
mono \- Mono's ECMA-CLI native code generator (Just-in-Time and Ahead-of-Time)
mono \- Mono ECMA-CLI Just in Time compiler.
.SH SYNOPSIS
.PP
.B mono [options] file [arguments...]
.B mono
[\-\-help] [\-d] [\-\-debug-asm] [\-\-debug-forest] [\-\-trace-calls]
[\-\-compile name] [\-\-ncompile num] [\-\-noinline] [\-\-profile]
[\-\-debug=[format]] [\-\-debug-args args] [\-\-break name] [\-\-precompile name]
[\-\-config filename]
program.exe [arguments...]
.SH DESCRIPTION
\fImono\fP is a runtime implementation of the ECMA Common Language
Infrastructure. This can be used to run ECMA and .NET applications.
.PP
The runtime contains a native code generator that transforms the
Common Intermediate Language into native code.
.PP
The code generator can operate in two modes: just in time compilation
(JIT) or ahead of time compilation (AOT). Since code can be
dynamically loaded, the runtime environment and the JIT are always
present, even if code is compiled ahead of time.
.PP
The runtime loads ths specified
.I file
The \fImono\fP program is a Just in Time compiler for ECMA CLI byte
codes. It translates dynamically a CIL stream into native code.
.I program.exe
and optionally passes
the
.I arguments
to it. The
.I file
is an ECMA assembly. They typically have a .exe or .dll extension.
.PP
The runtime provides a number of configuration options for running
applications, for developping and debugging, and for testing and
debugging the runtime itself.
.SH RUNTIME OPTIONS
The following options are available:
to it.
.SH OPTIONS
The following options are supported:
.TP
.I "--aot"
This option is used to precompile the CIL code in the specified
assembly to native code. The generated code is stored in a file with
the extension .so. This file will be automatically picked up by the
runtime when the assembly is executed.
.Sp
This pre-compiles the methods, but the original assembly is still
required to execute as this one contains the metadata and exception
information which is not availble on the generated file. When
precompiling code, you might want to compile with all optimizations
(-O=all). Pre-compiled code is position independent code.
.Sp
Pre compilation is just a mechanism to reduce startup time, and avoid
just-in-time compilation costs. The original assembly must still be
present, as the metadata is contained there.
.I "--help", "-h"
Displays usage instructions.
.I "--share-code"
This mode makes the LoaderOptimization for Application Domains default
to sharing code. This results in slower code, but enables code
sharing across application domains. The default is to maximize for
speed, but disallow JITed code sharing across domains. See
System.LoaderOptimization for more information
.TP
.I "--config filename"
Load the specified configuration file instead of the default one(s).
The default files are /etc/mono/config and ~/.mono/config or the file
specified in the MONO_CONFIG environment variable, if set. See the
mono-config(5) man page for details on the format of this file.
specified in the MONO_CONFIG environment variable, if set.
.TP
.I "--help", "-h"
Displays usage instructions.
.I "--noinline"
Disables the code inliner.
.TP
.I "--optimize=MODE", "-O=mode"
MODE is a comma separated list of optimizations. They also allow
optimizations to be turned off by prefixing the optimization name with
a minus sign.
.Sp
The following optimizations are implemented:
.nf
all Turn on all optimizations
peephole Peephole postpass
branch Branch optimizations
inline Inline method calls
cfold Constant folding
consprop Constant propagation
copyprop Copy propagation
deadce Dead code elimination
linears Linear scan global reg allocation
cmov Conditional moves
shared Emit per-domain code
sched Instruction scheduling
intrins Intrinsic method implementations
tailc Tail recursion and tail calls
loop Loop related optimizations
leaf Leaf procedures optimizations
profile Use profiling information
.fi
.Sp
For example, to enable all the optimization but dead code
elimination and inlining, you can use:
.nf
-O=all,-deadce,-inline
.fi
.SH DEBUGGING OPTIONS
The following options are used to debug, or perfomance test the JIT
compiler:
.TP
.I "-V", "--version"
Prints JIT version information.
.SH DEVELOPMENT OPTIONS
The following options are used to help when developing a JITed application.
.I "--trace-calls"
Shows method names as they are invoked.
.TP
.I "--debug"
Turns on the debugging mode in the runtime. If an assembly was
compiled with debugging information, it will produce line number
information for stack traces.
.I "--dump-asm"
Displays the generated code as methods are invoked.
.TP
.I "--profile[=profiler[:profiler_args]]"
Instructs the runtime to collect profiling information about execution
times and memory allocation, and dump it at the end of the execution.
If a profiler is not specified, the default profiler is used. profiler_args
is a profiler-specific string of options for the profiler itself.
.SH JIT MAINTAINER OPTIONS
The maintainer options are only used by those developing the runtime
itself, and not typically of interest to runtime users or developers.
.I "--dump-forest"
Displays the basic blocks and the forest of trees that is
created from a stream of CIL opcodes.
.TP
.I "--compile name"
This compiles a method (namespace.name:methodname), this is used for
testing the compiler performance or to examine the output of the code
generator.
.TP
.I "--compileall"
Compiles all the methods in an assembly. This is used to test the
compiler performance or to examine the output of the code generator
.TP
.I "--graph=TYPE METHOD"
This generates a postscript file with a graph with the details about
the specified method (namespace.name:methodname). This requires `dot'
and ghostview to be installed (it expects Ghostview to be called
"gv").
.TP
The following graphs are available:
.nf
cfg Control Flow Graph (CFG)
dtree Dominator Tree
code CFG showing code
ssa CFG showing code after SSA translation
optcode CFG showing code after IR optimizations
.fi
.Sp
Some graphs will only be available if certain optimizations are turned
on.
Compiles the method on the given class (namespace.name:methodname) or
all classes in the given image (@imagename).
.TP
.I "--ncompile"
Instruct the runtime on the number of times that the method specified
by --compile (or all the methods if --compileall is used) to be
compiled. This is used for testing the code generator performance.
Compiles the method a number of times. If no argument is specified,
the method will be compiled a thousand times.
.SH DEVELOPMENT OPTIONS
The following options are used to debug a JITed application. They're
only useful when running the JIT in a debugger:
.TP
.I "-v", "--verbose"
Increases the verbosity level, each time it is listed, increases the
verbosity level to include more information (including, for example,
a disassembly of the native code produced, code selector info etc.).
.I "--debug"
Writes out debug information in the given format or in the default format.
See DEBUGGING FORMATS for details.
.TP
.I "--debug-args args"
Comma-separated list of additional arguments for the symbol writer.
See DEBUGGING FORMATS for details.
.TP
.I "--break method"
Inserts a breakpoint before the method whose name is `method'
(namespace.class:methodname). Use `Main' as method name to insert a
breakpoint on the application's main method.
(namespace.class:methodname). Use `Main' as method name to insert a breakpoint on the
application's main method.
.TP
.I "--breakonex"
Inserts a breakpoint on exceptions. This allows you to debug your
application with a native debugger when an exception is thrown.
.I "--precompile name"
Compiles the given class (namespace.name), method (namespace.name:methodname)
or all classes in the given image (@imagename) before executing the main
application.
.TP
.I "--trace"
Shows method names as they are invoked.
.I "--profile"
Collect profiling information and dump it at the end of the process.
.SH DEBUGGING FORMATS
The following debugging formats are currently supported:
.TP
.I "stabs"
Writes out stabs debug information.
.TP
.I "dwarf"
Writes out dwarf debug information.
.TP
.I "mono"
Use a symbol file which has been created by MCS. It can be used to get
source lines in stack traces.
.PP
The "stabs" and "dwarf" formats support the following options:
.TP
.I "filename=FILENAME"
Write debugging information into FILENAME. This file must be run through
the assembler to create an object file.
.TP
.I "objfile=FILENAME"
When automatically assembling the symbol file, write the resulting object
file into FILENAME.
.TP
.I "dont_assemble"
Normally, the symbol file is automatically assembled to an object file
when you call "mono_debug_make_symbols". Use this option to disable this
behaviour.
.TP
.I "install_il_files"
Put the generated *.il files in the same directory than the assembly they
came from. The default is to put them into the current working directory.
.TP
.I "dont_update_il_files"
Normally, the *.il files are recreated if their assemblies have changed
when you call "mono_debug_make_symbols". Use this option to disable this
behaviour.
.TP
.I "dont_create_il_files"
Update the *.il files if their assemblies have changed, but only if the
file already exists.
.PP
.SH ENVIRONMENT VARIABLES
.TP
.I "GC_DONT_GC"
Turns off the garbage collection in Mono. This should be only used
for debugging purposes
.TP
.I "MONO_PATH"
Provides a search path to the runtime where to look for library files.
Provides a search path to mono and mint where to look for library files.
Directories are separated by the platform path separator (colons on unix). Example:
.B /home/username/lib:/usr/local/mono/lib
.TP
.I "MONO_DISABLE_SHM"
If this variable is set, it disables the Windows I/O Emulation layer,
and handles (files, events, mutexes, pipes) will not be shared across
processes. This option is only available on Unix.
.TP
.I "MONO_CFG_DIR"
If set, this variable overrides the default system configuration directory
($PREFIX/etc). It's used to locate machine.config file.
.TP
.I "MONO_CONFIG"
If set, this variable overrides the default runtime configuration file
($PREFIX/etc/mono/config). The --config command line options overrides the
environment variable.
.PP
.SH FILES
On Unix assemblies are loaded from the installation lib directory. If you set
`prefix' to /usr, the assemblies will be located in /usr/lib. On
@@ -202,7 +143,7 @@ Windows, the assemblies are loaded from the directory where mono and
mint live.
.PP
/etc/mono/config, ~/.mono/config
.PP
.IP
Mono runtime configuration file. See the mono-config(5) manual page
for more information.
.SH MAILING LISTS
-175
View File
@@ -1,175 +0,0 @@
.\"
.\" mono manual page.
.\" (C) Ximian, Inc.
.\" Author:
.\" Miguel de Icaza ([email protected])
.\"
.TH Mono "Mono 1.0"
.SH NAME
mono \- Mono ECMA-CLI Just in Time compiler.
.SH SYNOPSIS
.PP
.B mono
[\-\-help] [\-d] [\-\-debug-asm] [\-\-debug-forest] [\-\-trace-calls]
[\-\-compile name] [\-\-ncompile num] [\-\-noinline] [\-\-profile]
[\-\-debug=[format]] [\-\-debug-args args] [\-\-break name] [\-\-precompile name]
[\-\-config filename]
program.exe [arguments...]
.SH DESCRIPTION
The \fImono\fP program is a Just in Time compiler for ECMA CLI byte
codes. It translates dynamically a CIL stream into native code.
.I program.exe
and optionally passes
the
.I arguments
to it.
.SH OPTIONS
The following options are supported:
.TP
.I "--help", "-h"
Displays usage instructions.
.TP
.I "--share-code"
This mode makes the LoaderOptimization for Application Domains default
to sharing code. This results in slower code, but enables code
sharing across application domains. The default is to maximize for
speed, but disallow JITed code sharing across domains. See
System.LoaderOptimization for more information
.TP
.I "--config filename"
Load the specified configuration file instead of the default one(s).
The default files are /etc/mono/config and ~/.mono/config or the file
specified in the MONO_CONFIG environment variable, if set.
.TP
.I "--noinline"
Disables the code inliner.
.TP
.SH DEBUGGING OPTIONS
The following options are used to debug, or perfomance test the JIT
compiler:
.TP
.I "--trace-calls"
Shows method names as they are invoked.
.TP
.I "--dump-asm"
Displays the generated code as methods are invoked.
.TP
.I "--dump-forest"
Displays the basic blocks and the forest of trees that is
created from a stream of CIL opcodes.
.TP
.I "--compile name"
Compiles the method on the given class (namespace.name:methodname) or
all classes in the given image (@imagename).
.TP
.I "--ncompile"
Compiles the method a number of times. If no argument is specified,
the method will be compiled a thousand times.
.SH DEVELOPMENT OPTIONS
The following options are used to debug a JITed application. They're
only useful when running the JIT in a debugger:
.TP
.I "--debug"
Writes out debug information in the given format or in the default format.
See DEBUGGING FORMATS for details.
.TP
.I "--debug-args args"
Comma-separated list of additional arguments for the symbol writer.
See DEBUGGING FORMATS for details.
.TP
.I "--break method"
Inserts a breakpoint before the method whose name is `method'
(namespace.class:methodname). Use `Main' as method name to insert a breakpoint on the
application's main method.
.TP
.I "--precompile name"
Compiles the given class (namespace.name), method (namespace.name:methodname)
or all classes in the given image (@imagename) before executing the main
application.
.TP
.I "--profile"
Collect profiling information and dump it at the end of the process.
.SH DEBUGGING FORMATS
The following debugging formats are currently supported:
.TP
.I "stabs"
Writes out stabs debug information.
.TP
.I "dwarf"
Writes out dwarf debug information.
.TP
.I "mono"
Use a symbol file which has been created by MCS. It can be used to get
source lines in stack traces.
.PP
The "stabs" and "dwarf" formats support the following options:
.TP
.I "filename=FILENAME"
Write debugging information into FILENAME. This file must be run through
the assembler to create an object file.
.TP
.I "objfile=FILENAME"
When automatically assembling the symbol file, write the resulting object
file into FILENAME.
.TP
.I "dont_assemble"
Normally, the symbol file is automatically assembled to an object file
when you call "mono_debug_make_symbols". Use this option to disable this
behaviour.
.TP
.I "install_il_files"
Put the generated *.il files in the same directory than the assembly they
came from. The default is to put them into the current working directory.
.TP
.I "dont_update_il_files"
Normally, the *.il files are recreated if their assemblies have changed
when you call "mono_debug_make_symbols". Use this option to disable this
behaviour.
.TP
.I "dont_create_il_files"
Update the *.il files if their assemblies have changed, but only if the
file already exists.
.PP
.SH ENVIRONMENT VARIABLES
.TP
.I "MONO_PATH"
Provides a search path to mono and mint where to look for library files.
Directories are separated by the platform path separator (colons on unix). Example:
.B /home/username/lib:/usr/local/mono/lib
.PP
.TP
.I "MONO_DISABLE_SHM"
If this variable is set, it disables the Windows I/O Emulation layer,
and handles (files, events, mutexes, pipes) will not be shared across
processes. This option is only available on Unix.
.TP
.I "MONO_CFG_DIR"
If set, this variable overrides the default system configuration directory
($PREFIX/etc). It's used to locate machine.config file.
.TP
.I "GC_DONT_GC"
Turns off the garbage collection in Mono. This should be only used
for debugging purposes
.TP
.I "MONO_CONFIG"
If set, this variable overrides the default runtime configuration file
($PREFIX/etc/mono/config). The --config command line options overrides the
environment variable.
.SH FILES
On Unix assemblies are loaded from the installation lib directory. If you set
`prefix' to /usr, the assemblies will be located in /usr/lib. On
Windows, the assemblies are loaded from the directory where mono and
mint live.
.PP
/etc/mono/config, ~/.mono/config
.IP
Mono runtime configuration file. See the mono-config(5) manual page
for more information.
.SH MAILING LISTS
Visit http://mail.ximian.com/mailman/mono-list for details.
.SH WEB SITE
Visit: http://www.go-mono.com for details
.SH SEE ALSO
.BR mcs(1), mint(1), monodis(1), mono-config(5)
+1 -1
View File
@@ -388,7 +388,7 @@ or Mono.Data.TdsClient provider:
PostgreSQL via Mono.Data.PostgreSqlClient provider:
host=localhost;dbname=test;user=postgres;password=fun2db
host=localhost;dbname=test;user=postgres;pass=fun2db
or
-2
View File
@@ -16,5 +16,3 @@ Class Libraries:
John Barnette ([email protected])
Daniel Morgan <[email protected]>
Sebastien Pouliot <[email protected]>
Per Arneng <[email protected]>
Ben Maurer <[email protected]>
-481
View File
@@ -1,481 +0,0 @@
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 -88
View File
@@ -1,97 +1,10 @@
2003-05-10 Gonzalo Paniagua Javier <[email protected]>
* makefile:
* makefile.gnu: don't use -C when running make.
2003-05-05 Ben Maurer <[email protected]>
* AUTHORS: Added self.
2003-04-15 Nick Drochak <[email protected]>
* makefile: Remove nunit version 1 from build
2002-03-14 Daniel Morgan <[email protected]>
* class/makefile.gnu
* class/ByteFX.Data/makefile.gnu: add ByteFX.Data.dll
to the Linux build
2002-03-14 Daniel Morgan <[email protected]>
* makefile: added ByteFX.Data.dll to windows install
* class/library.build: added ByteFX.Data.dll
to windows build. added additional clean targets
* class/Microsoft.VisualC/Microsoft.VisualC.build: fix
windows clean
* class/ByteFX.Data: added directory for ByteFX.Data.dll
which includes a MySQL ADO.NET Provider.
Contributed by Reggie Burnett <[email protected]>
from ByteFX, Inc.
ByteFX.Data 0.6.5 is Copyright 2002-2003, ByteFX, Inc.
Added the following files and directories:
class/ByteFX.Data/AssemblyInfo.cs
class/ByteFX.Data/list
class/ByteFX.Data/ByteFX.Data.build
class/ByteFX.Data/makefile.gnu
class/ByteFX.Data/ChangeLog.txt
class/ByteFX.Data/readme.txt
class/ByteFX.Data/lgpl.txt: new files
BitStream.cs
Connection.cs
Field.cs
Inflater.cs
ConnectionString.cs
HuffmanTree.cs
NamedPipeStream.cs
class/ByteFX.Data/Common: added files to new directory
Driver.cs
command.resx
todo.txt
CommandBuilder.cs
Exception.cs
dataadapter.cs
transcaction.cs
Connection.cs
Field.cs
datareader.cs
Connection.resx
MysqlDefs.cs
parameter.cs
class/ByteFX.Data/mysqlclient: added files to new directory
command.cs
parameter_collection.cs
class/ByteFX.Data/mysqlclient/Designers: added files to new directory
2003-03-14 Daniel Morgan <[email protected]>
* makefile: add ilasm.exe to windows build and add missing assemblies
to windows install
* class/library.build: include PEAPI.dll, Npgsql.dll, and
ICSharpCode.SharpZipLib part of the windows build
2003-03-10 Martin Willemoes Hansen <[email protected]>
* Fixed some spelling errors in class/doc/TemplateTest.cs
2003-03-04 Gonzalo Paniagua Javier <[email protected]>
* makefile: added Mono.Posix and System.Management.
2003-02-16 Martin Baulig <[email protected]>
* docs/compiler: Added a few works about the new `Location' code.
2003-02-15 Nick Drochak <[email protected]>
* makefile.gnu: Add testcorlib target to run just the corlib unit tests.
* makefile.gnu: Add testcorlib target to run just the corlib unit tests.
2003-02-10 Nick Drochak <[email protected]>
-29
View File
@@ -1,29 +0,0 @@
The Mono code is licensed under various different licenses.
GNU GPL: details avaliable in the file LICENSE.GPL
GNU LGPL: details available in the file LICENSE.LGPL
MIT X11: text available in the file MIT.X11
For your convenience copies of the GNU GPL and GNU LGPL are
located in the file COPYING and COPYING.LIB.
* Class Libraries:
All of the core classes licensed under the terms of
the MIT X11 license.
Third party libraries that we distribute for
convenience reasons are distributed under their own
terms (all of them allow development of proprietary
applications with them).
Third party libraries include: ByteFX.Data,
ICSharpCode.SharpZipLib, Npgsql.
* Mono C# compiler: GNU GPL
* Mono Basic compiler: GNU GPL.
* Various tools in the `tools' directory: GNU GPL.
-15
View File
@@ -1,15 +0,0 @@
Mono compilers and tools.
Copyright (C) 2001, 2002, 2003, Ximian and contributors.
This program is free software; you can redistribute it and/or modify
it under the terms of the GNU General Public License as published by
the Free Software Foundation;
This program is distributed in the hope that it will be useful,
but WITHOUT ANY WARRANTY; without even the implied warranty of
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
GNU General Public License for more details.
You should have received a copy of the GNU General Public License
along with this program; if not, write to the Free Software
Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA
-15
View File
@@ -1,15 +0,0 @@
Mono class libraries
Copyright (C) Mono project (authors listed in individual ChangeLog entries)
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.
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.
-21
View File
@@ -1,21 +0,0 @@
Copyright (c) 2001, 2002, 2003 Ximian, Inc and the individuals listed
on the ChangeLog entries.
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.
-58
View File
@@ -1,58 +0,0 @@
using System.Reflection;
using System.Runtime.CompilerServices;
//
// General Information about an assembly is controlled through the following
// set of attributes. Change these attribute values to modify the information
// associated with an assembly.
//
[assembly: AssemblyTitle("ByteFX.Data.dll")]
[assembly: AssemblyDescription("ADO.Net drivers for MySQL & PostgreSQL")]
[assembly: AssemblyConfiguration("")]
[assembly: AssemblyCompany("ByteFX, Inc.")]
[assembly: AssemblyProduct("")]
[assembly: AssemblyCopyright("Copyright 2002, ByteFX, Inc.")]
[assembly: AssemblyTrademark("")]
[assembly: AssemblyCulture("")]
//
// Version information for an assembly consists of the following four values:
//
// Major Version
// Minor Version
// Build Number
// Revision
//
// You can specify all the values or you can default the Revision and Build Numbers
// by using the '*' as shown below:
[assembly: AssemblyVersion("0.6.5.*")]
//
// In order to sign your assembly you must specify a key to use. Refer to the
// Microsoft .NET Framework documentation for more information on assembly signing.
//
// Use the attributes below to control which key is used for signing.
//
// Notes:
// (*) If no key is specified, the assembly is not signed.
// (*) KeyName refers to a key that has been installed in the Crypto Service
// Provider (CSP) on your machine. KeyFile refers to a file which contains
// a key.
// (*) If the KeyFile and the KeyName values are both specified, the
// following processing occurs:
// (1) If the KeyName can be found in the CSP, that key is used.
// (2) If the KeyName does not exist and the KeyFile does exist, the key
// in the KeyFile is installed into the CSP and used.
// (*) In order to create a KeyFile, you can use the sn.exe (Strong Name) utility.
// When specifying the KeyFile, the location of the KeyFile should be
// relative to the project output directory which is
// %Project Directory%\obj\<configuration>. For example, if your KeyFile is
// located in the project directory, you would specify the AssemblyKeyFile
// attribute as [assembly: AssemblyKeyFile("..\\..\\mykey.snk")]
// (*) Delay Signing is an advanced option - see the Microsoft .NET Framework
// documentation for more information on this.
//
[assembly: AssemblyDelaySign(false)]
[assembly: AssemblyKeyFile("")]
[assembly: AssemblyKeyName("")]
-44
View File
@@ -1,44 +0,0 @@
<?xml version="1.0" encoding="iso-8859-1"?>
<!-- NAnt build file for ByteFX.Data.dll -->
<project name="ByteFX.Data" default="build">
<property name="debug" value="false"/>
<target name="build">
<csc target="library" output="../lib/ByteFX.Data.dll" debug="${debug}">
<arg value="/nowarn:1595"/>
<arg value="/nowarn:0067"/>
<arg value="/nowarn:0109"/>
<arg value="/nowarn:0169"/>
<arg value="/nowarn:0649"/>
<arg value="/unsafe"/>
<arg value="/noconfig"/>
<arg value="/r:../lib/System.dll"/>
<arg value="/r:../lib/System.Xml.dll"/>
<arg value="/r:../lib/System.Data.dll"/>
<arg value="/r:../lib/ICSharpCode.SharpZipLib.dll"/>
<sources>
<includes name="**/*.cs"/>
<excludes name="Test/**"/>
</sources>
<references>
<includes name="../lib/corlib.dll"/>
<includes name="../lib/System.dll"/>
<includes name="../lib/System.Xml.dll"/>
<includes name="../lib/System.Data.dll"/>
<includes name="../lib/ICSharpCode.SharpZipLib.dll"/>
</references>
</csc>
</target>
<target name="test" depends="build">
<nant basedir="Test" target="test"/>
</target>
<target name="clean">
<delete file="../lib/ByteFX.Data.dll" failonerror="false"/>
</target>
</project>
-11
View File
@@ -1,11 +0,0 @@
2003-03-15 Daniel Morgan <[email protected]>
* mysqlclient/datareader.cs: in GetSchemaTable(),
"BaseColumnName" should be set to the ColumnName,
not null
2003-03-14 Daniel Morgan <[email protected]>
Imported the ByteFX.Data MySQL 0.6.5 data provider. See
ChangeLog at the root of mcs for this date.
-22
View File
@@ -1,22 +0,0 @@
0.65
====================
* MySQLCommandBuilder now implemented
* Transaction support now implemented (not all table types support this)
* GetSchemaTable fixed to not use xsd (for Mono)
* Driver is now Mono-compatible!!
* TIME data type now supported
* More work to improve Timestamp data type handling
* Changed signatures of all classes to match corresponding SqlClient classes
0.60
======================
* Protocol compression using SharpZipLib (www.icsharpcode.net)
* Named pipes on Windows now working properly
* Work done to improve Timestamp data type handling
* Implemented IEnumerable on DataReader so DataGrid would work
0.50
======================
* Speed increased dramatically by removing bugging network sync code
* Driver no longer buffers rows of data (more ADO.Net compliant)
* Conversion bugs related to TIMESTAMP and DATETIME fields fixed
-54
View File
@@ -1,54 +0,0 @@
using System;
using System.IO;
namespace ByteFX.Data.Common
{
/// <summary>
/// Summary description for BitStream.
/// </summary>
public class BitStream : MemoryStream
{
private byte[] _input;
private int _start;
private int _end;
private int _bitindex;
private uint _bitbuffer;
private int _bits_in_buffer;
public BitStream(byte[] input, int index, int len)
{
_bitindex = 0;
_bitbuffer = 0;
_bits_in_buffer = 0;
_input = input;
_start = index;
_end = _start + len;
}
public int GetBits(int numbits)
{
return 0;
}
public int PeekBits(int numbits)
{
int val=0;
int numbytes=0;
int index=_start;
while (numbits > 0)
{
val = (val << 8) | _input[index++];
numbits -= 8;
}
while (_bits_in_buffer < numbits)
{
if (_start == _end)
throw new Exception("Out of bits");
byte b = _input[_start++];
}
return 0;
}
}
}
-107
View File
@@ -1,107 +0,0 @@
using System;
using System.ComponentModel;
using System.Collections.Specialized;
using System.Data;
namespace ByteFX.Data.Common
{
/// <summary>
/// Summary description for Connection.
/// </summary>
[ToolboxItem(false)]
public class Connection : Component
{
protected StringDictionary m_ConnSettings = new StringDictionary();
protected string m_ConnString;
internal ConnectionState m_State;
public Connection(System.ComponentModel.IContainer container)
{
/// <summary>
/// Required for Windows.Forms Class Composition Designer support
/// </summary>
container.Add(this);
Init();
}
public Connection()
{
Init();
}
protected void Init()
{
m_State = ConnectionState.Closed;
}
[Browsable(true)]
public string DataSource
{
get
{
String s = m_ConnSettings["data source"];
if (s == null)
s = m_ConnSettings["server"];
if (s == null || s.Length == 0)
return "localhost";
return s;
}
}
[Browsable(false)]
public string User
{
get
{
string s = m_ConnSettings["user id"];
if (s == null)
s = "";
return s;
}
}
[Browsable(false)]
public string Password
{
get
{
string pwd = m_ConnSettings["password"];
if (pwd == null)
pwd = "";
return pwd;
}
}
[Browsable(true)]
public int ConnectionTimeout
{
get
{
// Returns the connection time-out value set in the connection
// string. Zero indicates an indefinite time-out period.
if (m_ConnSettings == null)
return 30;
return Convert.ToInt32(m_ConnSettings["connection timeout"]);
}
}
[Browsable(true)]
public string Database
{
get
{
// Returns an initial database as set in the connection string.
// An empty string indicates not set - do not return a null reference.
return m_ConnSettings["database"];
}
}
[Browsable(false)]
public ConnectionState State
{
get { return m_State; }
}
}
}
@@ -1,101 +0,0 @@
// ByteFX.Data data access components for .Net
// Copyright (C) 2002-2003 ByteFX, Inc.
//
// This library is free software; you can redistribute it and/or
// modify it under the terms of the GNU Lesser General Public
// License as published by the Free Software Foundation; either
// version 2.1 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
// Lesser General Public License for more details.
//
// You should have received a copy of the GNU Lesser General Public
// License along with this library; if not, write to the Free Software
// Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA
using System;
using System.Collections.Specialized;
namespace ByteFX.Data.Common
{
/// <summary>
/// Summary description for Utility.
/// </summary>
public class ConnectionString
{
public ConnectionString()
{
//
// TODO: Add constructor logic here
//
}
public static StringDictionary ParseConnectString( String s )
{
String[] keyvalues = s.Split( ';' );
String[] newkeyvalues = new String[keyvalues.Length];
int x = 0;
// first run through the array and check for any keys that
// have ; in their value
foreach (String keyvalue in keyvalues)
{
// check for trailing ; at the end of the connection string
if (keyvalue.Length == 0) continue;
// this value has an '=' sign so we are ok
if (keyvalue.IndexOf('=') >= 0)
{
newkeyvalues[x++] = keyvalue;
}
else
{
newkeyvalues[x-1] += ";";
newkeyvalues[x-1] += keyvalue;
}
}
StringDictionary dict = new StringDictionary();
// now we run through our normalized key-values, splitting on equals
for (int y=0; y < x; y++)
{
String[] parts = newkeyvalues[y].Split( '=' );
parts[0] = parts[0].ToLower();
// normalize the keys going in
if (parts[0].Equals("pwd")) parts[0] = "password";
if (parts[0].Equals("uid")) parts[0] = "user id";
if (parts[0].Equals("initial catalog")) parts[0] = "database";
// we also want to clear off any quotes
// first trim off any space
parts[1] = parts[1].Trim();
String newvalue = parts[1].Trim( '\'' );
if (newvalue.Length == parts[1].Length)
{
newvalue = parts[1].Trim('"');
}
parts[1] = newvalue;
// make sure we don't get dupliate keys
if (dict.ContainsKey(parts[0]))
{
throw new ArgumentException("Duplicate key in connection string", parts[0]);
}
dict.Add( parts[0], parts[1] );
}
// now make sure we have some reasonable defaults for keys not present
if (! dict.ContainsKey("connection timeout"))
{
dict.Add("connection timeout", "15");
}
return dict;
}
}
}
-47
View File
@@ -1,47 +0,0 @@
using System;
using System.Data;
using System.Data.SqlTypes;
namespace ByteFX.Data.Common
{
/// <summary>
/// Summary description for Field.
/// </summary>
internal class Field
{
protected SqlDateTime m_DateTime;
protected SqlString m_StringValue;
protected SqlInt64 m_IntValue;
protected SqlDouble m_DoubleValue;
protected SqlSingle m_SingleValue;
protected SqlMoney m_MoneyValue;
protected SqlDecimal m_DecimalValue;
protected SqlBinary m_BinaryValue;
protected string m_TableName;
protected string m_ColName;
protected int m_ColLen;
protected DbType m_DbType;
protected bool m_HasValue;
public Field()
{
m_HasValue = false;
}
public string ColumnName
{
get { return m_ColName; }
}
public int ColumnLength
{
get { return m_ColLen; }
}
public string TableName
{
get { return m_TableName; }
}
}
}
@@ -1,76 +0,0 @@
using System;
namespace ByteFX.Data.Common
{
/// <summary>
/// Summary description for HuffmanTree.
/// </summary>
public class HuffmanTree
{
const int MAX_BITS = 15;
int[] codes;
public HuffmanTree(bool lit)
{
if (lit)
BuildLitTree();
else
BuildLenTree();
}
private void BuildLitTree()
{
codes = new int[288];
// fill the code slots with code lengths first
for (int x=0; x < 144; x++)
codes[x] = 8;
for (int x=144; x < 256; x++)
codes[x] = 9;
for (int x=256; x < 280; x++)
codes[x] = 7;
for (int x=280; x < 288; x++)
codes[x] = 8;
BuildTreeCommon();
}
private void BuildLenTree()
{
BuildTreeCommon();
}
private void BuildTreeCommon()
{
int[] codecounts = new int[MAX_BITS];
int[] codebase = new int[MAX_BITS];
for (int i = 0; i < codes.Length; i++)
{
int bit_len = codes[i];
if (bit_len > 0)
codecounts[bit_len]++;
}
// now we compute the intial value for each code length
int code = 0;
codecounts[0] = 0;
for (int bits = 1; bits <= MAX_BITS; bits++)
{
code = (code + codecounts[bits-1]) << 1;
codebase[bits] = code;
}
// next we assign numerical values to each code
for (int x=0; x <= codes.Length; x++)
{
if (codes[x] == 0) continue;
int blen = codes[x];
codes[x] = codebase[ blen ];
codebase[ blen ] ++;
}
}
}
}
-37
View File
@@ -1,37 +0,0 @@
using System;
using System.IO;
namespace ByteFX.Data.Common
{
/// <summary>
/// Summary description for Inflater.
/// </summary>
public class Inflater
{
private BitStream _input;
public Inflater()
{
}
public void SetInput(byte[] input, int offset, int len)
{
_input = new BitStream(input, offset, len);
}
public void Inflate(byte[] output, int offset, int size)
{
byte cmf = (byte)_input.GetBits(8);
byte flag = (byte)_input.GetBits(8);
if ((cmf & 0x0f) != 8)
throw new Exception("Only deflate format data is supported");
if (((cmf*256+flag) % 31) != 0)
throw new Exception("Data is not in proper deflate format");
}
}
}
@@ -1,208 +0,0 @@
// ByteFX.Data data access components for .Net
// Copyright (C) 2002-2003 ByteFX, Inc.
//
// This library is free software; you can redistribute it and/or
// modify it under the terms of the GNU Lesser General Public
// License as published by the Free Software Foundation; either
// version 2.1 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
// Lesser General Public License for more details.
//
// You should have received a copy of the GNU Lesser General Public
// License along with this library; if not, write to the Free Software
// Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA
using System;
using System.IO;
using System.Runtime.InteropServices;
namespace ByteFX.Data.Common
{
/// <summary>
/// Summary description for API.
/// </summary>
public class NamedPipeStream : Stream
{
[DllImport("kernel32.dll", EntryPoint="CreateFile", SetLastError=true)]
private static extern IntPtr CreateFile(String lpFileName,
UInt32 dwDesiredAccess, UInt32 dwShareMode,
IntPtr lpSecurityAttributes, UInt32 dwCreationDisposition,
UInt32 dwFlagsAndAttributes,
IntPtr hTemplateFile);
[DllImport("kernel32.dll", EntryPoint="PeekNamedPipe", SetLastError=true)]
private static extern bool PeekNamedPipe( IntPtr handle,
byte[] buffer, uint nBufferSize, ref uint bytesRead,
ref uint bytesAvail, ref uint BytesLeftThisMessage);
[DllImport("kernel32.dll", SetLastError=true)]
private static extern bool ReadFile( IntPtr handle,
byte[] buffer, uint toRead, ref uint read, IntPtr lpOverLapped);
[DllImport("kernel32.dll", SetLastError=true)]
private static extern bool WriteFile( IntPtr handle,
byte[] buffer, uint count, ref uint written, IntPtr lpOverlapped );
[DllImport("kernel32.dll", SetLastError=true)]
private static extern bool CloseHandle( IntPtr handle );
[DllImport("kernel32.dll", SetLastError=true)]
private static extern bool FlushFileBuffers( IntPtr handle );
//Constants for dwDesiredAccess:
private const UInt32 GENERIC_READ = 0x80000000;
private const UInt32 GENERIC_WRITE = 0x40000000;
//Constants for return value:
private const Int32 INVALID_HANDLE_VALUE = -1;
//Constants for dwFlagsAndAttributes:
private const UInt32 FILE_FLAG_OVERLAPPED = 0x40000000;
private const UInt32 FILE_FLAG_NO_BUFFERING = 0x20000000;
//Constants for dwCreationDisposition:
private const UInt32 OPEN_EXISTING = 3;
IntPtr _handle;
FileAccess _mode;
public NamedPipeStream(string host, FileAccess mode)
{
_handle = IntPtr.Zero;
Open(host, mode);
}
public void Open( string host, FileAccess mode )
{
_mode = mode;
uint pipemode = 0;
if ((mode & FileAccess.Read) > 0)
pipemode |= GENERIC_READ;
if ((mode & FileAccess.Write) > 0)
pipemode |= GENERIC_WRITE;
_handle = CreateFile( host, pipemode,
0, IntPtr.Zero, OPEN_EXISTING, 0, IntPtr.Zero );
}
public bool DataAvailable
{
get
{
uint bytesRead=0, avail=0, thismsg=0;
bool result = PeekNamedPipe( _handle,
null, 0, ref bytesRead, ref avail, ref thismsg );
return (result == true && avail > 0);
}
}
public override bool CanRead
{
get { return (_mode & FileAccess.Read) > 0; }
}
public override bool CanWrite
{
get { return (_mode & FileAccess.Write) > 0; }
}
public override bool CanSeek
{
get { throw new NotSupportedException("NamedPipeStream does not support seeking"); }
}
public override long Length
{
get { throw new NotSupportedException("NamedPipeStream does not support seeking"); }
}
public override long Position
{
get { throw new NotSupportedException("NamedPipeStream does not support seeking"); }
set { }
}
public override void Flush()
{
if (_handle == IntPtr.Zero)
throw new ObjectDisposedException("NamedPipeStream", "The stream has already been closed");
FlushFileBuffers(_handle);
}
public override int Read(byte[] buffer, int offset, int count)
{
if (buffer == null)
throw new ArgumentNullException("buffer", "The buffer to read into cannot be null");
if (buffer.Length < (offset + count))
throw new ArgumentException("Buffer is not large enough to hold requested data", "buffer");
if (offset < 0)
throw new ArgumentOutOfRangeException("offset", offset, "Offset cannot be negative");
if (count < 0)
throw new ArgumentOutOfRangeException("count", count, "Count cannot be negative");
if (! CanRead)
throw new NotSupportedException("The stream does not support reading");
if (_handle == IntPtr.Zero)
throw new ObjectDisposedException("NamedPipeStream", "The stream has already been closed");
// first read the data into an internal buffer since ReadFile cannot read into a buf at
// a specified offset
uint read=0;
byte[] buf = new Byte[count];
ReadFile( _handle, buf, (uint)count, ref read, IntPtr.Zero );
for (int x=0; x < read; x++)
{
buffer[offset+x] = buf[x];
}
return (int)read;
}
public override void Close()
{
CloseHandle(_handle);
_handle = IntPtr.Zero;
}
public override void SetLength(long length)
{
throw new NotSupportedException("NamedPipeStream doesn't support SetLength");
}
public override void Write(byte[] buffer, int offset, int count)
{
if (buffer == null)
throw new ArgumentNullException("buffer", "The buffer to write into cannot be null");
if (buffer.Length < (offset + count))
throw new ArgumentException("Buffer does not contain amount of requested data", "buffer");
if (offset < 0)
throw new ArgumentOutOfRangeException("offset", offset, "Offset cannot be negative");
if (count < 0)
throw new ArgumentOutOfRangeException("count", count, "Count cannot be negative");
if (! CanWrite)
throw new NotSupportedException("The stream does not support writing");
if (_handle == IntPtr.Zero)
throw new ObjectDisposedException("NamedPipeStream", "The stream has already been closed");
// copy data to internal buffer to allow writing from a specified offset
byte[] buf = new Byte[count];
for (int x=0; x < count; x++)
{
buf[x] = buffer[offset+x];
}
uint written=0;
bool result = WriteFile( _handle, buf, (uint)count, ref written, IntPtr.Zero );
if (! result)
throw new IOException("Writing to the stream failed");
if (written < count)
throw new IOException("Unable to write entire buffer to stream");
}
public override long Seek( long offset, SeekOrigin origin )
{
throw new NotSupportedException("NamedPipeStream doesn't support seeking");
}
}
}
-504
View File
@@ -1,504 +0,0 @@
GNU LESSER GENERAL PUBLIC LICENSE
Version 2.1, February 1999
Copyright (C) 1991, 1999 Free Software Foundation, Inc.
59 Temple Place, Suite 330, Boston, MA 02111-1307 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 Lesser GPL. It also counts
as the successor of the GNU Library Public License, version 2, hence
the version number 2.1.]
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 Lesser General Public License, applies to some
specially designated software packages--typically libraries--of the
Free Software Foundation and other authors who decide to use it. You
can use it too, but we suggest you first think carefully about whether
this license or the ordinary General Public License is the better
strategy to use in any particular case, based on the explanations below.
When we speak of free software, we are referring to freedom of use,
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 and use pieces of
it in new free programs; and that you are informed that you can do
these things.
To protect your rights, we need to make restrictions that forbid
distributors to deny you these rights or to ask you to surrender these
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 other code 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.
We protect your rights with a two-step method: (1) we copyright the
library, and (2) we offer you this license, which gives you legal
permission to copy, distribute and/or modify the library.
To protect each distributor, we want to make it very clear that
there is no warranty for the free library. Also, if the library is
modified by someone else and passed on, the recipients should know
that what they have is not the original version, so that the original
author's reputation will not be affected by problems that might be
introduced by others.
Finally, software patents pose a constant threat to the existence of
any free program. We wish to make sure that a company cannot
effectively restrict the users of a free program by obtaining a
restrictive license from a patent holder. Therefore, we insist that
any patent license obtained for a version of the library must be
consistent with the full freedom of use specified in this license.
Most GNU software, including some libraries, is covered by the
ordinary GNU General Public License. This license, the GNU Lesser
General Public License, applies to certain designated libraries, and
is quite different from the ordinary General Public License. We use
this license for certain libraries in order to permit linking those
libraries into non-free programs.
When a program is linked with a library, whether statically or using
a shared library, the combination of the two is legally speaking a
combined work, a derivative of the original library. The ordinary
General Public License therefore permits such linking only if the
entire combination fits its criteria of freedom. The Lesser General
Public License permits more lax criteria for linking other code with
the library.
We call this license the "Lesser" General Public License because it
does Less to protect the user's freedom than the ordinary General
Public License. It also provides other free software developers Less
of an advantage over competing non-free programs. These disadvantages
are the reason we use the ordinary General Public License for many
libraries. However, the Lesser license provides advantages in certain
special circumstances.
For example, on rare occasions, there may be a special need to
encourage the widest possible use of a certain library, so that it becomes
a de-facto standard. To achieve this, non-free programs must be
allowed to use the library. A more frequent case is that a free
library does the same job as widely used non-free libraries. In this
case, there is little to gain by limiting the free library to free
software only, so we use the Lesser General Public License.
In other cases, permission to use a particular library in non-free
programs enables a greater number of people to use a large body of
free software. For example, permission to use the GNU C Library in
non-free programs enables many more people to use the whole GNU
operating system, as well as its variant, the GNU/Linux operating
system.
Although the Lesser General Public License is Less protective of the
users' freedom, it does ensure that the user of a program that is
linked with the Library has the freedom and the wherewithal to run
that program using a modified version of the Library.
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, whereas the latter must
be combined with the library in order to run.
GNU LESSER GENERAL PUBLIC LICENSE
TERMS AND CONDITIONS FOR COPYING, DISTRIBUTION AND MODIFICATION
0. This License Agreement applies to any software library or other
program which contains a notice placed by the copyright holder or
other authorized party saying it may be distributed under the terms of
this Lesser 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 combine 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) Use a suitable shared library mechanism for linking with the
Library. A suitable mechanism is one that (1) uses at run time a
copy of the library already present on the user's computer system,
rather than copying library functions into the executable, and (2)
will operate properly with a modified version of the library, if
the user installs one, as long as the modified version is
interface-compatible with the version that the work was made with.
c) 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.
d) 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.
e) 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 materials to be 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 with
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 Lesser 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
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 Lesser General Public
License as published by the Free Software Foundation; either
version 2.1 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
Lesser General Public License for more details.
You should have received a copy of the GNU Lesser General Public
License along with this library; if not, write to the Free Software
Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 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!
-20
View File
@@ -1,20 +0,0 @@
./AssemblyInfo.cs
./Common/BitStream.cs
./Common/Connection.cs
./Common/ConnectionString.cs
./Common/Field.cs
./Common/HuffmanTree.cs
./Common/Inflater.cs
./Common/NamedPipeStream.cs
./mysqlclient/CommandBuilder.cs
./mysqlclient/Connection.cs
./mysqlclient/Driver.cs
./mysqlclient/Exception.cs
./mysqlclient/Field.cs
./mysqlclient/MysqlDefs.cs
./mysqlclient/command.cs
./mysqlclient/dataadapter.cs
./mysqlclient/datareader.cs
./mysqlclient/parameter.cs
./mysqlclient/parameter_collection.cs
./mysqlclient/transcaction.cs
Loaded 100 of 3035 files, more files were not shown because too many files have changed in this diff. Show more