diff --git a/ACKNOWLEDGMENTS.md b/ACKNOWLEDGMENTS.md
index 7935e4829d..9c176790b2 100644
--- a/ACKNOWLEDGMENTS.md
+++ b/ACKNOWLEDGMENTS.md
@@ -429,30 +429,6 @@ Signal Desktop makes use of the following open source projects.
OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
SOFTWARE.
-## @signalapp/better-sqlite3
-
- The MIT License (MIT)
-
- Copyright (c) 2017 Joshua Wise
-
- Permission is hereby granted, free of charge, to any person obtaining a copy
- of this software and associated documentation files (the "Software"), to deal
- in the Software without restriction, including without limitation the rights
- to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
- copies of the Software, and to permit persons to whom the Software is
- furnished to do so, subject to the following conditions:
-
- The above copyright notice and this permission notice shall be included in all
- copies or substantial portions of the Software.
-
- THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
- IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
- FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
- AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
- LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
- OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
- SOFTWARE.
-
## @signalapp/quill-cjs
Copyright (c) 2017-2024, Slab
@@ -487,6 +463,670 @@ Signal Desktop makes use of the following open source projects.
(INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
+## @signalapp/sqlcipher
+
+ GNU AFFERO GENERAL PUBLIC LICENSE
+ Version 3, 19 November 2007
+
+ Copyright (C) 2007 Free Software Foundation, Inc.
+ Everyone is permitted to copy and distribute verbatim copies
+ of this license document, but changing it is not allowed.
+
+ Preamble
+
+ The GNU Affero General Public License is a free, copyleft license for
+ software and other kinds of works, specifically designed to ensure
+ cooperation with the community in the case of network server software.
+
+ The licenses for most software and other practical works are designed
+ to take away your freedom to share and change the works. By contrast,
+ our General Public Licenses are intended to guarantee your freedom to
+ share and change all versions of a program--to make sure it remains free
+ software for all its users.
+
+ 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
+ them 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.
+
+ Developers that use our General Public Licenses protect your rights
+ with two steps: (1) assert copyright on the software, and (2) offer
+ you this License which gives you legal permission to copy, distribute
+ and/or modify the software.
+
+ A secondary benefit of defending all users' freedom is that
+ improvements made in alternate versions of the program, if they
+ receive widespread use, become available for other developers to
+ incorporate. Many developers of free software are heartened and
+ encouraged by the resulting cooperation. However, in the case of
+ software used on network servers, this result may fail to come about.
+ The GNU General Public License permits making a modified version and
+ letting the public access it on a server without ever releasing its
+ source code to the public.
+
+ The GNU Affero General Public License is designed specifically to
+ ensure that, in such cases, the modified source code becomes available
+ to the community. It requires the operator of a network server to
+ provide the source code of the modified version running there to the
+ users of that server. Therefore, public use of a modified version, on
+ a publicly accessible server, gives the public access to the source
+ code of the modified version.
+
+ An older license, called the Affero General Public License and
+ published by Affero, was designed to accomplish similar goals. This is
+ a different license, not a version of the Affero GPL, but Affero has
+ released a new version of the Affero GPL which permits relicensing under
+ this license.
+
+ The precise terms and conditions for copying, distribution and
+ modification follow.
+
+ TERMS AND CONDITIONS
+
+ 0. Definitions.
+
+ "This License" refers to version 3 of the GNU Affero General Public License.
+
+ "Copyright" also means copyright-like laws that apply to other kinds of
+ works, such as semiconductor masks.
+
+ "The Program" refers to any copyrightable work licensed under this
+ License. Each licensee is addressed as "you". "Licensees" and
+ "recipients" may be individuals or organizations.
+
+ To "modify" a work means to copy from or adapt all or part of the work
+ in a fashion requiring copyright permission, other than the making of an
+ exact copy. The resulting work is called a "modified version" of the
+ earlier work or a work "based on" the earlier work.
+
+ A "covered work" means either the unmodified Program or a work based
+ on the Program.
+
+ To "propagate" a work means to do anything with it that, without
+ permission, would make you directly or secondarily liable for
+ infringement under applicable copyright law, except executing it on a
+ computer or modifying a private copy. Propagation includes copying,
+ distribution (with or without modification), making available to the
+ public, and in some countries other activities as well.
+
+ To "convey" a work means any kind of propagation that enables other
+ parties to make or receive copies. Mere interaction with a user through
+ a computer network, with no transfer of a copy, is not conveying.
+
+ An interactive user interface displays "Appropriate Legal Notices"
+ to the extent that it includes a convenient and prominently visible
+ feature that (1) displays an appropriate copyright notice, and (2)
+ tells the user that there is no warranty for the work (except to the
+ extent that warranties are provided), that licensees may convey the
+ work under this License, and how to view a copy of this License. If
+ the interface presents a list of user commands or options, such as a
+ menu, a prominent item in the list meets this criterion.
+
+ 1. Source Code.
+
+ The "source code" for a work means the preferred form of the work
+ for making modifications to it. "Object code" means any non-source
+ form of a work.
+
+ A "Standard Interface" means an interface that either is an official
+ standard defined by a recognized standards body, or, in the case of
+ interfaces specified for a particular programming language, one that
+ is widely used among developers working in that language.
+
+ The "System Libraries" of an executable work include anything, other
+ than the work as a whole, that (a) is included in the normal form of
+ packaging a Major Component, but which is not part of that Major
+ Component, and (b) serves only to enable use of the work with that
+ Major Component, or to implement a Standard Interface for which an
+ implementation is available to the public in source code form. A
+ "Major Component", in this context, means a major essential component
+ (kernel, window system, and so on) of the specific operating system
+ (if any) on which the executable work runs, or a compiler used to
+ produce the work, or an object code interpreter used to run it.
+
+ The "Corresponding Source" for a work in object code form means all
+ the source code needed to generate, install, and (for an executable
+ work) run the object code and to modify the work, including scripts to
+ control those activities. However, it does not include the work's
+ System Libraries, or general-purpose tools or generally available free
+ programs which are used unmodified in performing those activities but
+ which are not part of the work. For example, Corresponding Source
+ includes interface definition files associated with source files for
+ the work, and the source code for shared libraries and dynamically
+ linked subprograms that the work is specifically designed to require,
+ such as by intimate data communication or control flow between those
+ subprograms and other parts of the work.
+
+ The Corresponding Source need not include anything that users
+ can regenerate automatically from other parts of the Corresponding
+ Source.
+
+ The Corresponding Source for a work in source code form is that
+ same work.
+
+ 2. Basic Permissions.
+
+ All rights granted under this License are granted for the term of
+ copyright on the Program, and are irrevocable provided the stated
+ conditions are met. This License explicitly affirms your unlimited
+ permission to run the unmodified Program. The output from running a
+ covered work is covered by this License only if the output, given its
+ content, constitutes a covered work. This License acknowledges your
+ rights of fair use or other equivalent, as provided by copyright law.
+
+ You may make, run and propagate covered works that you do not
+ convey, without conditions so long as your license otherwise remains
+ in force. You may convey covered works to others for the sole purpose
+ of having them make modifications exclusively for you, or provide you
+ with facilities for running those works, provided that you comply with
+ the terms of this License in conveying all material for which you do
+ not control copyright. Those thus making or running the covered works
+ for you must do so exclusively on your behalf, under your direction
+ and control, on terms that prohibit them from making any copies of
+ your copyrighted material outside their relationship with you.
+
+ Conveying under any other circumstances is permitted solely under
+ the conditions stated below. Sublicensing is not allowed; section 10
+ makes it unnecessary.
+
+ 3. Protecting Users' Legal Rights From Anti-Circumvention Law.
+
+ No covered work shall be deemed part of an effective technological
+ measure under any applicable law fulfilling obligations under article
+ 11 of the WIPO copyright treaty adopted on 20 December 1996, or
+ similar laws prohibiting or restricting circumvention of such
+ measures.
+
+ When you convey a covered work, you waive any legal power to forbid
+ circumvention of technological measures to the extent such circumvention
+ is effected by exercising rights under this License with respect to
+ the covered work, and you disclaim any intention to limit operation or
+ modification of the work as a means of enforcing, against the work's
+ users, your or third parties' legal rights to forbid circumvention of
+ technological measures.
+
+ 4. Conveying Verbatim Copies.
+
+ You may convey 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;
+ keep intact all notices stating that this License and any
+ non-permissive terms added in accord with section 7 apply to the code;
+ keep intact all notices of the absence of any warranty; and give all
+ recipients a copy of this License along with the Program.
+
+ You may charge any price or no price for each copy that you convey,
+ and you may offer support or warranty protection for a fee.
+
+ 5. Conveying Modified Source Versions.
+
+ You may convey a work based on the Program, or the modifications to
+ produce it from the Program, in the form of source code under the
+ terms of section 4, provided that you also meet all of these conditions:
+
+ a) The work must carry prominent notices stating that you modified
+ it, and giving a relevant date.
+
+ b) The work must carry prominent notices stating that it is
+ released under this License and any conditions added under section
+ 7. This requirement modifies the requirement in section 4 to
+ "keep intact all notices".
+
+ c) You must license the entire work, as a whole, under this
+ License to anyone who comes into possession of a copy. This
+ License will therefore apply, along with any applicable section 7
+ additional terms, to the whole of the work, and all its parts,
+ regardless of how they are packaged. This License gives no
+ permission to license the work in any other way, but it does not
+ invalidate such permission if you have separately received it.
+
+ d) If the work has interactive user interfaces, each must display
+ Appropriate Legal Notices; however, if the Program has interactive
+ interfaces that do not display Appropriate Legal Notices, your
+ work need not make them do so.
+
+ A compilation of a covered work with other separate and independent
+ works, which are not by their nature extensions of the covered work,
+ and which are not combined with it such as to form a larger program,
+ in or on a volume of a storage or distribution medium, is called an
+ "aggregate" if the compilation and its resulting copyright are not
+ used to limit the access or legal rights of the compilation's users
+ beyond what the individual works permit. Inclusion of a covered work
+ in an aggregate does not cause this License to apply to the other
+ parts of the aggregate.
+
+ 6. Conveying Non-Source Forms.
+
+ You may convey a covered work in object code form under the terms
+ of sections 4 and 5, provided that you also convey the
+ machine-readable Corresponding Source under the terms of this License,
+ in one of these ways:
+
+ a) Convey the object code in, or embodied in, a physical product
+ (including a physical distribution medium), accompanied by the
+ Corresponding Source fixed on a durable physical medium
+ customarily used for software interchange.
+
+ b) Convey the object code in, or embodied in, a physical product
+ (including a physical distribution medium), accompanied by a
+ written offer, valid for at least three years and valid for as
+ long as you offer spare parts or customer support for that product
+ model, to give anyone who possesses the object code either (1) a
+ copy of the Corresponding Source for all the software in the
+ product that is covered by this License, on a durable physical
+ medium customarily used for software interchange, for a price no
+ more than your reasonable cost of physically performing this
+ conveying of source, or (2) access to copy the
+ Corresponding Source from a network server at no charge.
+
+ c) Convey individual copies of the object code with a copy of the
+ written offer to provide the Corresponding Source. This
+ alternative is allowed only occasionally and noncommercially, and
+ only if you received the object code with such an offer, in accord
+ with subsection 6b.
+
+ d) Convey the object code by offering access from a designated
+ place (gratis or for a charge), and offer equivalent access to the
+ Corresponding Source in the same way through the same place at no
+ further charge. You need not require recipients to copy the
+ Corresponding Source along with the object code. If the place to
+ copy the object code is a network server, the Corresponding Source
+ may be on a different server (operated by you or a third party)
+ that supports equivalent copying facilities, provided you maintain
+ clear directions next to the object code saying where to find the
+ Corresponding Source. Regardless of what server hosts the
+ Corresponding Source, you remain obligated to ensure that it is
+ available for as long as needed to satisfy these requirements.
+
+ e) Convey the object code using peer-to-peer transmission, provided
+ you inform other peers where the object code and Corresponding
+ Source of the work are being offered to the general public at no
+ charge under subsection 6d.
+
+ A separable portion of the object code, whose source code is excluded
+ from the Corresponding Source as a System Library, need not be
+ included in conveying the object code work.
+
+ A "User Product" is either (1) a "consumer product", which means any
+ tangible personal property which is normally used for personal, family,
+ or household purposes, or (2) anything designed or sold for incorporation
+ into a dwelling. In determining whether a product is a consumer product,
+ doubtful cases shall be resolved in favor of coverage. For a particular
+ product received by a particular user, "normally used" refers to a
+ typical or common use of that class of product, regardless of the status
+ of the particular user or of the way in which the particular user
+ actually uses, or expects or is expected to use, the product. A product
+ is a consumer product regardless of whether the product has substantial
+ commercial, industrial or non-consumer uses, unless such uses represent
+ the only significant mode of use of the product.
+
+ "Installation Information" for a User Product means any methods,
+ procedures, authorization keys, or other information required to install
+ and execute modified versions of a covered work in that User Product from
+ a modified version of its Corresponding Source. The information must
+ suffice to ensure that the continued functioning of the modified object
+ code is in no case prevented or interfered with solely because
+ modification has been made.
+
+ If you convey an object code work under this section in, or with, or
+ specifically for use in, a User Product, and the conveying occurs as
+ part of a transaction in which the right of possession and use of the
+ User Product is transferred to the recipient in perpetuity or for a
+ fixed term (regardless of how the transaction is characterized), the
+ Corresponding Source conveyed under this section must be accompanied
+ by the Installation Information. But this requirement does not apply
+ if neither you nor any third party retains the ability to install
+ modified object code on the User Product (for example, the work has
+ been installed in ROM).
+
+ The requirement to provide Installation Information does not include a
+ requirement to continue to provide support service, warranty, or updates
+ for a work that has been modified or installed by the recipient, or for
+ the User Product in which it has been modified or installed. Access to a
+ network may be denied when the modification itself materially and
+ adversely affects the operation of the network or violates the rules and
+ protocols for communication across the network.
+
+ Corresponding Source conveyed, and Installation Information provided,
+ in accord with this section must be in a format that is publicly
+ documented (and with an implementation available to the public in
+ source code form), and must require no special password or key for
+ unpacking, reading or copying.
+
+ 7. Additional Terms.
+
+ "Additional permissions" are terms that supplement the terms of this
+ License by making exceptions from one or more of its conditions.
+ Additional permissions that are applicable to the entire Program shall
+ be treated as though they were included in this License, to the extent
+ that they are valid under applicable law. If additional permissions
+ apply only to part of the Program, that part may be used separately
+ under those permissions, but the entire Program remains governed by
+ this License without regard to the additional permissions.
+
+ When you convey a copy of a covered work, you may at your option
+ remove any additional permissions from that copy, or from any part of
+ it. (Additional permissions may be written to require their own
+ removal in certain cases when you modify the work.) You may place
+ additional permissions on material, added by you to a covered work,
+ for which you have or can give appropriate copyright permission.
+
+ Notwithstanding any other provision of this License, for material you
+ add to a covered work, you may (if authorized by the copyright holders of
+ that material) supplement the terms of this License with terms:
+
+ a) Disclaiming warranty or limiting liability differently from the
+ terms of sections 15 and 16 of this License; or
+
+ b) Requiring preservation of specified reasonable legal notices or
+ author attributions in that material or in the Appropriate Legal
+ Notices displayed by works containing it; or
+
+ c) Prohibiting misrepresentation of the origin of that material, or
+ requiring that modified versions of such material be marked in
+ reasonable ways as different from the original version; or
+
+ d) Limiting the use for publicity purposes of names of licensors or
+ authors of the material; or
+
+ e) Declining to grant rights under trademark law for use of some
+ trade names, trademarks, or service marks; or
+
+ f) Requiring indemnification of licensors and authors of that
+ material by anyone who conveys the material (or modified versions of
+ it) with contractual assumptions of liability to the recipient, for
+ any liability that these contractual assumptions directly impose on
+ those licensors and authors.
+
+ All other non-permissive additional terms are considered "further
+ restrictions" within the meaning of section 10. If the Program as you
+ received it, or any part of it, contains a notice stating that it is
+ governed by this License along with a term that is a further
+ restriction, you may remove that term. If a license document contains
+ a further restriction but permits relicensing or conveying under this
+ License, you may add to a covered work material governed by the terms
+ of that license document, provided that the further restriction does
+ not survive such relicensing or conveying.
+
+ If you add terms to a covered work in accord with this section, you
+ must place, in the relevant source files, a statement of the
+ additional terms that apply to those files, or a notice indicating
+ where to find the applicable terms.
+
+ Additional terms, permissive or non-permissive, may be stated in the
+ form of a separately written license, or stated as exceptions;
+ the above requirements apply either way.
+
+ 8. Termination.
+
+ You may not propagate or modify a covered work except as expressly
+ provided under this License. Any attempt otherwise to propagate or
+ modify it is void, and will automatically terminate your rights under
+ this License (including any patent licenses granted under the third
+ paragraph of section 11).
+
+ However, if you cease all violation of this License, then your
+ license from a particular copyright holder is reinstated (a)
+ provisionally, unless and until the copyright holder explicitly and
+ finally terminates your license, and (b) permanently, if the copyright
+ holder fails to notify you of the violation by some reasonable means
+ prior to 60 days after the cessation.
+
+ Moreover, your license from a particular copyright holder is
+ reinstated permanently if the copyright holder notifies you of the
+ violation by some reasonable means, this is the first time you have
+ received notice of violation of this License (for any work) from that
+ copyright holder, and you cure the violation prior to 30 days after
+ your receipt of the notice.
+
+ Termination of your rights under this section does not terminate the
+ licenses of parties who have received copies or rights from you under
+ this License. If your rights have been terminated and not permanently
+ reinstated, you do not qualify to receive new licenses for the same
+ material under section 10.
+
+ 9. Acceptance Not Required for Having Copies.
+
+ You are not required to accept this License in order to receive or
+ run a copy of the Program. Ancillary propagation of a covered work
+ occurring solely as a consequence of using peer-to-peer transmission
+ to receive a copy likewise does not require acceptance. However,
+ nothing other than this License grants you permission to propagate or
+ modify any covered work. These actions infringe copyright if you do
+ not accept this License. Therefore, by modifying or propagating a
+ covered work, you indicate your acceptance of this License to do so.
+
+ 10. Automatic Licensing of Downstream Recipients.
+
+ Each time you convey a covered work, the recipient automatically
+ receives a license from the original licensors, to run, modify and
+ propagate that work, subject to this License. You are not responsible
+ for enforcing compliance by third parties with this License.
+
+ An "entity transaction" is a transaction transferring control of an
+ organization, or substantially all assets of one, or subdividing an
+ organization, or merging organizations. If propagation of a covered
+ work results from an entity transaction, each party to that
+ transaction who receives a copy of the work also receives whatever
+ licenses to the work the party's predecessor in interest had or could
+ give under the previous paragraph, plus a right to possession of the
+ Corresponding Source of the work from the predecessor in interest, if
+ the predecessor has it or can get it with reasonable efforts.
+
+ You may not impose any further restrictions on the exercise of the
+ rights granted or affirmed under this License. For example, you may
+ not impose a license fee, royalty, or other charge for exercise of
+ rights granted under this License, and you may not initiate litigation
+ (including a cross-claim or counterclaim in a lawsuit) alleging that
+ any patent claim is infringed by making, using, selling, offering for
+ sale, or importing the Program or any portion of it.
+
+ 11. Patents.
+
+ A "contributor" is a copyright holder who authorizes use under this
+ License of the Program or a work on which the Program is based. The
+ work thus licensed is called the contributor's "contributor version".
+
+ A contributor's "essential patent claims" are all patent claims
+ owned or controlled by the contributor, whether already acquired or
+ hereafter acquired, that would be infringed by some manner, permitted
+ by this License, of making, using, or selling its contributor version,
+ but do not include claims that would be infringed only as a
+ consequence of further modification of the contributor version. For
+ purposes of this definition, "control" includes the right to grant
+ patent sublicenses in a manner consistent with the requirements of
+ this License.
+
+ Each contributor grants you a non-exclusive, worldwide, royalty-free
+ patent license under the contributor's essential patent claims, to
+ make, use, sell, offer for sale, import and otherwise run, modify and
+ propagate the contents of its contributor version.
+
+ In the following three paragraphs, a "patent license" is any express
+ agreement or commitment, however denominated, not to enforce a patent
+ (such as an express permission to practice a patent or covenant not to
+ sue for patent infringement). To "grant" such a patent license to a
+ party means to make such an agreement or commitment not to enforce a
+ patent against the party.
+
+ If you convey a covered work, knowingly relying on a patent license,
+ and the Corresponding Source of the work is not available for anyone
+ to copy, free of charge and under the terms of this License, through a
+ publicly available network server or other readily accessible means,
+ then you must either (1) cause the Corresponding Source to be so
+ available, or (2) arrange to deprive yourself of the benefit of the
+ patent license for this particular work, or (3) arrange, in a manner
+ consistent with the requirements of this License, to extend the patent
+ license to downstream recipients. "Knowingly relying" means you have
+ actual knowledge that, but for the patent license, your conveying the
+ covered work in a country, or your recipient's use of the covered work
+ in a country, would infringe one or more identifiable patents in that
+ country that you have reason to believe are valid.
+
+ If, pursuant to or in connection with a single transaction or
+ arrangement, you convey, or propagate by procuring conveyance of, a
+ covered work, and grant a patent license to some of the parties
+ receiving the covered work authorizing them to use, propagate, modify
+ or convey a specific copy of the covered work, then the patent license
+ you grant is automatically extended to all recipients of the covered
+ work and works based on it.
+
+ A patent license is "discriminatory" if it does not include within
+ the scope of its coverage, prohibits the exercise of, or is
+ conditioned on the non-exercise of one or more of the rights that are
+ specifically granted under this License. You may not convey a covered
+ work if you are a party to an arrangement with a third party that is
+ in the business of distributing software, under which you make payment
+ to the third party based on the extent of your activity of conveying
+ the work, and under which the third party grants, to any of the
+ parties who would receive the covered work from you, a discriminatory
+ patent license (a) in connection with copies of the covered work
+ conveyed by you (or copies made from those copies), or (b) primarily
+ for and in connection with specific products or compilations that
+ contain the covered work, unless you entered into that arrangement,
+ or that patent license was granted, prior to 28 March 2007.
+
+ Nothing in this License shall be construed as excluding or limiting
+ any implied license or other defenses to infringement that may
+ otherwise be available to you under applicable patent law.
+
+ 12. No Surrender of Others' Freedom.
+
+ If 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 convey a
+ covered work so as to satisfy simultaneously your obligations under this
+ License and any other pertinent obligations, then as a consequence you may
+ not convey it at all. For example, if you agree to terms that obligate you
+ to collect a royalty for further conveying from those to whom you convey
+ the Program, the only way you could satisfy both those terms and this
+ License would be to refrain entirely from conveying the Program.
+
+ 13. Remote Network Interaction; Use with the GNU General Public License.
+
+ Notwithstanding any other provision of this License, if you modify the
+ Program, your modified version must prominently offer all users
+ interacting with it remotely through a computer network (if your version
+ supports such interaction) an opportunity to receive the Corresponding
+ Source of your version by providing access to the Corresponding Source
+ from a network server at no charge, through some standard or customary
+ means of facilitating copying of software. This Corresponding Source
+ shall include the Corresponding Source for any work covered by version 3
+ of the GNU General Public License that is incorporated pursuant to the
+ following paragraph.
+
+ Notwithstanding any other provision of this License, you have
+ permission to link or combine any covered work with a work licensed
+ under version 3 of the GNU General Public License into a single
+ combined work, and to convey the resulting work. The terms of this
+ License will continue to apply to the part which is the covered work,
+ but the work with which it is combined will remain governed by version
+ 3 of the GNU General Public License.
+
+ 14. Revised Versions of this License.
+
+ The Free Software Foundation may publish revised and/or new versions of
+ the GNU Affero 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 that a certain numbered version of the GNU Affero General
+ Public License "or any later version" applies to it, you have the
+ option of following the terms and conditions either of that numbered
+ version or of any later version published by the Free Software
+ Foundation. If the Program does not specify a version number of the
+ GNU Affero General Public License, you may choose any version ever published
+ by the Free Software Foundation.
+
+ If the Program specifies that a proxy can decide which future
+ versions of the GNU Affero General Public License can be used, that proxy's
+ public statement of acceptance of a version permanently authorizes you
+ to choose that version for the Program.
+
+ Later license versions may give you additional or different
+ permissions. However, no additional obligations are imposed on any
+ author or copyright holder as a result of your choosing to follow a
+ later version.
+
+ 15. Disclaimer of Warranty.
+
+ 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.
+
+ 16. Limitation of Liability.
+
+ IN NO EVENT UNLESS REQUIRED BY APPLICABLE LAW OR AGREED TO IN WRITING
+ WILL ANY COPYRIGHT HOLDER, OR ANY OTHER PARTY WHO MODIFIES AND/OR CONVEYS
+ 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.
+
+ 17. Interpretation of Sections 15 and 16.
+
+ If the disclaimer of warranty and limitation of liability provided
+ above cannot be given local legal effect according to their terms,
+ reviewing courts shall apply local law that most closely approximates
+ an absolute waiver of all civil liability in connection with the
+ Program, unless a warranty or assumption of liability accompanies a
+ copy of the Program in return for a fee.
+
+ 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
+ state the exclusion of warranty; and each file should have at least
+ the "copyright" line and a pointer to where the full notice is found.
+
+
+ Copyright (C)
+
+ This program is free software: you can redistribute it and/or modify
+ it under the terms of the GNU Affero General Public License as published by
+ the Free Software Foundation, either version 3 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 Affero General Public License for more details.
+
+ You should have received a copy of the GNU Affero General Public License
+ along with this program. If not, see .
+
+ Also add information on how to contact you by electronic and paper mail.
+
+ If your software can interact with users remotely through a computer
+ network, you should also make sure that it provides a way for users to
+ get its source. For example, if your program is a web application, its
+ interface could display a "Source" link that leads users to an archive
+ of the code. There are many ways you could offer source, and different
+ solutions will be better for different programs; see section 13 for the
+ specific requirements.
+
+ You should also get your employer (if you work as a programmer) or school,
+ if any, to sign a "copyright disclaimer" for the program, if necessary.
+ For more information on this, and how to apply and follow the GNU AGPL, see
+ .
+
## @tanstack/react-virtual
MIT License
diff --git a/package.json b/package.json
index 85a84817a4..0fbd907c48 100644
--- a/package.json
+++ b/package.json
@@ -117,10 +117,10 @@
"@react-aria/focus": "3.19.1",
"@react-aria/utils": "3.25.3",
"@react-spring/web": "9.7.5",
- "@signalapp/better-sqlite3": "9.0.13",
"@signalapp/libsignal-client": "0.67.3",
"@signalapp/quill-cjs": "2.1.2",
"@signalapp/ringrtc": "2.50.2",
+ "@signalapp/sqlcipher": "1.0.0",
"@tanstack/react-virtual": "3.11.2",
"@types/fabric": "4.5.3",
"backbone": "1.6.0",
@@ -384,7 +384,7 @@
"@indutny/simple-windows-notifications",
"@parcel/watcher",
"@signalapp/libsignal-client",
- "@signalapp/better-sqlite3",
+ "@signalapp/sqlcipher",
"@signalapp/ringrtc",
"@swc/core",
"bufferutil",
@@ -426,7 +426,7 @@
}
},
"sign": "./ts/scripts/sign-macos.js",
- "singleArchFiles": "node_modules/@signalapp/{libsignal-client/prebuilds/**,ringrtc/build/**}",
+ "singleArchFiles": "node_modules/@signalapp/{libsignal-client/prebuilds/**,ringrtc/build/**,sqlcipher/prebuilds/**}",
"target": [
{
"target": "zip",
@@ -607,9 +607,7 @@
"node_modules/socks/build/common/*.js",
"node_modules/socks/build/client/*.js",
"node_modules/smart-buffer/build/*.js",
- "!node_modules/@signalapp/better-sqlite3/deps/*",
- "!node_modules/@signalapp/better-sqlite3/src/*",
- "node_modules/@signalapp/better-sqlite3/build/Release/better_sqlite3.node",
+ "node_modules/@signalapp/sqlcipher/prebuilds/${platform}-${arch}/*.node",
"node_modules/@signalapp/libsignal-client/prebuilds/${platform}-${arch}/*.node",
"!node_modules/@signalapp/ringrtc/scripts/*",
"node_modules/@signalapp/ringrtc/build/${platform}/*${arch}*.node",
diff --git a/pnpm-lock.yaml b/pnpm-lock.yaml
index aa922321dc..eeae08a05b 100644
--- a/pnpm-lock.yaml
+++ b/pnpm-lock.yaml
@@ -124,9 +124,6 @@ importers:
'@react-spring/web':
specifier: 9.7.5
version: 9.7.5(react-dom@17.0.2(react@17.0.2))(react@17.0.2)
- '@signalapp/better-sqlite3':
- specifier: 9.0.13
- version: 9.0.13
'@signalapp/libsignal-client':
specifier: 0.67.3
version: 0.67.3
@@ -136,6 +133,9 @@ importers:
'@signalapp/ringrtc':
specifier: 2.50.2
version: 2.50.2
+ '@signalapp/sqlcipher':
+ specifier: 1.0.0
+ version: 1.0.0
'@tanstack/react-virtual':
specifier: 3.11.2
version: 3.11.2(react-dom@17.0.2(react@17.0.2))(react@17.0.2)
@@ -2529,9 +2529,6 @@ packages:
'@sideway/pinpoint@2.0.0':
resolution: {integrity: sha512-RNiOoTPkptFtSVzQevY/yWtZwf/RxyVnPy/OcA9HBM3MlGDnBEYL5B41H0MTn0Uec8Hi+2qUtTfG2WWZBmMejQ==}
- '@signalapp/better-sqlite3@9.0.13':
- resolution: {integrity: sha512-sl5JJvHz/mGy3JXXcWFq7PxeO/d9SaCjPq/FPc4RCujaTC9JofHLdxQjn2xSSZQBLm28o2as3p6hD9eDk+BVNw==}
-
'@signalapp/libsignal-client@0.60.2':
resolution: {integrity: sha512-tU4kNP/yCwkFntb2ahXOSQJtzdy+YifAB2yv5hw0qyKSidRHLn6bYiz4Zo2tjxLDRoBLAUxCRsQramStiqNZdA==}
@@ -2551,6 +2548,9 @@ packages:
'@signalapp/ringrtc@2.50.2':
resolution: {integrity: sha512-fZgfz4asC4CZsvrhxYMDVbIz0iffde9GhWEgIBpAxgEiLpuURx9YRK1ghnn9eonfZNEXwhrTUXUBlC6xYyy1rQ==}
+ '@signalapp/sqlcipher@1.0.0':
+ resolution: {integrity: sha512-3+4Y/0Tf0gis8gaZrD58cnzVVRzeDtBCPhS3gUdvxgkEXMv4guSJ+MDfHZLQKmqvuPmjTlt+YOsTjvLCWruFaQ==}
+
'@sinclair/typebox@0.27.8':
resolution: {integrity: sha512-+Fj43pSMwJs4KRrH/938Uf+uAELIgVBmQzg/q1YG10djyfA3TnrU8N8XzqCh/okZdszqBQTZf96idMfE5lnwTA==}
@@ -12253,11 +12253,6 @@ snapshots:
'@sideway/pinpoint@2.0.0': {}
- '@signalapp/better-sqlite3@9.0.13':
- dependencies:
- bindings: 1.5.0
- tar: 6.2.1
-
'@signalapp/libsignal-client@0.60.2':
dependencies:
node-gyp-build: 4.8.4
@@ -12309,6 +12304,11 @@ snapshots:
transitivePeerDependencies:
- supports-color
+ '@signalapp/sqlcipher@1.0.0':
+ dependencies:
+ node-addon-api: 8.3.0
+ node-gyp-build: 4.8.4
+
'@sinclair/typebox@0.27.8': {}
'@sindresorhus/is@4.6.0': {}
diff --git a/scripts/esbuild.js b/scripts/esbuild.js
index e37be142e6..c1aca126d8 100644
--- a/scripts/esbuild.js
+++ b/scripts/esbuild.js
@@ -34,7 +34,7 @@ const bundleDefaults = {
'@signalapp/libsignal-client',
'@signalapp/libsignal-client/zkgroup',
'@signalapp/ringrtc',
- '@signalapp/better-sqlite3',
+ '@signalapp/sqlcipher',
'@indutny/mac-screen-share',
'electron',
'fs-xattr',
diff --git a/ts/SignalProtocolStore.ts b/ts/SignalProtocolStore.ts
index 927720b636..30b540fa72 100644
--- a/ts/SignalProtocolStore.ts
+++ b/ts/SignalProtocolStore.ts
@@ -2418,12 +2418,6 @@ export class SignalProtocolStore extends EventEmitter {
);
}
- getUnprocessedById(id: string): Promise {
- return this.withZone(GLOBAL_ZONE, 'getUnprocessedById', async () => {
- return DataReader.getUnprocessedById(id);
- });
- }
-
addUnprocessed(
data: UnprocessedType,
{ zone = GLOBAL_ZONE }: SessionTransactionOptions = {}
diff --git a/ts/sql/Interface.ts b/ts/sql/Interface.ts
index 5e9d8a63c3..0acb43578e 100644
--- a/ts/sql/Interface.ts
+++ b/ts/sql/Interface.ts
@@ -1,7 +1,7 @@
// Copyright 2020 Signal Messenger, LLC
// SPDX-License-Identifier: AGPL-3.0-only
-import type { Database } from '@signalapp/better-sqlite3';
+import type { Database } from '@signalapp/sqlcipher';
import type { ReadonlyDeep } from 'type-fest';
import type {
ConversationAttributesType,
@@ -236,6 +236,13 @@ export type SentProtoType = {
urgent: boolean;
hasPniSignatureMessage: boolean;
};
+export type SentProtoDBType = {
+ contentHint: number;
+ proto: Uint8Array;
+ timestamp: number;
+ urgent: number;
+ hasPniSignatureMessage: number;
+};
export type SentProtoWithMessageIdsType = SentProtoType & {
messageIds: Array;
};
@@ -676,14 +683,14 @@ type ReadableInterface = {
) => Array;
getUnprocessedCount: () => number;
- getUnprocessedById: (id: string) => UnprocessedType | undefined;
- getAttachmentDownloadJob(
+ // Test-only
+ _getAttachmentDownloadJob(
job: Pick<
AttachmentDownloadJobType,
'messageId' | 'attachmentType' | 'digest'
>
- ): AttachmentDownloadJobType;
+ ): AttachmentDownloadJobType | undefined;
getBackupCdnObjectMetadata: (
mediaId: string
diff --git a/ts/sql/Server.ts b/ts/sql/Server.ts
index bb15f4d795..66c20f7b48 100644
--- a/ts/sql/Server.ts
+++ b/ts/sql/Server.ts
@@ -3,8 +3,8 @@
/* eslint-disable camelcase */
-import type { Database, Statement } from '@signalapp/better-sqlite3';
-import SQL from '@signalapp/better-sqlite3';
+// TODO(indutny): format queries
+import SQL from '@signalapp/sqlcipher';
import { randomBytes } from 'crypto';
import { mkdirSync, rmSync } from 'node:fs';
import { join } from 'path';
@@ -30,7 +30,10 @@ import {
} from 'lodash';
import { parseBadgeCategory } from '../badges/BadgeCategory';
-import { parseBadgeImageTheme } from '../badges/BadgeImageTheme';
+import {
+ parseBadgeImageTheme,
+ type BadgeImageTheme,
+} from '../badges/BadgeImageTheme';
import type { BadgeImageType, BadgeType } from '../badges/types';
import type { StoredJob } from '../jobs/types';
import { formatCountForLogging } from '../logging/formatCountForLogging';
@@ -55,8 +58,9 @@ import { isNormalNumber } from '../util/isNormalNumber';
import { isNotNil } from '../util/isNotNil';
import { parseIntOrThrow } from '../util/parseIntOrThrow';
import { updateSchema } from './migrations';
-import type { ArrayQuery, EmptyQuery, JSONRows, Query } from './util';
+import type { JSONRows } from './util';
import {
+ // TODO(indutny): disable caching for final batch
batchMultiVarQuery,
bulkAdd,
createOrUpdate,
@@ -131,7 +135,6 @@ import type {
GetRecentStoryRepliesOptionsType,
GetUnreadByConversationAndMarkReadResultType,
IdentityKeyIdType,
- InstalledStickerPackType,
ItemKeyType,
MessageAttachmentsCursorType,
MessageCursorType,
@@ -147,6 +150,7 @@ import type {
SenderKeyType,
SentMessageDBType,
SentMessagesType,
+ SentProtoDBType,
SentProtoType,
SentProtoWithMessageIdsType,
SentRecipientsDBType,
@@ -228,6 +232,55 @@ type StickerRow = Readonly<{
localKey: string | null;
size: number | null;
}>;
+type StorageServiceRowFields = Readonly<{
+ storageID?: string;
+ storageVersion?: number;
+ storageUnknownFields?: Uint8Array | null;
+ storageNeedsSync: number;
+}>;
+type InstalledStickerPackRow = Readonly<{
+ id: string;
+ key: string;
+
+ position?: number | null;
+}> &
+ StorageServiceRowFields;
+type UninstalledStickerPackRow = Readonly<{
+ id: string;
+
+ uninstalledAt: number;
+}> &
+ StorageServiceRowFields;
+type StickerPackRow = InstalledStickerPackRow &
+ Readonly<{
+ attemptedStatus?: 'downloaded' | 'installed' | 'ephemeral';
+ author: string;
+ coverStickerId: number;
+ createdAt: number;
+ downloadAttempts: number;
+ installedAt?: number;
+ lastUsed?: number;
+ status: StickerPackStatusType;
+ stickerCount: number;
+ stickers: string;
+ title: string;
+ }>;
+type AttachmentDownloadJobRow = Readonly<{
+ messageId: string;
+ attachmentType: string;
+ digest: string;
+ receivedAt: number;
+ sentAt: number;
+ contentType: string;
+ size: number;
+ active: number;
+ attempts: number;
+ retryAfter: number;
+ lastAttemptTimestamp: number;
+ attachmentJson: string;
+ ciphertextSize: number;
+ source: string;
+}>;
// Because we can't force this module to conform to an interface, we narrow our exports
// to this one default export, which does conform to the interface.
@@ -323,8 +376,7 @@ export const DataReader: ServerReadableInterface = {
getMostRecentAddressableMessages,
getMostRecentAddressableNondisappearingMessages,
getUnprocessedCount,
- getUnprocessedById,
- getAttachmentDownloadJob,
+ _getAttachmentDownloadJob,
getStickerCount,
getAllStickerPacks,
@@ -551,34 +603,6 @@ export const DataWriter: ServerWritableInterface = {
runCorruptionChecks,
};
-type DatabaseQueryCache = Map>>;
-
-const statementCache = new WeakMap();
-
-export function prepare | Record>(
- db: ReadableDB,
- query: string,
- { pluck = false }: { pluck?: boolean } = {}
-): Statement {
- let dbCache = statementCache.get(db);
- if (!dbCache) {
- dbCache = new Map();
- statementCache.set(db, dbCache);
- }
-
- const cacheKey = `${pluck}:${query}`;
- let result = dbCache.get(cacheKey) as Statement;
- if (!result) {
- result = db.prepare(query);
- if (pluck === true) {
- result.pluck();
- }
- dbCache.set(cacheKey, result);
- }
-
- return result;
-}
-
const MESSAGE_COLUMNS_FRAGMENTS = MESSAGE_COLUMNS.map(
column => new QueryFragment(column, [])
);
@@ -643,17 +667,13 @@ function migrateSchemaVersion(db: WritableDB): void {
setUserVersion(db, newUserVersion);
}
-function openAndMigrateDatabase(
- filePath: string,
- key: string,
- readonly: boolean
-): WritableDB {
+function openAndMigrateDatabase(filePath: string, key: string): WritableDB {
let db: WritableDB | undefined;
// First, we try to open the database without any cipher changes
try {
db = new SQL(filePath, {
- readonly,
+ cacheStatements: true,
}) as WritableDB;
keyDatabase(db, key);
switchToWAL(db);
@@ -698,16 +718,13 @@ function openAndMigrateDatabase(
}
const INVALID_KEY = /[^0-9A-Fa-f]/;
-function openAndSetUpSQLCipher(
- filePath: string,
- { key, readonly }: { key: string; readonly: boolean }
-) {
+function openAndSetUpSQLCipher(filePath: string, { key }: { key: string }) {
const match = INVALID_KEY.exec(key);
if (match) {
throw new Error(`setupSQLCipher: key '${key}' is not valid`);
}
- const db = openAndMigrateDatabase(filePath, key, readonly);
+ const db = openAndMigrateDatabase(filePath, key);
try {
// Because foreign key support is not enabled by default!
@@ -741,10 +758,6 @@ let logger = consoleLogger;
let databaseFilePath: string | undefined;
let indexedDBPath: string | undefined;
-SQL.setLogHandler((code, value) => {
- logger.warn(`Database log code=${code}: ${value}`);
-});
-
export function initialize({
configDir,
key,
@@ -778,7 +791,6 @@ export function initialize({
try {
db = openAndSetUpSQLCipher(databaseFilePath, {
key,
- readonly: false,
});
// For profiling use:
@@ -918,9 +930,7 @@ function removeKyberPreKeysByServiceId(
db: WritableDB,
serviceId: ServiceIdString
): void {
- db.prepare(
- 'DELETE FROM kyberPreKeys WHERE ourServiceId IS $serviceId;'
- ).run({
+ db.prepare('DELETE FROM kyberPreKeys WHERE ourServiceId IS $serviceId;').run({
serviceId,
});
}
@@ -954,9 +964,7 @@ function removePreKeysByServiceId(
db: WritableDB,
serviceId: ServiceIdString
): void {
- db.prepare(
- 'DELETE FROM preKeys WHERE ourServiceId IS $serviceId;'
- ).run({
+ db.prepare('DELETE FROM preKeys WHERE ourServiceId IS $serviceId;').run({
serviceId,
});
}
@@ -996,18 +1004,18 @@ function removeSignedPreKeysByServiceId(
db: WritableDB,
serviceId: ServiceIdString
): void {
- db.prepare(
- 'DELETE FROM signedPreKeys WHERE ourServiceId IS $serviceId;'
- ).run({
- serviceId,
- });
+ db.prepare('DELETE FROM signedPreKeys WHERE ourServiceId IS $serviceId;').run(
+ {
+ serviceId,
+ }
+ );
}
function removeAllSignedPreKeys(db: WritableDB): number {
return removeAllFromTable(db, SIGNED_PRE_KEYS_TABLE);
}
function getAllSignedPreKeys(db: ReadableDB): Array {
const rows: JSONRows = db
- .prepare(
+ .prepare(
`
SELECT json
FROM signedPreKeys
@@ -1034,7 +1042,7 @@ function getItemById(
}
function getAllItems(db: ReadableDB): StoredAllItemsType {
const rows: JSONRows = db
- .prepare('SELECT json FROM items ORDER BY id ASC;')
+ .prepare('SELECT json FROM items ORDER BY id ASC;')
.all();
type RawItemType = { id: ItemKeyType; value: unknown };
@@ -1060,8 +1068,7 @@ function removeAllItems(db: WritableDB): number {
}
function createOrUpdateSenderKey(db: WritableDB, key: SenderKeyType): void {
- prepare(
- db,
+ db.prepare(
`
INSERT OR REPLACE INTO senderKeys (
id,
@@ -1083,22 +1090,20 @@ function getSenderKeyById(
db: ReadableDB,
id: SenderKeyIdType
): SenderKeyType | undefined {
- const row = prepare(db, 'SELECT * FROM senderKeys WHERE id = $id').get({
- id,
- });
-
- return row;
+ return db
+ .prepare('SELECT * FROM senderKeys WHERE id = $id')
+ .get({
+ id,
+ });
}
function removeAllSenderKeys(db: WritableDB): void {
- prepare(db, 'DELETE FROM senderKeys').run();
+ db.prepare('DELETE FROM senderKeys').run();
}
function getAllSenderKeys(db: ReadableDB): Array {
- const rows = prepare(db, 'SELECT * FROM senderKeys').all();
-
- return rows;
+ return db.prepare('SELECT * FROM senderKeys').all();
}
function removeSenderKeyById(db: WritableDB, id: SenderKeyIdType): void {
- prepare(db, 'DELETE FROM senderKeys WHERE id = $id').run({ id });
+ db.prepare('DELETE FROM senderKeys WHERE id = $id').run({ id });
}
function insertSentProto(
@@ -1115,9 +1120,9 @@ function insertSentProto(
return db.transaction(() => {
// 1. Insert the payload, fetching its primary key id
- const info = prepare(
- db,
- `
+ const info = db
+ .prepare(
+ `
INSERT INTO sendLogPayloads (
contentHint,
proto,
@@ -1132,19 +1137,19 @@ function insertSentProto(
$hasPniSignatureMessage
);
`
- ).run({
- ...proto,
- urgent: proto.urgent ? 1 : 0,
- hasPniSignatureMessage: proto.hasPniSignatureMessage ? 1 : 0,
- });
+ )
+ .run({
+ ...proto,
+ urgent: proto.urgent ? 1 : 0,
+ hasPniSignatureMessage: proto.hasPniSignatureMessage ? 1 : 0,
+ });
const id = parseIntOrThrow(
info.lastInsertRowid,
'insertSentProto/lastInsertRowid'
);
// 2. Insert a record for each recipient device.
- const recipientStatement = prepare(
- db,
+ const recipientStatement = db.prepare(
`
INSERT INTO sendLogRecipients (
payloadId,
@@ -1176,8 +1181,7 @@ function insertSentProto(
}
// 2. Insert a record for each message referenced by this payload.
- const messageStatement = prepare(
- db,
+ const messageStatement = db.prepare(
`
INSERT INTO sendLogMessageIds (
payloadId,
@@ -1201,8 +1205,7 @@ function insertSentProto(
}
function deleteSentProtosOlderThan(db: WritableDB, timestamp: number): void {
- prepare(
- db,
+ db.prepare(
`
DELETE FROM sendLogPayloads
WHERE
@@ -1215,8 +1218,7 @@ function deleteSentProtosOlderThan(db: WritableDB, timestamp: number): void {
}
function deleteSentProtoByMessageId(db: WritableDB, messageId: string): void {
- prepare(
- db,
+ db.prepare(
`
DELETE FROM sendLogPayloads WHERE id IN (
SELECT payloadId FROM sendLogMessageIds
@@ -1241,8 +1243,7 @@ function insertProtoRecipients(
}
): void {
db.transaction(() => {
- const statement = prepare(
- db,
+ const statement = db.prepare(
`
INSERT INTO sendLogRecipients (
payloadId,
@@ -1284,9 +1285,9 @@ function deleteSentProtoRecipient(
const { timestamp, recipientServiceId, deviceId } = item;
// 1. Figure out what payload we're talking about.
- const rows = prepare(
- db,
- `
+ const rows = db
+ .prepare(
+ `
SELECT sendLogPayloads.id, sendLogPayloads.hasPniSignatureMessage
FROM sendLogPayloads
INNER JOIN sendLogRecipients
@@ -1296,7 +1297,8 @@ function deleteSentProtoRecipient(
sendLogRecipients.recipientServiceId = $recipientServiceId AND
sendLogRecipients.deviceId = $deviceId;
`
- ).all({ timestamp, recipientServiceId, deviceId });
+ )
+ .all({ timestamp, recipientServiceId, deviceId });
if (!rows.length) {
continue;
}
@@ -1310,8 +1312,7 @@ function deleteSentProtoRecipient(
const { id, hasPniSignatureMessage } = rows[0];
// 2. Delete the recipient/device combination in question.
- prepare(
- db,
+ db.prepare(
`
DELETE FROM sendLogRecipients
WHERE
@@ -1322,14 +1323,16 @@ function deleteSentProtoRecipient(
).run({ id, recipientServiceId, deviceId });
// 3. See how many more recipient devices there were for this payload.
- const remainingDevices = prepare(
- db,
- `
+ const remainingDevices =
+ db
+ .prepare(
+ `
SELECT count(1) FROM sendLogRecipients
WHERE payloadId = $id AND recipientServiceId = $recipientServiceId;
`,
- { pluck: true }
- ).get({ id, recipientServiceId });
+ { pluck: true }
+ )
+ .get({ id, recipientServiceId }) ?? 0;
// 4. If there are no remaining devices for this recipient and we included
// the pni signature in the proto - return the recipient to the caller.
@@ -1348,11 +1351,12 @@ function deleteSentProtoRecipient(
);
// 5. See how many more recipients there were for this payload.
- const remainingTotal = prepare(
- db,
- 'SELECT count(1) FROM sendLogRecipients WHERE payloadId = $id;',
- { pluck: true }
- ).get({ id });
+ const remainingTotal = db
+ .prepare(
+ 'SELECT count(1) FROM sendLogRecipients WHERE payloadId = $id;',
+ { pluck: true }
+ )
+ .get({ id });
strictAssert(
isNumber(remainingTotal),
@@ -1369,7 +1373,7 @@ function deleteSentProtoRecipient(
`Deleting proto payload for timestamp ${timestamp}`
);
- prepare(db, 'DELETE FROM sendLogPayloads WHERE id = $id;').run({
+ db.prepare('DELETE FROM sendLogPayloads WHERE id = $id;').run({
id,
});
}
@@ -1395,9 +1399,9 @@ function getSentProtoByRecipient(
deleteSentProtosOlderThan(db, oneDayAgo);
- const row = prepare(
- db,
- `
+ const row = db
+ .prepare(
+ `
SELECT
sendLogPayloads.*,
GROUP_CONCAT(DISTINCT sendLogMessageIds.messageId) AS messageIds
@@ -1409,10 +1413,15 @@ function getSentProtoByRecipient(
sendLogRecipients.recipientServiceId = $recipientServiceId
GROUP BY sendLogPayloads.id;
`
- ).get({
- timestamp,
- recipientServiceId,
- });
+ )
+ .get<
+ SentProtoDBType & {
+ messageIds: string;
+ }
+ >({
+ timestamp,
+ recipientServiceId,
+ });
if (!row) {
return undefined;
@@ -1429,10 +1438,12 @@ function getSentProtoByRecipient(
};
}
function removeAllSentProtos(db: WritableDB): void {
- prepare(db, 'DELETE FROM sendLogPayloads;').run();
+ db.prepare('DELETE FROM sendLogPayloads;').run();
}
function getAllSentProtos(db: ReadableDB): Array {
- const rows = prepare(db, 'SELECT * FROM sendLogPayloads;').all();
+ const rows = db
+ .prepare('SELECT * FROM sendLogPayloads;')
+ .all();
return rows.map(row => ({
...row,
@@ -1445,20 +1456,14 @@ function getAllSentProtos(db: ReadableDB): Array {
function _getAllSentProtoRecipients(
db: ReadableDB
): Array {
- const rows = prepare(
- db,
- 'SELECT * FROM sendLogRecipients;'
- ).all();
-
- return rows;
+ return db
+ .prepare('SELECT * FROM sendLogRecipients;')
+ .all();
}
function _getAllSentProtoMessageIds(db: ReadableDB): Array {
- const rows = prepare(
- db,
- 'SELECT * FROM sendLogMessageIds;'
- ).all();
-
- return rows;
+ return db
+ .prepare('SELECT * FROM sendLogMessageIds;')
+ .all();
}
const SESSIONS_TABLE = 'sessions';
@@ -1476,8 +1481,7 @@ function createOrUpdateSession(db: WritableDB, data: SessionType): void {
);
}
- prepare(
- db,
+ db.prepare(
`
INSERT OR REPLACE INTO sessions (
id,
@@ -1550,7 +1554,7 @@ function removeSessionsByConversation(
db: WritableDB,
conversationId: string
): void {
- db.prepare(
+ db.prepare(
`
DELETE FROM sessions
WHERE conversationId = $conversationId;
@@ -1563,7 +1567,7 @@ function removeSessionsByServiceId(
db: WritableDB,
serviceId: ServiceIdString
): void {
- db.prepare(
+ db.prepare(
`
DELETE FROM sessions
WHERE serviceId = $serviceId;
@@ -1611,8 +1615,7 @@ function saveConversation(db: WritableDB, data: ConversationType): void {
const membersList = getConversationMembersList(data);
- prepare(
- db,
+ db.prepare(
`
INSERT INTO conversations (
id,
@@ -1699,8 +1702,7 @@ function updateConversation(db: WritableDB, data: ConversationType): void {
const membersList = getConversationMembersList(data);
- prepare(
- db,
+ db.prepare(
`
UPDATE conversations SET
json = $json,
@@ -1753,7 +1755,7 @@ function updateConversations(
function removeConversations(db: WritableDB, ids: ReadonlyArray): void {
// Our node interface doesn't seem to allow you to replace one single ? with an array
- db.prepare(
+ db.prepare(
`
DELETE FROM conversations
WHERE id IN ( ${ids.map(() => '?').join(', ')} );
@@ -1763,7 +1765,7 @@ function removeConversations(db: WritableDB, ids: ReadonlyArray): void {
function removeConversation(db: WritableDB, id: Array | string): void {
if (!Array.isArray(id)) {
- db.prepare('DELETE FROM conversations WHERE id = $id;').run({
+ db.prepare('DELETE FROM conversations WHERE id = $id;').run({
id,
});
@@ -1778,16 +1780,16 @@ function removeConversation(db: WritableDB, id: Array | string): void {
}
function _removeAllConversations(db: WritableDB): void {
- db.prepare('DELETE from conversations;').run();
+ db.prepare('DELETE from conversations;').run();
}
function getConversationById(
db: ReadableDB,
id: string
): ConversationType | undefined {
- const row: { json: string } = db
- .prepare('SELECT json FROM conversations WHERE id = $id;')
- .get({ id });
+ const row = db
+ .prepare('SELECT json FROM conversations WHERE id = $id;')
+ .get<{ json: string }>({ id });
if (!row) {
return undefined;
@@ -1798,7 +1800,7 @@ function getConversationById(
function getAllConversations(db: ReadableDB): Array {
const rows: ConversationRows = db
- .prepare(
+ .prepare(
`
SELECT json, profileLastFetchedAt, expireTimerVersion
FROM conversations
@@ -1812,7 +1814,7 @@ function getAllConversations(db: ReadableDB): Array {
function getAllConversationIds(db: ReadableDB): Array {
const rows: Array<{ id: string }> = db
- .prepare(
+ .prepare(
`
SELECT id FROM conversations ORDER BY id ASC;
`
@@ -1827,7 +1829,7 @@ function getAllGroupsInvolvingServiceId(
serviceId: ServiceIdString
): Array {
const rows: ConversationRows = db
- .prepare(
+ .prepare(
`
SELECT json, profileLastFetchedAt, expireTimerVersion
FROM conversations WHERE
@@ -1891,7 +1893,7 @@ function searchMessages(
);
writable
- .prepare(
+ .prepare(
`
INSERT INTO tmp_results (rowid)
SELECT
@@ -1906,7 +1908,7 @@ function searchMessages(
if (conversationId === undefined) {
writable
- .prepare(
+ .prepare(
`
INSERT INTO tmp_filtered_results (rowid)
SELECT
@@ -1922,7 +1924,7 @@ function searchMessages(
.run({ limit });
} else {
writable
- .prepare(
+ .prepare(
`
INSERT INTO tmp_filtered_results (rowid)
SELECT
@@ -2029,16 +2031,20 @@ function searchMessages(
}
function getStoryCount(db: ReadableDB, conversationId: string): number {
- return db
- .prepare(
- `
- SELECT count(1)
- FROM messages
- WHERE conversationId = $conversationId AND isStory = 1;
+ return (
+ db
+ .prepare(
`
- )
- .pluck()
- .get({ conversationId });
+ SELECT count(1)
+ FROM messages
+ WHERE conversationId = $conversationId AND isStory = 1;
+ `,
+ {
+ pluck: true,
+ }
+ )
+ .get({ conversationId }) ?? 0
+ );
}
function getMessageCount(db: ReadableDB, conversationId?: string): number {
@@ -2047,17 +2053,19 @@ function getMessageCount(db: ReadableDB, conversationId?: string): number {
}
const count = db
- .prepare(
+ .prepare(
`
- SELECT count(1)
- FROM messages
- WHERE conversationId = $conversationId;
- `
+ SELECT count(1)
+ FROM messages
+ WHERE conversationId = $conversationId;
+ `,
+ {
+ pluck: true,
+ }
)
- .pluck()
- .get({ conversationId });
+ .get({ conversationId });
- return count;
+ return count ?? 0;
}
// Note: we really only use this in 1:1 conversations, where story replies are always
@@ -2066,20 +2074,22 @@ function hasUserInitiatedMessages(
db: ReadableDB,
conversationId: string
): boolean {
- const exists: number = db
- .prepare(
- `
- SELECT EXISTS(
- SELECT 1 FROM messages
- INDEXED BY message_user_initiated
- WHERE
- conversationId IS $conversationId AND
- isUserInitiatedMessage IS 1
- );
+ const exists = db
+ .prepare(
`
+ SELECT EXISTS(
+ SELECT 1 FROM messages
+ INDEXED BY message_user_initiated
+ WHERE
+ conversationId IS $conversationId AND
+ isUserInitiatedMessage IS 1
+ );
+ `,
+ {
+ pluck: true,
+ }
)
- .pluck()
- .get({ conversationId });
+ .get({ conversationId });
return exists !== 0;
}
@@ -2101,7 +2111,7 @@ export function getMostRecentAddressableMessages(
LIMIT ${limit};
`;
- const rows = db.prepare(query).all(parameters);
+ const rows = db.prepare(query).all(parameters);
return rows.map(row => hydrateMessage(row));
}
@@ -2124,7 +2134,7 @@ export function getMostRecentAddressableNondisappearingMessages(
LIMIT ${limit};
`;
- const rows = db.prepare(query).all(parameters);
+ const rows = db.prepare(query).all(parameters);
return rows.map(row => hydrateMessage(row));
}
@@ -2220,7 +2230,12 @@ export function dequeueOldestSyncTasks(
${limit}
`;
- const rows = db.prepare(selectAllQuery).all(selectAllParams);
+ const rows = db.prepare(selectAllQuery).all<
+ {
+ rowid: number;
+ data: string;
+ } & SyncTaskType
+ >(selectAllParams);
if (!rows.length) {
return { tasks: [], lastRowId: null };
}
@@ -2252,12 +2267,15 @@ export function dequeueOldestSyncTasks(
RETURNING id, attempts;
`;
- const res = db.prepare(updateQuery).raw().all(updateParams) as Array<
- [string, number]
- >;
+ const res = db.prepare(updateQuery).all<{
+ id: string;
+ attempts: number;
+ }>(updateParams);
if (Array.isArray(res)) {
- const idToAttempts = new Map(res);
+ const idToAttempts = new Map(
+ res.map(({ id, attempts }) => [id, attempts])
+ );
tasks = tasks.map(task => {
const { id } = task;
const attempts = idToAttempts.get(id) ?? task.attempts;
@@ -2390,8 +2408,7 @@ export function saveMessage(
} satisfies Omit;
if (id && !forceSave) {
- prepare(
- db,
+ db.prepare(
`
UPDATE messages SET
${MESSAGE_COLUMNS.map(name => `${name} = $${name}`).join(', ')}
@@ -2408,8 +2425,7 @@ export function saveMessage(
const createdId = id || generateMessageId(data.received_at).id;
- prepare(
- db,
+ db.prepare(
`
INSERT INTO messages (
${MESSAGE_COLUMNS.join(', ')}
@@ -2475,11 +2491,11 @@ function saveMessagesIndividually(
}
function removeMessage(db: WritableDB, id: string): void {
- db.prepare('DELETE FROM messages WHERE id = $id;').run({ id });
+ db.prepare('DELETE FROM messages WHERE id = $id;').run({ id });
}
function removeMessagesBatch(db: WritableDB, ids: ReadonlyArray): void {
- db.prepare(
+ db.prepare(
`
DELETE FROM messages
WHERE id IN ( ${ids.map(() => '?').join(', ')} );
@@ -2496,14 +2512,14 @@ export function getMessageById(
id: string
): MessageType | undefined {
const row = db
- .prepare(
+ .prepare(
`
SELECT ${MESSAGE_COLUMNS.join(', ')}
FROM messages
WHERE id = $id;
`
)
- .get({
+ .get({
id,
});
@@ -2522,7 +2538,7 @@ function getMessagesById(
db,
messageIds,
(batch: ReadonlyArray): Array => {
- const query = db.prepare(
+ const query = db.prepare(
`
SELECT ${MESSAGE_COLUMNS.join(', ')}
FROM messages
@@ -2538,7 +2554,7 @@ function getMessagesById(
function _getAllMessages(db: ReadableDB): Array {
const rows: Array = db
- .prepare(
+ .prepare(
`
SELECT ${MESSAGE_COLUMNS.join(', ')}
FROM messages ORDER BY id ASC
@@ -2557,7 +2573,7 @@ function _removeAllMessages(db: WritableDB): void {
function getAllMessageIds(db: ReadableDB): Array {
const rows: Array<{ id: string }> = db
- .prepare('SELECT id FROM messages ORDER BY id ASC;')
+ .prepare('SELECT id FROM messages ORDER BY id ASC;')
.all();
return rows.map(row => row.id);
@@ -2577,21 +2593,22 @@ function getMessageBySender(
sent_at: number;
}
): MessageType | undefined {
- const rows: Array = prepare(
- db,
- `
+ const rows: Array = db
+ .prepare(
+ `
SELECT ${MESSAGE_COLUMNS.join(', ')} FROM messages WHERE
(source = $source OR sourceServiceId = $sourceServiceId) AND
sourceDevice = $sourceDevice AND
sent_at = $sent_at
LIMIT 2;
`
- ).all({
- source: source || null,
- sourceServiceId: sourceServiceId || null,
- sourceDevice: sourceDevice || null,
- sent_at,
- });
+ )
+ .all({
+ source: source || null,
+ sourceServiceId: sourceServiceId || null,
+ sourceDevice: sourceDevice || null,
+ sent_at,
+ });
if (rows.length > 1) {
logger.warn('getMessageBySender: More than one message found for', {
@@ -2618,11 +2635,11 @@ export function _storyIdPredicate(
// always be true. We don't just return TRUE because we want to use our passed-in
// $storyId parameter.
if (includeStoryReplies && storyId === undefined) {
- return sqlFragment`${storyId} IS NULL`;
+ return sqlFragment`NULL IS NULL`;
}
// In contrast to: replies to a specific story
- return sqlFragment`storyId IS ${storyId}`;
+ return sqlFragment`storyId IS ${storyId ?? null}`;
}
function getUnreadByConversationAndMarkRead(
@@ -2682,7 +2699,9 @@ function getUnreadByConversationAndMarkRead(
ORDER BY received_at DESC, sent_at DESC;
`;
- const rows = db.prepare(selectQuery).all(selectParams);
+ const rows = db
+ .prepare(selectQuery)
+ .all(selectParams);
const statusJsonPatch = JSON.stringify({
readStatus: ReadStatus.Read,
@@ -2738,7 +2757,7 @@ function getUnreadReactionsAndMarkRead(
): Array {
return db.transaction(() => {
const unreadMessages: Array = db
- .prepare(
+ .prepare(
`
SELECT reactions.rowid, targetAuthorAci, targetTimestamp, messageId
FROM reactions
@@ -2760,7 +2779,7 @@ function getUnreadReactionsAndMarkRead(
const idsToUpdate = unreadMessages.map(item => item.rowid);
batchMultiVarQuery(db, idsToUpdate, (ids: ReadonlyArray): void => {
- db.prepare(
+ db.prepare(
`
UPDATE reactions
SET unread = 0
@@ -2792,7 +2811,7 @@ function markReactionAsRead(
LIMIT 1;
`
)
- .get({
+ .get({
targetAuthorAci: targetAuthorServiceId,
targetTimestamp,
});
@@ -2904,10 +2923,10 @@ function removeReactionFromConversation(
}
function _getAllReactions(db: ReadableDB): Array {
- return db.prepare('SELECT * from reactions;').all();
+ return db.prepare('SELECT * from reactions;').all();
}
function _removeAllReactions(db: WritableDB): void {
- db.prepare('DELETE from reactions;').run();
+ db.prepare('DELETE from reactions;').run();
}
enum AdjacentDirection {
@@ -2938,7 +2957,7 @@ function getRecentStoryReplies(
${sqlJoin(MESSAGE_COLUMNS_FRAGMENTS)}
FROM messages
WHERE
- (${messageId} IS NULL OR id IS NOT ${messageId}) AND
+ (${messageId ?? null} IS NULL OR id IS NOT ${messageId ?? null}) AND
isStory IS 0 AND
storyId IS ${storyId} AND
(
@@ -3002,7 +3021,7 @@ function getAdjacentMessagesByConversation(
conversationId = ${conversationId} AND
${
requireDifferentMessage
- ? sqlFragment`(${messageId} IS NULL OR id IS NOT ${messageId}) AND`
+ ? sqlFragment`(${messageId ?? null} IS NULL OR id IS NOT ${messageId ?? null}) AND`
: sqlFragment``
}
${
@@ -3065,7 +3084,7 @@ function getAdjacentMessagesByConversation(
const [query, params] = sql`${template}`;
- const results = db.prepare(query).all(params);
+ const results = db.prepare(query).all(params);
if (direction === AdjacentDirection.Older) {
results.reverse();
@@ -3100,20 +3119,24 @@ function getAllStories(
FROM messages
WHERE
isStory = 1 AND
- (${conversationId} IS NULL OR conversationId IS ${conversationId}) AND
- (${sourceServiceId} IS NULL OR sourceServiceId IS ${sourceServiceId})
+ (${conversationId ?? null} IS NULL OR
+ conversationId IS ${conversationId ?? null}) AND
+ (${sourceServiceId ?? null} IS NULL OR
+ sourceServiceId IS ${sourceServiceId ?? null})
ORDER BY received_at ASC, sent_at ASC;
`;
- const rows = db.prepare(storiesQuery).all(storiesParams);
+ const rows = db
+ .prepare(storiesQuery)
+ .all(storiesParams);
const [repliesQuery, repliesParams] = sql`
SELECT DISTINCT storyId
FROM messages
WHERE storyId IS NOT NULL
`;
- const replies: ReadonlyArray<{
- storyId: string;
- }> = db.prepare(repliesQuery).all(repliesParams);
+ const replies = db
+ .prepare(repliesQuery, { pluck: true })
+ .all(repliesParams);
const [repliesFromSelfQuery, repliesFromSelfParams] = sql`
SELECT DISTINCT storyId
@@ -3123,14 +3146,14 @@ function getAllStories(
type IS 'outgoing'
)
`;
- const repliesFromSelf: ReadonlyArray<{
- storyId: string;
- }> = db.prepare(repliesFromSelfQuery).all(repliesFromSelfParams);
+ const repliesFromSelf = db
+ .prepare(repliesFromSelfQuery, {
+ pluck: true,
+ })
+ .all(repliesFromSelfParams);
- const repliesLookup = new Set(replies.map(row => row.storyId));
- const repliesFromSelfLookup = new Set(
- repliesFromSelf.map(row => row.storyId)
- );
+ const repliesLookup = new Set(replies);
+ const repliesFromSelfLookup = new Set(repliesFromSelf);
return rows.map(row => ({
...hydrateMessage(row),
@@ -3169,7 +3192,11 @@ function getOldestMessageForConversation(
LIMIT 1;
`;
- const row = db.prepare(query).get(params);
+ const row = db.prepare(query).get<{
+ received_at: number;
+ sent_at: number;
+ id: string;
+ }>(params);
if (!row) {
return undefined;
@@ -3196,7 +3223,11 @@ function getNewestMessageForConversation(
ORDER BY received_at DESC, sent_at DESC
LIMIT 1;
`;
- const row = db.prepare(query).get(params);
+ const row = db.prepare(query).get<{
+ received_at: number;
+ sent_at: number;
+ id: string;
+ }>(params);
if (!row) {
return undefined;
@@ -3239,7 +3270,7 @@ function getMessagesBetween(
ORDER BY received_at ASC, sent_at ASC;
`;
- const rows = db.prepare(query).all(params);
+ const rows = db.prepare(query).all<{ id: string }>(params);
return rows.map(row => row.id);
}
@@ -3279,7 +3310,11 @@ function getNearbyMessageFromDeletedSet(
LIMIT 1
`;
- return db.prepare(query).pluck().get(params);
+ return db
+ .prepare(query, {
+ pluck: true,
+ })
+ .get(params);
}
const after = runQuery(true);
@@ -3305,9 +3340,9 @@ function getLastConversationActivity(
includeStoryReplies: boolean;
}
): MessageType | undefined {
- const row = prepare(
- db,
- `
+ const row = db
+ .prepare(
+ `
SELECT ${MESSAGE_COLUMNS.join(', ')} FROM messages
INDEXED BY messages_activity
WHERE
@@ -3319,9 +3354,10 @@ function getLastConversationActivity(
ORDER BY received_at DESC, sent_at DESC
LIMIT 1;
`
- ).get({
- conversationId,
- });
+ )
+ .get({
+ conversationId,
+ });
if (!row) {
return undefined;
@@ -3343,9 +3379,9 @@ function getLastConversationPreview(
? 'messages_preview'
: 'messages_preview_without_story';
- const row: MessageTypeUnhydrated | undefined = prepare(
- db,
- `
+ const row: MessageTypeUnhydrated | undefined = db
+ .prepare(
+ `
SELECT ${MESSAGE_COLUMNS.join(', ')}, expiresAt FROM (
SELECT ${MESSAGE_COLUMNS.join(', ')}, expiresAt FROM messages
INDEXED BY ${index}
@@ -3359,10 +3395,11 @@ function getLastConversationPreview(
WHERE likely(expiresAt > $now)
LIMIT 1
`
- ).get({
- conversationId,
- now: Date.now(),
- });
+ )
+ .get({
+ conversationId,
+ now: Date.now(),
+ });
return row ? hydrateMessage(row) : undefined;
}
@@ -3401,7 +3438,7 @@ function getLastConversationMessage(
}
): MessageType | undefined {
const row = db
- .prepare(
+ .prepare(
`
SELECT ${MESSAGE_COLUMNS.join(', ')} FROM messages WHERE
conversationId = $conversationId
@@ -3409,7 +3446,7 @@ function getLastConversationMessage(
LIMIT 1;
`
)
- .get({
+ .get({
conversationId,
});
@@ -3441,7 +3478,9 @@ function getOldestUnseenMessageForConversation(
LIMIT 1;
`;
- const row = db.prepare(query).get(params);
+ const row = db
+ .prepare(query)
+ .get<{ received_at: number; sent_at: number; id: string }>(params);
if (!row) {
return undefined;
@@ -3492,9 +3531,13 @@ function getTotalUnreadForConversation(
isStory IS 0 AND
(${_storyIdPredicate(storyId, includeStoryReplies)})
`;
- const row = db.prepare(query).pluck().get(params);
+ const row = db
+ .prepare(query, {
+ pluck: true,
+ })
+ .get(params);
- return row;
+ return row ?? 0;
}
function getTotalUnreadMentionsOfMeForConversation(
db: ReadableDB,
@@ -3517,9 +3560,13 @@ function getTotalUnreadMentionsOfMeForConversation(
isStory IS 0 AND
(${_storyIdPredicate(storyId, includeStoryReplies)})
`;
- const row = db.prepare(query).pluck().get(params);
+ const row = db
+ .prepare(query, {
+ pluck: true,
+ })
+ .get(params);
- return row;
+ return row ?? 0;
}
function getTotalUnseenForConversation(
db: ReadableDB,
@@ -3541,9 +3588,13 @@ function getTotalUnseenForConversation(
isStory IS 0 AND
(${_storyIdPredicate(storyId, includeStoryReplies)})
`;
- const row = db.prepare(query).pluck().get(params);
+ const row = db
+ .prepare(query, {
+ pluck: true,
+ })
+ .get(params);
- return row;
+ return row ?? 0;
}
function getMessageMetricsForConversation(
@@ -3639,8 +3690,9 @@ function clearCallHistory(
`;
const adminCallLinkIds: ReadonlyArray = db
- .prepare(selectAdminCallLinksQuery)
- .pluck()
+ .prepare(selectAdminCallLinksQuery, {
+ pluck: true,
+ })
.all(selectAdminCallLinksParams);
const adminCallLinkIdsFragment = sqlJoin(adminCallLinkIds);
@@ -3661,8 +3713,9 @@ function clearCallHistory(
`;
const deletedCallIds: ReadonlyArray = db
- .prepare(selectCallsQuery)
- .pluck()
+ .prepare(selectCallsQuery, {
+ pluck: true,
+ })
.all(selectCallsParams);
let deletedMessageIds: ReadonlyArray = [];
@@ -3688,9 +3741,10 @@ function clearCallHistory(
`;
const batchDeletedMessageIds = db
- .prepare(deleteMessagesQuery)
- .pluck()
- .all(deleteMessagesParams);
+ .prepare(deleteMessagesQuery, {
+ pluck: true,
+ })
+ .all(deleteMessagesParams);
deletedMessageIds = deletedMessageIds.concat(batchDeletedMessageIds);
});
@@ -3739,7 +3793,7 @@ function getCallHistoryMessageByCallId(
AND type = 'call-history'
AND callId = ${options.callId}
`;
- const row = db.prepare(query).get(params);
+ const row = db.prepare(query).get(params);
if (row == null) {
return;
}
@@ -3785,8 +3839,12 @@ function getCallHistoryUnreadCount(db: ReadableDB): number {
AND callsHistory.status IS ${CALL_STATUS_MISSED}
AND callsHistory.direction IS ${CALL_STATUS_INCOMING}
`;
- const row = db.prepare(query).pluck().get(params);
- return row;
+ const row = db
+ .prepare(query, {
+ pluck: true,
+ })
+ .get(params);
+ return row ?? 0;
}
function markCallHistoryRead(db: WritableDB, callId: string): void {
@@ -3904,8 +3962,9 @@ function getConversationIdForCallHistory(
`;
const conversationId = db
- .prepare(selectConversationIdQuery)
- .pluck()
+ .prepare(selectConversationIdQuery, {
+ pluck: true,
+ })
.get(selectConversationIdParams);
if (typeof conversationId !== 'string') {
@@ -3920,7 +3979,7 @@ function getMessageReceivedAtForCall(
db: ReadableDB,
callId: string,
conversationId: string
-): number | null {
+): number | undefined {
const [selectQuery, selectParams] = sql`
SELECT messages.received_at
FROM messages
@@ -3930,12 +3989,17 @@ function getMessageReceivedAtForCall(
LIMIT 1
`;
- const receivedAt = db.prepare(selectQuery).pluck().get(selectParams);
+ const receivedAt = db
+ .prepare(selectQuery, {
+ pluck: true,
+ })
+ .get(selectParams);
if (receivedAt == null) {
logger.warn('getMessageReceivedAtForCall: Target call message not found');
+ return undefined;
}
- return receivedAt ?? null;
+ return receivedAt;
}
export function markAllCallHistoryRead(
@@ -3958,7 +4022,7 @@ export function markAllCallHistoryRead(
);
let predicate: QueryFragment;
- let receivedAt: number | null;
+ let receivedAt: number | undefined;
if (callHistory.mode === CallMode.Adhoc) {
// If the target is a call link, there's no associated conversation and messages,
// and we can only mark call history read based on timestamp.
@@ -4223,7 +4287,11 @@ function getCallHistoryGroupData(
`;
const result = isCount
- ? db.prepare(query).pluck(true).get(params)
+ ? db
+ .prepare(query, {
+ pluck: true,
+ })
+ .get(params)
: db.prepare(query).all(params);
if (isUsingTempTable) {
@@ -4358,8 +4426,8 @@ function hasGroupCallHistoryMessage(
conversationId: string,
eraId: string
): boolean {
- const exists: number = db
- .prepare(
+ const exists = db
+ .prepare(
`
SELECT EXISTS(
SELECT 1 FROM messages
@@ -4368,15 +4436,17 @@ function hasGroupCallHistoryMessage(
AND json_extract(json, '$.callHistoryDetails.callMode') = 'Group'
AND json_extract(json, '$.callHistoryDetails.eraId') = $eraId
);
- `
+ `,
+ {
+ pluck: true,
+ }
)
- .pluck()
- .get({
+ .get({
conversationId,
eraId,
});
- return exists !== 0;
+ return exists === 1;
}
function _markCallHistoryMissed(
@@ -4416,7 +4486,10 @@ function getRecentStaleRingsAndMarkOlderMissed(
ORDER BY timestamp DESC
`;
- const ringingCalls = db.prepare(selectQuery).all(selectParams);
+ const ringingCalls = db.prepare(selectQuery).all<{
+ callId: string;
+ peerId: string;
+ }>(selectParams);
const seen = new Set();
const [latestCalls, pastCalls] = partition(ringingCalls, result => {
@@ -4548,7 +4621,7 @@ function getMessagesBySentAt(
ORDER BY messages.received_at DESC, messages.sent_at DESC;
`;
- const rows = db.prepare(query).all(params);
+ const rows = db.prepare(query).all(params);
return rows.map(row => hydrateMessage(row));
}
@@ -4557,7 +4630,7 @@ function getExpiredMessages(db: ReadableDB): Array {
const now = Date.now();
const rows: Array = db
- .prepare(
+ .prepare(
`
SELECT ${MESSAGE_COLUMNS.join(', ')}, expiresAt
FROM messages
@@ -4575,7 +4648,7 @@ function getMessagesUnexpectedlyMissingExpirationStartTimestamp(
db: ReadableDB
): Array {
const rows: Array = db
- .prepare(
+ .prepare(
`
SELECT ${MESSAGE_COLUMNS.join(', ')} FROM messages
INDEXED BY messages_unexpectedly_missing_expiration_start_timestamp
@@ -4599,15 +4672,17 @@ function getMessagesUnexpectedlyMissingExpirationStartTimestamp(
function getSoonestMessageExpiry(db: ReadableDB): undefined | number {
// Note: we use `pluck` to only get the first column.
- const result: null | number = db
- .prepare(
+ const result = db
+ .prepare(
`
SELECT MIN(expiresAt)
FROM messages;
- `
+ `,
+ {
+ pluck: true,
+ }
)
- .pluck(true)
- .get();
+ .get();
if (result != null && result >= Number.MAX_SAFE_INTEGER) {
return undefined;
@@ -4620,7 +4695,7 @@ function getNextTapToViewMessageTimestampToAgeOut(
db: ReadableDB
): undefined | number {
const row = db
- .prepare(
+ .prepare(
`
SELECT ${MESSAGE_COLUMNS.join(', ')} FROM messages
WHERE
@@ -4631,7 +4706,7 @@ function getNextTapToViewMessageTimestampToAgeOut(
LIMIT 1;
`
)
- .get();
+ .get();
if (!row) {
return undefined;
@@ -4646,7 +4721,7 @@ function getTapToViewMessagesNeedingErase(
maxTimestamp: number
): Array {
const rows: Array = db
- .prepare(
+ .prepare(
`
SELECT ${MESSAGE_COLUMNS.join(', ')}
FROM messages
@@ -4695,8 +4770,7 @@ function saveUnprocessed(db: WritableDB, data: UnprocessedType): string {
throw new Error('saveUnprocessed: id was falsey');
}
- prepare(
- db,
+ db.prepare(
`
INSERT OR REPLACE INTO unprocessed (
id,
@@ -4771,23 +4845,6 @@ function saveUnprocessed(db: WritableDB, data: UnprocessedType): string {
return id;
}
-function getUnprocessedById(
- db: ReadableDB,
- id: string
-): UnprocessedType | undefined {
- const row = db
- .prepare('SELECT * FROM unprocessed WHERE id = $id;')
- .get({
- id,
- });
-
- return {
- ...row,
- urgent: isNumber(row.urgent) ? Boolean(row.urgent) : true,
- story: Boolean(row.story),
- };
-}
-
function getUnprocessedCount(db: ReadableDB): number {
return getCountFromTable(db, 'unprocessed');
}
@@ -4796,7 +4853,7 @@ function getAllUnprocessedIds(db: WritableDB): Array {
return db.transaction(() => {
// cleanup first
const { changes: deletedStaleCount } = db
- .prepare(
+ .prepare(
'DELETE FROM unprocessed WHERE receivedAtDate < $messageQueueCutoff'
)
.run({
@@ -4811,7 +4868,7 @@ function getAllUnprocessedIds(db: WritableDB): Array {
}
const { changes: deletedInvalidCount } = db
- .prepare(
+ .prepare(
`
DELETE FROM unprocessed
WHERE attempts >= $MAX_UNPROCESSED_ATTEMPTS
@@ -4827,15 +4884,17 @@ function getAllUnprocessedIds(db: WritableDB): Array {
}
return db
- .prepare(
- `
- SELECT id
- FROM unprocessed
- ORDER BY receivedAtCounter ASC
+ .prepare(
`
+ SELECT id
+ FROM unprocessed
+ ORDER BY receivedAtCounter ASC
+ `,
+ {
+ pluck: true,
+ }
)
- .pluck()
- .all();
+ .all();
})();
}
@@ -4849,7 +4908,7 @@ function getUnprocessedByIdsAndIncrementAttempts(
batchMultiVarQuery(db, ids, batch => {
return db
- .prepare(
+ .prepare(
`
UPDATE unprocessed
SET attempts = attempts + 1
@@ -4861,7 +4920,7 @@ function getUnprocessedByIdsAndIncrementAttempts(
return batchMultiVarQuery(db, ids, batch => {
return db
- .prepare(
+ .prepare(
`
SELECT *
FROM unprocessed
@@ -4880,7 +4939,7 @@ function getUnprocessedByIdsAndIncrementAttempts(
}
function removeUnprocesseds(db: WritableDB, ids: ReadonlyArray): void {
- db.prepare(
+ db.prepare(
`
DELETE FROM unprocessed
WHERE id IN ( ${ids.map(() => '?').join(', ')} );
@@ -4890,7 +4949,7 @@ function removeUnprocesseds(db: WritableDB, ids: ReadonlyArray): void {
function removeUnprocessed(db: WritableDB, id: string | Array): void {
if (!Array.isArray(id)) {
- prepare(db, 'DELETE FROM unprocessed WHERE id = $id;').run({ id });
+ db.prepare('DELETE FROM unprocessed WHERE id = $id;').run({ id });
return;
}
@@ -4905,18 +4964,18 @@ function removeUnprocessed(db: WritableDB, id: string | Array): void {
}
function removeAllUnprocessed(db: WritableDB): void {
- db.prepare('DELETE FROM unprocessed;').run();
+ db.prepare('DELETE FROM unprocessed;').run();
}
// Attachment Downloads
-function getAttachmentDownloadJob(
+function _getAttachmentDownloadJob(
db: ReadableDB,
job: Pick<
AttachmentDownloadJobType,
'messageId' | 'attachmentType' | 'digest'
>
-): AttachmentDownloadJobType {
+): AttachmentDownloadJobType | undefined {
const [query, params] = sql`
SELECT * FROM attachment_downloads
WHERE
@@ -4927,7 +4986,17 @@ function getAttachmentDownloadJob(
digest = ${job.digest};
`;
- return db.prepare(query).get(params);
+ const row = db.prepare(query).get(params);
+ if (row === undefined) {
+ return undefined;
+ }
+ const { attachmentJson, ...fields } = row;
+ return parseUnknown(attachmentDownloadJobSchema, {
+ ...fields,
+ active: Boolean(row.active),
+ attachment: JSON.parse(attachmentJson),
+ ciphertextSize: row.ciphertextSize || 0,
+ } as unknown);
}
function removeAllBackupAttachmentDownloadJobs(db: WritableDB): void {
@@ -4941,7 +5010,13 @@ function getSizeOfPendingBackupAttachmentDownloadJobs(db: ReadableDB): number {
const [query, params] = sql`
SELECT SUM(ciphertextSize) FROM attachment_downloads
WHERE source = ${AttachmentDownloadSource.BACKUP_IMPORT};`;
- return db.prepare(query).pluck().get(params);
+ return (
+ db
+ .prepare(query, {
+ pluck: true,
+ })
+ .get(params) ?? 0
+ );
}
function getNextAttachmentDownloadJobs(
@@ -4960,7 +5035,7 @@ function getNextAttachmentDownloadJobs(
maxLastAttemptForPrioritizedMessages?: number;
}
): Array {
- let priorityJobs = [];
+ let priorityJobs = new Array();
const sourceWhereFragment = sources
? sqlFragment`
@@ -4998,7 +5073,7 @@ function getNextAttachmentDownloadJobs(
// Next, get any other jobs, sorted by receivedAt
const numJobsRemaining = limit - priorityJobs.length;
- let standardJobs = [];
+ let standardJobs: typeof priorityJobs = [];
if (numJobsRemaining > 0) {
const [query, params] = sql`
SELECT * FROM attachment_downloads
@@ -5099,7 +5174,7 @@ function saveAttachmentDownloadJob(
}
function resetAttachmentDownloadActive(db: WritableDB): void {
- db.prepare(
+ db.prepare(
`
UPDATE attachment_downloads
SET active = 0
@@ -5110,7 +5185,7 @@ function resetAttachmentDownloadActive(db: WritableDB): void {
function removeAttachmentDownloadJob(
db: WritableDB,
- job: AttachmentDownloadJobType
+ job: Pick
): void {
const [query, params] = sql`
DELETE FROM attachment_downloads
@@ -5144,7 +5219,7 @@ function clearAllAttachmentBackupJobs(db: WritableDB): void {
}
function markAllAttachmentBackupJobsInactive(db: WritableDB): void {
- db.prepare(
+ db.prepare(
`
UPDATE attachment_backup_jobs
SET active = 0;
@@ -5201,7 +5276,11 @@ function getNextAttachmentBackupJobs(
type ASC, receivedAt DESC
LIMIT ${limit}
`;
- const rows = db.prepare(query).all(params);
+ const rows = db.prepare(query).all<{
+ mediaName: string;
+ data: string;
+ active: number;
+ }>(params);
return rows
.map(row => {
const parseResult = safeParseUnknown(attachmentBackupJobSchema, {
@@ -5303,7 +5382,7 @@ function createOrUpdateStickerPack(
}
const row = db
- .prepare(
+ .prepare(
`
SELECT id
FROM sticker_packs
@@ -5327,7 +5406,7 @@ function createOrUpdateStickerPack(
};
if (row) {
- db.prepare(
+ db.prepare(
`
UPDATE sticker_packs SET
attemptedStatus = $attemptedStatus,
@@ -5353,17 +5432,19 @@ function createOrUpdateStickerPack(
// Assign default position when inserting a row
if (!isNumber(position)) {
position = db
- .prepare(
- `
- SELECT IFNULL(MAX(position) + 1, 0)
- FROM sticker_packs
+ .prepare(
`
+ SELECT IFNULL(MAX(position) + 1, 0)
+ FROM sticker_packs
+ `,
+ {
+ pluck: true,
+ }
)
- .pluck()
.get();
}
- db.prepare(
+ db.prepare(
`
INSERT INTO sticker_packs (
attemptedStatus,
@@ -5421,7 +5502,12 @@ function updateStickerPackStatus(
SELECT status FROM sticker_packs WHERE id IS ${id};
`;
- const oldStatus = db.prepare(select).pluck().get(selectParams);
+ const oldStatus =
+ db
+ .prepare(select, {
+ pluck: true,
+ })
+ .get(selectParams) ?? null;
const [update, updateParams] = sql`
UPDATE sticker_packs
@@ -5447,7 +5533,7 @@ function updateStickerPackInfo(
}: StickerPackInfoType
): void {
if (uninstalledAt) {
- db.prepare(
+ db.prepare(
`
UPDATE uninstalled_sticker_packs
SET
@@ -5465,7 +5551,7 @@ function updateStickerPackInfo(
storageNeedsSync: storageNeedsSync ? 1 : 0,
});
} else {
- db.prepare(
+ db.prepare(
`
UPDATE sticker_packs
SET
@@ -5487,7 +5573,7 @@ function updateStickerPackInfo(
}
}
function clearAllErrorStickerPackAttempts(db: WritableDB): void {
- db.prepare(
+ db.prepare(
`
UPDATE sticker_packs
SET downloadAttempts = 0
@@ -5521,7 +5607,7 @@ function createOrUpdateSticker(db: WritableDB, sticker: StickerType): void {
);
}
- db.prepare(
+ db.prepare(
`
INSERT OR REPLACE INTO stickers (
emoji,
@@ -5579,7 +5665,7 @@ function updateStickerLastUsed(
stickerId: number,
lastUsed: number
): void {
- db.prepare(
+ db.prepare(
`
UPDATE stickers
SET lastUsed = $lastUsed
@@ -5590,7 +5676,7 @@ function updateStickerLastUsed(
packId,
lastUsed,
});
- db.prepare(
+ db.prepare(
`
UPDATE sticker_packs
SET lastUsed = $lastUsed
@@ -5616,8 +5702,7 @@ function addStickerPackReference(
);
}
- prepare(
- db,
+ db.prepare(
`
INSERT OR REPLACE INTO sticker_references (
messageId,
@@ -5654,7 +5739,7 @@ function deleteStickerPackReference(
// 4. If it's not installed, then grab all of its sticker paths
// 5. If it's not installed, then sticker pack (which cascades to all
// stickers and references)
- db.prepare(
+ db.prepare(
`
DELETE FROM sticker_references
WHERE messageId = $messageId AND packId = $packId;
@@ -5664,27 +5749,30 @@ function deleteStickerPackReference(
packId,
});
- const count = db
- .prepare(
- `
- SELECT count(1) FROM sticker_references
- WHERE packId = $packId;
+ const count =
+ db
+ .prepare(
`
- )
- .pluck()
- .get({ packId });
+ SELECT count(1) FROM sticker_references
+ WHERE packId = $packId;
+ `,
+ {
+ pluck: true,
+ }
+ )
+ .get({ packId }) ?? 0;
if (count > 0) {
return undefined;
}
- const packRow: { status: StickerPackStatusType } = db
- .prepare(
+ const packRow = db
+ .prepare(
`
SELECT status FROM sticker_packs
WHERE id = $packId;
`
)
- .get({ packId });
+ .get<{ status: StickerPackStatusType }>({ packId });
if (!packRow) {
logger.warn('deleteStickerPackReference: did not find referenced pack');
return undefined;
@@ -5696,7 +5784,7 @@ function deleteStickerPackReference(
}
const stickerPathRows: Array<{ path: string }> = db
- .prepare(
+ .prepare(
`
SELECT path FROM stickers
WHERE packId = $packId;
@@ -5705,7 +5793,7 @@ function deleteStickerPackReference(
.all({
packId,
});
- db.prepare(
+ db.prepare(
`
DELETE FROM sticker_packs
WHERE id = $packId;
@@ -5728,7 +5816,9 @@ function getUnresolvedStickerPackReferences(
WHERE packId IS ${packId} AND isUnresolved IS 1
RETURNING messageId, stickerId;
`;
- const rows = db.prepare(query).all(params);
+ const rows = db
+ .prepare(query)
+ .all<{ messageId: string; stickerId: number }>(params);
return rows.map(({ messageId, stickerId }) => ({
messageId,
@@ -5756,7 +5846,7 @@ function deleteStickerPack(db: WritableDB, packId: string): Array {
// 2. Delete sticker pack (which cascades to all stickers and references)
const stickerPathRows: Array<{ path: string }> = db
- .prepare(
+ .prepare(
`
SELECT path FROM stickers
WHERE packId = $packId;
@@ -5765,7 +5855,7 @@ function deleteStickerPack(db: WritableDB, packId: string): Array {
.all({
packId,
});
- db.prepare(
+ db.prepare(
`
DELETE FROM sticker_packs
WHERE id = $packId;
@@ -5781,17 +5871,20 @@ function getStickerCount(db: ReadableDB): number {
}
function getAllStickerPacks(db: ReadableDB): Array {
const rows = db
- .prepare(
+ .prepare(
`
SELECT * FROM sticker_packs
ORDER BY position ASC, id ASC
`
)
- .all();
+ .all();
return rows.map(row => {
return {
...row,
+ storageNeedsSync: row.storageNeedsSync === 1,
+ stickers: {},
+
// The columns have STRING type so if they have numeric value, sqlite
// will return integers.
author: String(row.author),
@@ -5803,7 +5896,7 @@ function addUninstalledStickerPack(
db: WritableDB,
pack: UninstalledStickerPackType
): void {
- db.prepare(
+ db.prepare(
`
INSERT OR REPLACE INTO uninstalled_sticker_packs
(
@@ -5845,18 +5938,19 @@ function getUninstalledStickerPacks(
db: ReadableDB
): Array {
const rows = db
- .prepare(
- 'SELECT * FROM uninstalled_sticker_packs ORDER BY id ASC'
- )
- .all();
+ .prepare('SELECT * FROM uninstalled_sticker_packs ORDER BY id ASC')
+ .all();
- return rows || [];
+ return rows.map(row => ({
+ ...row,
+ storageNeedsSync: row.storageNeedsSync === 1,
+ }));
}
function getInstalledStickerPacks(db: ReadableDB): Array {
// If sticker pack has a storageID - it is being downloaded and about to be
// installed so we better sync it back to storage service if asked.
const rows = db
- .prepare(
+ .prepare(
`
SELECT *
FROM sticker_packs
@@ -5866,9 +5960,13 @@ function getInstalledStickerPacks(db: ReadableDB): Array {
ORDER BY id ASC
`
)
- .all();
+ .all();
- return rows || [];
+ return rows.map(row => ({
+ ...row,
+ storageNeedsSync: row.storageNeedsSync === 1,
+ stickers: {},
+ }));
}
function getStickerPackInfo(
db: ReadableDB,
@@ -5876,19 +5974,24 @@ function getStickerPackInfo(
): StickerPackInfoType | undefined {
return db.transaction(() => {
const uninstalled = db
- .prepare(
+ .prepare(
`
SELECT * FROM uninstalled_sticker_packs
WHERE id IS $packId
`
)
- .get({ packId });
+ .get({ packId });
if (uninstalled) {
- return uninstalled as UninstalledStickerPackType;
+ return {
+ ...uninstalled,
+ storageNeedsSync: uninstalled.storageNeedsSync === 1,
+ key: undefined,
+ position: undefined,
+ };
}
const installed = db
- .prepare(
+ .prepare(
`
SELECT
id, key, position, storageID, storageVersion, storageUnknownFields
@@ -5896,9 +5999,13 @@ function getStickerPackInfo(
WHERE id IS $packId
`
)
- .get({ packId });
+ .get({ packId });
if (installed) {
- return installed as InstalledStickerPackType;
+ return {
+ ...installed,
+ storageNeedsSync: installed.storageNeedsSync === 1,
+ uninstalledAt: undefined,
+ };
}
return undefined;
@@ -5963,13 +6070,13 @@ function uninstallStickerPack(
}
function getAllStickers(db: ReadableDB): Array {
const rows = db
- .prepare(
+ .prepare(
`
SELECT * FROM stickers
ORDER BY packId ASC, id ASC
`
)
- .all();
+ .all();
return (rows || []).map(row => rowToSticker(row));
}
@@ -5979,7 +6086,7 @@ function getRecentStickers(
): Array {
// Note: we avoid 'IS NOT NULL' here because it does seem to bypass our index
const rows = db
- .prepare(
+ .prepare(
`
SELECT stickers.* FROM stickers
JOIN sticker_packs on stickers.packId = sticker_packs.id
@@ -5988,7 +6095,7 @@ function getRecentStickers(
LIMIT $limit
`
)
- .all({
+ .all({
limit: limit || 24,
});
@@ -6003,7 +6110,7 @@ function updateEmojiUsage(
): void {
db.transaction(() => {
const rows = db
- .prepare(
+ .prepare(
`
SELECT * FROM emojis
WHERE shortName = $shortName;
@@ -6014,7 +6121,7 @@ function updateEmojiUsage(
});
if (rows) {
- db.prepare(
+ db.prepare(
`
UPDATE emojis
SET lastUsage = $timeUsed
@@ -6022,7 +6129,7 @@ function updateEmojiUsage(
`
).run({ shortName, timeUsed });
} else {
- db.prepare(
+ db.prepare(
`
INSERT INTO emojis(shortName, lastUsage)
VALUES ($shortName, $timeUsed);
@@ -6034,7 +6141,7 @@ function updateEmojiUsage(
function getRecentEmojis(db: ReadableDB, limit = 32): Array {
const rows = db
- .prepare(
+ .prepare(
`
SELECT *
FROM emojis
@@ -6042,41 +6149,52 @@ function getRecentEmojis(db: ReadableDB, limit = 32): Array {
LIMIT $limit;
`
)
- .all({ limit });
+ .all({ limit });
return rows || [];
}
function getAllBadges(db: ReadableDB): Array {
- const [badgeRows, badgeImageFileRows] = db.transaction(() => [
- db.prepare('SELECT * FROM badges').all(),
- db.prepare('SELECT * FROM badgeImageFiles').all(),
- ])();
+ return db.transaction(() => {
+ const badgeRows = db.prepare('SELECT * FROM badges').all<{
+ id: string;
+ category: string;
+ name: string;
+ descriptionTemplate: string;
+ }>();
+ const badgeImageFileRows = db.prepare('SELECT * FROM badgeImageFiles').all<{
+ badgeId: string;
+ order: number;
+ url: string;
+ localPath: string;
+ theme: BadgeImageTheme;
+ }>();
- const badgeImagesByBadge = new Map<
- string,
- Array
- >();
- for (const badgeImageFileRow of badgeImageFileRows) {
- const { badgeId, order, localPath, url, theme } = badgeImageFileRow;
- const badgeImages = badgeImagesByBadge.get(badgeId) || [];
- badgeImages[order] = {
- ...(badgeImages[order] || {}),
- [parseBadgeImageTheme(theme)]: {
- localPath: dropNull(localPath),
- url,
- },
- };
- badgeImagesByBadge.set(badgeId, badgeImages);
- }
+ const badgeImagesByBadge = new Map<
+ string,
+ Array
+ >();
+ for (const badgeImageFileRow of badgeImageFileRows) {
+ const { badgeId, order, localPath, url, theme } = badgeImageFileRow;
+ const badgeImages = badgeImagesByBadge.get(badgeId) || [];
+ badgeImages[order] = {
+ ...(badgeImages[order] || {}),
+ [parseBadgeImageTheme(theme)]: {
+ localPath: dropNull(localPath),
+ url,
+ },
+ };
+ badgeImagesByBadge.set(badgeId, badgeImages);
+ }
- return badgeRows.map(badgeRow => ({
- id: badgeRow.id,
- category: parseBadgeCategory(badgeRow.category),
- name: badgeRow.name,
- descriptionTemplate: badgeRow.descriptionTemplate,
- images: (badgeImagesByBadge.get(badgeRow.id) || []).filter(isNotNil),
- }));
+ return badgeRows.map(badgeRow => ({
+ id: badgeRow.id,
+ category: parseBadgeCategory(badgeRow.category),
+ name: badgeRow.name,
+ descriptionTemplate: badgeRow.descriptionTemplate,
+ images: (badgeImagesByBadge.get(badgeRow.id) || []).filter(isNotNil),
+ }));
+ })();
}
// This should match the logic in the badges Redux reducer.
@@ -6084,8 +6202,7 @@ function updateOrCreateBadges(
db: WritableDB,
badges: ReadonlyArray
): void {
- const insertBadge = prepare(
- db,
+ const insertBadge = db.prepare(
`
INSERT OR REPLACE INTO badges (
id,
@@ -6100,12 +6217,10 @@ function updateOrCreateBadges(
);
`
);
- const getImageFilesForBadge = prepare(
- db,
+ const getImageFilesForBadge = db.prepare(
'SELECT url, localPath FROM badgeImageFiles WHERE badgeId = $badgeId'
);
- const insertBadgeImageFile = prepare(
- db,
+ const insertBadgeImageFile = db.prepare(
`
INSERT INTO badgeImageFiles (
badgeId,
@@ -6128,7 +6243,10 @@ function updateOrCreateBadges(
const { id: badgeId } = badge;
const oldLocalPaths = new Map();
- for (const { url, localPath } of getImageFilesForBadge.all({ badgeId })) {
+ for (const { url, localPath } of getImageFilesForBadge.all<{
+ url: string;
+ localPath: string;
+ }>({ badgeId })) {
if (localPath) {
oldLocalPaths.set(url, localPath);
}
@@ -6162,19 +6280,20 @@ function badgeImageFileDownloaded(
url: string,
localPath: string
): void {
- prepare(
- db,
+ db.prepare(
'UPDATE badgeImageFiles SET localPath = $localPath WHERE url = $url'
).run({ url, localPath });
}
function getAllBadgeImageFileLocalPaths(db: ReadableDB): Set {
const localPaths = db
- .prepare(
- 'SELECT localPath FROM badgeImageFiles WHERE localPath IS NOT NULL'
+ .prepare(
+ 'SELECT localPath FROM badgeImageFiles WHERE localPath IS NOT NULL',
+ {
+ pluck: true,
+ }
)
- .pluck()
- .all();
+ .all();
return new Set(localPaths);
}
@@ -6288,20 +6407,18 @@ function _getAllStoryDistributions(
db: ReadableDB
): Array {
const storyDistributions = db
- .prepare('SELECT * FROM storyDistributions;')
- .all();
+ .prepare('SELECT * FROM storyDistributions;')
+ .all();
return storyDistributions.map(hydrateStoryDistribution);
}
function _getAllStoryDistributionMembers(
db: ReadableDB
): Array {
- return db
- .prepare('SELECT * FROM storyDistributionMembers;')
- .all();
+ return db.prepare('SELECT * FROM storyDistributionMembers;').all();
}
function _deleteAllStoryDistributions(db: WritableDB): void {
- db.prepare('DELETE FROM storyDistributions;').run();
+ db.prepare('DELETE FROM storyDistributions;').run();
}
function createNewStoryDistribution(
db: WritableDB,
@@ -6315,8 +6432,7 @@ function createNewStoryDistribution(
db.transaction(() => {
const payload = freezeStoryDistribution(distribution);
- prepare(
- db,
+ db.prepare(
`
INSERT INTO storyDistributions(
id,
@@ -6346,8 +6462,7 @@ function createNewStoryDistribution(
const { id: listId, members } = distribution;
- const memberInsertStatement = prepare(
- db,
+ const memberInsertStatement = db.prepare(
`
INSERT OR REPLACE INTO storyDistributionMembers (
listId,
@@ -6384,23 +6499,23 @@ function getStoryDistributionWithMembers(
db: ReadableDB,
id: string
): StoryDistributionWithMembersType | undefined {
- const storyDistribution: StoryDistributionForDatabase | undefined = prepare(
- db,
- 'SELECT * FROM storyDistributions WHERE id = $id;'
- ).get({
- id,
- });
+ const storyDistribution = db
+ .prepare('SELECT * FROM storyDistributions WHERE id = $id;')
+ .get({
+ id,
+ });
if (!storyDistribution) {
return undefined;
}
- const members = prepare(
- db,
- 'SELECT * FROM storyDistributionMembers WHERE listId = $id;'
- ).all({
- id,
- });
+ const members = db
+ .prepare(
+ 'SELECT serviceId FROM storyDistributionMembers WHERE listId = $id;'
+ )
+ .all<{ serviceId: ServiceIdString }>({
+ id,
+ });
return {
...hydrateStoryDistribution(storyDistribution),
@@ -6425,8 +6540,7 @@ function modifyStoryDistribution(
);
}
- prepare(
- db,
+ db.prepare(
`
UPDATE storyDistributions
SET
@@ -6451,8 +6565,7 @@ function modifyStoryDistributionMembers(
toRemove,
}: { toAdd: Array; toRemove: Array }
): void {
- const memberInsertStatement = prepare(
- db,
+ const memberInsertStatement = db.prepare(
`
INSERT OR REPLACE INTO storyDistributionMembers (
listId,
@@ -6505,20 +6618,19 @@ function deleteStoryDistribution(
db: WritableDB,
id: StoryDistributionIdString
): void {
- db.prepare('DELETE FROM storyDistributions WHERE id = $id;').run({
+ db.prepare('DELETE FROM storyDistributions WHERE id = $id;').run({
id,
});
}
function _getAllStoryReads(db: ReadableDB): Array {
- return db.prepare('SELECT * FROM storyReads;').all();
+ return db.prepare('SELECT * FROM storyReads;').all();
}
function _deleteAllStoryReads(db: WritableDB): void {
- db.prepare('DELETE FROM storyReads;').run();
+ db.prepare('DELETE FROM storyReads;').run();
}
function addNewStoryRead(db: WritableDB, read: StoryReadType): void {
- prepare(
- db,
+ db.prepare(
`
INSERT OR REPLACE INTO storyReads(
authorId,
@@ -6549,7 +6661,7 @@ function getLastStoryReadsForAuthor(
const limit = initialLimit || 5;
return db
- .prepare(
+ .prepare(
`
SELECT * FROM storyReads
WHERE
@@ -6570,15 +6682,19 @@ function countStoryReadsByConversation(
db: ReadableDB,
conversationId: string
): number {
- return db
- .prepare(
- `
+ return (
+ db
+ .prepare(
+ `
SELECT count(1) FROM storyReads
WHERE conversationId = $conversationId;
- `
- )
- .pluck()
- .get({ conversationId });
+ `,
+ {
+ pluck: true,
+ }
+ )
+ .get({ conversationId }) ?? 0
+ );
}
// All data in database
@@ -6669,8 +6785,9 @@ function removeAllConfiguration(db: WritableDB): void {
);
const itemIds: ReadonlyArray = db
- .prepare('SELECT id FROM items')
- .pluck(true)
+ .prepare('SELECT id FROM items', {
+ pluck: true,
+ })
.all();
const allowedSet = new Set(STORAGE_UI_KEYS);
@@ -6746,7 +6863,7 @@ function getMessagesNeedingUpgrade(
{ maxVersion }: { maxVersion: number }
): Array {
const rows: Array = db
- .prepare(
+ .prepare(
`
SELECT ${MESSAGE_COLUMNS.join(', ')}
FROM messages
@@ -6798,18 +6915,20 @@ function getMessageServerGuidsForSpam(
// The server's maximum is 3, which is why you see `LIMIT 3` in this query. Note that we
// use `pluck` here to only get the first column!
return db
- .prepare(
- `
- SELECT serverGuid
- FROM messages
- WHERE conversationId = $conversationId
- AND type = 'incoming'
- AND serverGuid IS NOT NULL
- ORDER BY received_at DESC, sent_at DESC
- LIMIT 3;
+ .prepare(
`
+ SELECT serverGuid
+ FROM messages
+ WHERE conversationId = $conversationId
+ AND type = 'incoming'
+ AND serverGuid IS NOT NULL
+ ORDER BY received_at DESC, sent_at DESC
+ LIMIT 3;
+ `,
+ {
+ pluck: true,
+ }
)
- .pluck(true)
.all({ conversationId });
}
@@ -7036,22 +7155,24 @@ function pageMessages(
}
const rowids: Array = writable
- .prepare(
- `
- DELETE FROM tmp_${runId}_updated_messages
- RETURNING rowid
- ORDER BY received_at ASC, sent_at ASC
- LIMIT $chunkSize;
+ .prepare(
`
+ DELETE FROM tmp_${runId}_updated_messages
+ RETURNING rowid
+ ORDER BY received_at ASC, sent_at ASC
+ LIMIT $chunkSize;
+ `,
+ {
+ pluck: true,
+ }
)
- .pluck()
.all({ chunkSize });
const messages = batchMultiVarQuery(
writable,
rowids,
(batch: ReadonlyArray): Array => {
- const query = writable.prepare(
+ const query = writable.prepare(
`
SELECT ${MESSAGE_COLUMNS.join(', ')}
FROM messages
@@ -7117,7 +7238,7 @@ function getKnownConversationAttachments(db: ReadableDB): Array {
`${conversationTotal}`
);
- const fetchConversations = db.prepare(
+ const fetchConversations = db.prepare(
`
SELECT json FROM conversations
WHERE id > $id
@@ -7127,7 +7248,7 @@ function getKnownConversationAttachments(db: ReadableDB): Array {
);
while (!complete) {
- const rows = fetchConversations.all({
+ const rows = fetchConversations.all<{ json: string }>({
id,
chunkSize,
});
@@ -7172,7 +7293,7 @@ function removeKnownStickers(
while (!complete) {
const rows: Array<{ rowid: number; path: string }> = db
- .prepare(
+ .prepare(
`
SELECT rowid, path FROM stickers
WHERE rowid > $rowid
@@ -7225,7 +7346,7 @@ function removeKnownDraftAttachments(
while (!complete) {
const rows: JSONRows = db
- .prepare(
+ .prepare(
`
SELECT json FROM conversations
WHERE id > $id
@@ -7268,7 +7389,7 @@ export function getJobsInQueue(
queueType: string
): Array {
return db
- .prepare(
+ .prepare(
`
SELECT id, timestamp, data
FROM jobs
@@ -7276,7 +7397,7 @@ export function getJobsInQueue(
ORDER BY timestamp;
`
)
- .all({ queueType })
+ .all<{ id: string; timestamp: number; data: string }>({ queueType })
.map(row => ({
id: row.id,
queueType,
@@ -7286,7 +7407,7 @@ export function getJobsInQueue(
}
export function insertJob(db: WritableDB, job: Readonly): void {
- db.prepare(
+ db.prepare(
`
INSERT INTO jobs
(id, queueType, timestamp, data)
@@ -7302,40 +7423,46 @@ export function insertJob(db: WritableDB, job: Readonly): void {
}
function deleteJob(db: WritableDB, id: string): void {
- db.prepare('DELETE FROM jobs WHERE id = $id').run({ id });
+ db.prepare('DELETE FROM jobs WHERE id = $id').run({ id });
}
function wasGroupCallRingPreviouslyCanceled(
db: ReadableDB,
ringId: bigint
): boolean {
- return db
- .prepare