Merge lp:~drizzle-pbxt/drizzle/drizzle-pbxt-2 into lp:~drizzle-trunk/drizzle/development

[Paul McCullagh]

[Paul McCullagh (paul-mccullagh)]

This is the current merge of the PBXT storage engine into Drizzle (revision #1039). I re-merged (using to Stewart's method) after the move of the storage engines to the plugin directory, to ensure the entire PBXT change history is included.

So bazaar merging PBXT works on this tree. i.e. in the root directory:
bzr merge lp:pbxt
correctly merges the PBXT trunk into the plugin/pbxt directory.

I have also checked the following:

- Compiles and runs on Linux, Solaris and Mac OS.
- All tests run though using: ./dtr --engine=pbxt
- Compiles and runs without atomic ops if not supported.
- Performance (lp:~drizzle-developers/sysbench/trunk) also looks OK.

Let me know if anything is missing :)

[Stewart Smith (stewart)]

I got this for insert_update test (./dtr --engine=pbxt):

--- /home/stewart/drizzle/drizzle-pbxt-2/tests/r/pbxt/insert_update.result 2009-05-28 15:55:48.726957481 +1000
+++ /home/stewart/drizzle/drizzle-pbxt-2/tests/r/pbxt/insert_update.reject 2009-05-29 14:01:43.915086845 +1000
@@ -58,12 +58,12 @@
 8 9 60 NULL
 explain extended SELECT *, VALUES(a) FROM t1;
 id select_type table type possible_keys key key_len ref rows filtered Extra
-1 SIMPLE t1 ALL NULL NULL NULL NULL 5 100.00
+1 SIMPLE t1 ALL NULL NULL NULL NULL 7 100.00
 Warnings:
 Note 1003 select `test`.`t1`.`a` AS `a`,`test`.`t1`.`b` AS `b`,`test`.`t1`.`c` AS `c`,values(`test`.`t1`.`a`) AS `VALUES(a)` from `test`.`t1`
 explain extended select * from t1 where values(a);
 id select_type table type possible_keys key key_len ref rows filtered Extra
-1 SIMPLE t1 ALL NULL NULL NULL NULL 5 100.00 Using where
+1 SIMPLE t1 ALL NULL NULL NULL NULL 7 100.00 Using where
 Warnings:
 Note 1003 select `test`.`t1`.`a` AS `a`,`test`.`t1`.`b` AS `b`,`test`.`t1`.`c` AS `c` from `test`.`t1` where values(`test`.`t1`.`a`)
 DROP TABLE t1;

and

--- /home/stewart/drizzle/drizzle-pbxt-2/tests/r/pbxt/type_enum.result 2009-05-20 21:41:41.506953655 +1000
+++ /home/stewart/drizzle/drizzle-pbxt-2/tests/r/pbxt/type_enum.reject 2009-05-29 14:09:57.670984523 +1000
@@ -1776,7 +1776,7 @@
 c
 EXPLAIN SELECT a FROM t1 WHERE a=0;
 id select_type table type possible_keys key key_len ref rows Extra
-1 SIMPLE t1 ALL NULL NULL NULL NULL 4 Using where
+1 SIMPLE t1 ALL NULL NULL NULL NULL 6 Using where
 SELECT a FROM t1 WHERE a=0;
 a
 ALTER TABLE t1 ADD PRIMARY KEY (a);

apart from that, I vote for merging:
- doesn't touch core (apart from us having to reslove the sql_string
c_ptr() thing)
- test fixes are all okay.
- code is quite likely to be actively maintained

--
Stewart Smith

[Monty Taylor (mordred)]

Stewart Smith wrote:

>
> apart from that, I vote for merging:
> - doesn't touch core (apart from us having to reslove the sql_string
> c_ptr() thing)
> - test fixes are all okay.
> - code is quite likely to be actively maintained

I second this vote. I'm working on the c_ptr() thing anyway.

Monty

[Brian Aker (brianaker)]

Out of date (I did ask Paul to remerge)

review: Needs Resubmitting

[Paul McCullagh (paul-mccullagh)]

Hi Brian,

This work is currently in progress. I think we should have it done by the end of next week.

[Brian Aker (brianaker)]

Awesome!

Just tell me when... we should end up with spare time on our build
servers. Tell me when you need it pushed to them and we can see how
well it passes all of the build environments.

Cheers,
 -Brian

On Oct 27, 2009, at 4:12 PM, Paul McCullagh wrote:

> Hi Brian,
>
> This work is currently in progress. I think we should have it done
> by the end of next week.
>
> --
> https://code.launchpad.net/~drizzle-pbxt/drizzle/drizzle-pbxt-2/+merge/6822
> You are reviewing the proposed merge of lp:~drizzle-pbxt/drizzle/
> drizzle-pbxt-2 into lp:drizzle.

[lp:~drizzle-pbxt/drizzle/drizzle-pbxt-2]

1039. By Paul McCullagh on 2009-11-10

Merged Drizzle trunk and PBXT 1.0.09

1040. By Paul McCullagh on 2009-11-10

Changes required to compile PBXT for MySQL again

1041. By Padraig O'Sullivan on 2009-11-11

Merge trunk.

1042. By Padraig O'Sullivan on 2009-11-11

Changes required to compile PBXT with drizzle.

1043. By Padraig O'Sullivan on 2009-11-11

Updated the information_schema result file as it has changed due to the
extra I_S table that PBXT introduces.

1044. By Padraig O'Sullivan on 2009-11-11

Decided to update the information_schema test case to filter out PBXT
information schema tables in the queries. This way, we won't have to worry
about the output being different if the PBXT plugin has not been loaded.

1045. By Padraig O'Sullivan on 2009-11-11

Whoops, forgot to change renameTableImplementation to doRenameTable.

1046. By Paul McCullagh on 2009-11-11

Prototype corrections

1047. By Vladimir Kolesnikov on 2009-11-12

merge from work breanch

1048. By Vladimir Kolesnikov on 2009-11-13

fixed test-cases according to changes in drizzle

1049. By Vladimir Kolesnikov on 2009-11-16

a diff not related to PBXT

1050. By Vladimir Kolesnikov on 2009-11-16

added workaround for a test of DELETE IGNORE which is not currently supported by PBXT

1051. By Vladimir Kolesnikov on 2009-11-16

fixed resultset order

1052. By Vladimir Kolesnikov on 2009-11-18

merged Paul's fix from lp:pbxt rev.730

1053. By Vladimir Kolesnikov on 2009-11-18

more simple fixes

1054. By Vladimir Kolesnikov on 2009-11-18

added pbxt-specific action

1055. By Vladimir Kolesnikov on 2009-11-19

the original query plan can be forced by inserting more rows, but it doesn't test a storage engine's code

1056. By Vladimir Kolesnikov on 2009-11-19

explain differences mostly because of non-clustered indexes in pbxt vs innodb, better row count estimates

1057. By Vladimir Kolesnikov on 2009-11-19

changes similar to subselect.result

1058. By Vladimir Kolesnikov on 2009-11-19

added resultset ordering

1059. By Vladimir Kolesnikov on 2009-11-19

fixes similar to subselect.result

1060. By Vladimir Kolesnikov on 2009-11-19

fixes similar to subselect.result

1061. By Vladimir Kolesnikov on 2009-11-19

fixes similar to subselect.result

1062. By Vladimir Kolesnikov on 2009-11-19

added restulset ordering

1063. By Vladimir Kolesnikov on 2009-11-25

fixed a problem with key size for enums on drizzle side

Unmerged revisions

1063. By Vladimir Kolesnikov on 2009-11-25

fixed a problem with key size for enums on drizzle side

1062. By Vladimir Kolesnikov on 2009-11-19

added restulset ordering

1061. By Vladimir Kolesnikov on 2009-11-19

fixes similar to subselect.result

1060. By Vladimir Kolesnikov on 2009-11-19

fixes similar to subselect.result

1059. By Vladimir Kolesnikov on 2009-11-19

fixes similar to subselect.result

1058. By Vladimir Kolesnikov on 2009-11-19

added resultset ordering

1057. By Vladimir Kolesnikov on 2009-11-19

changes similar to subselect.result

1056. By Vladimir Kolesnikov on 2009-11-19

explain differences mostly because of non-clustered indexes in pbxt vs innodb, better row count estimates

1055. By Vladimir Kolesnikov on 2009-11-19

the original query plan can be forced by inserting more rows, but it doesn't test a storage engine's code

1054. By Vladimir Kolesnikov on 2009-11-18

added pbxt-specific action

=== modified file 'drizzled/field.h'
--- drizzled/field.h	2010-03-27 10:10:49 +0000
+++ drizzled/field.h	2010-04-01 14:19:35 +0000
@@ -65,7 +65,7 @@
 
 inline uint32_t get_enum_pack_length(int elements)
 {
-  return elements < 256 ? 1 : 2;
+  return elements < 256 ? 1 : 4;
 }
 
 /**

=== modified file 'drizzled/sql_bitmap.h'
--- drizzled/sql_bitmap.h	2010-02-04 08:14:46 +0000
+++ drizzled/sql_bitmap.h	2010-04-01 14:19:35 +0000
@@ -297,6 +297,14 @@
     return last_word_ptr;
   }
 
+  /**
+ *    * @return the last word mask for this bitmap
+ *       */
+  my_bitmap_map getLastWordMask() const
+  {
+    return last_word_mask;
+  }
+
   void addMaskToLastWord() const
   {
     *last_word_ptr|= last_word_mask;

=== modified file 'drizzled/sql_string.h'
--- drizzled/sql_string.h	2010-02-05 08:11:15 +0000
+++ drizzled/sql_string.h	2010-04-01 14:19:35 +0000
@@ -93,11 +93,21 @@
   inline const char *ptr() const { return Ptr; }
   inline char *c_ptr()
   {
+    if (!Ptr || Ptr[str_length])		/* Should be safe */
+      (void) realloc(str_length);
+/* This code crashes or overwrites the buffer if 
+ * str_length > Alloced_length,
+ * which can happen if the buffer is not allocated at
+ * all (Alloced_length == 0)!
     if (str_length == Alloced_length)
       (void) realloc(str_length);
     else
       Ptr[str_length]= 0;
+<<<<<<< TREE
 
+=======
+*/
+>>>>>>> MERGE-SOURCE
     return Ptr;
   }
   inline char *c_ptr_quick()

=== modified file 'drizzled/table_share.h'
--- drizzled/table_share.h	2010-03-26 19:56:34 +0000
+++ drizzled/table_share.h	2010-04-01 14:19:35 +0000
@@ -327,6 +327,7 @@
     max_rows= arg;
   }
 
+<<<<<<< TREE
   /**
    * Returns true if the supplied Field object
    * is part of the table's primary key.
@@ -344,6 +345,19 @@
   }
 
   TableIdentifier::Type tmp_table;
+=======
+  inline uint32_t getAvgRowLength()
+  {
+    return (table_proto) ? (table_proto->options().has_avg_row_length() ? table_proto->options().avg_row_length() : 0) : 0;
+  }
+
+  drizzled::plugin::StorageEngine *storage_engine;			/* storage engine plugin */
+  inline drizzled::plugin::StorageEngine *db_type() const	/* table_type for handler */
+  {
+    return storage_engine;
+  }
+  enum tmp_table_type tmp_table;
+>>>>>>> MERGE-SOURCE
 
   uint32_t ref_count;       /* How many Table objects uses this */
   uint32_t getTableCount()

=== modified file 'plugin/innobase/lock/lock0lock.c'
--- plugin/innobase/lock/lock0lock.c	2009-11-09 06:31:17 +0000
+++ plugin/innobase/lock/lock0lock.c	2010-04-01 14:19:35 +0000
@@ -4878,6 +4878,7 @@
 				LOCK_GAP type locks from the successor
 				record */
 {
+	rec_t*		nc_rec;
 	const rec_t*	next_rec;
 	trx_t*		trx;
 	lock_t*		lock;
@@ -4892,7 +4893,12 @@
 	}
 
 	trx = thr_get_trx(thr);
+<<<<<<< TREE
 	next_rec = page_rec_get_next_const(rec);
+=======
+	nc_rec = (rec_t *)rec;
+	next_rec = page_rec_get_next(nc_rec);
+>>>>>>> MERGE-SOURCE
 	next_rec_heap_no = page_rec_get_heap_no(next_rec);
 
 	lock_mutex_enter_kernel();

=== added directory 'plugin/pbxt'
=== added file 'plugin/pbxt/AUTHORS'
--- plugin/pbxt/AUTHORS	1970-01-01 00:00:00 +0000
+++ plugin/pbxt/AUTHORS	2010-04-01 14:19:35 +0000
@@ -0,0 +1,4 @@
+Paul McCullagh
[e-mail]
+http://www.primebase.org
+http://pbxt.blogspot.com

=== added file 'plugin/pbxt/COPYING'
--- plugin/pbxt/COPYING	1970-01-01 00:00:00 +0000
+++ plugin/pbxt/COPYING	2010-04-01 14:19:35 +0000
@@ -0,0 +1,340 @@
+		    GNU GENERAL PUBLIC LICENSE
+		       Version 2, June 1991
+
+ Copyright (C) 1989, 1991 Free Software Foundation, Inc.
+     51 Franklin Street, Fifth Floor, Boston, MA  02110-1301  USA
+ Everyone is permitted to copy and distribute verbatim copies
+ of this license document, but changing it is not allowed.
+
+			    Preamble
+
+  The licenses for most software are designed to take away your
+freedom to share and change it.  By contrast, the GNU General Public
+License is intended to guarantee your freedom to share and change free
+software--to make sure the software is free for all its users.  This
+General Public License applies to most of the Free Software
+Foundation's software and to any other program whose authors commit to
+using it.  (Some other Free Software Foundation software is covered by
+the GNU Library General Public License instead.)  You can apply it to
+your programs, too.
+
+  When we speak of free software, we are referring to freedom, not
+price.  Our General Public Licenses are designed to make sure that you
+have the freedom to distribute copies of free software (and charge for
+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 software, or if you modify it.
+
+  For example, if you distribute copies of such a program, whether
+gratis or for a fee, you must give the recipients all the rights that
+you have.  You must make sure that they, too, receive or can get the
+source code.  And you must show them these terms so they know their
+rights.
+
+  We protect your rights with two steps: (1) copyright the software, and
+(2) offer you this license which gives you legal permission to copy,
+distribute and/or modify the software.
+
+  Also, for each author's protection and ours, we want to make certain
+that everyone understands that there is no warranty for this free
+software.  If the software is modified by someone else and passed on, we
+want its recipients to know that what they have is not the original, 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 redistributors of a free
+program will individually obtain patent licenses, in effect making the
+program proprietary.  To prevent this, we have made it clear that any
+patent must be licensed for everyone's free use or not licensed at all.
+
+  The precise terms and conditions for copying, distribution and
+modification follow.
+

+		    GNU GENERAL PUBLIC LICENSE
+   TERMS AND CONDITIONS FOR COPYING, DISTRIBUTION AND MODIFICATION
+
+  0. This License applies to any program or other work which contains
+a notice placed by the copyright holder saying it may be distributed
+under the terms of this General Public License.  The "Program", below,
+refers to any such program or work, and a "work based on the Program"
+means either the Program or any derivative work under copyright law:
+that is to say, a work containing the Program or a portion of it,
+either verbatim or with modifications and/or translated into another
+language.  (Hereinafter, translation is included without limitation in
+the term "modification".)  Each licensee is addressed as "you".
+
+Activities other than copying, distribution and modification are not
+covered by this License; they are outside its scope.  The act of
+running the Program is not restricted, and the output from the Program
+is covered only if its contents constitute a work based on the
+Program (independent of having been made by running the Program).
+Whether that is true depends on what the Program does.
+
+  1. You may copy and distribute verbatim copies of the Program's
+source code as you receive it, in any medium, provided that you
+conspicuously and appropriately publish on each copy an appropriate
+copyright notice and disclaimer of warranty; keep intact all the
+notices that refer to this License and to the absence of any warranty;
+and give any other recipients of the Program a copy of this License
+along with the Program.
+
+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 Program or any portion
+of it, thus forming a work based on the Program, 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) You must cause the modified files to carry prominent notices
+    stating that you changed the files and the date of any change.
+
+    b) You must cause any work that you distribute or publish, that in
+    whole or in part contains or is derived from the Program or any
+    part thereof, to be licensed as a whole at no charge to all third
+    parties under the terms of this License.
+
+    c) If the modified program normally reads commands interactively
+    when run, you must cause it, when started running for such
+    interactive use in the most ordinary way, to print or display an
+    announcement including an appropriate copyright notice and a
+    notice that there is no warranty (or else, saying that you provide
+    a warranty) and that users may redistribute the program under
+    these conditions, and telling the user how to view a copy of this
+    License.  (Exception: if the Program itself is interactive but
+    does not normally print such an announcement, your work based on
+    the Program is not required to print an announcement.)
+

+These requirements apply to the modified work as a whole.  If
+identifiable sections of that work are not derived from the Program,
+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 Program, 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 Program.
+
+In addition, mere aggregation of another work not based on the Program
+with the Program (or with a work based on the Program) on a volume of
+a storage or distribution medium does not bring the other work under
+the scope of this License.
+
+  3. You may copy and distribute the Program (or a work based on it,
+under Section 2) in object code or executable form under the terms of
+Sections 1 and 2 above provided that you also do one of the following:
+
+    a) 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; or,
+
+    b) Accompany it with a written offer, valid for at least three
+    years, to give any third party, for a charge no more than your
+    cost of physically performing source distribution, a complete
+    machine-readable copy of the corresponding source code, to be
+    distributed under the terms of Sections 1 and 2 above on a medium
+    customarily used for software interchange; or,
+
+    c) Accompany it with the information you received as to the offer
+    to distribute corresponding source code.  (This alternative is
+    allowed only for noncommercial distribution and only if you
+    received the program in object code or executable form with such
+    an offer, in accord with Subsection b above.)
+
+The source code for a work means the preferred form of the work for
+making modifications to it.  For an executable work, 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 executable.  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.
+
+If distribution of executable or 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 counts as
+distribution of the source code, even though third parties are not
+compelled to copy the source along with the object code.
+

+  4. You may not copy, modify, sublicense, or distribute the Program
+except as expressly provided under this License.  Any attempt
+otherwise to copy, modify, sublicense or distribute the Program 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.
+
+  5. 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 Program or its derivative works.  These actions are
+prohibited by law if you do not accept this License.  Therefore, by
+modifying or distributing the Program (or any work based on the
+Program), you indicate your acceptance of this License to do so, and
+all its terms and conditions for copying, distributing or modifying
+the Program or works based on it.
+
+  6. Each time you redistribute the Program (or any work based on the
+Program), the recipient automatically receives a license from the
+original licensor to copy, distribute or modify the Program 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.
+
+  7. 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 Program at all.  For example, if a patent
+license would not permit royalty-free redistribution of the Program 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 Program.
+
+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.
+

+  8. If the distribution and/or use of the Program is restricted in
+certain countries either by patents or by copyrighted interfaces, the
+original copyright holder who places the Program 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.
+
+  9. The Free Software Foundation may publish revised and/or new versions
+of the General Public License from time to time.  Such new versions will
+be similar in spirit to the present version, but may differ in detail to
+address new problems or concerns.
+
+Each version is given a distinguishing version number.  If the Program
+specifies 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 Program does not specify a version number of
+this License, you may choose any version ever published by the Free Software
+Foundation.
+
+  10. If you wish to incorporate parts of the Program into other free
+programs whose distribution conditions are different, 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
+
+  11. BECAUSE THE PROGRAM IS LICENSED FREE OF CHARGE, THERE IS NO WARRANTY
+FOR THE PROGRAM, TO THE EXTENT PERMITTED BY APPLICABLE LAW.  EXCEPT WHEN
+OTHERWISE STATED IN WRITING THE COPYRIGHT HOLDERS AND/OR OTHER PARTIES
+PROVIDE THE PROGRAM "AS IS" WITHOUT WARRANTY OF ANY KIND, EITHER EXPRESSED
+OR IMPLIED, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF
+MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE.  THE ENTIRE RISK AS
+TO THE QUALITY AND PERFORMANCE OF THE PROGRAM IS WITH YOU.  SHOULD THE
+PROGRAM PROVE DEFECTIVE, YOU ASSUME THE COST OF ALL NECESSARY SERVICING,
+REPAIR OR CORRECTION.
+
+  12. 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 PROGRAM AS PERMITTED ABOVE, BE LIABLE TO YOU FOR DAMAGES,
+INCLUDING ANY GENERAL, SPECIAL, INCIDENTAL OR CONSEQUENTIAL DAMAGES ARISING
+OUT OF THE USE OR INABILITY TO USE THE PROGRAM (INCLUDING BUT NOT LIMITED
+TO LOSS OF DATA OR DATA BEING RENDERED INACCURATE OR LOSSES SUSTAINED BY
+YOU OR THIRD PARTIES OR A FAILURE OF THE PROGRAM TO OPERATE WITH ANY OTHER
+PROGRAMS), EVEN IF SUCH HOLDER OR OTHER PARTY HAS BEEN ADVISED OF THE
+POSSIBILITY OF SUCH DAMAGES.
+
+		     END OF TERMS AND CONDITIONS
+

+	    How to Apply These Terms to Your New Programs
+
+  If you develop a new program, and you want it to be of the greatest
+possible use to the public, the best way to achieve this is to make it
+free software which everyone can redistribute and change under these terms.
+
+  To do so, attach the following notices to the program.  It is safest
+to attach them to the start of each source file to most effectively
+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 program's name and a brief idea of what it does.>
+    Copyright (C) <year>  <name of author>
+
+    This program is free software; you can redistribute it and/or modify
+    it under the terms of the GNU General Public License as published by
+    the Free Software Foundation; either version 2 of the License, or
+    (at your option) any later version.
+
+    This program is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+    GNU General Public License for more details.
+
+    You should have received a copy of the GNU General Public License
+    along with this program; if not, write to the Free Software
+    Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA  02110-1301  USA
+
+
+Also add information on how to contact you by electronic and paper mail.
+
+If the program is interactive, make it output a short notice like this
+when it starts in an interactive mode:
+
+    Gnomovision version 69, Copyright (C) year  name of author
+    Gnomovision comes with ABSOLUTELY NO WARRANTY; for details type `show w'.
+    This is free software, and you are welcome to redistribute it
+    under certain conditions; type `show c' for details.
+
+The hypothetical commands `show w' and `show c' should show the appropriate
+parts of the General Public License.  Of course, the commands you use may
+be called something other than `show w' and `show c'; they could even be
+mouse-clicks or menu items--whatever suits your program.
+
+You should also get your employer (if you work as a programmer) or your
+school, if any, to sign a "copyright disclaimer" for the program, if
+necessary.  Here is a sample; alter the names:
+
+  Yoyodyne, Inc., hereby disclaims all copyright interest in the program
+  `Gnomovision' (which makes passes at compilers) written by James Hacker.
+
+  <signature of Ty Coon>, 1 April 1989
+  Ty Coon, President of Vice
+
+This General Public License does not permit incorporating your program into
+proprietary programs.  If your program is a subroutine library, you may
+consider it more useful to permit linking proprietary applications with the
+library.  If this is what you want to do, use the GNU Library General
+Public License instead of this License.

=== added file 'plugin/pbxt/ChangeLog'
--- plugin/pbxt/ChangeLog	1970-01-01 00:00:00 +0000
+++ plugin/pbxt/ChangeLog	2010-04-01 14:19:35 +0000
@@ -0,0 +1,801 @@
+PBXT Release Notes
+==================
+
+------- 1.0.09e RC3 - Not released yet
+
+RN283: Fixed bug that cause the error "[ERROR] Invalid (old?) table or database name 'mysqld.1'", when running temp_table.test under MariaDB (thanks to Monty for his initial bug fix).
+
+RN282: Added win_inttypes.h to the distribution. This file is only required for the Windows build.
+
+RN281: Fixed bug #451101: jump or move depends on uninitialised value in myxt_get_key_length
+
+RN280: Fixed bug #451080: Uninitialised memory write in XTDatabaseLog::xlog_append
+
+RN279: Fixed bug #451085: jump or move depends on uninitialised value in my_type_to_string
+
+RN278: Fixed bug #441000: xtstat crashes with segmentation fault on startup if max_pbxt_threads exceeded.
+
+------- 1.0.09d RC3 - 2009-09-30
+
+RN277: Added r/o flag to pbxt_max_threads server variable (this fix is related to bug #430637)
+
+RN276: Added test case for replication on tables w/o PKs (see bug #430716)
+
+RN275: Fixed bug #430600: 'Failed to read auto-increment value from storage engine' error.
+
+RN274: Fixed bug #431240: This report is public edit xtstat fails if no PBXT table has been created. xtstat now accepts --database=information_schema or --database=pbxt. Depending on this setting PBXT will either use the information_schema.pbxt_statistics or the pbxt.statistics table. If information_schema is used, then the statistics are displayed even when no PBXT table exists. Recovery activity is also displayed, unless pbxt_support_xa=1, in which case MySQL will wait for PBXT recovery to complete before allowing connections. 
+
+RN273: Fixed bug #430633: XA_RBDEADLOCK is not returned on XA END after the transacting ended with a deadlock.
+
+RN272: Fixed bug #430596: Backup/restore does not work well even on a basic PBXT table with auto-increment.
+
+------- 1.0.09c RC3 - 2009-09-16
+
+RN271: Windows build update: now you can simply put the pbxt directory under <mysql-root>/storage and build the PBXT engine as a part of the source tree. The engine will be linked statically. Be sure to specify the WITH_PBXT_STORAGE_ENGINE option when running win\configure.js
+
+RN270: Correctly disabled PBMS so that this version now compiles under Windows. If PBMS_ENABLED is defined, PBXT will not compile under Windows becaause of a getpid() call in pbms.h.
+
+------- 1.0.09 RC3 - 2009-09-09
+
+RN269: Implemented online backup. A native online backup driver now performs BACKUP and RESTORE DATABASE operations for PBXT. NOTE: This feature is only supported by MySQL 6.0.9 or later.
+
+RN268: Implemented XA support. PBXT now supports all XA related MySQL statements. The variable pbxt_support_xa determines if XA support is enabled. Note: due to MySQL bug #47134, enabling XA support could lead to a crash. 
+
+------- 1.0.08d RC2 - 2009-09-02
+
+RN267: Fixed a bug that caused MySQL to crash on shutdown, after an incorrect command line parameter was given. The crash occurred because the background recovery task was not cleaned up before the PBXT engine was de-initialized.
+
+------- 1.0.08c RC2 - 2009-08-18
+
+RN266: Updated BLOB streaming glue, used with the PBMS engine. The glue code is now identical to the version of "1.0.08-rc-pbms" version of PBXT available from http://blobstreaming.org/download.
+
+RN265: Changes the sequential reading of data log files to skip gaps, instead of returning EOF. This ensures that extended data records are preserved even when something goes wrong with the way the file is written.
+
+RN264: Fixed a bug that cased an "Data log not found" error after an out of disk space error on a log file. This bug is similar to RN262 in that it allows "gaps" to appear in the data logs.
+
+RN263: Updated xtstat to compile on Windows/MS Visual C++.
+
+RN262: Merged changes for PBMS version 0.5.09.
+
+RN261: Concerning bug #377788: Cannot find index for FK. Fixed buffer overflow which occurred when the error was reported.
+
+RN260: Fixed bug #377788: Cannot find index for FK. PBXT now correctly uses prefix of an index to support FK references (e.g. if key = (c1, c2) then an index on (c1, c2, c3) will work). Also fixed buffer overflow, which occurred when reporting the error.
+
+RN259: Fixed bug #309424: xtstat doesn't use my.cnf. You can now add an [xtstat] section to my.cnf, for use with xtstat.
+
+RN258: updated xt_p_join implementation for Windows to check if a thread has already exited or has not yet started
+
+RN257: Removed false assertion that could fail during restore if a transaction log page was zero-filled
+
+RN256: Update datalog eof pointer only if write opearions were sucessful
+
+RN255: Added re-allocation of of filemap if allocating the of the new map failed. This often happens if there's not enough space on disk.
+
+RN254: When a table with a corrupted index is detected, PBXT creates a file called 'repair-pending' in the pbxt directory, with the name of the table in it. Each table in the file is listed on a line by itself (the last line has no trailing \n). When the table is repaired (using the REPAIR TABLE command), this entry is removed from the file.
+
+RN253: Use fcntl(F_FULLFSYNC) instead of fsync on platforms that support it. Improper fsync operation was presumably the reason of index corruption on Mac OS X.
+
+RN252: Fixed bug #368692: PBXT not reporting data size correctly in information_schema.
+
+------- 1.0.08 RC2 - 2009-06-30
+
+RN251: A Windows-specific test update, also removed false assertion that failed on Windows.
+
+RN250: Fixed a bug that caused recovery to fail when the transaction log ID exceeded 255. The problem was a checksum failed in the log record.
+
+RN249: Fixed bug #313176: Test case timeout. This happened because record cache pages where not properly freed and as soon as cache filled up the performacne degraded.
+
+RN248: PBXT now compiles and runs with MySQL 5.1.35. All tests pass.
+
+RN247: Fixed bug #369086: Incosistent/Incorrect Truncate behavior
+
+RN246: Fixed bug #378222: Drop sakila causes error: Cannot delete or update a parent row: a foreign key constraint fails
+
+RN245: Fixed bug #379315: Inconsistent behavior of DELETE IGNORE and FK constraint.
+
+RN244: Fixed a recovery problem: during the recovery of "record modified" action the table was updated before the old index entries were removed; then the xres_remove_index_entries was supplied the new record which lead to incorrect index update.
+
+RN243: Fixed a bug that caused a recovery failure if partitioned pbxt tables where present. This happended because the recovery used a MySQL function to open tables and the PBXT handler was not yet registered
+
+RN242: Fixed a bug that caused a deadlock if pbxt initialization failed. This happened because pbxt ceanup was done from pbxt_init() with PLUGIN_lock being held by MySQL which lead to a deadlock in the freeer thread
+
+RN241: Fixed a heap corruption bug (writing to a freed memory location). It happened only when memory mapped files were used leading to heap inconsistency and program crash or termination by heap checker. Likely to happen right after or during DROP TABLE but possible in other cases too.
+
+RN240: Load the record cache on read when no using memory mapped files.
+
+RN239: Added PBXT variable pbxt_max_threads. This is the maximum number of threads that can be created PBXT. By default this value is set to 0 which means the number of threads is derived from the MySQL variable max_connections. The value used is max_connections+7. Under Drizzle the default value is 500.
+
+RN238: Added an option to wait for the sweeper to clean up old transactions on a particular connection. This prevents the sweeper from getting too far behind.
+
+RN237: Added an option to lazy delete fixed length index entries. This means the index entries are just marked for deletion, instead of removing the items from the index page. This has the advantage that an exclusive lock is not always required for deletion.
+
+RN236: Fixed bug #349177: a bug in configure.in script.
+
+RN235: Fixed bug 349176: a compiler warning.
+
+RN234: Completed Drizzle integration. All Drizzle tests now run with PBXT.
+
+RN233: Fixed bugs which occur when PBXT is used together with PBMS (BLOB Streaming engine).
+
+RN232: Merged Drizzle-specific changes into the main tree.
+
+RN231: Fixed a bug that caused bad performance as the number of threads increased. This occurred when the number of open table handles exceeded 'table_open_cache', and MySQL started closing open table handlers. PBXT was flushing a table when all table handlers were closed. PBXT will now only do this when the FLUSH TABLES statement is used.
+
+RN230: Improved efficiency of conflict resolution: Implemented a queue for threads waiting for a lock. Threads no longer poll to take a lock. If a temp lock is granted because of an update, then the thread granted the temp lock will also wait for the transaction that did the update to quit.
+
+RN229: Fixed bug #313391: LOAD DATA ... REPLACE broken.
+
+RN228: Fixed bug #341115: 'Out of memory' error (a bug in key comparison algorithm).
+
+RN227: Changed conflict handling to use spin locks and improve efficiency.
+
+RN226: Fixed bug #340316: Issue with bigint unsigned auto-increment field.
+
+RN225: Fixed bug #308557: UPDATE fails to match all rows in a transactional scenario.
+
+RN224: Fixed a deadlock which could occur during table scans.
+
+RN223: Index scans now use handles to cache buffers instead of making a copy of the index page. The handles are "copy-on-write".
+
+RN222: Fixed a bug that caused the server to hang on startup if PBXT ran out of record cache while waiting for the sweeper to complete.
+
+RN221: Fixed an index recovery bug. This occurred if the server crashed after operating in low index cache sitations. 
+
+RN220: Improved index selectivity estimation: added scanning from the end of index backwards.
+
+RN219: Fixed a problem: during intersected range scan not all fields were returned by engine to MySQL.
+
+RN218: Changed the way row locking (used by SELECT FOR UPDATE) works. Previously we locked a group of rows at once (although there were many groups). However, this caused conflicts even when the same rows were not locked. We now locks individual rows.
+
+RN217: Fixed bug #315564: Rollbacked inserts remain permanently in table.
+
+RN216: Added lock tracing. In DEBUG mode, each thread has a list of locks (semaphores, mutexes, r/w locks that it holds).
+
+RN215: Fixed a bug that caused a crash during restart if an index file was flushed during recovery.
+
+RN214: Fixed bug #310184: Deadlock when trying to wake up transactions
+
+RN213: Fixed an index corruption bug on SPARC Solaris. Note this error will occur on any machine that does not use the x86 (little endian) byte order.
+
+------- 1.0.07 RC - 2008-12-15
+
+RN212: Fixed build problems on NetBSD.
+
+RN211: Fixed build problems on FreeBSD.
+
+RN210: Fixed build problems on OpenSolaris.
+
+RN209: Added handling of the foreign_key_checks system flag.
+
+RN208: xtstat will now automatically reconnect if the connection to server is lost. 
+
+RN207: Foreign key references are now checked on CREATE TABLE.
+
+RN206: Fixed a crash if inserting into a table that has an FK that references a column that has no index on it.
+
+RN205: Added processing of foreign key action SET DEFAULT.
+
+RN204: Fixed an index recovery problem: unswept index entries were not recovered correctly 
+
+RN203: Fixed foreign key bug: REPLACE fails with 'on delete cascade'
+
+RN202: Fixes and updates to tests, now all tests pass on windows and linux.
+
+RN201: Fixed ref-counting for mmapped files.
+
+RN200: Fixed an index recovery problem: unswept index entries were not recovered correctly .
+
+RN199: Recovery now takes place on plug-in startup. Previously recovery occurred when the first PBXT table was accessed.
+
+RN198: Fixed a recovery bug that caused index entries to get out of sync with the data file.
+
+RN197: Improved the efficiency of group commit.
+
+RN196: Changed checkpointing so that it now works during idle time. Every record, row or index file fllush now also contributes to the checkpoint (fuzzy checkpointing). Checkpointing is forced to complete after about 50% of the checkpoint threshold in order to ensure the correct maximum for log reading on recovery.
+
+RN195: Fixed scheduling bug that caused sweeper to get behind with the cleanup, which caused performance problems in high conflict situations. Foreground threads will now wait if the sweeper gets too far behind.
+
+RN194: Created the xtstat program which monitors the internal performance of PBXT. Run xtstat --help for more details information of the output. 
+
+RN193: Implemented the pbxt.statistics virtual table. The statistics table returns information about the internal activity of the engine. This includes I/O byte counts, cache hit counts and usage, commit count, etc. 
+
+RN192: Due to timing issues in the engine API it could happen that the client received an OK for a committed transaction before the transaction was actually committed. This problem has been fixed.
+
+RN191: Fixed a bug that caused a hang when conflicts occured while reading a covering index.
+
+RN190: Previously the sweeper delayed deletion of transaction structures until all transactions that were running during sweeping have quit. This is now handled by the same code that fixed the bug in RN189.
+
+RN189: Fixed a bug that could cause a row to go missing due to a visibility issue.
+
+RN188: Fixed a bug which ocurred when using CREATE TABLE ... AVG_ROW_LENGTH=x, and the table contained BLOBs. In this case, alter table corrupted the table.
+
+RN187: Windows now stores paths in the location file in UNIX format by converting all '\' characters to '/'. Note that the location file is only cross-platform if the paths are relative (which is the default).
+
+RN186: Set version number to 1.0.07.
+
+------- 1.0.06 Beta 2 - 2008-11-06
+
+RN185: Disabled support for INSERT DELAYED because of MySQL bug #40505
+
+RN184: Implemented info(flag == HA_STATUS_AUTO) engine API call. This call returns the next value that will be assigned as auto-increment value on the table.
+
+RN183: Turned off streaming on Windows (see XT_STREAMING macro in sources)
+
+RN182: Switch code base to the latest version of BLOB streaming engine (PBMS): www.blobstreaming.org.
+
+RN181: Updated pbxt-test-run default parameters (--force is on, --default-storage-engine is pbxt, --base-dir is set according to config)
+
+RN180: PBXT can now cope with a missing .xti file (the file that contains the table indexes). This file can be regenerated using REPAIR TABLE.
+
+RN179: On recovery PBXT now creates a filed called 'recovery-progress' in the pbxt database. The recovery percentage complete is written to this file as recovery progresses. Note that this file will not be created if no recoery is necessary or if PBXT estimates that it will read less then 10MB to do recovery.
+
+RN178: Fixed a problem in CHECK TABLE that caused memory corruption for fixed-size records
+
+RN177: Added "crash debugging". When enabled, crash debugging does the following:
+  - Create a core dump on Windows if the server crashes.
+  - Make a backup copy of the datadir directory before recovery if the server crashes.
+  - Keep at least 5 of the previous transaction logs.
+Currently crash debugging is disabled by default. To disable, create a file called 'no-debug' in the pbxt database folder, and restart the server. When crash debugging is disabled by default, it can be enabled by creating a file called 'crash-debug; in the pbxt database folder.
+
+RN176: Fixed a bug: a lock was not released appropriately
+
+RN175: Fixed some debug assertions
+
+RN174: Fixed some of test/mysql-test tests
+
+RN173: Fixed a RENAME TABLE bug, that prevented index files from being properly recreated
+
+RN172: Added the file ./pbxt/lock-pid. This file is locked while the server is running, and  contains the process of the server. PBXT will return an error on startup if the file is locked or the process is still running in order to prevent a second server from being started.
+
+RN171: Implemented the AVG_ROW_LENGTH table attribute. When set, this value determines the size of the fixed length data component of a record. Normally this size is estimated depending on the column definitions. The command CHECK TABLE dumps the current average row length to the log. This can be used to find a suitable value for AVG_ROW_LENGTH.
+
+RN170: Changed configure so that debug/optimize flags set for building the engine override the flags set for MySQL. If --with-debug is not specified, then the engine will use the flags set when building MySQL. If MySQL was built with --with-debug=full, the DEBUG will be defined for the engine. When building the engine, the following flags can be set:
+  yes  - Debug symbols enabled, no optimization, DEBUG not defined.
+  full - Debug symbols enabled, no optimization, DEBUG defined.
+  only - Debug symbols enabled, MySQL flags used, DEBUG not defined.
+  prof - Profile code enabled, optimization on, DEBUG not defined.
+  no   - No debug symbols, optimization on, DEBUG not defined.
+
+RN169: Used MySQL root Makefile instead of config.status in order to extract settings (such as CFLAGS and CXXFLAGS) for the PBXT build.
+
+RN168: Fixed Windows build after merging changes for Drizzle.
+
+RN167: Fixed "This table requires primary key" error in sql-bench.
+
+RN166: Fixed threading problems that caused crashes in sql-bench.
+
+RN165: Added sql-bench to pbxt source tree.
+
+RN164: Ported PBXT to Drizzle. To compile for Drizzle DRIZZLED must be defined on the command line. The -drz.am and -drz.in files are must be used when PBXT is embedded in Drizzle.
+
+RN163: Added "make test" build step. Running "make test" from the root of pbxt source tree will launch test/mysql-test/pbxt-test-run.pl with appropriate options to execute the pbxt functional test suite. On Windows where 
+pbxt is statically linked into mysql server binary pbxt testing works by going to test/mysql-test directory and running ./pbxt-test-run.pl with --base-dir argument pointing to a mysql source tree (mysql binaries are taken 
+from there) and passing the rest of usual arguments (--force --mysqld=--default-storage-engine=pbxt) 
+
+RN162: The 'pbxt' database must now be dropped explicitly. It is automatically created when the first PBXT table is created. After that, the pbxt database can be dropped once all PBXT tables have been dropped. Dropping the pbxt database will also cause all transaction (pbxt/system directory) and data logs (pbxt/data directory) to also be deleted.
+
+RN161: Added pbxt.location system table. This table can only be dropped when all PBXT tables have been deleted. Dropping the system table will cause all transaction (pbxt/system directory) and data logs (pbxt/data directory) to also be deleted.
+
+RN160: Made changes to run with MySQL 6.0.6.
+
+RN159: Changes to configure: added --with-plugindir=<path>, which should be used to specify the plugin directory. This means that --libdir should no longer be used. For backwards compatibility configure will still recognize this options if the path ends with 'plugin'.
+
+Also updated --help, to include all options, and better desciptions of the options.
+
+The configure options are now as follows:
+
+--with-mysql=<path> - (Required) It specifies the path to the MySQL source tree. The source should already be built. All other options will be taken from the MySQL build by default.
+--with-debug=yes/no - (Optional) Specify if then engine should be built with different debug options to the MySQL source tree.
+--with-plugindur=<path> - (Optional) Specify an alternative installation directory for the plugin. By default it will be installed in the plugin directory of the MySQL installation.
+
+
+RN158: Added support for core dumps on Windows. This can be enabled by defining XT_COREDUMP. On by default at the moment. If the server crashes a file called PBXTCore00000001.dmp will be created in the data directory. This file can be openned using MS VS.
+
+RN157: Fixed a compile problem with tv_nsec which is not supported on all platforms.
+
+RN156: Updated tests to run with MySQL 5.1.28.
+
+RN155: Errors during cascade update of VARCHAR values with trailing spaces
+
+RN154: Fixed a bug: impossible to create a foreign key that referenced an ENUM or SET column
+
+RN153: Fixed a bug that caused the following problems: #1. Foreign keys: crash if update cascade and autocommit=0 #2. Foreign keys: crash if update cascade and multi-level recursion
+
+RN152: Fixed missing information about foreign keys in I_S.table_constraints and I_S.referential_constraints
+
+------- 1.0.05 Beta - 2008-08-30
+
+RN151: "Quick config": It is now possible to configure the engine by just specifying the mysql source code tree (the --with-mysql option). The --libdir and --with-debug setting will be deduced automatically. 
+
+RN150: Added system variable pbxt_sweeper_priority, 0 = low (default), 1 = normal (same as user threads), 2 = high. The sweeper cleans up deleted records (deleted records also result from an update). If allowed to accumulate, these records can slow searches. Higher priority for the sweeper is recommended on systems with 4 or more cores.  
+
+RN149: Record cleanup is now initiated if a deleted record is found, and the transaction that deleted the record has ended. Since waking up the sweeper is an expensive operation, normally the sweeper will run every 1/10th of a second.
+
+RN148: Fixed a bug which caused transaction starvation (one transaction was constantly locked out) during high conflict updates. This lead to cleanup of records not being done, which lead to a general slow down.
+
+RN147: Fixed a problem with TRUNCATE TABLE: a failed TRUNCATE TABLE could put the engine into an invalid state that later caused a crash
+
+RN146: Fixed a bug that caused the error: "-49: Record format unknown, either corrupted or upgrade required".
+
+RN145: Added pbxt_db_offline_log_function system variable, 0 = recycle logs (default), 1 = delete logs (default on Mac OS X), 2 = keep logs.
+
+------- 1.0.04 Alpha - 2008-08-02
+
+RN144: Completed port and testing of Windows version.
+
+RN143: Fixed a bug which caused the free-er thread to hang. This was a result of an invalid operation ID, which was the result of the checkpointer flushing the table at the same time as a foreground thread.
+
+RN142: The fast RW/mutex lock can now handle nested calls. This is possible during a sequential scan.
+
+RN141: The normal behavior in MySQL is that an auto-increment values will be re-issued if you delete the row containing the current maximum auto-increment value and then restart the server. To prevent this you can use ALTER TABLE my_table AUTO_INCREMENT = <current-max-auto-increment> + 1, before deleting the current maximum auto-increment value.
+
+A new system variable, pbxt_auto_increment_mode, has been added so that this work around is not necessary. When set to 0 (the default), auto-increment works as described above. When set to 1, the AUTO_INCREMENT value of the table is automatically to prevent previously issued auto-increment values being returned.
+
+However, if the server crashes, a gap of up to 100 unique values can result, because the table AUTO_INCREMENT value is incremented in steps of 100.
+
+RN140: Index statistics are now automatically recalculated when the table row count exceeds 200. 
+
+RN139: Fixed a bug that caused index corruption, error: "int idx_push(index_xt.cc:172) -2: Core B-tree too deep".
+
+RN138: Handle startup and recovery when an index is corrupted.
+
+RN137: Fixed a bug in the zero wait R/W lock that caused the lock to fail (the state is extremely volatile, and must be written to memory after increment).
+
+RN136: Fixed a bug that cause the error "int xt_pwrite_file(filesys_xt.cc:789) errno (14): Bad address".
+
+RN135: Fixed TRUNCATE TABLE that did not work correctly when the table contained BLOBs stored in the BLOB streaming engine (www.blobstreaming.org).
+
+RN134: Fixed a bug that caused duplicate rows to be returned from an index scan (using a SELECT FOR UPDATE) if a concurrent update was done.
+
+RN133: Optimised PBXT for multi-processor scale-up. This mostly involved using different types of locks instead of the standard pthread mutex and reader/writer locks [TODO: 0038].
+
+------- 1.0.03 Alpha - 2008-05-30
+
+RN132: Fixed bug when using PBXT in conjunction with the BLOB streaming engine (www.blobstreaming.org). Uploaded BLOBs could not be inserted into a table.
+
+RN131: Fixed wait for background processes on shutdown. Shutdown will wait a maximum of 16 seconds for each process.
+
+RN130: Fixed calculation of bytes to be read for recovery.
+
+RN129: Fixed bug in cleanup of unterminated transactions.
+
+RN128: The writer will now start working when one of the following is true:
+- it is time for a checkpoint,
+- the log cache is almost full,
+- the free'er is waiting for the writer,
+- there is no other activity.
+
+RN127: Fixed checkpoint frequency. Checkpointing is now done correctly after 'pbxt_checkpoint_frequency' bytes.
+
+RN126: Implemented index consistent write [TODO: 0050].
+
+RN125: Implemented memory mapping for row pointer (.xtr) and handle data files (.xtd).
+
+RN124: Index files now use direct I/O.
+
+------- 1.0.02 Alpha - 2008-04-25
+
+RN123: Fixed compile errors with MySQL 5.1.24.
+
+------- 1.0.01 Alpha - 2008-03-28
+
+RN122: ++++ NOTE: This version is not compatible with older versions of PBXT ++++.
+
+RN121: Transaction logs are now global so that multi-database statements are now possible. This makes it also possible to work PBXT temporary tables.
+
+RN120: Transaction logs pre-allocated and recycled.
+
+RN119: Transaction log writes on 512 byte boundaries only.
+
+------- 1.0.00 Alpha - 2008-03-10
+
+This version has alpha status because of the large number of changes done for full durability.
+
+RN118: ++++ NOTE: This version is incompatible to older versions of PBXT ++++.
+
+RN117: Documentation now avaliable at http://www.primebase.org/documentation.
+
+RN116: Corrected the plug.in file so that PBXT compiles when dropped into the storage directory in the MySQL source tree.
+
+RN115: Compiled and tested with MySQL 5.1.23.
+
+RN114: Increased index block size. Minimum is now 4K. Default is 16K.
+
+RN113: Calculate index selectivity to return a more accurate value from records_in_range(). NOTE: FLUSH TABLESl will update the index statistics, after data has been inserted or updated.
+
+RN112: Optimized table storage, saving 8 bytes per row.
+
+RN111: Optimized search on keys containing 2 or 3 not null integer values.
+
+RN110: Optimization: store the row ID in the index so that an index entry can be verified as current without loading the record. This is necessary to optimize an access with index coverage.
+
+RN109: Optimization: only load the record extended data if required.
+
+RN108: Implemented SHOW ENGINE PBXT STATUS;
+
+RN107: Added the following system variables:
+
+pbxt_index_cache_size - The amount of memory allocated to the index cache, used only to cache index data
+pbxt_record_cache_size - The amount of memory allocated to the record cache used to cache table data
+pbxt_log_cache_size - The amount of memory allocated to the transaction log cache used to cache on transaction log data
+pbxt_log_file_threshold - The size of a transaction log before rollover, and a new log is created
+pbxt_transaction_buffer_size - The size of the global transaction log buffer (the engine allocates 2 buffers of this size)
+pbxt_log_buffer_size - The size of the buffer used to cache data from transaction and data logs during sequential scans, or when writing a data log
+pbxt_checkpoint_frequency - The amount of data written to the transaction log before a checkpoint is performed
+pbxt_data_log_threshold - The maximum size of a data log file
+pbxt_garbage_threshold - The percentage of garbage in a data log file before it is compacted
+
+RN106: PBXT now compiles for MySQL 6.0.3.
+
+RN104: Updates now locks a record temporarily. This prevents most "record changed" errors, however, it makes UPDATE statements a type of "committed read". This means that you may update a different value to that which you selected in repeatable read mode. To avoid this, use SELECT FOR UPDATE if you plan to UPDATE records after reading.
+
+RN103: Implemented SELECT FOR UPDATE. This is implemented by turning SELECT FOR UPDATE into a type of "committed read". This means that, if you do a SELECT followed by a SELECT FOR UPDATE you can get different results, even in repeatable read mode.
+
+RN102: Implemented recovery of index entries. Note: indexes are not yet fully consistent. This means that index can become currupted due to a crash. Data, however, cannot be lost. The indices can be rebuild using REPAIR TABLE.
+
+RN101: Writing and flushing of a single transaction write-ahead log.
+
+RN100: Automatic rollover of transaction logs as they become full.
+
+RN99: Implementation of the transaction log cache.
+
+RN98: Group commit.
+
+RN97: Implementation of the writer thread that applies changes in the transaction log to the database.
+
+RN96: Implementation of the checkpointer thread that periodically flushes the database and writes a checkpoint which determines the recovery start point.
+
+RN95: Implementation of the free'er thread that is responsible for keeping the record cache at a preset level.
+
+RN94: Modifications to the record cache so that rows are stored in pages, in order to speed up sequence access.
+
+RN93: Implemented the recovery process which applies changes written to the log that are not in the database, on startup.
+
+RN92: Modification of the sweeper thread which cleans up rolled-back transactions and deleted data, to use the new transaction log format.
+
+RN91: Modifications to the data logs so that they use the same record structure as the transaction logs.
+
+RN90: The data logs are now managed "per database" in order to minimize the work done to flush and commit a transaction.
+
+RN89: Implementation of a file handle pool for the data logs.
+
+------- 0.9.91 Beta - 2007-10-30
+
+RN88: The format of the URL genearated by MyBS has been changed. The format of the BLOB URLs is now as follows:
+
+'~*' <db-name> '/' <type-char> <table-id> '-' <blob-id> '-' <access-code> '-' <server-id>
+
+Where <type-char> is '_' or '~'.
+
+Examples: ~*test/_11-128-fbd590b-0, ~*test/~1-524-3dc45b09-0
+
+In other words, the characters '>' has been replace by '*', '^' has been replace by '_' and ':' has been replace by '~'. The reason for this is that the characters '>' and '^' are not allowed in URLs, and must be URL-encoded. The character ':' is reserved, but allowed.
+
+NOTE: This change makes this version incompatible with previous versions of MyBS. If you have a table with BLOB URLs, you can upgrade the URLs as follows:
+
+UPDATE blob_table SET blob_col = REPLACE(REPLACE(blob_col, '~>', '~*'), '/:', '/~');
+
+Replacing '^' is not necessary because BLOB URLs with '^' should not appear in tables. 
+
+------- 0.9.90 Beta - 2007-10-17
+
+RN87: Corrected stack trace of errors passed through the BLOB streaming API.
+
+RN86: Added new engine API accessor functions that appeared in 5.1.21 (thanks Stewart).
+
+RN85: Added plug.in file. PBXT now compiles when dropped into the storage directory of the MySQL build tree. However, you have rebuild configure. For example:
+
+rm -rf autom4te.cache/
+aclocal
+autoconf
+autoheader
+automake -a
+./configure --help
+./configure --with-plugins=max --without-innodb --prefix=/usr/local/mysql --with-debug=full
+
+NOTE: ./configure --help should show that the PBXT has been included.
+
+RN84: Fixed several problems with shutdown of PBXT in combiniation with MyBS.
+
+------- 0.9.89 Beta - 2007-08-17
+
+RN83 (2007-08-21): Fixed a crash due to a compile bug that does not like the contruct *((xtWordPS *) &(v)) = (xtWordPS) (x) (macro allocr_() and alloczr_()).
+
+RN82: It is now possible to insert non-URL values into a LONGBLOB field, in the previous version the generated an "Invalid URL" error. Such values can be retrieved as a stream using a field reference.
+
+RN81: Fixed a bug that caused PBXT to crash during certina operations when MyBS was not installed.
+
+RN80: Set engine as capable of row-level replication, but not as statement replication. Statement replication does not work because MVCC is not serializable.
+
+------- 0.9.88 Beta - 2007-07-25
+
+RN79: Made some corrections in order to compile with MySQL 5.1.20.
+
+RN78: Support for the features of the MyBS BLOB Streaming engine, version 0.5 Alpha.
+
+RN77: Bugfix: The server crashes during BLOB data handling. The reason is the table field structure is shared, and may not be changed.
+
+------- 0.9.87 Beta - 2007-06-19
+
+RN76: The major feature of this release is support for the BLOB Streaming Engine. The current version enables the download of specific BLOB columns via the Streaming Engine. For example:
+
+use test;
+CREATE TABLE notes_tab (
+  n_id        INTEGER PRIMARY KEY,
+  n_text      BLOB
+) ENGINE=pbxt;
+INSERT notes_tab VALUES (1, "This is a BLOB streaming test!");
+
+The URL:
+
+http://localhost:8080/test/notes_tab/n_text/n_id=1
+
+will return the value "This is a BLOB streaming test!"
+
+RN75: Bugfix: MySQL prints error: "Plugin 'PBXT' will be forced to shutdown". This error was caused by the plug-in having a reference to itself.
+
+RN74: Added system variable pbxt_index_cache_size and pbxt_record_cache_size. These variable can now be set on the mysqld command line (for example: --pbxt_record_cache_size=50MB). The values are also displayed by SHOW VARIABLES.
+
+------- 0.9.86 Beta - 2007-04-07
+
+RN74: ++++ NOTE: This version is incompatible to older versions of PBXT ++++.
+
+In order to upgrade, install the older version of PBXT. Convert all tables to MyISAM using ALTER TABLE t1 ENGINE=MyISAM. Then install the new version of PBXT and convert back using ALTER TABLE t1 ENGINE=PBXT.
+
+RN73: Each table will now use a maximum of 4 data log files. This means a maximum of 7 files per table. The minimum is 3 for tables that do not have a variable field that exceeds about 40 bytes in size. This means that under Linux PBXT requires a maximum of 7 file handles per table used. Windows lock of pread/pwrite (atomic seek and read/write) functions means it requires a file handler per file per open table handler. [TODO: 0044]
+
+RN72: All threads now write to the same data log file. Recovery and compaction take this fact into account. Each thread still writes its own transaction log.
+
+RN71: Removed all directory scans when creating and dropping table. Increased the table limit to 10000.
+
+RN70: Changed locking to avoid a deadlock when TRUNCATE TABLE is used together with other DML.
+
+RN69: procedures and functions are now considered atomic, and execute in a single transaction.
+
+RN68: Bug fixed: all files are now correctly flushed before commit.
+
+------- 0.9.85 Beta - 2007-03-15
+
+RN67: Changed the implementation of the pushsr_ and allocr_ macros because "*((void **) &(v) = " caused a crash due to a compiler error on some platforms (thanks Luciano for your help on this one and RN66).
+
+RN66: Fixed a bug that caused PBXT to corrupt the index file when the size exceeded 4GB. [TODO: 0031]
+
+RN65: PBXT now runs under Windows. This source tree must be placed in the MySQL source storage directory in order to compile. Further details of how to build are in the windows-readme.txt file. [TODO: 0027]
+
+RN64: Improved speed of table lookup by ID after a table has been deleted. The sweeper needs to ignore these records. Scanning the directory each time was too slow.
+
+RN63: Added checking for repeat update of a record in a statement.
+
+RN62: Committed read no longer blocks due to a change made by another transaction (the XT_REPEATABLE_READ_BLOCKS define, turns blocking on).
+
+RN61: Avoid checking for duplicates if an index is not modified by an update.
+
+RN60: Records updated repeatedly by a transaction are now updated in place. [TODO: 0040]
+
+------- 0.9.8 Beta - 2007-01-30
+
+RN59: Reduced the number of file handles used to a maximum of one per file. This assumes that pread() and pwrite() allows multiple threads to use the same file handle (according to my tests, this is the case).
+
+RN58: Added the configure flag --with-debug=only which compiles a version of the plug-in with debug symbols that will link to an non-debug MySQL server.
+
+RN57: Changed error number returned on lock from 1205 (lock timeout) to 1020 (optimistic lock failure).
+
+RN56: Added UNIX environment variable for PBXT system parameters. These must be set before starting mysqld, for example:
+
+setenv pbxt_index_cache_size 400MB
+setenv pbxt_record_cache_size "1 GB"
+
+Values are in bytes unless one of the following units is specified: GB, MB, Kb
+
+RN55: Fixed a bug which prevented VARCHAR values from being compressed correctly when stored in variable length rows.
+
+RN54: Fixed a bug which caused a crash when PBXT was used with MySQL 5.1.14. This bug also caused data to be corrupted on insert.
+
+RN53: Set query caching mode to transactional. [TODO: 0027]
+
+RN52: Added conditions so that the engine compiles with MySQL 5.1.14 and 5.1.13.
+
+------- 0.9.74 Beta - 2006-12-14
+
+RN51: DELETE FROM <table>; is no longer implemented by  re-creating the table. This statement now works by deleting all rows. TRUNCATE is implemented as before, by re-creating the table.
+
+RN50: The test scripts innodb.test and innodb-mysql.test have been modified to run with PBXT.
+
+RN49: [TODO: 0020] Implemented foreign keys. Functionality is identical to InnoDB with 2 exceptions:
+
+* Data types of referenced columns must be an exact match (e.g. you cannot mix VARCHAR and CHAR values).
+* Currently an exact matching index is required on referenced columns (i.e. the index may not have more columns that the columns used in the foreign key definition).
+
+Also note the following:
+
+* It is possible to create foreign keys that reference non-existent tables or columns. An error will occur when updating a table with an incorrect foreign key declaration.
+* If you alter the data-type of a column referenced by a foreign key set you need to set foreign_key_checks=0; or an error will occur.
+
+RN48: Fixed a bug in the implementation of indexes on ENUM and SET types.
+
+RN47: Fixed a bug that caused a crash when an index was place on a BLOB column, and data was retrieved from the index directly.
+
+------- 0.9.73 Beta - 2006-10-31
+
+RN46: Updated test scripts to run with MySQL 5.1.13.
+
+------- 0.9.72 Beta - 2006-10-19
+
+RN45: Corrected compilation errors that occurred due to a change to struct st_mysql_plugin.
+
+------- 0.9.71 Beta - 2006-10-04
+
+RN44: Corrected compilation errors that occurred due to changes in the storage engine API.
+
+------- 0.9.7 Beta - 2006-09-20
+
+RN43: This is the first Beta release of PrimeBase XT. It has been integrated into MySQL 4.1.21 and is available as a plug-in for MySQL 5.1.12, or later. This version has been extensively tested using mysql-test-run, on various Linux and Mac OS X platforms.
+
+RN42: ++++ NOTE: This version is incompatible to older versions of PBXT ++++. Files created by older versions cannot be opened by version 0.9.7.
+
+RN41: Renaming or deleting a table while using a name with different case to the original created name did not work.
+
+RN40: Fixed a bug when grouping and searching on indexed columns that contain a null.
+
+RN39: Fixed bugs related to trailing spaces on VARCHAR values. Values that only vary by the number of trailing spaces (for example "aa" and "aa "), are now correctly handled as identical.
+
+RN38: The default AUTO_INCREMENT value was not correctly preserved during ALTER TABLE.
+
+RN37: Created a MySQL 5.1 Plugin version of PBXT. [TODO: 0017]
+
+RN36: Fixed a race condition in the row cache which had the affect that inserted rows dissappeared after cleanup because the cache was out of date. I was only able to reproduce this error on multi-processor machines.
+
+------- 0.9.6 - 2006-08-05
+
+RN35: ++++ NOTE: This version is incompatible to older versions of PBXT ++++.
+
+The disk format of tables and log files has changed slightly in this version. As a result, files created by older versions cannot be opened by version 0.9.6. An error will be generated. If you have data wish to preserve, first start the older version of XT and convert all tables to MyISAM. The stop the server and removed all transaction log file (files of the form xtlog-*.xt). Then start the new version and convert tables back to XT.
+
+RN34: Implemented READ COMMITTED transaction mode. XT now supports READ COMMITTED and SERIALIZABLE transaction modes. NOTE: if the mode is set to REPEATABLE READ, SERIALIZABLE is used. If the mode is set to READ UNCOMMITTED READ COMMITTED is used.
+
+RN33: The implementation of AUTO_INCREMENT on a paritial index is non-standard. A unique value is generated without regard to the value of the index prefix. For example, assume we have the following table: CREATE TABLE t1 (c1 CHAR(10) not null, c2 INT not null AUTO_INCREMENT, PRIMARY KEY(c1, c2));
+
+With the following contents:   c1 c2
+                               A  8
+                               B  1
+
+After executing the following statement: insert into t1 (c1) values ('B');
+
+This is the result using PBXT: c1 c2
+                               A  8
+                               B  1
+                               B  9
+
+The standard result would be:  c1 c2
+                               A  8
+                               B  1
+                               B  2
+
+RN32: PBXT does not permit access to multiple databases within a single transaction. For example:
+
+begin;
+update database_1.t1 set a=10;
+update database_2.t2 set d=10;
+commit;
+
+In this case the following error is returned: 1015: Can't lock file (errno: -1)
+
+RN31: The implementation of COUNT(*) has changed. For effectiency, rows are not counted. The information is taken from the header of the record (.xtr) files. This information is only 100% accurate after transaction cleanup has completed. Which basically means, only when PBXT is idle. ANALYZE TABLE waits for all background activity to stop, so the statement may be executed before a COUNT(*) to ensure an accurate result. NOTE: Other then waiting for background processes, ANALYSE TABLE is not implemented.
+
+RN30: Two concurrency bugs have been fixed: a shared lock was used instead of an exclusive lock when deleting from a transaction list, the transaction segment semaphore was not initialized. XT now runs correctly in a multi-processor environment. The test used was sysbench on a dual-process, dual-core, AMD 64-bit machine running SUSE Linux 10.0.
+
+RN29: PBXT compiles and runs on under 64-bit Lunix. [TODO: 0009]
+
+RN28: ./mysql-test-run --force --mysqld=--default-storage-engine=pbxt will now execute most tests successfully. Changes to the tests and the result have been documented in http://www.primebase.com/xt/download/pbxt-test-run-changes.txt. [TODO: 0004, 0019]
+
+RN27: Fixed a bug that caused the server to crash if when using tables locks and transactions. For example: LOCK TABLES, BEGIN, COMMIT, SELECT. This sequence now returns an error. The correct sequence is:
+
+LOCK TABLES, BEGIN, COMMIT, UNLOCK TABLES, SELECT
+or
+LOCK TABLES, BEGIN, COMMIT, BEGIN, SELECT COMMIT, UNLOCK TABLES
+
+RN26: Fixed a concurrency problem which caused a number of threads to hang during the sysbench test - see RN30 above (bug reported by Vadim).
+
+RN25: Fixed a bug that caused the server to hang when ha_pbxt::create() and ha_pbxt::ha_open() where given different, but equivalent paths for a particular table.
+
+RN24: Fixed bug in the indexing of blob columns, for example: create table t1(name_id int, name blob, INDEX name_idx (name(5)));
+
+RN23: When a duplicate key error occurs in auto-commit mode, the transaction is now rolled back.
+
+RN22: Fixed incorrect duplicate key error. In the case of a unique key which allows NULLs, duplicates are allowed if the inserted key contains a NULL. For example:
+
+create table t1 (id int not null, str char(10), unique(str));
+insert into t1 values (1, null),(2, null),(3, "foo"),(4, "bar");
+
+RN21: PBXT now returns the correct error code on duplicate key: 1062 instead of 1022.
+
+RN19: Implemented AUTO_INCREMENT on partial keys. However, the XT implementation is non-standard. Increment of partial index works, but the ID generated is incremented like a non-partial index. For example:
+
+create table t1 (c1 char(10) not null, c2 int not null auto_increment, primary key(c1, c2));
+select * from t1;
+c1 c2
+A  8
+B  1
+
+insert into t1 (c1) values ('B');
+select * from t1;
+c1 c2
+A  8
+B  1
+B  9
+
+The standard result would be:
+c1 c2
+A  8
+B  1
+B  2
+
+RN18: Implemented TRUNCATE TABLE and DELETE FROM <table>; (i.e. a DELETE without WHERE clause). Previously DELETE FROM <table>; did not cause an error, but no rows where deleted (TRUNCATE TABLE returned an error). [TODO: 0012, 0022]
+
+RN17: Implemented CREATE TABLE (...) auto_increment=<value>;
+
+------- 0.9.51 - 2006-07-06
+
+RN16: Fixed crash which could occur when creating the first table in a database (bug reported by Hakan). 
+
+------- 0.9.5 - 2006-07-03
+
+RN15: This version concludes the re-structuring of the PBXT implementation. I have made a number of major changes, including:
+
+- All files except the transaction logs are now associated with a particular table. All table related files begin with the name of the table. The extension indicates the function. 
+
+- I have merged the handle and the fixed length row data for performance reasons.
+
+- Only the variable size component of a row is stored in the data log files. As a result the data logs can now be considered as a type of "overflow" area.
+
+- Memory mapped files are no longer used because it is not possible to flush changes to the disk.
+
+RN14: File names have the following forms:
+
+[table-name]-[table-id].xtr - These files contains the table row pointers. Each row pointer occupies 8 bytes and refers to a list of records. The file name also contains the table ID. This is a unique number which is used internally by XT to identify the table. 
+
+[table-name].xtd - This file contains the fixed length data of a table. Each data item includes a handle and a record. The handle references a record in the data log file if the table contains variable length records.
+
+[table-name].xti - This file contains the index data of the table.
+
+[table-name]-[log-id].xtl - This is a data log file. It contains the variable length data of the table. A table may have any number of data log files, each with a unique ID.
+
+xtlog-[log-id].xt - These files are the transaction logs. Log entries that specify updates reference a data file record. Each active thread has its own transaction log in order to avoid contension.
+
+RN13: Fixed the bug "Hang on DROP DATABASE". [TODO: 0016] 
+
+RN12: PBXT currently only supports the "Serializable" transaction isolation level. This is the highest isolation level possible and includes the "repeatable-read" functionality [TODO: 0015]. This is implemented by giving every transaction a snapshot of the database at the point when the transaction is started.
+
+If the transaction tries to update a record that was updated by some other transaction after the snapshot was taken, a locked error is returned. A deadlock can occur if 2 transactions update the same record in a different order. PBXT can detect all deadlocks.
+
+RN11: I have implemented write buffering on the table data files. [TODO: 0013]
+
+RN10: The unique constraint (UNIQUE INDEX/PRIMARY KEY) is now checked correctly. [TODO: 0008]
+
+RN9: I have implemented a conventional B-tree algorithm for the indices (instead of the Lehman and Yoa B*-link tree). Although this reduces concurrency it improves the performance of queries significantly because of the simplicity of the algorithm. Deletion is also implemented in a very simple manner. [TODO: 0007]
+
+RN8: PBXT now has only 2 caches [TODO: 0006]:
+
+The Index Cache (pbxt_index_cache_size): This is the amount of memory the PBXT storage engine uses to cache index data and row pointers. This is all the data in the files with the extensions '.xti' and '.xtr'. This cache is managed in blocks of 2K.
+
+The Record Cache (pbxt_record_cache_size): This is the amount of memory the PBXT storage engine uses to cache table row data (handles and records). This is all the data in the files with the extension '.xtd'.
+
+The size of the caches are determined by the values of the system variables pbxt_index_cache_size and pbxt_row_cache_size. By default these values are set to 32MB.
+
+RN7: Auto-increment is now implemented in memory. This is done by doing a MAX() select when a table is first opened to get the high value. After that, then high value is incremented in memory on INSERT. On UPDATE (or INSERT) the value in memory is adjusted if necessary. This method also makes it possible for rows to be inserted simultaneously on the same table. [TODO: 0005, 0014]
+
+RN6: ./run-all-tests --create-options=TYPE=PBXT succeeds. [TODO: 0004]
+
+RN5: Using sql-bench and my own Java based test I have confirmed that PBXT behaves correctly during multi-threaded access. [PARTIALY TODO: 0002]
+
+RN4: Load/Stability test. Using sql-bench I have tested PBXT under load over a long period of time. [PARTIALY TODO: 0001]
+
+------- 0.9.2 - 2006-04-01
+
+RN3: Fixed a bug that cause the error "-6: Handle is out of range: [0:0]".
+
+RN2: Implemented SET, ENUM and YEAR data types.
+
+RN1: Fixed a bug in the error reporting when a table is created with a datatype that is not supported. [TODO: 0011]
+
+

=== added file 'plugin/pbxt/Makefile.am'
--- plugin/pbxt/Makefile.am	1970-01-01 00:00:00 +0000
+++ plugin/pbxt/Makefile.am	2010-04-01 14:19:35 +0000
@@ -0,0 +1,3 @@
+SUBDIRS = src
+
+EXTRA_DIST = plug.ini

=== added file 'plugin/pbxt/NEWS'
=== added file 'plugin/pbxt/README'
--- plugin/pbxt/README	1970-01-01 00:00:00 +0000
+++ plugin/pbxt/README	2010-04-01 14:19:35 +0000
@@ -0,0 +1,19 @@
+PrimeBase XT for MySQL 5.1
+==========================
+
+This is the PrimeBase XT (PBXT) transactional storage engine for MySQL. PBXT is "pluggable", which means that it can be loaded dynamically by MySQL at runtime. It uses a unique "write-once" update strategy and MVCC (multi-version concurrency control) to provide optimal performance over a wide range of tasks.
+
+This package includes the complete source code for the engine. Although this is a standalone project it must be built against a compiled version of the MySQL 5.1 source tree, because it references headers files used internally by the server.
+
+Details about how to build PBXT both under UNIX or Windows, as a standalone plug-in, or as part of the MySQL source code, is distribed in the documentation which is avaliable online at:
+
+http://www.primebase.org/documentation
+
+Bug reports, questions and comments can be sent directly to me.
+
+Thanks for your support!
+
+Paul McCullagh
+SNAP Innovation GmbH
[e-mail]
+

=== added file 'plugin/pbxt/TODO'
--- plugin/pbxt/TODO	1970-01-01 00:00:00 +0000
+++ plugin/pbxt/TODO	2010-04-01 14:19:35 +0000
@@ -0,0 +1,195 @@
+PBXT To-Do List
+===============
+
+My thanks to all who have downloaded and tested PBXT. If an issue you reported before the date below is not on this list, please e-mail me again. 
+
+------- 2008-12-09
+
+0063: The option for not using memory mapped files must be fixed.
+
+0062: Dynamic option for using memory mapping on a table (Dimitri).
+
+------- 2008-09-12
+
+0061: Add records per key result to ha_pbxt:info() call (Mark).
+
+------- 2008-08-31
+
+0060: Add table option to determine if a table should be memory mapped or not (also requested by Dimitri).
+
+0059: Add table options:
+  AVG_ROW_LENGTH [=] value
+  DATA DIRECTORY [=] 'absolute path to directory'
+  INDEX DIRECTORY [=] 'absolute path to directory'
+  MAX_ROWS [=] value
+
+------- 2008-03-28
+
+0058: Consolidate writes when changes in the log are applied to the database.
+
+------- 2008-03-07
+
+0057: Cluster updates onto a single page.
+
+0056: Add checksum to index and data pages.
+
+0055: When no index cache is available, the complete index must be flushed (not just single pages).
+
+0054: Optimize indexes by not creating indexes that are a complete sub-set of some other index. In this case we must be able to identify part of an index as unique. For example: primary key (a, b), index (a, b, c). Here we would just create index (a, b, c), and specify that the part (a, b) must be unique. Operations on (a, b) will be directed to index (a, b, c).
+
+0053: Check and test lock tables.
+
+0052: Cache data log data in the handle data cache. Must be purged when a handle data record is written.
+
+0051: Write data log data alternatively to the transaction log. The compactor must then compact transaction logs.
+
+0050: [RESOLVED: RN126] Implement consistent write for indexes.
+
+0049: [RESOLVED: RN114] Set the index block size to 4K, or 16K as used by InnoDB.
+
+0048: [RESOLVED: RN110] Add row ID to indexes. This should only be set once the row is cleaned by the sweeper. Then the row ID can be used to make a quite check if the row is the most recent version.
+
+------- 2007-06-19
+
+0047: Test build with ./configure --with-innodb under Linux (Vadim).
+
+0046: [RESOLVED: RN85] Add plug.in file to enable drop in compile under Linux.
+
+0045: Provide libstdc++.so.6 binaries (Vadim).
+
+0044: [RESOLVED: RN73] Limit number of file handles used per table (Brian).
+
+0043: XA (two-phase commit) support (Peter).
+
+------- 2007-03-13
+
+0042: [RESOLVED: RN108] Implemement STATUS commands.
+
+0041: Implement index prefix compression.
+
+------- 2007-03-07
+
+0040: [RESOLVED: RN60] Update in-place when a transaction updates the same record more than once.
+
+0039: Set the number and size of the segments dynamically according to the amount of memory in the cache (and the number of CPUs?) (as discussed with: Peter & Vadim).
+
+0038: [RESOLVED: RN133] Improve the efficiency of the locks by using atomic compare and swap (Peter & Vadim).
+
+0037: [RESOLVED: RN133] Instead of a global LRU list, use a LRU list for segment of the cache (Peter & Vadim). [ Note: a global list using a TAS lock and change time (so that LRU is not always updated) is most efficient].
+
+0036: Add support for deferred foreign key checking (requested by: Mark).
+
+0035: [RESOLVED: RN71] Remove the 2000 table limit (reported by: Hakan).
+
+------- 2007-02-28
+
+0035: [RESOLVED: RN74, RN107] Build in the PBXT system parameters (currently they must be set using environment variables.
+
+0034: [RESOLVED: RN117] Initial documentation (yes, it must be done!)
+
+0033: Make the error code returned on lock error configurable.
+
+0032: [RESOLVED: RN65] Create a source code pluggable version for Windows.
+
+0031: [RESOLVED: RN66] PBXT corrupts the index file when the size exceeds 4 GB (reported by: Luciano)
+
+0030: [RESOLVED: RN102] Implement pbxt_index_flush_delay. Postpones index writing in order to speed up imports. [Resolution uses that fact hat index entries that are missing are added during recovery. As a result, index flushing can be delayed.]
+
+0029: [RESOLVED: RN103] Implement SELECT ... FOR UPDATE (recommended by: Robin).
+
+------- 2007-02-14
+
+0028: Implement CREATE TABLE ... DATA/INDEX DIRECTORY (suggested by: Robin).
+
+------- 2006-12-06
+
+0027: [RESOLVED: RN53] Bug in pbxt with query caching (reported by: Giuseppe) caused violation of transaction isolation.
+
+------- 2006-08-05
+
+0026: Implement BACKUP and RESTORE table (planned for the first post release version).
+
+0025: Implement DISABLE/ENABLE KEYS. Works for FOREIGN KEYs, currently no plans to implement for disabling indexes.
+
+0024: Implement ANALYZE TABLE (planned for the first post release version).
+
+0023: Implement CHECK TABLE (planned for the first release candidate).
+
+0022: [RESOLVED: RN18] Implement TRUNCATE TABLE and DELETE FROM <table>; (i.e. a DELETE without WHERE clause). Currently this function does not cause an error, but no rows are deleted.
+
+------- 2006-07-06
+
+0021: [RESOLVED: RN28] .../mysql-test/mysql-test-run --force --mysqld=--default-storage-engine=pbxt produces a number of errors (reported by: Hakan): As far as I can tell some failures are unnessary but others are bugs. All need to be checked.
+
+------- 2006-07-03
+
+0020: [RESOLVED: RN49] Implement referential integrity (planned for the first release candidate).
+
+------- 2006-04-01
+
+0019: [RESOLVED: RN28] mysql-test-run hangs on alter table (reported by: Hakan): Running a test like ./mysql-test-run.pl --mysqld=--default-storage-engine=pbxt, hangs on ALTER TABLE.
+
+0018: Implement GEOMETRY date type. Note: There are currently no plans to implement this feature.
+
+------- 2006-03-31
+
+0017: [RESOLVED: RN37] MySQL 5.x Version (reported by: Ronald, Giuseppe).
+
+0016: [RESOLVED: RN13] Hang on "DROP DATABASE" (reported by: Giuseppe). Load the world database (http://downloads.mysql.com/docs/world.sql) and convert all tables into PBXT. Then, the drop database command hangs.
+
+0015: [RESOLVED: RN12] Implement isolation level "repeatable read" (reported by: Giuseppe). Current PBXT only supports isolation level "committed read". This means committed data can be seen no matter when it was committed. Use SELECT ... FOR UPDATE to guarantee repeatable read, on data already read.
+
+0014: [RESOLVED: RN7] Two transactions cannot insert simaltaneously if they use auto_increment (reported by: Giuseppe). See also 0005.
+
+0013: [RESOLVED: RN11] Implement buffered write (reported by: Giuseppe): Lack of buffered write leads to bad performance in operations such as ALTER TABLE ENGINE = PBXT and INSERT ... SELECT.
+
+0012: [RESOLVED: RN18] TRUNCATE does not work (reported by: Giuseppe)
+
+0011: [RESOLVED: RN2] Load Sakila Sample Database (reported by: Ronald): ALTER TABLE film ENGINE=PBXT; fails
+
+0010: [RESOLVED: RN6] sql-bench (reported by: Dmitry): ./run-all-tests --create-options=TYPE=PBXT fails.
+
+0009: [RESOLVED: RN29] 64-bit Linux (reported by: Hakan): PBXT current does not compile under 64-bit Linux.
+
+------- 2006-03-16 
+
+0008: [RESOLVED: RN10] Enforcing the unique index constraint:
+
+An index declared as "unique" must return a "duplicate unique key" error when inserting a duplicate value. The difficulty part of implementing this in PBXT is that we may encounter a duplicate value that has not yet been committed. The index reading thread must then wait for the transaction to commit or abort.
+
+0007: [RESOLVED: RN9] Cleaning up empty index nodes:
+
+The Lehman and Yoa algorithm used for indexing does not describe a way of cleaning up empty index nodes on-the-fly. A search of the relevant literature for an algorithm also turns up empty handed (periodic "reorg" is mostly suggested). I have subsequently devised an algorithm that will do the job. This needs to be implemented.
+
+0006: [RESOLVED: RN8] Cache Balancing:
+
+PBXT uses a number of small caches in order to improve concurrency (rather than one large cache). A process is required to manage the amount of cache memory used as a whole. The process must distribute the overall amount of memory available for caching over the small caches, according to demand.
+
+0005: [RESOLVED: RN7] Implement a faster auto-increment method
+
+Currently the auto-increment is handled by the default method used in MySQL. This is done by performing a "fetch-last" on the index for each insert to find the highest key value. This works well unless there are large number empty index nodes due to the problem described in (2) above.
+
+PBXT Testing To-Do List
+
+This is my first take on what still must be tested. My thanks to Ronald Bradford who is working on a generic testing framework that can be used to test PBXT.
+
+0004: [RESOLVED: RN6, RN28] MySQL Tests:
+
+Several tests (for mysql-test-run) written for other engines can be adapted and used to test PBXT.
+
+0003: [RESOLVED: RN30] Multi-processor Test:
+
+There is a difference between preemptive multitasking and true multitasking, which you have on a multi-processor (or dual core) machine. I don't expect any fundamental problems here, but it must be tested.
+
+0002: [RESOLVED: RN5, RN30, RN43] Multi-user/locking Test:
+
+How does the engine perform with a number of concurrent users running various transactions on a number of different tables?
+This is a difficult test to write because it need to simulate a production situation. To test at least 2 or 3 machines is required. The idea is not to use too much data so that a lot of conflicts may occur.
+
+0001: [RESOLVED: RN4, RN43] Load/Stability Test:
+
+How does the engine perform under heavy load over a long period of time? How stable is the engine on power outage, etc?
+
+The test could use a variation of the test program written for test (3) above. At least 3 test machines would be required. The test must be modified to cause as much activity as possible. The test should monitor the performance under load.
+
+

=== added file 'plugin/pbxt/plugin.am'
--- plugin/pbxt/plugin.am	1970-01-01 00:00:00 +0000
+++ plugin/pbxt/plugin.am	2010-04-01 14:19:35 +0000
@@ -0,0 +1,76 @@
+# Used to build Makefile.in
+
+noinst_LTLIBRARIES+= 		plugin/pbxt/libpbxt.la
+
+noinst_HEADERS+= \
+		plugin/pbxt/src/bsearch_xt.h
+		plugin/pbxt/src/cache_xt.h \
+		plugin/pbxt/src/ccutils_xt.h \
+		plugin/pbxt/src/database_xt.h \
+		plugin/pbxt/src/datadic_xt.h \
+		plugin/pbxt/src/datalog_xt.h \
+		plugin/pbxt/src/filesys_xt.h \
+		plugin/pbxt/src/hashtab_xt.h \
+		plugin/pbxt/src/ha_pbxt.h \
+		plugin/pbxt/src/heap_xt.h \
+		plugin/pbxt/src/index_xt.h \
+		plugin/pbxt/src/linklist_xt.h \
+		plugin/pbxt/src/memory_xt.h \
+		plugin/pbxt/src/myxt_xt.h \
+		plugin/pbxt/src/pthread_xt.h \
+		plugin/pbxt/src/restart_xt.h \
+		plugin/pbxt/src/sortedlist_xt.h \
+		plugin/pbxt/src/strutil_xt.h \
+		plugin/pbxt/src/tabcache_xt.h \
+		plugin/pbxt/src/table_xt.h \
+		plugin/pbxt/src/trace_xt.h \
+		plugin/pbxt/src/thread_xt.h \
+		plugin/pbxt/src/util_xt.h \
+		plugin/pbxt/src/xaction_xt.h \
+		plugin/pbxt/src/xactlog_xt.h \
+		plugin/pbxt/src/lock_xt.h \
+		plugin/pbxt/src/systab_xt.h \
+		plugin/pbxt/src/ha_xtsys.h \
+		plugin/pbxt/src/discover_xt.h \
+		plugin/pbxt/src/pbms.h \
+		plugin/pbxt/src/xt_config.h \
+		plugin/pbxt/src/xt_defs.h \
+		plugin/pbxt/src/xt_errno.h
+
+
+plugin_pbxt_libpbxt_la_CXXFLAGS=	${AM_CXXFLAGS} -DDRIZZLED -Wno-long-long -Wno-overloaded-virtual -Wno-sign-compare -Wno-unused-function
+plugin_pbxt_libpbxt_la_CFLAGS=		${AM_CFLAGS} -DDRIZZLED -std=c99
+
+plugin_pbxt_libpbxt_la_SOURCES= \
+		plugin/pbxt/src/bsearch_xt.cc \
+		plugin/pbxt/src/cache_xt.cc \
+		plugin/pbxt/src/ccutils_xt.cc \
+		plugin/pbxt/src/database_xt.cc \
+		plugin/pbxt/src/datadic_xt.cc \
+		plugin/pbxt/src/datalog_xt.cc \
+		plugin/pbxt/src/filesys_xt.cc \
+		plugin/pbxt/src/hashtab_xt.cc \
+		plugin/pbxt/src/ha_pbxt.cc \
+		plugin/pbxt/src/heap_xt.cc \
+		plugin/pbxt/src/index_xt.cc \
+		plugin/pbxt/src/linklist_xt.cc \
+		plugin/pbxt/src/memory_xt.cc \
+		plugin/pbxt/src/myxt_xt.cc \
+		plugin/pbxt/src/pthread_xt.cc \
+		plugin/pbxt/src/restart_xt.cc \
+		plugin/pbxt/src/sortedlist_xt.cc \
+		plugin/pbxt/src/strutil_xt.cc \
+		plugin/pbxt/src/tabcache_xt.cc \
+		plugin/pbxt/src/table_xt.cc \
+		plugin/pbxt/src/trace_xt.cc \
+		plugin/pbxt/src/thread_xt.cc \
+		plugin/pbxt/src/systab_xt.cc \
+		plugin/pbxt/src/ha_xtsys.cc \
+		plugin/pbxt/src/discover_xt.cc \
+		plugin/pbxt/src/util_xt.cc \
+		plugin/pbxt/src/xaction_xt.cc \
+		plugin/pbxt/src/xactlog_xt.cc \
+		plugin/pbxt/src/lock_xt.cc
+
+
+EXTRA_DIST+=			CMakeLists.txt

=== added file 'plugin/pbxt/plugin.ini'
--- plugin/pbxt/plugin.ini	1970-01-01 00:00:00 +0000
+++ plugin/pbxt/plugin.ini	2010-04-01 14:19:35 +0000
@@ -0,0 +1,25 @@
+#
+# Copyright (c) 2006, 2009, Innobase Oy. All Rights Reserved.
+# 
+# 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; version 2 of the License.
+# 
+# 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
+#
+
+[plugin]
+name=pbxt
+title=PBXT Storage Engine
+description=MVCC-based transactional engine
+sources=src/ha_pbxt.cc
+load_by_default=yes
+libs=plugin/pbxt/libpbxt.la
+cflags=-DDRIZZLED -std=c99
+cxxflags=-DDRIZZLED -Wno-long-long -Wno-overloaded-virtual

=== added directory 'plugin/pbxt/src'
=== added file 'plugin/pbxt/src/Makefile.am'
--- plugin/pbxt/src/Makefile.am	1970-01-01 00:00:00 +0000
+++ plugin/pbxt/src/Makefile.am	2010-04-01 14:19:35 +0000
@@ -0,0 +1,50 @@
+# Used to build Makefile.in
+
+MYSQLDATAdir =          $(localstatedir)
+MYSQLSHAREdir =         $(pkgdatadir)
+MYSQLBASEdir=           $(prefix)
+MYSQLLIBdir=            $(pkglibdir)
+pkgplugindir =          $(pkglibdir)/plugin
+
+AM_CPPFLAGS = -I$(top_srcdir)
+
+LIBS =
+
+LDADD =
+
+noinst_HEADERS =		bsearch_xt.h cache_xt.h ccutils_xt.h database_xt.h \
+						datadic_xt.h datalog_xt.h filesys_xt.h hashtab_xt.h \
+						ha_pbxt.h heap_xt.h index_xt.h linklist_xt.h \
+						memory_xt.h myxt_xt.h pthread_xt.h restart_xt.h \
+						sortedlist_xt.h strutil_xt.h \
+						tabcache_xt.h table_xt.h trace_xt.h thread_xt.h \
+						util_xt.h xaction_xt.h xactlog_xt.h lock_xt.h \
+						systab_xt.h ha_xtsys.h discover_xt.h backup_xt.h \
+						pbms.h pbms_enabled.h xt_config.h xt_defs.h xt_errno.h locklist_xt.h
+
+plugin_LTLIBRARIES =	libpbxt.la
+
+libpbxt_la_SOURCES =	bsearch_xt.cc cache_xt.cc ccutils_xt.cc database_xt.cc \
+						datadic_xt.cc datalog_xt.cc filesys_xt.cc hashtab_xt.cc \
+						ha_pbxt.cc heap_xt.cc index_xt.cc linklist_xt.cc \
+						memory_xt.cc myxt_xt.cc pthread_xt.cc restart_xt.cc \
+						pbms_enabled.cc sortedlist_xt.cc strutil_xt.cc \
+						tabcache_xt.cc table_xt.cc trace_xt.cc thread_xt.cc \
+						systab_xt.cc ha_xtsys.cc discover_xt.cc backup_xt.cc \
+						util_xt.cc xaction_xt.cc xactlog_xt.cc lock_xt.cc locklist_xt.cc
+
+libpbxt_la_LDFLAGS =	-module
+
+# These are the warning Drizzle uses:
+# DRIZZLE_WARNINGS =		-W -Wall -Wextra -pedantic -Wundef -Wredundant-decls -Wno-strict-aliasing -Wno-long-long -Wno-unused-parameter
+
+libpbxt_la_CXXFLAGS =	$(AM_CXXFLAGS) -DMYSQL_DYNAMIC_PLUGIN -Wno-overloaded-virtual
+libpbxt_la_CFLAGS =		$(AM_CFLAGS) -DMYSQL_DYNAMIC_PLUGIN -std=c99
+
+EXTRA_LIBRARIES =		libpbxt.a
+noinst_LIBRARIES = 		libpbxt.a
+libpbxt_a_SOURCES =		$(libpbxt_la_SOURCES)
+libpbxt_a_CXXFLAGS =	$(AM_CXXFLAGS) -DDRIZZLED -Wno-long-long -Wno-overloaded-virtual
+libpbxt_a_CFLAGS =		$(AM_CFLAGS) -DDRIZZLED -std=c99
+
+EXTRA_DIST =			CMakeLists.txt

=== added file 'plugin/pbxt/src/backup_xt.cc'
--- plugin/pbxt/src/backup_xt.cc	1970-01-01 00:00:00 +0000
+++ plugin/pbxt/src/backup_xt.cc	2010-04-01 14:19:35 +0000
@@ -0,0 +1,802 @@
+/* Copyright (c) 2009 PrimeBase Technologies GmbH
+ *
+ * PrimeBase XT
+ *
+ * This program is free software; you can redistribute it and/or modify
+ * it under the terms of the GNU General Public License as published by
+ * the Free Software Foundation; either version 2 of the License, or
+ * (at your option) any later version.
+ *
+ * This program is distributed in the hope that it will be useful,
+ * but WITHOUT ANY WARRANTY; without even the implied warranty of
+ * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+ * GNU General Public License for more details.
+ *
+ * You should have received a copy of the GNU General Public License
+ * along with this program; if not, write to the Free Software
+ * Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA
+ *
+ * 2009-09-07	Paul McCullagh
+ *
+ * H&G2JCtL
+ */
+
+#include "xt_config.h"
+
+#ifdef MYSQL_SUPPORTS_BACKUP
+
+#include <string.h>
+#include <stdio.h>
+#include <stdlib.h>
+#include <time.h>
+#include <ctype.h>
+
+#include "mysql_priv.h"
+#include <backup/api_types.h>
+#include <backup/backup_engine.h>
+#include <backup/backup_aux.h>         // for build_table_list()
+#include <hash.h>
+
+#include "ha_pbxt.h"
+
+#include "backup_xt.h"
+#include "pthread_xt.h"
+#include "filesys_xt.h"
+#include "database_xt.h"
+#include "strutil_xt.h"
+#include "memory_xt.h"
+#include "trace_xt.h"
+#include "myxt_xt.h"
+
+#ifdef OK
+#undef OK
+#endif
+
+#ifdef byte
+#undef byte
+#endif
+
+#ifdef DEBUG
+//#define TRACE_BACKUP_CALLS
+//#define TEST_SMALL_BLOCK			100000
+#endif
+
+using backup::byte;
+using backup::result_t;
+using backup::version_t;
+using backup::Table_list;
+using backup::Table_ref;
+using backup::Buffer;
+
+#ifdef TRACE_BACKUP_CALLS
+#define XT_TRACE_CALL()				ha_trace_function(__FUNC__, NULL)
+#else
+#define XT_TRACE_CALL()
+#endif
+
+#define XT_RESTORE_BATCH_SIZE		10000
+
+#define BUP_STATE_BEFORE_LOCK		0
+#define BUP_STATE_AFTER_LOCK		1
+
+#define BUP_STANDARD_VAR_RECORD		1
+#define BUP_RECORD_BLOCK_4_START	2			// Part of a record, with a 4 byte total length, and 4 byte data length
+#define BUP_RECORD_BLOCK_4			3			// Part of a record, with a 4 byte length
+#define BUP_RECORD_BLOCK_4_END		4			// Last part of a record with a 4 byte length
+
+/*
+ * -----------------------------------------------------------------------
+ * UTILITIES
+ */
+
+#ifdef TRACE_BACKUP_CALLS
+static void ha_trace_function(const char *function, char *table)
+{
+	char		func_buf[50], *ptr;
+	XTThreadPtr	thread = xt_get_self(); 
+	
+	if ((ptr = strchr(function, '('))) {
+		ptr--;
+		while (ptr > function) {
+			if (!(isalnum(*ptr) || *ptr == '_'))
+				break;
+			ptr--;
+		}
+		ptr++;
+		xt_strcpy(50, func_buf, ptr);
+		if ((ptr = strchr(func_buf, '(')))
+			*ptr = 0;
+	}
+	else
+		xt_strcpy(50, func_buf, function);
+	if (table)
+		printf("%s %s (%s)\n", thread ? thread->t_name : "-unknown-", func_buf, table);
+	else
+		printf("%s %s\n", thread ? thread->t_name : "-unknown-", func_buf);
+}
+#endif
+
+/*
+ * -----------------------------------------------------------------------
+ * BACKUP DRIVER
+ */
+
+class PBXTBackupDriver: public Backup_driver
+{
+	public:
+	PBXTBackupDriver(const Table_list &);
+	virtual ~PBXTBackupDriver();
+
+	virtual size_t		size();
+	virtual size_t		init_size();
+	virtual result_t	begin(const size_t);
+	virtual result_t	end();
+	virtual result_t	get_data(Buffer &);
+	virtual result_t	prelock();
+	virtual result_t	lock();
+	virtual result_t	unlock();
+	virtual result_t	cancel();
+	virtual void		free();
+	void				lock_tables_TL_READ_NO_INSERT();
+
+	private:
+	XTThreadPtr		bd_thread;
+	int				bd_state;
+	u_int			bd_table_no;
+	XTOpenTablePtr	bd_ot;
+	xtWord1			*bd_row_buf;
+
+	/* Non-zero if we last returned only part of
+	 * a row.
+	 */
+	xtWord1			*db_write_block(xtWord1 *buffer, xtWord1 bup_type, size_t *size, xtWord4 row_len);
+	xtWord1			*db_write_block(xtWord1 *buffer, xtWord1 bup_type, size_t *size, xtWord4 total_len, xtWord4 row_len);
+
+	xtWord4			bd_row_offset;
+	xtWord4			bd_row_size;
+};
+
+
+PBXTBackupDriver::PBXTBackupDriver(const Table_list &tables):
+Backup_driver(tables),
+bd_state(BUP_STATE_BEFORE_LOCK),
+bd_table_no(0),
+bd_ot(NULL),
+bd_row_buf(NULL),
+bd_row_offset(0),
+bd_row_size(0)
+{
+}
+
+PBXTBackupDriver::~PBXTBackupDriver()
+{
+}
+
+/** Estimates total size of backup. @todo improve it */
+size_t PBXTBackupDriver::size()
+{
+	XT_TRACE_CALL();
+	return UNKNOWN_SIZE;
+}
+
+/** Estimates size of backup before lock. @todo improve it */
+size_t PBXTBackupDriver::init_size()
+{
+	XT_TRACE_CALL();
+	return 0;
+}
+
+result_t PBXTBackupDriver::begin(const size_t)
+{
+	THD				*thd = current_thd;
+	XTExceptionRec	e;
+
+	XT_TRACE_CALL();
+	
+	if (!(bd_thread = xt_ha_set_current_thread(thd, &e))) {
+		xt_log_exception(NULL, &e, XT_LOG_DEFAULT);
+		return backup::ERROR;
+	}
+	
+	return backup::OK;
+}
+
+result_t PBXTBackupDriver::end()
+{
+	XT_TRACE_CALL();
+	if (bd_ot) {
+		xt_tab_seq_exit(bd_ot);
+		xt_db_return_table_to_pool_ns(bd_ot);
+		bd_ot = NULL;
+	}
+	if (bd_thread->st_xact_data) {
+		if (!xt_xn_commit(bd_thread))
+			return backup::ERROR;
+	}
+	return backup::OK;
+}
+
+xtWord1 *PBXTBackupDriver::db_write_block(xtWord1 *buffer, xtWord1 bup_type, size_t *ret_size, xtWord4 row_len)
+{
+	register size_t size = *ret_size;
+
+	*buffer = bup_type;	// Record type identifier.
+	buffer++;
+	size--;
+	memcpy(buffer, bd_ot->ot_row_wbuffer, row_len);
+	buffer += row_len;
+	size -= row_len;
+	*ret_size = size;
+	return buffer;
+}
+
+xtWord1 *PBXTBackupDriver::db_write_block(xtWord1 *buffer, xtWord1 bup_type, size_t *ret_size, xtWord4 total_len, xtWord4 row_len)
+{
+	register size_t size = *ret_size;
+
+	*buffer = bup_type;	// Record type identifier.
+	buffer++;
+	size--;
+	if (bup_type == BUP_RECORD_BLOCK_4_START) {
+		XT_SET_DISK_4(buffer, total_len);
+		buffer += 4;
+		size -= 4;
+	}
+	XT_SET_DISK_4(buffer, row_len);
+	buffer += 4;
+	size -= 4;
+	memcpy(buffer, bd_ot->ot_row_wbuffer+bd_row_offset, row_len);
+	buffer += row_len;
+	size -= row_len;
+	bd_row_size -= row_len;
+	bd_row_offset += row_len;
+	*ret_size = size;
+	return buffer;
+}
+
+result_t PBXTBackupDriver::get_data(Buffer &buf)
+{
+	xtBool	eof = FALSE;
+	size_t	size;
+	xtWord4	row_len;
+	xtWord1	*buffer;
+
+	XT_TRACE_CALL();
+
+	if (bd_state == BUP_STATE_BEFORE_LOCK) {
+		buf.table_num = 0;
+		buf.size = 0;
+		buf.last = FALSE;
+		return backup::READY;
+	}
+
+	/* Open the backup table: */
+	if (!bd_ot) {
+		XTThreadPtr		self = bd_thread;
+		XTTableHPtr		tab;
+		char			path[PATH_MAX];
+	
+		if (bd_table_no == m_tables.count()) {
+			buf.size = 0;
+			buf.table_num = 0;
+			buf.last = TRUE;
+			return backup::DONE;
+		}
+		
+		m_tables[bd_table_no].internal_name(path, sizeof(path));
+		bd_table_no++;
+		try_(a)	{
+			xt_ha_open_database_of_table(self, (XTPathStrPtr) path);
+			tab = xt_use_table(self, (XTPathStrPtr) path, FALSE, FALSE, NULL);
+			pushr_(xt_heap_release, tab);
+			if (!(bd_ot = xt_db_open_table_using_tab(tab, bd_thread)))
+				xt_throw(self);
+			freer_(); // xt_heap_release(tab)
+
+			/* Prepare the seqential scan: */
+			xt_tab_seq_exit(bd_ot);
+			if (!xt_tab_seq_init(bd_ot))
+				xt_throw(self);
+			
+			if (bd_row_buf) {
+				xt_free(self, bd_row_buf);
+				bd_row_buf = NULL;
+			}
+			bd_row_buf = (xtWord1 *) xt_malloc(self, bd_ot->ot_table->tab_dic.dic_mysql_buf_size);
+			bd_ot->ot_cols_req = bd_ot->ot_table->tab_dic.dic_no_of_cols;
+		}
+		catch_(a) {
+			;
+		}
+		cont_(a);
+
+		if (!bd_ot)
+			goto failed;
+	}
+
+	buf.table_num = bd_table_no;
+#ifdef TEST_SMALL_BLOCK
+	buf.size = TEST_SMALL_BLOCK;
+#endif
+	size = buf.size;
+	buffer = (xtWord1 *) buf.data;
+	ASSERT_NS(size > 9);
+
+	/* First check of a record was partically written
+	 * last time.
+	 */
+	write_row:
+	if (bd_row_size > 0) {
+		row_len = bd_row_size;
+		if (bd_row_offset == 0) {
+			if (row_len+1 > size) {
+				ASSERT_NS(size > 9);
+				row_len = size - 9;
+				buffer = db_write_block(buffer, BUP_RECORD_BLOCK_4_START, &size, bd_row_size, row_len);
+				goto done;
+			}
+			buffer = db_write_block(buffer, BUP_STANDARD_VAR_RECORD, &size, row_len);
+			bd_row_size = 0;
+		}
+		else {
+			if (row_len+5 > size) {
+				row_len = size - 5;
+				buffer = db_write_block(buffer, BUP_RECORD_BLOCK_4, &size, 0, row_len);
+				goto done;
+			}
+			buffer = db_write_block(buffer, BUP_RECORD_BLOCK_4_END, &size, 0, row_len);
+		}
+	}
+
+	/* Now continue with the sequential scan. */
+	while (size > 1) {
+		if (!xt_tab_seq_next(bd_ot, bd_row_buf, &eof))
+			goto failed;
+		if (eof) {
+			/* We will go the next table, on the next call. */
+			xt_tab_seq_exit(bd_ot);
+			xt_db_return_table_to_pool_ns(bd_ot);
+			bd_ot = NULL;
+			break;
+		}
+		if (!(row_len = myxt_store_row_data(bd_ot, 0, (char *) bd_row_buf)))
+			goto failed;
+		if (row_len+1 > size) {
+			/* Does not fit: */
+			bd_row_offset = 0;
+			bd_row_size = row_len;
+			/* Only add part of the row, if there is still
+			 * quite a bit of space left:
+			 */
+			if (size >= (32 * 1024))
+				goto write_row;
+			break;
+		}
+		buffer = db_write_block(buffer, BUP_STANDARD_VAR_RECORD, &size, row_len);
+	}
+
+	done:
+	buf.size = buf.size - size;
+	/* This indicates wnd of data for a table! */
+    buf.last = eof;
+
+	return backup::OK;
+
+	failed:
+	xt_log_and_clear_exception(bd_thread);
+	return backup::ERROR;
+}
+
+result_t PBXTBackupDriver::prelock()
+{
+	XT_TRACE_CALL();
+	return backup::READY;
+}
+
+result_t PBXTBackupDriver::lock()
+{
+	XT_TRACE_CALL();
+	bd_thread->st_xact_mode = XT_XACT_COMMITTED_READ;
+	bd_thread->st_ignore_fkeys = FALSE;
+	bd_thread->st_auto_commit = FALSE;
+	bd_thread->st_table_trans = FALSE;
+	bd_thread->st_abort_trans = FALSE;
+	bd_thread->st_stat_ended = FALSE;
+	bd_thread->st_stat_trans = FALSE;
+	bd_thread->st_is_update = FALSE;
+	if (!xt_xn_begin(bd_thread))
+		return backup::ERROR;
+	bd_state = BUP_STATE_AFTER_LOCK;
+	return backup::OK;
+}
+
+result_t PBXTBackupDriver::unlock()
+{
+	XT_TRACE_CALL();
+	return backup::OK;
+}
+
+result_t PBXTBackupDriver::cancel()
+{
+	XT_TRACE_CALL();
+	return backup::OK; // free() will be called and suffice
+}
+
+void PBXTBackupDriver::free()
+{
+	XT_TRACE_CALL();
+	if (bd_ot) {
+		xt_tab_seq_exit(bd_ot);
+		xt_db_return_table_to_pool_ns(bd_ot);
+		bd_ot = NULL;
+	}
+	if (bd_row_buf) {
+		xt_free_ns(bd_row_buf);
+		bd_row_buf = NULL;
+	}
+	if (bd_thread->st_xact_data)
+		xt_xn_rollback(bd_thread);
+	delete this;
+}
+
+void PBXTBackupDriver::lock_tables_TL_READ_NO_INSERT()
+{
+	XT_TRACE_CALL();
+}
+
+/*
+ * -----------------------------------------------------------------------
+ * BACKUP DRIVER
+ */
+
+class PBXTRestoreDriver: public Restore_driver
+{
+	public:
+	PBXTRestoreDriver(const Table_list &tables);
+	virtual ~PBXTRestoreDriver();
+
+	virtual result_t  begin(const size_t);
+	virtual result_t  end();
+	virtual result_t  send_data(Buffer &buf);
+	virtual result_t  cancel();
+	virtual void      free();
+	
+	private:
+	XTThreadPtr		rd_thread;
+	u_int			rd_table_no;
+	XTOpenTablePtr	rd_ot;
+	STRUCT_TABLE	*rd_my_table;
+	xtWord1			*rb_row_buf;
+	u_int			rb_col_cnt;
+	u_int			rb_insert_count;
+
+	/* Long rows are accumulated here: */
+	xtWord4			rb_row_len;
+	xtWord4			rb_data_size;
+	xtWord1			*rb_row_data;
+};
+
+PBXTRestoreDriver::PBXTRestoreDriver(const Table_list &tables):
+Restore_driver(tables),
+rd_thread(NULL),
+rd_table_no(0),
+rd_ot(NULL),
+rb_row_buf(NULL),
+rb_row_len(0),
+rb_data_size(0),
+rb_row_data(NULL)
+{
+}
+
+PBXTRestoreDriver::~PBXTRestoreDriver()
+{
+}
+
+result_t PBXTRestoreDriver::begin(const size_t)
+{
+	THD				*thd = current_thd;
+	XTExceptionRec	e;
+	
+	XT_TRACE_CALL();
+	
+	if (!(rd_thread = xt_ha_set_current_thread(thd, &e))) {
+		xt_log_exception(NULL, &e, XT_LOG_DEFAULT);
+		return backup::ERROR;
+	}
+	
+	return backup::OK;
+}
+
+result_t PBXTRestoreDriver::end()
+{
+	XT_TRACE_CALL();
+	if (rd_ot) {
+		xt_db_return_table_to_pool_ns(rd_ot);
+		rd_ot = NULL;
+	}
+	//if (rb_row_buf) {
+	//	xt_free_ns(rb_row_buf);
+	//	rb_row_buf = NULL;
+	//}
+	if (rb_row_data) {
+		xt_free_ns(rb_row_data);
+		rb_row_data = NULL;
+	}
+	if (rd_thread->st_xact_data) {
+		if (!xt_xn_commit(rd_thread))
+			return backup::ERROR;
+	}
+	return backup::OK;
+}
+
+
+result_t PBXTRestoreDriver::send_data(Buffer &buf)
+{
+	size_t	size;
+	xtWord1	type;
+	xtWord1	*buffer;
+	xtWord4	row_len;
+	xtWord1 *rec_data;
+
+	XT_TRACE_CALL();
+
+	if (buf.table_num != rd_table_no) {
+		XTThreadPtr		self = rd_thread;
+		XTTableHPtr		tab;
+		char			path[PATH_MAX];
+		
+		if (rd_ot) {
+			xt_db_return_table_to_pool_ns(rd_ot);
+			rd_ot = NULL;
+		}
+
+		if (rd_thread->st_xact_data) {
+			if (!xt_xn_commit(rd_thread))
+				goto failed;
+		}
+		if (!xt_xn_begin(rd_thread))
+			goto failed;
+		rb_insert_count = 0;
+		
+		rd_table_no = buf.table_num;
+		m_tables[rd_table_no-1].internal_name(path, sizeof(path));
+		try_(a)	{
+			xt_ha_open_database_of_table(self, (XTPathStrPtr) path);
+			tab = xt_use_table(self, (XTPathStrPtr) path, FALSE, FALSE, NULL);
+			pushr_(xt_heap_release, tab);
+			if (!(rd_ot = xt_db_open_table_using_tab(tab, rd_thread)))
+				xt_throw(self);
+			freer_(); // xt_heap_release(tab)
+
+			rd_my_table = rd_ot->ot_table->tab_dic.dic_my_table;
+			if (rd_my_table->found_next_number_field) {
+				rd_my_table->in_use = current_thd;
+				rd_my_table->next_number_field = rd_my_table->found_next_number_field;
+				rd_my_table->mark_columns_used_by_index_no_reset(rd_my_table->s->next_number_index, rd_my_table->read_set);
+			}
+
+			/* This is safe because only one thread can restore a table at 
+			 * a time!
+			 */
+			rb_row_buf = (xtWord1 *) rd_my_table->record[0];
+			//if (rb_row_buf) {
+			//	xt_free(self, rb_row_buf);
+			//	rb_row_buf = NULL;
+			//}
+			//rb_row_buf = (xtWord1 *) xt_malloc(self, rd_ot->ot_table->tab_dic.dic_mysql_buf_size);
+	
+			rb_col_cnt = rd_ot->ot_table->tab_dic.dic_no_of_cols;
+
+		}
+		catch_(a) {
+			;
+		}
+		cont_(a);
+		
+		if (!rd_ot)
+			goto failed;
+	}
+
+	buffer = (xtWord1 *) buf.data;
+	size = buf.size;
+
+	while (size > 0) {
+		type = *buffer;
+		switch (type) {
+			case BUP_STANDARD_VAR_RECORD:
+				rec_data = buffer + 1;
+				break;
+			case BUP_RECORD_BLOCK_4_START:
+				buffer++;
+				row_len = XT_GET_DISK_4(buffer);
+				buffer += 4;
+				if (rb_data_size < row_len) {
+					if (!xt_realloc_ns((void **) &rb_row_data, row_len))
+						goto failed;
+					rb_data_size = row_len;
+				}
+				row_len = XT_GET_DISK_4(buffer);
+				buffer += 4;
+				ASSERT_NS(row_len <= rb_data_size);
+				if (row_len > rb_data_size) {
+					xt_register_xterr(XT_REG_CONTEXT, XT_ERR_BAD_BACKUP_FORMAT);
+					goto failed;
+				}
+				memcpy(rb_row_data, buffer, row_len);
+				rb_row_len = row_len;
+				buffer += row_len;
+				if (row_len + 9 > size) {
+					xt_register_xterr(XT_REG_CONTEXT, XT_ERR_BAD_BACKUP_FORMAT);
+					goto failed;
+				}
+				size -= row_len + 9;
+				continue;
+			case BUP_RECORD_BLOCK_4:
+				buffer++;
+				row_len = XT_GET_DISK_4(buffer);
+				buffer += 4;
+				ASSERT_NS(rb_row_len + row_len <= rb_data_size);
+				if (rb_row_len + row_len > rb_data_size) {
+					xt_register_xterr(XT_REG_CONTEXT, XT_ERR_BAD_BACKUP_FORMAT);
+					goto failed;
+				}
+				memcpy(rb_row_data + rb_row_len, buffer, row_len);
+				rb_row_len += row_len;
+				buffer += row_len;
+				if (row_len + 5 > size) {
+					xt_register_xterr(XT_REG_CONTEXT, XT_ERR_BAD_BACKUP_FORMAT);
+					goto failed;
+				}
+				size -= row_len + 5;
+				continue;
+			case BUP_RECORD_BLOCK_4_END:
+				buffer++;
+				row_len = XT_GET_DISK_4(buffer);
+				buffer += 4;
+				ASSERT_NS(rb_row_len + row_len <= rb_data_size);
+				if (rb_row_len + row_len > rb_data_size) {
+					xt_register_xterr(XT_REG_CONTEXT, XT_ERR_BAD_BACKUP_FORMAT);
+					goto failed;
+				}
+				memcpy(rb_row_data + rb_row_len, buffer, row_len);
+				buffer += row_len;
+				if (row_len + 5 > size) {
+					xt_register_xterr(XT_REG_CONTEXT, XT_ERR_BAD_BACKUP_FORMAT);
+					goto failed;
+				}
+				size -= row_len + 5;
+				rec_data = rb_row_data;
+				break;
+			default:
+				xt_register_xterr(XT_REG_CONTEXT, XT_ERR_BAD_BACKUP_FORMAT);
+				goto failed;
+		}
+		
+		if (!(row_len = myxt_load_row_data(rd_ot, rec_data, rb_row_buf, rb_col_cnt)))
+			goto failed;
+
+		if (rd_ot->ot_table->tab_dic.dic_my_table->found_next_number_field)
+			ha_set_auto_increment(rd_ot, rd_ot->ot_table->tab_dic.dic_my_table->found_next_number_field);
+
+		if (!xt_tab_new_record(rd_ot, rb_row_buf))
+			goto failed;
+
+		if (type == BUP_STANDARD_VAR_RECORD) {
+			buffer += row_len+1;
+			if (row_len + 1 > size) {
+				xt_register_xterr(XT_REG_CONTEXT, XT_ERR_BAD_BACKUP_FORMAT);
+				goto failed;
+			}
+			size -= row_len + 1;
+		}
+
+		rb_insert_count++;
+		if (rb_insert_count == XT_RESTORE_BATCH_SIZE) {
+			if (!xt_xn_commit(rd_thread))
+				goto failed;
+			if (!xt_xn_begin(rd_thread))
+				goto failed;
+			rb_insert_count = 0;
+		}
+	}
+
+	return backup::OK;
+	
+	failed:
+	xt_log_and_clear_exception(rd_thread);
+	return backup::ERROR;
+}
+
+
+result_t PBXTRestoreDriver::cancel()
+{
+	XT_TRACE_CALL();
+	/* Nothing to do in cancel(); free() will suffice */
+	return backup::OK;
+}
+
+void PBXTRestoreDriver::free()
+{
+	XT_TRACE_CALL();
+	if (rd_ot) {
+		xt_db_return_table_to_pool_ns(rd_ot);
+		rd_ot = NULL;
+	}
+	//if (rb_row_buf) {
+	//	xt_free_ns(rb_row_buf);
+	//	rb_row_buf = NULL;
+	//}
+	if (rb_row_data) {
+		xt_free_ns(rb_row_data);
+		rb_row_data = NULL;
+	}
+	if (rd_thread->st_xact_data)
+		xt_xn_rollback(rd_thread);
+	delete this;
+}
+
+/*
+ * -----------------------------------------------------------------------
+ * BACKUP ENGINE FACTORY
+ */
+
+#define PBXT_BACKUP_VERSION 1
+
+
+class PBXTBackupEngine: public Backup_engine
+{
+	public:
+	PBXTBackupEngine() { };
+
+	virtual version_t version() const {
+		return PBXT_BACKUP_VERSION;
+	};
+
+	virtual result_t get_backup(const uint32, const Table_list &, Backup_driver* &);
+
+	virtual result_t get_restore(const version_t, const uint32, const Table_list &,Restore_driver* &);
+
+	virtual void free()
+	{
+		delete this;
+	}
+};
+
+result_t PBXTBackupEngine::get_backup(const u_int count, const Table_list &tables, Backup_driver* &drv)
+{
+	PBXTBackupDriver *ptr = new PBXTBackupDriver(tables);
+
+	if (!ptr)
+		return backup::ERROR;
+	drv = ptr;
+	return backup::OK;
+}
+
+result_t PBXTBackupEngine::get_restore(const version_t ver, const uint32,
+                             const Table_list &tables, Restore_driver* &drv)
+{
+	if (ver > PBXT_BACKUP_VERSION)
+	{
+		return backup::ERROR;    
+	}
+	
+	PBXTRestoreDriver *ptr = new PBXTRestoreDriver(tables);
+
+	if (!ptr)
+		return backup::ERROR;
+	drv = (Restore_driver *) ptr;
+	return backup::OK;
+}
+
+
+Backup_result_t pbxt_backup_engine(handlerton *self, Backup_engine* &be)
+{
+	be = new PBXTBackupEngine();
+	
+	if (!be)
+		return backup::ERROR;
+	
+	return backup::OK;
+}
+
+#endif

=== added file 'plugin/pbxt/src/backup_xt.h'
--- plugin/pbxt/src/backup_xt.h	1970-01-01 00:00:00 +0000
+++ plugin/pbxt/src/backup_xt.h	2010-04-01 14:19:35 +0000
@@ -0,0 +1,34 @@
+/* Copyright (c) 2009 PrimeBase Technologies GmbH
+ *
+ * PrimeBase XT
+ *
+ * This program is free software; you can redistribute it and/or modify
+ * it under the terms of the GNU General Public License as published by
+ * the Free Software Foundation; either version 2 of the License, or
+ * (at your option) any later version.
+ *
+ * This program is distributed in the hope that it will be useful,
+ * but WITHOUT ANY WARRANTY; without even the implied warranty of
+ * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+ * GNU General Public License for more details.
+ *
+ * You should have received a copy of the GNU General Public License
+ * along with this program; if not, write to the Free Software
+ * Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA
+ *
+ * 2009-09-07	Paul McCullagh
+ *
+ * H&G2JCtL
+ */
+
+#ifndef __backup_xt_h__
+#define __backup_xt_h__
+
+#include "xt_defs.h"
+
+#ifdef MYSQL_SUPPORTS_BACKUP
+
+Backup_result_t pbxt_backup_engine(handlerton *self, Backup_engine* &be);
+
+#endif
+#endif

=== added file 'plugin/pbxt/src/bsearch_xt.cc'
--- plugin/pbxt/src/bsearch_xt.cc	1970-01-01 00:00:00 +0000
+++ plugin/pbxt/src/bsearch_xt.cc	2010-04-01 14:19:35 +0000
@@ -0,0 +1,66 @@
+/* Copyright (c) 2005 PrimeBase Technologies GmbH
+ *
+ * PrimeBase XT
+ *
+ * This program is free software; you can redistribute it and/or modify
+ * it under the terms of the GNU General Public License as published by
+ * the Free Software Foundation; either version 2 of the License, or
+ * (at your option) any later version.
+ *
+ * This program is distributed in the hope that it will be useful,
+ * but WITHOUT ANY WARRANTY; without even the implied warranty of
+ * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+ * GNU General Public License for more details.
+ *
+ * You should have received a copy of the GNU General Public License
+ * along with this program; if not, write to the Free Software
+ * Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA
+ *
+ * 2004-01-03	Paul McCullagh
+ *
+ * H&G2JCtL
+ */
+
+#include "xt_config.h"
+
+#include <stdio.h>
+
+#include "bsearch_xt.h"
+#include "pthread_xt.h"
+#include "thread_xt.h"
+
+/**
+ * Binary search a array of 'count' items, with byte size 'size'. This
+ * function returns a pointer to the element and the 'index'
+ * of the element if found.
+ *
+ * If not found the index of the insert point of the item
+ * is returned (0 <= index <= count).
+ *
+ * The comparison routine 'compar' may throw an exception.
+ * In this case the error details will be stored in 'thread'.
+ */
+void *xt_bsearch(XTThreadPtr thread, const void *key, register const void *base, size_t count, size_t size, size_t *idx, const void *thunk, XTCompareFunc compar)
+{
+	register size_t		i;
+	register size_t		guess;
+	register int		r;
+
+	i = 0;
+	while (i < count) {
+		guess = (i + count - 1) >> 1;
+		r = (compar)(thread, thunk, key, ((char *) base) + guess * size);
+		if (r == 0) {
+			*idx = guess;
+			return ((char *) base) + guess * size;
+		}
+		if (r < 0)
+			count = guess;
+		else
+			i = guess + 1;
+	}
+
+	*idx = i;
+	return NULL;
+}
+

=== added file 'plugin/pbxt/src/bsearch_xt.h'
--- plugin/pbxt/src/bsearch_xt.h	1970-01-01 00:00:00 +0000
+++ plugin/pbxt/src/bsearch_xt.h	2010-04-01 14:19:35 +0000
@@ -0,0 +1,32 @@
+/* Copyright (c) 2005 PrimeBase Technologies GmbH
+ *
+ * PrimeBase XT
+ *
+ * This program is free software; you can redistribute it and/or modify
+ * it under the terms of the GNU General Public License as published by
+ * the Free Software Foundation; either version 2 of the License, or
+ * (at your option) any later version.
+ *
+ * This program is distributed in the hope that it will be useful,
+ * but WITHOUT ANY WARRANTY; without even the implied warranty of
+ * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+ * GNU General Public License for more details.
+ *
+ * You should have received a copy of the GNU General Public License
+ * along with this program; if not, write to the Free Software
+ * Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA
+ *
+ * 2004-01-03	Paul McCullagh
+ *
+ * H&G2JCtL
+ */
+#ifndef __xt_bsearch_h__
+#define __xt_bsearch_h__
+
+#include "xt_defs.h"
+
+struct XTThread;
+
+void *xt_bsearch(struct XTThread *self, const void *key, register const void *base, size_t count, size_t size, size_t *idx, const void *thunk, XTCompareFunc compar);
+
+#endif

=== added file 'plugin/pbxt/src/cache_xt.cc'
--- plugin/pbxt/src/cache_xt.cc	1970-01-01 00:00:00 +0000
+++ plugin/pbxt/src/cache_xt.cc	2010-04-01 14:19:35 +0000
@@ -0,0 +1,1577 @@
+/* Copyright (c) 2005 PrimeBase Technologies GmbH, Germany
+ *
+ * PrimeBase XT
+ *
+ * This program is free software; you can redistribute it and/or modify
+ * it under the terms of the GNU General Public License as published by
+ * the Free Software Foundation; either version 2 of the License, or
+ * (at your option) any later version.
+ *
+ * This program is distributed in the hope that it will be useful,
+ * but WITHOUT ANY WARRANTY; without even the implied warranty of
+ * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+ * GNU General Public License for more details.
+ *
+ * You should have received a copy of the GNU General Public License
+ * along with this program; if not, write to the Free Software
+ * Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA
+ *
+ * 2005-05-24	Paul McCullagh
+ *
+ * H&G2JCtL
+ */
+
+#include "xt_config.h"
+
+#ifdef DRIZZLED
+#include <bitset>
+#endif
+
+#ifndef XT_WIN
+#include <unistd.h>
+#endif
+
+#include <stdio.h>
+#include <time.h>
+
+#include "pthread_xt.h"
+#include "thread_xt.h"
+#include "filesys_xt.h"
+#include "cache_xt.h"
+#include "table_xt.h"
+#include "trace_xt.h"
+#include "util_xt.h"
+
+#define XT_TIME_DIFF(start, now) (\
+	((xtWord4) (now) < (xtWord4) (start)) ? \
+	((xtWord4) 0XFFFFFFFF - ((xtWord4) (start) - (xtWord4) (now))) : \
+	((xtWord4) (now) - (xtWord4) (start)))
+
+/*
+ * -----------------------------------------------------------------------
+ * D I S K   C A C H E
+ */
+
+#define IDX_CAC_SEGMENT_COUNT		((off_t) 1 << XT_INDEX_CACHE_SEGMENT_SHIFTS)
+#define IDX_CAC_SEGMENT_MASK		(IDX_CAC_SEGMENT_COUNT - 1)
+
+#ifdef XT_NO_ATOMICS
+#define IDX_CAC_USE_PTHREAD_RW
+#else
+//#define IDX_CAC_USE_RWMUTEX
+//#define IDX_CAC_USE_PTHREAD_RW
+//#define IDX_USE_SPINXSLOCK
+#define IDX_CAC_USE_XSMUTEX
+#endif
+
+#ifdef IDX_CAC_USE_XSMUTEX
+#define IDX_CAC_LOCK_TYPE				XTXSMutexRec
+#define IDX_CAC_INIT_LOCK(s, i)			xt_xsmutex_init_with_autoname(s, &(i)->cs_lock)
+#define IDX_CAC_FREE_LOCK(s, i)			xt_xsmutex_free(s, &(i)->cs_lock)	
+#define IDX_CAC_READ_LOCK(i, o)			xt_xsmutex_slock(&(i)->cs_lock, (o)->t_id)
+#define IDX_CAC_WRITE_LOCK(i, o)		xt_xsmutex_xlock(&(i)->cs_lock, (o)->t_id)
+#define IDX_CAC_UNLOCK(i, o)			xt_xsmutex_unlock(&(i)->cs_lock, (o)->t_id)
+#elif defined(IDX_CAC_USE_PTHREAD_RW)
+#define IDX_CAC_LOCK_TYPE				xt_rwlock_type
+#define IDX_CAC_INIT_LOCK(s, i)			xt_init_rwlock(s, &(i)->cs_lock)
+#define IDX_CAC_FREE_LOCK(s, i)			xt_free_rwlock(&(i)->cs_lock)	
+#define IDX_CAC_READ_LOCK(i, o)			xt_slock_rwlock_ns(&(i)->cs_lock)
+#define IDX_CAC_WRITE_LOCK(i, o)		xt_xlock_rwlock_ns(&(i)->cs_lock)
+#define IDX_CAC_UNLOCK(i, o)			xt_unlock_rwlock_ns(&(i)->cs_lock)
+#elif defined(IDX_CAC_USE_RWMUTEX)
+#define IDX_CAC_LOCK_TYPE				XTRWMutexRec
+#define IDX_CAC_INIT_LOCK(s, i)			xt_rwmutex_init_with_autoname(s, &(i)->cs_lock)
+#define IDX_CAC_FREE_LOCK(s, i)			xt_rwmutex_free(s, &(i)->cs_lock)	
+#define IDX_CAC_READ_LOCK(i, o)			xt_rwmutex_slock(&(i)->cs_lock, (o)->t_id)
+#define IDX_CAC_WRITE_LOCK(i, o)		xt_rwmutex_xlock(&(i)->cs_lock, (o)->t_id)
+#define IDX_CAC_UNLOCK(i, o)			xt_rwmutex_unlock(&(i)->cs_lock, (o)->t_id)
+#elif defined(IDX_CAC_USE_SPINXSLOCK)
+#define IDX_CAC_LOCK_TYPE				XTSpinXSLockRec
+#define IDX_CAC_INIT_LOCK(s, i)			xt_spinxslock_init_with_autoname(s, &(i)->cs_lock)
+#define IDX_CAC_FREE_LOCK(s, i)			xt_spinxslock_free(s, &(i)->cs_lock)	
+#define IDX_CAC_READ_LOCK(i, s)			xt_spinxslock_slock(&(i)->cs_lock, (s)->t_id)
+#define IDX_CAC_WRITE_LOCK(i, s)		xt_spinxslock_xlock(&(i)->cs_lock, (s)->t_id)
+#define IDX_CAC_UNLOCK(i, s)			xt_spinxslock_unlock(&(i)->cs_lock, (s)->t_id)
+#endif
+
+#define ID_HANDLE_USE_SPINLOCK
+//#define ID_HANDLE_USE_PTHREAD_RW
+
+#if defined(ID_HANDLE_USE_PTHREAD_RW)
+#define ID_HANDLE_LOCK_TYPE				xt_mutex_type
+#define ID_HANDLE_INIT_LOCK(s, i)		xt_init_mutex_with_autoname(s, i)
+#define ID_HANDLE_FREE_LOCK(s, i)		xt_free_mutex(i)	
+#define ID_HANDLE_LOCK(i)				xt_lock_mutex_ns(i)
+#define ID_HANDLE_UNLOCK(i)				xt_unlock_mutex_ns(i)
+#elif defined(ID_HANDLE_USE_SPINLOCK)
+#define ID_HANDLE_LOCK_TYPE				XTSpinLockRec
+#define ID_HANDLE_INIT_LOCK(s, i)		xt_spinlock_init_with_autoname(s, i)
+#define ID_HANDLE_FREE_LOCK(s, i)		xt_spinlock_free(s, i)	
+#define ID_HANDLE_LOCK(i)				xt_spinlock_lock(i)
+#define ID_HANDLE_UNLOCK(i)				xt_spinlock_unlock(i)
+#endif
+
+#define XT_HANDLE_SLOTS					37
+
+/*
+#ifdef DEBUG
+#define XT_INIT_HANDLE_COUNT			0
+#define XT_INIT_HANDLE_BLOCKS			0
+#else
+#define XT_INIT_HANDLE_COUNT			40
+#define XT_INIT_HANDLE_BLOCKS			10
+#endif
+*/
+
+/* A disk cache segment. The cache is divided into a number of segments
+ * to improve concurrency.
+ */
+typedef struct DcSegment {
+	IDX_CAC_LOCK_TYPE	cs_lock;						/* The cache segment lock. */
+	XTIndBlockPtr		*cs_hash_table;
+} DcSegmentRec, *DcSegmentPtr;
+
+typedef struct DcHandleSlot {
+	ID_HANDLE_LOCK_TYPE	hs_handles_lock;
+	XTIndHandleBlockPtr	hs_free_blocks;
+	XTIndHandlePtr		hs_free_handles;
+	XTIndHandlePtr		hs_used_handles;
+} DcHandleSlotRec, *DcHandleSlotPtr;
+
+typedef struct DcGlobals {
+	xt_mutex_type		cg_lock;						/* The public cache lock. */
+	DcSegmentRec		cg_segment[IDX_CAC_SEGMENT_COUNT];
+	XTIndBlockPtr		cg_blocks;
+#ifdef XT_USE_DIRECT_IO_ON_INDEX
+	xtWord1				*cg_buffer;
+#endif
+	XTIndBlockPtr		cg_free_list;
+	xtWord4				cg_free_count;
+	xtWord4				cg_ru_now;						/* A counter as described by Jim Starkey (my thanks) */
+	XTIndBlockPtr		cg_lru_block;
+	XTIndBlockPtr		cg_mru_block;
+	xtWord4				cg_hash_size;
+	xtWord4				cg_block_count;
+	xtWord4				cg_max_free;
+#ifdef DEBUG_CHECK_IND_CACHE
+	u_int				cg_reserved_by_ots;				/* Number of blocks reserved by open tables. */
+	u_int				cg_read_count;					/* Number of blocks being read. */
+#endif
+
+	/* Index cache handles: */
+	DcHandleSlotRec		cg_handle_slot[XT_HANDLE_SLOTS];
+} DcGlobalsRec;
+
+static DcGlobalsRec	ind_cac_globals;
+
+#ifdef XT_USE_MYSYS
+#ifdef xtPublic
+#undef xtPublic
+#endif
+#include "my_global.h"
+#include "my_sys.h"
+#include "keycache.h"
+KEY_CACHE my_cache;
+#undef	pthread_rwlock_rdlock
+#undef	pthread_rwlock_wrlock
+#undef	pthread_rwlock_unlock
+#undef	pthread_mutex_lock
+#undef	pthread_mutex_unlock
+#undef	pthread_cond_wait
+#undef	pthread_cond_broadcast
+#undef	xt_mutex_type
+#define xtPublic
+#endif
+
+/*
+ * -----------------------------------------------------------------------
+ * INDEX CACHE HANDLES
+ */
+
+static XTIndHandlePtr ind_alloc_handle()
+{
+	XTIndHandlePtr handle;
+
+	if (!(handle = (XTIndHandlePtr) xt_calloc_ns(sizeof(XTIndHandleRec))))
+		return NULL;
+	xt_spinlock_init_with_autoname(NULL, &handle->ih_lock);
+	return handle;
+}
+
+static void ind_free_handle(XTIndHandlePtr handle)
+{
+	xt_spinlock_free(NULL, &handle->ih_lock);
+	xt_free_ns(handle);
+}
+
+static void ind_handle_exit(XTThreadPtr self)
+{
+	DcHandleSlotPtr		hs;
+	XTIndHandlePtr		handle;
+	XTIndHandleBlockPtr	hptr;
+
+	for (int i=0; i<XT_HANDLE_SLOTS; i++) {
+		hs = &ind_cac_globals.cg_handle_slot[i];
+
+		while (hs->hs_used_handles) {
+			handle = hs->hs_used_handles;
+			xt_ind_release_handle(handle, FALSE, self);
+		}
+
+		while (hs->hs_free_blocks) {
+			hptr = hs->hs_free_blocks;
+			hs->hs_free_blocks = hptr->hb_next;
+			xt_free(self, hptr);
+		}
+
+		while (hs->hs_free_handles) {
+			handle = hs->hs_free_handles;
+			hs->hs_free_handles = handle->ih_next;
+			ind_free_handle(handle);
+		}
+
+		ID_HANDLE_FREE_LOCK(self, &hs->hs_handles_lock);
+	}
+}
+
+static void ind_handle_init(XTThreadPtr self)
+{
+	DcHandleSlotPtr		hs;
+
+	for (int i=0; i<XT_HANDLE_SLOTS; i++) {
+		hs = &ind_cac_globals.cg_handle_slot[i];
+		memset(hs, 0, sizeof(DcHandleSlotRec));
+		ID_HANDLE_INIT_LOCK(self, &hs->hs_handles_lock);
+	}
+}
+
+//#define CHECK_HANDLE_STRUCTS
+
+#ifdef CHECK_HANDLE_STRUCTS
+static int gdummy = 0;
+
+static void ic_stop_here()
+{
+	gdummy = gdummy + 1;
+	printf("Nooo %d!\n", gdummy);
+}
+
+static void ic_check_handle_structs()
+{
+	XTIndHandlePtr		handle, phandle;
+	XTIndHandleBlockPtr	hptr, phptr;
+	int					count = 0;
+	int					ctest;
+
+	phandle = NULL;
+	handle = ind_cac_globals.cg_used_handles;
+	while (handle) {
+		if (handle == phandle)
+			ic_stop_here();
+		if (handle->ih_prev != phandle)
+			ic_stop_here();
+		if (handle->ih_cache_reference) {
+			ctest = handle->x.ih_cache_block->cb_handle_count;
+			if (ctest == 0 || ctest > 100)
+				ic_stop_here();
+		}
+		else {
+			ctest = handle->x.ih_handle_block->hb_ref_count;
+			if (ctest == 0 || ctest > 100)
+				ic_stop_here();
+		}
+		phandle = handle;
+		handle = handle->ih_next;
+		count++;
+		if (count > 1000)
+			ic_stop_here();
+	}
+
+	count = 0;
+	hptr = ind_cac_globals.cg_free_blocks;
+	while (hptr) {
+		if (hptr == phptr)
+			ic_stop_here();
+		phptr = hptr;
+		hptr = hptr->hb_next;
+		count++;
+		if (count > 1000)
+			ic_stop_here();
+	}
+
+	count = 0;
+	handle = ind_cac_globals.cg_free_handles;
+	while (handle) {
+		if (handle == phandle)
+			ic_stop_here();
+		phandle = handle;
+		handle = handle->ih_next;
+		count++;
+		if (count > 1000)
+			ic_stop_here();
+	}
+}
+#endif
+
+/*
+ * Get a handle to the index block.
+ * This function is called by index scanners (readers).
+ */
+xtPublic XTIndHandlePtr xt_ind_get_handle(XTOpenTablePtr ot, XTIndexPtr ind, XTIndReferencePtr iref)
+{
+	DcHandleSlotPtr	hs;
+	XTIndHandlePtr	handle;
+
+	hs = &ind_cac_globals.cg_handle_slot[iref->ir_block->cb_address % XT_HANDLE_SLOTS];
+
+	ASSERT_NS(iref->ir_xlock == FALSE);
+	ASSERT_NS(iref->ir_updated == FALSE);
+	ID_HANDLE_LOCK(&hs->hs_handles_lock);
+#ifdef CHECK_HANDLE_STRUCTS
+	ic_check_handle_structs();
+#endif
+	if ((handle = hs->hs_free_handles))
+		hs->hs_free_handles = handle->ih_next;
+	else {
+		if (!(handle = ind_alloc_handle())) {
+			ID_HANDLE_UNLOCK(&hs->hs_handles_lock);
+			xt_ind_release(ot, ind, XT_UNLOCK_READ, iref);
+			return NULL;
+		}
+	}
+	if (hs->hs_used_handles)
+		hs->hs_used_handles->ih_prev = handle;
+	handle->ih_next = hs->hs_used_handles;
+	handle->ih_prev = NULL;
+	handle->ih_address = iref->ir_block->cb_address;
+	handle->ih_cache_reference = TRUE;
+	handle->x.ih_cache_block = iref->ir_block;
+	handle->ih_branch = iref->ir_branch;
+	/* {HANDLE-COUNT-USAGE}
+	 * This is safe because:
+	 *
+	 * I have an Slock on the cache block, and I have
+	 * at least an Slock on the index.
+	 * So this excludes anyone who is reading 
+	 * cb_handle_count in the index.
+	 * (all cache block writers, and the freeer).
+	 *
+	 * The increment is safe because I have the list
+	 * lock (hs_handles_lock), which is required by anyone else
+	 * who increments or decrements this value.
+	 */
+	iref->ir_block->cb_handle_count++;
+	hs->hs_used_handles = handle;
+#ifdef CHECK_HANDLE_STRUCTS
+	ic_check_handle_structs();
+#endif
+	ID_HANDLE_UNLOCK(&hs->hs_handles_lock);
+	xt_ind_release(ot, ind, XT_UNLOCK_READ, iref);
+	return handle;
+}
+
+xtPublic void xt_ind_release_handle(XTIndHandlePtr handle, xtBool have_lock, XTThreadPtr thread)
+{
+	DcHandleSlotPtr	hs;
+	XTIndBlockPtr	block = NULL;
+	u_int			hash_idx = 0;
+	DcSegmentPtr	seg = NULL;
+	XTIndBlockPtr	xblock;
+
+	/* The lock order is:
+	 * 1. Cache segment (cs_lock) - This is only by ind_free_block()!
+	 * 1. S/Slock cache block (cb_lock)
+	 * 2. List lock (cg_handles_lock).
+	 * 3. Handle lock (ih_lock)
+	 */
+	if (!have_lock)
+		xt_spinlock_lock(&handle->ih_lock);
+
+	/* Get the lock on the cache page if required: */
+	if (handle->ih_cache_reference) {
+		u_int			file_id;
+		xtIndexNodeID	address;
+
+		block = handle->x.ih_cache_block;
+
+		file_id = block->cb_file_id;
+		address = block->cb_address;
+		hash_idx = XT_NODE_ID(address) + (file_id * 223);
+		seg = &ind_cac_globals.cg_segment[hash_idx & IDX_CAC_SEGMENT_MASK];
+		hash_idx = (hash_idx >> XT_INDEX_CACHE_SEGMENT_SHIFTS) % ind_cac_globals.cg_hash_size;
+	}
+
+	xt_spinlock_unlock(&handle->ih_lock);
+
+	/* Because of the lock order, I have to release the
+	 * handle before I get a lock on the cache block.
+	 *
+	 * But, by doing this, thie cache block may be gone!
+	 */
+	if (block) {
+		IDX_CAC_READ_LOCK(seg, thread);
+		xblock = seg->cs_hash_table[hash_idx];
+		while (xblock) {
+			if (block == xblock) {
+				/* Found the block... 
+				 * {HANDLE-COUNT-SLOCK}
+				 * 04.05.2009, changed to slock.
+				 */
+				XT_IPAGE_READ_LOCK(&block->cb_lock);
+				goto block_found;
+			}
+			xblock = xblock->cb_next;
+		}
+		block = NULL;
+		block_found:
+		IDX_CAC_UNLOCK(seg, thread);
+	}
+
+	hs = &ind_cac_globals.cg_handle_slot[handle->ih_address % XT_HANDLE_SLOTS];
+
+	ID_HANDLE_LOCK(&hs->hs_handles_lock);
+#ifdef CHECK_HANDLE_STRUCTS
+	ic_check_handle_structs();
+#endif
+
+	/* I don't need to lock the handle because I have locked
+	 * the list, and no other thread can change the
+	 * handle without first getting a lock on the list.
+	 *
+	 * In addition, the caller is the only owner of the
+	 * handle, and the only thread with an independent
+	 * reference to the handle.
+	 * All other access occur over the list.
+	 */
+
+	/* Remove the reference to the cache or a handle block: */
+	if (handle->ih_cache_reference) {
+		ASSERT_NS(block == handle->x.ih_cache_block);
+		ASSERT_NS(block && block->cb_handle_count > 0);
+		/* {HANDLE-COUNT-USAGE}
+		 * This is safe here because I have excluded
+		 * all readers by taking an Xlock on the
+		 * cache block (CHANGED - see below).
+		 *
+		 * {HANDLE-COUNT-SLOCK}
+		 * 04.05.2009, changed to slock.
+		 * Should be OK, because:
+		 * A have a lock on the list lock (hs_handles_lock),
+		 * which prevents concurrent updates to cb_handle_count.
+		 *
+		 * I have also have a read lock on the cache block
+		 * but not a lock on the index. As a result, we cannot
+		 * excluded all index writers (and readers of 
+		 * cb_handle_count.
+		 */
+		block->cb_handle_count--;
+	}
+	else {
+		XTIndHandleBlockPtr	hptr = handle->x.ih_handle_block;
+
+		ASSERT_NS(!handle->ih_cache_reference);
+		ASSERT_NS(hptr->hb_ref_count > 0);
+		hptr->hb_ref_count--;
+		if (!hptr->hb_ref_count) {
+			/* Put it back on the free list: */
+			hptr->hb_next = hs->hs_free_blocks;
+			hs->hs_free_blocks = hptr;
+		}
+	}
+
+	/* Unlink the handle: */
+	if (handle->ih_next)
+		handle->ih_next->ih_prev = handle->ih_prev;
+	if (handle->ih_prev)
+		handle->ih_prev->ih_next = handle->ih_next;
+	if (hs->hs_used_handles == handle)
+		hs->hs_used_handles = handle->ih_next;
+
+	/* Put it on the free list: */
+	handle->ih_next = hs->hs_free_handles;
+	hs->hs_free_handles = handle;
+
+#ifdef CHECK_HANDLE_STRUCTS
+	ic_check_handle_structs();
+#endif
+	ID_HANDLE_UNLOCK(&hs->hs_handles_lock);
+
+	if (block)
+		XT_IPAGE_UNLOCK(&block->cb_lock, FALSE);
+}
+
+/* Call this function before a referenced cache block is modified!
+ * This function is called by index updaters.
+ */
+xtPublic xtBool xt_ind_copy_on_write(XTIndReferencePtr iref)
+{
+	DcHandleSlotPtr		hs;
+	XTIndHandleBlockPtr	hptr;
+	u_int				branch_size;
+	XTIndHandlePtr		handle;
+	u_int				i = 0;
+
+	hs = &ind_cac_globals.cg_handle_slot[iref->ir_block->cb_address % XT_HANDLE_SLOTS];
+
+	ID_HANDLE_LOCK(&hs->hs_handles_lock);
+
+	/* {HANDLE-COUNT-USAGE}
+	 * This is only called by updaters of this index block, or
+	 * the free which holds an Xlock on the index block.
+	 * These are all mutually exclusive for the index block.
+	 *
+	 * {HANDLE-COUNT-SLOCK}
+	 * Do this check again, after we have the list lock (hs_handles_lock).
+	 * There is a small chance that the count has changed, since we last
+	 * checked because xt_ind_release_handle() only holds
+	 * an slock on the index page.
+	 *
+	 * An updater can sometimes have a XLOCK on the index and an slock
+	 * on the cache block. In this case xt_ind_release_handle()
+	 * could have run through.
+	 */
+	if (!iref->ir_block->cb_handle_count) {
+		ID_HANDLE_UNLOCK(&hs->hs_handles_lock);
+		return OK;
+	}
+
+#ifdef CHECK_HANDLE_STRUCTS
+	ic_check_handle_structs();
+#endif
+	if ((hptr = hs->hs_free_blocks))
+		hs->hs_free_blocks = hptr->hb_next;
+	else {
+		if (!(hptr = (XTIndHandleBlockPtr) xt_malloc_ns(sizeof(XTIndHandleBlockRec)))) {
+			ID_HANDLE_UNLOCK(&hs->hs_handles_lock);
+			return FAILED;
+		}
+	}
+
+	branch_size = XT_GET_INDEX_BLOCK_LEN(XT_GET_DISK_2(iref->ir_branch->tb_size_2));
+	memcpy(&hptr->hb_branch, iref->ir_branch, branch_size);
+	hptr->hb_ref_count = iref->ir_block->cb_handle_count;
+
+	handle = hs->hs_used_handles;
+	while (handle) {
+		if (handle->ih_branch == iref->ir_branch) {
+			i++;
+			xt_spinlock_lock(&handle->ih_lock);
+			ASSERT_NS(handle->ih_cache_reference);
+			handle->ih_cache_reference = FALSE;
+			handle->x.ih_handle_block = hptr;
+			handle->ih_branch = &hptr->hb_branch;
+			xt_spinlock_unlock(&handle->ih_lock);
+#ifndef DEBUG
+			if (i == hptr->hb_ref_count)
+				break;
+#endif
+		}
+		handle = handle->ih_next;
+	}
+#ifdef DEBUG
+	ASSERT_NS(hptr->hb_ref_count == i);
+#endif
+	/* {HANDLE-COUNT-USAGE}
+	 * It is safe to modify cb_handle_count when I have the
+	 * list lock, and I have excluded all readers!
+	 */
+	iref->ir_block->cb_handle_count = 0;
+#ifdef CHECK_HANDLE_STRUCTS
+	ic_check_handle_structs();
+#endif
+	ID_HANDLE_UNLOCK(&hs->hs_handles_lock);
+
+	return OK;
+}
+
+xtPublic void xt_ind_lock_handle(XTIndHandlePtr handle)
+{
+	xt_spinlock_lock(&handle->ih_lock);
+}
+
+xtPublic void xt_ind_unlock_handle(XTIndHandlePtr handle)
+{
+	xt_spinlock_unlock(&handle->ih_lock);
+}
+
+/*
+ * -----------------------------------------------------------------------
+ * INIT/EXIT
+ */
+
+/*
+ * Initialize the disk cache.
+ */
+xtPublic void xt_ind_init(XTThreadPtr self, size_t cache_size)
+{
+	XTIndBlockPtr	block;
+
+#ifdef XT_USE_MYSYS
+	init_key_cache(&my_cache, 1024, cache_size, 100, 300);
+#endif
+	/* Memory is devoted to the page data alone, I no longer count the size of the directory,
+	 * or the page overhead: */
+	ind_cac_globals.cg_block_count = cache_size / XT_INDEX_PAGE_SIZE;
+	ind_cac_globals.cg_hash_size = ind_cac_globals.cg_block_count / (IDX_CAC_SEGMENT_COUNT >> 1);
+	ind_cac_globals.cg_max_free = ind_cac_globals.cg_block_count / 10;
+	if (ind_cac_globals.cg_max_free < 8)
+		ind_cac_globals.cg_max_free = 8;
+	if (ind_cac_globals.cg_max_free > 128)
+		ind_cac_globals.cg_max_free = 128;
+
+	try_(a) {
+		for (u_int i=0; i<IDX_CAC_SEGMENT_COUNT; i++) {
+			ind_cac_globals.cg_segment[i].cs_hash_table = (XTIndBlockPtr *) xt_calloc(self, ind_cac_globals.cg_hash_size * sizeof(XTIndBlockPtr));
+			IDX_CAC_INIT_LOCK(self, &ind_cac_globals.cg_segment[i]);
+		}
+
+		block = (XTIndBlockPtr) xt_malloc(self, ind_cac_globals.cg_block_count * sizeof(XTIndBlockRec));
+		ind_cac_globals.cg_blocks = block;
+		xt_init_mutex_with_autoname(self, &ind_cac_globals.cg_lock);
+#ifdef XT_USE_DIRECT_IO_ON_INDEX
+		xtWord1 *buffer;
+#ifdef XT_WIN
+		size_t	psize = 512;
+#else
+		size_t	psize = getpagesize();
+#endif
+		size_t	diff;
+
+		buffer = (xtWord1 *) xt_malloc(self, (ind_cac_globals.cg_block_count * XT_INDEX_PAGE_SIZE));
+		diff = (size_t) buffer % psize;
+		if (diff != 0) {
+			xt_free(self, buffer);
+			buffer = (xtWord1 *) xt_malloc(self, (ind_cac_globals.cg_block_count * XT_INDEX_PAGE_SIZE) + psize);
+			diff = (size_t) buffer % psize;
+			if (diff != 0)
+				diff = psize - diff;
+		}
+		ind_cac_globals.cg_buffer = buffer;
+		buffer += diff;
+#endif
+
+		for (u_int i=0; i<ind_cac_globals.cg_block_count; i++) {
+			XT_IPAGE_INIT_LOCK(self, &block->cb_lock);
+			block->cb_state = IDX_CAC_BLOCK_FREE;
+			block->cb_next = ind_cac_globals.cg_free_list;
+#ifdef XT_USE_DIRECT_IO_ON_INDEX
+			block->cb_data = buffer;
+			buffer += XT_INDEX_PAGE_SIZE;
+#endif
+			ind_cac_globals.cg_free_list = block;
+			block++;
+		}
+		ind_cac_globals.cg_free_count = ind_cac_globals.cg_block_count;
+#ifdef DEBUG_CHECK_IND_CACHE
+		ind_cac_globals.cg_reserved_by_ots = 0;
+#endif
+		ind_handle_init(self);
+	}
+	catch_(a) {
+		xt_ind_exit(self);
+		throw_();
+	}
+	cont_(a);
+}
+
+xtPublic void xt_ind_exit(XTThreadPtr self)
+{
+#ifdef XT_USE_MYSYS
+	end_key_cache(&my_cache, 1);
+#endif
+	for (u_int i=0; i<IDX_CAC_SEGMENT_COUNT; i++) {
+		if (ind_cac_globals.cg_segment[i].cs_hash_table) {
+			xt_free(self, ind_cac_globals.cg_segment[i].cs_hash_table);
+			ind_cac_globals.cg_segment[i].cs_hash_table = NULL;
+			IDX_CAC_FREE_LOCK(self, &ind_cac_globals.cg_segment[i]);
+		}
+	}
+
+	if (ind_cac_globals.cg_blocks) {
+		xt_free(self, ind_cac_globals.cg_blocks);
+		ind_cac_globals.cg_blocks = NULL;
+		xt_free_mutex(&ind_cac_globals.cg_lock);
+	}
+#ifdef XT_USE_DIRECT_IO_ON_INDEX
+	if (ind_cac_globals.cg_buffer) {
+		xt_free(self, ind_cac_globals.cg_buffer);
+		ind_cac_globals.cg_buffer = NULL;
+	}
+#endif
+	ind_handle_exit(self);
+
+	memset(&ind_cac_globals, 0, sizeof(ind_cac_globals));
+}
+
+xtPublic xtInt8 xt_ind_get_usage()
+{
+	xtInt8 size = 0;
+
+	size = (xtInt8) (ind_cac_globals.cg_block_count - ind_cac_globals.cg_free_count) * (xtInt8) XT_INDEX_PAGE_SIZE;
+	return size;
+}
+
+xtPublic xtInt8 xt_ind_get_size()
+{
+	xtInt8 size = 0;
+
+	size = (xtInt8) ind_cac_globals.cg_block_count * (xtInt8) XT_INDEX_PAGE_SIZE;
+	return size;
+}
+
+/*
+ * -----------------------------------------------------------------------
+ * INDEX CHECKING
+ */
+
+xtPublic void xt_ind_check_cache(XTIndexPtr ind)
+{
+	XTIndBlockPtr	block;
+	u_int			free_count, inuse_count, clean_count;
+	xtBool			check_count = FALSE;
+
+	if (ind == (XTIndex *) 1) {
+		ind = NULL;
+		check_count = TRUE;
+	}
+
+	// Check the dirty list:
+	if (ind) {
+		u_int cnt = 0;
+
+		block = ind->mi_dirty_list;
+		while (block) {
+			cnt++;
+			ASSERT_NS(block->cb_state == IDX_CAC_BLOCK_DIRTY);
+			block = block->cb_dirty_next;
+		}
+		ASSERT_NS(ind->mi_dirty_blocks == cnt);
+	}
+
+	xt_lock_mutex_ns(&ind_cac_globals.cg_lock);
+
+	// Check the free list:
+	free_count = 0;
+	block = ind_cac_globals.cg_free_list;
+	while (block) {
+		free_count++;
+		ASSERT_NS(block->cb_state == IDX_CAC_BLOCK_FREE);
+		block = block->cb_next;
+	}
+	ASSERT_NS(ind_cac_globals.cg_free_count == free_count);
+
+	/* Check the LRU list: */
+	XTIndBlockPtr list_block, plist_block;
+	
+	plist_block = NULL;
+	list_block = ind_cac_globals.cg_lru_block;
+	if (list_block) {
+		ASSERT_NS(ind_cac_globals.cg_mru_block != NULL);
+		ASSERT_NS(ind_cac_globals.cg_mru_block->cb_mr_used == NULL);
+		ASSERT_NS(list_block->cb_lr_used == NULL);
+		inuse_count = 0;
+		clean_count = 0;
+		while (list_block) {
+			inuse_count++;
+			ASSERT_NS(list_block->cb_state == IDX_CAC_BLOCK_DIRTY || list_block->cb_state == IDX_CAC_BLOCK_CLEAN);
+			if (list_block->cb_state == IDX_CAC_BLOCK_CLEAN)
+				clean_count++;
+			ASSERT_NS(block != list_block);
+			ASSERT_NS(list_block->cb_lr_used == plist_block);
+			plist_block = list_block;
+			list_block = list_block->cb_mr_used;
+		}
+		ASSERT_NS(ind_cac_globals.cg_mru_block == plist_block);
+	}
+	else {
+		inuse_count = 0;
+		clean_count = 0;
+		ASSERT_NS(ind_cac_globals.cg_mru_block == NULL);
+	}
+
+#ifdef DEBUG_CHECK_IND_CACHE
+	ASSERT_NS(free_count + inuse_count + ind_cac_globals.cg_reserved_by_ots + ind_cac_globals.cg_read_count == ind_cac_globals.cg_block_count);
+#endif
+	xt_unlock_mutex_ns(&ind_cac_globals.cg_lock);
+	if (check_count) {
+		/* We have just flushed, check how much is now free/clean. */
+		if (free_count + clean_count < 10) {
+			/* This could be a problem: */
+			printf("Cache very low!\n");
+		}
+	}
+}
+
+#ifdef XXXXDEBUG
+static void ind_cac_check_on_dirty_list(DcSegmentPtr seg, XTIndBlockPtr block)
+{
+	XTIndBlockPtr	list_block, plist_block;
+	xtBool		found = FALSE;
+	
+	plist_block = NULL;
+	list_block = seg->cs_dirty_list[block->cb_file_id % XT_INDEX_CACHE_FILE_SLOTS];
+	while (list_block) {
+		ASSERT_NS(list_block->cb_state == IDX_CAC_BLOCK_DIRTY);
+		ASSERT_NS(list_block->cb_dirty_prev == plist_block);
+		if (list_block == block)
+			found = TRUE;
+		plist_block = list_block;
+		list_block = list_block->cb_dirty_next;
+	}
+	ASSERT_NS(found);
+}
+
+static void ind_cac_check_dirty_list(DcSegmentPtr seg, XTIndBlockPtr block)
+{
+	XTIndBlockPtr list_block, plist_block;
+	
+	for (u_int j=0; j<XT_INDEX_CACHE_FILE_SLOTS; j++) {
+		plist_block = NULL;
+		list_block = seg->cs_dirty_list[j];
+		while (list_block) {
+			ASSERT_NS(list_block->cb_state == IDX_CAC_BLOCK_DIRTY);
+			ASSERT_NS(block != list_block);
+			ASSERT_NS(list_block->cb_dirty_prev == plist_block);
+			plist_block = list_block;
+			list_block = list_block->cb_dirty_next;
+		}
+	}
+}
+
+#endif
+
+/*
+ * -----------------------------------------------------------------------
+ * FREEING INDEX CACHE
+ */
+
+/*
+ * This function return TRUE if the block is freed. 
+ * This function returns FALSE if the block cannot be found, or the
+ * block is not clean.
+ *
+ * We also return FALSE if we cannot copy the block to the handle
+ * (if this is required). This will be due to out-of-memory!
+ */
+static xtBool ind_free_block(XTOpenTablePtr ot, XTIndBlockPtr block)
+{
+	XTIndBlockPtr	xblock, pxblock;
+	u_int			hash_idx;
+	u_int			file_id;
+	xtIndexNodeID	address;
+	DcSegmentPtr	seg;
+
+#ifdef DEBUG_CHECK_IND_CACHE
+	xt_ind_check_cache(NULL);
+#endif
+	file_id = block->cb_file_id;
+	address = block->cb_address;
+
+	hash_idx = XT_NODE_ID(address) + (file_id * 223);
+	seg = &ind_cac_globals.cg_segment[hash_idx & IDX_CAC_SEGMENT_MASK];
+	hash_idx = (hash_idx >> XT_INDEX_CACHE_SEGMENT_SHIFTS) % ind_cac_globals.cg_hash_size;
+
+	IDX_CAC_WRITE_LOCK(seg, ot->ot_thread);
+
+	pxblock = NULL;
+	xblock = seg->cs_hash_table[hash_idx];
+	while (xblock) {
+		if (block == xblock) {
+			/* Found the block... */
+			XT_IPAGE_WRITE_LOCK(&block->cb_lock, ot->ot_thread->t_id);
+			if (block->cb_state != IDX_CAC_BLOCK_CLEAN) {
+				/* This block cannot be freeed: */
+				XT_IPAGE_UNLOCK(&block->cb_lock, TRUE);
+				IDX_CAC_UNLOCK(seg, ot->ot_thread);
+#ifdef DEBUG_CHECK_IND_CACHE
+				xt_ind_check_cache(NULL);
+#endif
+				return FALSE;
+			}
+			
+			goto free_the_block;
+		}
+		pxblock = xblock;
+		xblock = xblock->cb_next;
+	}
+
+	IDX_CAC_UNLOCK(seg, ot->ot_thread);
+
+	/* Not found (this can happen, if block was freed by another thread) */
+#ifdef DEBUG_CHECK_IND_CACHE
+	xt_ind_check_cache(NULL);
+#endif
+	return FALSE;
+
+	free_the_block:
+
+	/* If the block is reference by a handle, then we
+	 * have to copy the data to the handle before we
+	 * free the page:
+	 */
+	/* {HANDLE-COUNT-USAGE}
+	 * This access is safe because:
+	 *
+	 * We have an Xlock on the cache block, which excludes
+	 * all other writers that want to change the cache block
+	 * and also all readers of the cache block, because
+	 * they all have at least an Slock on the cache block.
+	 */
+	if (block->cb_handle_count) {
+		XTIndReferenceRec	iref;
+		
+		iref.ir_xlock = TRUE;
+		iref.ir_updated = FALSE;
+		iref.ir_block = block;
+		iref.ir_branch = (XTIdxBranchDPtr) block->cb_data;
+		if (!xt_ind_copy_on_write(&iref)) {
+			XT_IPAGE_UNLOCK(&block->cb_lock, TRUE);
+			return FALSE;
+		}
+	}
+
+	/* Block is clean, remove from the hash table: */
+	if (pxblock)
+		pxblock->cb_next = block->cb_next;
+	else
+		seg->cs_hash_table[hash_idx] = block->cb_next;
+
+	xt_lock_mutex_ns(&ind_cac_globals.cg_lock);
+
+	/* Remove from the MRU list: */
+	if (ind_cac_globals.cg_lru_block == block)
+		ind_cac_globals.cg_lru_block = block->cb_mr_used;
+	if (ind_cac_globals.cg_mru_block == block)
+		ind_cac_globals.cg_mru_block = block->cb_lr_used;
+	
+	/* Note, I am updating blocks for which I have no lock
+	 * here. But I think this is OK because I have a lock
+	 * for the MRU list.
+	 */
+	if (block->cb_lr_used)
+		block->cb_lr_used->cb_mr_used = block->cb_mr_used;
+	if (block->cb_mr_used)
+		block->cb_mr_used->cb_lr_used = block->cb_lr_used;
+
+	/* The block is now free: */
+	block->cb_next = ind_cac_globals.cg_free_list;
+	ind_cac_globals.cg_free_list = block;
+	ind_cac_globals.cg_free_count++;
+	block->cb_state = IDX_CAC_BLOCK_FREE;
+	IDX_TRACE("%d- f%x\n", (int) XT_NODE_ID(address), (int) XT_GET_DISK_2(block->cb_data));
+
+	/* Unlock BEFORE the block is reused! */
+	XT_IPAGE_UNLOCK(&block->cb_lock, TRUE);
+
+	xt_unlock_mutex_ns(&ind_cac_globals.cg_lock);
+
+	IDX_CAC_UNLOCK(seg, ot->ot_thread);
+
+#ifdef DEBUG_CHECK_IND_CACHE
+	xt_ind_check_cache(NULL);
+#endif
+	return TRUE;
+}
+
+#define IND_CACHE_MAX_BLOCKS_TO_FREE		100
+
+/*
+ * Return the number of blocks freed.
+ *
+ * The idea is to grab a list of blocks to free.
+ * The list consists of the LRU blocks that are
+ * clean.
+ *
+ * Free as many as possible (up to max of blocks_required)
+ * from the list, even if LRU position has changed
+ * (or we have a race if there are too few blocks).
+ * However, if the block cannot be found, or is dirty
+ * we must skip it.
+ *
+ * Repeat until we find no blocks for the list, or
+ * we have freed 'blocks_required'.
+ *
+ * 'not_this' is a block that must not be freed because
+ * it is locked by the calling thread!
+ */
+static u_int ind_cac_free_lru_blocks(XTOpenTablePtr ot, u_int blocks_required, XTIdxBranchDPtr not_this)
+{
+	register DcGlobalsRec	*dcg = &ind_cac_globals;
+	XTIndBlockPtr			to_free[IND_CACHE_MAX_BLOCKS_TO_FREE];
+	int						count;
+	XTIndBlockPtr			block;
+	u_int					blocks_freed = 0;
+	XTIndBlockPtr			locked_block;
+
+#ifdef XT_USE_DIRECT_IO_ON_INDEX
+#error This will not work!
+#endif
+	locked_block = (XTIndBlockPtr) ((xtWord1 *) not_this - offsetof(XTIndBlockRec, cb_data));
+
+	retry:
+	xt_lock_mutex_ns(&ind_cac_globals.cg_lock);
+	block = dcg->cg_lru_block;
+	count = 0;
+	while (block && count < IND_CACHE_MAX_BLOCKS_TO_FREE) {
+		if (block != locked_block && block->cb_state == IDX_CAC_BLOCK_CLEAN) {
+			to_free[count] = block;
+			count++;
+		}
+		block = block->cb_mr_used;
+	}
+	xt_unlock_mutex_ns(&ind_cac_globals.cg_lock);
+
+	if (!count)
+		return blocks_freed;
+
+	for (int i=0; i<count; i++) {
+		if (ind_free_block(ot, to_free[i]))
+			blocks_freed++;
+		if (blocks_freed >= blocks_required &&
+			ind_cac_globals.cg_free_count >= ind_cac_globals.cg_max_free + blocks_required)
+		return blocks_freed;
+	}
+
+	goto retry;
+}
+
+/*
+ * -----------------------------------------------------------------------
+ * MAIN CACHE FUNCTIONS
+ */
+
+/*
+ * Fetch the block. Note, if we are about to write the block
+ * then there is no need to read it from disk!
+ */
+static XTIndBlockPtr ind_cac_fetch(XTOpenTablePtr ot, XTIndexPtr ind, xtIndexNodeID address, DcSegmentPtr *ret_seg, xtBool read_data)
+{
+	register XTOpenFilePtr	file = ot->ot_ind_file;
+	register XTIndBlockPtr	block, new_block;
+	register DcSegmentPtr	seg;
+	register u_int			hash_idx;
+	register DcGlobalsRec	*dcg = &ind_cac_globals;
+	size_t					red_size;
+
+#ifdef DEBUG_CHECK_IND_CACHE
+	xt_ind_check_cache(NULL);
+#endif
+	/* Address, plus file ID multiplied by my favorite prime number! */
+	hash_idx = XT_NODE_ID(address) + (file->fr_id * 223);
+	seg = &dcg->cg_segment[hash_idx & IDX_CAC_SEGMENT_MASK];
+	hash_idx = (hash_idx >> XT_INDEX_CACHE_SEGMENT_SHIFTS) % dcg->cg_hash_size;
+
+	IDX_CAC_READ_LOCK(seg, ot->ot_thread);
+	block = seg->cs_hash_table[hash_idx];
+	while (block) {
+		if (XT_NODE_ID(block->cb_address) == XT_NODE_ID(address) && block->cb_file_id == file->fr_id) {
+			ASSERT_NS(block->cb_state != IDX_CAC_BLOCK_FREE);
+
+			/* Check how recently this page has been used: */
+			if (XT_TIME_DIFF(block->cb_ru_time, dcg->cg_ru_now) > (dcg->cg_block_count >> 1)) {
+				xt_lock_mutex_ns(&dcg->cg_lock);
+
+				/* Move to the front of the MRU list: */
+				block->cb_ru_time = ++dcg->cg_ru_now;
+				if (dcg->cg_mru_block != block) {
+					/* Remove from the MRU list: */
+					if (dcg->cg_lru_block == block)
+						dcg->cg_lru_block = block->cb_mr_used;
+					if (block->cb_lr_used)
+						block->cb_lr_used->cb_mr_used = block->cb_mr_used;
+					if (block->cb_mr_used)
+						block->cb_mr_used->cb_lr_used = block->cb_lr_used;
+
+					/* Make the block the most recently used: */
+					if ((block->cb_lr_used = dcg->cg_mru_block))
+						dcg->cg_mru_block->cb_mr_used = block;
+					block->cb_mr_used = NULL;
+					dcg->cg_mru_block = block;
+					if (!dcg->cg_lru_block)
+						dcg->cg_lru_block = block;
+				}
+
+				xt_unlock_mutex_ns(&dcg->cg_lock);
+			}
+		
+			*ret_seg = seg;
+#ifdef DEBUG_CHECK_IND_CACHE
+			xt_ind_check_cache(NULL);
+#endif
+			ot->ot_thread->st_statistics.st_ind_cache_hit++;
+			return block;
+		}
+		block = block->cb_next;
+	}
+	
+	/* Block not found... */
+	IDX_CAC_UNLOCK(seg, ot->ot_thread);
+
+	/* Check the open table reserve list first: */
+	if ((new_block = ot->ot_ind_res_bufs)) {
+		ot->ot_ind_res_bufs = new_block->cb_next;
+		ot->ot_ind_res_count--;
+#ifdef DEBUG_CHECK_IND_CACHE
+		xt_lock_mutex_ns(&dcg->cg_lock);
+		dcg->cg_reserved_by_ots--;
+		dcg->cg_read_count++;
+		xt_unlock_mutex_ns(&dcg->cg_lock);
+#endif
+		goto use_free_block;
+	}
+
+	free_some_blocks:
+	if (!dcg->cg_free_list) {
+		if (!ind_cac_free_lru_blocks(ot, 1, NULL)) {
+			if (!dcg->cg_free_list) {
+				xt_register_xterr(XT_REG_CONTEXT, XT_ERR_NO_INDEX_CACHE);
+#ifdef DEBUG_CHECK_IND_CACHE
+				xt_ind_check_cache(NULL);
+#endif
+				return NULL;
+			}
+		}
+	}
+
+	/* Get a free block: */
+	xt_lock_mutex_ns(&dcg->cg_lock);
+	if (!(new_block = dcg->cg_free_list)) {
+		xt_unlock_mutex_ns(&dcg->cg_lock);
+		goto free_some_blocks;
+	}
+	ASSERT_NS(new_block->cb_state == IDX_CAC_BLOCK_FREE);
+	dcg->cg_free_list = new_block->cb_next;
+	dcg->cg_free_count--;
+#ifdef DEBUG_CHECK_IND_CACHE
+	dcg->cg_read_count++;
+#endif
+	xt_unlock_mutex_ns(&dcg->cg_lock);
+
+	use_free_block:
+	new_block->cb_address = address;
+	new_block->cb_file_id = file->fr_id;
+	new_block->cb_state = IDX_CAC_BLOCK_CLEAN;
+	new_block->cb_handle_count = 0;
+	new_block->cp_flush_seq = 0;
+	new_block->cp_del_count = 0;
+	new_block->cb_dirty_next = NULL;
+	new_block->cb_dirty_prev = NULL;
+
+	if (read_data) {
+		if (!xt_pread_file(file, xt_ind_node_to_offset(ot->ot_table, address), XT_INDEX_PAGE_SIZE, 0, new_block->cb_data, &red_size, &ot->ot_thread->st_statistics.st_ind, ot->ot_thread)) {
+			xt_lock_mutex_ns(&dcg->cg_lock);
+			new_block->cb_next = dcg->cg_free_list;
+			dcg->cg_free_list = new_block;
+			dcg->cg_free_count++;
+#ifdef DEBUG_CHECK_IND_CACHE
+			dcg->cg_read_count--;
+#endif
+			new_block->cb_state = IDX_CAC_BLOCK_FREE;
+			IDX_TRACE("%d- F%x\n", (int) XT_NODE_ID(address), (int) XT_GET_DISK_2(new_block->cb_data));
+			xt_unlock_mutex_ns(&dcg->cg_lock);
+#ifdef DEBUG_CHECK_IND_CACHE
+			xt_ind_check_cache(NULL);
+#endif
+			return NULL;
+		}
+		IDX_TRACE("%d- R%x\n", (int) XT_NODE_ID(address), (int) XT_GET_DISK_2(new_block->cb_data));
+		ot->ot_thread->st_statistics.st_ind_cache_miss++;
+	}
+	else
+		red_size = 0;
+	// PMC - I don't think this is required! memset(new_block->cb_data + red_size, 0, XT_INDEX_PAGE_SIZE - red_size);
+
+	IDX_CAC_WRITE_LOCK(seg, ot->ot_thread);
+	block = seg->cs_hash_table[hash_idx];
+	while (block) {
+		if (XT_NODE_ID(block->cb_address) == XT_NODE_ID(address) && block->cb_file_id == file->fr_id) {
+			/* Oops, someone else was faster! */
+			xt_lock_mutex_ns(&dcg->cg_lock);
+			new_block->cb_next = dcg->cg_free_list;
+			dcg->cg_free_list = new_block;
+			dcg->cg_free_count++;
+#ifdef DEBUG_CHECK_IND_CACHE
+			dcg->cg_read_count--;
+#endif
+			new_block->cb_state = IDX_CAC_BLOCK_FREE;
+			IDX_TRACE("%d- F%x\n", (int) XT_NODE_ID(address), (int) XT_GET_DISK_2(new_block->cb_data));
+			xt_unlock_mutex_ns(&dcg->cg_lock);
+			goto done_ok;
+		}
+		block = block->cb_next;
+	}
+	block = new_block;
+
+	/* Make the block the most recently used: */
+	xt_lock_mutex_ns(&dcg->cg_lock);
+	block->cb_ru_time = ++dcg->cg_ru_now;
+	if ((block->cb_lr_used = dcg->cg_mru_block))
+		dcg->cg_mru_block->cb_mr_used = block;
+	block->cb_mr_used = NULL;
+	dcg->cg_mru_block = block;
+	if (!dcg->cg_lru_block)
+		dcg->cg_lru_block = block;
+#ifdef DEBUG_CHECK_IND_CACHE
+	dcg->cg_read_count--;
+#endif
+	xt_unlock_mutex_ns(&dcg->cg_lock);
+
+	/* {LAZY-DEL-INDEX-ITEMS}
+	 * Conditionally count the number of deleted entries in the index:
+	 * We do this before other threads can read the block.
+	 */
+	if (ind->mi_lazy_delete && read_data)
+		xt_ind_count_deleted_items(ot->ot_table, ind, block);
+
+	/* Add to the hash table: */
+	block->cb_next = seg->cs_hash_table[hash_idx];
+	seg->cs_hash_table[hash_idx] = block;
+
+	done_ok:
+	*ret_seg = seg;
+#ifdef DEBUG_CHECK_IND_CACHE
+	xt_ind_check_cache(NULL);
+#endif
+	return block;
+}
+
+static xtBool ind_cac_get(XTOpenTablePtr ot, xtIndexNodeID address, DcSegmentPtr *ret_seg, XTIndBlockPtr *ret_block)
+{
+	register XTOpenFilePtr	file = ot->ot_ind_file;
+	register XTIndBlockPtr	block;
+	register DcSegmentPtr	seg;
+	register u_int			hash_idx;
+	register DcGlobalsRec	*dcg = &ind_cac_globals;
+
+	hash_idx = XT_NODE_ID(address) + (file->fr_id * 223);
+	seg = &dcg->cg_segment[hash_idx & IDX_CAC_SEGMENT_MASK];
+	hash_idx = (hash_idx >> XT_INDEX_CACHE_SEGMENT_SHIFTS) % dcg->cg_hash_size;
+
+	IDX_CAC_READ_LOCK(seg, ot->ot_thread);
+	block = seg->cs_hash_table[hash_idx];
+	while (block) {
+		if (XT_NODE_ID(block->cb_address) == XT_NODE_ID(address) && block->cb_file_id == file->fr_id) {
+			ASSERT_NS(block->cb_state != IDX_CAC_BLOCK_FREE);
+
+			*ret_seg = seg;
+			*ret_block = block;
+			return OK;
+		}
+		block = block->cb_next;
+	}
+	IDX_CAC_UNLOCK(seg, ot->ot_thread);
+	
+	/* Block not found: */
+	*ret_seg = NULL;
+	*ret_block = NULL;
+	return OK;
+}
+
+xtPublic xtBool xt_ind_write(XTOpenTablePtr ot, XTIndexPtr ind, xtIndexNodeID address, size_t size, xtWord1 *data)
+{
+	XTIndBlockPtr	block;
+	DcSegmentPtr	seg;
+
+	if (!(block = ind_cac_fetch(ot, ind, address, &seg, FALSE)))
+		return FAILED;
+
+	XT_IPAGE_WRITE_LOCK(&block->cb_lock, ot->ot_thread->t_id);
+	ASSERT_NS(block->cb_state == IDX_CAC_BLOCK_CLEAN || block->cb_state == IDX_CAC_BLOCK_DIRTY);
+	memcpy(block->cb_data, data, size);
+	block->cp_flush_seq = ot->ot_table->tab_ind_flush_seq;
+	if (block->cb_state != IDX_CAC_BLOCK_DIRTY) {
+		TRACK_BLOCK_WRITE(offset);
+		xt_spinlock_lock(&ind->mi_dirty_lock);
+		if ((block->cb_dirty_next = ind->mi_dirty_list))
+			ind->mi_dirty_list->cb_dirty_prev = block;
+		block->cb_dirty_prev = NULL;
+		ind->mi_dirty_list = block;
+		ind->mi_dirty_blocks++;
+		xt_spinlock_unlock(&ind->mi_dirty_lock);
+		block->cb_state = IDX_CAC_BLOCK_DIRTY;
+	}
+	XT_IPAGE_UNLOCK(&block->cb_lock, TRUE);
+	IDX_CAC_UNLOCK(seg, ot->ot_thread);
+#ifdef XT_TRACK_INDEX_UPDATES
+	ot->ot_ind_changed++;
+#endif
+	return OK;
+}
+
+/*
+ * Update the cache, if in RAM.
+ */
+xtPublic xtBool xt_ind_write_cache(XTOpenTablePtr ot, xtIndexNodeID address, size_t size, xtWord1 *data)
+{
+	XTIndBlockPtr	block;
+	DcSegmentPtr	seg;
+
+	if (!ind_cac_get(ot, address, &seg, &block))
+		return FAILED;
+
+	if (block) {
+		XT_IPAGE_WRITE_LOCK(&block->cb_lock, ot->ot_thread->t_id);
+		ASSERT_NS(block->cb_state == IDX_CAC_BLOCK_CLEAN || block->cb_state == IDX_CAC_BLOCK_DIRTY);
+		memcpy(block->cb_data, data, size);
+		XT_IPAGE_UNLOCK(&block->cb_lock, TRUE);
+		IDX_CAC_UNLOCK(seg, ot->ot_thread);
+	}
+
+	return OK;
+}
+
+xtPublic xtBool xt_ind_clean(XTOpenTablePtr ot, XTIndexPtr ind, xtIndexNodeID address)
+{
+	XTIndBlockPtr	block;
+	DcSegmentPtr	seg;
+
+	if (!ind_cac_get(ot, address, &seg, &block))
+		return FAILED;
+	if (block) {
+		XT_IPAGE_WRITE_LOCK(&block->cb_lock, ot->ot_thread->t_id);
+		ASSERT_NS(block->cb_state == IDX_CAC_BLOCK_CLEAN || block->cb_state == IDX_CAC_BLOCK_DIRTY);
+
+		if (block->cb_state == IDX_CAC_BLOCK_DIRTY) {
+			/* Take the block off the dirty list: */
+			xt_spinlock_lock(&ind->mi_dirty_lock);
+			if (block->cb_dirty_next)
+				block->cb_dirty_next->cb_dirty_prev = block->cb_dirty_prev;
+			if (block->cb_dirty_prev)
+				block->cb_dirty_prev->cb_dirty_next = block->cb_dirty_next;
+			if (ind->mi_dirty_list == block)
+				ind->mi_dirty_list = block->cb_dirty_next;
+			ind->mi_dirty_blocks--;
+			xt_spinlock_unlock(&ind->mi_dirty_lock);
+			block->cb_state = IDX_CAC_BLOCK_CLEAN;
+		}
+		XT_IPAGE_UNLOCK(&block->cb_lock, TRUE);
+
+		IDX_CAC_UNLOCK(seg, ot->ot_thread);
+	}
+
+	return OK;
+}
+
+xtPublic xtBool xt_ind_read_bytes(XTOpenTablePtr ot, XTIndexPtr ind, xtIndexNodeID address, size_t size, xtWord1 *data)
+{
+	XTIndBlockPtr	block;
+	DcSegmentPtr	seg;
+
+	if (!(block = ind_cac_fetch(ot, ind, address, &seg, TRUE)))
+		return FAILED;
+
+	XT_IPAGE_READ_LOCK(&block->cb_lock);
+	memcpy(data, block->cb_data, size);
+	XT_IPAGE_UNLOCK(&block->cb_lock, FALSE);
+	IDX_CAC_UNLOCK(seg, ot->ot_thread);
+	return OK;
+}
+
+xtPublic xtBool xt_ind_fetch(XTOpenTablePtr ot, XTIndexPtr ind, xtIndexNodeID address, XTPageLockType ltype, XTIndReferencePtr iref)
+{
+	register XTIndBlockPtr	block;
+	DcSegmentPtr			seg;
+	xtWord2					branch_size;
+	xtBool					xlock = FALSE;
+
+#ifdef DEBUG
+	ASSERT_NS(iref->ir_xlock == 2);
+	ASSERT_NS(iref->ir_xlock == 2);
+#endif
+	if (!(block = ind_cac_fetch(ot, ind, address, &seg, TRUE)))
+		return FAILED;
+
+	branch_size = XT_GET_DISK_2(((XTIdxBranchDPtr) block->cb_data)->tb_size_2);
+	if (XT_GET_INDEX_BLOCK_LEN(branch_size) < 2 || XT_GET_INDEX_BLOCK_LEN(branch_size) > XT_INDEX_PAGE_SIZE) {
+		IDX_CAC_UNLOCK(seg, ot->ot_thread);
+		xt_register_taberr(XT_REG_CONTEXT, XT_ERR_INDEX_CORRUPTED, ot->ot_table->tab_name);
+		return FAILED;
+	}
+
+	switch (ltype) {
+		case XT_LOCK_READ:
+			break;
+		case XT_LOCK_WRITE:
+			xlock = TRUE;
+			break;
+		case XT_XLOCK_LEAF:
+			if (!XT_IS_NODE(branch_size))
+				xlock = TRUE;
+			break;
+		case XT_XLOCK_DEL_LEAF:
+			if (!XT_IS_NODE(branch_size)) {
+				if (ot->ot_table->tab_dic.dic_no_lazy_delete)
+					xlock = TRUE;
+				else {
+					/*
+					 * {LAZY-DEL-INDEX-ITEMS}
+					 *
+					 * We are fetch a page for delete purpose.
+					 * we decide here if we plan to do a lazy delete,
+					 * Or if we plan to compact the node.
+					 *
+					 * A lazy delete just requires a shared lock.
+					 *
+					 */
+					if (ind->mi_lazy_delete) {
+						/* If the number of deleted items is greater than
+						 * half of the number of times that can fit in the
+						 * page, then we will compact the node.
+						 */
+						if (!xt_idx_lazy_delete_on_leaf(ind, block, XT_GET_INDEX_BLOCK_LEN(branch_size)))
+							xlock = TRUE;
+					}
+					else
+						xlock = TRUE;
+				}
+			}
+			break;
+	}
+
+	if ((iref->ir_xlock = xlock))
+		XT_IPAGE_WRITE_LOCK(&block->cb_lock, ot->ot_thread->t_id);
+	else
+		XT_IPAGE_READ_LOCK(&block->cb_lock);
+
+	IDX_CAC_UNLOCK(seg, ot->ot_thread);
+
+	/* {DIRECT-IO}
+	 * Direct I/O requires that the buffer is 512 byte aligned.
+	 * To do this, cb_data is turned into a pointer, instead
+	 * of an array.
+	 * As a result, we need to pass a pointer to both the
+	 * cache block and the cache block data:
+	 */
+	iref->ir_updated = FALSE;
+	iref->ir_block = block;
+	iref->ir_branch = (XTIdxBranchDPtr) block->cb_data;
+	return OK;
+}
+
+xtPublic xtBool xt_ind_release(XTOpenTablePtr ot, XTIndexPtr ind, XTPageUnlockType XT_NDEBUG_UNUSED(utype), XTIndReferencePtr iref)
+{
+	register XTIndBlockPtr	block;
+
+	block = iref->ir_block;
+
+#ifdef DEBUG
+	ASSERT_NS(iref->ir_xlock != 2);
+	ASSERT_NS(iref->ir_updated != 2);
+	if (iref->ir_updated)
+		ASSERT_NS(utype == XT_UNLOCK_R_UPDATE || utype == XT_UNLOCK_W_UPDATE);
+	else
+		ASSERT_NS(utype == XT_UNLOCK_READ || utype == XT_UNLOCK_WRITE);
+	if (iref->ir_xlock)
+		ASSERT_NS(utype == XT_UNLOCK_WRITE || utype == XT_UNLOCK_W_UPDATE);
+	else
+		ASSERT_NS(utype == XT_UNLOCK_READ || utype == XT_UNLOCK_R_UPDATE);
+#endif
+	if (iref->ir_updated) {
+		/* The page was update: */
+		ASSERT_NS(block->cb_state == IDX_CAC_BLOCK_CLEAN || block->cb_state == IDX_CAC_BLOCK_DIRTY);
+		block->cp_flush_seq = ot->ot_table->tab_ind_flush_seq;
+		if (block->cb_state != IDX_CAC_BLOCK_DIRTY) {
+			TRACK_BLOCK_WRITE(offset);
+			xt_spinlock_lock(&ind->mi_dirty_lock);
+			if ((block->cb_dirty_next = ind->mi_dirty_list))
+				ind->mi_dirty_list->cb_dirty_prev = block;
+			block->cb_dirty_prev = NULL;
+			ind->mi_dirty_list = block;
+			ind->mi_dirty_blocks++;
+			xt_spinlock_unlock(&ind->mi_dirty_lock);
+			block->cb_state = IDX_CAC_BLOCK_DIRTY;
+		}
+	}
+
+	XT_IPAGE_UNLOCK(&block->cb_lock, iref->ir_xlock);
+#ifdef DEBUG
+	iref->ir_xlock = 2;
+	iref->ir_updated = 2;
+#endif
+	return OK;
+}
+
+xtPublic xtBool xt_ind_reserve(XTOpenTablePtr ot, u_int count, XTIdxBranchDPtr not_this)
+{
+	register XTIndBlockPtr	block;
+	register DcGlobalsRec	*dcg = &ind_cac_globals;
+
+#ifdef XT_TRACK_INDEX_UPDATES
+	ot->ot_ind_reserved = count;
+	ot->ot_ind_reads = 0;
+#endif
+#ifdef DEBUG_CHECK_IND_CACHE
+	xt_ind_check_cache(NULL);
+#endif
+	while (ot->ot_ind_res_count < count) {
+		if (!dcg->cg_free_list) {
+			if (!ind_cac_free_lru_blocks(ot, count - ot->ot_ind_res_count, not_this)) {
+				if (!dcg->cg_free_list) {
+					xt_ind_free_reserved(ot);
+					xt_register_xterr(XT_REG_CONTEXT, XT_ERR_NO_INDEX_CACHE);
+#ifdef DEBUG_CHECK_IND_CACHE
+					xt_ind_check_cache(NULL);
+#endif
+					return FAILED;
+				}
+			}
+		}
+
+		/* Get a free block: */
+		xt_lock_mutex_ns(&dcg->cg_lock);
+		while (ot->ot_ind_res_count < count && (block = dcg->cg_free_list)) {
+			ASSERT_NS(block->cb_state == IDX_CAC_BLOCK_FREE);
+			dcg->cg_free_list = block->cb_next;
+			dcg->cg_free_count--;
+			block->cb_next = ot->ot_ind_res_bufs;
+			ot->ot_ind_res_bufs = block;
+			ot->ot_ind_res_count++;
+#ifdef DEBUG_CHECK_IND_CACHE
+			dcg->cg_reserved_by_ots++;
+#endif
+		}
+		xt_unlock_mutex_ns(&dcg->cg_lock);
+	}
+#ifdef DEBUG_CHECK_IND_CACHE
+	xt_ind_check_cache(NULL);
+#endif
+	return OK;
+}
+
+xtPublic void xt_ind_free_reserved(XTOpenTablePtr ot)
+{
+#ifdef DEBUG_CHECK_IND_CACHE
+	xt_ind_check_cache(NULL);
+#endif
+	if (ot->ot_ind_res_bufs) {
+		register XTIndBlockPtr	block, fblock;
+		register DcGlobalsRec	*dcg = &ind_cac_globals;
+
+		xt_lock_mutex_ns(&dcg->cg_lock);
+		block = ot->ot_ind_res_bufs;
+		while (block) {
+			fblock = block;
+			block = block->cb_next;
+
+			fblock->cb_next = dcg->cg_free_list;
+			dcg->cg_free_list = fblock;
+#ifdef DEBUG_CHECK_IND_CACHE
+			dcg->cg_reserved_by_ots--;
+#endif
+			dcg->cg_free_count++;
+		}
+		xt_unlock_mutex_ns(&dcg->cg_lock);
+		ot->ot_ind_res_bufs = NULL;
+		ot->ot_ind_res_count = 0;
+	}
+#ifdef DEBUG_CHECK_IND_CACHE
+	xt_ind_check_cache(NULL);
+#endif
+}
+
+xtPublic void xt_ind_unreserve(XTOpenTablePtr ot)
+{
+	if (!ind_cac_globals.cg_free_list)
+		xt_ind_free_reserved(ot);
+}
+

=== added file 'plugin/pbxt/src/cache_xt.h'
--- plugin/pbxt/src/cache_xt.h	1970-01-01 00:00:00 +0000
+++ plugin/pbxt/src/cache_xt.h	2010-04-01 14:19:35 +0000
@@ -0,0 +1,188 @@
+/* Copyright (c) 2005 PrimeBase Technologies GmbH
+ *
+ * PrimeBase XT
+ *
+ * This program is free software; you can redistribute it and/or modify
+ * it under the terms of the GNU General Public License as published by
+ * the Free Software Foundation; either version 2 of the License, or
+ * (at your option) any later version.
+ *
+ * This program is distributed in the hope that it will be useful,
+ * but WITHOUT ANY WARRANTY; without even the implied warranty of
+ * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+ * GNU General Public License for more details.
+ *
+ * You should have received a copy of the GNU General Public License
+ * along with this program; if not, write to the Free Software
+ * Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA
+ *
+ * 2005-05-24	Paul McCullagh
+ *
+ * H&G2JCtL
+ */
+#ifndef __xt_cache_h__
+#define __xt_cache_h__
+
+//#define XT_USE_MYSYS
+
+#include "filesys_xt.h"
+#include "index_xt.h"
+
+struct XTOpenTable;
+struct XTIdxReadBuffer;
+
+#ifdef DEBUG
+//#define XT_USE_CACHE_DEBUG_SIZES
+#endif
+
+#ifdef XT_USE_CACHE_DEBUG_SIZES
+#define XT_INDEX_CACHE_SEGMENT_SHIFTS	1
+#else
+#define XT_INDEX_CACHE_SEGMENT_SHIFTS	3
+#endif
+
+#define IDX_CAC_BLOCK_FREE				0
+#define IDX_CAC_BLOCK_CLEAN				1
+#define IDX_CAC_BLOCK_DIRTY				2
+
+#ifdef XT_NO_ATOMICS
+#define XT_IPAGE_USE_PTHREAD_RW
+#else
+//#define XT_IPAGE_USE_ATOMIC_RW
+#define XT_IPAGE_USE_SPINXSLOCK
+//#define XT_IPAGE_USE_SKEW_RW
+#endif
+
+#ifdef XT_IPAGE_USE_ATOMIC_RW
+#define XT_IPAGE_LOCK_TYPE				XTAtomicRWLockRec
+#define XT_IPAGE_INIT_LOCK(s, i)		xt_atomicrwlock_init_with_autoname(s, i)
+#define XT_IPAGE_FREE_LOCK(s, i)		xt_atomicrwlock_free(s, i)	
+#define XT_IPAGE_READ_LOCK(i)			xt_atomicrwlock_slock(i)
+#define XT_IPAGE_WRITE_LOCK(i, o)		xt_atomicrwlock_xlock(i, o)
+#define XT_IPAGE_UNLOCK(i, x)			xt_atomicrwlock_unlock(i, x)
+#elif defined(XT_IPAGE_USE_PTHREAD_RW)
+#define XT_IPAGE_LOCK_TYPE				xt_rwlock_type
+#define XT_IPAGE_INIT_LOCK(s, i)		xt_init_rwlock(s, i)
+#define XT_IPAGE_FREE_LOCK(s, i)		xt_free_rwlock(i)	
+#define XT_IPAGE_READ_LOCK(i)			xt_slock_rwlock_ns(i)
+#define XT_IPAGE_WRITE_LOCK(i, s)		xt_xlock_rwlock_ns(i)
+#define XT_IPAGE_UNLOCK(i, x)			xt_unlock_rwlock_ns(i)
+#elif defined(XT_IPAGE_USE_SPINXSLOCK)
+#define XT_IPAGE_LOCK_TYPE				XTSpinXSLockRec
+#define XT_IPAGE_INIT_LOCK(s, i)		xt_spinxslock_init_with_autoname(s, i)
+#define XT_IPAGE_FREE_LOCK(s, i)		xt_spinxslock_free(s, i)	
+#define XT_IPAGE_READ_LOCK(i)			xt_spinxslock_slock(i)
+#define XT_IPAGE_WRITE_LOCK(i, o)		xt_spinxslock_xlock(i, o)
+#define XT_IPAGE_UNLOCK(i, x)			xt_spinxslock_unlock(i, x)
+#else // XT_IPAGE_USE_SKEW_RW
+#define XT_IPAGE_LOCK_TYPE				XTSkewRWLockRec
+#define XT_IPAGE_INIT_LOCK(s, i)		xt_skewrwlock_init_with_autoname(s, i)
+#define XT_IPAGE_FREE_LOCK(s, i)		xt_skewrwlock_free(s, i)	
+#define XT_IPAGE_READ_LOCK(i)			xt_skewrwlock_slock(i)
+#define XT_IPAGE_WRITE_LOCK(i, o)		xt_skewrwlock_xlock(i, o)
+#define XT_IPAGE_UNLOCK(i, x)			xt_skewrwlock_unlock(i, x)
+#endif
+
+enum XTPageLockType { XT_LOCK_READ, XT_LOCK_WRITE, XT_XLOCK_LEAF, XT_XLOCK_DEL_LEAF };
+enum XTPageUnlockType { XT_UNLOCK_NONE, XT_UNLOCK_READ, XT_UNLOCK_WRITE, XT_UNLOCK_R_UPDATE, XT_UNLOCK_W_UPDATE };
+
+/* A block is X locked if it is being changed or freed.
+ * A block is S locked if it is being read.
+ */
+typedef struct XTIndBlock {
+	xtIndexNodeID		cb_address;						/* The block address. */
+	u_int				cb_file_id;						/* The file id of the block. */
+	/* This is protected by cs_lock */
+	struct XTIndBlock	*cb_next;						/* Pointer to next block on hash list, or next free block on free list. */
+	/* This is protected by mi_dirty_lock */
+	struct XTIndBlock	*cb_dirty_next;					/* Double link for dirty blocks, next pointer. */
+	struct XTIndBlock	*cb_dirty_prev;					/* Double link for dirty blocks, previous pointer. */
+	/* This is protected by cg_lock */
+	xtWord4				cb_ru_time;						/* If this is in the top 1/4 don't change position in MRU list. */
+	struct XTIndBlock	*cb_mr_used;					/* More recently used blocks. */
+	struct XTIndBlock	*cb_lr_used;					/* Less recently used blocks. */
+	/* Protected by cb_lock: */
+	XT_IPAGE_LOCK_TYPE	cb_lock;
+	xtWord1				cb_state;						/* Block status. */
+	xtWord2				cb_handle_count;				/* TRUE if this page is referenced by a handle. */
+	xtWord2				cp_flush_seq;
+	xtWord2				cp_del_count;					/* Number of deleted entries. */
+#ifdef XT_USE_DIRECT_IO_ON_INDEX
+	xtWord1				*cb_data;
+#else
+	xtWord1				cb_data[XT_INDEX_PAGE_SIZE];
+#endif
+} XTIndBlockRec, *XTIndBlockPtr;
+
+typedef struct XTIndReference {
+	xtBool					ir_xlock;					/* Set to TRUE if the cache block is X locked. */
+	xtBool					ir_updated;					/* Set to TRUE if the cache block is updated. */
+	XTIndBlockPtr			ir_block;
+	XTIdxBranchDPtr			ir_branch;
+} XTIndReferenceRec, *XTIndReferencePtr;
+
+typedef struct XTIndFreeBlock {
+	XTDiskValue1			if_zero1_1;					/* Must be set to zero. */
+	XTDiskValue1			if_zero2_1;					/* Must be set to zero. */
+	XTDiskValue1			if_status_1;
+	XTDiskValue1			if_unused1_1;
+	XTDiskValue4			if_unused2_4;
+	XTDiskValue8			if_next_block_8;
+} XTIndFreeBlockRec, *XTIndFreeBlockPtr;
+
+typedef struct XTIndHandleBlock {
+	xtWord4					hb_ref_count;
+	struct XTIndHandleBlock	*hb_next;
+	XTIdxBranchDRec			hb_branch;
+} XTIndHandleBlockRec, *XTIndHandleBlockPtr;
+
+typedef struct XTIndHandle {
+	struct XTIndHandle		*ih_next;
+	struct XTIndHandle		*ih_prev;
+	XTSpinLockRec			ih_lock;
+	xtIndexNodeID			ih_address;
+	xtBool					ih_cache_reference;		/* True if this handle references the cache. */
+	union {
+		XTIndBlockPtr		ih_cache_block;
+		XTIndHandleBlockPtr	ih_handle_block;
+	} x;
+	XTIdxBranchDPtr			ih_branch;
+} XTIndHandleRec, *XTIndHandlePtr;
+
+void			xt_ind_init(XTThreadPtr self, size_t cache_size);
+void			xt_ind_exit(XTThreadPtr self);
+
+xtInt8			xt_ind_get_usage();
+xtInt8			xt_ind_get_size();
+xtBool			xt_ind_write(struct XTOpenTable *ot, XTIndexPtr ind, xtIndexNodeID offset, size_t size, xtWord1 *data);
+xtBool			xt_ind_write_cache(struct XTOpenTable *ot, xtIndexNodeID offset, size_t size, xtWord1 *data);
+xtBool			xt_ind_clean(struct XTOpenTable *ot, XTIndexPtr ind, xtIndexNodeID offset);
+xtBool			xt_ind_read_bytes(struct XTOpenTable *ot, XTIndexPtr ind, xtIndexNodeID offset, size_t size, xtWord1 *data);
+void			xt_ind_check_cache(XTIndexPtr ind);
+xtBool			xt_ind_reserve(struct XTOpenTable *ot, u_int count, XTIdxBranchDPtr not_this);
+void			xt_ind_free_reserved(struct XTOpenTable *ot);
+void			xt_ind_unreserve(struct XTOpenTable *ot);
+
+xtBool			xt_ind_fetch(struct XTOpenTable *ot, XTIndexPtr ind, xtIndexNodeID node, XTPageLockType ltype, XTIndReferencePtr iref);
+xtBool			xt_ind_release(struct XTOpenTable *ot, XTIndexPtr ind, XTPageUnlockType utype, XTIndReferencePtr iref);
+
+void			xt_ind_lock_handle(XTIndHandlePtr handle);
+void			xt_ind_unlock_handle(XTIndHandlePtr handle);
+xtBool			xt_ind_copy_on_write(XTIndReferencePtr iref);
+
+XTIndHandlePtr	xt_ind_get_handle(struct XTOpenTable *ot, XTIndexPtr ind, XTIndReferencePtr iref);
+void			xt_ind_release_handle(XTIndHandlePtr handle, xtBool have_lock, XTThreadPtr thread);
+
+#ifdef DEBUG
+//#define DEBUG_CHECK_IND_CACHE
+#endif
+
+//#define XT_TRACE_INDEX
+
+#ifdef XT_TRACE_INDEX
+#define IDX_TRACE(x, y, z)		xt_trace(x, y, z)
+#else
+#define IDX_TRACE(x, y, z)
+#endif
+
+#endif

=== added file 'plugin/pbxt/src/ccutils_xt.cc'
--- plugin/pbxt/src/ccutils_xt.cc	1970-01-01 00:00:00 +0000
+++ plugin/pbxt/src/ccutils_xt.cc	2010-04-01 14:19:35 +0000
@@ -0,0 +1,69 @@
+/* Copyright (c) 2005 PrimeBase Technologies GmbH
+ *
+ * PrimeBase XT
+ *
+ * This program is free software; you can redistribute it and/or modify
+ * it under the terms of the GNU General Public License as published by
+ * the Free Software Foundation; either version 2 of the License, or
+ * (at your option) any later version.
+ *
+ * This program is distributed in the hope that it will be useful,
+ * but WITHOUT ANY WARRANTY; without even the implied warranty of
+ * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.	See the
+ * GNU General Public License for more details.
+ *
+ * You should have received a copy of the GNU General Public License
+ * along with this program; if not, write to the Free Software
+ * Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA
+ *
+ * 2006-05-16	Paul McCullagh
+ *
+ * H&G2JCtL
+ *
+ * C++ Utilities
+ */
+
+#include "xt_config.h"
+
+#include "pthread_xt.h"
+#include "ccutils_xt.h"
+#include "bsearch_xt.h"
+
+static int ccu_compare_object(XTThreadPtr XT_UNUSED(self), register const void *XT_UNUSED(thunk), register const void *a, register const void *b)
+{
+	XTObject *obj_ptr = (XTObject *) b;
+
+	return obj_ptr->compare(a);
+}
+
+void XTListImp::append(XTThreadPtr self, XTObject *info, void *key) {
+	size_t idx;
+
+	if (li_item_count == 0)
+		idx = 0;
+	else if (li_item_count == 1) {
+		int r;
+
+		if ((r = li_items[0]->compare(key)) == 0)
+			idx = 0;
+		else if (r < 0)
+			idx = 0;
+		else
+			idx = 1;
+	}
+	else {
+		xt_bsearch(self, key, li_items, li_item_count, sizeof(void *), &idx, NULL, ccu_compare_object);
+	}
+
+	if (!xt_realloc(NULL, (void **) &li_items, (li_item_count + 1) * sizeof(void *))) {
+		if (li_referenced)
+			info->release(self);
+		xt_throw_errno(XT_CONTEXT, XT_ENOMEM);
+		return;
+	}
+	memmove(&li_items[idx+1], &li_items[idx], (li_item_count-idx) * sizeof(void *));
+	li_items[idx] = info;
+	li_item_count++;
+}
+
+

=== added file 'plugin/pbxt/src/ccutils_xt.h'
--- plugin/pbxt/src/ccutils_xt.h	1970-01-01 00:00:00 +0000
+++ plugin/pbxt/src/ccutils_xt.h	2010-04-01 14:19:35 +0000
@@ -0,0 +1,220 @@
+/* Copyright (c) 2005 PrimeBase Technologies GmbH
+ *
+ * PrimeBase XT
+ *
+ * This program is free software; you can redistribute it and/or modify
+ * it under the terms of the GNU General Public License as published by
+ * the Free Software Foundation; either version 2 of the License, or
+ * (at your option) any later version.
+ *
+ * This program is distributed in the hope that it will be useful,
+ * but WITHOUT ANY WARRANTY; without even the implied warranty of
+ * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.	See the
+ * GNU General Public License for more details.
+ *
+ * You should have received a copy of the GNU General Public License
+ * along with this program; if not, write to the Free Software
+ * Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA
+ *
+ * 2006-05-16	Paul McCullagh
+ *
+ * H&G2JCtL
+ *
+ * C++ Utilities
+ */
+
+#ifndef __ccutils_xt_h__
+#define __ccutils_xt_h__
+
+#include <errno.h>
+
+#include "xt_defs.h"
+#include "thread_xt.h"
+
+class XTObject
+{
+	private:
+	u_int			o_refcnt;
+
+	public:
+	inline XTObject() { o_refcnt = 1; }
+	
+	virtual ~XTObject() { }
+
+	inline void reference() {
+		o_refcnt++;
+	}
+
+	inline void release(XTThreadPtr self) {
+		ASSERT(o_refcnt > 0);
+		o_refcnt--;
+		if (o_refcnt == 0) {
+			finalize(self);
+			delete this;
+		}
+	}
+
+	virtual XTObject *factory(XTThreadPtr self) {
+		XTObject *new_obj;
+		
+		if (!(new_obj = new XTObject()))
+			xt_throw_errno(XT_CONTEXT, XT_ENOMEM);
+		return new_obj;
+	}
+
+	virtual XTObject *clone(XTThreadPtr self) {
+		XTObject *new_obj;
+		
+		new_obj = factory(self);
+		new_obj->init(self, this);
+		return new_obj;
+	}
+
+	virtual void init(XTThreadPtr self) { (void) self; }
+	virtual void init(XTThreadPtr self, XTObject *obj) { (void) obj; init(self); }
+	virtual void finalize(XTThreadPtr self) { (void) self; }
+	virtual int compare(const void *key) { (void) key; return -1; }
+};
+
+class XTListImp
+{
+	protected:
+	bool		li_referenced;
+	u_int		li_item_count;
+	XTObject	**li_items;
+
+	public:
+	inline XTListImp() : li_referenced(true), li_item_count(0), li_items(NULL) { }
+
+	inline void setNonReferenced() { li_referenced = false; }
+
+	void append(XTThreadPtr self, XTObject *info) {
+		if (!xt_realloc(NULL, (void **) &li_items, (li_item_count + 1) * sizeof(void *))) {
+			if (li_referenced)
+				info->release(self);
+			xt_throw_errno(XT_CONTEXT, XT_ENOMEM);
+			return;
+		}
+		li_items[li_item_count] = info;
+		li_item_count++;
+	}
+
+	void insert(XTThreadPtr self, XTObject *info, u_int i) {
+		if (!xt_realloc(NULL, (void **) &li_items, (li_item_count + 1) * sizeof(void *))) {
+			if (li_referenced)
+				info->release(self);
+			xt_throw_errno(XT_CONTEXT, XT_ENOMEM);
+			return;
+		}
+		memmove(&li_items[i+1], &li_items[i], (li_item_count-i) * sizeof(XTObject *));
+		li_items[i] = info;
+		li_item_count++;
+	}
+
+	void addToFront(XTThreadPtr self, XTObject *info) {
+		insert(self, info, 0);
+	}
+
+	/* Will sort! */
+	void append(XTThreadPtr self, XTObject *info, void *key);
+
+	inline bool remove(XTObject *info) {
+		for (u_int i=0; i<li_item_count; i++) {
+			if (li_items[i] == info) {
+				li_item_count--;
+				memmove(&li_items[i], &li_items[i+1], (li_item_count - i) * sizeof(XTObject *));
+				return true;
+			}
+		}
+		return false;
+	}
+
+	inline bool remove(XTThreadPtr self, u_int i) {
+		XTObject *item;
+
+		if (i >= li_item_count)
+			return false;
+		item = li_items[i];
+		li_item_count--;
+		memmove(&li_items[i], &li_items[i+1], (li_item_count - i) * sizeof(void *));
+		if (li_referenced)
+			item->release(self);
+		return true;
+	}
+
+	inline XTObject *take(u_int i) {
+		XTObject *item;
+
+		if (i >= li_item_count)
+			return NULL;
+		item = li_items[i];
+		li_item_count--;
+		memmove(&li_items[i], &li_items[i+1], (li_item_count - i) * sizeof(void *));
+		return item;
+	}
+
+	inline u_int size() const { return li_item_count; }
+
+	inline void setEmpty(XTThreadPtr self) {
+		if (li_items)
+			xt_free(self, li_items);
+		li_item_count = 0;
+		li_items = NULL;
+	}
+
+	inline bool isEmpty() { return li_item_count == 0; }
+
+	inline XTObject *itemAt(u_int i) const {
+		if (i >= li_item_count)
+			return NULL;
+		return li_items[i];
+	}
+};
+
+
+template <class T> class XTList : public XTListImp
+{
+	public:
+	inline XTList() : XTListImp() { }
+
+	inline void append(XTThreadPtr self, T *a) { XTListImp::append(self, a); }
+	inline void insert(XTThreadPtr self, T *a, u_int i) { XTListImp::insert(self, a, i); }
+	inline void addToFront(XTThreadPtr self, T *a) { XTListImp::addToFront(self, a); }
+
+	inline bool remove(T *a) { return XTListImp::remove(a); }
+
+	inline bool remove(XTThreadPtr self, u_int i) { return XTListImp::remove(self, i); }
+
+	inline T *take(u_int i) { return (T *) XTListImp::take(i); }
+
+	inline T *itemAt(u_int i) const { return (T *) XTListImp::itemAt(i); }
+
+	inline u_int indexOf(T *a) {
+		u_int i;
+
+		for (i=0; i<size(); i++) {
+			if (itemAt(i) == a)
+				break;
+		}
+		return i;
+	}
+
+	void deleteAll(XTThreadPtr self)
+	{
+		for (u_int i=0; i<size(); i++) {
+			if (li_referenced)
+				itemAt(i)->release(self);
+		}
+		setEmpty(self);
+	}
+
+	void clone(XTThreadPtr self, XTListImp *list)
+	{
+		deleteAll(self);
+		for (u_int i=0; i<list->size(); i++) {
+			XTListImp::append(self, list->itemAt(i)->clone(self));
+		}
+	}
+};
+
+#endif

=== added file 'plugin/pbxt/src/database_xt.cc'
--- plugin/pbxt/src/database_xt.cc	1970-01-01 00:00:00 +0000
+++ plugin/pbxt/src/database_xt.cc	2010-04-01 14:19:35 +0000
@@ -0,0 +1,1314 @@
+/* Copyright (c) 2005 PrimeBase Technologies GmbH
+ *
+ * PrimeBase XT
+ *
+ * This program is free software; you can redistribute it and/or modify
+ * it under the terms of the GNU General Public License as published by
+ * the Free Software Foundation; either version 2 of the License, or
+ * (at your option) any later version.
+ *
+ * This program is distributed in the hope that it will be useful,
+ * but WITHOUT ANY WARRANTY; without even the implied warranty of
+ * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+ * GNU General Public License for more details.
+ *
+ * You should have received a copy of the GNU General Public License
+ * along with this program; if not, write to the Free Software
+ * Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA
+ *
+ * 2005-01-15	Paul McCullagh
+ *
+ * H&G2JCtL
+ */
+
+#include "xt_config.h"
+
+#ifdef DRIZZLED
+#include <bitset>
+#endif
+
+#include <string.h>
+#include <stdio.h>
+
+#include "pthread_xt.h"
+#include "hashtab_xt.h"
+#include "filesys_xt.h"
+#include "database_xt.h"
+#include "memory_xt.h"
+#include "heap_xt.h"
+#include "datalog_xt.h"
+#include "strutil_xt.h"
+#include "util_xt.h"
+#include "trace_xt.h"
+
+#ifdef DEBUG
+//#define XT_TEST_XACT_OVERFLOW
+#endif
+
+#ifndef NAME_MAX
+#define NAME_MAX 128
+#endif
+
+/*
+ * -----------------------------------------------------------------------
+ * GLOBALS
+ */
+
+xtPublic XTDatabaseHPtr		pbxt_database = NULL;		// The global open database
+
+xtPublic xtLogOffset		xt_db_log_file_threshold;
+xtPublic size_t				xt_db_log_buffer_size;
+xtPublic size_t				xt_db_transaction_buffer_size;
+xtPublic size_t				xt_db_checkpoint_frequency;
+xtPublic off_t				xt_db_data_log_threshold;
+xtPublic size_t				xt_db_data_file_grow_size;
+xtPublic size_t				xt_db_row_file_grow_size;
+xtPublic int				xt_db_garbage_threshold;
+xtPublic int				xt_db_log_file_count;
+xtPublic int				xt_db_auto_increment_mode;		/* 0 = MySQL compatible, 1 = PrimeBase Compatible. */
+xtPublic int				xt_db_offline_log_function;		/* 0 = recycle logs, 1 = delete logs, 2 = keep logs */
+xtPublic int				xt_db_sweeper_priority;			/* 0 = low (default), 1 = normal, 2 = high */
+
+xtPublic XTSortedListPtr	xt_db_open_db_by_id = NULL;
+xtPublic XTHashTabPtr		xt_db_open_databases = NULL;
+xtPublic time_t				xt_db_approximate_time = 0;		/* A "fast" alternative timer (not too accurate). */
+
+static xtDatabaseID				db_next_id = 1;
+static volatile XTOpenFilePtr	db_lock_file = NULL;
+
+/*
+ * -----------------------------------------------------------------------
+ * LOCK/UNLOCK INSTALLATION
+ */
+
+xtPublic void xt_lock_installation(XTThreadPtr self, char *installation_path)
+{
+	char			file_path[PATH_MAX];
+	char			buffer[101];
+	size_t			red_size;
+	llong			pid;
+	xtBool			cd = pbxt_crash_debug;
+
+	xt_strcpy(PATH_MAX, file_path, installation_path);
+	xt_add_pbxt_file(PATH_MAX, file_path, "no-debug");
+	if (xt_fs_exists(file_path))
+		pbxt_crash_debug = FALSE;
+	xt_strcpy(PATH_MAX, file_path, installation_path);
+	xt_add_pbxt_file(PATH_MAX, file_path, "crash-debug");
+	if (xt_fs_exists(file_path))
+		pbxt_crash_debug = TRUE;
+
+	if (pbxt_crash_debug != cd) {
+		if (pbxt_crash_debug)
+			xt_logf(XT_NT_WARNING, "Crash debugging has been turned on ('crash-debug' file exists)\n");
+		else
+			xt_logf(XT_NT_WARNING, "Crash debugging has been turned off ('no-debug' file exists)\n");
+	}
+	else if (pbxt_crash_debug)
+		xt_logf(XT_NT_WARNING, "Crash debugging is enabled\n");
+
+	/* Moved the lock file out of the pbxt directory so that
+	 * it is possible to drop the pbxt database!
+	 */
+	xt_strcpy(PATH_MAX, file_path, installation_path);
+	xt_add_dir_char(PATH_MAX, file_path);
+	xt_strcat(PATH_MAX, file_path, "pbxt-lock");
+	db_lock_file = xt_open_file(self, file_path, XT_FS_CREATE | XT_FS_MAKE_PATH);
+
+	try_(a) {
+		if (!xt_lock_file(self, db_lock_file)) {
+			xt_logf(XT_NT_ERROR, "A server appears to already be running\n");
+			xt_logf(XT_NT_ERROR, "The file: %s, is locked\n", file_path);
+			xt_throw_xterr(XT_CONTEXT, XT_ERR_SERVER_RUNNING);
+		}
+		if (!xt_pread_file(db_lock_file, 0, 100, 0, buffer, &red_size, &self->st_statistics.st_rec, self))
+			xt_throw(self);
+		if (red_size > 0) {
+			buffer[red_size] = 0;
+#ifdef XT_WIN
+			pid = (llong) _atoi64(buffer);
+#else
+			pid = atoll(buffer);
+#endif
+			/* Problem with this code is, after a restart
+			 * the process ID's are reused.
+			 * If some system process grabs the proc id that
+			 * the server had on the last run, then
+			 * the database will not start.
+			if (xt_process_exists((xtProcID) pid)) {
+				xt_logf(XT_NT_ERROR, "A server appears to already be running, process ID: %lld\n", pid);
+				xt_logf(XT_NT_ERROR, "Remove the file: %s, if this is not the case\n", file_path);
+				xt_throw_xterr(XT_CONTEXT, XT_ERR_SERVER_RUNNING);
+			}
+			*/
+			xt_logf(XT_NT_INFO, "The server was not shutdown correctly, recovery required\n");
+#ifdef XT_BACKUP_BEFORE_RECOVERY
+			if (pbxt_crash_debug) {
+				/* The server was not shut down correctly. Make a backup before
+				 * we start recovery.
+				 */
+				char extension[100];
+
+				for (int i=1;;i++) {
+					xt_strcpy(PATH_MAX, file_path, installation_path);
+					xt_remove_dir_char(file_path);
+					sprintf(extension, "-recovery-%d", i);
+					xt_strcat(PATH_MAX, file_path, extension);
+					if (!xt_fs_exists(file_path))
+						break;
+				}
+				xt_logf(XT_NT_INFO, "In order to reproduce recovery errors a backup of the installation\n");
+				xt_logf(XT_NT_INFO, "will be made to:\n");
+				xt_logf(XT_NT_INFO, "%s\n", file_path);
+				xt_logf(XT_NT_INFO, "Copy in progress...\n");
+				xt_fs_copy_dir(self, installation_path, file_path);
+				xt_logf(XT_NT_INFO, "Copy OK\n");
+			}
+#endif
+		}
+
+		sprintf(buffer, "%lld", (llong) xt_getpid());
+		xt_set_eof_file(self, db_lock_file, 0);
+		if (!xt_pwrite_file(db_lock_file, 0, strlen(buffer), buffer, &self->st_statistics.st_rec, self))
+			xt_throw(self);
+	}
+	catch_(a) {
+		xt_close_file(self, db_lock_file);
+		db_lock_file = NULL;
+		xt_throw(self);
+	}
+	cont_(a);
+}
+
+xtPublic void xt_unlock_installation(XTThreadPtr self, char *installation_path)
+{
+	if (db_lock_file) {
+		char lock_file[PATH_MAX];
+
+		xt_unlock_file(NULL, db_lock_file);
+		xt_close_file_ns(db_lock_file);
+		db_lock_file = NULL;
+
+		xt_strcpy(PATH_MAX, lock_file, installation_path);
+		xt_add_dir_char(PATH_MAX, lock_file);
+		xt_strcat(PATH_MAX, lock_file, "pbxt-lock");
+		xt_fs_delete(self, lock_file);
+	}
+}
+
+int *xt_bad_pointer = 0;
+
+void xt_crash_me(void)
+{
+	if (pbxt_crash_debug)
+		*xt_bad_pointer = 123;
+}
+
+/*
+ * -----------------------------------------------------------------------
+ * INIT/EXIT DATABASE
+ */
+
+static xtBool db_hash_comp(void *key, void *data)
+{
+	XTDatabaseHPtr	db = (XTDatabaseHPtr) data;
+
+	return strcmp((char *) key, db->db_name) == 0;
+}
+
+static xtHashValue db_hash(xtBool is_key, void *key_data)
+{
+	XTDatabaseHPtr	db = (XTDatabaseHPtr) key_data;
+
+	if (is_key)
+		return xt_ht_hash((char *) key_data);
+	return xt_ht_hash(db->db_name);
+}
+
+static xtBool db_hash_comp_ci(void *key, void *data)
+{
+	XTDatabaseHPtr	db = (XTDatabaseHPtr) data;
+
+	return strcasecmp((char *) key, db->db_name) == 0;
+}
+
+static xtHashValue db_hash_ci(xtBool is_key, void *key_data)
+{
+	XTDatabaseHPtr	db = (XTDatabaseHPtr) key_data;
+
+	if (is_key)
+		return xt_ht_casehash((char *) key_data);
+	return xt_ht_casehash(db->db_name);
+}
+
+static void db_hash_free(XTThreadPtr self, void *data)
+{
+	xt_heap_release(self, (XTDatabaseHPtr) data);
+}
+
+static int db_cmp_db_id(struct XTThread *XT_UNUSED(self), register const void *XT_UNUSED(thunk), register const void *a, register const void *b)
+{
+	xtDatabaseID	db_id = *((xtDatabaseID *) a);
+	XTDatabaseHPtr	*db_ptr = (XTDatabaseHPtr *) b;
+
+	if (db_id == (*db_ptr)->db_id)
+		return 0;
+	if (db_id < (*db_ptr)->db_id)
+		return -1;
+	return 1;
+}
+
+xtPublic void xt_init_databases(XTThreadPtr self)
+{
+	if (pbxt_ignore_case)
+		xt_db_open_databases = xt_new_hashtable(self, db_hash_comp_ci, db_hash_ci, db_hash_free, TRUE, TRUE);
+	else
+		xt_db_open_databases = xt_new_hashtable(self, db_hash_comp, db_hash, db_hash_free, TRUE, TRUE);
+	xt_db_open_db_by_id = xt_new_sortedlist(self, sizeof(XTDatabaseHPtr), 20, 10, db_cmp_db_id, NULL, NULL, FALSE, FALSE);
+}
+
+xtPublic void xt_stop_database_threads(XTThreadPtr self, xtBool sync)
+{
+	u_int			len = 0;
+	XTDatabaseHPtr	*dbptr;
+	XTDatabaseHPtr	db = NULL;
+	
+	if (xt_db_open_db_by_id)
+		len = xt_sl_get_size(xt_db_open_db_by_id);
+	for (u_int i=0; i<len; i++) {
+		if ((dbptr = (XTDatabaseHPtr *) xt_sl_item_at(xt_db_open_db_by_id, i))) {
+			db = *dbptr;
+			if (sync) {
+				/* Wait for the sweeper: */
+				xt_wait_for_sweeper(self, db, 16);
+				
+				/* Wait for the writer: */
+				xt_wait_for_writer(self, db);
+