Compare commits
68 Commits
Author | SHA1 | Date | |
---|---|---|---|
|
9adcef7ef8 | ||
|
664ad1c001 | ||
|
0400fb91e6 | ||
|
dd81eae663 | ||
|
61720850f6 | ||
|
e86f6eea0a | ||
|
b1845f43e7 | ||
|
958b4c9117 | ||
|
385412b6c0 | ||
|
e38e83169a | ||
|
f2a0fa2640 | ||
|
5de4fff167 | ||
|
9f33284d23 | ||
|
fb6f3b6771 | ||
|
b4242884d8 | ||
|
96687f030c | ||
|
3327adcc72 | ||
|
f63f26f842 | ||
|
46e923f671 | ||
|
b623dca531 | ||
|
6189230202 | ||
|
10a12b2a6f | ||
|
915c90ec0e | ||
|
b27c79a010 | ||
|
70f7fc3250 | ||
|
2955407c3a | ||
|
6e0597951e | ||
|
8c1f5c254f | ||
|
0ccaba2a05 | ||
|
4646cd45c4 | ||
|
2d6abcade4 | ||
|
0b129d1f7d | ||
|
58ef1ca899 | ||
|
13712712de | ||
|
ab8129ab8a | ||
|
87f35fbd3e | ||
|
9e58371114 | ||
|
1d4dc5eb22 | ||
|
b54951489c | ||
|
e8727ff6e0 | ||
|
a6e1cf9d20 | ||
|
ded1d5a1af | ||
|
dc0bbf78f7 | ||
|
b634fd7162 | ||
|
22f277e034 | ||
|
7e62c5d67a | ||
|
2014cdf2d0 | ||
|
459e00b365 | ||
|
49412d93e2 | ||
|
5a8e732594 | ||
|
f2e68d2bec | ||
|
b07369836e | ||
|
f3dc93bcf1 | ||
|
30a6d4e3ed | ||
|
6d29d8b3fa | ||
|
1530f38baa | ||
|
2b621c1f83 | ||
|
71acb4c122 | ||
|
ebbce5b10d | ||
|
fa586740e3 | ||
|
4623a5521f | ||
|
6df24fcffc | ||
|
8a1c34903c | ||
|
48fc484950 | ||
|
1265ed7abb | ||
|
95c5e2dc6e | ||
|
8d7edd5908 | ||
|
b6f6b73a9c |
@ -432,6 +432,12 @@ set(SOURCES
|
|||||||
util/xxhash.cc
|
util/xxhash.cc
|
||||||
utilities/backupable/backupable_db.cc
|
utilities/backupable/backupable_db.cc
|
||||||
utilities/blob_db/blob_db.cc
|
utilities/blob_db/blob_db.cc
|
||||||
|
utilities/blob_db/blob_db_impl.cc
|
||||||
|
utilities/blob_db/blob_db_options_impl.cc
|
||||||
|
utilities/blob_db/blob_file.cc
|
||||||
|
utilities/blob_db/blob_log_reader.cc
|
||||||
|
utilities/blob_db/blob_log_writer.cc
|
||||||
|
utilities/blob_db/blob_log_format.cc
|
||||||
utilities/checkpoint/checkpoint.cc
|
utilities/checkpoint/checkpoint.cc
|
||||||
utilities/col_buf_decoder.cc
|
utilities/col_buf_decoder.cc
|
||||||
utilities/col_buf_encoder.cc
|
utilities/col_buf_encoder.cc
|
||||||
@ -578,6 +584,7 @@ set(TESTS
|
|||||||
db/db_properties_test.cc
|
db/db_properties_test.cc
|
||||||
db/db_range_del_test.cc
|
db/db_range_del_test.cc
|
||||||
db/db_sst_test.cc
|
db/db_sst_test.cc
|
||||||
|
db/db_statistics_test.cc
|
||||||
db/db_table_properties_test.cc
|
db/db_table_properties_test.cc
|
||||||
db/db_tailing_iter_test.cc
|
db/db_tailing_iter_test.cc
|
||||||
db/db_test.cc
|
db/db_test.cc
|
||||||
@ -645,10 +652,10 @@ set(TESTS
|
|||||||
util/heap_test.cc
|
util/heap_test.cc
|
||||||
util/rate_limiter_test.cc
|
util/rate_limiter_test.cc
|
||||||
util/slice_transform_test.cc
|
util/slice_transform_test.cc
|
||||||
|
util/timer_queue_test.cc
|
||||||
util/thread_list_test.cc
|
util/thread_list_test.cc
|
||||||
util/thread_local_test.cc
|
util/thread_local_test.cc
|
||||||
utilities/backupable/backupable_db_test.cc
|
utilities/backupable/backupable_db_test.cc
|
||||||
utilities/blob_db/blob_db_test.cc
|
|
||||||
utilities/checkpoint/checkpoint_test.cc
|
utilities/checkpoint/checkpoint_test.cc
|
||||||
utilities/column_aware_encoding_test.cc
|
utilities/column_aware_encoding_test.cc
|
||||||
utilities/date_tiered/date_tiered_test.cc
|
utilities/date_tiered/date_tiered_test.cc
|
||||||
|
@ -12,8 +12,3 @@ Complete your CLA here: <https://code.facebook.com/cla>
|
|||||||
|
|
||||||
If you prefer to sign a paper copy, we can send you a PDF. Send us an
|
If you prefer to sign a paper copy, we can send you a PDF. Send us an
|
||||||
e-mail or create a new github issue to request the CLA in PDF format.
|
e-mail or create a new github issue to request the CLA in PDF format.
|
||||||
|
|
||||||
## License
|
|
||||||
|
|
||||||
By contributing to RocksDB, you agree that your contributions will be
|
|
||||||
licensed under the [BSD License](LICENSE).
|
|
||||||
|
339
COPYING
Normal file
339
COPYING
Normal file
@ -0,0 +1,339 @@
|
|||||||
|
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 Lesser 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 Lesser General
|
||||||
|
Public License instead of this License.
|
61
HISTORY.md
61
HISTORY.md
@ -1,5 +1,61 @@
|
|||||||
# Rocksdb Change Log
|
# Rocksdb Change Log
|
||||||
## Unreleased
|
## 5.4.12 (08/21/2017)
|
||||||
|
* Statistics::Reset() to reset user stats.
|
||||||
|
|
||||||
|
## 5.4.11 (08/17/2017)
|
||||||
|
### Bug Fixes
|
||||||
|
* Fix a bug in PosixWritableFile::Close()
|
||||||
|
|
||||||
|
## 5.4.10 (08/12/2017)
|
||||||
|
### Bug Fixes
|
||||||
|
* Fix incorrect dropping of deletions during intra-L0 compaction.
|
||||||
|
|
||||||
|
## 5.4.9 (07/20/2017)
|
||||||
|
* Change license to Apache + GPLv2
|
||||||
|
|
||||||
|
## 5.4.8 (07/13/2017)
|
||||||
|
No change from 5.4.7.
|
||||||
|
|
||||||
|
## 5.4.7 (06/28/2017)
|
||||||
|
### Bug Fixes
|
||||||
|
* Shouldn't ignore return value of fsync() in flush.
|
||||||
|
|
||||||
|
## 5.4.6 (05/30/2017)
|
||||||
|
### Bug Fixes
|
||||||
|
* Fix db_bench with lite build.
|
||||||
|
|
||||||
|
## 5.4.5 (05/19/2017)
|
||||||
|
### Bug Fixes
|
||||||
|
* Facility for cross-building RocksJava using Docker.
|
||||||
|
* Build and link with ZStd when creating the static RocksJava build.
|
||||||
|
* Fix snprintf's usage to be cross-platform.
|
||||||
|
* Fix build error with blob DB.
|
||||||
|
* Fix readamp test type inconsistency.
|
||||||
|
|
||||||
|
## 5.4.4 (05/11/2017)
|
||||||
|
### New Features
|
||||||
|
* Added DB::CreateColumnFamilie() and DB::DropColumnFamilies() to bulk create/drop column families.
|
||||||
|
|
||||||
|
### Bug Fixes
|
||||||
|
* Fix a manual / auto compaction data race.
|
||||||
|
* Fix CentOS 5 cross-building of RocksJava.
|
||||||
|
|
||||||
|
## 5.4.3 (05/10/2017)
|
||||||
|
### Bug Fixes
|
||||||
|
* Fix memory alignment with logical sector size.
|
||||||
|
* Fix alignment in ReadaheadRandomAccessFile.
|
||||||
|
* Fix bias with read amplification stats (READ_AMP_ESTIMATE_USEFUL_BYTES and READ_AMP_TOTAL_READ_BYTES).
|
||||||
|
|
||||||
|
## 5.4.2 (05/08/2017)
|
||||||
|
### Bug Fixes
|
||||||
|
* Fix huge fallocate calls fail and make XFS unhappy.
|
||||||
|
|
||||||
|
## 5.4.1 (05/02/2017)
|
||||||
|
### Bug Fxies
|
||||||
|
* Fix WriteBatchWithIndex address use after scope error.
|
||||||
|
* Fix WritableFile buffer size in direct IO.
|
||||||
|
* Add prefetch to PosixRandomAccessFile in buffered io.
|
||||||
|
* Fix PinnableSlice access invalid address when row cache is enabled.
|
||||||
|
|
||||||
## 5.4.0 (04/11/2017)
|
## 5.4.0 (04/11/2017)
|
||||||
### Public API Change
|
### Public API Change
|
||||||
@ -8,11 +64,14 @@
|
|||||||
* DB::Get in place of std::string accepts PinnableSlice, which avoids the extra memcpy of value to std::string in most of cases.
|
* DB::Get in place of std::string accepts PinnableSlice, which avoids the extra memcpy of value to std::string in most of cases.
|
||||||
* PinnableSlice releases the pinned resources that contain the value when it is destructed or when ::Reset() is called on it.
|
* PinnableSlice releases the pinned resources that contain the value when it is destructed or when ::Reset() is called on it.
|
||||||
* The old API that accepts std::string, although discouraged, is still supported.
|
* The old API that accepts std::string, although discouraged, is still supported.
|
||||||
|
* Replace Options::use_direct_writes with Options::use_direct_io_for_flush_and_compaction. Read Direct IO wiki for details.
|
||||||
|
* Added CompactionEventListener and EventListener::OnFlushBegin interfaces.
|
||||||
|
|
||||||
### New Features
|
### New Features
|
||||||
* Memtable flush can be avoided during checkpoint creation if total log file size is smaller than a threshold specified by the user.
|
* Memtable flush can be avoided during checkpoint creation if total log file size is smaller than a threshold specified by the user.
|
||||||
* Introduce level-based L0->L0 compactions to reduce file count, so write delays are incurred less often.
|
* Introduce level-based L0->L0 compactions to reduce file count, so write delays are incurred less often.
|
||||||
* (Experimental) Partitioning filters which creates an index on the partitions. The feature can be enabled by setting partition_filters when using kFullFilter. Currently the feature also requires two-level indexing to be enabled. Number of partitions is the same as the number of partitions for indexes, which is controlled by metadata_block_size.
|
* (Experimental) Partitioning filters which creates an index on the partitions. The feature can be enabled by setting partition_filters when using kFullFilter. Currently the feature also requires two-level indexing to be enabled. Number of partitions is the same as the number of partitions for indexes, which is controlled by metadata_block_size.
|
||||||
|
* DB::ResetStats() to reset internal stats.
|
||||||
|
|
||||||
## 5.3.0 (03/08/2017)
|
## 5.3.0 (03/08/2017)
|
||||||
### Public API Change
|
### Public API Change
|
||||||
|
202
LICENSE.Apache
Normal file
202
LICENSE.Apache
Normal file
@ -0,0 +1,202 @@
|
|||||||
|
|
||||||
|
Apache License
|
||||||
|
Version 2.0, January 2004
|
||||||
|
http://www.apache.org/licenses/
|
||||||
|
|
||||||
|
TERMS AND CONDITIONS FOR USE, REPRODUCTION, AND DISTRIBUTION
|
||||||
|
|
||||||
|
1. Definitions.
|
||||||
|
|
||||||
|
"License" shall mean the terms and conditions for use, reproduction,
|
||||||
|
and distribution as defined by Sections 1 through 9 of this document.
|
||||||
|
|
||||||
|
"Licensor" shall mean the copyright owner or entity authorized by
|
||||||
|
the copyright owner that is granting the License.
|
||||||
|
|
||||||
|
"Legal Entity" shall mean the union of the acting entity and all
|
||||||
|
other entities that control, are controlled by, or are under common
|
||||||
|
control with that entity. For the purposes of this definition,
|
||||||
|
"control" means (i) the power, direct or indirect, to cause the
|
||||||
|
direction or management of such entity, whether by contract or
|
||||||
|
otherwise, or (ii) ownership of fifty percent (50%) or more of the
|
||||||
|
outstanding shares, or (iii) beneficial ownership of such entity.
|
||||||
|
|
||||||
|
"You" (or "Your") shall mean an individual or Legal Entity
|
||||||
|
exercising permissions granted by this License.
|
||||||
|
|
||||||
|
"Source" form shall mean the preferred form for making modifications,
|
||||||
|
including but not limited to software source code, documentation
|
||||||
|
source, and configuration files.
|
||||||
|
|
||||||
|
"Object" form shall mean any form resulting from mechanical
|
||||||
|
transformation or translation of a Source form, including but
|
||||||
|
not limited to compiled object code, generated documentation,
|
||||||
|
and conversions to other media types.
|
||||||
|
|
||||||
|
"Work" shall mean the work of authorship, whether in Source or
|
||||||
|
Object form, made available under the License, as indicated by a
|
||||||
|
copyright notice that is included in or attached to the work
|
||||||
|
(an example is provided in the Appendix below).
|
||||||
|
|
||||||
|
"Derivative Works" shall mean any work, whether in Source or Object
|
||||||
|
form, that is based on (or derived from) the Work and for which the
|
||||||
|
editorial revisions, annotations, elaborations, or other modifications
|
||||||
|
represent, as a whole, an original work of authorship. For the purposes
|
||||||
|
of this License, Derivative Works shall not include works that remain
|
||||||
|
separable from, or merely link (or bind by name) to the interfaces of,
|
||||||
|
the Work and Derivative Works thereof.
|
||||||
|
|
||||||
|
"Contribution" shall mean any work of authorship, including
|
||||||
|
the original version of the Work and any modifications or additions
|
||||||
|
to that Work or Derivative Works thereof, that is intentionally
|
||||||
|
submitted to Licensor for inclusion in the Work by the copyright owner
|
||||||
|
or by an individual or Legal Entity authorized to submit on behalf of
|
||||||
|
the copyright owner. For the purposes of this definition, "submitted"
|
||||||
|
means any form of electronic, verbal, or written communication sent
|
||||||
|
to the Licensor or its representatives, including but not limited to
|
||||||
|
communication on electronic mailing lists, source code control systems,
|
||||||
|
and issue tracking systems that are managed by, or on behalf of, the
|
||||||
|
Licensor for the purpose of discussing and improving the Work, but
|
||||||
|
excluding communication that is conspicuously marked or otherwise
|
||||||
|
designated in writing by the copyright owner as "Not a Contribution."
|
||||||
|
|
||||||
|
"Contributor" shall mean Licensor and any individual or Legal Entity
|
||||||
|
on behalf of whom a Contribution has been received by Licensor and
|
||||||
|
subsequently incorporated within the Work.
|
||||||
|
|
||||||
|
2. Grant of Copyright License. Subject to the terms and conditions of
|
||||||
|
this License, each Contributor hereby grants to You a perpetual,
|
||||||
|
worldwide, non-exclusive, no-charge, royalty-free, irrevocable
|
||||||
|
copyright license to reproduce, prepare Derivative Works of,
|
||||||
|
publicly display, publicly perform, sublicense, and distribute the
|
||||||
|
Work and such Derivative Works in Source or Object form.
|
||||||
|
|
||||||
|
3. Grant of Patent License. Subject to the terms and conditions of
|
||||||
|
this License, each Contributor hereby grants to You a perpetual,
|
||||||
|
worldwide, non-exclusive, no-charge, royalty-free, irrevocable
|
||||||
|
(except as stated in this section) patent license to make, have made,
|
||||||
|
use, offer to sell, sell, import, and otherwise transfer the Work,
|
||||||
|
where such license applies only to those patent claims licensable
|
||||||
|
by such Contributor that are necessarily infringed by their
|
||||||
|
Contribution(s) alone or by combination of their Contribution(s)
|
||||||
|
with the Work to which such Contribution(s) was submitted. If You
|
||||||
|
institute patent litigation against any entity (including a
|
||||||
|
cross-claim or counterclaim in a lawsuit) alleging that the Work
|
||||||
|
or a Contribution incorporated within the Work constitutes direct
|
||||||
|
or contributory patent infringement, then any patent licenses
|
||||||
|
granted to You under this License for that Work shall terminate
|
||||||
|
as of the date such litigation is filed.
|
||||||
|
|
||||||
|
4. Redistribution. You may reproduce and distribute copies of the
|
||||||
|
Work or Derivative Works thereof in any medium, with or without
|
||||||
|
modifications, and in Source or Object form, provided that You
|
||||||
|
meet the following conditions:
|
||||||
|
|
||||||
|
(a) You must give any other recipients of the Work or
|
||||||
|
Derivative Works a copy of this License; and
|
||||||
|
|
||||||
|
(b) You must cause any modified files to carry prominent notices
|
||||||
|
stating that You changed the files; and
|
||||||
|
|
||||||
|
(c) You must retain, in the Source form of any Derivative Works
|
||||||
|
that You distribute, all copyright, patent, trademark, and
|
||||||
|
attribution notices from the Source form of the Work,
|
||||||
|
excluding those notices that do not pertain to any part of
|
||||||
|
the Derivative Works; and
|
||||||
|
|
||||||
|
(d) If the Work includes a "NOTICE" text file as part of its
|
||||||
|
distribution, then any Derivative Works that You distribute must
|
||||||
|
include a readable copy of the attribution notices contained
|
||||||
|
within such NOTICE file, excluding those notices that do not
|
||||||
|
pertain to any part of the Derivative Works, in at least one
|
||||||
|
of the following places: within a NOTICE text file distributed
|
||||||
|
as part of the Derivative Works; within the Source form or
|
||||||
|
documentation, if provided along with the Derivative Works; or,
|
||||||
|
within a display generated by the Derivative Works, if and
|
||||||
|
wherever such third-party notices normally appear. The contents
|
||||||
|
of the NOTICE file are for informational purposes only and
|
||||||
|
do not modify the License. You may add Your own attribution
|
||||||
|
notices within Derivative Works that You distribute, alongside
|
||||||
|
or as an addendum to the NOTICE text from the Work, provided
|
||||||
|
that such additional attribution notices cannot be construed
|
||||||
|
as modifying the License.
|
||||||
|
|
||||||
|
You may add Your own copyright statement to Your modifications and
|
||||||
|
may provide additional or different license terms and conditions
|
||||||
|
for use, reproduction, or distribution of Your modifications, or
|
||||||
|
for any such Derivative Works as a whole, provided Your use,
|
||||||
|
reproduction, and distribution of the Work otherwise complies with
|
||||||
|
the conditions stated in this License.
|
||||||
|
|
||||||
|
5. Submission of Contributions. Unless You explicitly state otherwise,
|
||||||
|
any Contribution intentionally submitted for inclusion in the Work
|
||||||
|
by You to the Licensor shall be under the terms and conditions of
|
||||||
|
this License, without any additional terms or conditions.
|
||||||
|
Notwithstanding the above, nothing herein shall supersede or modify
|
||||||
|
the terms of any separate license agreement you may have executed
|
||||||
|
with Licensor regarding such Contributions.
|
||||||
|
|
||||||
|
6. Trademarks. This License does not grant permission to use the trade
|
||||||
|
names, trademarks, service marks, or product names of the Licensor,
|
||||||
|
except as required for reasonable and customary use in describing the
|
||||||
|
origin of the Work and reproducing the content of the NOTICE file.
|
||||||
|
|
||||||
|
7. Disclaimer of Warranty. Unless required by applicable law or
|
||||||
|
agreed to in writing, Licensor provides the Work (and each
|
||||||
|
Contributor provides its Contributions) on an "AS IS" BASIS,
|
||||||
|
WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or
|
||||||
|
implied, including, without limitation, any warranties or conditions
|
||||||
|
of TITLE, NON-INFRINGEMENT, MERCHANTABILITY, or FITNESS FOR A
|
||||||
|
PARTICULAR PURPOSE. You are solely responsible for determining the
|
||||||
|
appropriateness of using or redistributing the Work and assume any
|
||||||
|
risks associated with Your exercise of permissions under this License.
|
||||||
|
|
||||||
|
8. Limitation of Liability. In no event and under no legal theory,
|
||||||
|
whether in tort (including negligence), contract, or otherwise,
|
||||||
|
unless required by applicable law (such as deliberate and grossly
|
||||||
|
negligent acts) or agreed to in writing, shall any Contributor be
|
||||||
|
liable to You for damages, including any direct, indirect, special,
|
||||||
|
incidental, or consequential damages of any character arising as a
|
||||||
|
result of this License or out of the use or inability to use the
|
||||||
|
Work (including but not limited to damages for loss of goodwill,
|
||||||
|
work stoppage, computer failure or malfunction, or any and all
|
||||||
|
other commercial damages or losses), even if such Contributor
|
||||||
|
has been advised of the possibility of such damages.
|
||||||
|
|
||||||
|
9. Accepting Warranty or Additional Liability. While redistributing
|
||||||
|
the Work or Derivative Works thereof, You may choose to offer,
|
||||||
|
and charge a fee for, acceptance of support, warranty, indemnity,
|
||||||
|
or other liability obligations and/or rights consistent with this
|
||||||
|
License. However, in accepting such obligations, You may act only
|
||||||
|
on Your own behalf and on Your sole responsibility, not on behalf
|
||||||
|
of any other Contributor, and only if You agree to indemnify,
|
||||||
|
defend, and hold each Contributor harmless for any liability
|
||||||
|
incurred by, or claims asserted against, such Contributor by reason
|
||||||
|
of your accepting any such warranty or additional liability.
|
||||||
|
|
||||||
|
END OF TERMS AND CONDITIONS
|
||||||
|
|
||||||
|
APPENDIX: How to apply the Apache License to your work.
|
||||||
|
|
||||||
|
To apply the Apache License to your work, attach the following
|
||||||
|
boilerplate notice, with the fields enclosed by brackets "[]"
|
||||||
|
replaced with your own identifying information. (Don't include
|
||||||
|
the brackets!) The text should be enclosed in the appropriate
|
||||||
|
comment syntax for the file format. We also recommend that a
|
||||||
|
file or class name and description of purpose be included on the
|
||||||
|
same "printed page" as the copyright notice for easier
|
||||||
|
identification within third-party archives.
|
||||||
|
|
||||||
|
Copyright [yyyy] [name of copyright owner]
|
||||||
|
|
||||||
|
Licensed under the Apache License, Version 2.0 (the "License");
|
||||||
|
you may not use this file except in compliance with the License.
|
||||||
|
You may obtain a copy of the License at
|
||||||
|
|
||||||
|
http://www.apache.org/licenses/LICENSE-2.0
|
||||||
|
|
||||||
|
Unless required by applicable law or agreed to in writing, software
|
||||||
|
distributed under the License is distributed on an "AS IS" BASIS,
|
||||||
|
WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
|
||||||
|
See the License for the specific language governing permissions and
|
||||||
|
limitations under the License.
|
@ -1,10 +1,4 @@
|
|||||||
BSD License
|
This contains code that is from LevelDB, and that code is under the following license:
|
||||||
|
|
||||||
For rocksdb software
|
|
||||||
|
|
||||||
Copyright (c) 2011-present, Facebook, Inc.
|
|
||||||
All rights reserved.
|
|
||||||
---------------------------------------------------------------------
|
|
||||||
|
|
||||||
Copyright (c) 2011 The LevelDB Authors. All rights reserved.
|
Copyright (c) 2011 The LevelDB Authors. All rights reserved.
|
||||||
|
|
56
Makefile
56
Makefile
@ -224,11 +224,6 @@ default: all
|
|||||||
WARNING_FLAGS = -W -Wextra -Wall -Wsign-compare -Wshadow \
|
WARNING_FLAGS = -W -Wextra -Wall -Wsign-compare -Wshadow \
|
||||||
-Wno-unused-parameter
|
-Wno-unused-parameter
|
||||||
|
|
||||||
ifndef DISABLE_WARNING_AS_ERROR
|
|
||||||
WARNING_FLAGS += -Werror
|
|
||||||
endif
|
|
||||||
|
|
||||||
|
|
||||||
ifdef LUA_PATH
|
ifdef LUA_PATH
|
||||||
|
|
||||||
ifndef LUA_INCLUDE
|
ifndef LUA_INCLUDE
|
||||||
@ -339,6 +334,7 @@ TESTS = \
|
|||||||
db_io_failure_test \
|
db_io_failure_test \
|
||||||
db_properties_test \
|
db_properties_test \
|
||||||
db_table_properties_test \
|
db_table_properties_test \
|
||||||
|
db_statistics_test \
|
||||||
autovector_test \
|
autovector_test \
|
||||||
cleanable_test \
|
cleanable_test \
|
||||||
column_family_test \
|
column_family_test \
|
||||||
@ -379,7 +375,6 @@ TESTS = \
|
|||||||
ttl_test \
|
ttl_test \
|
||||||
date_tiered_test \
|
date_tiered_test \
|
||||||
backupable_db_test \
|
backupable_db_test \
|
||||||
blob_db_test \
|
|
||||||
document_db_test \
|
document_db_test \
|
||||||
json_document_test \
|
json_document_test \
|
||||||
sim_cache_test \
|
sim_cache_test \
|
||||||
@ -400,6 +395,7 @@ TESTS = \
|
|||||||
options_settable_test \
|
options_settable_test \
|
||||||
options_util_test \
|
options_util_test \
|
||||||
event_logger_test \
|
event_logger_test \
|
||||||
|
timer_queue_test \
|
||||||
cuckoo_table_builder_test \
|
cuckoo_table_builder_test \
|
||||||
cuckoo_table_reader_test \
|
cuckoo_table_reader_test \
|
||||||
cuckoo_table_db_test \
|
cuckoo_table_db_test \
|
||||||
@ -1027,6 +1023,9 @@ db_range_del_test: db/db_range_del_test.o db/db_test_util.o $(LIBOBJECTS) $(TEST
|
|||||||
db_sst_test: db/db_sst_test.o db/db_test_util.o $(LIBOBJECTS) $(TESTHARNESS)
|
db_sst_test: db/db_sst_test.o db/db_test_util.o $(LIBOBJECTS) $(TESTHARNESS)
|
||||||
$(AM_LINK)
|
$(AM_LINK)
|
||||||
|
|
||||||
|
db_statistics_test: db/db_statistics_test.o db/db_test_util.o $(LIBOBJECTS) $(TESTHARNESS)
|
||||||
|
$(AM_LINK)
|
||||||
|
|
||||||
external_sst_file_basic_test: db/external_sst_file_basic_test.o db/db_test_util.o $(LIBOBJECTS) $(TESTHARNESS)
|
external_sst_file_basic_test: db/external_sst_file_basic_test.o db/db_test_util.o $(LIBOBJECTS) $(TESTHARNESS)
|
||||||
$(AM_LINK)
|
$(AM_LINK)
|
||||||
|
|
||||||
@ -1075,9 +1074,6 @@ prefix_test: db/prefix_test.o $(LIBOBJECTS) $(TESTHARNESS)
|
|||||||
backupable_db_test: utilities/backupable/backupable_db_test.o $(LIBOBJECTS) $(TESTHARNESS)
|
backupable_db_test: utilities/backupable/backupable_db_test.o $(LIBOBJECTS) $(TESTHARNESS)
|
||||||
$(AM_LINK)
|
$(AM_LINK)
|
||||||
|
|
||||||
blob_db_test: utilities/blob_db/blob_db_test.o $(LIBOBJECTS) $(TESTHARNESS)
|
|
||||||
$(AM_LINK)
|
|
||||||
|
|
||||||
checkpoint_test: utilities/checkpoint/checkpoint_test.o $(LIBOBJECTS) $(TESTHARNESS)
|
checkpoint_test: utilities/checkpoint/checkpoint_test.o $(LIBOBJECTS) $(TESTHARNESS)
|
||||||
$(AM_LINK)
|
$(AM_LINK)
|
||||||
|
|
||||||
@ -1272,6 +1268,9 @@ db_bench_tool_test: tools/db_bench_tool_test.o $(BENCHTOOLOBJECTS) $(TESTHARNESS
|
|||||||
event_logger_test: util/event_logger_test.o $(LIBOBJECTS) $(TESTHARNESS)
|
event_logger_test: util/event_logger_test.o $(LIBOBJECTS) $(TESTHARNESS)
|
||||||
$(AM_LINK)
|
$(AM_LINK)
|
||||||
|
|
||||||
|
timer_queue_test: util/timer_queue_test.o $(LIBOBJECTS) $(TESTHARNESS)
|
||||||
|
$(AM_LINK)
|
||||||
|
|
||||||
sst_dump_test: tools/sst_dump_test.o $(LIBOBJECTS) $(TESTHARNESS)
|
sst_dump_test: tools/sst_dump_test.o $(LIBOBJECTS) $(TESTHARNESS)
|
||||||
$(AM_LINK)
|
$(AM_LINK)
|
||||||
|
|
||||||
@ -1405,6 +1404,9 @@ SNAPPY_VER = 1.1.4
|
|||||||
SNAPPY_SHA256 = 134bfe122fd25599bb807bb8130e7ba6d9bdb851e0b16efcb83ac4f5d0b70057
|
SNAPPY_SHA256 = 134bfe122fd25599bb807bb8130e7ba6d9bdb851e0b16efcb83ac4f5d0b70057
|
||||||
LZ4_VER = 1.7.5
|
LZ4_VER = 1.7.5
|
||||||
LZ4_SHA256 = 0190cacd63022ccb86f44fa5041dc6c3804407ad61550ca21c382827319e7e7e
|
LZ4_SHA256 = 0190cacd63022ccb86f44fa5041dc6c3804407ad61550ca21c382827319e7e7e
|
||||||
|
ZSTD_VER ?= 1.2.0
|
||||||
|
ZSTD_SHA256 ?= 4a7e4593a3638276ca7f2a09dc4f38e674d8317bbea51626393ca73fc047cbfb
|
||||||
|
ZSTD_DOWNLOAD_BASE ?= https://github.com/facebook/zstd/archive
|
||||||
|
|
||||||
ifeq ($(PLATFORM), OS_MACOSX)
|
ifeq ($(PLATFORM), OS_MACOSX)
|
||||||
ROCKSDBJNILIB = librocksdbjni-osx.jnilib
|
ROCKSDBJNILIB = librocksdbjni-osx.jnilib
|
||||||
@ -1478,16 +1480,29 @@ liblz4.a:
|
|||||||
cd lz4-$(LZ4_VER)/lib && make CFLAGS='-fPIC' all
|
cd lz4-$(LZ4_VER)/lib && make CFLAGS='-fPIC' all
|
||||||
cp lz4-$(LZ4_VER)/lib/liblz4.a .
|
cp lz4-$(LZ4_VER)/lib/liblz4.a .
|
||||||
|
|
||||||
|
libzstd.a:
|
||||||
|
-rm -rf zstd-$(ZSTD_VER)
|
||||||
|
curl -O -L ${ZSTD_DOWNLOAD_BASE}/v$(ZSTD_VER).tar.gz
|
||||||
|
mv v$(ZSTD_VER).tar.gz zstd-$(ZSTD_VER).tar.gz
|
||||||
|
ZSTD_SHA256_ACTUAL=`$(SHA256_CMD) zstd-$(ZSTD_VER).tar.gz | cut -d ' ' -f 1`; \
|
||||||
|
if [ "$(ZSTD_SHA256)" != "$$ZSTD_SHA256_ACTUAL" ]; then \
|
||||||
|
echo zstd-$(ZSTD_VER).tar.gz checksum mismatch, expected=\"$(ZSTD_SHA256)\" actual=\"$$ZSTD_SHA256_ACTUAL\"; \
|
||||||
|
exit 1; \
|
||||||
|
fi
|
||||||
|
tar xvzf zstd-$(ZSTD_VER).tar.gz
|
||||||
|
cd zstd-$(ZSTD_VER)/lib && make CFLAGS='-fPIC -O2 ${EXTRA_CFLAGS}' all
|
||||||
|
cp zstd-$(ZSTD_VER)/lib/libzstd.a .
|
||||||
|
|
||||||
# A version of each $(LIBOBJECTS) compiled with -fPIC and a fixed set of static compression libraries
|
# A version of each $(LIBOBJECTS) compiled with -fPIC and a fixed set of static compression libraries
|
||||||
java_static_libobjects = $(patsubst %,jls/%,$(LIBOBJECTS))
|
java_static_libobjects = $(patsubst %,jls/%,$(LIBOBJECTS))
|
||||||
CLEAN_FILES += jls
|
CLEAN_FILES += jls
|
||||||
|
|
||||||
ifneq ($(ROCKSDB_JAVA_NO_COMPRESSION), 1)
|
ifneq ($(ROCKSDB_JAVA_NO_COMPRESSION), 1)
|
||||||
JAVA_COMPRESSIONS = libz.a libbz2.a libsnappy.a liblz4.a
|
JAVA_COMPRESSIONS = libz.a libbz2.a libsnappy.a liblz4.a libzstd.a
|
||||||
endif
|
endif
|
||||||
|
|
||||||
JAVA_STATIC_FLAGS = -DZLIB -DBZIP2 -DSNAPPY -DLZ4
|
JAVA_STATIC_FLAGS = -DZLIB -DBZIP2 -DSNAPPY -DLZ4 -DZSTD
|
||||||
JAVA_STATIC_INCLUDES = -I./zlib-$(ZLIB_VER) -I./bzip2-$(BZIP2_VER) -I./snappy-$(SNAPPY_VER) -I./lz4-$(LZ4_VER)/lib
|
JAVA_STATIC_INCLUDES = -I./zlib-$(ZLIB_VER) -I./bzip2-$(BZIP2_VER) -I./snappy-$(SNAPPY_VER) -I./lz4-$(LZ4_VER)/lib -I./zstd-$(ZSTD_VER)/lib
|
||||||
|
|
||||||
$(java_static_libobjects): jls/%.o: %.cc $(JAVA_COMPRESSIONS)
|
$(java_static_libobjects): jls/%.o: %.cc $(JAVA_COMPRESSIONS)
|
||||||
$(AM_V_CC)mkdir -p $(@D) && $(CXX) $(CXXFLAGS) $(JAVA_STATIC_FLAGS) $(JAVA_STATIC_INCLUDES) -fPIC -c $< -o $@ $(COVERAGEFLAGS)
|
$(AM_V_CC)mkdir -p $(@D) && $(CXX) $(CXXFLAGS) $(JAVA_STATIC_FLAGS) $(JAVA_STATIC_INCLUDES) -fPIC -c $< -o $@ $(COVERAGEFLAGS)
|
||||||
@ -1512,8 +1527,25 @@ rocksdbjavastaticrelease: rocksdbjavastatic
|
|||||||
cd java/target;jar -uf $(ROCKSDB_JAR_ALL) librocksdbjni-*.so librocksdbjni-*.jnilib
|
cd java/target;jar -uf $(ROCKSDB_JAR_ALL) librocksdbjni-*.so librocksdbjni-*.jnilib
|
||||||
cd java/target/classes;jar -uf ../$(ROCKSDB_JAR_ALL) org/rocksdb/*.class org/rocksdb/util/*.class
|
cd java/target/classes;jar -uf ../$(ROCKSDB_JAR_ALL) org/rocksdb/*.class org/rocksdb/util/*.class
|
||||||
|
|
||||||
|
rocksdbjavastaticreleasedocker: rocksdbjavastatic
|
||||||
|
DOCKER_LINUX_X64_CONTAINER=`docker ps -aqf name=rocksdb_linux_x64-be`; \
|
||||||
|
if [ -z "$$DOCKER_LINUX_X64_CONTAINER" ]; then \
|
||||||
|
docker container create --attach stdin --attach stdout --attach stderr --volume `pwd`:/rocksdb-host --name rocksdb_linux_x64-be evolvedbinary/rocksjava:centos5_x64-be /rocksdb-host/java/crossbuild/docker-build-linux-centos.sh; \
|
||||||
|
fi
|
||||||
|
docker start -a rocksdb_linux_x64-be
|
||||||
|
DOCKER_LINUX_X86_CONTAINER=`docker ps -aqf name=rocksdb_linux_x86-be`; \
|
||||||
|
if [ -z "$$DOCKER_LINUX_X86_CONTAINER" ]; then \
|
||||||
|
docker container create --attach stdin --attach stdout --attach stderr --volume `pwd`:/rocksdb-host --name rocksdb_linux_x86-be evolvedbinary/rocksjava:centos5_x86-be /rocksdb-host/java/crossbuild/docker-build-linux-centos.sh; \
|
||||||
|
fi
|
||||||
|
docker start -a rocksdb_linux_x86-be
|
||||||
|
cd java;jar -cf target/$(ROCKSDB_JAR_ALL) HISTORY*.md
|
||||||
|
cd java/target;jar -uf $(ROCKSDB_JAR_ALL) librocksdbjni-*.so librocksdbjni-*.jnilib
|
||||||
|
cd java/target/classes;jar -uf ../$(ROCKSDB_JAR_ALL) org/rocksdb/*.class org/rocksdb/util/*.class
|
||||||
|
|
||||||
rocksdbjavastaticpublish: rocksdbjavastaticrelease rocksdbjavastaticpublishcentral
|
rocksdbjavastaticpublish: rocksdbjavastaticrelease rocksdbjavastaticpublishcentral
|
||||||
|
|
||||||
|
rocksdbjavastaticpublishdocker: rocksdbjavastaticreleasedocker rocksdbjavastaticpublishcentral
|
||||||
|
|
||||||
rocksdbjavastaticpublishcentral:
|
rocksdbjavastaticpublishcentral:
|
||||||
mvn gpg:sign-and-deploy-file -Durl=https://oss.sonatype.org/service/local/staging/deploy/maven2/ -DrepositoryId=sonatype-nexus-staging -DpomFile=java/rocksjni.pom -Dfile=java/target/rocksdbjni-$(ROCKSDB_MAJOR).$(ROCKSDB_MINOR).$(ROCKSDB_PATCH)-javadoc.jar -Dclassifier=javadoc
|
mvn gpg:sign-and-deploy-file -Durl=https://oss.sonatype.org/service/local/staging/deploy/maven2/ -DrepositoryId=sonatype-nexus-staging -DpomFile=java/rocksjni.pom -Dfile=java/target/rocksdbjni-$(ROCKSDB_MAJOR).$(ROCKSDB_MINOR).$(ROCKSDB_PATCH)-javadoc.jar -Dclassifier=javadoc
|
||||||
mvn gpg:sign-and-deploy-file -Durl=https://oss.sonatype.org/service/local/staging/deploy/maven2/ -DrepositoryId=sonatype-nexus-staging -DpomFile=java/rocksjni.pom -Dfile=java/target/rocksdbjni-$(ROCKSDB_MAJOR).$(ROCKSDB_MINOR).$(ROCKSDB_PATCH)-sources.jar -Dclassifier=sources
|
mvn gpg:sign-and-deploy-file -Durl=https://oss.sonatype.org/service/local/staging/deploy/maven2/ -DrepositoryId=sonatype-nexus-staging -DpomFile=java/rocksjni.pom -Dfile=java/target/rocksdbjni-$(ROCKSDB_MAJOR).$(ROCKSDB_MINOR).$(ROCKSDB_PATCH)-sources.jar -Dclassifier=sources
|
||||||
|
33
PATENTS
33
PATENTS
@ -1,33 +0,0 @@
|
|||||||
Additional Grant of Patent Rights Version 2
|
|
||||||
|
|
||||||
"Software" means the RocksDB software distributed by Facebook, Inc.
|
|
||||||
|
|
||||||
Facebook, Inc. ("Facebook") hereby grants to each recipient of the Software
|
|
||||||
("you") a perpetual, worldwide, royalty-free, non-exclusive, irrevocable
|
|
||||||
(subject to the termination provision below) license under any Necessary
|
|
||||||
Claims, to make, have made, use, sell, offer to sell, import, and otherwise
|
|
||||||
transfer the Software. For avoidance of doubt, no license is granted under
|
|
||||||
Facebook’s rights in any patent claims that are infringed by (i) modifications
|
|
||||||
to the Software made by you or any third party or (ii) the Software in
|
|
||||||
combination with any software or other technology.
|
|
||||||
|
|
||||||
The license granted hereunder will terminate, automatically and without notice,
|
|
||||||
if you (or any of your subsidiaries, corporate affiliates or agents) initiate
|
|
||||||
directly or indirectly, or take a direct financial interest in, any Patent
|
|
||||||
Assertion: (i) against Facebook or any of its subsidiaries or corporate
|
|
||||||
affiliates, (ii) against any party if such Patent Assertion arises in whole or
|
|
||||||
in part from any software, technology, product or service of Facebook or any of
|
|
||||||
its subsidiaries or corporate affiliates, or (iii) against any party relating
|
|
||||||
to the Software. Notwithstanding the foregoing, if Facebook or any of its
|
|
||||||
subsidiaries or corporate affiliates files a lawsuit alleging patent
|
|
||||||
infringement against you in the first instance, and you respond by filing a
|
|
||||||
patent infringement counterclaim in that lawsuit against that party that is
|
|
||||||
unrelated to the Software, the license granted hereunder will not terminate
|
|
||||||
under section (i) of this paragraph due to such counterclaim.
|
|
||||||
|
|
||||||
A "Necessary Claim" is a claim of a patent owned by Facebook that is
|
|
||||||
necessarily infringed by the Software standing alone.
|
|
||||||
|
|
||||||
A "Patent Assertion" is any lawsuit or other action alleging direct, indirect,
|
|
||||||
or contributory infringement or inducement to infringe any patent, including a
|
|
||||||
cross-claim or counterclaim.
|
|
10
TARGETS
10
TARGETS
@ -195,6 +195,12 @@ cpp_library(
|
|||||||
"util/xxhash.cc",
|
"util/xxhash.cc",
|
||||||
"utilities/backupable/backupable_db.cc",
|
"utilities/backupable/backupable_db.cc",
|
||||||
"utilities/blob_db/blob_db.cc",
|
"utilities/blob_db/blob_db.cc",
|
||||||
|
"utilities/blob_db/blob_db_impl.cc",
|
||||||
|
"utilities/blob_db/blob_db_options_impl.cc",
|
||||||
|
"utilities/blob_db/blob_file.cc",
|
||||||
|
"utilities/blob_db/blob_log_reader.cc",
|
||||||
|
"utilities/blob_db/blob_log_writer.cc",
|
||||||
|
"utilities/blob_db/blob_log_format.cc",
|
||||||
"utilities/checkpoint/checkpoint.cc",
|
"utilities/checkpoint/checkpoint.cc",
|
||||||
"utilities/compaction_filters/remove_emptyvalue_compactionfilter.cc",
|
"utilities/compaction_filters/remove_emptyvalue_compactionfilter.cc",
|
||||||
"utilities/convenience/info_log_finder.cc",
|
"utilities/convenience/info_log_finder.cc",
|
||||||
@ -319,7 +325,6 @@ ROCKS_TESTS = [['merger_test', 'table/merger_test.cc', 'serial'],
|
|||||||
['compact_files_test', 'db/compact_files_test.cc', 'serial'],
|
['compact_files_test', 'db/compact_files_test.cc', 'serial'],
|
||||||
['db_options_test', 'db/db_options_test.cc', 'serial'],
|
['db_options_test', 'db/db_options_test.cc', 'serial'],
|
||||||
['object_registry_test', 'utilities/object_registry_test.cc', 'serial'],
|
['object_registry_test', 'utilities/object_registry_test.cc', 'serial'],
|
||||||
['blob_db_test', 'utilities/blob_db/blob_db_test.cc', 'serial'],
|
|
||||||
['auto_roll_logger_test', 'util/auto_roll_logger_test.cc', 'serial'],
|
['auto_roll_logger_test', 'util/auto_roll_logger_test.cc', 'serial'],
|
||||||
['dbformat_test', 'db/dbformat_test.cc', 'serial'],
|
['dbformat_test', 'db/dbformat_test.cc', 'serial'],
|
||||||
['write_batch_with_index_test',
|
['write_batch_with_index_test',
|
||||||
@ -444,7 +449,8 @@ ROCKS_TESTS = [['merger_test', 'table/merger_test.cc', 'serial'],
|
|||||||
['version_edit_test', 'db/version_edit_test.cc', 'serial'],
|
['version_edit_test', 'db/version_edit_test.cc', 'serial'],
|
||||||
['skiplist_test', 'memtable/skiplist_test.cc', 'serial'],
|
['skiplist_test', 'memtable/skiplist_test.cc', 'serial'],
|
||||||
['lru_cache_test', 'cache/lru_cache_test.cc', 'serial'],
|
['lru_cache_test', 'cache/lru_cache_test.cc', 'serial'],
|
||||||
['plain_table_db_test', 'db/plain_table_db_test.cc', 'serial']]
|
['plain_table_db_test', 'db/plain_table_db_test.cc', 'serial'],
|
||||||
|
['db_statistics_test', 'db/db_statistics_test.cc', 'serial']]
|
||||||
|
|
||||||
|
|
||||||
# Generate a test rule for each entry in ROCKS_TESTS
|
# Generate a test rule for each entry in ROCKS_TESTS
|
||||||
|
@ -1,3 +0,0 @@
|
|||||||
<?php
|
|
||||||
|
|
||||||
phutil_register_library('arcanist_util', __FILE__);
|
|
@ -1,71 +0,0 @@
|
|||||||
<?php
|
|
||||||
|
|
||||||
/**
|
|
||||||
* This file is automatically generated. Use 'arc liberate' to rebuild it.
|
|
||||||
* @generated
|
|
||||||
* @phutil-library-version 2
|
|
||||||
*/
|
|
||||||
|
|
||||||
if (class_exists('ArcanistWorkflow')) {
|
|
||||||
phutil_register_library_map(array(
|
|
||||||
'__library_version__' => 2,
|
|
||||||
'class' =>
|
|
||||||
array(
|
|
||||||
'ArcanistCpplintLinter' => 'cpp_linter/ArcanistCpplintLinter.php',
|
|
||||||
'BaseDirectoryScopedFormatLinter' => 'cpp_linter/BaseDirectoryScopedFormatLinter.php',
|
|
||||||
'FacebookArcanistConfiguration' => 'config/FacebookArcanistConfiguration.php',
|
|
||||||
'FacebookFbcodeLintEngine' => 'lint_engine/FacebookFbcodeLintEngine.php',
|
|
||||||
'FacebookFbcodeUnitTestEngine' => 'unit_engine/FacebookFbcodeUnitTestEngine.php',
|
|
||||||
'FacebookHowtoevenLintEngine' => 'lint_engine/FacebookHowtoevenLintEngine.php',
|
|
||||||
'FacebookHowtoevenLinter' => 'cpp_linter/FacebookHowtoevenLinter.php',
|
|
||||||
'FbcodeClangFormatLinter' => 'cpp_linter/FbcodeClangFormatLinter.php',
|
|
||||||
'FbcodeCppLinter' => 'cpp_linter/FbcodeCppLinter.php',
|
|
||||||
),
|
|
||||||
'function' =>
|
|
||||||
array(
|
|
||||||
),
|
|
||||||
'xmap' =>
|
|
||||||
array(
|
|
||||||
'ArcanistCpplintLinter' => 'ArcanistLinter',
|
|
||||||
'BaseDirectoryScopedFormatLinter' => 'ArcanistLinter',
|
|
||||||
'FacebookArcanistConfiguration' => 'ArcanistConfiguration',
|
|
||||||
'FacebookFbcodeLintEngine' => 'ArcanistLintEngine',
|
|
||||||
'FacebookFbcodeUnitTestEngine' => 'ArcanistBaseUnitTestEngine',
|
|
||||||
'FacebookHowtoevenLintEngine' => 'ArcanistLintEngine',
|
|
||||||
'FacebookHowtoevenLinter' => 'ArcanistLinter',
|
|
||||||
'FbcodeClangFormatLinter' => 'BaseDirectoryScopedFormatLinter',
|
|
||||||
'FbcodeCppLinter' => 'ArcanistLinter',
|
|
||||||
),
|
|
||||||
));
|
|
||||||
} else {
|
|
||||||
phutil_register_library_map(array(
|
|
||||||
'__library_version__' => 2,
|
|
||||||
'class' =>
|
|
||||||
array(
|
|
||||||
'ArcanistCpplintLinter' => 'cpp_linter/ArcanistCpplintLinter.php',
|
|
||||||
'BaseDirectoryScopedFormatLinter' => 'cpp_linter/BaseDirectoryScopedFormatLinter.php',
|
|
||||||
'FacebookArcanistConfiguration' => 'config/FacebookOldArcanistConfiguration.php',
|
|
||||||
'FacebookFbcodeLintEngine' => 'lint_engine/FacebookFbcodeLintEngine.php',
|
|
||||||
'FacebookFbcodeUnitTestEngine' => 'unit_engine/FacebookOldFbcodeUnitTestEngine.php',
|
|
||||||
'FacebookHowtoevenLintEngine' => 'lint_engine/FacebookHowtoevenLintEngine.php',
|
|
||||||
'FacebookHowtoevenLinter' => 'cpp_linter/FacebookHowtoevenLinter.php',
|
|
||||||
'FbcodeClangFormatLinter' => 'cpp_linter/FbcodeClangFormatLinter.php',
|
|
||||||
'FbcodeCppLinter' => 'cpp_linter/FbcodeCppLinter.php',
|
|
||||||
),
|
|
||||||
'function' =>
|
|
||||||
array(
|
|
||||||
),
|
|
||||||
'xmap' =>
|
|
||||||
array(
|
|
||||||
'ArcanistCpplintLinter' => 'ArcanistLinter',
|
|
||||||
'BaseDirectoryScopedFormatLinter' => 'ArcanistLinter',
|
|
||||||
'FacebookArcanistConfiguration' => 'ArcanistConfiguration',
|
|
||||||
'FacebookFbcodeLintEngine' => 'ArcanistLintEngine',
|
|
||||||
'FacebookFbcodeUnitTestEngine' => 'ArcanistBaseUnitTestEngine',
|
|
||||||
'FacebookHowtoevenLintEngine' => 'ArcanistLintEngine',
|
|
||||||
'FacebookHowtoevenLinter' => 'ArcanistLinter',
|
|
||||||
'FbcodeClangFormatLinter' => 'BaseDirectoryScopedFormatLinter',
|
|
||||||
'FbcodeCppLinter' => 'ArcanistLinter',
|
|
||||||
),
|
|
||||||
));
|
|
||||||
}
|
|
@ -1,43 +0,0 @@
|
|||||||
<?php
|
|
||||||
// Copyright 2004-present Facebook. All Rights Reserved.
|
|
||||||
// This source code is licensed under the BSD-style license found in the
|
|
||||||
// LICENSE file in the root directory of this source tree. An additional grant
|
|
||||||
// of patent rights can be found in the PATENTS file in the same directory.
|
|
||||||
|
|
||||||
require('RocksDBCommonHelper.php');
|
|
||||||
|
|
||||||
define("DIFF_COMMAND", "diff");
|
|
||||||
|
|
||||||
class FacebookArcanistConfiguration extends ArcanistConfiguration {
|
|
||||||
public function getCustomArgumentsForCommand($command) {
|
|
||||||
if ($command == "land") {
|
|
||||||
return array(
|
|
||||||
'async' => array('help' => 'Just to make tools happy'));
|
|
||||||
}
|
|
||||||
return array();
|
|
||||||
}
|
|
||||||
|
|
||||||
public function didRunWorkflow($command,
|
|
||||||
ArcanistWorkflow $workflow,
|
|
||||||
$error_code) {
|
|
||||||
// Default options don't terminate on failure, but that's what we want. In
|
|
||||||
// the current case we use assertions intentionally as "terminate on failure
|
|
||||||
// invariants".
|
|
||||||
assert_options(ASSERT_BAIL, true);
|
|
||||||
|
|
||||||
assert($workflow);
|
|
||||||
assert(strlen($command) > 0);
|
|
||||||
|
|
||||||
if ($command == DIFF_COMMAND && !$workflow->isRawDiffSource()) {
|
|
||||||
$diffID = $workflow->getDiffId();
|
|
||||||
|
|
||||||
// When submitting a diff this code path gets executed multiple times in
|
|
||||||
// a row. We only care about the case when ID for the diff is provided
|
|
||||||
// because that's what we need to apply the diff and trigger the tests.
|
|
||||||
if (strlen($diffID) > 0) {
|
|
||||||
assert(is_numeric($diffID));
|
|
||||||
startTestsInSandcastle(true /* $applyDiff */, $workflow, $diffID);
|
|
||||||
}
|
|
||||||
}
|
|
||||||
}
|
|
||||||
}
|
|
@ -1,43 +0,0 @@
|
|||||||
<?php
|
|
||||||
// Copyright 2004-present Facebook. All Rights Reserved.
|
|
||||||
// This source code is licensed under the BSD-style license found in the
|
|
||||||
// LICENSE file in the root directory of this source tree. An additional grant
|
|
||||||
// of patent rights can be found in the PATENTS file in the same directory.
|
|
||||||
|
|
||||||
require('RocksDBCommonHelper.php');
|
|
||||||
|
|
||||||
define("DIFF_COMMAND", "diff");
|
|
||||||
|
|
||||||
class FacebookArcanistConfiguration extends ArcanistConfiguration {
|
|
||||||
public function getCustomArgumentsForCommand($command) {
|
|
||||||
if ($command == "land") {
|
|
||||||
return array(
|
|
||||||
'async' => array('help' => 'Just to make tools happy'));
|
|
||||||
}
|
|
||||||
return array();
|
|
||||||
}
|
|
||||||
|
|
||||||
public function didRunWorkflow($command,
|
|
||||||
ArcanistBaseWorkflow $workflow,
|
|
||||||
$error_code) {
|
|
||||||
// Default options don't terminate on failure, but that's what we want. In
|
|
||||||
// the current case we use assertions intentionally as "terminate on failure
|
|
||||||
// invariants".
|
|
||||||
assert_options(ASSERT_BAIL, true);
|
|
||||||
|
|
||||||
assert($workflow);
|
|
||||||
assert(strlen($command) > 0);
|
|
||||||
|
|
||||||
if ($command == DIFF_COMMAND && !$workflow->isRawDiffSource()) {
|
|
||||||
$diffID = $workflow->getDiffId();
|
|
||||||
|
|
||||||
// When submitting a diff this code path gets executed multiple times in
|
|
||||||
// a row. We only care about the case when ID for the diff is provided
|
|
||||||
// because that's what we need to apply the diff and trigger the tests.
|
|
||||||
if (strlen($diffID) > 0) {
|
|
||||||
assert(is_numeric($diffID));
|
|
||||||
startTestsInSandcastle(true /* $applyDiff */, $workflow, $diffID);
|
|
||||||
}
|
|
||||||
}
|
|
||||||
}
|
|
||||||
}
|
|
@ -1,355 +0,0 @@
|
|||||||
<?php
|
|
||||||
// Copyright 2004-present Facebook. All Rights Reserved.
|
|
||||||
// This source code is licensed under the BSD-style license found in the
|
|
||||||
// LICENSE file in the root directory of this source tree. An additional grant
|
|
||||||
// of patent rights can be found in the PATENTS file in the same directory.
|
|
||||||
|
|
||||||
// Name of the environment variables which need to be set by the entity which
|
|
||||||
// triggers continuous runs so that code at the end of the file gets executed
|
|
||||||
// and Sandcastle run starts.
|
|
||||||
define("ENV_POST_RECEIVE_HOOK", "POST_RECEIVE_HOOK");
|
|
||||||
define("ENV_HTTPS_APP_VALUE", "HTTPS_APP_VALUE");
|
|
||||||
define("ENV_HTTPS_TOKEN_VALUE", "HTTPS_TOKEN_VALUE");
|
|
||||||
|
|
||||||
define("PRIMARY_TOKEN_FILE", '/home/krad/.sandcastle');
|
|
||||||
define("CONT_RUN_ALIAS", "leveldb");
|
|
||||||
|
|
||||||
//////////////////////////////////////////////////////////////////////
|
|
||||||
/* Run tests in sandcastle */
|
|
||||||
function postURL($diffID, $url) {
|
|
||||||
assert(strlen($diffID) > 0);
|
|
||||||
assert(is_numeric($diffID));
|
|
||||||
assert(strlen($url) > 0);
|
|
||||||
|
|
||||||
$cmd = 'echo \'{"diff_id": ' . $diffID . ', '
|
|
||||||
. '"name":"click here for sandcastle tests for D' . $diffID . '", '
|
|
||||||
. '"link":"' . $url . '"}\' | '
|
|
||||||
. 'arc call-conduit '
|
|
||||||
. 'differential.updateunitresults';
|
|
||||||
shell_exec($cmd);
|
|
||||||
}
|
|
||||||
|
|
||||||
function buildUpdateTestStatusCmd($diffID, $test, $status) {
|
|
||||||
assert(strlen($diffID) > 0);
|
|
||||||
assert(is_numeric($diffID));
|
|
||||||
assert(strlen($test) > 0);
|
|
||||||
assert(strlen($status) > 0);
|
|
||||||
|
|
||||||
$cmd = 'echo \'{"diff_id": ' . $diffID . ', '
|
|
||||||
. '"name":"' . $test . '", '
|
|
||||||
. '"result":"' . $status . '"}\' | '
|
|
||||||
. 'arc call-conduit '
|
|
||||||
. 'differential.updateunitresults';
|
|
||||||
return $cmd;
|
|
||||||
}
|
|
||||||
|
|
||||||
function updateTestStatus($diffID, $test) {
|
|
||||||
assert(strlen($diffID) > 0);
|
|
||||||
assert(is_numeric($diffID));
|
|
||||||
assert(strlen($test) > 0);
|
|
||||||
|
|
||||||
shell_exec(buildUpdateTestStatusCmd($diffID, $test, "waiting"));
|
|
||||||
}
|
|
||||||
|
|
||||||
function getSteps($applyDiff, $diffID, $username, $test) {
|
|
||||||
assert(strlen($username) > 0);
|
|
||||||
assert(strlen($test) > 0);
|
|
||||||
|
|
||||||
if ($applyDiff) {
|
|
||||||
assert(strlen($diffID) > 0);
|
|
||||||
assert(is_numeric($diffID));
|
|
||||||
|
|
||||||
$arcrc_content = (PHP_OS == "Darwin" ?
|
|
||||||
exec("cat ~/.arcrc | gzip -f | base64") :
|
|
||||||
exec("cat ~/.arcrc | gzip -f | base64 -w0"));
|
|
||||||
assert(strlen($arcrc_content) > 0);
|
|
||||||
|
|
||||||
// Sandcastle machines don't have arc setup. We copy the user certificate
|
|
||||||
// and authenticate using that in Sandcastle.
|
|
||||||
$setup = array(
|
|
||||||
"name" => "Setup arcrc",
|
|
||||||
"shell" => "echo " . $arcrc_content . " | base64 --decode"
|
|
||||||
. " | gzip -d > ~/.arcrc",
|
|
||||||
"user" => "root"
|
|
||||||
);
|
|
||||||
|
|
||||||
// arc demands certain permission on its config.
|
|
||||||
// also fix the sticky bit issue in sandcastle
|
|
||||||
$fix_permission = array(
|
|
||||||
"name" => "Fix environment",
|
|
||||||
"shell" => "chmod 600 ~/.arcrc && chmod +t /dev/shm",
|
|
||||||
"user" => "root"
|
|
||||||
);
|
|
||||||
|
|
||||||
// Construct the steps in the order of execution.
|
|
||||||
$steps[] = $setup;
|
|
||||||
$steps[] = $fix_permission;
|
|
||||||
}
|
|
||||||
|
|
||||||
// fbcode is a sub-repo. We cannot patch until we add it to ignore otherwise
|
|
||||||
// Git thinks it is an uncommited change.
|
|
||||||
$fix_git_ignore = array(
|
|
||||||
"name" => "Fix git ignore",
|
|
||||||
"shell" => "echo fbcode >> .git/info/exclude",
|
|
||||||
"user" => "root"
|
|
||||||
);
|
|
||||||
|
|
||||||
$steps[] = $fix_git_ignore;
|
|
||||||
|
|
||||||
// This will be the command used to execute particular type of tests.
|
|
||||||
$cmd = "";
|
|
||||||
|
|
||||||
if ($applyDiff) {
|
|
||||||
// Patch the code (keep your fingures crossed).
|
|
||||||
$patch = array(
|
|
||||||
"name" => "Patch " . $diffID,
|
|
||||||
"shell" => "arc --arcrc-file ~/.arcrc "
|
|
||||||
. "patch --nocommit --diff " . $diffID,
|
|
||||||
"user" => "root"
|
|
||||||
);
|
|
||||||
|
|
||||||
$steps[] = $patch;
|
|
||||||
|
|
||||||
updateTestStatus($diffID, $test);
|
|
||||||
$cmd = buildUpdateTestStatusCmd($diffID, $test, "running") . "; ";
|
|
||||||
}
|
|
||||||
|
|
||||||
// Run the actual command.
|
|
||||||
$cmd = $cmd . "J=$(nproc) ./build_tools/precommit_checker.py " . $test
|
|
||||||
. "; exit_code=$?; ";
|
|
||||||
|
|
||||||
if ($applyDiff) {
|
|
||||||
$cmd = $cmd . "([[ \$exit_code -eq 0 ]] &&"
|
|
||||||
. buildUpdateTestStatusCmd($diffID, $test, "pass") . ")"
|
|
||||||
. "||" . buildUpdateTestStatusCmd($diffID, $test, "fail")
|
|
||||||
. "; ";
|
|
||||||
}
|
|
||||||
|
|
||||||
// shell command to sort the tests based on exit code and print
|
|
||||||
// the output of the log files.
|
|
||||||
$cat_sorted_logs = "
|
|
||||||
while read code log_file;
|
|
||||||
do echo \"################ cat \$log_file [exit_code : \$code] ################\";
|
|
||||||
cat \$log_file;
|
|
||||||
done < <(tail -n +2 LOG | sort -k7,7n -k4,4gr | awk '{print \$7,\$NF}')";
|
|
||||||
|
|
||||||
// Shell command to cat all log files
|
|
||||||
$cat_all_logs = "for f in `ls t/!(run-*)`; do echo \$f;cat \$f; done";
|
|
||||||
|
|
||||||
// If LOG file exist use it to cat log files sorted by exit code, otherwise
|
|
||||||
// cat everything
|
|
||||||
$logs_cmd = "if [ -f LOG ]; then {$cat_sorted_logs}; else {$cat_all_logs}; fi";
|
|
||||||
|
|
||||||
$cmd = $cmd . " cat /tmp/precommit-check.log"
|
|
||||||
. "; shopt -s extglob; {$logs_cmd}"
|
|
||||||
. "; shopt -u extglob; [[ \$exit_code -eq 0 ]]";
|
|
||||||
assert(strlen($cmd) > 0);
|
|
||||||
|
|
||||||
$run_test = array(
|
|
||||||
"name" => "Run " . $test,
|
|
||||||
"shell" => $cmd,
|
|
||||||
"user" => "root",
|
|
||||||
"parser" => "python build_tools/error_filter.py " . $test,
|
|
||||||
);
|
|
||||||
|
|
||||||
$steps[] = $run_test;
|
|
||||||
|
|
||||||
if ($applyDiff) {
|
|
||||||
// Clean up the user arc config we are using.
|
|
||||||
$cleanup = array(
|
|
||||||
"name" => "Arc cleanup",
|
|
||||||
"shell" => "rm -f ~/.arcrc",
|
|
||||||
"user" => "root"
|
|
||||||
);
|
|
||||||
|
|
||||||
$steps[] = $cleanup;
|
|
||||||
}
|
|
||||||
|
|
||||||
assert(count($steps) > 0);
|
|
||||||
return $steps;
|
|
||||||
}
|
|
||||||
|
|
||||||
function getSandcastleConfig() {
|
|
||||||
$sandcastle_config = array();
|
|
||||||
|
|
||||||
$cwd = getcwd();
|
|
||||||
$cwd_token_file = "{$cwd}/.sandcastle";
|
|
||||||
// This is a case when we're executed from a continuous run. Fetch the values
|
|
||||||
// from the environment.
|
|
||||||
if (getenv(ENV_POST_RECEIVE_HOOK)) {
|
|
||||||
$sandcastle_config[0] = getenv(ENV_HTTPS_APP_VALUE);
|
|
||||||
$sandcastle_config[1] = getenv(ENV_HTTPS_TOKEN_VALUE);
|
|
||||||
} else {
|
|
||||||
// This is a typical `[p]arc diff` case. Fetch the values from the specific
|
|
||||||
// configuration files.
|
|
||||||
for ($i = 0; $i < 50; $i++) {
|
|
||||||
if (file_exists(PRIMARY_TOKEN_FILE) ||
|
|
||||||
file_exists($cwd_token_file)) {
|
|
||||||
break;
|
|
||||||
}
|
|
||||||
// If we failed to fetch the tokens, sleep for 0.2 second and try again
|
|
||||||
usleep(200000);
|
|
||||||
}
|
|
||||||
assert(file_exists(PRIMARY_TOKEN_FILE) ||
|
|
||||||
file_exists($cwd_token_file));
|
|
||||||
|
|
||||||
// Try the primary location first, followed by a secondary.
|
|
||||||
if (file_exists(PRIMARY_TOKEN_FILE)) {
|
|
||||||
$cmd = 'cat ' . PRIMARY_TOKEN_FILE;
|
|
||||||
} else {
|
|
||||||
$cmd = 'cat ' . $cwd_token_file;
|
|
||||||
}
|
|
||||||
|
|
||||||
assert(strlen($cmd) > 0);
|
|
||||||
$sandcastle_config = explode(':', rtrim(shell_exec($cmd)));
|
|
||||||
}
|
|
||||||
|
|
||||||
// In this case be very explicit about the implications.
|
|
||||||
if (count($sandcastle_config) != 2) {
|
|
||||||
echo "Sandcastle configuration files don't contain valid information " .
|
|
||||||
"or the necessary environment variables aren't defined. Unable " .
|
|
||||||
"to validate the code changes.";
|
|
||||||
exit(1);
|
|
||||||
}
|
|
||||||
|
|
||||||
assert(strlen($sandcastle_config[0]) > 0);
|
|
||||||
assert(strlen($sandcastle_config[1]) > 0);
|
|
||||||
assert(count($sandcastle_config) > 0);
|
|
||||||
|
|
||||||
return $sandcastle_config;
|
|
||||||
}
|
|
||||||
|
|
||||||
// This function can be called either from `[p]arc diff` command or during
|
|
||||||
// the Git post-receive hook.
|
|
||||||
function startTestsInSandcastle($applyDiff, $workflow, $diffID) {
|
|
||||||
// Default options don't terminate on failure, but that's what we want. In
|
|
||||||
// the current case we use assertions intentionally as "terminate on failure
|
|
||||||
// invariants".
|
|
||||||
assert_options(ASSERT_BAIL, true);
|
|
||||||
|
|
||||||
// In case of a diff we'll send notificatios to the author. Else it'll go to
|
|
||||||
// the entire team because failures indicate that build quality has regressed.
|
|
||||||
$username = $applyDiff ? exec("whoami") : CONT_RUN_ALIAS;
|
|
||||||
assert(strlen($username) > 0);
|
|
||||||
|
|
||||||
if ($applyDiff) {
|
|
||||||
assert($workflow);
|
|
||||||
assert(strlen($diffID) > 0);
|
|
||||||
assert(is_numeric($diffID));
|
|
||||||
}
|
|
||||||
|
|
||||||
// List of tests we want to run in Sandcastle.
|
|
||||||
$tests = array("unit", "unit_non_shm", "unit_481", "clang_unit", "tsan",
|
|
||||||
"asan", "lite_test", "valgrind", "release", "release_481",
|
|
||||||
"clang_release", "punit", "clang_analyze", "code_cov",
|
|
||||||
"java_build", "no_compression", "unity", "ubsan");
|
|
||||||
|
|
||||||
$send_email_template = array(
|
|
||||||
'type' => 'email',
|
|
||||||
'triggers' => array('fail'),
|
|
||||||
'emails' => array($username . '@fb.com'),
|
|
||||||
);
|
|
||||||
|
|
||||||
// Construct a job definition for each test and add it to the master plan.
|
|
||||||
foreach ($tests as $test) {
|
|
||||||
$stepName = "RocksDB diff " . $diffID . " test " . $test;
|
|
||||||
|
|
||||||
if (!$applyDiff) {
|
|
||||||
$stepName = "RocksDB continuous integration test " . $test;
|
|
||||||
}
|
|
||||||
|
|
||||||
$arg[] = array(
|
|
||||||
"name" => $stepName,
|
|
||||||
"report" => array($send_email_template),
|
|
||||||
"steps" => getSteps($applyDiff, $diffID, $username, $test)
|
|
||||||
);
|
|
||||||
}
|
|
||||||
|
|
||||||
// We cannot submit the parallel execution master plan to Sandcastle and
|
|
||||||
// need supply the job plan as a determinator. So we construct a small job
|
|
||||||
// that will spit out the master job plan which Sandcastle will parse and
|
|
||||||
// execute. Why compress the job definitions? Otherwise we run over the max
|
|
||||||
// string size.
|
|
||||||
$cmd = "echo " . base64_encode(json_encode($arg))
|
|
||||||
. (PHP_OS == "Darwin" ?
|
|
||||||
" | gzip -f | base64" :
|
|
||||||
" | gzip -f | base64 -w0");
|
|
||||||
assert(strlen($cmd) > 0);
|
|
||||||
|
|
||||||
$arg_encoded = shell_exec($cmd);
|
|
||||||
assert(strlen($arg_encoded) > 0);
|
|
||||||
|
|
||||||
$runName = "Run diff " . $diffID . "for user " . $username;
|
|
||||||
|
|
||||||
if (!$applyDiff) {
|
|
||||||
$runName = "RocksDB continuous integration build and test run";
|
|
||||||
}
|
|
||||||
|
|
||||||
$command = array(
|
|
||||||
"name" => $runName,
|
|
||||||
"steps" => array()
|
|
||||||
);
|
|
||||||
|
|
||||||
$command["steps"][] = array(
|
|
||||||
"name" => "Generate determinator",
|
|
||||||
"shell" => "echo " . $arg_encoded . " | base64 --decode | gzip -d"
|
|
||||||
. " | base64 --decode",
|
|
||||||
"determinator" => true,
|
|
||||||
"user" => "root"
|
|
||||||
);
|
|
||||||
|
|
||||||
// Submit to Sandcastle.
|
|
||||||
$url = 'https://interngraph.intern.facebook.com/sandcastle/create';
|
|
||||||
|
|
||||||
$job = array(
|
|
||||||
'command' => 'SandcastleUniversalCommand',
|
|
||||||
'args' => $command,
|
|
||||||
'capabilities' => array(
|
|
||||||
'vcs' => 'rocksdb-int-git',
|
|
||||||
'type' => 'lego',
|
|
||||||
),
|
|
||||||
'hash' => 'origin/master',
|
|
||||||
'user' => $username,
|
|
||||||
'alias' => 'rocksdb-precommit',
|
|
||||||
'tags' => array('rocksdb'),
|
|
||||||
'description' => 'Rocksdb precommit job',
|
|
||||||
);
|
|
||||||
|
|
||||||
// Fetch the configuration necessary to submit a successful HTTPS request.
|
|
||||||
$sandcastle_config = getSandcastleConfig();
|
|
||||||
|
|
||||||
$app = $sandcastle_config[0];
|
|
||||||
$token = $sandcastle_config[1];
|
|
||||||
|
|
||||||
$cmd = 'curl -s -k -F app=' . $app . ' '
|
|
||||||
. '-F token=' . $token . ' -F job=\'' . json_encode($job)
|
|
||||||
.'\' "' . $url . '"';
|
|
||||||
|
|
||||||
$output = shell_exec($cmd);
|
|
||||||
assert(strlen($output) > 0);
|
|
||||||
|
|
||||||
// Extract Sandcastle URL from the response.
|
|
||||||
preg_match('/url": "(.+)"/', $output, $sandcastle_url);
|
|
||||||
|
|
||||||
assert(count($sandcastle_url) > 0, "Unable to submit Sandcastle request.");
|
|
||||||
assert(strlen($sandcastle_url[1]) > 0, "Unable to extract Sandcastle URL.");
|
|
||||||
|
|
||||||
if ($applyDiff) {
|
|
||||||
echo "\nSandcastle URL: " . $sandcastle_url[1] . "\n";
|
|
||||||
// Ask Phabricator to display it on the diff UI.
|
|
||||||
postURL($diffID, $sandcastle_url[1]);
|
|
||||||
} else {
|
|
||||||
echo "Continuous integration started Sandcastle tests. You can look at ";
|
|
||||||
echo "the progress at:\n" . $sandcastle_url[1] . "\n";
|
|
||||||
}
|
|
||||||
}
|
|
||||||
|
|
||||||
// Continuous run cript will set the environment variable and based on that
|
|
||||||
// we'll trigger the execution of tests in Sandcastle. In that case we don't
|
|
||||||
// need to apply any diffs and there's no associated workflow either.
|
|
||||||
if (getenv(ENV_POST_RECEIVE_HOOK)) {
|
|
||||||
startTestsInSandcastle(
|
|
||||||
false /* $applyDiff */,
|
|
||||||
NULL /* $workflow */,
|
|
||||||
NULL /* $diffID */);
|
|
||||||
}
|
|
@ -1,88 +0,0 @@
|
|||||||
<?php
|
|
||||||
|
|
||||||
/**
|
|
||||||
* Uses google's cpplint.py to check code. RocksDB team forked this file from
|
|
||||||
* phabricator's /src/lint/linter/ArcanistCpplintLinter.php, and customized it
|
|
||||||
* for its own use.
|
|
||||||
*
|
|
||||||
* You can get it here:
|
|
||||||
* http://google-styleguide.googlecode.com/svn/trunk/cpplint/cpplint.py
|
|
||||||
* @group linter
|
|
||||||
*/
|
|
||||||
final class ArcanistCpplintLinter extends ArcanistLinter {
|
|
||||||
|
|
||||||
public function willLintPaths(array $paths) {
|
|
||||||
return;
|
|
||||||
}
|
|
||||||
|
|
||||||
public function getLinterName() {
|
|
||||||
return 'cpplint.py';
|
|
||||||
}
|
|
||||||
|
|
||||||
public function getLintPath() {
|
|
||||||
$bin = 'cpplint.py';
|
|
||||||
// Search under current dir
|
|
||||||
list($err) = exec_manual('which %s/%s', $this->linterDir(), $bin);
|
|
||||||
if (!$err) {
|
|
||||||
return $this->linterDir().'/'.$bin;
|
|
||||||
}
|
|
||||||
|
|
||||||
// Look for globally installed cpplint.py
|
|
||||||
list($err) = exec_manual('which %s', $bin);
|
|
||||||
if ($err) {
|
|
||||||
throw new ArcanistUsageException(
|
|
||||||
"cpplint.py does not appear to be installed on this system. Install ".
|
|
||||||
"it (e.g., with 'wget \"http://google-styleguide.googlecode.com/".
|
|
||||||
"svn/trunk/cpplint/cpplint.py\"') ".
|
|
||||||
"in your .arcconfig to point to the directory where it resides. ".
|
|
||||||
"Also don't forget to chmod a+x cpplint.py!");
|
|
||||||
}
|
|
||||||
|
|
||||||
return $bin;
|
|
||||||
}
|
|
||||||
|
|
||||||
public function lintPath($path) {
|
|
||||||
$bin = $this->getLintPath();
|
|
||||||
$path = $this->rocksdbDir().'/'.$path;
|
|
||||||
|
|
||||||
$f = new ExecFuture("%C $path", $bin);
|
|
||||||
|
|
||||||
list($err, $stdout, $stderr) = $f->resolve();
|
|
||||||
|
|
||||||
if ($err === 2) {
|
|
||||||
throw new Exception("cpplint failed to run correctly:\n".$stderr);
|
|
||||||
}
|
|
||||||
|
|
||||||
$lines = explode("\n", $stderr);
|
|
||||||
$messages = array();
|
|
||||||
foreach ($lines as $line) {
|
|
||||||
$line = trim($line);
|
|
||||||
$matches = null;
|
|
||||||
$regex = '/^[^:]+:(\d+):\s*(.*)\s*\[(.*)\] \[(\d+)\]$/';
|
|
||||||
if (!preg_match($regex, $line, $matches)) {
|
|
||||||
continue;
|
|
||||||
}
|
|
||||||
foreach ($matches as $key => $match) {
|
|
||||||
$matches[$key] = trim($match);
|
|
||||||
}
|
|
||||||
$message = new ArcanistLintMessage();
|
|
||||||
$message->setPath($path);
|
|
||||||
$message->setLine($matches[1]);
|
|
||||||
$message->setCode($matches[3]);
|
|
||||||
$message->setName($matches[3]);
|
|
||||||
$message->setDescription($matches[2]);
|
|
||||||
$message->setSeverity(ArcanistLintSeverity::SEVERITY_WARNING);
|
|
||||||
$this->addLintMessage($message);
|
|
||||||
}
|
|
||||||
}
|
|
||||||
|
|
||||||
// The path of this linter
|
|
||||||
private function linterDir() {
|
|
||||||
return dirname(__FILE__);
|
|
||||||
}
|
|
||||||
|
|
||||||
// TODO(kaili) a quick and dirty way to figure out rocksdb's root dir.
|
|
||||||
private function rocksdbDir() {
|
|
||||||
return $this->linterDir()."/../..";
|
|
||||||
}
|
|
||||||
}
|
|
@ -1,74 +0,0 @@
|
|||||||
<?php
|
|
||||||
// Copyright 2004-present Facebook. All Rights Reserved.
|
|
||||||
// This source code is licensed under the BSD-style license found in the
|
|
||||||
// LICENSE file in the root directory of this source tree. An additional grant
|
|
||||||
// of patent rights can be found in the PATENTS file in the same directory.
|
|
||||||
|
|
||||||
abstract class BaseDirectoryScopedFormatLinter extends ArcanistLinter {
|
|
||||||
|
|
||||||
const LINT_FORMATTING = 1;
|
|
||||||
|
|
||||||
private $changedLines = array();
|
|
||||||
private $rawLintOutput = array();
|
|
||||||
|
|
||||||
abstract protected function getPathsToLint();
|
|
||||||
|
|
||||||
protected function shouldLintPath($path) {
|
|
||||||
foreach ($this->getPathsToLint() as $p) {
|
|
||||||
// check if $path starts with $p
|
|
||||||
if (strncmp($path, $p, strlen($p)) === 0) {
|
|
||||||
return true;
|
|
||||||
}
|
|
||||||
}
|
|
||||||
return false;
|
|
||||||
}
|
|
||||||
|
|
||||||
// API to tell this linter which lines were changed
|
|
||||||
final public function setPathChangedLines($path, $changed) {
|
|
||||||
$this->changedLines[$path] = $changed;
|
|
||||||
}
|
|
||||||
|
|
||||||
final public function willLintPaths(array $paths) {
|
|
||||||
$futures = array();
|
|
||||||
foreach ($paths as $path) {
|
|
||||||
if (!$this->shouldLintPath($path)) {
|
|
||||||
continue;
|
|
||||||
}
|
|
||||||
|
|
||||||
$changed = $this->changedLines[$path];
|
|
||||||
if (!isset($changed)) {
|
|
||||||
// do not run linter if there are no changes
|
|
||||||
continue;
|
|
||||||
}
|
|
||||||
|
|
||||||
$futures[$path] = $this->getFormatFuture($path, $changed);
|
|
||||||
}
|
|
||||||
|
|
||||||
foreach (id(new FutureIterator($futures))->limit(8) as $p => $f) {
|
|
||||||
$this->rawLintOutput[$p] = $f->resolvex();
|
|
||||||
}
|
|
||||||
}
|
|
||||||
|
|
||||||
abstract protected function getFormatFuture($path, array $changed);
|
|
||||||
abstract protected function getLintMessage($diff);
|
|
||||||
|
|
||||||
final public function lintPath($path) {
|
|
||||||
if (!isset($this->rawLintOutput[$path])) {
|
|
||||||
return;
|
|
||||||
}
|
|
||||||
|
|
||||||
list($new_content) = $this->rawLintOutput[$path];
|
|
||||||
$old_content = $this->getData($path);
|
|
||||||
|
|
||||||
if ($new_content != $old_content) {
|
|
||||||
$diff = ArcanistDiffUtils::renderDifferences($old_content, $new_content);
|
|
||||||
$this->raiseLintAtOffset(
|
|
||||||
0,
|
|
||||||
self::LINT_FORMATTING,
|
|
||||||
$this->getLintMessage($diff),
|
|
||||||
$old_content,
|
|
||||||
$new_content);
|
|
||||||
}
|
|
||||||
}
|
|
||||||
|
|
||||||
}
|
|
@ -1,223 +0,0 @@
|
|||||||
<?php
|
|
||||||
// Copyright 2015-present Facebook. All Rights Reserved.
|
|
||||||
// This source code is licensed under the BSD-style license found in the
|
|
||||||
// LICENSE file in the root directory of this source tree. An additional grant
|
|
||||||
// of patent rights can be found in the PATENTS file in the same directory.
|
|
||||||
|
|
||||||
final class FacebookHowtoevenLinter extends ArcanistLinter {
|
|
||||||
|
|
||||||
const VERSION = 'fd9192f324c36d28136d14380f0b552a1385b59b';
|
|
||||||
|
|
||||||
private $parsedTargets = array();
|
|
||||||
|
|
||||||
public function getLinterName() {
|
|
||||||
return 'Howtoeven';
|
|
||||||
}
|
|
||||||
|
|
||||||
protected function getSeverity($code) {
|
|
||||||
$severities = array(
|
|
||||||
ArcanistLintSeverity::SEVERITY_DISABLED,
|
|
||||||
ArcanistLintSeverity::SEVERITY_ADVICE,
|
|
||||||
ArcanistLintSeverity::SEVERITY_WARNING,
|
|
||||||
ArcanistLintSeverity::SEVERITY_ERROR,
|
|
||||||
);
|
|
||||||
return idx($severities, $code, ArcanistLintSeverity::SEVERITY_WARNING);
|
|
||||||
}
|
|
||||||
|
|
||||||
public function willLintPaths(array $paths) {
|
|
||||||
// Cleanup previous runs.
|
|
||||||
$this->localExecx("rm -rf _build/_lint");
|
|
||||||
|
|
||||||
// Build compilation database.
|
|
||||||
$lintable_paths = $this->getLintablePaths($paths);
|
|
||||||
$interesting_paths = $this->getInterestingPaths($lintable_paths);
|
|
||||||
|
|
||||||
if (!$lintable_paths) {
|
|
||||||
return;
|
|
||||||
}
|
|
||||||
|
|
||||||
// Run lint.
|
|
||||||
try {
|
|
||||||
$this->localExecx(
|
|
||||||
"%C %C -p _build/dev/ %Ls",
|
|
||||||
$this->getBinaryPath(),
|
|
||||||
$this->getFilteredIssues(),
|
|
||||||
$lintable_paths);
|
|
||||||
} catch (CommandException $exception) {
|
|
||||||
PhutilConsole::getConsole()->writeErr($exception->getMessage());
|
|
||||||
}
|
|
||||||
|
|
||||||
// Load results.
|
|
||||||
$result = id(
|
|
||||||
new SQLite3(
|
|
||||||
$this->getProjectRoot().'/_build/_lint/lint.db',
|
|
||||||
SQLITE3_OPEN_READONLY))
|
|
||||||
->query("SELECT * FROM raised_issues");
|
|
||||||
|
|
||||||
while ($issue = $result->fetchArray(SQLITE3_ASSOC)) {
|
|
||||||
// Skip issues not part of the linted file.
|
|
||||||
if (in_array($issue['file'], $interesting_paths)) {
|
|
||||||
$this->addLintMessage(id(new ArcanistLintMessage())
|
|
||||||
->setPath($issue['file'])
|
|
||||||
->setLine($issue['line'])
|
|
||||||
->setChar($issue['column'])
|
|
||||||
->setCode('Howtoeven')
|
|
||||||
->setSeverity($this->getSeverity($issue['severity']))
|
|
||||||
->setName('Hte-'.$issue['name'])
|
|
||||||
->setDescription(
|
|
||||||
sprintf(
|
|
||||||
"%s\n\n%s",
|
|
||||||
($issue['message']) ? $issue['message'] : $issue['description'],
|
|
||||||
$issue['explanation']))
|
|
||||||
->setOriginalText(idx($issue, 'original', ''))
|
|
||||||
->setReplacementText(idx($issue, 'replacement', '')));
|
|
||||||
}
|
|
||||||
}
|
|
||||||
}
|
|
||||||
|
|
||||||
public function lintPath($path) {
|
|
||||||
}
|
|
||||||
|
|
||||||
/**
|
|
||||||
* Get the paths that we know how to lint.
|
|
||||||
*
|
|
||||||
* The strategy is to first look whether there's an existing compilation
|
|
||||||
* database and use that if it's exhaustive. We generate our own only if
|
|
||||||
* necessary.
|
|
||||||
*/
|
|
||||||
private function getLintablePaths($paths) {
|
|
||||||
// Replace headers with existing sources.
|
|
||||||
for ($i = 0; $i < count($paths); $i++) {
|
|
||||||
if (preg_match("/\.h$/", $paths[$i])) {
|
|
||||||
$header = preg_replace("/\.h$/", ".cpp", $paths[$i]);
|
|
||||||
if (file_exists($header)) {
|
|
||||||
$paths[$i] = $header;
|
|
||||||
}
|
|
||||||
}
|
|
||||||
}
|
|
||||||
|
|
||||||
// Check if database exists and is exhaustive.
|
|
||||||
$available_paths = $this->getAvailablePaths();
|
|
||||||
$lintable_paths = array_intersect($paths, $available_paths);
|
|
||||||
if ($paths === $lintable_paths) {
|
|
||||||
return $lintable_paths;
|
|
||||||
}
|
|
||||||
|
|
||||||
// Generate our own database.
|
|
||||||
$targets = $this->getTargetsFor($paths);
|
|
||||||
if (!$targets) {
|
|
||||||
PhutilConsole::getConsole()->writeErr(
|
|
||||||
"No build targets found for %s\n",
|
|
||||||
implode(', ', $paths));
|
|
||||||
return array();
|
|
||||||
}
|
|
||||||
|
|
||||||
$this->localExecx("./tools/build/bin/fbconfig.par -r %Ls", $targets);
|
|
||||||
$this->localExecx("./tools/build/bin/fbmake.par gen_cdb");
|
|
||||||
|
|
||||||
$available_paths = $this->getAvailablePaths();
|
|
||||||
$lintable_paths = array_intersect($paths, $available_paths);
|
|
||||||
if ($paths != $lintable_paths) {
|
|
||||||
PhutilConsole::getConsole()->writeErr(
|
|
||||||
"Can't lint %s\n",
|
|
||||||
implode(', ', array_diff($paths, $available_paths)));
|
|
||||||
}
|
|
||||||
|
|
||||||
// Return what we know how to lint.
|
|
||||||
return $lintable_paths;
|
|
||||||
}
|
|
||||||
|
|
||||||
/**
|
|
||||||
* Get the available paths in the current compilation database.
|
|
||||||
*/
|
|
||||||
private function getAvailablePaths() {
|
|
||||||
$database_path = $this->getProjectRoot()
|
|
||||||
.'/_build/dev/compile_commands.json';
|
|
||||||
if (!file_exists($database_path)) {
|
|
||||||
return array();
|
|
||||||
}
|
|
||||||
|
|
||||||
$entries = json_decode(file_get_contents($database_path), true);
|
|
||||||
$paths = array();
|
|
||||||
foreach ($entries as $entry) {
|
|
||||||
$paths[] = $entry['file'];
|
|
||||||
}
|
|
||||||
return $paths;
|
|
||||||
}
|
|
||||||
|
|
||||||
/**
|
|
||||||
* Search for the targets directories for the given files.
|
|
||||||
*/
|
|
||||||
private static function getTargetsFor($paths) {
|
|
||||||
$targets = array();
|
|
||||||
foreach ($paths as $path) {
|
|
||||||
while (($path = dirname($path)) !== '.') {
|
|
||||||
if (in_array('TARGETS', scandir($path))) {
|
|
||||||
$contents = file_get_contents($path.'/TARGETS');
|
|
||||||
if (strpos($contents, 'cpp_binary') !== false) {
|
|
||||||
$targets[] = $path;
|
|
||||||
break;
|
|
||||||
}
|
|
||||||
}
|
|
||||||
}
|
|
||||||
}
|
|
||||||
return array_unique($targets);
|
|
||||||
}
|
|
||||||
|
|
||||||
/**
|
|
||||||
* The paths that we actually want to report on.
|
|
||||||
*/
|
|
||||||
private function getInterestingPaths($paths) {
|
|
||||||
$headers = array();
|
|
||||||
foreach ($paths as $path) {
|
|
||||||
$headers[] = preg_replace("/\.cpp$/", ".h", $path);
|
|
||||||
}
|
|
||||||
return array_merge($paths, $headers);
|
|
||||||
}
|
|
||||||
|
|
||||||
/**
|
|
||||||
* The path where the binary is located. Will return the current dewey binary
|
|
||||||
* unless the `HOWTOEVEN_BUILD` environment variable is set.
|
|
||||||
*/
|
|
||||||
private function getBinaryPath() {
|
|
||||||
$path = sprintf(
|
|
||||||
"/mnt/dewey/fbcode/.commits/%s/builds/howtoeven/client",
|
|
||||||
self::VERSION);
|
|
||||||
|
|
||||||
$build = getenv('HOWTOEVEN_BUILD');
|
|
||||||
if ($build) {
|
|
||||||
$path = sprintf(
|
|
||||||
"./_build/%s/tools/howtoeven/client",
|
|
||||||
$build);
|
|
||||||
if (!file_exists($path)) {
|
|
||||||
PhutilConsole::getConsole()->writeErr(">> %s does not exist\n", $path);
|
|
||||||
exit(1);
|
|
||||||
}
|
|
||||||
}
|
|
||||||
|
|
||||||
return $path;
|
|
||||||
}
|
|
||||||
|
|
||||||
/**
|
|
||||||
* Execute the command in the root directory.
|
|
||||||
*/
|
|
||||||
private function localExecx($command /* , ... */) {
|
|
||||||
$arguments = func_get_args();
|
|
||||||
return newv('ExecFuture', $arguments)
|
|
||||||
->setCWD($this->getProjectRoot())
|
|
||||||
->resolvex();
|
|
||||||
}
|
|
||||||
|
|
||||||
/**
|
|
||||||
* The root of the project.
|
|
||||||
*/
|
|
||||||
private function getProjectRoot() {
|
|
||||||
return $this->getEngine()->getWorkingCopy()->getProjectRoot();
|
|
||||||
}
|
|
||||||
|
|
||||||
private function getFilteredIssues() {
|
|
||||||
$issues = getenv('HOWTOEVEN_ISSUES');
|
|
||||||
return ($issues) ? csprintf('-issues %s', $issues) : '';
|
|
||||||
}
|
|
||||||
|
|
||||||
}
|
|
@ -1,58 +0,0 @@
|
|||||||
<?php
|
|
||||||
// Copyright 2004-present Facebook. All Rights Reserved.
|
|
||||||
// This source code is licensed under the BSD-style license found in the
|
|
||||||
// LICENSE file in the root directory of this source tree. An additional grant
|
|
||||||
// of patent rights can be found in the PATENTS file in the same directory.
|
|
||||||
|
|
||||||
final class FbcodeClangFormatLinter extends BaseDirectoryScopedFormatLinter {
|
|
||||||
|
|
||||||
const LINT_FORMATTING = 1;
|
|
||||||
const CLANG_FORMAT_BINARY = '/mnt/vol/engshare/admin/scripts/clang-format';
|
|
||||||
|
|
||||||
protected function getPathsToLint() {
|
|
||||||
return array('');
|
|
||||||
}
|
|
||||||
|
|
||||||
public function getLinterName() {
|
|
||||||
return 'CLANG_FORMAT';
|
|
||||||
}
|
|
||||||
|
|
||||||
public function getLintSeverityMap() {
|
|
||||||
return array(
|
|
||||||
self::LINT_FORMATTING => ArcanistLintSeverity::SEVERITY_ADVICE,
|
|
||||||
);
|
|
||||||
}
|
|
||||||
|
|
||||||
public function getLintNameMap() {
|
|
||||||
return array(
|
|
||||||
self::LINT_FORMATTING => pht('Changes are not clang-formatted'),
|
|
||||||
);
|
|
||||||
}
|
|
||||||
|
|
||||||
protected function getFormatFuture($path, array $changed) {
|
|
||||||
$args = "";
|
|
||||||
foreach ($changed as $key => $value) {
|
|
||||||
$args .= " --lines=$key:$key";
|
|
||||||
}
|
|
||||||
|
|
||||||
$binary = self::CLANG_FORMAT_BINARY;
|
|
||||||
if (!file_exists($binary)) {
|
|
||||||
// trust the $PATH
|
|
||||||
$binary = "clang-format";
|
|
||||||
}
|
|
||||||
|
|
||||||
return new ExecFuture(
|
|
||||||
"%s %s $args",
|
|
||||||
$binary,
|
|
||||||
$this->getEngine()->getFilePathOnDisk($path));
|
|
||||||
}
|
|
||||||
|
|
||||||
protected function getLintMessage($diff) {
|
|
||||||
$link_to_clang_format =
|
|
||||||
"[[ http://fburl.com/clang-format | clang-format ]]";
|
|
||||||
return <<<LINT_MSG
|
|
||||||
Changes in this file were not formatted using $link_to_clang_format.
|
|
||||||
Please run build_tools/format-diff.sh or `make format`
|
|
||||||
LINT_MSG;
|
|
||||||
}
|
|
||||||
}
|
|
@ -1,126 +0,0 @@
|
|||||||
<?php
|
|
||||||
// Copyright 2004-present Facebook. All rights reserved.
|
|
||||||
|
|
||||||
class FbcodeCppLinter extends ArcanistLinter {
|
|
||||||
const FLINT = "/home/engshare/tools/flint";
|
|
||||||
const LINT_ERROR = 1;
|
|
||||||
const LINT_WARNING = 2;
|
|
||||||
const LINT_ADVICE = 3;
|
|
||||||
const C_FLAG = "--c_mode=true";
|
|
||||||
|
|
||||||
private $rawLintOutput = array();
|
|
||||||
|
|
||||||
public function willLintPaths(array $paths) {
|
|
||||||
if (!file_exists(self::FLINT)) {
|
|
||||||
return;
|
|
||||||
}
|
|
||||||
$futures = array();
|
|
||||||
foreach ($paths as $p) {
|
|
||||||
$lpath = $this->getEngine()->getFilePathOnDisk($p);
|
|
||||||
$lpath_file = file($lpath);
|
|
||||||
if (preg_match('/\.(c)$/', $lpath) ||
|
|
||||||
preg_match('/-\*-.*Mode: C[; ].*-\*-/', $lpath_file[0]) ||
|
|
||||||
preg_match('/vim(:.*)*:\s*(set\s+)?filetype=c\s*:/', $lpath_file[0])
|
|
||||||
) {
|
|
||||||
$futures[$p] = new ExecFuture("%s %s %s 2>&1",
|
|
||||||
self::FLINT, self::C_FLAG,
|
|
||||||
$this->getEngine()->getFilePathOnDisk($p));
|
|
||||||
} else {
|
|
||||||
$futures[$p] = new ExecFuture("%s %s 2>&1",
|
|
||||||
self::FLINT, $this->getEngine()->getFilePathOnDisk($p));
|
|
||||||
}
|
|
||||||
}
|
|
||||||
|
|
||||||
foreach (Futures($futures)->limit(8) as $p => $f) {
|
|
||||||
$this->rawLintOutput[$p] = $f->resolvex();
|
|
||||||
}
|
|
||||||
|
|
||||||
return;
|
|
||||||
}
|
|
||||||
|
|
||||||
public function getLinterName() {
|
|
||||||
return "FBCPP";
|
|
||||||
}
|
|
||||||
|
|
||||||
public function lintPath($path) {
|
|
||||||
$this->runCppLint($path);
|
|
||||||
}
|
|
||||||
|
|
||||||
private function runCppLint($path) {
|
|
||||||
$msgs = $this->getCppLintOutput($path);
|
|
||||||
foreach ($msgs as $m) {
|
|
||||||
$this->raiseLintAtLine($m['line'], 0, $m['severity'], $m['msg']);
|
|
||||||
}
|
|
||||||
}
|
|
||||||
|
|
||||||
private function adviseOnEachPattern(
|
|
||||||
$path,
|
|
||||||
$regex,
|
|
||||||
$message,
|
|
||||||
$lint_type = self::LINT_ADVICE,
|
|
||||||
$match_idx = 0) {
|
|
||||||
$file_data = $this->getData($path);
|
|
||||||
$matches = array();
|
|
||||||
if (!preg_match_all($regex, $file_data, $matches, PREG_OFFSET_CAPTURE)) {
|
|
||||||
return;
|
|
||||||
}
|
|
||||||
|
|
||||||
foreach ($matches[$match_idx] as $match) {
|
|
||||||
list($match_str, $offset) = $match;
|
|
||||||
$this->raiseLintAtOffset($offset, $lint_type, $message, $match_str);
|
|
||||||
}
|
|
||||||
}
|
|
||||||
|
|
||||||
public function getLintSeverityMap() {
|
|
||||||
return array(
|
|
||||||
self::LINT_WARNING => ArcanistLintSeverity::SEVERITY_WARNING,
|
|
||||||
self::LINT_ADVICE => ArcanistLintSeverity::SEVERITY_ADVICE,
|
|
||||||
self::LINT_ERROR => ArcanistLintSeverity::SEVERITY_ERROR
|
|
||||||
);
|
|
||||||
}
|
|
||||||
|
|
||||||
public function getLintNameMap() {
|
|
||||||
return array(
|
|
||||||
self::LINT_ADVICE => "CppLint Advice",
|
|
||||||
self::LINT_WARNING => "CppLint Warning",
|
|
||||||
self::LINT_ERROR => "CppLint Error"
|
|
||||||
);
|
|
||||||
}
|
|
||||||
|
|
||||||
private function getCppLintOutput($path) {
|
|
||||||
if (!array_key_exists($path, $this->rawLintOutput)) {
|
|
||||||
return array();
|
|
||||||
}
|
|
||||||
list($output) = $this->rawLintOutput[$path];
|
|
||||||
|
|
||||||
$msgs = array();
|
|
||||||
$current = null;
|
|
||||||
$matches = array();
|
|
||||||
foreach (explode("\n", $output) as $line) {
|
|
||||||
if (preg_match('/.*?:(\d+):(.*)/', $line, $matches)) {
|
|
||||||
if ($current) {
|
|
||||||
$msgs[] = $current;
|
|
||||||
}
|
|
||||||
$line = $matches[1];
|
|
||||||
$text = $matches[2];
|
|
||||||
if (preg_match('/.*Warning.*/', $text)) {
|
|
||||||
$sev = self::LINT_WARNING;
|
|
||||||
} else if (preg_match('/.*Advice.*/', $text)) {
|
|
||||||
$sev = self::LINT_ADVICE;
|
|
||||||
} else {
|
|
||||||
$sev = self::LINT_ERROR;
|
|
||||||
}
|
|
||||||
$current = array('line' => $line,
|
|
||||||
'msg' => $text,
|
|
||||||
'severity' => $sev);
|
|
||||||
} else if ($current) {
|
|
||||||
$current['msg'] .= ' ' . $line;
|
|
||||||
}
|
|
||||||
}
|
|
||||||
if ($current) {
|
|
||||||
$msgs[] = $current;
|
|
||||||
}
|
|
||||||
|
|
||||||
return $msgs;
|
|
||||||
}
|
|
||||||
}
|
|
4767
arcanist_util/cpp_linter/cpplint.py
vendored
4767
arcanist_util/cpp_linter/cpplint.py
vendored
File diff suppressed because it is too large
Load Diff
@ -1,138 +0,0 @@
|
|||||||
<?php
|
|
||||||
// Copyright 2004-present Facebook. All rights reserved.
|
|
||||||
// This source code is licensed under the BSD-style license found in the
|
|
||||||
// LICENSE file in the root directory of this source tree. An additional grant
|
|
||||||
// of patent rights can be found in the PATENTS file in the same directory.
|
|
||||||
|
|
||||||
class FacebookFbcodeLintEngine extends ArcanistLintEngine {
|
|
||||||
|
|
||||||
public function buildLinters() {
|
|
||||||
$linters = array();
|
|
||||||
$paths = $this->getPaths();
|
|
||||||
|
|
||||||
// Remove all deleted files, which are not checked by the
|
|
||||||
// following linters.
|
|
||||||
foreach ($paths as $key => $path) {
|
|
||||||
if (!Filesystem::pathExists($this->getFilePathOnDisk($path))) {
|
|
||||||
unset($paths[$key]);
|
|
||||||
}
|
|
||||||
}
|
|
||||||
|
|
||||||
$generated_linter = new ArcanistGeneratedLinter();
|
|
||||||
$linters[] = $generated_linter;
|
|
||||||
|
|
||||||
$nolint_linter = new ArcanistNoLintLinter();
|
|
||||||
$linters[] = $nolint_linter;
|
|
||||||
|
|
||||||
$text_linter = new ArcanistTextLinter();
|
|
||||||
$text_linter->setCustomSeverityMap(array(
|
|
||||||
ArcanistTextLinter::LINT_LINE_WRAP
|
|
||||||
=> ArcanistLintSeverity::SEVERITY_ADVICE,
|
|
||||||
));
|
|
||||||
$linters[] = $text_linter;
|
|
||||||
|
|
||||||
$java_text_linter = new ArcanistTextLinter();
|
|
||||||
$java_text_linter->setMaxLineLength(100);
|
|
||||||
$java_text_linter->setCustomSeverityMap(array(
|
|
||||||
ArcanistTextLinter::LINT_LINE_WRAP
|
|
||||||
=> ArcanistLintSeverity::SEVERITY_ADVICE,
|
|
||||||
));
|
|
||||||
$linters[] = $java_text_linter;
|
|
||||||
|
|
||||||
$python_linter = new ArcanistPEP8Linter();
|
|
||||||
$linters[] = $python_linter;
|
|
||||||
|
|
||||||
$cpp_linters = array();
|
|
||||||
$cpp_linters[] = $linters[] = new ArcanistCpplintLinter();
|
|
||||||
$cpp_linters[] = $linters[] = new FbcodeCppLinter();
|
|
||||||
|
|
||||||
$clang_format_linter = new FbcodeClangFormatLinter();
|
|
||||||
$linters[] = $clang_format_linter;
|
|
||||||
|
|
||||||
$spelling_linter = new ArcanistSpellingLinter();
|
|
||||||
$linters[] = $spelling_linter;
|
|
||||||
|
|
||||||
foreach ($paths as $path) {
|
|
||||||
$is_text = false;
|
|
||||||
|
|
||||||
$text_extensions = (
|
|
||||||
'/\.('.
|
|
||||||
'cpp|cxx|c|cc|h|hpp|hxx|tcc|'.
|
|
||||||
'py|rb|hs|pl|pm|tw|'.
|
|
||||||
'php|phpt|css|js|'.
|
|
||||||
'java|'.
|
|
||||||
'thrift|'.
|
|
||||||
'lua|'.
|
|
||||||
'siv|'.
|
|
||||||
'txt'.
|
|
||||||
')$/'
|
|
||||||
);
|
|
||||||
if (preg_match($text_extensions, $path)) {
|
|
||||||
$is_text = true;
|
|
||||||
}
|
|
||||||
if ($is_text) {
|
|
||||||
$nolint_linter->addPath($path);
|
|
||||||
|
|
||||||
$generated_linter->addPath($path);
|
|
||||||
$generated_linter->addData($path, $this->loadData($path));
|
|
||||||
|
|
||||||
if (preg_match('/\.java$/', $path)) {
|
|
||||||
$java_text_linter->addPath($path);
|
|
||||||
$java_text_linter->addData($path, $this->loadData($path));
|
|
||||||
} else {
|
|
||||||
$text_linter->addPath($path);
|
|
||||||
$text_linter->addData($path, $this->loadData($path));
|
|
||||||
}
|
|
||||||
|
|
||||||
$spelling_linter->addPath($path);
|
|
||||||
$spelling_linter->addData($path, $this->loadData($path));
|
|
||||||
}
|
|
||||||
if (preg_match('/\.(cpp|c|cc|cxx|h|hh|hpp|hxx|tcc)$/', $path)
|
|
||||||
&& !preg_match('/third-party/', $path)) {
|
|
||||||
foreach ($cpp_linters as &$linter) {
|
|
||||||
$linter->addPath($path);
|
|
||||||
$linter->addData($path, $this->loadData($path));
|
|
||||||
}
|
|
||||||
|
|
||||||
$clang_format_linter->addPath($path);
|
|
||||||
$clang_format_linter->addData($path, $this->loadData($path));
|
|
||||||
$clang_format_linter->setPathChangedLines(
|
|
||||||
$path, $this->getPathChangedLines($path));
|
|
||||||
}
|
|
||||||
|
|
||||||
// Match *.py and contbuild config files
|
|
||||||
if (preg_match('/(\.(py|tw|smcprops)|^contbuild\/configs\/[^\/]*)$/',
|
|
||||||
$path)) {
|
|
||||||
$space_count = 4;
|
|
||||||
$real_path = $this->getFilePathOnDisk($path);
|
|
||||||
$dir = dirname($real_path);
|
|
||||||
do {
|
|
||||||
if (file_exists($dir.'/.python2space')) {
|
|
||||||
$space_count = 2;
|
|
||||||
break;
|
|
||||||
}
|
|
||||||
$dir = dirname($dir);
|
|
||||||
} while ($dir != '/' && $dir != '.');
|
|
||||||
|
|
||||||
$cur_path_linter = $python_linter;
|
|
||||||
$cur_path_linter->addPath($path);
|
|
||||||
$cur_path_linter->addData($path, $this->loadData($path));
|
|
||||||
|
|
||||||
if (preg_match('/\.tw$/', $path)) {
|
|
||||||
$cur_path_linter->setCustomSeverityMap(array(
|
|
||||||
'E251' => ArcanistLintSeverity::SEVERITY_DISABLED,
|
|
||||||
));
|
|
||||||
}
|
|
||||||
}
|
|
||||||
}
|
|
||||||
|
|
||||||
$name_linter = new ArcanistFilenameLinter();
|
|
||||||
$linters[] = $name_linter;
|
|
||||||
foreach ($paths as $path) {
|
|
||||||
$name_linter->addPath($path);
|
|
||||||
}
|
|
||||||
|
|
||||||
return $linters;
|
|
||||||
}
|
|
||||||
|
|
||||||
}
|
|
@ -1,27 +0,0 @@
|
|||||||
<?php
|
|
||||||
// Copyright 2015-present Facebook. All Rights Reserved.
|
|
||||||
// This source code is licensed under the BSD-style license found in the
|
|
||||||
// LICENSE file in the root directory of this source tree. An additional grant
|
|
||||||
// of patent rights can be found in the PATENTS file in the same directory.
|
|
||||||
|
|
||||||
final class FacebookHowtoevenLintEngine extends ArcanistLintEngine {
|
|
||||||
|
|
||||||
public function buildLinters() {
|
|
||||||
$paths = array();
|
|
||||||
|
|
||||||
foreach ($this->getPaths() as $path) {
|
|
||||||
// Don't try to lint deleted files or changed directories.
|
|
||||||
if (!Filesystem::pathExists($path) || is_dir($path)) {
|
|
||||||
continue;
|
|
||||||
}
|
|
||||||
|
|
||||||
if (preg_match('/\.(cpp|c|cc|cxx|h|hh|hpp|hxx|tcc)$/', $path)) {
|
|
||||||
$paths[] = $path;
|
|
||||||
}
|
|
||||||
}
|
|
||||||
|
|
||||||
$howtoeven = new FacebookHowtoevenLinter();
|
|
||||||
$howtoeven->setPaths($paths);
|
|
||||||
return array($howtoeven);
|
|
||||||
}
|
|
||||||
}
|
|
@ -1,17 +0,0 @@
|
|||||||
<?php
|
|
||||||
// Copyright 2004-present Facebook. All Rights Reserved.
|
|
||||||
// This source code is licensed under the BSD-style license found in the
|
|
||||||
// LICENSE file in the root directory of this source tree. An additional grant
|
|
||||||
// of patent rights can be found in the PATENTS file in the same directory.
|
|
||||||
|
|
||||||
class FacebookFbcodeUnitTestEngine extends ArcanistUnitTestEngine {
|
|
||||||
|
|
||||||
public function run() {
|
|
||||||
// For a call to `arc call-conduit differential.updateunitresults` to
|
|
||||||
// succeed we need at least one entry here.
|
|
||||||
$result = new ArcanistUnitTestResult();
|
|
||||||
$result->setName("dummy_placeholder_entry");
|
|
||||||
$result->setResult(ArcanistUnitTestResult::RESULT_PASS);
|
|
||||||
return array($result);
|
|
||||||
}
|
|
||||||
}
|
|
@ -1,17 +0,0 @@
|
|||||||
<?php
|
|
||||||
// Copyright 2004-present Facebook. All Rights Reserved.
|
|
||||||
// This source code is licensed under the BSD-style license found in the
|
|
||||||
// LICENSE file in the root directory of this source tree. An additional grant
|
|
||||||
// of patent rights can be found in the PATENTS file in the same directory.
|
|
||||||
|
|
||||||
class FacebookFbcodeUnitTestEngine extends ArcanistBaseUnitTestEngine {
|
|
||||||
|
|
||||||
public function run() {
|
|
||||||
// For a call to `arc call-conduit differential.updateunitresults` to
|
|
||||||
// succeed we need at least one entry here.
|
|
||||||
$result = new ArcanistUnitTestResult();
|
|
||||||
$result->setName("dummy_placeholder_entry");
|
|
||||||
$result->setResult(ArcanistUnitTestResult::RESULT_PASS);
|
|
||||||
return array($result);
|
|
||||||
}
|
|
||||||
}
|
|
@ -51,12 +51,7 @@ if [ -z "$ROCKSDB_NO_FBCODE" -a -d /mnt/gvfs/third-party ]; then
|
|||||||
FBCODE_BUILD="true"
|
FBCODE_BUILD="true"
|
||||||
# If we're compiling with TSAN we need pic build
|
# If we're compiling with TSAN we need pic build
|
||||||
PIC_BUILD=$COMPILE_WITH_TSAN
|
PIC_BUILD=$COMPILE_WITH_TSAN
|
||||||
if [ -z "$ROCKSDB_FBCODE_BUILD_WITH_481" ]; then
|
|
||||||
source "$PWD/build_tools/fbcode_config.sh"
|
source "$PWD/build_tools/fbcode_config.sh"
|
||||||
else
|
|
||||||
# we need this to build with MySQL. Don't use for other purposes.
|
|
||||||
source "$PWD/build_tools/fbcode_config4.8.1.sh"
|
|
||||||
fi
|
|
||||||
fi
|
fi
|
||||||
|
|
||||||
# Delete existing output, if it exists
|
# Delete existing output, if it exists
|
||||||
|
@ -1,18 +1,19 @@
|
|||||||
GCC_BASE=/mnt/gvfs/third-party2/gcc/cf7d14c625ce30bae1a4661c2319c5a283e4dd22/4.9.x/centos6-native/108cf83
|
# Copyright (c) Facebook, Inc. and its affiliates. All Rights Reserved.
|
||||||
CLANG_BASE=/mnt/gvfs/third-party2/llvm-fb/8598c375b0e94e1448182eb3df034704144a838d/stable/centos6-native/3f16ddd
|
GCC_BASE=/mnt/gvfs/third-party2/gcc/7331085db891a2ef4a88a48a751d834e8d68f4cb/7.x/centos7-native/b2ef2b6
|
||||||
LIBGCC_BASE=/mnt/gvfs/third-party2/libgcc/d6e0a7da6faba45f5e5b1638f9edd7afc2f34e7d/4.9.x/gcc-4.9-glibc-2.20/024dbc3
|
CLANG_BASE=/mnt/gvfs/third-party2/llvm-fb/963d9aeda70cc4779885b1277484fe7544a04e3e/9.0.0/platform007/9e92d53/
|
||||||
GLIBC_BASE=/mnt/gvfs/third-party2/glibc/d282e6e8f3d20f4e40a516834847bdc038e07973/2.20/gcc-4.9-glibc-2.20/500e281
|
LIBGCC_BASE=/mnt/gvfs/third-party2/libgcc/6ace84e956873d53638c738b6f65f3f469cca74c/7.x/platform007/5620abc
|
||||||
SNAPPY_BASE=/mnt/gvfs/third-party2/snappy/8c38a4c1e52b4c2cc8a9cdc31b9c947ed7dbfcb4/1.1.3/gcc-4.9-glibc-2.20/e9936bf
|
GLIBC_BASE=/mnt/gvfs/third-party2/glibc/192b0f42d63dcf6210d6ceae387b49af049e6e0c/2.26/platform007/f259413
|
||||||
ZLIB_BASE=/mnt/gvfs/third-party2/zlib/0882df3713c7a84f15abe368dc004581f20b39d7/1.2.8/gcc-5-glibc-2.23/9bc6787
|
SNAPPY_BASE=/mnt/gvfs/third-party2/snappy/7f9bdaada18f59bc27ec2b0871eb8a6144343aef/1.1.3/platform007/ca4da3d
|
||||||
BZIP2_BASE=/mnt/gvfs/third-party2/bzip2/740325875f6729f42d28deaa2147b0854f3a347e/1.0.6/gcc-5-glibc-2.23/9bc6787
|
ZLIB_BASE=/mnt/gvfs/third-party2/zlib/2d9f0b9a4274cc21f61272a9e89bdb859bce8f1f/1.2.8/platform007/ca4da3d
|
||||||
LZ4_BASE=/mnt/gvfs/third-party2/lz4/0e790b441e2d9acd68d51e1d2e028f88c6a79ddf/r131/gcc-5-glibc-2.23/9bc6787
|
BZIP2_BASE=/mnt/gvfs/third-party2/bzip2/dc49a21c5fceec6456a7a28a94dcd16690af1337/1.0.6/platform007/ca4da3d
|
||||||
ZSTD_BASE=/mnt/gvfs/third-party2/zstd/9455f75ff7f4831dc9fda02a6a0f8c68922fad8f/1.0.0/gcc-5-glibc-2.23/9bc6787
|
LZ4_BASE=/mnt/gvfs/third-party2/lz4/0f607f8fc442ea7d6b876931b1898bb573d5e5da/1.9.1/platform007/ca4da3d
|
||||||
GFLAGS_BASE=/mnt/gvfs/third-party2/gflags/f001a51b2854957676d07306ef3abf67186b5c8b/2.1.1/gcc-4.8.1-glibc-2.17/c3f970a
|
ZSTD_BASE=/mnt/gvfs/third-party2/zstd/ca22bc441a4eb709e9e0b1f9fec9750fed7b31c5/1.4.x/platform007/15a3614
|
||||||
JEMALLOC_BASE=/mnt/gvfs/third-party2/jemalloc/fc8a13ca1fffa4d0765c716c5a0b49f0c107518f/master/gcc-5-glibc-2.23/1c32b4b
|
GFLAGS_BASE=/mnt/gvfs/third-party2/gflags/0b9929d2588991c65a57168bf88aff2db87c5d48/2.2.0/platform007/ca4da3d
|
||||||
NUMA_BASE=/mnt/gvfs/third-party2/numa/17c514c4d102a25ca15f4558be564eeed76f4b6a/2.0.8/gcc-5-glibc-2.23/9bc6787
|
JEMALLOC_BASE=/mnt/gvfs/third-party2/jemalloc/c26f08f47ac35fc31da2633b7da92d6b863246eb/master/platform007/c26c002
|
||||||
LIBUNWIND_BASE=/mnt/gvfs/third-party2/libunwind/ad576de2a1ea560c4d3434304f0fc4e079bede42/trunk/gcc-5-glibc-2.23/b1847cb
|
NUMA_BASE=/mnt/gvfs/third-party2/numa/3f3fb57a5ccc5fd21c66416c0b83e0aa76a05376/2.0.11/platform007/ca4da3d
|
||||||
TBB_BASE=/mnt/gvfs/third-party2/tbb/9d9a554877d0c5bef330fe818ab7178806dd316a/4.0_update2/gcc-4.9-glibc-2.20/e9936bf
|
LIBUNWIND_BASE=/mnt/gvfs/third-party2/libunwind/40c73d874898b386a71847f1b99115d93822d11f/1.4/platform007/6f3e0a9
|
||||||
KERNEL_HEADERS_BASE=/mnt/gvfs/third-party2/kernel-headers/7c111ff27e0c466235163f00f280a9d617c3d2ec/4.0.9-36_fbk5_2933_gd092e3f/gcc-5-glibc-2.23/da39a3e
|
TBB_BASE=/mnt/gvfs/third-party2/tbb/4ce8e8dba77cdbd81b75d6f0c32fd7a1b76a11ec/2018_U5/platform007/ca4da3d
|
||||||
BINUTILS_BASE=/mnt/gvfs/third-party2/binutils/b7fd454c4b10c6a81015d4524ed06cdeab558490/2.26/centos6-native/da39a3e
|
KERNEL_HEADERS_BASE=/mnt/gvfs/third-party2/kernel-headers/fb251ecd2f5ae16f8671f7014c246e52a748fe0b/fb/platform007/da39a3e
|
||||||
VALGRIND_BASE=/mnt/gvfs/third-party2/valgrind/d7f4d4d86674a57668e3a96f76f0e17dd0eb8765/3.10.0/gcc-4.9-glibc-2.20/e9936bf
|
BINUTILS_BASE=/mnt/gvfs/third-party2/binutils/ab9f09bba370e7066cafd4eb59752db93f2e8312/2.29.1/platform007/15a3614
|
||||||
LUA_BASE=/mnt/gvfs/third-party2/lua/61e4abf5813bbc39bc4f548757ccfcadde175a48/5.2.3/gcc-4.9-glibc-2.20/690f0d7
|
VALGRIND_BASE=/mnt/gvfs/third-party2/valgrind/d42d152a15636529b0861ec493927200ebebca8e/3.15.0/platform007/ca4da3d
|
||||||
|
LUA_BASE=/mnt/gvfs/third-party2/lua/f0cd714433206d5139df61659eb7b28b1dea6683/5.3.4/platform007/5007832
|
||||||
|
@ -1,7 +1,7 @@
|
|||||||
# Copyright (c) 2016-present, Facebook, Inc. All rights reserved.
|
# Copyright (c) 2011-present, Facebook, Inc. All rights reserved.
|
||||||
# This source code is licensed under the BSD-style license found in the
|
# This source code is licensed under both the GPLv2 (found in the
|
||||||
# LICENSE file in the root directory of this source tree. An additional grant
|
# COPYING file in the root directory) and Apache 2.0 License
|
||||||
# of patent rights can be found in the PATENTS file in the same directory.
|
# (found in the LICENSE.Apache file in the root directory).
|
||||||
|
|
||||||
'''Filter for error messages in test output:
|
'''Filter for error messages in test output:
|
||||||
- Receives merged stdout/stderr from test on stdin
|
- Receives merged stdout/stderr from test on stdin
|
||||||
|
@ -13,7 +13,7 @@ source "$BASEDIR/dependencies.sh"
|
|||||||
CFLAGS=""
|
CFLAGS=""
|
||||||
|
|
||||||
# libgcc
|
# libgcc
|
||||||
LIBGCC_INCLUDE="$LIBGCC_BASE/include"
|
LIBGCC_INCLUDE="$LIBGCC_BASE/include/c++/7.3.0"
|
||||||
LIBGCC_LIBS=" -L $LIBGCC_BASE/lib"
|
LIBGCC_LIBS=" -L $LIBGCC_BASE/lib"
|
||||||
|
|
||||||
# glibc
|
# glibc
|
||||||
@ -43,12 +43,16 @@ if test -z $PIC_BUILD; then
|
|||||||
LZ4_INCLUDE=" -I $LZ4_BASE/include/"
|
LZ4_INCLUDE=" -I $LZ4_BASE/include/"
|
||||||
LZ4_LIBS=" $LZ4_BASE/lib/liblz4.a"
|
LZ4_LIBS=" $LZ4_BASE/lib/liblz4.a"
|
||||||
CFLAGS+=" -DLZ4"
|
CFLAGS+=" -DLZ4"
|
||||||
|
|
||||||
ZSTD_INCLUDE=" -I $ZSTD_BASE/include/"
|
|
||||||
ZSTD_LIBS=" $ZSTD_BASE/lib/libzstd.a"
|
|
||||||
CFLAGS+=" -DZSTD"
|
|
||||||
fi
|
fi
|
||||||
|
|
||||||
|
ZSTD_INCLUDE=" -I $ZSTD_BASE/include/"
|
||||||
|
if test -z $PIC_BUILD; then
|
||||||
|
ZSTD_LIBS=" $ZSTD_BASE/lib/libzstd.a"
|
||||||
|
else
|
||||||
|
ZSTD_LIBS=" $ZSTD_BASE/lib/libzstd_pic.a"
|
||||||
|
fi
|
||||||
|
CFLAGS+=" -DZSTD"
|
||||||
|
|
||||||
# location of gflags headers and libraries
|
# location of gflags headers and libraries
|
||||||
GFLAGS_INCLUDE=" -I $GFLAGS_BASE/include/"
|
GFLAGS_INCLUDE=" -I $GFLAGS_BASE/include/"
|
||||||
if test -z $PIC_BUILD; then
|
if test -z $PIC_BUILD; then
|
||||||
@ -56,7 +60,7 @@ if test -z $PIC_BUILD; then
|
|||||||
else
|
else
|
||||||
GFLAGS_LIBS=" $GFLAGS_BASE/lib/libgflags_pic.a"
|
GFLAGS_LIBS=" $GFLAGS_BASE/lib/libgflags_pic.a"
|
||||||
fi
|
fi
|
||||||
CFLAGS+=" -DGFLAGS=google"
|
CFLAGS+=" -DGFLAGS=gflags"
|
||||||
|
|
||||||
# location of jemalloc
|
# location of jemalloc
|
||||||
JEMALLOC_INCLUDE=" -I $JEMALLOC_BASE/include/"
|
JEMALLOC_INCLUDE=" -I $JEMALLOC_BASE/include/"
|
||||||
@ -104,8 +108,8 @@ if [ -z "$USE_CLANG" ]; then
|
|||||||
CXX="$GCC_BASE/bin/g++"
|
CXX="$GCC_BASE/bin/g++"
|
||||||
|
|
||||||
CFLAGS+=" -B$BINUTILS/gold"
|
CFLAGS+=" -B$BINUTILS/gold"
|
||||||
CFLAGS+=" -isystem $GLIBC_INCLUDE"
|
|
||||||
CFLAGS+=" -isystem $LIBGCC_INCLUDE"
|
CFLAGS+=" -isystem $LIBGCC_INCLUDE"
|
||||||
|
CFLAGS+=" -isystem $GLIBC_INCLUDE"
|
||||||
JEMALLOC=1
|
JEMALLOC=1
|
||||||
else
|
else
|
||||||
# clang
|
# clang
|
||||||
@ -116,8 +120,8 @@ else
|
|||||||
KERNEL_HEADERS_INCLUDE="$KERNEL_HEADERS_BASE/include"
|
KERNEL_HEADERS_INCLUDE="$KERNEL_HEADERS_BASE/include"
|
||||||
|
|
||||||
CFLAGS+=" -B$BINUTILS/gold -nostdinc -nostdlib"
|
CFLAGS+=" -B$BINUTILS/gold -nostdinc -nostdlib"
|
||||||
CFLAGS+=" -isystem $LIBGCC_BASE/include/c++/4.9.x "
|
CFLAGS+=" -isystem $LIBGCC_BASE/include/c++/7.x "
|
||||||
CFLAGS+=" -isystem $LIBGCC_BASE/include/c++/4.9.x/x86_64-facebook-linux "
|
CFLAGS+=" -isystem $LIBGCC_BASE/include/c++/7.x/x86_64-facebook-linux "
|
||||||
CFLAGS+=" -isystem $GLIBC_INCLUDE"
|
CFLAGS+=" -isystem $GLIBC_INCLUDE"
|
||||||
CFLAGS+=" -isystem $LIBGCC_INCLUDE"
|
CFLAGS+=" -isystem $LIBGCC_INCLUDE"
|
||||||
CFLAGS+=" -isystem $CLANG_INCLUDE"
|
CFLAGS+=" -isystem $CLANG_INCLUDE"
|
||||||
@ -128,13 +132,14 @@ else
|
|||||||
fi
|
fi
|
||||||
|
|
||||||
CFLAGS+=" $DEPS_INCLUDE"
|
CFLAGS+=" $DEPS_INCLUDE"
|
||||||
CFLAGS+=" -DROCKSDB_PLATFORM_POSIX -DROCKSDB_LIB_IO_POSIX -DROCKSDB_FALLOCATE_PRESENT -DROCKSDB_MALLOC_USABLE_SIZE"
|
CFLAGS+=" -DROCKSDB_PLATFORM_POSIX -DROCKSDB_LIB_IO_POSIX -DROCKSDB_FALLOCATE_PRESENT -DROCKSDB_MALLOC_USABLE_SIZE -DROCKSDB_RANGESYNC_PRESENT -DROCKSDB_SCHED_GETCPU_PRESENT -DROCKSDB_SUPPORT_THREAD_LOCAL -DHAVE_SSE42"
|
||||||
CXXFLAGS+=" $CFLAGS"
|
CXXFLAGS+=" $CFLAGS"
|
||||||
|
|
||||||
EXEC_LDFLAGS=" $SNAPPY_LIBS $ZLIB_LIBS $BZIP_LIBS $LZ4_LIBS $ZSTD_LIBS $GFLAGS_LIBS $NUMA_LIB $TBB_LIBS"
|
EXEC_LDFLAGS=" $SNAPPY_LIBS $ZLIB_LIBS $BZIP_LIBS $LZ4_LIBS $ZSTD_LIBS $GFLAGS_LIBS $NUMA_LIB $TBB_LIBS"
|
||||||
EXEC_LDFLAGS+=" -Wl,--dynamic-linker,/usr/local/fbcode/gcc-4.9-glibc-2.20/lib/ld.so"
|
EXEC_LDFLAGS+=" -B$BINUTILS/gold"
|
||||||
|
EXEC_LDFLAGS+=" -Wl,--dynamic-linker,/usr/local/fbcode/platform007/lib/ld.so"
|
||||||
EXEC_LDFLAGS+=" $LIBUNWIND"
|
EXEC_LDFLAGS+=" $LIBUNWIND"
|
||||||
EXEC_LDFLAGS+=" -Wl,-rpath=/usr/local/fbcode/gcc-4.9-glibc-2.20/lib"
|
EXEC_LDFLAGS+=" -Wl,-rpath=/usr/local/fbcode/platform007/lib"
|
||||||
# required by libtbb
|
# required by libtbb
|
||||||
EXEC_LDFLAGS+=" -ldl"
|
EXEC_LDFLAGS+=" -ldl"
|
||||||
|
|
||||||
@ -144,12 +149,4 @@ EXEC_LDFLAGS_SHARED="$SNAPPY_LIBS $ZLIB_LIBS $BZIP_LIBS $LZ4_LIBS $ZSTD_LIBS $GF
|
|||||||
|
|
||||||
VALGRIND_VER="$VALGRIND_BASE/bin/"
|
VALGRIND_VER="$VALGRIND_BASE/bin/"
|
||||||
|
|
||||||
LUA_PATH="$LUA_BASE"
|
export CC CXX AR CFLAGS CXXFLAGS EXEC_LDFLAGS EXEC_LDFLAGS_SHARED VALGRIND_VER JEMALLOC_LIB JEMALLOC_INCLUDE CLANG_ANALYZER CLANG_SCAN_BUILD
|
||||||
|
|
||||||
if test -z $PIC_BUILD; then
|
|
||||||
LUA_LIB=" $LUA_PATH/lib/liblua.a"
|
|
||||||
else
|
|
||||||
LUA_LIB=" $LUA_PATH/lib/liblua_pic.a"
|
|
||||||
fi
|
|
||||||
|
|
||||||
export CC CXX AR CFLAGS CXXFLAGS EXEC_LDFLAGS EXEC_LDFLAGS_SHARED VALGRIND_VER JEMALLOC_LIB JEMALLOC_INCLUDE CLANG_ANALYZER CLANG_SCAN_BUILD LUA_PATH LUA_LIB
|
|
||||||
|
@ -1,46 +0,0 @@
|
|||||||
#!/bin/bash
|
|
||||||
# Copyright (c) 2011-present, Facebook, Inc. All rights reserved.
|
|
||||||
# This source code is licensed under the BSD-style license found in the
|
|
||||||
# LICENSE file in the root directory of this source tree. An additional grant
|
|
||||||
# of patent rights can be found in the PATENTS file in the same directory.
|
|
||||||
|
|
||||||
set -e
|
|
||||||
if [ -z "$GIT" ]
|
|
||||||
then
|
|
||||||
GIT="git"
|
|
||||||
fi
|
|
||||||
|
|
||||||
# Print out the colored progress info so that it can be brainlessly
|
|
||||||
# distinguished by users.
|
|
||||||
function title() {
|
|
||||||
echo -e "\033[1;32m$*\033[0m"
|
|
||||||
}
|
|
||||||
|
|
||||||
usage="Create new RocksDB version and prepare it for the release process\n"
|
|
||||||
usage+="USAGE: ./make_new_version.sh <version>"
|
|
||||||
|
|
||||||
# -- Pre-check
|
|
||||||
if [[ $# < 1 ]]; then
|
|
||||||
echo -e $usage
|
|
||||||
exit 1
|
|
||||||
fi
|
|
||||||
|
|
||||||
ROCKSDB_VERSION=$1
|
|
||||||
|
|
||||||
GIT_BRANCH=`git rev-parse --abbrev-ref HEAD`
|
|
||||||
echo $GIT_BRANCH
|
|
||||||
|
|
||||||
if [ $GIT_BRANCH != "master" ]; then
|
|
||||||
echo "Error: Current branch is '$GIT_BRANCH', Please switch to master branch."
|
|
||||||
exit 1
|
|
||||||
fi
|
|
||||||
|
|
||||||
title "Adding new tag for this release ..."
|
|
||||||
BRANCH="$ROCKSDB_VERSION.fb"
|
|
||||||
$GIT checkout -b $BRANCH
|
|
||||||
|
|
||||||
# Setting up the proxy for remote repo access
|
|
||||||
title "Pushing new branch to remote repo ..."
|
|
||||||
git push origin --set-upstream $BRANCH
|
|
||||||
|
|
||||||
title "Branch $BRANCH is pushed to github;"
|
|
6
cache/cache_bench.cc
vendored
6
cache/cache_bench.cc
vendored
@ -1,7 +1,7 @@
|
|||||||
// Copyright (c) 2011-present, Facebook, Inc. All rights reserved.
|
// Copyright (c) 2011-present, Facebook, Inc. All rights reserved.
|
||||||
// This source code is licensed under the BSD-style license found in the
|
// This source code is licensed under both the GPLv2 (found in the
|
||||||
// LICENSE file in the root directory of this source tree. An additional grant
|
// COPYING file in the root directory) and Apache 2.0 License
|
||||||
// of patent rights can be found in the PATENTS file in the same directory.
|
// (found in the LICENSE.Apache file in the root directory).
|
||||||
|
|
||||||
#ifndef __STDC_FORMAT_MACROS
|
#ifndef __STDC_FORMAT_MACROS
|
||||||
#define __STDC_FORMAT_MACROS
|
#define __STDC_FORMAT_MACROS
|
||||||
|
6
cache/cache_test.cc
vendored
6
cache/cache_test.cc
vendored
@ -1,7 +1,7 @@
|
|||||||
// Copyright (c) 2011-present, Facebook, Inc. All rights reserved.
|
// Copyright (c) 2011-present, Facebook, Inc. All rights reserved.
|
||||||
// This source code is licensed under the BSD-style license found in the
|
// This source code is licensed under both the GPLv2 (found in the
|
||||||
// LICENSE file in the root directory of this source tree. An additional grant
|
// COPYING file in the root directory) and Apache 2.0 License
|
||||||
// of patent rights can be found in the PATENTS file in the same directory.
|
// (found in the LICENSE.Apache file in the root directory).
|
||||||
//
|
//
|
||||||
// Copyright (c) 2011 The LevelDB Authors. All rights reserved.
|
// Copyright (c) 2011 The LevelDB Authors. All rights reserved.
|
||||||
// Use of this source code is governed by a BSD-style license that can be
|
// Use of this source code is governed by a BSD-style license that can be
|
||||||
|
6
cache/clock_cache.cc
vendored
6
cache/clock_cache.cc
vendored
@ -1,7 +1,7 @@
|
|||||||
// Copyright (c) 2011-present, Facebook, Inc. All rights reserved.
|
// Copyright (c) 2011-present, Facebook, Inc. All rights reserved.
|
||||||
// This source code is licensed under the BSD-style license found in the
|
// This source code is licensed under both the GPLv2 (found in the
|
||||||
// LICENSE file in the root directory of this source tree. An additional grant
|
// COPYING file in the root directory) and Apache 2.0 License
|
||||||
// of patent rights can be found in the PATENTS file in the same directory.
|
// (found in the LICENSE.Apache file in the root directory).
|
||||||
//
|
//
|
||||||
// Copyright (c) 2011 The LevelDB Authors. All rights reserved.
|
// Copyright (c) 2011 The LevelDB Authors. All rights reserved.
|
||||||
// Use of this source code is governed by a BSD-style license that can be
|
// Use of this source code is governed by a BSD-style license that can be
|
||||||
|
6
cache/clock_cache.h
vendored
6
cache/clock_cache.h
vendored
@ -1,7 +1,7 @@
|
|||||||
// Copyright (c) 2011-present, Facebook, Inc. All rights reserved.
|
// Copyright (c) 2011-present, Facebook, Inc. All rights reserved.
|
||||||
// This source code is licensed under the BSD-style license found in the
|
// This source code is licensed under both the GPLv2 (found in the
|
||||||
// LICENSE file in the root directory of this source tree. An additional grant
|
// COPYING file in the root directory) and Apache 2.0 License
|
||||||
// of patent rights can be found in the PATENTS file in the same directory.
|
// (found in the LICENSE.Apache file in the root directory).
|
||||||
//
|
//
|
||||||
// Copyright (c) 2011 The LevelDB Authors. All rights reserved.
|
// Copyright (c) 2011 The LevelDB Authors. All rights reserved.
|
||||||
// Use of this source code is governed by a BSD-style license that can be
|
// Use of this source code is governed by a BSD-style license that can be
|
||||||
|
6
cache/lru_cache.cc
vendored
6
cache/lru_cache.cc
vendored
@ -1,7 +1,7 @@
|
|||||||
// Copyright (c) 2011-present, Facebook, Inc. All rights reserved.
|
// Copyright (c) 2011-present, Facebook, Inc. All rights reserved.
|
||||||
// This source code is licensed under the BSD-style license found in the
|
// This source code is licensed under both the GPLv2 (found in the
|
||||||
// LICENSE file in the root directory of this source tree. An additional grant
|
// COPYING file in the root directory) and Apache 2.0 License
|
||||||
// of patent rights can be found in the PATENTS file in the same directory.
|
// (found in the LICENSE.Apache file in the root directory).
|
||||||
//
|
//
|
||||||
// Copyright (c) 2011 The LevelDB Authors. All rights reserved.
|
// Copyright (c) 2011 The LevelDB Authors. All rights reserved.
|
||||||
// Use of this source code is governed by a BSD-style license that can be
|
// Use of this source code is governed by a BSD-style license that can be
|
||||||
|
6
cache/lru_cache.h
vendored
6
cache/lru_cache.h
vendored
@ -1,7 +1,7 @@
|
|||||||
// Copyright (c) 2011-present, Facebook, Inc. All rights reserved.
|
// Copyright (c) 2011-present, Facebook, Inc. All rights reserved.
|
||||||
// This source code is licensed under the BSD-style license found in the
|
// This source code is licensed under both the GPLv2 (found in the
|
||||||
// LICENSE file in the root directory of this source tree. An additional grant
|
// COPYING file in the root directory) and Apache 2.0 License
|
||||||
// of patent rights can be found in the PATENTS file in the same directory.
|
// (found in the LICENSE.Apache file in the root directory).
|
||||||
//
|
//
|
||||||
// Copyright (c) 2011 The LevelDB Authors. All rights reserved.
|
// Copyright (c) 2011 The LevelDB Authors. All rights reserved.
|
||||||
// Use of this source code is governed by a BSD-style license that can be
|
// Use of this source code is governed by a BSD-style license that can be
|
||||||
|
6
cache/lru_cache_test.cc
vendored
6
cache/lru_cache_test.cc
vendored
@ -1,7 +1,7 @@
|
|||||||
// Copyright (c) 2011-present, Facebook, Inc. All rights reserved.
|
// Copyright (c) 2011-present, Facebook, Inc. All rights reserved.
|
||||||
// This source code is licensed under the BSD-style license found in the
|
// This source code is licensed under both the GPLv2 (found in the
|
||||||
// LICENSE file in the root directory of this source tree. An additional grant
|
// COPYING file in the root directory) and Apache 2.0 License
|
||||||
// of patent rights can be found in the PATENTS file in the same directory.
|
// (found in the LICENSE.Apache file in the root directory).
|
||||||
|
|
||||||
#include "cache/lru_cache.h"
|
#include "cache/lru_cache.h"
|
||||||
|
|
||||||
|
6
cache/sharded_cache.cc
vendored
6
cache/sharded_cache.cc
vendored
@ -1,7 +1,7 @@
|
|||||||
// Copyright (c) 2011-present, Facebook, Inc. All rights reserved.
|
// Copyright (c) 2011-present, Facebook, Inc. All rights reserved.
|
||||||
// This source code is licensed under the BSD-style license found in the
|
// This source code is licensed under both the GPLv2 (found in the
|
||||||
// LICENSE file in the root directory of this source tree. An additional grant
|
// COPYING file in the root directory) and Apache 2.0 License
|
||||||
// of patent rights can be found in the PATENTS file in the same directory.
|
// (found in the LICENSE.Apache file in the root directory).
|
||||||
//
|
//
|
||||||
// Copyright (c) 2011 The LevelDB Authors. All rights reserved.
|
// Copyright (c) 2011 The LevelDB Authors. All rights reserved.
|
||||||
// Use of this source code is governed by a BSD-style license that can be
|
// Use of this source code is governed by a BSD-style license that can be
|
||||||
|
6
cache/sharded_cache.h
vendored
6
cache/sharded_cache.h
vendored
@ -1,7 +1,7 @@
|
|||||||
// Copyright (c) 2011-present, Facebook, Inc. All rights reserved.
|
// Copyright (c) 2011-present, Facebook, Inc. All rights reserved.
|
||||||
// This source code is licensed under the BSD-style license found in the
|
// This source code is licensed under both the GPLv2 (found in the
|
||||||
// LICENSE file in the root directory of this source tree. An additional grant
|
// COPYING file in the root directory) and Apache 2.0 License
|
||||||
// of patent rights can be found in the PATENTS file in the same directory.
|
// (found in the LICENSE.Apache file in the root directory).
|
||||||
//
|
//
|
||||||
// Copyright (c) 2011 The LevelDB Authors. All rights reserved.
|
// Copyright (c) 2011 The LevelDB Authors. All rights reserved.
|
||||||
// Use of this source code is governed by a BSD-style license that can be
|
// Use of this source code is governed by a BSD-style license that can be
|
||||||
|
@ -1,7 +1,7 @@
|
|||||||
// Copyright (c) 2011-present, Facebook, Inc. All rights reserved.
|
// Copyright (c) 2011-present, Facebook, Inc. All rights reserved.
|
||||||
// This source code is licensed under the BSD-style license found in the
|
// This source code is licensed under both the GPLv2 (found in the
|
||||||
// LICENSE file in the root directory of this source tree. An additional grant
|
// COPYING file in the root directory) and Apache 2.0 License
|
||||||
// of patent rights can be found in the PATENTS file in the same directory.
|
// (found in the LICENSE.Apache file in the root directory).
|
||||||
//
|
//
|
||||||
// Copyright (c) 2011 The LevelDB Authors. All rights reserved.
|
// Copyright (c) 2011 The LevelDB Authors. All rights reserved.
|
||||||
// Use of this source code is governed by a BSD-style license that can be
|
// Use of this source code is governed by a BSD-style license that can be
|
||||||
@ -32,6 +32,7 @@
|
|||||||
#include "util/file_reader_writer.h"
|
#include "util/file_reader_writer.h"
|
||||||
#include "util/filename.h"
|
#include "util/filename.h"
|
||||||
#include "util/stop_watch.h"
|
#include "util/stop_watch.h"
|
||||||
|
#include "util/sync_point.h"
|
||||||
|
|
||||||
namespace rocksdb {
|
namespace rocksdb {
|
||||||
|
|
||||||
@ -103,6 +104,10 @@ Status BuildTable(
|
|||||||
unique_ptr<WritableFileWriter> file_writer;
|
unique_ptr<WritableFileWriter> file_writer;
|
||||||
{
|
{
|
||||||
unique_ptr<WritableFile> file;
|
unique_ptr<WritableFile> file;
|
||||||
|
#ifndef NDEBUG
|
||||||
|
bool use_direct_writes = env_options.use_direct_writes;
|
||||||
|
TEST_SYNC_POINT_CALLBACK("BuildTable:create_file", &use_direct_writes);
|
||||||
|
#endif // !NDEBUG
|
||||||
s = NewWritableFile(env, fname, &file, env_options);
|
s = NewWritableFile(env, fname, &file, env_options);
|
||||||
if (!s.ok()) {
|
if (!s.ok()) {
|
||||||
EventHelpers::LogAndNotifyTableFileCreationFinished(
|
EventHelpers::LogAndNotifyTableFileCreationFinished(
|
||||||
@ -172,7 +177,7 @@ Status BuildTable(
|
|||||||
// Finish and check for file errors
|
// Finish and check for file errors
|
||||||
if (s.ok() && !empty) {
|
if (s.ok() && !empty) {
|
||||||
StopWatch sw(env, ioptions.statistics, TABLE_SYNC_MICROS);
|
StopWatch sw(env, ioptions.statistics, TABLE_SYNC_MICROS);
|
||||||
file_writer->Sync(ioptions.use_fsync);
|
s = file_writer->Sync(ioptions.use_fsync);
|
||||||
}
|
}
|
||||||
if (s.ok() && !empty) {
|
if (s.ok() && !empty) {
|
||||||
s = file_writer->Close();
|
s = file_writer->Close();
|
||||||
@ -180,6 +185,11 @@ Status BuildTable(
|
|||||||
|
|
||||||
if (s.ok() && !empty) {
|
if (s.ok() && !empty) {
|
||||||
// Verify that the table is usable
|
// Verify that the table is usable
|
||||||
|
// We set for_compaction to false and don't OptimizeForCompactionTableRead
|
||||||
|
// here because this is a special case after we finish the table building
|
||||||
|
// No matter whether use_direct_io_for_flush_and_compaction is true,
|
||||||
|
// we will regrad this verification as user reads since the goal is
|
||||||
|
// to cache it here for further user reads
|
||||||
std::unique_ptr<InternalIterator> it(table_cache->NewIterator(
|
std::unique_ptr<InternalIterator> it(table_cache->NewIterator(
|
||||||
ReadOptions(), env_options, internal_comparator, meta->fd,
|
ReadOptions(), env_options, internal_comparator, meta->fd,
|
||||||
nullptr /* range_del_agg */, nullptr,
|
nullptr /* range_del_agg */, nullptr,
|
||||||
|
@ -1,7 +1,7 @@
|
|||||||
// Copyright (c) 2011-present, Facebook, Inc. All rights reserved.
|
// Copyright (c) 2011-present, Facebook, Inc. All rights reserved.
|
||||||
// This source code is licensed under the BSD-style license found in the
|
// This source code is licensed under both the GPLv2 (found in the
|
||||||
// LICENSE file in the root directory of this source tree. An additional grant
|
// COPYING file in the root directory) and Apache 2.0 License
|
||||||
// of patent rights can be found in the PATENTS file in the same directory.
|
// (found in the LICENSE.Apache file in the root directory).
|
||||||
// Copyright (c) 2011 The LevelDB Authors. All rights reserved.
|
// Copyright (c) 2011 The LevelDB Authors. All rights reserved.
|
||||||
// Use of this source code is governed by a BSD-style license that can be
|
// Use of this source code is governed by a BSD-style license that can be
|
||||||
// found in the LICENSE file. See the AUTHORS file for names of contributors.
|
// found in the LICENSE file. See the AUTHORS file for names of contributors.
|
||||||
|
12
db/c.cc
12
db/c.cc
@ -1,7 +1,7 @@
|
|||||||
// Copyright (c) 2011-present, Facebook, Inc. All rights reserved.
|
// Copyright (c) 2011-present, Facebook, Inc. All rights reserved.
|
||||||
// This source code is licensed under the BSD-style license found in the
|
// This source code is licensed under both the GPLv2 (found in the
|
||||||
// LICENSE file in the root directory of this source tree. An additional grant
|
// COPYING file in the root directory) and Apache 2.0 License
|
||||||
// of patent rights can be found in the PATENTS file in the same directory.
|
// (found in the LICENSE.Apache file in the root directory).
|
||||||
//
|
//
|
||||||
// Copyright (c) 2011 The LevelDB Authors. All rights reserved.
|
// Copyright (c) 2011 The LevelDB Authors. All rights reserved.
|
||||||
// Use of this source code is governed by a BSD-style license that can be
|
// Use of this source code is governed by a BSD-style license that can be
|
||||||
@ -2121,9 +2121,9 @@ void rocksdb_options_set_use_direct_reads(rocksdb_options_t* opt,
|
|||||||
opt->rep.use_direct_reads = v;
|
opt->rep.use_direct_reads = v;
|
||||||
}
|
}
|
||||||
|
|
||||||
void rocksdb_options_set_use_direct_writes(rocksdb_options_t* opt,
|
void rocksdb_options_set_use_direct_io_for_flush_and_compaction(
|
||||||
unsigned char v) {
|
rocksdb_options_t* opt, unsigned char v) {
|
||||||
opt->rep.use_direct_writes = v;
|
opt->rep.use_direct_io_for_flush_and_compaction = v;
|
||||||
}
|
}
|
||||||
|
|
||||||
void rocksdb_options_set_allow_mmap_reads(
|
void rocksdb_options_set_allow_mmap_reads(
|
||||||
|
@ -1,7 +1,7 @@
|
|||||||
// Copyright (c) 2011-present, Facebook, Inc. All rights reserved.
|
// Copyright (c) 2011-present, Facebook, Inc. All rights reserved.
|
||||||
// This source code is licensed under the BSD-style license found in the
|
// This source code is licensed under both the GPLv2 (found in the
|
||||||
// LICENSE file in the root directory of this source tree. An additional grant
|
// COPYING file in the root directory) and Apache 2.0 License
|
||||||
// of patent rights can be found in the PATENTS file in the same directory.
|
// (found in the LICENSE.Apache file in the root directory).
|
||||||
//
|
//
|
||||||
// Copyright (c) 2011 The LevelDB Authors. All rights reserved.
|
// Copyright (c) 2011 The LevelDB Authors. All rights reserved.
|
||||||
// Use of this source code is governed by a BSD-style license that can be
|
// Use of this source code is governed by a BSD-style license that can be
|
||||||
|
@ -1,7 +1,7 @@
|
|||||||
// Copyright (c) 2011-present, Facebook, Inc. All rights reserved.
|
// Copyright (c) 2011-present, Facebook, Inc. All rights reserved.
|
||||||
// This source code is licensed under the BSD-style license found in the
|
// This source code is licensed under both the GPLv2 (found in the
|
||||||
// LICENSE file in the root directory of this source tree. An additional grant
|
// COPYING file in the root directory) and Apache 2.0 License
|
||||||
// of patent rights can be found in the PATENTS file in the same directory.
|
// (found in the LICENSE.Apache file in the root directory).
|
||||||
//
|
//
|
||||||
// Copyright (c) 2011 The LevelDB Authors. All rights reserved.
|
// Copyright (c) 2011 The LevelDB Authors. All rights reserved.
|
||||||
// Use of this source code is governed by a BSD-style license that can be
|
// Use of this source code is governed by a BSD-style license that can be
|
||||||
|
@ -1,8 +1,7 @@
|
|||||||
// Copyright (c) 2011-present, Facebook, Inc. All rights reserved.
|
// Copyright (c) 2011-present, Facebook, Inc. All rights reserved.
|
||||||
// This source code is licensed under the BSD-style license found in
|
// This source code is licensed under both the GPLv2 (found in the
|
||||||
// the LICENSE file in the root directory of this source tree. An
|
// COPYING file in the root directory) and Apache 2.0 License
|
||||||
// additional grant of patent rights can be found in the PATENTS file
|
// (found in the LICENSE.Apache file in the root directory).
|
||||||
// in the same directory.
|
|
||||||
//
|
//
|
||||||
// Copyright (c) 2011 The LevelDB Authors. All rights reserved.
|
// Copyright (c) 2011 The LevelDB Authors. All rights reserved.
|
||||||
// Use of this source code is governed by a BSD-style license that can be
|
// Use of this source code is governed by a BSD-style license that can be
|
||||||
@ -676,6 +675,44 @@ TEST_F(ColumnFamilyTest, AddDrop) {
|
|||||||
std::vector<std::string>({"default", "four", "three"}));
|
std::vector<std::string>({"default", "four", "three"}));
|
||||||
}
|
}
|
||||||
|
|
||||||
|
TEST_F(ColumnFamilyTest, BulkAddDrop) {
|
||||||
|
constexpr int kNumCF = 1000;
|
||||||
|
ColumnFamilyOptions cf_options;
|
||||||
|
WriteOptions write_options;
|
||||||
|
Open();
|
||||||
|
std::vector<std::string> cf_names;
|
||||||
|
std::vector<ColumnFamilyHandle*> cf_handles;
|
||||||
|
for (int i = 1; i <= kNumCF; i++) {
|
||||||
|
cf_names.push_back("cf1-" + ToString(i));
|
||||||
|
}
|
||||||
|
ASSERT_OK(db_->CreateColumnFamilies(cf_options, cf_names, &cf_handles));
|
||||||
|
for (int i = 1; i <= kNumCF; i++) {
|
||||||
|
ASSERT_OK(db_->Put(write_options, cf_handles[i - 1], "foo", "bar"));
|
||||||
|
}
|
||||||
|
ASSERT_OK(db_->DropColumnFamilies(cf_handles));
|
||||||
|
std::vector<ColumnFamilyDescriptor> cf_descriptors;
|
||||||
|
for (auto* handle : cf_handles) {
|
||||||
|
delete handle;
|
||||||
|
}
|
||||||
|
cf_handles.clear();
|
||||||
|
for (int i = 1; i <= kNumCF; i++) {
|
||||||
|
cf_descriptors.emplace_back("cf2-" + ToString(i), ColumnFamilyOptions());
|
||||||
|
}
|
||||||
|
ASSERT_OK(db_->CreateColumnFamilies(cf_descriptors, &cf_handles));
|
||||||
|
for (int i = 1; i <= kNumCF; i++) {
|
||||||
|
ASSERT_OK(db_->Put(write_options, cf_handles[i - 1], "foo", "bar"));
|
||||||
|
}
|
||||||
|
ASSERT_OK(db_->DropColumnFamilies(cf_handles));
|
||||||
|
for (auto* handle : cf_handles) {
|
||||||
|
delete handle;
|
||||||
|
}
|
||||||
|
Close();
|
||||||
|
std::vector<std::string> families;
|
||||||
|
ASSERT_OK(DB::ListColumnFamilies(db_options_, dbname_, &families));
|
||||||
|
std::sort(families.begin(), families.end());
|
||||||
|
ASSERT_TRUE(families == std::vector<std::string>({"default"}));
|
||||||
|
}
|
||||||
|
|
||||||
TEST_F(ColumnFamilyTest, DropTest) {
|
TEST_F(ColumnFamilyTest, DropTest) {
|
||||||
// first iteration - dont reopen DB before dropping
|
// first iteration - dont reopen DB before dropping
|
||||||
// second iteration - reopen DB before dropping
|
// second iteration - reopen DB before dropping
|
||||||
|
@ -1,7 +1,7 @@
|
|||||||
// Copyright (c) 2011-present, Facebook, Inc. All rights reserved.
|
// Copyright (c) 2011-present, Facebook, Inc. All rights reserved.
|
||||||
// This source code is licensed under the BSD-style license found in the
|
// This source code is licensed under both the GPLv2 (found in the
|
||||||
// LICENSE file in the root directory of this source tree. An additional grant
|
// COPYING file in the root directory) and Apache 2.0 License
|
||||||
// of patent rights can be found in the PATENTS file in the same directory.
|
// (found in the LICENSE.Apache file in the root directory).
|
||||||
|
|
||||||
#ifndef ROCKSDB_LITE
|
#ifndef ROCKSDB_LITE
|
||||||
|
|
||||||
|
@ -1,7 +1,7 @@
|
|||||||
// Copyright (c) 2011-present, Facebook, Inc. All rights reserved.
|
// Copyright (c) 2011-present, Facebook, Inc. All rights reserved.
|
||||||
// This source code is licensed under the BSD-style license found in the
|
// This source code is licensed under both the GPLv2 (found in the
|
||||||
// LICENSE file in the root directory of this source tree. An additional grant
|
// COPYING file in the root directory) and Apache 2.0 License
|
||||||
// of patent rights can be found in the PATENTS file in the same directory.
|
// (found in the LICENSE.Apache file in the root directory).
|
||||||
|
|
||||||
#ifndef ROCKSDB_LITE
|
#ifndef ROCKSDB_LITE
|
||||||
#include "db/compacted_db_impl.h"
|
#include "db/compacted_db_impl.h"
|
||||||
|
@ -1,7 +1,7 @@
|
|||||||
// Copyright (c) 2011-present, Facebook, Inc. All rights reserved.
|
// Copyright (c) 2011-present, Facebook, Inc. All rights reserved.
|
||||||
// This source code is licensed under the BSD-style license found in the
|
// This source code is licensed under both the GPLv2 (found in the
|
||||||
// LICENSE file in the root directory of this source tree. An additional grant
|
// COPYING file in the root directory) and Apache 2.0 License
|
||||||
// of patent rights can be found in the PATENTS file in the same directory.
|
// (found in the LICENSE.Apache file in the root directory).
|
||||||
|
|
||||||
#pragma once
|
#pragma once
|
||||||
#ifndef ROCKSDB_LITE
|
#ifndef ROCKSDB_LITE
|
||||||
|
@ -1,7 +1,7 @@
|
|||||||
// Copyright (c) 2011-present, Facebook, Inc. All rights reserved.
|
// Copyright (c) 2011-present, Facebook, Inc. All rights reserved.
|
||||||
// This source code is licensed under the BSD-style license found in the
|
// This source code is licensed under both the GPLv2 (found in the
|
||||||
// LICENSE file in the root directory of this source tree. An additional grant
|
// COPYING file in the root directory) and Apache 2.0 License
|
||||||
// of patent rights can be found in the PATENTS file in the same directory.
|
// (found in the LICENSE.Apache file in the root directory).
|
||||||
//
|
//
|
||||||
// Copyright (c) 2011 The LevelDB Authors. All rights reserved.
|
// Copyright (c) 2011 The LevelDB Authors. All rights reserved.
|
||||||
// Use of this source code is governed by a BSD-style license that can be
|
// Use of this source code is governed by a BSD-style license that can be
|
||||||
@ -287,6 +287,10 @@ bool Compaction::KeyNotExistsBeyondOutputLevel(
|
|||||||
if (cfd_->ioptions()->compaction_style == kCompactionStyleUniversal) {
|
if (cfd_->ioptions()->compaction_style == kCompactionStyleUniversal) {
|
||||||
return bottommost_level_;
|
return bottommost_level_;
|
||||||
}
|
}
|
||||||
|
if (cfd_->ioptions()->compaction_style == kCompactionStyleLevel &&
|
||||||
|
output_level_ == 0) {
|
||||||
|
return false;
|
||||||
|
}
|
||||||
// Maybe use binary search to find right entry instead of linear search?
|
// Maybe use binary search to find right entry instead of linear search?
|
||||||
const Comparator* user_cmp = cfd_->user_comparator();
|
const Comparator* user_cmp = cfd_->user_comparator();
|
||||||
for (int lvl = output_level_ + 1; lvl < number_levels_; lvl++) {
|
for (int lvl = output_level_ + 1; lvl < number_levels_; lvl++) {
|
||||||
@ -413,14 +417,15 @@ void Compaction::Summary(char* output, int len) {
|
|||||||
uint64_t Compaction::OutputFilePreallocationSize() const {
|
uint64_t Compaction::OutputFilePreallocationSize() const {
|
||||||
uint64_t preallocation_size = 0;
|
uint64_t preallocation_size = 0;
|
||||||
|
|
||||||
if (cfd_->ioptions()->compaction_style == kCompactionStyleLevel ||
|
if (max_output_file_size_ != port::kMaxUint64 &&
|
||||||
output_level() > 0) {
|
(cfd_->ioptions()->compaction_style == kCompactionStyleLevel ||
|
||||||
|
output_level() > 0)) {
|
||||||
preallocation_size = max_output_file_size_;
|
preallocation_size = max_output_file_size_;
|
||||||
} else {
|
} else {
|
||||||
// output_level() == 0
|
for (const auto& level_files : inputs_) {
|
||||||
assert(num_input_levels() > 0);
|
for (const auto& file : level_files.files) {
|
||||||
for (const auto& f : inputs_[0].files) {
|
preallocation_size += file->fd.GetFileSize();
|
||||||
preallocation_size += f->fd.GetFileSize();
|
}
|
||||||
}
|
}
|
||||||
}
|
}
|
||||||
// Over-estimate slightly so we don't end up just barely crossing
|
// Over-estimate slightly so we don't end up just barely crossing
|
||||||
|
@ -1,7 +1,7 @@
|
|||||||
// Copyright (c) 2011-present, Facebook, Inc. All rights reserved.
|
// Copyright (c) 2011-present, Facebook, Inc. All rights reserved.
|
||||||
// This source code is licensed under the BSD-style license found in the
|
// This source code is licensed under both the GPLv2 (found in the
|
||||||
// LICENSE file in the root directory of this source tree. An additional grant
|
// COPYING file in the root directory) and Apache 2.0 License
|
||||||
// of patent rights can be found in the PATENTS file in the same directory.
|
// (found in the LICENSE.Apache file in the root directory).
|
||||||
//
|
//
|
||||||
// Copyright (c) 2011 The LevelDB Authors. All rights reserved.
|
// Copyright (c) 2011 The LevelDB Authors. All rights reserved.
|
||||||
// Use of this source code is governed by a BSD-style license that can be
|
// Use of this source code is governed by a BSD-style license that can be
|
||||||
|
@ -1,7 +1,7 @@
|
|||||||
// Copyright (c) 2016-present, Facebook, Inc. All rights reserved.
|
// Copyright (c) 2016-present, Facebook, Inc. All rights reserved.
|
||||||
// This source code is licensed under the BSD-style license found in the
|
// This source code is licensed under both the GPLv2 (found in the
|
||||||
// LICENSE file in the root directory of this source tree. An additional grant
|
// COPYING file in the root directory) and Apache 2.0 License
|
||||||
// of patent rights can be found in the PATENTS file in the same directory.
|
// (found in the LICENSE.Apache file in the root directory).
|
||||||
|
|
||||||
#pragma once
|
#pragma once
|
||||||
|
|
||||||
|
@ -1,21 +1,43 @@
|
|||||||
// Use of this source code is governed by a BSD-style license that can be
|
|
||||||
// found in the LICENSE file. See the AUTHORS file for names of contributors.
|
|
||||||
// Copyright (c) 2011-present, Facebook, Inc. All rights reserved.
|
// Copyright (c) 2011-present, Facebook, Inc. All rights reserved.
|
||||||
// This source code is licensed under the BSD-style license found in the
|
// This source code is licensed under both the GPLv2 (found in the
|
||||||
// LICENSE file in the root directory of this source tree. An additional grant
|
// COPYING file in the root directory) and Apache 2.0 License
|
||||||
// of patent rights can be found in the PATENTS file in the same directory.
|
// (found in the LICENSE.Apache file in the root directory).
|
||||||
|
|
||||||
#include "db/compaction_iterator.h"
|
#include "db/compaction_iterator.h"
|
||||||
#include "table/internal_iterator.h"
|
#include "table/internal_iterator.h"
|
||||||
|
|
||||||
namespace rocksdb {
|
namespace rocksdb {
|
||||||
|
|
||||||
|
#ifndef ROCKSDB_LITE
|
||||||
|
CompactionEventListener::CompactionListenerValueType fromInternalValueType(
|
||||||
|
ValueType vt) {
|
||||||
|
switch (vt) {
|
||||||
|
case kTypeDeletion:
|
||||||
|
return CompactionEventListener::CompactionListenerValueType::kDelete;
|
||||||
|
case kTypeValue:
|
||||||
|
return CompactionEventListener::CompactionListenerValueType::kValue;
|
||||||
|
case kTypeMerge:
|
||||||
|
return CompactionEventListener::CompactionListenerValueType::
|
||||||
|
kMergeOperand;
|
||||||
|
case kTypeSingleDeletion:
|
||||||
|
return CompactionEventListener::CompactionListenerValueType::
|
||||||
|
kSingleDelete;
|
||||||
|
case kTypeRangeDeletion:
|
||||||
|
return CompactionEventListener::CompactionListenerValueType::kRangeDelete;
|
||||||
|
default:
|
||||||
|
assert(false);
|
||||||
|
return CompactionEventListener::CompactionListenerValueType::kInvalid;
|
||||||
|
}
|
||||||
|
}
|
||||||
|
#endif // ROCKSDB_LITE
|
||||||
|
|
||||||
CompactionIterator::CompactionIterator(
|
CompactionIterator::CompactionIterator(
|
||||||
InternalIterator* input, const Comparator* cmp, MergeHelper* merge_helper,
|
InternalIterator* input, const Comparator* cmp, MergeHelper* merge_helper,
|
||||||
SequenceNumber last_sequence, std::vector<SequenceNumber>* snapshots,
|
SequenceNumber last_sequence, std::vector<SequenceNumber>* snapshots,
|
||||||
SequenceNumber earliest_write_conflict_snapshot, Env* env,
|
SequenceNumber earliest_write_conflict_snapshot, Env* env,
|
||||||
bool expect_valid_internal_key, RangeDelAggregator* range_del_agg,
|
bool expect_valid_internal_key, RangeDelAggregator* range_del_agg,
|
||||||
const Compaction* compaction, const CompactionFilter* compaction_filter,
|
const Compaction* compaction, const CompactionFilter* compaction_filter,
|
||||||
|
CompactionEventListener* compaction_listener,
|
||||||
const std::atomic<bool>* shutting_down)
|
const std::atomic<bool>* shutting_down)
|
||||||
: CompactionIterator(
|
: CompactionIterator(
|
||||||
input, cmp, merge_helper, last_sequence, snapshots,
|
input, cmp, merge_helper, last_sequence, snapshots,
|
||||||
@ -23,7 +45,7 @@ CompactionIterator::CompactionIterator(
|
|||||||
range_del_agg,
|
range_del_agg,
|
||||||
std::unique_ptr<CompactionProxy>(
|
std::unique_ptr<CompactionProxy>(
|
||||||
compaction ? new CompactionProxy(compaction) : nullptr),
|
compaction ? new CompactionProxy(compaction) : nullptr),
|
||||||
compaction_filter, shutting_down) {}
|
compaction_filter, compaction_listener, shutting_down) {}
|
||||||
|
|
||||||
CompactionIterator::CompactionIterator(
|
CompactionIterator::CompactionIterator(
|
||||||
InternalIterator* input, const Comparator* cmp, MergeHelper* merge_helper,
|
InternalIterator* input, const Comparator* cmp, MergeHelper* merge_helper,
|
||||||
@ -32,6 +54,7 @@ CompactionIterator::CompactionIterator(
|
|||||||
bool expect_valid_internal_key, RangeDelAggregator* range_del_agg,
|
bool expect_valid_internal_key, RangeDelAggregator* range_del_agg,
|
||||||
std::unique_ptr<CompactionProxy> compaction,
|
std::unique_ptr<CompactionProxy> compaction,
|
||||||
const CompactionFilter* compaction_filter,
|
const CompactionFilter* compaction_filter,
|
||||||
|
CompactionEventListener* compaction_listener,
|
||||||
const std::atomic<bool>* shutting_down)
|
const std::atomic<bool>* shutting_down)
|
||||||
: input_(input),
|
: input_(input),
|
||||||
cmp_(cmp),
|
cmp_(cmp),
|
||||||
@ -43,7 +66,9 @@ CompactionIterator::CompactionIterator(
|
|||||||
range_del_agg_(range_del_agg),
|
range_del_agg_(range_del_agg),
|
||||||
compaction_(std::move(compaction)),
|
compaction_(std::move(compaction)),
|
||||||
compaction_filter_(compaction_filter),
|
compaction_filter_(compaction_filter),
|
||||||
|
compaction_listener_(compaction_listener),
|
||||||
shutting_down_(shutting_down),
|
shutting_down_(shutting_down),
|
||||||
|
ignore_snapshots_(false),
|
||||||
merge_out_iter_(merge_helper_) {
|
merge_out_iter_(merge_helper_) {
|
||||||
assert(compaction_filter_ == nullptr || compaction_ != nullptr);
|
assert(compaction_filter_ == nullptr || compaction_ != nullptr);
|
||||||
bottommost_level_ =
|
bottommost_level_ =
|
||||||
@ -62,8 +87,10 @@ CompactionIterator::CompactionIterator(
|
|||||||
earliest_snapshot_ = snapshots_->at(0);
|
earliest_snapshot_ = snapshots_->at(0);
|
||||||
latest_snapshot_ = snapshots_->back();
|
latest_snapshot_ = snapshots_->back();
|
||||||
}
|
}
|
||||||
if (compaction_filter_ != nullptr && compaction_filter_->IgnoreSnapshots()) {
|
if (compaction_filter_ != nullptr) {
|
||||||
|
if (compaction_filter_->IgnoreSnapshots()) {
|
||||||
ignore_snapshots_ = true;
|
ignore_snapshots_ = true;
|
||||||
|
}
|
||||||
} else {
|
} else {
|
||||||
ignore_snapshots_ = false;
|
ignore_snapshots_ = false;
|
||||||
}
|
}
|
||||||
@ -188,6 +215,14 @@ void CompactionIterator::NextFromInput() {
|
|||||||
current_user_key_sequence_ = kMaxSequenceNumber;
|
current_user_key_sequence_ = kMaxSequenceNumber;
|
||||||
current_user_key_snapshot_ = 0;
|
current_user_key_snapshot_ = 0;
|
||||||
|
|
||||||
|
#ifndef ROCKSDB_LITE
|
||||||
|
if (compaction_listener_) {
|
||||||
|
compaction_listener_->OnCompaction(compaction_->level(), ikey_.user_key,
|
||||||
|
fromInternalValueType(ikey_.type),
|
||||||
|
value_, ikey_.sequence, true);
|
||||||
|
}
|
||||||
|
#endif // ROCKSDB_LITE
|
||||||
|
|
||||||
// apply the compaction filter to the first occurrence of the user key
|
// apply the compaction filter to the first occurrence of the user key
|
||||||
if (compaction_filter_ != nullptr && ikey_.type == kTypeValue &&
|
if (compaction_filter_ != nullptr && ikey_.type == kTypeValue &&
|
||||||
(visible_at_tip_ || ikey_.sequence > latest_snapshot_ ||
|
(visible_at_tip_ || ikey_.sequence > latest_snapshot_ ||
|
||||||
@ -235,6 +270,14 @@ void CompactionIterator::NextFromInput() {
|
|||||||
}
|
}
|
||||||
}
|
}
|
||||||
} else {
|
} else {
|
||||||
|
#ifndef ROCKSDB_LITE
|
||||||
|
if (compaction_listener_) {
|
||||||
|
compaction_listener_->OnCompaction(compaction_->level(), ikey_.user_key,
|
||||||
|
fromInternalValueType(ikey_.type),
|
||||||
|
value_, ikey_.sequence, false);
|
||||||
|
}
|
||||||
|
#endif // ROCKSDB_LITE
|
||||||
|
|
||||||
// Update the current key to reflect the new sequence number/type without
|
// Update the current key to reflect the new sequence number/type without
|
||||||
// copying the user key.
|
// copying the user key.
|
||||||
// TODO(rven): Compaction filter does not process keys in this path
|
// TODO(rven): Compaction filter does not process keys in this path
|
||||||
@ -394,7 +437,7 @@ void CompactionIterator::NextFromInput() {
|
|||||||
// is the same as the visibility of a previous instance of the
|
// is the same as the visibility of a previous instance of the
|
||||||
// same key, then this kv is not visible in any snapshot.
|
// same key, then this kv is not visible in any snapshot.
|
||||||
// Hidden by an newer entry for same user key
|
// Hidden by an newer entry for same user key
|
||||||
// TODO: why not > ?
|
// TODO(noetzli): why not > ?
|
||||||
//
|
//
|
||||||
// Note: Dropping this key will not affect TransactionDB write-conflict
|
// Note: Dropping this key will not affect TransactionDB write-conflict
|
||||||
// checking since there has already been a record returned for this key
|
// checking since there has already been a record returned for this key
|
||||||
|
@ -1,9 +1,7 @@
|
|||||||
// Use of this source code is governed by a BSD-style license that can be
|
|
||||||
// found in the LICENSE file. See the AUTHORS file for names of contributors.
|
|
||||||
// Copyright (c) 2011-present, Facebook, Inc. All rights reserved.
|
// Copyright (c) 2011-present, Facebook, Inc. All rights reserved.
|
||||||
// This source code is licensed under the BSD-style license found in the
|
// This source code is licensed under both the GPLv2 (found in the
|
||||||
// LICENSE file in the root directory of this source tree. An additional grant
|
// COPYING file in the root directory) and Apache 2.0 License
|
||||||
// of patent rights can be found in the PATENTS file in the same directory.
|
// (found in the LICENSE.Apache file in the root directory).
|
||||||
#pragma once
|
#pragma once
|
||||||
|
|
||||||
#include <algorithm>
|
#include <algorithm>
|
||||||
@ -20,6 +18,8 @@
|
|||||||
|
|
||||||
namespace rocksdb {
|
namespace rocksdb {
|
||||||
|
|
||||||
|
class CompactionEventListener;
|
||||||
|
|
||||||
class CompactionIterator {
|
class CompactionIterator {
|
||||||
public:
|
public:
|
||||||
// A wrapper around Compaction. Has a much smaller interface, only what
|
// A wrapper around Compaction. Has a much smaller interface, only what
|
||||||
@ -60,6 +60,7 @@ class CompactionIterator {
|
|||||||
RangeDelAggregator* range_del_agg,
|
RangeDelAggregator* range_del_agg,
|
||||||
const Compaction* compaction = nullptr,
|
const Compaction* compaction = nullptr,
|
||||||
const CompactionFilter* compaction_filter = nullptr,
|
const CompactionFilter* compaction_filter = nullptr,
|
||||||
|
CompactionEventListener* compaction_listener = nullptr,
|
||||||
const std::atomic<bool>* shutting_down = nullptr);
|
const std::atomic<bool>* shutting_down = nullptr);
|
||||||
|
|
||||||
// Constructor with custom CompactionProxy, used for tests.
|
// Constructor with custom CompactionProxy, used for tests.
|
||||||
@ -71,6 +72,7 @@ class CompactionIterator {
|
|||||||
RangeDelAggregator* range_del_agg,
|
RangeDelAggregator* range_del_agg,
|
||||||
std::unique_ptr<CompactionProxy> compaction,
|
std::unique_ptr<CompactionProxy> compaction,
|
||||||
const CompactionFilter* compaction_filter = nullptr,
|
const CompactionFilter* compaction_filter = nullptr,
|
||||||
|
CompactionEventListener* compaction_listener = nullptr,
|
||||||
const std::atomic<bool>* shutting_down = nullptr);
|
const std::atomic<bool>* shutting_down = nullptr);
|
||||||
|
|
||||||
~CompactionIterator();
|
~CompactionIterator();
|
||||||
@ -124,6 +126,7 @@ class CompactionIterator {
|
|||||||
RangeDelAggregator* range_del_agg_;
|
RangeDelAggregator* range_del_agg_;
|
||||||
std::unique_ptr<CompactionProxy> compaction_;
|
std::unique_ptr<CompactionProxy> compaction_;
|
||||||
const CompactionFilter* compaction_filter_;
|
const CompactionFilter* compaction_filter_;
|
||||||
|
CompactionEventListener* compaction_listener_;
|
||||||
const std::atomic<bool>* shutting_down_;
|
const std::atomic<bool>* shutting_down_;
|
||||||
bool bottommost_level_;
|
bool bottommost_level_;
|
||||||
bool valid_ = false;
|
bool valid_ = false;
|
||||||
|
@ -1,7 +1,7 @@
|
|||||||
// Copyright (c) 2011-present, Facebook, Inc. All rights reserved.
|
// Copyright (c) 2011-present, Facebook, Inc. All rights reserved.
|
||||||
// This source code is licensed under the BSD-style license found in the
|
// This source code is licensed under both the GPLv2 (found in the
|
||||||
// LICENSE file in the root directory of this source tree. An additional grant
|
// COPYING file in the root directory) and Apache 2.0 License
|
||||||
// of patent rights can be found in the PATENTS file in the same directory.
|
// (found in the LICENSE.Apache file in the root directory).
|
||||||
|
|
||||||
#include "db/compaction_iterator.h"
|
#include "db/compaction_iterator.h"
|
||||||
|
|
||||||
@ -189,7 +189,7 @@ class CompactionIteratorTest : public testing::Test {
|
|||||||
c_iter_.reset(new CompactionIterator(
|
c_iter_.reset(new CompactionIterator(
|
||||||
iter_.get(), cmp_, merge_helper_.get(), last_sequence, &snapshots_,
|
iter_.get(), cmp_, merge_helper_.get(), last_sequence, &snapshots_,
|
||||||
kMaxSequenceNumber, Env::Default(), false, range_del_agg_.get(),
|
kMaxSequenceNumber, Env::Default(), false, range_del_agg_.get(),
|
||||||
std::move(compaction), filter, &shutting_down_));
|
std::move(compaction), filter, nullptr, &shutting_down_));
|
||||||
}
|
}
|
||||||
|
|
||||||
void AddSnapshot(SequenceNumber snapshot) { snapshots_.push_back(snapshot); }
|
void AddSnapshot(SequenceNumber snapshot) { snapshots_.push_back(snapshot); }
|
||||||
|
@ -1,7 +1,7 @@
|
|||||||
// Copyright (c) 2011-present, Facebook, Inc. All rights reserved.
|
// Copyright (c) 2011-present, Facebook, Inc. All rights reserved.
|
||||||
// This source code is licensed under the BSD-style license found in the
|
// This source code is licensed under both the GPLv2 (found in the
|
||||||
// LICENSE file in the root directory of this source tree. An additional grant
|
// COPYING file in the root directory) and Apache 2.0 License
|
||||||
// of patent rights can be found in the PATENTS file in the same directory.
|
// (found in the LICENSE.Apache file in the root directory).
|
||||||
//
|
//
|
||||||
// Copyright (c) 2011 The LevelDB Authors. All rights reserved.
|
// Copyright (c) 2011 The LevelDB Authors. All rights reserved.
|
||||||
// Use of this source code is governed by a BSD-style license that can be
|
// Use of this source code is governed by a BSD-style license that can be
|
||||||
@ -739,12 +739,23 @@ void CompactionJob::ProcessKeyValueCompaction(SubcompactionState* sub_compact) {
|
|||||||
input->SeekToFirst();
|
input->SeekToFirst();
|
||||||
}
|
}
|
||||||
|
|
||||||
|
// we allow only 1 compaction event listener. Used by blob storage
|
||||||
|
CompactionEventListener* comp_event_listener = nullptr;
|
||||||
|
#ifndef ROCKSDB_LITE
|
||||||
|
for (auto& celitr : cfd->ioptions()->listeners) {
|
||||||
|
comp_event_listener = celitr->GetCompactionEventListener();
|
||||||
|
if (comp_event_listener != nullptr) {
|
||||||
|
break;
|
||||||
|
}
|
||||||
|
}
|
||||||
|
#endif // ROCKSDB_LITE
|
||||||
|
|
||||||
Status status;
|
Status status;
|
||||||
sub_compact->c_iter.reset(new CompactionIterator(
|
sub_compact->c_iter.reset(new CompactionIterator(
|
||||||
input.get(), cfd->user_comparator(), &merge, versions_->LastSequence(),
|
input.get(), cfd->user_comparator(), &merge, versions_->LastSequence(),
|
||||||
&existing_snapshots_, earliest_write_conflict_snapshot_, env_, false,
|
&existing_snapshots_, earliest_write_conflict_snapshot_, env_, false,
|
||||||
range_del_agg.get(), sub_compact->compaction, compaction_filter,
|
range_del_agg.get(), sub_compact->compaction, compaction_filter,
|
||||||
shutting_down_));
|
comp_event_listener, shutting_down_));
|
||||||
auto c_iter = sub_compact->c_iter.get();
|
auto c_iter = sub_compact->c_iter.get();
|
||||||
c_iter->SeekToFirst();
|
c_iter->SeekToFirst();
|
||||||
if (c_iter->Valid() &&
|
if (c_iter->Valid() &&
|
||||||
@ -1072,6 +1083,11 @@ Status CompactionJob::FinishCompactionOutputFile(
|
|||||||
TableProperties tp;
|
TableProperties tp;
|
||||||
if (s.ok() && current_entries > 0) {
|
if (s.ok() && current_entries > 0) {
|
||||||
// Verify that the table is usable
|
// Verify that the table is usable
|
||||||
|
// We set for_compaction to false and don't OptimizeForCompactionTableRead
|
||||||
|
// here because this is a special case after we finish the table building
|
||||||
|
// No matter whether use_direct_io_for_flush_and_compaction is true,
|
||||||
|
// we will regrad this verification as user reads since the goal is
|
||||||
|
// to cache it here for further user reads
|
||||||
InternalIterator* iter = cfd->table_cache()->NewIterator(
|
InternalIterator* iter = cfd->table_cache()->NewIterator(
|
||||||
ReadOptions(), env_options_, cfd->internal_comparator(), meta->fd,
|
ReadOptions(), env_options_, cfd->internal_comparator(), meta->fd,
|
||||||
nullptr /* range_del_agg */, nullptr,
|
nullptr /* range_del_agg */, nullptr,
|
||||||
@ -1198,7 +1214,11 @@ Status CompactionJob::OpenCompactionOutputFile(
|
|||||||
#endif // !ROCKSDB_LITE
|
#endif // !ROCKSDB_LITE
|
||||||
// Make the output file
|
// Make the output file
|
||||||
unique_ptr<WritableFile> writable_file;
|
unique_ptr<WritableFile> writable_file;
|
||||||
Status s = NewWritableFile(env_, fname, &writable_file, env_options_);
|
EnvOptions opt_env_opts =
|
||||||
|
env_->OptimizeForCompactionTableWrite(env_options_, db_options_);
|
||||||
|
TEST_SYNC_POINT_CALLBACK("CompactionJob::OpenCompactionOutputFile",
|
||||||
|
&opt_env_opts.use_direct_writes);
|
||||||
|
Status s = NewWritableFile(env_, fname, &writable_file, opt_env_opts);
|
||||||
if (!s.ok()) {
|
if (!s.ok()) {
|
||||||
ROCKS_LOG_ERROR(
|
ROCKS_LOG_ERROR(
|
||||||
db_options_.info_log,
|
db_options_.info_log,
|
||||||
|
@ -1,7 +1,7 @@
|
|||||||
// Copyright (c) 2011-present, Facebook, Inc. All rights reserved.
|
// Copyright (c) 2011-present, Facebook, Inc. All rights reserved.
|
||||||
// This source code is licensed under the BSD-style license found in the
|
// This source code is licensed under both the GPLv2 (found in the
|
||||||
// LICENSE file in the root directory of this source tree. An additional grant
|
// COPYING file in the root directory) and Apache 2.0 License
|
||||||
// of patent rights can be found in the PATENTS file in the same directory.
|
// (found in the LICENSE.Apache file in the root directory).
|
||||||
//
|
//
|
||||||
// Copyright (c) 2011 The LevelDB Authors. All rights reserved.
|
// Copyright (c) 2011 The LevelDB Authors. All rights reserved.
|
||||||
// Use of this source code is governed by a BSD-style license that can be
|
// Use of this source code is governed by a BSD-style license that can be
|
||||||
|
@ -1,7 +1,7 @@
|
|||||||
// Copyright (c) 2011-present, Facebook, Inc. All rights reserved.
|
// Copyright (c) 2011-present, Facebook, Inc. All rights reserved.
|
||||||
// This source code is licensed under the BSD-style license found in the
|
// This source code is licensed under both the GPLv2 (found in the
|
||||||
// LICENSE file in the root directory of this source tree. An additional grant
|
// COPYING file in the root directory) and Apache 2.0 License
|
||||||
// of patent rights can be found in the PATENTS file in the same directory.
|
// (found in the LICENSE.Apache file in the root directory).
|
||||||
//
|
//
|
||||||
// Copyright (c) 2011 The LevelDB Authors. All rights reserved.
|
// Copyright (c) 2011 The LevelDB Authors. All rights reserved.
|
||||||
// Use of this source code is governed by a BSD-style license that can be
|
// Use of this source code is governed by a BSD-style license that can be
|
||||||
|
@ -1,7 +1,7 @@
|
|||||||
// Copyright (c) 2011-present, Facebook, Inc. All rights reserved.
|
// Copyright (c) 2011-present, Facebook, Inc. All rights reserved.
|
||||||
// This source code is licensed under the BSD-style license found in the
|
// This source code is licensed under both the GPLv2 (found in the
|
||||||
// LICENSE file in the root directory of this source tree. An additional grant
|
// COPYING file in the root directory) and Apache 2.0 License
|
||||||
// of patent rights can be found in the PATENTS file in the same directory.
|
// (found in the LICENSE.Apache file in the root directory).
|
||||||
|
|
||||||
#ifndef ROCKSDB_LITE
|
#ifndef ROCKSDB_LITE
|
||||||
|
|
||||||
|
@ -1,7 +1,7 @@
|
|||||||
// Copyright (c) 2011-present, Facebook, Inc. All rights reserved.
|
// Copyright (c) 2011-present, Facebook, Inc. All rights reserved.
|
||||||
// This source code is licensed under the BSD-style license found in the
|
// This source code is licensed under both the GPLv2 (found in the
|
||||||
// LICENSE file in the root directory of this source tree. An additional grant
|
// COPYING file in the root directory) and Apache 2.0 License
|
||||||
// of patent rights can be found in the PATENTS file in the same directory.
|
// (found in the LICENSE.Apache file in the root directory).
|
||||||
//
|
//
|
||||||
// Copyright (c) 2011 The LevelDB Authors. All rights reserved.
|
// Copyright (c) 2011 The LevelDB Authors. All rights reserved.
|
||||||
// Use of this source code is governed by a BSD-style license that can be
|
// Use of this source code is governed by a BSD-style license that can be
|
||||||
|
@ -1,7 +1,7 @@
|
|||||||
// Copyright (c) 2011-present, Facebook, Inc. All rights reserved.
|
// Copyright (c) 2011-present, Facebook, Inc. All rights reserved.
|
||||||
// This source code is licensed under the BSD-style license found in the
|
// This source code is licensed under both the GPLv2 (found in the
|
||||||
// LICENSE file in the root directory of this source tree. An additional grant
|
// COPYING file in the root directory) and Apache 2.0 License
|
||||||
// of patent rights can be found in the PATENTS file in the same directory.
|
// (found in the LICENSE.Apache file in the root directory).
|
||||||
//
|
//
|
||||||
// Copyright (c) 2011 The LevelDB Authors. All rights reserved.
|
// Copyright (c) 2011 The LevelDB Authors. All rights reserved.
|
||||||
// Use of this source code is governed by a BSD-style license that can be
|
// Use of this source code is governed by a BSD-style license that can be
|
||||||
|
@ -1,7 +1,7 @@
|
|||||||
// Copyright (c) 2011-present, Facebook, Inc. All rights reserved.
|
// Copyright (c) 2011-present, Facebook, Inc. All rights reserved.
|
||||||
// This source code is licensed under the BSD-style license found in the
|
// This source code is licensed under both the GPLv2 (found in the
|
||||||
// LICENSE file in the root directory of this source tree. An additional grant
|
// COPYING file in the root directory) and Apache 2.0 License
|
||||||
// of patent rights can be found in the PATENTS file in the same directory.
|
// (found in the LICENSE.Apache file in the root directory).
|
||||||
|
|
||||||
#include "db/compaction_picker.h"
|
#include "db/compaction_picker.h"
|
||||||
#include <limits>
|
#include <limits>
|
||||||
|
@ -1,7 +1,7 @@
|
|||||||
// Copyright (c) 2011-present, Facebook, Inc. All rights reserved.
|
// Copyright (c) 2011-present, Facebook, Inc. All rights reserved.
|
||||||
// This source code is licensed under the BSD-style license found in the
|
// This source code is licensed under both the GPLv2 (found in the
|
||||||
// LICENSE file in the root directory of this source tree. An additional grant
|
// COPYING file in the root directory) and Apache 2.0 License
|
||||||
// of patent rights can be found in the PATENTS file in the same directory.
|
// (found in the LICENSE.Apache file in the root directory).
|
||||||
//
|
//
|
||||||
// Copyright (c) 2011 The LevelDB Authors. All rights reserved.
|
// Copyright (c) 2011 The LevelDB Authors. All rights reserved.
|
||||||
// Use of this source code is governed by a BSD-style license that can be
|
// Use of this source code is governed by a BSD-style license that can be
|
||||||
|
@ -1,7 +1,7 @@
|
|||||||
// Copyright (c) 2011-present, Facebook, Inc. All rights reserved.
|
// Copyright (c) 2011-present, Facebook, Inc. All rights reserved.
|
||||||
// This source code is licensed under the BSD-style license found in the
|
// This source code is licensed under both the GPLv2 (found in the
|
||||||
// LICENSE file in the root directory of this source tree. An additional grant
|
// COPYING file in the root directory) and Apache 2.0 License
|
||||||
// of patent rights can be found in the PATENTS file in the same directory.
|
// (found in the LICENSE.Apache file in the root directory).
|
||||||
//
|
//
|
||||||
// Copyright (c) 2011 The LevelDB Authors. All rights reserved.
|
// Copyright (c) 2011 The LevelDB Authors. All rights reserved.
|
||||||
// Use of this source code is governed by a BSD-style license that can be
|
// Use of this source code is governed by a BSD-style license that can be
|
||||||
|
@ -1,9 +1,7 @@
|
|||||||
// Use of this source code is governed by a BSD-style license that can be
|
|
||||||
// found in the LICENSE file. See the AUTHORS file for names of contributors.
|
|
||||||
// Copyright (c) 2011-present, Facebook, Inc. All rights reserved.
|
// Copyright (c) 2011-present, Facebook, Inc. All rights reserved.
|
||||||
// This source code is licensed under the BSD-style license found in the
|
// This source code is licensed under both the GPLv2 (found in the
|
||||||
// LICENSE file in the root directory of this source tree. An additional grant
|
// COPYING file in the root directory) and Apache 2.0 License
|
||||||
// of patent rights can be found in the PATENTS file in the same directory.
|
// (found in the LICENSE.Apache file in the root directory).
|
||||||
#include <map>
|
#include <map>
|
||||||
#include <string>
|
#include <string>
|
||||||
|
|
||||||
|
@ -1,11 +1,8 @@
|
|||||||
// Copyright (c) 2011-present, Facebook, Inc. All rights reserved.
|
// Copyright (c) 2011-present, Facebook, Inc. All rights reserved.
|
||||||
// This source code is licensed under the BSD-style license found in the
|
// This source code is licensed under both the GPLv2 (found in the
|
||||||
// LICENSE file in the root directory of this source tree. An additional grant
|
// COPYING file in the root directory) and Apache 2.0 License
|
||||||
// of patent rights can be found in the PATENTS file in the same directory.
|
// (found in the LICENSE.Apache file in the root directory).
|
||||||
//
|
//
|
||||||
// Copyright (c) 2012 Facebook.
|
|
||||||
// Use of this source code is governed by a BSD-style license that can be
|
|
||||||
// found in the LICENSE file.
|
|
||||||
|
|
||||||
#ifndef ROCKSDB_LITE
|
#ifndef ROCKSDB_LITE
|
||||||
|
|
||||||
|
@ -1,7 +1,7 @@
|
|||||||
// Copyright (c) 2011-present, Facebook, Inc. All rights reserved.
|
// Copyright (c) 2011-present, Facebook, Inc. All rights reserved.
|
||||||
// This source code is licensed under the BSD-style license found in the
|
// This source code is licensed under both the GPLv2 (found in the
|
||||||
// LICENSE file in the root directory of this source tree. An additional grant
|
// COPYING file in the root directory) and Apache 2.0 License
|
||||||
// of patent rights can be found in the PATENTS file in the same directory.
|
// (found in the LICENSE.Apache file in the root directory).
|
||||||
//
|
//
|
||||||
// Copyright (c) 2011 The LevelDB Authors. All rights reserved.
|
// Copyright (c) 2011 The LevelDB Authors. All rights reserved.
|
||||||
// Use of this source code is governed by a BSD-style license that can be
|
// Use of this source code is governed by a BSD-style license that can be
|
||||||
|
@ -1,7 +1,7 @@
|
|||||||
// Copyright (c) 2011-present, Facebook, Inc. All rights reserved.
|
// Copyright (c) 2011-present, Facebook, Inc. All rights reserved.
|
||||||
// This source code is licensed under the BSD-style license found in the
|
// This source code is licensed under both the GPLv2 (found in the
|
||||||
// LICENSE file in the root directory of this source tree. An additional grant
|
// COPYING file in the root directory) and Apache 2.0 License
|
||||||
// of patent rights can be found in the PATENTS file in the same directory.
|
// (found in the LICENSE.Apache file in the root directory).
|
||||||
|
|
||||||
#ifndef ROCKSDB_LITE
|
#ifndef ROCKSDB_LITE
|
||||||
|
|
||||||
|
@ -1,7 +1,7 @@
|
|||||||
// Copyright (c) 2011-present, Facebook, Inc. All rights reserved.
|
// Copyright (c) 2011-present, Facebook, Inc. All rights reserved.
|
||||||
// This source code is licensed under the BSD-style license found in the
|
// This source code is licensed under both the GPLv2 (found in the
|
||||||
// LICENSE file in the root directory of this source tree. An additional grant
|
// COPYING file in the root directory) and Apache 2.0 License
|
||||||
// of patent rights can be found in the PATENTS file in the same directory.
|
// (found in the LICENSE.Apache file in the root directory).
|
||||||
//
|
//
|
||||||
// Copyright (c) 2011 The LevelDB Authors. All rights reserved.
|
// Copyright (c) 2011 The LevelDB Authors. All rights reserved.
|
||||||
// Use of this source code is governed by a BSD-style license that can be
|
// Use of this source code is governed by a BSD-style license that can be
|
||||||
|
@ -1,7 +1,7 @@
|
|||||||
// Copyright (c) 2011-present, Facebook, Inc. All rights reserved.
|
// Copyright (c) 2011-present, Facebook, Inc. All rights reserved.
|
||||||
// This source code is licensed under the BSD-style license found in the
|
// This source code is licensed under both the GPLv2 (found in the
|
||||||
// LICENSE file in the root directory of this source tree. An additional grant
|
// COPYING file in the root directory) and Apache 2.0 License
|
||||||
// of patent rights can be found in the PATENTS file in the same directory.
|
// (found in the LICENSE.Apache file in the root directory).
|
||||||
//
|
//
|
||||||
// Copyright (c) 2011 The LevelDB Authors. All rights reserved.
|
// Copyright (c) 2011 The LevelDB Authors. All rights reserved.
|
||||||
// Use of this source code is governed by a BSD-style license that can be
|
// Use of this source code is governed by a BSD-style license that can be
|
||||||
|
@ -1,7 +1,7 @@
|
|||||||
// Copyright (c) 2011-present, Facebook, Inc. All rights reserved.
|
// Copyright (c) 2011-present, Facebook, Inc. All rights reserved.
|
||||||
// This source code is licensed under the BSD-style license found in the
|
// This source code is licensed under both the GPLv2 (found in the
|
||||||
// LICENSE file in the root directory of this source tree. An additional grant
|
// COPYING file in the root directory) and Apache 2.0 License
|
||||||
// of patent rights can be found in the PATENTS file in the same directory.
|
// (found in the LICENSE.Apache file in the root directory).
|
||||||
//
|
//
|
||||||
// Copyright (c) 2011 The LevelDB Authors. All rights reserved.
|
// Copyright (c) 2011 The LevelDB Authors. All rights reserved.
|
||||||
// Use of this source code is governed by a BSD-style license that can be
|
// Use of this source code is governed by a BSD-style license that can be
|
||||||
|
@ -1,7 +1,7 @@
|
|||||||
// Copyright (c) 2011-present, Facebook, Inc. All rights reserved.
|
// Copyright (c) 2011-present, Facebook, Inc. All rights reserved.
|
||||||
// This source code is licensed under the BSD-style license found in the
|
// This source code is licensed under both the GPLv2 (found in the
|
||||||
// LICENSE file in the root directory of this source tree. An additional grant
|
// COPYING file in the root directory) and Apache 2.0 License
|
||||||
// of patent rights can be found in the PATENTS file in the same directory.
|
// (found in the LICENSE.Apache file in the root directory).
|
||||||
//
|
//
|
||||||
// Copyright (c) 2011 The LevelDB Authors. All rights reserved.
|
// Copyright (c) 2011 The LevelDB Authors. All rights reserved.
|
||||||
// Use of this source code is governed by a BSD-style license that can be
|
// Use of this source code is governed by a BSD-style license that can be
|
||||||
|
@ -1,7 +1,7 @@
|
|||||||
// Copyright (c) 2011-present, Facebook, Inc. All rights reserved.
|
// Copyright (c) 2011-present, Facebook, Inc. All rights reserved.
|
||||||
// This source code is licensed under the BSD-style license found in the
|
// This source code is licensed under both the GPLv2 (found in the
|
||||||
// LICENSE file in the root directory of this source tree. An additional grant
|
// COPYING file in the root directory) and Apache 2.0 License
|
||||||
// of patent rights can be found in the PATENTS file in the same directory.
|
// (found in the LICENSE.Apache file in the root directory).
|
||||||
//
|
//
|
||||||
// Copyright (c) 2011 The LevelDB Authors. All rights reserved.
|
// Copyright (c) 2011 The LevelDB Authors. All rights reserved.
|
||||||
// Use of this source code is governed by a BSD-style license that can be
|
// Use of this source code is governed by a BSD-style license that can be
|
||||||
@ -40,6 +40,12 @@ class DBCompactionTestWithParam
|
|||||||
bool exclusive_manual_compaction_;
|
bool exclusive_manual_compaction_;
|
||||||
};
|
};
|
||||||
|
|
||||||
|
class DBCompactionDirectIOTest : public DBCompactionTest,
|
||||||
|
public ::testing::WithParamInterface<bool> {
|
||||||
|
public:
|
||||||
|
DBCompactionDirectIOTest() : DBCompactionTest() {}
|
||||||
|
};
|
||||||
|
|
||||||
namespace {
|
namespace {
|
||||||
|
|
||||||
class FlushedFileCollector : public EventListener {
|
class FlushedFileCollector : public EventListener {
|
||||||
@ -772,6 +778,41 @@ TEST_F(DBCompactionTest, ZeroSeqIdCompaction) {
|
|||||||
ASSERT_OK(Put("", ""));
|
ASSERT_OK(Put("", ""));
|
||||||
}
|
}
|
||||||
|
|
||||||
|
TEST_F(DBCompactionTest, ManualCompactionUnknownOutputSize) {
|
||||||
|
// github issue #2249
|
||||||
|
Options options = CurrentOptions();
|
||||||
|
options.compaction_style = kCompactionStyleLevel;
|
||||||
|
options.level0_file_num_compaction_trigger = 3;
|
||||||
|
DestroyAndReopen(options);
|
||||||
|
|
||||||
|
// create two files in l1 that we can compact
|
||||||
|
for (int i = 0; i < 2; ++i) {
|
||||||
|
for (int j = 0; j < options.level0_file_num_compaction_trigger; j++) {
|
||||||
|
// make l0 files' ranges overlap to avoid trivial move
|
||||||
|
Put(std::to_string(2 * i), std::string(1, 'A'));
|
||||||
|
Put(std::to_string(2 * i + 1), std::string(1, 'A'));
|
||||||
|
Flush();
|
||||||
|
dbfull()->TEST_WaitForFlushMemTable();
|
||||||
|
}
|
||||||
|
dbfull()->TEST_WaitForCompact();
|
||||||
|
ASSERT_EQ(NumTableFilesAtLevel(0, 0), 0);
|
||||||
|
ASSERT_EQ(NumTableFilesAtLevel(1, 0), i + 1);
|
||||||
|
}
|
||||||
|
|
||||||
|
ColumnFamilyMetaData cf_meta;
|
||||||
|
dbfull()->GetColumnFamilyMetaData(dbfull()->DefaultColumnFamily(), &cf_meta);
|
||||||
|
ASSERT_EQ(2, cf_meta.levels[1].files.size());
|
||||||
|
std::vector<std::string> input_filenames;
|
||||||
|
for (const auto& sst_file : cf_meta.levels[1].files) {
|
||||||
|
input_filenames.push_back(sst_file.name);
|
||||||
|
}
|
||||||
|
|
||||||
|
// note CompactionOptions::output_file_size_limit is unset.
|
||||||
|
CompactionOptions compact_opt;
|
||||||
|
compact_opt.compression = kNoCompression;
|
||||||
|
dbfull()->CompactFiles(compact_opt, input_filenames, 1);
|
||||||
|
}
|
||||||
|
|
||||||
// Check that writes done during a memtable compaction are recovered
|
// Check that writes done during a memtable compaction are recovered
|
||||||
// if the database is shutdown during the memtable compaction.
|
// if the database is shutdown during the memtable compaction.
|
||||||
TEST_F(DBCompactionTest, RecoverDuringMemtableCompaction) {
|
TEST_F(DBCompactionTest, RecoverDuringMemtableCompaction) {
|
||||||
@ -1843,6 +1884,47 @@ TEST_F(DBCompactionTest, L0_CompactionBug_Issue44_b) {
|
|||||||
} while (ChangeCompactOptions());
|
} while (ChangeCompactOptions());
|
||||||
}
|
}
|
||||||
|
|
||||||
|
TEST_F(DBCompactionTest, ManualAutoRace) {
|
||||||
|
CreateAndReopenWithCF({"pikachu"}, CurrentOptions());
|
||||||
|
rocksdb::SyncPoint::GetInstance()->LoadDependency(
|
||||||
|
{{"DBImpl::BGWorkCompaction", "DBCompactionTest::ManualAutoRace:1"},
|
||||||
|
{"DBImpl::RunManualCompaction:WaitScheduled",
|
||||||
|
"BackgroundCallCompaction:0"}});
|
||||||
|
|
||||||
|
rocksdb::SyncPoint::GetInstance()->EnableProcessing();
|
||||||
|
|
||||||
|
Put(1, "foo", "");
|
||||||
|
Put(1, "bar", "");
|
||||||
|
Flush(1);
|
||||||
|
Put(1, "foo", "");
|
||||||
|
Put(1, "bar", "");
|
||||||
|
// Generate four files in CF 0, which should trigger an auto compaction
|
||||||
|
Put("foo", "");
|
||||||
|
Put("bar", "");
|
||||||
|
Flush();
|
||||||
|
Put("foo", "");
|
||||||
|
Put("bar", "");
|
||||||
|
Flush();
|
||||||
|
Put("foo", "");
|
||||||
|
Put("bar", "");
|
||||||
|
Flush();
|
||||||
|
Put("foo", "");
|
||||||
|
Put("bar", "");
|
||||||
|
Flush();
|
||||||
|
|
||||||
|
// The auto compaction is scheduled but waited until here
|
||||||
|
TEST_SYNC_POINT("DBCompactionTest::ManualAutoRace:1");
|
||||||
|
// The auto compaction will wait until the the manual compaction is registerd
|
||||||
|
// before processing so that it will be cancelled.
|
||||||
|
dbfull()->CompactRange(CompactRangeOptions(), handles_[1], nullptr, nullptr);
|
||||||
|
ASSERT_EQ("0,1", FilesPerLevel(1));
|
||||||
|
|
||||||
|
// Eventually the cancelled compaction will be rescheduled and executed.
|
||||||
|
dbfull()->TEST_WaitForCompact();
|
||||||
|
ASSERT_EQ("0,1", FilesPerLevel(0));
|
||||||
|
rocksdb::SyncPoint::GetInstance()->DisableProcessing();
|
||||||
|
}
|
||||||
|
|
||||||
TEST_P(DBCompactionTestWithParam, ManualCompaction) {
|
TEST_P(DBCompactionTestWithParam, ManualCompaction) {
|
||||||
Options options = CurrentOptions();
|
Options options = CurrentOptions();
|
||||||
options.max_subcompactions = max_subcompactions_;
|
options.max_subcompactions = max_subcompactions_;
|
||||||
@ -2521,14 +2603,12 @@ TEST_P(DBCompactionTestWithParam, IntraL0Compaction) {
|
|||||||
// Files 6-9 are the longest span of available files for which
|
// Files 6-9 are the longest span of available files for which
|
||||||
// work-per-deleted-file decreases (see "score" row above).
|
// work-per-deleted-file decreases (see "score" row above).
|
||||||
for (int i = 0; i < 10; ++i) {
|
for (int i = 0; i < 10; ++i) {
|
||||||
for (int j = 0; j < 2; ++j) {
|
|
||||||
ASSERT_OK(Put(Key(0), "")); // prevents trivial move
|
ASSERT_OK(Put(Key(0), "")); // prevents trivial move
|
||||||
if (i == 5) {
|
if (i == 5) {
|
||||||
ASSERT_OK(Put(Key(i + 1), value + value));
|
ASSERT_OK(Put(Key(i + 1), value + value));
|
||||||
} else {
|
} else {
|
||||||
ASSERT_OK(Put(Key(i + 1), value));
|
ASSERT_OK(Put(Key(i + 1), value));
|
||||||
}
|
}
|
||||||
}
|
|
||||||
ASSERT_OK(Flush());
|
ASSERT_OK(Flush());
|
||||||
}
|
}
|
||||||
dbfull()->TEST_WaitForCompact();
|
dbfull()->TEST_WaitForCompact();
|
||||||
@ -2542,16 +2622,116 @@ TEST_P(DBCompactionTestWithParam, IntraL0Compaction) {
|
|||||||
ASSERT_EQ(2, level_to_files[0].size());
|
ASSERT_EQ(2, level_to_files[0].size());
|
||||||
ASSERT_GT(level_to_files[1].size(), 0);
|
ASSERT_GT(level_to_files[1].size(), 0);
|
||||||
for (int i = 0; i < 2; ++i) {
|
for (int i = 0; i < 2; ++i) {
|
||||||
ASSERT_GE(level_to_files[0][0].fd.file_size, 1 << 21);
|
ASSERT_GE(level_to_files[0][i].fd.file_size, 1 << 21);
|
||||||
}
|
}
|
||||||
}
|
}
|
||||||
|
|
||||||
|
TEST_P(DBCompactionTestWithParam, IntraL0CompactionDoesNotObsoleteDeletions) {
|
||||||
|
// regression test for issue #2722: L0->L0 compaction can resurrect deleted
|
||||||
|
// keys from older L0 files if L1+ files' key-ranges do not include the key.
|
||||||
|
Options options = CurrentOptions();
|
||||||
|
options.compression = kNoCompression;
|
||||||
|
options.level0_file_num_compaction_trigger = 5;
|
||||||
|
options.max_background_compactions = 2;
|
||||||
|
options.max_subcompactions = max_subcompactions_;
|
||||||
|
DestroyAndReopen(options);
|
||||||
|
|
||||||
|
const size_t kValueSize = 1 << 20;
|
||||||
|
Random rnd(301);
|
||||||
|
std::string value(RandomString(&rnd, kValueSize));
|
||||||
|
|
||||||
|
rocksdb::SyncPoint::GetInstance()->LoadDependency(
|
||||||
|
{{"LevelCompactionPicker::PickCompactionBySize:0",
|
||||||
|
"CompactionJob::Run():Start"}});
|
||||||
|
rocksdb::SyncPoint::GetInstance()->EnableProcessing();
|
||||||
|
|
||||||
|
// index: 0 1 2 3 4 5 6 7 8 9
|
||||||
|
// size: 1MB 1MB 1MB 1MB 1MB 1MB 1MB 1MB 1MB 1MB
|
||||||
|
// score: 1.25 1.33 1.5 2.0 inf
|
||||||
|
//
|
||||||
|
// Files 0-4 will be included in an L0->L1 compaction.
|
||||||
|
//
|
||||||
|
// L0->L0 will be triggered since the sync points guarantee compaction to base
|
||||||
|
// level is still blocked when files 5-9 trigger another compaction. All files
|
||||||
|
// 5-9 are included in the L0->L0 due to work-per-deleted file decreasing.
|
||||||
|
//
|
||||||
|
// Put a key-value in files 0-4. Delete that key in files 5-9. Verify the
|
||||||
|
// L0->L0 preserves the deletion such that the key remains deleted.
|
||||||
|
for (int i = 0; i < 10; ++i) {
|
||||||
|
// key 0 serves both to prevent trivial move and as the key we want to
|
||||||
|
// verify is not resurrected by L0->L0 compaction.
|
||||||
|
if (i < 5) {
|
||||||
|
ASSERT_OK(Put(Key(0), ""));
|
||||||
|
} else {
|
||||||
|
ASSERT_OK(Delete(Key(0)));
|
||||||
|
}
|
||||||
|
ASSERT_OK(Put(Key(i + 1), value));
|
||||||
|
ASSERT_OK(Flush());
|
||||||
|
}
|
||||||
|
dbfull()->TEST_WaitForCompact();
|
||||||
|
rocksdb::SyncPoint::GetInstance()->DisableProcessing();
|
||||||
|
|
||||||
|
std::vector<std::vector<FileMetaData>> level_to_files;
|
||||||
|
dbfull()->TEST_GetFilesMetaData(dbfull()->DefaultColumnFamily(),
|
||||||
|
&level_to_files);
|
||||||
|
ASSERT_GE(level_to_files.size(), 2); // at least L0 and L1
|
||||||
|
// L0 has a single output file from L0->L0
|
||||||
|
ASSERT_EQ(1, level_to_files[0].size());
|
||||||
|
ASSERT_GT(level_to_files[1].size(), 0);
|
||||||
|
ASSERT_GE(level_to_files[0][0].fd.file_size, 1 << 22);
|
||||||
|
|
||||||
|
ReadOptions roptions;
|
||||||
|
std::string result;
|
||||||
|
ASSERT_TRUE(db_->Get(roptions, Key(0), &result).IsNotFound());
|
||||||
|
}
|
||||||
|
|
||||||
INSTANTIATE_TEST_CASE_P(DBCompactionTestWithParam, DBCompactionTestWithParam,
|
INSTANTIATE_TEST_CASE_P(DBCompactionTestWithParam, DBCompactionTestWithParam,
|
||||||
::testing::Values(std::make_tuple(1, true),
|
::testing::Values(std::make_tuple(1, true),
|
||||||
std::make_tuple(1, false),
|
std::make_tuple(1, false),
|
||||||
std::make_tuple(4, true),
|
std::make_tuple(4, true),
|
||||||
std::make_tuple(4, false)));
|
std::make_tuple(4, false)));
|
||||||
|
|
||||||
|
TEST_P(DBCompactionDirectIOTest, DirectIO) {
|
||||||
|
Options options = CurrentOptions();
|
||||||
|
Destroy(options);
|
||||||
|
options.create_if_missing = true;
|
||||||
|
options.disable_auto_compactions = true;
|
||||||
|
options.use_direct_io_for_flush_and_compaction = GetParam();
|
||||||
|
options.env = new MockEnv(Env::Default());
|
||||||
|
Reopen(options);
|
||||||
|
bool readahead = false;
|
||||||
|
SyncPoint::GetInstance()->SetCallBack(
|
||||||
|
"TableCache::NewIterator:for_compaction", [&](void* arg) {
|
||||||
|
bool* use_direct_reads = static_cast<bool*>(arg);
|
||||||
|
ASSERT_EQ(*use_direct_reads,
|
||||||
|
options.use_direct_io_for_flush_and_compaction);
|
||||||
|
});
|
||||||
|
SyncPoint::GetInstance()->SetCallBack(
|
||||||
|
"CompactionJob::OpenCompactionOutputFile", [&](void* arg) {
|
||||||
|
bool* use_direct_writes = static_cast<bool*>(arg);
|
||||||
|
ASSERT_EQ(*use_direct_writes,
|
||||||
|
options.use_direct_io_for_flush_and_compaction);
|
||||||
|
});
|
||||||
|
if (options.use_direct_io_for_flush_and_compaction) {
|
||||||
|
SyncPoint::GetInstance()->SetCallBack(
|
||||||
|
"SanitizeOptions:direct_io", [&](void* arg) {
|
||||||
|
readahead = true;
|
||||||
|
});
|
||||||
|
}
|
||||||
|
SyncPoint::GetInstance()->EnableProcessing();
|
||||||
|
CreateAndReopenWithCF({"pikachu"}, options);
|
||||||
|
MakeTables(3, "p", "q", 1);
|
||||||
|
ASSERT_EQ("1,1,1", FilesPerLevel(1));
|
||||||
|
Compact(1, "p1", "p9");
|
||||||
|
ASSERT_FALSE(readahead ^ options.use_direct_io_for_flush_and_compaction);
|
||||||
|
ASSERT_EQ("0,0,1", FilesPerLevel(1));
|
||||||
|
Destroy(options);
|
||||||
|
delete options.env;
|
||||||
|
}
|
||||||
|
|
||||||
|
INSTANTIATE_TEST_CASE_P(DBCompactionDirectIOTest, DBCompactionDirectIOTest,
|
||||||
|
testing::Bool());
|
||||||
|
|
||||||
class CompactionPriTest : public DBTestBase,
|
class CompactionPriTest : public DBTestBase,
|
||||||
public testing::WithParamInterface<uint32_t> {
|
public testing::WithParamInterface<uint32_t> {
|
||||||
public:
|
public:
|
||||||
|
@ -1,7 +1,7 @@
|
|||||||
// Copyright (c) 2011-present, Facebook, Inc. All rights reserved.
|
// Copyright (c) 2011-present, Facebook, Inc. All rights reserved.
|
||||||
// This source code is licensed under the BSD-style license found in the
|
// This source code is licensed under both the GPLv2 (found in the
|
||||||
// LICENSE file in the root directory of this source tree. An additional grant
|
// COPYING file in the root directory) and Apache 2.0 License
|
||||||
// of patent rights can be found in the PATENTS file in the same directory.
|
// (found in the LICENSE.Apache file in the root directory).
|
||||||
//
|
//
|
||||||
// Copyright (c) 2011 The LevelDB Authors. All rights reserved.
|
// Copyright (c) 2011 The LevelDB Authors. All rights reserved.
|
||||||
// Use of this source code is governed by a BSD-style license that can be
|
// Use of this source code is governed by a BSD-style license that can be
|
||||||
|
@ -1,11 +1,8 @@
|
|||||||
// Copyright (c) 2011-present, Facebook, Inc. All rights reserved.
|
// Copyright (c) 2011-present, Facebook, Inc. All rights reserved.
|
||||||
// This source code is licensed under the BSD-style license found in the
|
// This source code is licensed under both the GPLv2 (found in the
|
||||||
// LICENSE file in the root directory of this source tree. An additional grant
|
// COPYING file in the root directory) and Apache 2.0 License
|
||||||
// of patent rights can be found in the PATENTS file in the same directory.
|
// (found in the LICENSE.Apache file in the root directory).
|
||||||
//
|
//
|
||||||
// Copyright (c) 2012 Facebook.
|
|
||||||
// Use of this source code is governed by a BSD-style license that can be
|
|
||||||
// found in the LICENSE file.
|
|
||||||
|
|
||||||
#ifndef ROCKSDB_LITE
|
#ifndef ROCKSDB_LITE
|
||||||
|
|
||||||
|
@ -1,7 +1,7 @@
|
|||||||
// Copyright (c) 2011-present, Facebook, Inc. All rights reserved.
|
// Copyright (c) 2011-present, Facebook, Inc. All rights reserved.
|
||||||
// This source code is licensed under the BSD-style license found in the
|
// This source code is licensed under both the GPLv2 (found in the
|
||||||
// LICENSE file in the root directory of this source tree. An additional grant
|
// COPYING file in the root directory) and Apache 2.0 License
|
||||||
// of patent rights can be found in the PATENTS file in the same directory.
|
// (found in the LICENSE.Apache file in the root directory).
|
||||||
//
|
//
|
||||||
// Copyright (c) 2011 The LevelDB Authors. All rights reserved.
|
// Copyright (c) 2011 The LevelDB Authors. All rights reserved.
|
||||||
// Use of this source code is governed by a BSD-style license that can be
|
// Use of this source code is governed by a BSD-style license that can be
|
||||||
@ -19,6 +19,12 @@ class DBFlushTest : public DBTestBase {
|
|||||||
DBFlushTest() : DBTestBase("/db_flush_test") {}
|
DBFlushTest() : DBTestBase("/db_flush_test") {}
|
||||||
};
|
};
|
||||||
|
|
||||||
|
class DBFlushDirectIOTest : public DBFlushTest,
|
||||||
|
public ::testing::WithParamInterface<bool> {
|
||||||
|
public:
|
||||||
|
DBFlushDirectIOTest() : DBFlushTest() {}
|
||||||
|
};
|
||||||
|
|
||||||
// We had issue when two background threads trying to flush at the same time,
|
// We had issue when two background threads trying to flush at the same time,
|
||||||
// only one of them get committed. The test verifies the issue is fixed.
|
// only one of them get committed. The test verifies the issue is fixed.
|
||||||
TEST_F(DBFlushTest, FlushWhileWritingManifest) {
|
TEST_F(DBFlushTest, FlushWhileWritingManifest) {
|
||||||
@ -83,6 +89,33 @@ TEST_F(DBFlushTest, SyncFail) {
|
|||||||
Destroy(options);
|
Destroy(options);
|
||||||
}
|
}
|
||||||
|
|
||||||
|
TEST_P(DBFlushDirectIOTest, DirectIO) {
|
||||||
|
Options options;
|
||||||
|
options.create_if_missing = true;
|
||||||
|
options.disable_auto_compactions = true;
|
||||||
|
options.max_background_flushes = 2;
|
||||||
|
options.use_direct_io_for_flush_and_compaction = GetParam();
|
||||||
|
options.env = new MockEnv(Env::Default());
|
||||||
|
SyncPoint::GetInstance()->SetCallBack(
|
||||||
|
"BuildTable:create_file", [&](void* arg) {
|
||||||
|
bool* use_direct_writes = static_cast<bool*>(arg);
|
||||||
|
ASSERT_EQ(*use_direct_writes,
|
||||||
|
options.use_direct_io_for_flush_and_compaction);
|
||||||
|
});
|
||||||
|
|
||||||
|
SyncPoint::GetInstance()->EnableProcessing();
|
||||||
|
Reopen(options);
|
||||||
|
ASSERT_OK(Put("foo", "v"));
|
||||||
|
FlushOptions flush_options;
|
||||||
|
flush_options.wait = true;
|
||||||
|
ASSERT_OK(dbfull()->Flush(flush_options));
|
||||||
|
Destroy(options);
|
||||||
|
delete options.env;
|
||||||
|
}
|
||||||
|
|
||||||
|
INSTANTIATE_TEST_CASE_P(DBFlushDirectIOTest, DBFlushDirectIOTest,
|
||||||
|
testing::Bool());
|
||||||
|
|
||||||
} // namespace rocksdb
|
} // namespace rocksdb
|
||||||
|
|
||||||
int main(int argc, char** argv) {
|
int main(int argc, char** argv) {
|
||||||
|
238
db/db_impl.cc
238
db/db_impl.cc
@ -1,7 +1,7 @@
|
|||||||
// Copyright (c) 2011-present, Facebook, Inc. All rights reserved.
|
// Copyright (c) 2011-present, Facebook, Inc. All rights reserved.
|
||||||
// This source code is licensed under the BSD-style license found in the
|
// This source code is licensed under both the GPLv2 (found in the
|
||||||
// LICENSE file in the root directory of this source tree. An additional grant
|
// COPYING file in the root directory) and Apache 2.0 License
|
||||||
// of patent rights can be found in the PATENTS file in the same directory.
|
// (found in the LICENSE.Apache file in the root directory).
|
||||||
//
|
//
|
||||||
// Copyright (c) 2011 The LevelDB Authors. All rights reserved.
|
// Copyright (c) 2011 The LevelDB Authors. All rights reserved.
|
||||||
// Use of this source code is governed by a BSD-style license that can be
|
// Use of this source code is governed by a BSD-style license that can be
|
||||||
@ -514,9 +514,8 @@ Status DBImpl::SetOptions(ColumnFamilyHandle* column_family,
|
|||||||
InstallSuperVersionAndScheduleWork(cfd, nullptr, new_options);
|
InstallSuperVersionAndScheduleWork(cfd, nullptr, new_options);
|
||||||
delete old_sv;
|
delete old_sv;
|
||||||
|
|
||||||
write_thread_.EnterUnbatched(&w, &mutex_);
|
persist_options_status = WriteOptionsFile(
|
||||||
persist_options_status = WriteOptionsFile();
|
false /*need_mutex_lock*/, true /*need_enter_write_thread*/);
|
||||||
write_thread_.ExitUnbatched(&w);
|
|
||||||
}
|
}
|
||||||
}
|
}
|
||||||
|
|
||||||
@ -532,14 +531,7 @@ Status DBImpl::SetOptions(ColumnFamilyHandle* column_family,
|
|||||||
"[%s] SetOptions() succeeded", cfd->GetName().c_str());
|
"[%s] SetOptions() succeeded", cfd->GetName().c_str());
|
||||||
new_options.Dump(immutable_db_options_.info_log.get());
|
new_options.Dump(immutable_db_options_.info_log.get());
|
||||||
if (!persist_options_status.ok()) {
|
if (!persist_options_status.ok()) {
|
||||||
if (immutable_db_options_.fail_if_options_file_error) {
|
s = persist_options_status;
|
||||||
s = Status::IOError(
|
|
||||||
"SetOptions() succeeded, but unable to persist options",
|
|
||||||
persist_options_status.ToString());
|
|
||||||
}
|
|
||||||
ROCKS_LOG_WARN(immutable_db_options_.info_log,
|
|
||||||
"Unable to persist options in SetOptions() -- %s",
|
|
||||||
persist_options_status.ToString().c_str());
|
|
||||||
}
|
}
|
||||||
} else {
|
} else {
|
||||||
ROCKS_LOG_WARN(immutable_db_options_.info_log, "[%s] SetOptions() failed",
|
ROCKS_LOG_WARN(immutable_db_options_.info_log, "[%s] SetOptions() failed",
|
||||||
@ -591,7 +583,8 @@ Status DBImpl::SetDBOptions(
|
|||||||
purge_wal_status.ToString().c_str());
|
purge_wal_status.ToString().c_str());
|
||||||
}
|
}
|
||||||
}
|
}
|
||||||
persist_options_status = WriteOptionsFile();
|
persist_options_status = WriteOptionsFile(
|
||||||
|
false /*need_mutex_lock*/, false /*need_enter_write_thread*/);
|
||||||
write_thread_.ExitUnbatched(&w);
|
write_thread_.ExitUnbatched(&w);
|
||||||
}
|
}
|
||||||
}
|
}
|
||||||
@ -1121,6 +1114,74 @@ std::vector<Status> DBImpl::MultiGet(
|
|||||||
}
|
}
|
||||||
|
|
||||||
Status DBImpl::CreateColumnFamily(const ColumnFamilyOptions& cf_options,
|
Status DBImpl::CreateColumnFamily(const ColumnFamilyOptions& cf_options,
|
||||||
|
const std::string& column_family,
|
||||||
|
ColumnFamilyHandle** handle) {
|
||||||
|
assert(handle != nullptr);
|
||||||
|
Status s = CreateColumnFamilyImpl(cf_options, column_family, handle);
|
||||||
|
if (s.ok()) {
|
||||||
|
s = WriteOptionsFile(true /*need_mutex_lock*/,
|
||||||
|
true /*need_enter_write_thread*/);
|
||||||
|
}
|
||||||
|
return s;
|
||||||
|
}
|
||||||
|
|
||||||
|
Status DBImpl::CreateColumnFamilies(
|
||||||
|
const ColumnFamilyOptions& cf_options,
|
||||||
|
const std::vector<std::string>& column_family_names,
|
||||||
|
std::vector<ColumnFamilyHandle*>* handles) {
|
||||||
|
assert(handles != nullptr);
|
||||||
|
handles->clear();
|
||||||
|
size_t num_cf = column_family_names.size();
|
||||||
|
Status s;
|
||||||
|
bool success_once = false;
|
||||||
|
for (size_t i = 0; i < num_cf; i++) {
|
||||||
|
ColumnFamilyHandle* handle;
|
||||||
|
s = CreateColumnFamilyImpl(cf_options, column_family_names[i], &handle);
|
||||||
|
if (!s.ok()) {
|
||||||
|
break;
|
||||||
|
}
|
||||||
|
handles->push_back(handle);
|
||||||
|
success_once = true;
|
||||||
|
}
|
||||||
|
if (success_once) {
|
||||||
|
Status persist_options_status = WriteOptionsFile(
|
||||||
|
true /*need_mutex_lock*/, true /*need_enter_write_thread*/);
|
||||||
|
if (s.ok() && !persist_options_status.ok()) {
|
||||||
|
s = persist_options_status;
|
||||||
|
}
|
||||||
|
}
|
||||||
|
return s;
|
||||||
|
}
|
||||||
|
|
||||||
|
Status DBImpl::CreateColumnFamilies(
|
||||||
|
const std::vector<ColumnFamilyDescriptor>& column_families,
|
||||||
|
std::vector<ColumnFamilyHandle*>* handles) {
|
||||||
|
assert(handles != nullptr);
|
||||||
|
handles->clear();
|
||||||
|
size_t num_cf = column_families.size();
|
||||||
|
Status s;
|
||||||
|
bool success_once = false;
|
||||||
|
for (size_t i = 0; i < num_cf; i++) {
|
||||||
|
ColumnFamilyHandle* handle;
|
||||||
|
s = CreateColumnFamilyImpl(column_families[i].options,
|
||||||
|
column_families[i].name, &handle);
|
||||||
|
if (!s.ok()) {
|
||||||
|
break;
|
||||||
|
}
|
||||||
|
handles->push_back(handle);
|
||||||
|
success_once = true;
|
||||||
|
}
|
||||||
|
if (success_once) {
|
||||||
|
Status persist_options_status = WriteOptionsFile(
|
||||||
|
true /*need_mutex_lock*/, true /*need_enter_write_thread*/);
|
||||||
|
if (s.ok() && !persist_options_status.ok()) {
|
||||||
|
s = persist_options_status;
|
||||||
|
}
|
||||||
|
}
|
||||||
|
return s;
|
||||||
|
}
|
||||||
|
|
||||||
|
Status DBImpl::CreateColumnFamilyImpl(const ColumnFamilyOptions& cf_options,
|
||||||
const std::string& column_family_name,
|
const std::string& column_family_name,
|
||||||
ColumnFamilyHandle** handle) {
|
ColumnFamilyHandle** handle) {
|
||||||
Status s;
|
Status s;
|
||||||
@ -1159,12 +1220,6 @@ Status DBImpl::CreateColumnFamily(const ColumnFamilyOptions& cf_options,
|
|||||||
s = versions_->LogAndApply(nullptr, MutableCFOptions(cf_options), &edit,
|
s = versions_->LogAndApply(nullptr, MutableCFOptions(cf_options), &edit,
|
||||||
&mutex_, directories_.GetDbDir(), false,
|
&mutex_, directories_.GetDbDir(), false,
|
||||||
&cf_options);
|
&cf_options);
|
||||||
|
|
||||||
if (s.ok()) {
|
|
||||||
// If the column family was created successfully, we then persist
|
|
||||||
// the updated RocksDB options under the same single write thread
|
|
||||||
persist_options_status = WriteOptionsFile();
|
|
||||||
}
|
|
||||||
write_thread_.ExitUnbatched(&w);
|
write_thread_.ExitUnbatched(&w);
|
||||||
}
|
}
|
||||||
if (s.ok()) {
|
if (s.ok()) {
|
||||||
@ -1194,22 +1249,42 @@ Status DBImpl::CreateColumnFamily(const ColumnFamilyOptions& cf_options,
|
|||||||
if (s.ok()) {
|
if (s.ok()) {
|
||||||
NewThreadStatusCfInfo(
|
NewThreadStatusCfInfo(
|
||||||
reinterpret_cast<ColumnFamilyHandleImpl*>(*handle)->cfd());
|
reinterpret_cast<ColumnFamilyHandleImpl*>(*handle)->cfd());
|
||||||
if (!persist_options_status.ok()) {
|
|
||||||
if (immutable_db_options_.fail_if_options_file_error) {
|
|
||||||
s = Status::IOError(
|
|
||||||
"ColumnFamily has been created, but unable to persist"
|
|
||||||
"options in CreateColumnFamily()",
|
|
||||||
persist_options_status.ToString().c_str());
|
|
||||||
}
|
|
||||||
ROCKS_LOG_WARN(immutable_db_options_.info_log,
|
|
||||||
"Unable to persist options in CreateColumnFamily() -- %s",
|
|
||||||
persist_options_status.ToString().c_str());
|
|
||||||
}
|
|
||||||
}
|
}
|
||||||
return s;
|
return s;
|
||||||
}
|
}
|
||||||
|
|
||||||
Status DBImpl::DropColumnFamily(ColumnFamilyHandle* column_family) {
|
Status DBImpl::DropColumnFamily(ColumnFamilyHandle* column_family) {
|
||||||
|
assert(column_family != nullptr);
|
||||||
|
Status s = DropColumnFamilyImpl(column_family);
|
||||||
|
if (s.ok()) {
|
||||||
|
s = WriteOptionsFile(true /*need_mutex_lock*/,
|
||||||
|
true /*need_enter_write_thread*/);
|
||||||
|
}
|
||||||
|
return s;
|
||||||
|
}
|
||||||
|
|
||||||
|
Status DBImpl::DropColumnFamilies(
|
||||||
|
const std::vector<ColumnFamilyHandle*>& column_families) {
|
||||||
|
Status s;
|
||||||
|
bool success_once = false;
|
||||||
|
for (auto* handle : column_families) {
|
||||||
|
s = DropColumnFamilyImpl(handle);
|
||||||
|
if (!s.ok()) {
|
||||||
|
break;
|
||||||
|
}
|
||||||
|
success_once = true;
|
||||||
|
}
|
||||||
|
if (success_once) {
|
||||||
|
Status persist_options_status = WriteOptionsFile(
|
||||||
|
true /*need_mutex_lock*/, true /*need_enter_write_thread*/);
|
||||||
|
if (s.ok() && !persist_options_status.ok()) {
|
||||||
|
s = persist_options_status;
|
||||||
|
}
|
||||||
|
}
|
||||||
|
return s;
|
||||||
|
}
|
||||||
|
|
||||||
|
Status DBImpl::DropColumnFamilyImpl(ColumnFamilyHandle* column_family) {
|
||||||
auto cfh = reinterpret_cast<ColumnFamilyHandleImpl*>(column_family);
|
auto cfh = reinterpret_cast<ColumnFamilyHandleImpl*>(column_family);
|
||||||
auto cfd = cfh->cfd();
|
auto cfd = cfh->cfd();
|
||||||
if (cfd->GetID() == 0) {
|
if (cfd->GetID() == 0) {
|
||||||
@ -1223,7 +1298,6 @@ Status DBImpl::DropColumnFamily(ColumnFamilyHandle* column_family) {
|
|||||||
edit.SetColumnFamily(cfd->GetID());
|
edit.SetColumnFamily(cfd->GetID());
|
||||||
|
|
||||||
Status s;
|
Status s;
|
||||||
Status options_persist_status;
|
|
||||||
{
|
{
|
||||||
InstrumentedMutexLock l(&mutex_);
|
InstrumentedMutexLock l(&mutex_);
|
||||||
if (cfd->IsDropped()) {
|
if (cfd->IsDropped()) {
|
||||||
@ -1235,11 +1309,6 @@ Status DBImpl::DropColumnFamily(ColumnFamilyHandle* column_family) {
|
|||||||
write_thread_.EnterUnbatched(&w, &mutex_);
|
write_thread_.EnterUnbatched(&w, &mutex_);
|
||||||
s = versions_->LogAndApply(cfd, *cfd->GetLatestMutableCFOptions(),
|
s = versions_->LogAndApply(cfd, *cfd->GetLatestMutableCFOptions(),
|
||||||
&edit, &mutex_);
|
&edit, &mutex_);
|
||||||
if (s.ok()) {
|
|
||||||
// If the column family was dropped successfully, we then persist
|
|
||||||
// the updated RocksDB options under the same single write thread
|
|
||||||
options_persist_status = WriteOptionsFile();
|
|
||||||
}
|
|
||||||
write_thread_.ExitUnbatched(&w);
|
write_thread_.ExitUnbatched(&w);
|
||||||
}
|
}
|
||||||
|
|
||||||
@ -1268,18 +1337,6 @@ Status DBImpl::DropColumnFamily(ColumnFamilyHandle* column_family) {
|
|||||||
mutable_cf_options->max_write_buffer_number;
|
mutable_cf_options->max_write_buffer_number;
|
||||||
ROCKS_LOG_INFO(immutable_db_options_.info_log,
|
ROCKS_LOG_INFO(immutable_db_options_.info_log,
|
||||||
"Dropped column family with id %u\n", cfd->GetID());
|
"Dropped column family with id %u\n", cfd->GetID());
|
||||||
|
|
||||||
if (!options_persist_status.ok()) {
|
|
||||||
if (immutable_db_options_.fail_if_options_file_error) {
|
|
||||||
s = Status::IOError(
|
|
||||||
"ColumnFamily has been dropped, but unable to persist "
|
|
||||||
"options in DropColumnFamily()",
|
|
||||||
options_persist_status.ToString().c_str());
|
|
||||||
}
|
|
||||||
ROCKS_LOG_WARN(immutable_db_options_.info_log,
|
|
||||||
"Unable to persist options in DropColumnFamily() -- %s",
|
|
||||||
options_persist_status.ToString().c_str());
|
|
||||||
}
|
|
||||||
} else {
|
} else {
|
||||||
ROCKS_LOG_ERROR(immutable_db_options_.info_log,
|
ROCKS_LOG_ERROR(immutable_db_options_.info_log,
|
||||||
"Dropping column family with id %u FAILED -- %s\n",
|
"Dropping column family with id %u FAILED -- %s\n",
|
||||||
@ -1515,6 +1572,14 @@ void DBImpl::ReleaseSnapshot(const Snapshot* s) {
|
|||||||
delete casted_s;
|
delete casted_s;
|
||||||
}
|
}
|
||||||
|
|
||||||
|
bool DBImpl::HasActiveSnapshotLaterThanSN(SequenceNumber sn) {
|
||||||
|
InstrumentedMutexLock l(&mutex_);
|
||||||
|
if (snapshots_.empty()) {
|
||||||
|
return false;
|
||||||
|
}
|
||||||
|
return (snapshots_.newest()->GetSequenceNumber() > sn);
|
||||||
|
}
|
||||||
|
|
||||||
#ifndef ROCKSDB_LITE
|
#ifndef ROCKSDB_LITE
|
||||||
Status DBImpl::GetPropertiesOfAllTables(ColumnFamilyHandle* column_family,
|
Status DBImpl::GetPropertiesOfAllTables(ColumnFamilyHandle* column_family,
|
||||||
TablePropertiesCollection* props) {
|
TablePropertiesCollection* props) {
|
||||||
@ -1666,6 +1731,16 @@ bool DBImpl::GetIntPropertyInternal(ColumnFamilyData* cfd,
|
|||||||
}
|
}
|
||||||
}
|
}
|
||||||
|
|
||||||
|
#ifndef ROCKSDB_LITE
|
||||||
|
Status DBImpl::ResetStats() {
|
||||||
|
InstrumentedMutexLock l(&mutex_);
|
||||||
|
for (auto* cfd : *versions_->GetColumnFamilySet()) {
|
||||||
|
cfd->internal_stats()->Clear();
|
||||||
|
}
|
||||||
|
return Status::OK();
|
||||||
|
}
|
||||||
|
#endif // ROCKSDB_LITE
|
||||||
|
|
||||||
bool DBImpl::GetAggregatedIntProperty(const Slice& property,
|
bool DBImpl::GetAggregatedIntProperty(const Slice& property,
|
||||||
uint64_t* aggregated_value) {
|
uint64_t* aggregated_value) {
|
||||||
const DBPropertyInfo* property_info = GetPropertyInfo(property);
|
const DBPropertyInfo* property_info = GetPropertyInfo(property);
|
||||||
@ -1749,6 +1824,20 @@ ColumnFamilyHandle* DBImpl::GetColumnFamilyHandle(uint32_t column_family_id) {
|
|||||||
return cf_memtables->GetColumnFamilyHandle();
|
return cf_memtables->GetColumnFamilyHandle();
|
||||||
}
|
}
|
||||||
|
|
||||||
|
// REQUIRED: mutex is NOT held.
|
||||||
|
ColumnFamilyHandle* DBImpl::GetColumnFamilyHandleUnlocked(
|
||||||
|
uint32_t column_family_id) {
|
||||||
|
ColumnFamilyMemTables* cf_memtables = column_family_memtables_.get();
|
||||||
|
|
||||||
|
InstrumentedMutexLock l(&mutex_);
|
||||||
|
|
||||||
|
if (!cf_memtables->Seek(column_family_id)) {
|
||||||
|
return nullptr;
|
||||||
|
}
|
||||||
|
|
||||||
|
return cf_memtables->GetColumnFamilyHandle();
|
||||||
|
}
|
||||||
|
|
||||||
void DBImpl::GetApproximateMemTableStats(ColumnFamilyHandle* column_family,
|
void DBImpl::GetApproximateMemTableStats(ColumnFamilyHandle* column_family,
|
||||||
const Range& range,
|
const Range& range,
|
||||||
uint64_t* const count,
|
uint64_t* const count,
|
||||||
@ -2097,9 +2186,29 @@ Status DB::CreateColumnFamily(const ColumnFamilyOptions& cf_options,
|
|||||||
ColumnFamilyHandle** handle) {
|
ColumnFamilyHandle** handle) {
|
||||||
return Status::NotSupported("");
|
return Status::NotSupported("");
|
||||||
}
|
}
|
||||||
|
|
||||||
|
Status DB::CreateColumnFamilies(
|
||||||
|
const ColumnFamilyOptions& cf_options,
|
||||||
|
const std::vector<std::string>& column_family_names,
|
||||||
|
std::vector<ColumnFamilyHandle*>* handles) {
|
||||||
|
return Status::NotSupported("");
|
||||||
|
}
|
||||||
|
|
||||||
|
Status DB::CreateColumnFamilies(
|
||||||
|
const std::vector<ColumnFamilyDescriptor>& column_families,
|
||||||
|
std::vector<ColumnFamilyHandle*>* handles) {
|
||||||
|
return Status::NotSupported("");
|
||||||
|
}
|
||||||
|
|
||||||
Status DB::DropColumnFamily(ColumnFamilyHandle* column_family) {
|
Status DB::DropColumnFamily(ColumnFamilyHandle* column_family) {
|
||||||
return Status::NotSupported("");
|
return Status::NotSupported("");
|
||||||
}
|
}
|
||||||
|
|
||||||
|
Status DB::DropColumnFamilies(
|
||||||
|
const std::vector<ColumnFamilyHandle*>& column_families) {
|
||||||
|
return Status::NotSupported("");
|
||||||
|
}
|
||||||
|
|
||||||
Status DB::DestroyColumnFamilyHandle(ColumnFamilyHandle* column_family) {
|
Status DB::DestroyColumnFamilyHandle(ColumnFamilyHandle* column_family) {
|
||||||
delete column_family;
|
delete column_family;
|
||||||
return Status::OK();
|
return Status::OK();
|
||||||
@ -2206,9 +2315,18 @@ Status DestroyDB(const std::string& dbname, const Options& options) {
|
|||||||
return result;
|
return result;
|
||||||
}
|
}
|
||||||
|
|
||||||
Status DBImpl::WriteOptionsFile() {
|
Status DBImpl::WriteOptionsFile(bool need_mutex_lock,
|
||||||
|
bool need_enter_write_thread) {
|
||||||
#ifndef ROCKSDB_LITE
|
#ifndef ROCKSDB_LITE
|
||||||
|
WriteThread::Writer w;
|
||||||
|
if (need_mutex_lock) {
|
||||||
|
mutex_.Lock();
|
||||||
|
} else {
|
||||||
mutex_.AssertHeld();
|
mutex_.AssertHeld();
|
||||||
|
}
|
||||||
|
if (need_enter_write_thread) {
|
||||||
|
write_thread_.EnterUnbatched(&w, &mutex_);
|
||||||
|
}
|
||||||
|
|
||||||
std::vector<std::string> cf_names;
|
std::vector<std::string> cf_names;
|
||||||
std::vector<ColumnFamilyOptions> cf_opts;
|
std::vector<ColumnFamilyOptions> cf_opts;
|
||||||
@ -2236,11 +2354,23 @@ Status DBImpl::WriteOptionsFile() {
|
|||||||
if (s.ok()) {
|
if (s.ok()) {
|
||||||
s = RenameTempFileToOptionsFile(file_name);
|
s = RenameTempFileToOptionsFile(file_name);
|
||||||
}
|
}
|
||||||
|
// restore lock
|
||||||
|
if (!need_mutex_lock) {
|
||||||
mutex_.Lock();
|
mutex_.Lock();
|
||||||
return s;
|
}
|
||||||
#else
|
if (need_enter_write_thread) {
|
||||||
return Status::OK();
|
write_thread_.ExitUnbatched(&w);
|
||||||
|
}
|
||||||
|
if (!s.ok()) {
|
||||||
|
ROCKS_LOG_WARN(immutable_db_options_.info_log,
|
||||||
|
"Unnable to persist options -- %s", s.ToString().c_str());
|
||||||
|
if (immutable_db_options_.fail_if_options_file_error) {
|
||||||
|
return Status::IOError("Unable to persist options.",
|
||||||
|
s.ToString().c_str());
|
||||||
|
}
|
||||||
|
}
|
||||||
#endif // !ROCKSDB_LITE
|
#endif // !ROCKSDB_LITE
|
||||||
|
return Status::OK();
|
||||||
}
|
}
|
||||||
|
|
||||||
#ifndef ROCKSDB_LITE
|
#ifndef ROCKSDB_LITE
|
||||||
|
48
db/db_impl.h
48
db/db_impl.h
@ -1,7 +1,7 @@
|
|||||||
// Copyright (c) 2011-present, Facebook, Inc. All rights reserved.
|
// Copyright (c) 2011-present, Facebook, Inc. All rights reserved.
|
||||||
// This source code is licensed under the BSD-style license found in the
|
// This source code is licensed under both the GPLv2 (found in the
|
||||||
// LICENSE file in the root directory of this source tree. An additional grant
|
// COPYING file in the root directory) and Apache 2.0 License
|
||||||
// of patent rights can be found in the PATENTS file in the same directory.
|
// (found in the LICENSE.Apache file in the root directory).
|
||||||
//
|
//
|
||||||
// Copyright (c) 2011 The LevelDB Authors. All rights reserved.
|
// Copyright (c) 2011 The LevelDB Authors. All rights reserved.
|
||||||
// Use of this source code is governed by a BSD-style license that can be
|
// Use of this source code is governed by a BSD-style license that can be
|
||||||
@ -100,10 +100,19 @@ class DBImpl : public DB {
|
|||||||
const std::vector<Slice>& keys,
|
const std::vector<Slice>& keys,
|
||||||
std::vector<std::string>* values) override;
|
std::vector<std::string>* values) override;
|
||||||
|
|
||||||
virtual Status CreateColumnFamily(const ColumnFamilyOptions& options,
|
virtual Status CreateColumnFamily(const ColumnFamilyOptions& cf_options,
|
||||||
const std::string& column_family,
|
const std::string& column_family,
|
||||||
ColumnFamilyHandle** handle) override;
|
ColumnFamilyHandle** handle) override;
|
||||||
|
virtual Status CreateColumnFamilies(
|
||||||
|
const ColumnFamilyOptions& cf_options,
|
||||||
|
const std::vector<std::string>& column_family_names,
|
||||||
|
std::vector<ColumnFamilyHandle*>* handles) override;
|
||||||
|
virtual Status CreateColumnFamilies(
|
||||||
|
const std::vector<ColumnFamilyDescriptor>& column_families,
|
||||||
|
std::vector<ColumnFamilyHandle*>* handles) override;
|
||||||
virtual Status DropColumnFamily(ColumnFamilyHandle* column_family) override;
|
virtual Status DropColumnFamily(ColumnFamilyHandle* column_family) override;
|
||||||
|
virtual Status DropColumnFamilies(
|
||||||
|
const std::vector<ColumnFamilyHandle*>& column_families) override;
|
||||||
|
|
||||||
// Returns false if key doesn't exist in the database and true if it may.
|
// Returns false if key doesn't exist in the database and true if it may.
|
||||||
// If value_found is not passed in as null, then return the value if found in
|
// If value_found is not passed in as null, then return the value if found in
|
||||||
@ -192,7 +201,11 @@ class DBImpl : public DB {
|
|||||||
|
|
||||||
virtual SequenceNumber GetLatestSequenceNumber() const override;
|
virtual SequenceNumber GetLatestSequenceNumber() const override;
|
||||||
|
|
||||||
|
bool HasActiveSnapshotLaterThanSN(SequenceNumber sn);
|
||||||
|
|
||||||
#ifndef ROCKSDB_LITE
|
#ifndef ROCKSDB_LITE
|
||||||
|
using DB::ResetStats;
|
||||||
|
virtual Status ResetStats() override;
|
||||||
virtual Status DisableFileDeletions() override;
|
virtual Status DisableFileDeletions() override;
|
||||||
virtual Status EnableFileDeletions(bool force) override;
|
virtual Status EnableFileDeletions(bool force) override;
|
||||||
virtual int IsFileDeletionsEnabled() const;
|
virtual int IsFileDeletionsEnabled() const;
|
||||||
@ -452,6 +465,9 @@ class DBImpl : public DB {
|
|||||||
// mutex is released.
|
// mutex is released.
|
||||||
ColumnFamilyHandle* GetColumnFamilyHandle(uint32_t column_family_id);
|
ColumnFamilyHandle* GetColumnFamilyHandle(uint32_t column_family_id);
|
||||||
|
|
||||||
|
// Same as above, should called without mutex held and not on write thread.
|
||||||
|
ColumnFamilyHandle* GetColumnFamilyHandleUnlocked(uint32_t column_family_id);
|
||||||
|
|
||||||
// Returns the number of currently running flushes.
|
// Returns the number of currently running flushes.
|
||||||
// REQUIREMENT: mutex_ must be held when calling this function.
|
// REQUIREMENT: mutex_ must be held when calling this function.
|
||||||
int num_running_flushes() {
|
int num_running_flushes() {
|
||||||
@ -547,9 +563,10 @@ class DBImpl : public DB {
|
|||||||
RangeDelAggregator* range_del_agg);
|
RangeDelAggregator* range_del_agg);
|
||||||
|
|
||||||
// Except in DB::Open(), WriteOptionsFile can only be called when:
|
// Except in DB::Open(), WriteOptionsFile can only be called when:
|
||||||
// 1. WriteThread::Writer::EnterUnbatched() is used.
|
// Persist options to options file.
|
||||||
// 2. db_mutex is held
|
// If need_mutex_lock = false, the method will lock DB mutex.
|
||||||
Status WriteOptionsFile();
|
// If need_enter_write_thread = false, the method will enter write thread.
|
||||||
|
Status WriteOptionsFile(bool need_mutex_lock, bool need_enter_write_thread);
|
||||||
|
|
||||||
// The following two functions can only be called when:
|
// The following two functions can only be called when:
|
||||||
// 1. WriteThread::Writer::EnterUnbatched() is used.
|
// 1. WriteThread::Writer::EnterUnbatched() is used.
|
||||||
@ -557,6 +574,10 @@ class DBImpl : public DB {
|
|||||||
Status RenameTempFileToOptionsFile(const std::string& file_name);
|
Status RenameTempFileToOptionsFile(const std::string& file_name);
|
||||||
Status DeleteObsoleteOptionsFiles();
|
Status DeleteObsoleteOptionsFiles();
|
||||||
|
|
||||||
|
void NotifyOnFlushBegin(ColumnFamilyData* cfd, FileMetaData* file_meta,
|
||||||
|
const MutableCFOptions& mutable_cf_options,
|
||||||
|
int job_id, TableProperties prop);
|
||||||
|
|
||||||
void NotifyOnFlushCompleted(ColumnFamilyData* cfd, FileMetaData* file_meta,
|
void NotifyOnFlushCompleted(ColumnFamilyData* cfd, FileMetaData* file_meta,
|
||||||
const MutableCFOptions& mutable_cf_options,
|
const MutableCFOptions& mutable_cf_options,
|
||||||
int job_id, TableProperties prop);
|
int job_id, TableProperties prop);
|
||||||
@ -628,6 +649,12 @@ class DBImpl : public DB {
|
|||||||
|
|
||||||
const Status CreateArchivalDirectory();
|
const Status CreateArchivalDirectory();
|
||||||
|
|
||||||
|
Status CreateColumnFamilyImpl(const ColumnFamilyOptions& cf_options,
|
||||||
|
const std::string& cf_name,
|
||||||
|
ColumnFamilyHandle** handle);
|
||||||
|
|
||||||
|
Status DropColumnFamilyImpl(ColumnFamilyHandle* column_family);
|
||||||
|
|
||||||
// Delete any unneeded files and stale in-memory entries.
|
// Delete any unneeded files and stale in-memory entries.
|
||||||
void DeleteObsoleteFiles();
|
void DeleteObsoleteFiles();
|
||||||
// Delete obsolete files and log status and information of file deletion
|
// Delete obsolete files and log status and information of file deletion
|
||||||
@ -1091,13 +1118,6 @@ class DBImpl : public DB {
|
|||||||
DBImpl(const DBImpl&);
|
DBImpl(const DBImpl&);
|
||||||
void operator=(const DBImpl&);
|
void operator=(const DBImpl&);
|
||||||
|
|
||||||
// Return the earliest snapshot where seqno is visible.
|
|
||||||
// Store the snapshot right before that, if any, in prev_snapshot
|
|
||||||
inline SequenceNumber findEarliestVisibleSnapshot(
|
|
||||||
SequenceNumber in,
|
|
||||||
std::vector<SequenceNumber>& snapshots,
|
|
||||||
SequenceNumber* prev_snapshot);
|
|
||||||
|
|
||||||
// Background threads call this function, which is just a wrapper around
|
// Background threads call this function, which is just a wrapper around
|
||||||
// the InstallSuperVersion() function. Background threads carry
|
// the InstallSuperVersion() function. Background threads carry
|
||||||
// job_context which can have new_superversion already
|
// job_context which can have new_superversion already
|
||||||
|
@ -1,7 +1,7 @@
|
|||||||
// Copyright (c) 2011-present, Facebook, Inc. All rights reserved.
|
// Copyright (c) 2011-present, Facebook, Inc. All rights reserved.
|
||||||
// This source code is licensed under the BSD-style license found in the
|
// This source code is licensed under both the GPLv2 (found in the
|
||||||
// LICENSE file in the root directory of this source tree. An additional grant
|
// COPYING file in the root directory) and Apache 2.0 License
|
||||||
// of patent rights can be found in the PATENTS file in the same directory.
|
// (found in the LICENSE.Apache file in the root directory).
|
||||||
//
|
//
|
||||||
// Copyright (c) 2011 The LevelDB Authors. All rights reserved.
|
// Copyright (c) 2011 The LevelDB Authors. All rights reserved.
|
||||||
// Use of this source code is governed by a BSD-style license that can be
|
// Use of this source code is governed by a BSD-style license that can be
|
||||||
@ -90,6 +90,12 @@ Status DBImpl::FlushMemTableToOutputFile(
|
|||||||
|
|
||||||
flush_job.PickMemTable();
|
flush_job.PickMemTable();
|
||||||
|
|
||||||
|
#ifndef ROCKSDB_LITE
|
||||||
|
// may temporarily unlock and lock the mutex.
|
||||||
|
NotifyOnFlushBegin(cfd, &file_meta, mutable_cf_options, job_context->job_id,
|
||||||
|
flush_job.GetTableProperties());
|
||||||
|
#endif // ROCKSDB_LITE
|
||||||
|
|
||||||
Status s;
|
Status s;
|
||||||
if (logfile_number_ > 0 &&
|
if (logfile_number_ > 0 &&
|
||||||
versions_->GetColumnFamilySet()->NumberOfColumnFamilies() > 0) {
|
versions_->GetColumnFamilySet()->NumberOfColumnFamilies() > 0) {
|
||||||
@ -156,6 +162,49 @@ Status DBImpl::FlushMemTableToOutputFile(
|
|||||||
return s;
|
return s;
|
||||||
}
|
}
|
||||||
|
|
||||||
|
void DBImpl::NotifyOnFlushBegin(ColumnFamilyData* cfd, FileMetaData* file_meta,
|
||||||
|
const MutableCFOptions& mutable_cf_options,
|
||||||
|
int job_id, TableProperties prop) {
|
||||||
|
#ifndef ROCKSDB_LITE
|
||||||
|
if (immutable_db_options_.listeners.size() == 0U) {
|
||||||
|
return;
|
||||||
|
}
|
||||||
|
mutex_.AssertHeld();
|
||||||
|
if (shutting_down_.load(std::memory_order_acquire)) {
|
||||||
|
return;
|
||||||
|
}
|
||||||
|
bool triggered_writes_slowdown =
|
||||||
|
(cfd->current()->storage_info()->NumLevelFiles(0) >=
|
||||||
|
mutable_cf_options.level0_slowdown_writes_trigger);
|
||||||
|
bool triggered_writes_stop =
|
||||||
|
(cfd->current()->storage_info()->NumLevelFiles(0) >=
|
||||||
|
mutable_cf_options.level0_stop_writes_trigger);
|
||||||
|
// release lock while notifying events
|
||||||
|
mutex_.Unlock();
|
||||||
|
{
|
||||||
|
FlushJobInfo info;
|
||||||
|
info.cf_name = cfd->GetName();
|
||||||
|
// TODO(yhchiang): make db_paths dynamic in case flush does not
|
||||||
|
// go to L0 in the future.
|
||||||
|
info.file_path = MakeTableFileName(immutable_db_options_.db_paths[0].path,
|
||||||
|
file_meta->fd.GetNumber());
|
||||||
|
info.thread_id = env_->GetThreadID();
|
||||||
|
info.job_id = job_id;
|
||||||
|
info.triggered_writes_slowdown = triggered_writes_slowdown;
|
||||||
|
info.triggered_writes_stop = triggered_writes_stop;
|
||||||
|
info.smallest_seqno = file_meta->smallest_seqno;
|
||||||
|
info.largest_seqno = file_meta->largest_seqno;
|
||||||
|
info.table_properties = prop;
|
||||||
|
for (auto listener : immutable_db_options_.listeners) {
|
||||||
|
listener->OnFlushBegin(this, info);
|
||||||
|
}
|
||||||
|
}
|
||||||
|
mutex_.Lock();
|
||||||
|
// no need to signal bg_cv_ as it will be signaled at the end of the
|
||||||
|
// flush process.
|
||||||
|
#endif // ROCKSDB_LITE
|
||||||
|
}
|
||||||
|
|
||||||
void DBImpl::NotifyOnFlushCompleted(ColumnFamilyData* cfd,
|
void DBImpl::NotifyOnFlushCompleted(ColumnFamilyData* cfd,
|
||||||
FileMetaData* file_meta,
|
FileMetaData* file_meta,
|
||||||
const MutableCFOptions& mutable_cf_options,
|
const MutableCFOptions& mutable_cf_options,
|
||||||
@ -777,6 +826,7 @@ Status DBImpl::RunManualCompaction(ColumnFamilyData* cfd, int input_level,
|
|||||||
TEST_SYNC_POINT_CALLBACK("DBImpl::RunManualCompaction:NotScheduled", &mutex_);
|
TEST_SYNC_POINT_CALLBACK("DBImpl::RunManualCompaction:NotScheduled", &mutex_);
|
||||||
if (exclusive) {
|
if (exclusive) {
|
||||||
while (bg_compaction_scheduled_ > 0) {
|
while (bg_compaction_scheduled_ > 0) {
|
||||||
|
TEST_SYNC_POINT("DBImpl::RunManualCompaction:WaitScheduled");
|
||||||
ROCKS_LOG_INFO(
|
ROCKS_LOG_INFO(
|
||||||
immutable_db_options_.info_log,
|
immutable_db_options_.info_log,
|
||||||
"[%s] Manual compaction waiting for all other scheduled background "
|
"[%s] Manual compaction waiting for all other scheduled background "
|
||||||
@ -1343,6 +1393,16 @@ Status DBImpl::BackgroundCompaction(bool* made_progress,
|
|||||||
: m->manual_end->DebugString().c_str()));
|
: m->manual_end->DebugString().c_str()));
|
||||||
}
|
}
|
||||||
} else if (!compaction_queue_.empty()) {
|
} else if (!compaction_queue_.empty()) {
|
||||||
|
if (HaveManualCompaction(compaction_queue_.front())) {
|
||||||
|
// Can't compact right now, but try again later
|
||||||
|
TEST_SYNC_POINT("DBImpl::BackgroundCompaction()::Conflict");
|
||||||
|
|
||||||
|
// Stay in the compaciton queue.
|
||||||
|
unscheduled_compactions_++;
|
||||||
|
|
||||||
|
return Status::OK();
|
||||||
|
}
|
||||||
|
|
||||||
// cfd is referenced here
|
// cfd is referenced here
|
||||||
auto cfd = PopFirstFromCompactionQueue();
|
auto cfd = PopFirstFromCompactionQueue();
|
||||||
// We unreference here because the following code will take a Ref() on
|
// We unreference here because the following code will take a Ref() on
|
||||||
@ -1357,12 +1417,6 @@ Status DBImpl::BackgroundCompaction(bool* made_progress,
|
|||||||
return Status::OK();
|
return Status::OK();
|
||||||
}
|
}
|
||||||
|
|
||||||
if (HaveManualCompaction(cfd)) {
|
|
||||||
// Can't compact right now, but try again later
|
|
||||||
TEST_SYNC_POINT("DBImpl::BackgroundCompaction()::Conflict");
|
|
||||||
return Status::OK();
|
|
||||||
}
|
|
||||||
|
|
||||||
// Pick up latest mutable CF Options and use it throughout the
|
// Pick up latest mutable CF Options and use it throughout the
|
||||||
// compaction job
|
// compaction job
|
||||||
// Compaction makes a copy of the latest MutableCFOptions. It should be used
|
// Compaction makes a copy of the latest MutableCFOptions. It should be used
|
||||||
|
@ -1,7 +1,7 @@
|
|||||||
// Copyright (c) 2011-present, Facebook, Inc. All rights reserved.
|
// Copyright (c) 2011-present, Facebook, Inc. All rights reserved.
|
||||||
// This source code is licensed under the BSD-style license found in the
|
// This source code is licensed under both the GPLv2 (found in the
|
||||||
// LICENSE file in the root directory of this source tree. An additional grant
|
// COPYING file in the root directory) and Apache 2.0 License
|
||||||
// of patent rights can be found in the PATENTS file in the same directory.
|
// (found in the LICENSE.Apache file in the root directory).
|
||||||
//
|
//
|
||||||
// Copyright (c) 2011 The LevelDB Authors. All rights reserved.
|
// Copyright (c) 2011 The LevelDB Authors. All rights reserved.
|
||||||
// Use of this source code is governed by a BSD-style license that can be
|
// Use of this source code is governed by a BSD-style license that can be
|
||||||
|
@ -1,7 +1,7 @@
|
|||||||
// Copyright (c) 2011-present, Facebook, Inc. All rights reserved.
|
// Copyright (c) 2011-present, Facebook, Inc. All rights reserved.
|
||||||
// This source code is licensed under the BSD-style license found in the
|
// This source code is licensed under both the GPLv2 (found in the
|
||||||
// LICENSE file in the root directory of this source tree. An additional grant
|
// COPYING file in the root directory) and Apache 2.0 License
|
||||||
// of patent rights can be found in the PATENTS file in the same directory.
|
// (found in the LICENSE.Apache file in the root directory).
|
||||||
//
|
//
|
||||||
// Copyright (c) 2011 The LevelDB Authors. All rights reserved.
|
// Copyright (c) 2011 The LevelDB Authors. All rights reserved.
|
||||||
// Use of this source code is governed by a BSD-style license that can be
|
// Use of this source code is governed by a BSD-style license that can be
|
||||||
|
@ -1,7 +1,7 @@
|
|||||||
// Copyright (c) 2011-present, Facebook, Inc. All rights reserved.
|
// Copyright (c) 2011-present, Facebook, Inc. All rights reserved.
|
||||||
// This source code is licensed under the BSD-style license found in the
|
// This source code is licensed under both the GPLv2 (found in the
|
||||||
// LICENSE file in the root directory of this source tree. An additional grant
|
// COPYING file in the root directory) and Apache 2.0 License
|
||||||
// of patent rights can be found in the PATENTS file in the same directory.
|
// (found in the LICENSE.Apache file in the root directory).
|
||||||
//
|
//
|
||||||
// Copyright (c) 2011 The LevelDB Authors. All rights reserved.
|
// Copyright (c) 2011 The LevelDB Authors. All rights reserved.
|
||||||
// Use of this source code is governed by a BSD-style license that can be
|
// Use of this source code is governed by a BSD-style license that can be
|
||||||
@ -444,6 +444,7 @@ void DBImpl::PurgeObsoleteFiles(const JobContext& state, bool schedule_only) {
|
|||||||
case kIdentityFile:
|
case kIdentityFile:
|
||||||
case kMetaDatabase:
|
case kMetaDatabase:
|
||||||
case kOptionsFile:
|
case kOptionsFile:
|
||||||
|
case kBlobFile:
|
||||||
keep = true;
|
keep = true;
|
||||||
break;
|
break;
|
||||||
}
|
}
|
||||||
|
@ -1,7 +1,7 @@
|
|||||||
// Copyright (c) 2011-present, Facebook, Inc. All rights reserved.
|
// Copyright (c) 2011-present, Facebook, Inc. All rights reserved.
|
||||||
// This source code is licensed under the BSD-style license found in the
|
// This source code is licensed under both the GPLv2 (found in the
|
||||||
// LICENSE file in the root directory of this source tree. An additional grant
|
// COPYING file in the root directory) and Apache 2.0 License
|
||||||
// of patent rights can be found in the PATENTS file in the same directory.
|
// (found in the LICENSE.Apache file in the root directory).
|
||||||
//
|
//
|
||||||
// Copyright (c) 2011 The LevelDB Authors. All rights reserved.
|
// Copyright (c) 2011 The LevelDB Authors. All rights reserved.
|
||||||
// Use of this source code is governed by a BSD-style license that can be
|
// Use of this source code is governed by a BSD-style license that can be
|
||||||
@ -97,11 +97,14 @@ DBOptions SanitizeOptions(const std::string& dbname, const DBOptions& src) {
|
|||||||
result.db_paths.emplace_back(dbname, std::numeric_limits<uint64_t>::max());
|
result.db_paths.emplace_back(dbname, std::numeric_limits<uint64_t>::max());
|
||||||
}
|
}
|
||||||
|
|
||||||
if (result.use_direct_reads && result.compaction_readahead_size == 0) {
|
if (result.use_direct_io_for_flush_and_compaction &&
|
||||||
|
result.compaction_readahead_size == 0) {
|
||||||
|
TEST_SYNC_POINT_CALLBACK("SanitizeOptions:direct_io", nullptr);
|
||||||
result.compaction_readahead_size = 1024 * 1024 * 2;
|
result.compaction_readahead_size = 1024 * 1024 * 2;
|
||||||
}
|
}
|
||||||
|
|
||||||
if (result.compaction_readahead_size > 0) {
|
if (result.compaction_readahead_size > 0 ||
|
||||||
|
result.use_direct_io_for_flush_and_compaction) {
|
||||||
result.new_table_reader_for_compaction_inputs = true;
|
result.new_table_reader_for_compaction_inputs = true;
|
||||||
}
|
}
|
||||||
|
|
||||||
@ -165,10 +168,12 @@ static Status ValidateOptions(
|
|||||||
"then direct I/O reads (use_direct_reads) must be disabled. ");
|
"then direct I/O reads (use_direct_reads) must be disabled. ");
|
||||||
}
|
}
|
||||||
|
|
||||||
if (db_options.allow_mmap_writes && db_options.use_direct_writes) {
|
if (db_options.allow_mmap_writes &&
|
||||||
|
db_options.use_direct_io_for_flush_and_compaction) {
|
||||||
return Status::NotSupported(
|
return Status::NotSupported(
|
||||||
"If memory mapped writes (allow_mmap_writes) are enabled "
|
"If memory mapped writes (allow_mmap_writes) are enabled "
|
||||||
"then direct I/O writes (use_direct_writes) must be disabled. ");
|
"then direct I/O writes (use_direct_io_for_flush_and_compaction) must "
|
||||||
|
"be disabled. ");
|
||||||
}
|
}
|
||||||
|
|
||||||
if (db_options.keep_log_file_num == 0) {
|
if (db_options.keep_log_file_num == 0) {
|
||||||
@ -823,9 +828,11 @@ Status DBImpl::WriteLevel0TableForRecovery(int job_id, ColumnFamilyData* cfd,
|
|||||||
std::vector<SequenceNumber> snapshot_seqs =
|
std::vector<SequenceNumber> snapshot_seqs =
|
||||||
snapshots_.GetAll(&earliest_write_conflict_snapshot);
|
snapshots_.GetAll(&earliest_write_conflict_snapshot);
|
||||||
|
|
||||||
|
EnvOptions optimized_env_options =
|
||||||
|
env_->OptimizeForCompactionTableWrite(env_options_, immutable_db_options_);
|
||||||
s = BuildTable(
|
s = BuildTable(
|
||||||
dbname_, env_, *cfd->ioptions(), mutable_cf_options, env_options_,
|
dbname_, env_, *cfd->ioptions(), mutable_cf_options,
|
||||||
cfd->table_cache(), iter.get(),
|
optimized_env_options, cfd->table_cache(), iter.get(),
|
||||||
std::unique_ptr<InternalIterator>(mem->NewRangeTombstoneIterator(ro)),
|
std::unique_ptr<InternalIterator>(mem->NewRangeTombstoneIterator(ro)),
|
||||||
&meta, cfd->internal_comparator(),
|
&meta, cfd->internal_comparator(),
|
||||||
cfd->int_tbl_prop_collector_factories(), cfd->GetID(), cfd->GetName(),
|
cfd->int_tbl_prop_collector_factories(), cfd->GetID(), cfd->GetName(),
|
||||||
@ -1025,7 +1032,8 @@ Status DB::Open(const DBOptions& db_options, const std::string& dbname,
|
|||||||
if (s.ok()) {
|
if (s.ok()) {
|
||||||
// Persist RocksDB Options before scheduling the compaction.
|
// Persist RocksDB Options before scheduling the compaction.
|
||||||
// The WriteOptionsFile() will release and lock the mutex internally.
|
// The WriteOptionsFile() will release and lock the mutex internally.
|
||||||
persist_options_status = impl->WriteOptionsFile();
|
persist_options_status = impl->WriteOptionsFile(
|
||||||
|
false /*need_mutex_lock*/, false /*need_enter_write_thread*/);
|
||||||
|
|
||||||
*dbptr = impl;
|
*dbptr = impl;
|
||||||
impl->opened_successfully_ = true;
|
impl->opened_successfully_ = true;
|
||||||
@ -1058,15 +1066,10 @@ Status DB::Open(const DBOptions& db_options, const std::string& dbname,
|
|||||||
ROCKS_LOG_INFO(impl->immutable_db_options_.info_log, "DB pointer %p", impl);
|
ROCKS_LOG_INFO(impl->immutable_db_options_.info_log, "DB pointer %p", impl);
|
||||||
LogFlush(impl->immutable_db_options_.info_log);
|
LogFlush(impl->immutable_db_options_.info_log);
|
||||||
if (!persist_options_status.ok()) {
|
if (!persist_options_status.ok()) {
|
||||||
if (db_options.fail_if_options_file_error) {
|
|
||||||
s = Status::IOError(
|
s = Status::IOError(
|
||||||
"DB::Open() failed --- Unable to persist Options file",
|
"DB::Open() failed --- Unable to persist Options file",
|
||||||
persist_options_status.ToString());
|
persist_options_status.ToString());
|
||||||
}
|
}
|
||||||
ROCKS_LOG_WARN(impl->immutable_db_options_.info_log,
|
|
||||||
"Unable to persist options in DB::Open() -- %s",
|
|
||||||
persist_options_status.ToString().c_str());
|
|
||||||
}
|
|
||||||
}
|
}
|
||||||
if (!s.ok()) {
|
if (!s.ok()) {
|
||||||
for (auto* h : *handles) {
|
for (auto* h : *handles) {
|
||||||
|
@ -1,7 +1,7 @@
|
|||||||
// Copyright (c) 2011-present, Facebook, Inc. All rights reserved.
|
// Copyright (c) 2011-present, Facebook, Inc. All rights reserved.
|
||||||
// This source code is licensed under the BSD-style license found in the
|
// This source code is licensed under both the GPLv2 (found in the
|
||||||
// LICENSE file in the root directory of this source tree. An additional grant
|
// COPYING file in the root directory) and Apache 2.0 License
|
||||||
// of patent rights can be found in the PATENTS file in the same directory.
|
// (found in the LICENSE.Apache file in the root directory).
|
||||||
|
|
||||||
|
|
||||||
#include "db/db_impl_readonly.h"
|
#include "db/db_impl_readonly.h"
|
||||||
|
@ -1,7 +1,7 @@
|
|||||||
// Copyright (c) 2011-present, Facebook, Inc. All rights reserved.
|
// Copyright (c) 2011-present, Facebook, Inc. All rights reserved.
|
||||||
// This source code is licensed under the BSD-style license found in the
|
// This source code is licensed under both the GPLv2 (found in the
|
||||||
// LICENSE file in the root directory of this source tree. An additional grant
|
// COPYING file in the root directory) and Apache 2.0 License
|
||||||
// of patent rights can be found in the PATENTS file in the same directory.
|
// (found in the LICENSE.Apache file in the root directory).
|
||||||
|
|
||||||
#pragma once
|
#pragma once
|
||||||
|
|
||||||
|
@ -1,7 +1,7 @@
|
|||||||
// Copyright (c) 2011-present, Facebook, Inc. All rights reserved.
|
// Copyright (c) 2011-present, Facebook, Inc. All rights reserved.
|
||||||
// This source code is licensed under the BSD-style license found in the
|
// This source code is licensed under both the GPLv2 (found in the
|
||||||
// LICENSE file in the root directory of this source tree. An additional grant
|
// COPYING file in the root directory) and Apache 2.0 License
|
||||||
// of patent rights can be found in the PATENTS file in the same directory.
|
// (found in the LICENSE.Apache file in the root directory).
|
||||||
//
|
//
|
||||||
// Copyright (c) 2011 The LevelDB Authors. All rights reserved.
|
// Copyright (c) 2011 The LevelDB Authors. All rights reserved.
|
||||||
// Use of this source code is governed by a BSD-style license that can be
|
// Use of this source code is governed by a BSD-style license that can be
|
||||||
|
@ -1,7 +1,7 @@
|
|||||||
// Copyright (c) 2011-present, Facebook, Inc. All rights reserved.
|
// Copyright (c) 2011-present, Facebook, Inc. All rights reserved.
|
||||||
// This source code is licensed under the BSD-style license found in the
|
// This source code is licensed under both the GPLv2 (found in the
|
||||||
// LICENSE file in the root directory of this source tree. An additional grant
|
// COPYING file in the root directory) and Apache 2.0 License
|
||||||
// of patent rights can be found in the PATENTS file in the same directory.
|
// (found in the LICENSE.Apache file in the root directory).
|
||||||
|
|
||||||
#ifndef __STDC_FORMAT_MACROS
|
#ifndef __STDC_FORMAT_MACROS
|
||||||
#define __STDC_FORMAT_MACROS
|
#define __STDC_FORMAT_MACROS
|
||||||
|
@ -1,7 +1,7 @@
|
|||||||
// Copyright (c) 2011-present, Facebook, Inc. All rights reserved.
|
// Copyright (c) 2011-present, Facebook, Inc. All rights reserved.
|
||||||
// This source code is licensed under the BSD-style license found in the
|
// This source code is licensed under both the GPLv2 (found in the
|
||||||
// LICENSE file in the root directory of this source tree. An additional grant
|
// COPYING file in the root directory) and Apache 2.0 License
|
||||||
// of patent rights can be found in the PATENTS file in the same directory.
|
// (found in the LICENSE.Apache file in the root directory).
|
||||||
#pragma once
|
#pragma once
|
||||||
|
|
||||||
#include <string>
|
#include <string>
|
||||||
|
@ -1,7 +1,7 @@
|
|||||||
// Copyright (c) 2011-present, Facebook, Inc. All rights reserved.
|
// Copyright (c) 2011-present, Facebook, Inc. All rights reserved.
|
||||||
// This source code is licensed under the BSD-style license found in the
|
// This source code is licensed under both the GPLv2 (found in the
|
||||||
// LICENSE file in the root directory of this source tree. An additional grant
|
// COPYING file in the root directory) and Apache 2.0 License
|
||||||
// of patent rights can be found in the PATENTS file in the same directory.
|
// (found in the LICENSE.Apache file in the root directory).
|
||||||
//
|
//
|
||||||
// Copyright (c) 2011 The LevelDB Authors. All rights reserved.
|
// Copyright (c) 2011 The LevelDB Authors. All rights reserved.
|
||||||
// Use of this source code is governed by a BSD-style license that can be
|
// Use of this source code is governed by a BSD-style license that can be
|
||||||
|
@ -1,7 +1,7 @@
|
|||||||
// Copyright (c) 2011-present, Facebook, Inc. All rights reserved.
|
// Copyright (c) 2011-present, Facebook, Inc. All rights reserved.
|
||||||
// This source code is licensed under the BSD-style license found in the
|
// This source code is licensed under both the GPLv2 (found in the
|
||||||
// LICENSE file in the root directory of this source tree. An additional grant
|
// COPYING file in the root directory) and Apache 2.0 License
|
||||||
// of patent rights can be found in the PATENTS file in the same directory.
|
// (found in the LICENSE.Apache file in the root directory).
|
||||||
//
|
//
|
||||||
// Copyright (c) 2011 The LevelDB Authors. All rights reserved.
|
// Copyright (c) 2011 The LevelDB Authors. All rights reserved.
|
||||||
// Use of this source code is governed by a BSD-style license that can be
|
// Use of this source code is governed by a BSD-style license that can be
|
||||||
|
@ -1,7 +1,7 @@
|
|||||||
// Copyright (c) 2011-present, Facebook, Inc. All rights reserved.
|
// Copyright (c) 2011-present, Facebook, Inc. All rights reserved.
|
||||||
// This source code is licensed under the BSD-style license found in the
|
// This source code is licensed under both the GPLv2 (found in the
|
||||||
// LICENSE file in the root directory of this source tree. An additional grant
|
// COPYING file in the root directory) and Apache 2.0 License
|
||||||
// of patent rights can be found in the PATENTS file in the same directory.
|
// (found in the LICENSE.Apache file in the root directory).
|
||||||
//
|
//
|
||||||
// Copyright (c) 2011 The LevelDB Authors. All rights reserved.
|
// Copyright (c) 2011 The LevelDB Authors. All rights reserved.
|
||||||
// Use of this source code is governed by a BSD-style license that can be
|
// Use of this source code is governed by a BSD-style license that can be
|
||||||
|
@ -1,7 +1,7 @@
|
|||||||
// Copyright (c) 2011-present, Facebook, Inc. All rights reserved.
|
// Copyright (c) 2011-present, Facebook, Inc. All rights reserved.
|
||||||
// This source code is licensed under the BSD-style license found in the
|
// This source code is licensed under both the GPLv2 (found in the
|
||||||
// LICENSE file in the root directory of this source tree. An additional grant
|
// COPYING file in the root directory) and Apache 2.0 License
|
||||||
// of patent rights can be found in the PATENTS file in the same directory.
|
// (found in the LICENSE.Apache file in the root directory).
|
||||||
//
|
//
|
||||||
// Copyright (c) 2011 The LevelDB Authors. All rights reserved.
|
// Copyright (c) 2011 The LevelDB Authors. All rights reserved.
|
||||||
// Use of this source code is governed by a BSD-style license that can be
|
// Use of this source code is governed by a BSD-style license that can be
|
||||||
|
@ -1,7 +1,7 @@
|
|||||||
// Copyright (c) 2011-present, Facebook, Inc. All rights reserved.
|
// Copyright (c) 2011-present, Facebook, Inc. All rights reserved.
|
||||||
// This source code is licensed under the BSD-style license found in the
|
// This source code is licensed under both the GPLv2 (found in the
|
||||||
// LICENSE file in the root directory of this source tree. An additional grant
|
// COPYING file in the root directory) and Apache 2.0 License
|
||||||
// of patent rights can be found in the PATENTS file in the same directory.
|
// (found in the LICENSE.Apache file in the root directory).
|
||||||
|
|
||||||
#include <string>
|
#include <string>
|
||||||
#include <vector>
|
#include <vector>
|
||||||
|
@ -1,7 +1,7 @@
|
|||||||
// Copyright (c) 2011-present, Facebook, Inc. All rights reserved.
|
// Copyright (c) 2011-present, Facebook, Inc. All rights reserved.
|
||||||
// This source code is licensed under the BSD-style license found in the
|
// This source code is licensed under both the GPLv2 (found in the
|
||||||
// LICENSE file in the root directory of this source tree. An additional grant
|
// COPYING file in the root directory) and Apache 2.0 License
|
||||||
// of patent rights can be found in the PATENTS file in the same directory.
|
// (found in the LICENSE.Apache file in the root directory).
|
||||||
//
|
//
|
||||||
// Copyright (c) 2011 The LevelDB Authors. All rights reserved.
|
// Copyright (c) 2011 The LevelDB Authors. All rights reserved.
|
||||||
// Use of this source code is governed by a BSD-style license that can be
|
// Use of this source code is governed by a BSD-style license that can be
|
||||||
@ -22,6 +22,34 @@ class DBIteratorTest : public DBTestBase {
|
|||||||
DBIteratorTest() : DBTestBase("/db_iterator_test") {}
|
DBIteratorTest() : DBTestBase("/db_iterator_test") {}
|
||||||
};
|
};
|
||||||
|
|
||||||
|
class FlushBlockEveryKeyPolicy : public FlushBlockPolicy {
|
||||||
|
public:
|
||||||
|
virtual bool Update(const Slice& key, const Slice& value) override {
|
||||||
|
if (!start_) {
|
||||||
|
start_ = true;
|
||||||
|
return false;
|
||||||
|
}
|
||||||
|
return true;
|
||||||
|
}
|
||||||
|
private:
|
||||||
|
bool start_ = false;
|
||||||
|
};
|
||||||
|
|
||||||
|
class FlushBlockEveryKeyPolicyFactory : public FlushBlockPolicyFactory {
|
||||||
|
public:
|
||||||
|
explicit FlushBlockEveryKeyPolicyFactory() {}
|
||||||
|
|
||||||
|
const char* Name() const override {
|
||||||
|
return "FlushBlockEveryKeyPolicyFactory";
|
||||||
|
}
|
||||||
|
|
||||||
|
FlushBlockPolicy* NewFlushBlockPolicy(
|
||||||
|
const BlockBasedTableOptions& table_options,
|
||||||
|
const BlockBuilder& data_block_builder) const override {
|
||||||
|
return new FlushBlockEveryKeyPolicy;
|
||||||
|
}
|
||||||
|
};
|
||||||
|
|
||||||
TEST_F(DBIteratorTest, IteratorProperty) {
|
TEST_F(DBIteratorTest, IteratorProperty) {
|
||||||
// The test needs to be changed if kPersistedTier is supported in iterator.
|
// The test needs to be changed if kPersistedTier is supported in iterator.
|
||||||
Options options = CurrentOptions();
|
Options options = CurrentOptions();
|
||||||
@ -975,6 +1003,50 @@ TEST_F(DBIteratorTest, DBIteratorBoundTest) {
|
|||||||
}
|
}
|
||||||
}
|
}
|
||||||
|
|
||||||
|
TEST_F(DBIteratorTest, DBIteratorBoundOptimizationTest) {
|
||||||
|
int upper_bound_hits = 0;
|
||||||
|
rocksdb::SyncPoint::GetInstance()->SetCallBack(
|
||||||
|
"BlockBasedTable::BlockEntryIteratorState::KeyReachedUpperBound",
|
||||||
|
[&upper_bound_hits](void* arg) {
|
||||||
|
assert(arg != nullptr);
|
||||||
|
upper_bound_hits += (*static_cast<bool*>(arg) ? 1 : 0);
|
||||||
|
});
|
||||||
|
rocksdb::SyncPoint::GetInstance()->EnableProcessing();
|
||||||
|
Options options = CurrentOptions();
|
||||||
|
options.env = env_;
|
||||||
|
options.create_if_missing = true;
|
||||||
|
options.prefix_extractor = nullptr;
|
||||||
|
BlockBasedTableOptions table_options;
|
||||||
|
table_options.flush_block_policy_factory =
|
||||||
|
std::make_shared<FlushBlockEveryKeyPolicyFactory>();
|
||||||
|
options.table_factory.reset(NewBlockBasedTableFactory(table_options));
|
||||||
|
|
||||||
|
DestroyAndReopen(options);
|
||||||
|
ASSERT_OK(Put("foo1", "bar1"));
|
||||||
|
ASSERT_OK(Put("foo2", "bar2"));
|
||||||
|
ASSERT_OK(Put("foo4", "bar4"));
|
||||||
|
ASSERT_OK(Flush());
|
||||||
|
|
||||||
|
Slice ub("foo3");
|
||||||
|
ReadOptions ro;
|
||||||
|
ro.iterate_upper_bound = &ub;
|
||||||
|
|
||||||
|
std::unique_ptr<Iterator> iter(db_->NewIterator(ro));
|
||||||
|
|
||||||
|
iter->Seek("foo");
|
||||||
|
ASSERT_TRUE(iter->Valid());
|
||||||
|
ASSERT_EQ(iter->key().compare(Slice("foo1")), 0);
|
||||||
|
ASSERT_EQ(upper_bound_hits, 0);
|
||||||
|
|
||||||
|
iter->Next();
|
||||||
|
ASSERT_TRUE(iter->Valid());
|
||||||
|
ASSERT_EQ(iter->key().compare(Slice("foo2")), 0);
|
||||||
|
ASSERT_EQ(upper_bound_hits, 0);
|
||||||
|
|
||||||
|
iter->Next();
|
||||||
|
ASSERT_FALSE(iter->Valid());
|
||||||
|
ASSERT_EQ(upper_bound_hits, 1);
|
||||||
|
}
|
||||||
// TODO(3.13): fix the issue of Seek() + Prev() which might not necessary
|
// TODO(3.13): fix the issue of Seek() + Prev() which might not necessary
|
||||||
// return the biggest key which is smaller than the seek key.
|
// return the biggest key which is smaller than the seek key.
|
||||||
TEST_F(DBIteratorTest, PrevAfterAndNextAfterMerge) {
|
TEST_F(DBIteratorTest, PrevAfterAndNextAfterMerge) {
|
||||||
|
@ -1,7 +1,7 @@
|
|||||||
// Copyright (c) 2011-present, Facebook, Inc. All rights reserved.
|
// Copyright (c) 2011-present, Facebook, Inc. All rights reserved.
|
||||||
// This source code is licensed under the BSD-style license found in the
|
// This source code is licensed under both the GPLv2 (found in the
|
||||||
// LICENSE file in the root directory of this source tree. An additional grant
|
// COPYING file in the root directory) and Apache 2.0 License
|
||||||
// of patent rights can be found in the PATENTS file in the same directory.
|
// (found in the LICENSE.Apache file in the root directory).
|
||||||
//
|
//
|
||||||
// Copyright (c) 2011 The LevelDB Authors. All rights reserved.
|
// Copyright (c) 2011 The LevelDB Authors. All rights reserved.
|
||||||
// Use of this source code is governed by a BSD-style license that can be
|
// Use of this source code is governed by a BSD-style license that can be
|
||||||
|
@ -1,7 +1,7 @@
|
|||||||
// Copyright (c) 2011-present, Facebook, Inc. All rights reserved.
|
// Copyright (c) 2011-present, Facebook, Inc. All rights reserved.
|
||||||
// This source code is licensed under the BSD-style license found in the
|
// This source code is licensed under both the GPLv2 (found in the
|
||||||
// LICENSE file in the root directory of this source tree. An additional grant
|
// COPYING file in the root directory) and Apache 2.0 License
|
||||||
// of patent rights can be found in the PATENTS file in the same directory.
|
// (found in the LICENSE.Apache file in the root directory).
|
||||||
|
|
||||||
#include <memory>
|
#include <memory>
|
||||||
#include <string>
|
#include <string>
|
||||||
|
@ -1,7 +1,7 @@
|
|||||||
// Copyright (c) 2011-present, Facebook, Inc. All rights reserved.
|
// Copyright (c) 2011-present, Facebook, Inc. All rights reserved.
|
||||||
// This source code is licensed under the BSD-style license found in the
|
// This source code is licensed under both the GPLv2 (found in the
|
||||||
// LICENSE file in the root directory of this source tree. An additional grant
|
// COPYING file in the root directory) and Apache 2.0 License
|
||||||
// of patent rights can be found in the PATENTS file in the same directory.
|
// (found in the LICENSE.Apache file in the root directory).
|
||||||
#include <string>
|
#include <string>
|
||||||
#include <vector>
|
#include <vector>
|
||||||
|
|
||||||
|
@ -1,7 +1,7 @@
|
|||||||
// Copyright (c) 2011-present, Facebook, Inc. All rights reserved.
|
// Copyright (c) 2011-present, Facebook, Inc. All rights reserved.
|
||||||
// This source code is licensed under the BSD-style license found in the
|
// This source code is licensed under both the GPLv2 (found in the
|
||||||
// LICENSE file in the root directory of this source tree. An additional grant
|
// COPYING file in the root directory) and Apache 2.0 License
|
||||||
// of patent rights can be found in the PATENTS file in the same directory.
|
// (found in the LICENSE.Apache file in the root directory).
|
||||||
//
|
//
|
||||||
// Copyright (c) 2011 The LevelDB Authors. All rights reserved.
|
// Copyright (c) 2011 The LevelDB Authors. All rights reserved.
|
||||||
// Use of this source code is governed by a BSD-style license that can be
|
// Use of this source code is governed by a BSD-style license that can be
|
||||||
|
@ -1,7 +1,7 @@
|
|||||||
// Copyright (c) 2011-present, Facebook, Inc. All rights reserved.
|
// Copyright (c) 2011-present, Facebook, Inc. All rights reserved.
|
||||||
// This source code is licensed under the BSD-style license found in the
|
// This source code is licensed under both the GPLv2 (found in the
|
||||||
// LICENSE file in the root directory of this source tree. An additional grant
|
// COPYING file in the root directory) and Apache 2.0 License
|
||||||
// of patent rights can be found in the PATENTS file in the same directory.
|
// (found in the LICENSE.Apache file in the root directory).
|
||||||
//
|
//
|
||||||
// Copyright (c) 2011 The LevelDB Authors. All rights reserved.
|
// Copyright (c) 2011 The LevelDB Authors. All rights reserved.
|
||||||
// Use of this source code is governed by a BSD-style license that can be
|
// Use of this source code is governed by a BSD-style license that can be
|
||||||
@ -425,6 +425,13 @@ TEST_F(DBPropertiesTest, ReadLatencyHistogramByLevel) {
|
|||||||
ASSERT_NE(std::string::npos, prop.find("** Level 0 read latency histogram"));
|
ASSERT_NE(std::string::npos, prop.find("** Level 0 read latency histogram"));
|
||||||
ASSERT_NE(std::string::npos, prop.find("** Level 1 read latency histogram"));
|
ASSERT_NE(std::string::npos, prop.find("** Level 1 read latency histogram"));
|
||||||
ASSERT_EQ(std::string::npos, prop.find("** Level 2 read latency histogram"));
|
ASSERT_EQ(std::string::npos, prop.find("** Level 2 read latency histogram"));
|
||||||
|
|
||||||
|
// Clear internal stats
|
||||||
|
dbfull()->ResetStats();
|
||||||
|
ASSERT_TRUE(dbfull()->GetProperty("rocksdb.cfstats", &prop));
|
||||||
|
ASSERT_EQ(std::string::npos, prop.find("** Level 0 read latency histogram"));
|
||||||
|
ASSERT_EQ(std::string::npos, prop.find("** Level 1 read latency histogram"));
|
||||||
|
ASSERT_EQ(std::string::npos, prop.find("** Level 2 read latency histogram"));
|
||||||
}
|
}
|
||||||
|
|
||||||
TEST_F(DBPropertiesTest, AggregatedTablePropertiesAtLevel) {
|
TEST_F(DBPropertiesTest, AggregatedTablePropertiesAtLevel) {
|
||||||
@ -1293,6 +1300,18 @@ TEST_F(DBPropertiesTest, NeedCompactHintPersistentTest) {
|
|||||||
SetPerfLevel(kDisable);
|
SetPerfLevel(kDisable);
|
||||||
}
|
}
|
||||||
}
|
}
|
||||||
|
|
||||||
|
TEST_F(DBPropertiesTest, EstimateNumKeysUnderflow) {
|
||||||
|
Options options;
|
||||||
|
Reopen(options);
|
||||||
|
Put("foo", "bar");
|
||||||
|
Delete("foo");
|
||||||
|
Delete("foo");
|
||||||
|
uint64_t num_keys = 0;
|
||||||
|
ASSERT_TRUE(dbfull()->GetIntProperty("rocksdb.estimate-num-keys", &num_keys));
|
||||||
|
ASSERT_EQ(0, num_keys);
|
||||||
|
}
|
||||||
|
|
||||||
#endif // ROCKSDB_LITE
|
#endif // ROCKSDB_LITE
|
||||||
} // namespace rocksdb
|
} // namespace rocksdb
|
||||||
|
|
||||||
|
@ -1,7 +1,7 @@
|
|||||||
// Copyright (c) 2016-present, Facebook, Inc. All rights reserved.
|
// Copyright (c) 2016-present, Facebook, Inc. All rights reserved.
|
||||||
// This source code is licensed under the BSD-style license found in the
|
// This source code is licensed under both the GPLv2 (found in the
|
||||||
// LICENSE file in the root directory of this source tree. An additional grant
|
// COPYING file in the root directory) and Apache 2.0 License
|
||||||
// of patent rights can be found in the PATENTS file in the same directory.
|
// (found in the LICENSE.Apache file in the root directory).
|
||||||
|
|
||||||
#include "db/db_test_util.h"
|
#include "db/db_test_util.h"
|
||||||
#include "port/stack_trace.h"
|
#include "port/stack_trace.h"
|
||||||
|
@ -1,7 +1,7 @@
|
|||||||
// Copyright (c) 2011-present, Facebook, Inc. All rights reserved.
|
// Copyright (c) 2011-present, Facebook, Inc. All rights reserved.
|
||||||
// This source code is licensed under the BSD-style license found in the
|
// This source code is licensed under both the GPLv2 (found in the
|
||||||
// LICENSE file in the root directory of this source tree. An additional grant
|
// COPYING file in the root directory) and Apache 2.0 License
|
||||||
// of patent rights can be found in the PATENTS file in the same directory.
|
// (found in the LICENSE.Apache file in the root directory).
|
||||||
//
|
//
|
||||||
// Copyright (c) 2011 The LevelDB Authors. All rights reserved.
|
// Copyright (c) 2011 The LevelDB Authors. All rights reserved.
|
||||||
// Use of this source code is governed by a BSD-style license that can be
|
// Use of this source code is governed by a BSD-style license that can be
|
||||||
|
149
db/db_statistics_test.cc
Normal file
149
db/db_statistics_test.cc
Normal file
@ -0,0 +1,149 @@
|
|||||||
|
// Copyright (c) 2011-present, Facebook, Inc. All rights reserved.
|
||||||
|
// This source code is licensed under the BSD-style license found in the
|
||||||
|
// LICENSE file in the root directory of this source tree. An additional grant
|
||||||
|
// of patent rights can be found in the PATENTS file in the same directory.
|
||||||
|
|
||||||
|
#include <string>
|
||||||
|
|
||||||
|
#include "db/db_test_util.h"
|
||||||
|
#include "monitoring/thread_status_util.h"
|
||||||
|
#include "port/stack_trace.h"
|
||||||
|
#include "rocksdb/statistics.h"
|
||||||
|
|
||||||
|
namespace rocksdb {
|
||||||
|
|
||||||
|
class DBStatisticsTest : public DBTestBase {
|
||||||
|
public:
|
||||||
|
DBStatisticsTest() : DBTestBase("/db_statistics_test") {}
|
||||||
|
};
|
||||||
|
|
||||||
|
TEST_F(DBStatisticsTest, CompressionStatsTest) {
|
||||||
|
CompressionType type;
|
||||||
|
|
||||||
|
if (Snappy_Supported()) {
|
||||||
|
type = kSnappyCompression;
|
||||||
|
fprintf(stderr, "using snappy\n");
|
||||||
|
} else if (Zlib_Supported()) {
|
||||||
|
type = kZlibCompression;
|
||||||
|
fprintf(stderr, "using zlib\n");
|
||||||
|
} else if (BZip2_Supported()) {
|
||||||
|
type = kBZip2Compression;
|
||||||
|
fprintf(stderr, "using bzip2\n");
|
||||||
|
} else if (LZ4_Supported()) {
|
||||||
|
type = kLZ4Compression;
|
||||||
|
fprintf(stderr, "using lz4\n");
|
||||||
|
} else if (XPRESS_Supported()) {
|
||||||
|
type = kXpressCompression;
|
||||||
|
fprintf(stderr, "using xpress\n");
|
||||||
|
} else if (ZSTD_Supported()) {
|
||||||
|
type = kZSTD;
|
||||||
|
fprintf(stderr, "using ZSTD\n");
|
||||||
|
} else {
|
||||||
|
fprintf(stderr, "skipping test, compression disabled\n");
|
||||||
|
return;
|
||||||
|
}
|
||||||
|
|
||||||
|
Options options = CurrentOptions();
|
||||||
|
options.compression = type;
|
||||||
|
options.statistics = rocksdb::CreateDBStatistics();
|
||||||
|
options.statistics->stats_level_ = StatsLevel::kExceptTimeForMutex;
|
||||||
|
DestroyAndReopen(options);
|
||||||
|
|
||||||
|
int kNumKeysWritten = 100000;
|
||||||
|
|
||||||
|
// Check that compressions occur and are counted when compression is turned on
|
||||||
|
Random rnd(301);
|
||||||
|
for (int i = 0; i < kNumKeysWritten; ++i) {
|
||||||
|
// compressible string
|
||||||
|
ASSERT_OK(Put(Key(i), RandomString(&rnd, 128) + std::string(128, 'a')));
|
||||||
|
}
|
||||||
|
ASSERT_OK(Flush());
|
||||||
|
ASSERT_GT(options.statistics->getTickerCount(NUMBER_BLOCK_COMPRESSED), 0);
|
||||||
|
|
||||||
|
for (int i = 0; i < kNumKeysWritten; ++i) {
|
||||||
|
auto r = Get(Key(i));
|
||||||
|
}
|
||||||
|
ASSERT_GT(options.statistics->getTickerCount(NUMBER_BLOCK_DECOMPRESSED), 0);
|
||||||
|
|
||||||
|
options.compression = kNoCompression;
|
||||||
|
DestroyAndReopen(options);
|
||||||
|
uint64_t currentCompressions =
|
||||||
|
options.statistics->getTickerCount(NUMBER_BLOCK_COMPRESSED);
|
||||||
|
uint64_t currentDecompressions =
|
||||||
|
options.statistics->getTickerCount(NUMBER_BLOCK_DECOMPRESSED);
|
||||||
|
|
||||||
|
// Check that compressions do not occur when turned off
|
||||||
|
for (int i = 0; i < kNumKeysWritten; ++i) {
|
||||||
|
// compressible string
|
||||||
|
ASSERT_OK(Put(Key(i), RandomString(&rnd, 128) + std::string(128, 'a')));
|
||||||
|
}
|
||||||
|
ASSERT_OK(Flush());
|
||||||
|
ASSERT_EQ(options.statistics->getTickerCount(NUMBER_BLOCK_COMPRESSED)
|
||||||
|
- currentCompressions, 0);
|
||||||
|
|
||||||
|
for (int i = 0; i < kNumKeysWritten; ++i) {
|
||||||
|
auto r = Get(Key(i));
|
||||||
|
}
|
||||||
|
ASSERT_EQ(options.statistics->getTickerCount(NUMBER_BLOCK_DECOMPRESSED)
|
||||||
|
- currentDecompressions, 0);
|
||||||
|
}
|
||||||
|
|
||||||
|
TEST_F(DBStatisticsTest, MutexWaitStatsDisabledByDefault) {
|
||||||
|
Options options = CurrentOptions();
|
||||||
|
options.create_if_missing = true;
|
||||||
|
options.statistics = rocksdb::CreateDBStatistics();
|
||||||
|
CreateAndReopenWithCF({"pikachu"}, options);
|
||||||
|
const uint64_t kMutexWaitDelay = 100;
|
||||||
|
ThreadStatusUtil::TEST_SetStateDelay(ThreadStatus::STATE_MUTEX_WAIT,
|
||||||
|
kMutexWaitDelay);
|
||||||
|
ASSERT_OK(Put("hello", "rocksdb"));
|
||||||
|
ASSERT_EQ(TestGetTickerCount(options, DB_MUTEX_WAIT_MICROS), 0);
|
||||||
|
ThreadStatusUtil::TEST_SetStateDelay(ThreadStatus::STATE_MUTEX_WAIT, 0);
|
||||||
|
}
|
||||||
|
|
||||||
|
TEST_F(DBStatisticsTest, MutexWaitStats) {
|
||||||
|
Options options = CurrentOptions();
|
||||||
|
options.create_if_missing = true;
|
||||||
|
options.statistics = rocksdb::CreateDBStatistics();
|
||||||
|
options.statistics->stats_level_ = StatsLevel::kAll;
|
||||||
|
CreateAndReopenWithCF({"pikachu"}, options);
|
||||||
|
const uint64_t kMutexWaitDelay = 100;
|
||||||
|
ThreadStatusUtil::TEST_SetStateDelay(ThreadStatus::STATE_MUTEX_WAIT,
|
||||||
|
kMutexWaitDelay);
|
||||||
|
ASSERT_OK(Put("hello", "rocksdb"));
|
||||||
|
ASSERT_GE(TestGetTickerCount(options, DB_MUTEX_WAIT_MICROS), kMutexWaitDelay);
|
||||||
|
ThreadStatusUtil::TEST_SetStateDelay(ThreadStatus::STATE_MUTEX_WAIT, 0);
|
||||||
|
}
|
||||||
|
|
||||||
|
TEST_F(DBStatisticsTest, ResetStats) {
|
||||||
|
Options options = CurrentOptions();
|
||||||
|
options.create_if_missing = true;
|
||||||
|
options.statistics = rocksdb::CreateDBStatistics();
|
||||||
|
DestroyAndReopen(options);
|
||||||
|
for (int i = 0; i < 2; ++i) {
|
||||||
|
// pick arbitrary ticker and histogram. On first iteration they're zero
|
||||||
|
// because db is unused. On second iteration they're zero due to Reset().
|
||||||
|
ASSERT_EQ(0, TestGetTickerCount(options, NUMBER_KEYS_WRITTEN));
|
||||||
|
HistogramData histogram_data;
|
||||||
|
options.statistics->histogramData(DB_WRITE, &histogram_data);
|
||||||
|
ASSERT_EQ(0.0, histogram_data.max);
|
||||||
|
|
||||||
|
if (i == 0) {
|
||||||
|
// The Put() makes some of the ticker/histogram stats nonzero until we
|
||||||
|
// Reset().
|
||||||
|
ASSERT_OK(Put("hello", "rocksdb"));
|
||||||
|
ASSERT_EQ(1, TestGetTickerCount(options, NUMBER_KEYS_WRITTEN));
|
||||||
|
options.statistics->histogramData(DB_WRITE, &histogram_data);
|
||||||
|
ASSERT_GT(histogram_data.max, 0.0);
|
||||||
|
options.statistics->Reset();
|
||||||
|
}
|
||||||
|
}
|
||||||
|
}
|
||||||
|
|
||||||
|
} // namespace rocksdb
|
||||||
|
|
||||||
|
int main(int argc, char** argv) {
|
||||||
|
rocksdb::port::InstallStackTraceHandler();
|
||||||
|
::testing::InitGoogleTest(&argc, argv);
|
||||||
|
return RUN_ALL_TESTS();
|
||||||
|
}
|
Some files were not shown because too many files have changed in this diff Show More
Loading…
Reference in New Issue
Block a user