Update of /cvsroot/monetdb/MonetDB4/src/monet
In directory sc8-pr-cvs16.sourceforge.net:/tmp/cvs-serv15343/src/monet
Modified Files:
monet.mx monet_interpreter.mx monet_multiplex.mx
monet_parse.mx monet_process.mx monet_tbl.mx yytree.mx
Log Message:
propagated changes of Sunday Feb 03 2008 - Friday Feb 08 2008
from the MonetDB_4-22 branch to the development trunk
Index: monet_tbl.mx
===================================================================
RCS file: /cvsroot/monetdb/MonetDB4/src/monet/monet_tbl.mx,v
retrieving revision 1.12
retrieving revision 1.13
diff -u -d -r1.12 -r1.13
--- monet_tbl.mx 11 Jan 2008 10:38:55 -0000 1.12
+++ monet_tbl.mx 8 Feb 2008 22:36:07 -0000 1.13
@@ -213,7 +213,6 @@
int TBL_readers = 0, TBL_writer = 0;
@- read-write locking
[EMAIL PROTECTED]
The function tables are concurrently read by the parser and (multiple)
interpreter threads. When modules are loaded/dropped or procedures
defined, the parser thread may also write these tables.
@@ -769,7 +768,6 @@
}
@- TBL_checkparams
[EMAIL PROTECTED]
This routine checks whether a set of actual parameters make a match
with the signature of a certain registered MIL operator. Signatures
are registered in the {\tt monet\_fcn\_pro} system BAT, which
@@ -1151,7 +1149,6 @@
@+ MIL Procedure Management
@- MIL Proc Ref counting
[EMAIL PROTECTED]
While MIL procs are typically introduced by MIL modules, they can be typed in
at anytime
in a MIL session (not belonging to any specific module). They are represented
as parsed
MIL trees, with their root in TBL\_fcn\_imp and shared in all client fcntbl-s.
As a consequence,
@@ -1782,7 +1779,6 @@
@- TBL_loadmod:
[EMAIL PROTECTED]
byuser == cinstalled to the client
\begin{verbatim}
loaded byuser level ACTION (in order!)
@@ -2463,7 +2459,6 @@
}
}
@- optimization check
[EMAIL PROTECTED]
The generic multiplex implementation fills an (argc,argv) array
of @%ValRecord@ structures before each tuple call. That tuple call
then reconstructs the original atomic values from its (argc,argv)
@@ -2730,7 +2725,6 @@
}
@- TBL_procreturn
[EMAIL PROTECTED]
We now allow the user to specify a procedure return value.
This does not add much functionality, but allows for an
extra check on a procedure return value (TBL\_procreturn).
Index: monet_parse.mx
===================================================================
RCS file: /cvsroot/monetdb/MonetDB4/src/monet/monet_parse.mx,v
retrieving revision 1.7
retrieving revision 1.8
diff -u -d -r1.7 -r1.8
--- monet_parse.mx 11 Jan 2008 10:38:55 -0000 1.7
+++ monet_parse.mx 8 Feb 2008 22:36:06 -0000 1.8
@@ -18,7 +18,6 @@
@a M. L. Kersten, P. Boncz
@* Parsing BAT algebra
[EMAIL PROTECTED]
We will discuss how BAT algebra is lexically analyzed with {\tt lex},
parsed with {\tt yacc}, and discuss the dunction table.
@@ -691,7 +690,6 @@
}
@- The YACC Grammar
[EMAIL PROTECTED]
A parse tree is built during parsing, such that a compact
representation for function calls result.
Index: monet.mx
===================================================================
RCS file: /cvsroot/monetdb/MonetDB4/src/monet/monet.mx,v
retrieving revision 1.9
retrieving revision 1.10
diff -u -d -r1.9 -r1.10
--- monet.mx 11 Jan 2008 10:38:55 -0000 1.9
+++ monet.mx 8 Feb 2008 22:36:06 -0000 1.10
@@ -15,8 +15,6 @@
@' All Rights Reserved.
@f monet
[EMAIL PROTECTED]
-% define titlepage
@t The Monet Database System
@v Version 4.2
@a Martin L. Kersten & Peter Boncz
@@ -35,7 +33,7 @@
showed that the overhead can be kept within acceptable limits.
Moreover, a textual interface reduces the programming
effort otherwise needed to develop test and application programs.
[EMAIL PROTECTED]
+
\begin{figure}[hbt]
\mbox{\hspace{120pt}\epsffile{monet.eps}}\\
\caption{The Monet Modules}
@@ -69,7 +67,7 @@
In the current implementation the following list of locks and semaphores
is used:
[EMAIL PROTECTED]
+
\begin{tabular}{|l | l | l |}\hline
Name & Used in & Protects\\
GDKthreadLock & GDKinit & {\em created }\\
@@ -110,7 +108,6 @@
& & {\em up to signal available requests}\\
\hline
\end{tabular}
[EMAIL PROTECTED]
\begin{verbatim}
Some conclusions:
- BBPcache is also used in BBPdummy, BBPexit, BBPcacheit
@@ -283,7 +280,6 @@
The listing flag is set automatically
when statements are read from a file.
The prompt character is printed each time @%Monet@ expects a new command.
[EMAIL PROTECTED]
\begin{itemize}
\item
A dataset within the database server can be selected with the {\tt
@@ -402,7 +398,7 @@
out = GDKout;
stream_printf(out, "# MonetDB Server v%s\n", monet_version);
stream_printf(out, "# based on GDK v%s\n", GDKversion());
- stream_printf(out, "# Copyright (c) 1993-2007, CWI. "
+ stream_printf(out, "# Copyright (c) 1993-2008, CWI. "
"All rights reserved.\n");
stream_printf(out, "# Compiled for %s/" SZFMT "bit with " SZFMT
"bit OIDs; %s linked.\n",
monet_arch, (size_t) (sizeof(ptr) * 8),
(size_t) (sizeof(oid) * 8), linkinfo);
@@ -594,7 +590,7 @@
@- Monet MIL Evaluation
Monet MIL execution made easy: you provide a mil string. It gets
executed and you get a pointer to the return value (a GDK atom) back.
[EMAIL PROTECTED]
+
Take good notice of the below points on return values:
\begin{itemize}
\item if there is no return value you get a NULL pointer back!
Index: monet_multiplex.mx
===================================================================
RCS file: /cvsroot/monetdb/MonetDB4/src/monet/monet_multiplex.mx,v
retrieving revision 1.8
retrieving revision 1.9
diff -u -d -r1.8 -r1.9
--- monet_multiplex.mx 11 Jan 2008 10:38:55 -0000 1.8
+++ monet_multiplex.mx 8 Feb 2008 22:36:06 -0000 1.9
@@ -1257,7 +1257,6 @@
}
@- Optimized Special Multiplex Operators
[EMAIL PROTECTED]
The following special multiplex operators are supported:
\begin{itemize}
\item {\tt ifthen(bit, val) -> (bit==true)?val:none}
@@ -1356,7 +1355,6 @@
}
@* Set Aggregate Implementation
[EMAIL PROTECTED]
Set aggregates are the MIL language construct
{\tt \{Y\}(bat-expr)}
that allow you to to interpret a
@@ -1387,7 +1385,7 @@
N calls to some operator that needs a unary BAT. When N is very large,
and the assembled BATs are small, the assembling and call-overhead
will be substantial.
[EMAIL PROTECTED]
+
Power users are therefore requested to overload their much-used set-
aggregates Y by {\tt \{Y\}()} user-defined commands that have the same
semantics.
@@ -1476,7 +1474,6 @@
(void) name;
@- argument check
[EMAIL PROTECTED]
The function can have two parameters. The first is obligatory, and contains
the {\tt bat[ht,tt]}. The second is the extent {\tt bat[ht,any]} and may
be omitted; in which case the operators are executed on all unique
Index: monet_process.mx
===================================================================
RCS file: /cvsroot/monetdb/MonetDB4/src/monet/monet_process.mx,v
retrieving revision 1.3
retrieving revision 1.4
diff -u -d -r1.3 -r1.4
--- monet_process.mx 11 Jan 2008 10:38:55 -0000 1.3
+++ monet_process.mx 8 Feb 2008 22:36:07 -0000 1.4
@@ -18,7 +18,6 @@
@a M. L. Kersten, P. Boncz
@* Monet Processes
[EMAIL PROTECTED]
The multi-threaded parallel implementation of Monet is geared towards
shared-memory multiprocessors only.
The single threaded code simply cycles through the queue until it becomes
empty.
Index: yytree.mx
===================================================================
RCS file: /cvsroot/monetdb/MonetDB4/src/monet/yytree.mx,v
retrieving revision 1.8
retrieving revision 1.9
diff -u -d -r1.8 -r1.9
--- yytree.mx 11 Jan 2008 10:38:56 -0000 1.8
+++ yytree.mx 8 Feb 2008 22:36:07 -0000 1.9
@@ -618,7 +618,7 @@
@- Tree-guided Garbage Collection
The Monet Interpreter (mis)uses the syntax tree structures to guide the
garbage collection process. This is because:
[EMAIL PROTECTED]
+
\begin{itemize}
\item {\em it is possible}. MIL has call-by value parameters. Only return
values are a problem, from the garbage collection point of view. Functions
Index: monet_interpreter.mx
===================================================================
RCS file: /cvsroot/monetdb/MonetDB4/src/monet/monet_interpreter.mx,v
retrieving revision 1.13
retrieving revision 1.14
diff -u -d -r1.13 -r1.14
--- monet_interpreter.mx 11 Jan 2008 10:38:55 -0000 1.13
+++ monet_interpreter.mx 8 Feb 2008 22:36:06 -0000 1.14
@@ -62,7 +62,7 @@
'signature bitstring'. This representation is specifically targeted to
providing signature equality checks at very high speed. This is achieved by
making sure the bit string can be compared as an array of 32-bit words.
[EMAIL PROTECTED]
+
The signatures contain, in a bit sequence, descriptions for all parameters.
Each parameter starts with a length field of 4 bits. This can encode
values between 0-13 (14/15 are the special values
MONETSIG\_BAT/MONETSIG\_BATCONST
@@ -836,7 +836,7 @@
@- MIL functor interpretation
Basic MIL functors with multiple parameters (builtins were handled separately
above). All of which may be string derefences ((*nme)(), {*nme}(), [*nme]())
[EMAIL PROTECTED]
+
When a functor-tree is inside a loop, it gets executed multiple times.
Evaluation of a MIL functor (be it a command, proc, set aggregate or multiplex)
needs to go through a phase of {\em function resolution}. This involves finding
-------------------------------------------------------------------------
This SF.net email is sponsored by: Microsoft
Defy all challenges. Microsoft(R) Visual Studio 2008.
http://clk.atdmt.com/MRT/go/vse0120000070mrt/direct/01/
_______________________________________________
Monetdb-checkins mailing list
[email protected]
https://lists.sourceforge.net/lists/listinfo/monetdb-checkins
