Back2Back: third-party notices ============================== Back2Back is built with the open-source components below, each the property of its authors and used under the licence printed with it. None of them endorses Back2Back. Part 1 what is not a Rust package: Deep Symmetry's code, which two of Back2Back's files are translated from, libwebrtc and every library built into it, Signalsmith Stretch and Linear, Archivo; and the files of Symphonia that Back2Back changed, in full Part 2 the Rust packages under the MIT licence: its text once, then each package with its copyright lines Part 3 the Rust packages under the Apache License 2.0: likewise Part 4 every other licence text, exactly as the packages ship it, each once with the packages shipping it Part 5 the NOTICE and COPYRIGHT files the packages ship, exactly as they ship them Part 6 packages whose own files do not carry the licence they declare, under its standard text A package under two licences at its user's choice ("MIT OR Apache-2.0") is in every part whose licence it ships a copy of. Written by tools/third_party_notices.py from the app's Cargo.lock; the list of packages alone, with the server's, is /third-party.txt on the Back2Back website. ============================================================================== PART 1. WHAT IS NOT A RUST PACKAGE ============================================================================== beat-link 8.0.0 and electro 0.1.4 (Deep Symmetry) ------------------------------------------------- beat-link: Copyright (c) 2016-2025 Deep Symmetry, LLC. electro: Copyright (c) 2018-2022 Deep Symmetry, LLC (https://deepsymmetry.org). beat-link 8.0.0 is distributed under the Eclipse Public License 2.0. electro 0.1.4 was published under the Eclipse Public License 1.0; its authors have since moved it to version 2.0, and version 1.0 (section 7) lets it be passed on under the newer version, which is how it is used here. Version 2.0 is printed below. Two files of Back2Back's PRO DJ LINK code are translations into Rust of parts of them: claim.rs, from beat-link's VirtualCdj.claimDeviceNumber and selfAssignDeviceNumber, and metronome.rs, from electro's Metronome. Those two files, with Back2Back's changes, are under the Eclipse Public License 2.0 and not under Back2Back's own terms: their source code is printed in full after the licence, and you may use, change and pass them on under it. No other part of Back2Back is under that licence. Elsewhere, Back2Back's own code uses facts about the protocol that Deep Symmetry's research established. As far as the law allows, Deep Symmetry and the other contributors to beat-link and electro give no warranty or condition of any kind for Back2Back, and accept no liability for any loss or damage arising from it. Back2Back is not made or endorsed by Deep Symmetry. Licence: EPL-2.0. https://github.com/Deep-Symmetry/beat-link Eclipse Public License - v 2.0 THE ACCOMPANYING PROGRAM IS PROVIDED UNDER THE TERMS OF THIS ECLIPSE PUBLIC LICENSE ("AGREEMENT"). ANY USE, REPRODUCTION OR DISTRIBUTION OF THE PROGRAM CONSTITUTES RECIPIENT'S ACCEPTANCE OF THIS AGREEMENT. 1. DEFINITIONS "Contribution" means: a) in the case of the initial Contributor, the initial content Distributed under this Agreement, and b) in the case of each subsequent Contributor: i) changes to the Program, and ii) additions to the Program; where such changes and/or additions to the Program originate from and are Distributed by that particular Contributor. A Contribution "originates" from a Contributor if it was added to the Program by such Contributor itself or anyone acting on such Contributor's behalf. Contributions do not include changes or additions to the Program that are not Modified Works. "Contributor" means any person or entity that Distributes the Program. "Licensed Patents" mean patent claims licensable by a Contributor which are necessarily infringed by the use or sale of its Contribution alone or when combined with the Program. "Program" means the Contributions Distributed in accordance with this Agreement. "Recipient" means anyone who receives the Program under this Agreement or any Secondary License (as applicable), including Contributors. "Derivative Works" shall mean any work, whether in Source Code or other form, that is based on (or derived from) the Program and for which the editorial revisions, annotations, elaborations, or other modifications represent, as a whole, an original work of authorship. "Modified Works" shall mean any work in Source Code or other form that results from an addition to, deletion from, or modification of the contents of the Program, including, for purposes of clarity any new file in Source Code form that contains any contents of the Program. Modified Works shall not include works that contain only declarations, interfaces, types, classes, structures, or files of the Program solely in each case in order to link to, bind by name, or subclass the Program or Modified Works thereof. "Distribute" means the acts of a) distributing or b) making available in any manner that enables the transfer of a copy. "Source Code" means the form of a Program preferred for making modifications, including but not limited to software source code, documentation source, and configuration files. "Secondary License" means either the GNU General Public License, Version 2.0, or any later versions of that license, including any exceptions or additional permissions as identified by the initial Contributor. 2. GRANT OF RIGHTS a) Subject to the terms of this Agreement, each Contributor hereby grants Recipient a non-exclusive, worldwide, royalty-free copyright license to reproduce, prepare Derivative Works of, publicly display, publicly perform, Distribute and sublicense the Contribution of such Contributor, if any, and such Derivative Works. b) Subject to the terms of this Agreement, each Contributor hereby grants Recipient a non-exclusive, worldwide, royalty-free patent license under Licensed Patents to make, use, sell, offer to sell, import and otherwise transfer the Contribution of such Contributor, if any, in Source Code or other form. This patent license shall apply to the combination of the Contribution and the Program if, at the time the Contribution is added by the Contributor, such addition of the Contribution causes such combination to be covered by the Licensed Patents. The patent license shall not apply to any other combinations which include the Contribution. No hardware per se is licensed hereunder. c) Recipient understands that although each Contributor grants the licenses to its Contributions set forth herein, no assurances are provided by any Contributor that the Program does not infringe the patent or other intellectual property rights of any other entity. Each Contributor disclaims any liability to Recipient for claims brought by any other entity based on infringement of intellectual property rights or otherwise. As a condition to exercising the rights and licenses granted hereunder, each Recipient hereby assumes sole responsibility to secure any other intellectual property rights needed, if any. For example, if a third party patent license is required to allow Recipient to Distribute the Program, it is Recipient's responsibility to acquire that license before distributing the Program. d) Each Contributor represents that to its knowledge it has sufficient copyright rights in its Contribution, if any, to grant the copyright license set forth in this Agreement. e) Notwithstanding the terms of any Secondary License, no Contributor makes additional grants to any Recipient (other than those set forth in this Agreement) as a result of such Recipient's receipt of the Program under the terms of a Secondary License (if permitted under the terms of Section 3). 3. REQUIREMENTS 3.1 If a Contributor Distributes the Program in any form, then: a) the Program must also be made available as Source Code, in accordance with section 3.2, and the Contributor must accompany the Program with a statement that the Source Code for the Program is available under this Agreement, and informs Recipients how to obtain it in a reasonable manner on or through a medium customarily used for software exchange; and b) the Contributor may Distribute the Program under a license different than this Agreement, provided that such license: i) effectively disclaims on behalf of all other Contributors all warranties and conditions, express and implied, including warranties or conditions of title and non-infringement, and implied warranties or conditions of merchantability and fitness for a particular purpose; ii) effectively excludes on behalf of all other Contributors all liability for damages, including direct, indirect, special, incidental and consequential damages, such as lost profits; iii) does not attempt to limit or alter the recipients' rights in the Source Code under section 3.2; and iv) requires any subsequent distribution of the Program by any party to be under a license that satisfies the requirements of this section 3. 3.2 When the Program is Distributed as Source Code: a) it must be made available under this Agreement, or if the Program (i) is combined with other material in a separate file or files made available under a Secondary License, and (ii) the initial Contributor attached to the Source Code the notice described in Exhibit A of this Agreement, then the Program may be made available under the terms of such Secondary Licenses, and b) a copy of this Agreement must be included with each copy of the Program. 3.3 Contributors may not remove or alter any copyright, patent, trademark, attribution notices, disclaimers of warranty, or limitations of liability ("notices") contained within the Program from any copy of the Program which they Distribute, provided that Contributors may add their own appropriate notices. 4. COMMERCIAL DISTRIBUTION Commercial distributors of software may accept certain responsibilities with respect to end users, business partners and the like. While this license is intended to facilitate the commercial use of the Program, the Contributor who includes the Program in a commercial product offering should do so in a manner which does not create potential liability for other Contributors. Therefore, if a Contributor includes the Program in a commercial product offering, such Contributor ("Commercial Contributor") hereby agrees to defend and indemnify every other Contributor ("Indemnified Contributor") against any losses, damages and costs (collectively "Losses") arising from claims, lawsuits and other legal actions brought by a third party against the Indemnified Contributor to the extent caused by the acts or omissions of such Commercial Contributor in connection with its distribution of the Program in a commercial product offering. The obligations in this section do not apply to any claims or Losses relating to any actual or alleged intellectual property infringement. In order to qualify, an Indemnified Contributor must: a) promptly notify the Commercial Contributor in writing of such claim, and b) allow the Commercial Contributor to control, and cooperate with the Commercial Contributor in, the defense and any related settlement negotiations. The Indemnified Contributor may participate in any such claim at its own expense. For example, a Contributor might include the Program in a commercial product offering, Product X. That Contributor is then a Commercial Contributor. If that Commercial Contributor then makes performance claims, or offers warranties related to Product X, those performance claims and warranties are such Commercial Contributor's responsibility alone. Under this section, the Commercial Contributor would have to defend claims against the other Contributors related to those performance claims and warranties, and if a court requires any other Contributor to pay any damages as a result, the Commercial Contributor must pay those damages. 5. NO WARRANTY EXCEPT AS EXPRESSLY SET FORTH IN THIS AGREEMENT, AND TO THE EXTENT PERMITTED BY APPLICABLE LAW, THE PROGRAM IS PROVIDED ON AN "AS IS" BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, EITHER EXPRESS OR IMPLIED INCLUDING, WITHOUT LIMITATION, ANY WARRANTIES OR CONDITIONS OF TITLE, NON-INFRINGEMENT, MERCHANTABILITY OR FITNESS FOR A PARTICULAR PURPOSE. Each Recipient is solely responsible for determining the appropriateness of using and distributing the Program and assumes all risks associated with its exercise of rights under this Agreement, including but not limited to the risks and costs of program errors, compliance with applicable laws, damage to or loss of data, programs or equipment, and unavailability or interruption of operations. 6. DISCLAIMER OF LIABILITY EXCEPT AS EXPRESSLY SET FORTH IN THIS AGREEMENT, AND TO THE EXTENT PERMITTED BY APPLICABLE LAW, NEITHER RECIPIENT NOR ANY CONTRIBUTORS SHALL HAVE ANY LIABILITY FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING WITHOUT LIMITATION LOST PROFITS), HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OR DISTRIBUTION OF THE PROGRAM OR THE EXERCISE OF ANY RIGHTS GRANTED HEREUNDER, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGES. 7. GENERAL If any provision of this Agreement is invalid or unenforceable under applicable law, it shall not affect the validity or enforceability of the remainder of the terms of this Agreement, and without further action by the parties hereto, such provision shall be reformed to the minimum extent necessary to make such provision valid and enforceable. If Recipient institutes patent litigation against any entity (including a cross-claim or counterclaim in a lawsuit) alleging that the Program itself (excluding combinations of the Program with other software or hardware) infringes such Recipient's patent(s), then such Recipient's rights granted under Section 2(b) shall terminate as of the date such litigation is filed. All Recipient's rights under this Agreement shall terminate if it fails to comply with any of the material terms or conditions of this Agreement and does not cure such failure in a reasonable period of time after becoming aware of such noncompliance. If all Recipient's rights under this Agreement terminate, Recipient agrees to cease use and distribution of the Program as soon as reasonably practicable. However, Recipient's obligations under this Agreement and any licenses granted by Recipient relating to the Program shall continue and survive. Everyone is permitted to copy and distribute copies of this Agreement, but in order to avoid inconsistency the Agreement is copyrighted and may only be modified in the following manner. The Agreement Steward reserves the right to publish new versions (including revisions) of this Agreement from time to time. No one other than the Agreement Steward has the right to modify this Agreement. The Eclipse Foundation is the initial Agreement Steward. The Eclipse Foundation may assign the responsibility to serve as the Agreement Steward to a suitable separate entity. Each new version of the Agreement will be given a distinguishing version number. The Program (including Contributions) may always be Distributed subject to the version of the Agreement under which it was received. In addition, after a new version of the Agreement is published, Contributor may elect to Distribute the Program (including its Contributions) under the new version. Except as expressly stated in Sections 2(a) and 2(b) above, Recipient receives no rights or licenses to the intellectual property of any Contributor under this Agreement, whether expressly, by implication, estoppel or otherwise. All rights in the Program not expressly granted under this Agreement are reserved. Nothing in this Agreement is intended to be enforceable by any entity that is not a Contributor or Recipient. No third-party beneficiary rights are created under this Agreement. Exhibit A - Form of Secondary Licenses Notice "This Source Code may also be made available under the following Secondary Licenses when the conditions for such availability set forth in the Eclipse Public License, v. 2.0 are satisfied: {name license(s), version(s), and exceptions or additional permissions here}." Simply including a copy of this Agreement, including this Exhibit A is not sufficient to license the Source Code under Secondary Licenses. If it is not possible or desirable to put the notice in a particular file, then You may include the notice in a location (such as a LICENSE file in a relevant directory) where a recipient would be likely to look for such a notice. You may add additional accurate notices of copyright ownership. ==== djlink-net/src/claim.rs ================================================= // SPDX-License-Identifier: EPL-2.0 // // A translation into Rust of `VirtualCdj.claimDeviceNumber()` and `selfAssignDeviceNumber()`, from // beat-link 8.0.0: Copyright (c) 2016-2025 Deep Symmetry, LLC (https://deepsymmetry.org). Changes // Copyright (c) 2026 Back2Back. This file is made available under the terms of the Eclipse Public // License 2.0, which is at https://www.eclipse.org/legal/epl-2.0/ -- this file only: the rest of // Back2Back is not under it. //! Taking a device number, the way a real player does. //! //! A direct port of `VirtualCdj.claimDeviceNumber()` and `selfAssignDeviceNumber()`, read from the //! shipped jar's bytecode. Three hellos, then three stage-1 packets, then three stage-2, then one //! stage-3, each 300 ms apart, watching the whole time for anybody defending the number we want. //! //! **Why a standard number 1-4 and not 5 or 6.** A player only sends its data to a device holding a //! real player number. Running as 5 leaves us visible on the network and deaf to everything that //! matters, which is a failure mode that looks like working. use std::net::{Ipv4Addr, SocketAddrV4}; use std::time::Duration; use djlink_proto::discovery; use djlink_proto::header::port; use tokio::net::UdpSocket; use crate::device_finder::DeviceFinder; use crate::metronome::now_ms; /// Between every packet of the handshake. beat-link's own figure. const STEP: Duration = Duration::from_millis(300); /// How long after the **first device announcement** a number may be claimed. /// /// beat-link's `selfAssignDeviceNumber` blocks until this much time has passed since /// `DeviceFinder.getFirstDeviceTime()`. This is a different clock from a fixed wait after /// discovery starts: that one runs from start-up, this one from the first deck heard. On a network where a deck powers on late, this is the one that dominates, and claiming /// before a deck has finished announcing itself is how numbers collide. const SETTLE_AFTER_FIRST_DEVICE: i64 = 4_000; /// Why we could not get a number. #[derive(Debug, thiserror::Error)] pub enum ClaimError { #[error( "all four player numbers are in use, so there is no number left that a deck would talk \ to. Free one up by taking a player off the network." )] NoPlayerNumberFree, #[error("another device is already using number {0}")] Refused(u8), #[error("could not send on the DJ Link network: {0}")] Io(#[from] std::io::Error), } /// Claim a standard player number, and return the one we got. /// /// `socket` must already be bound to the chosen interface address on [`port::UPDATE`] -- the /// packets go *to* port 50000 but come *from* 50002, as beat-link's do, which is what the hardware /// has been observed to accept. pub async fn claim_device_number( socket: &UdpSocket, finder: &DeviceFinder, broadcast: Ipv4Addr, mac: [u8; 6], our_address: Ipv4Addr, ) -> Result { let to = SocketAddrV4::new(broadcast, port::ANNOUNCE); // "Is anyone out there?", three times. for n in 1..=3 { tracing::debug!(target: "link", "sending hello packet {n}"); socket.send_to(&discovery::hello(), to).await?; tokio::time::sleep(STEP).await; } wait_for_discovery_to_settle(finder).await; let number = lowest_free_player_number(finder)?; tracing::info!(target: "link", "claiming device number {number}"); finder.set_claiming(number); // Stage 1 announces that somebody is claiming, without saying what. Stage 2 names the number // and our address. Stage 3 confirms it. A defence can arrive during any of them. for counter in 1..=3 { socket .send_to(&discovery::claim_stage_1(counter, mac), to) .await?; tokio::time::sleep(STEP).await; if finder.claim_rejected() { return Err(ClaimError::Refused(number)); } } for counter in 1..=3 { socket .send_to( // Self-assigning: we took whatever was free rather than being told a number. &discovery::claim_stage_2(counter, number, true, mac, our_address.octets()), to, ) .await?; tokio::time::sleep(STEP).await; if finder.claim_rejected() { return Err(ClaimError::Refused(number)); } } socket .send_to(&discovery::claim_stage_3(1, number), to) .await?; finder.set_claiming(0); Ok(number) } /// Block until enough time has passed since the first device announced itself. /// /// Returns immediately when nothing has been heard at all -- there is nothing to settle, and the /// caller has already decided it wants to come online anyway. async fn wait_for_discovery_to_settle(finder: &DeviceFinder) { let Some(first) = finder.first_device_at() else { return; }; let remaining = SETTLE_AFTER_FIRST_DEVICE - (now_ms() - first); if remaining > 0 { tracing::debug!(target: "link", "waiting {remaining} ms more for discovery to settle"); tokio::time::sleep(Duration::from_millis(remaining as u64)).await; } } /// The lowest player number nobody is using. /// /// beat-link warns and walks on past 4 up to 15 when the standard numbers are gone. We stop at 4, /// because a number above 4 is not one a deck will send its data to -- taking 5 would leave the /// app looking healthy and doing nothing. The caller is expected to keep retrying rather than /// treat this as fatal: four decks now does not mean four decks in ten minutes. fn lowest_free_player_number(finder: &DeviceFinder) -> Result { let taken = finder.numbers_in_use(); (1..=4) .find(|n| !taken.contains(n)) .ok_or(ClaimError::NoPlayerNumberFree) } #[cfg(test)] mod tests { use super::*; #[test] fn a_stage_2_packet_says_we_self_assigned() { // The byte at 0x31 is 1 only because we picked the number ourselves. If a "choose my // number" setting is ever added it has to become 2, and this is the reminder. let packet = discovery::claim_stage_2(1, 3, true, [0; 6], [169, 254, 119, 4]); assert_eq!(packet[0x31], 1); assert_eq!(packet[0x2e], 3, "the number claimed"); assert_eq!(packet[0x2f], 1, "the counter"); let named = discovery::claim_stage_2(1, 3, false, [0; 6], [169, 254, 119, 4]); assert_eq!(named[0x31], 2); } } ==== end of djlink-net/src/claim.rs ==== ==== djlink-net/src/metronome.rs ============================================= // SPDX-License-Identifier: EPL-2.0 // // A translation into Rust of `org.deepsymmetry.electro.Metronome`, from electro 0.1.4: Copyright (c) // 2018-2022 Deep Symmetry, LLC (https://deepsymmetry.org). Changes Copyright (c) 2026 Back2Back. // This file is made available under the terms of the Eclipse Public License 2.0, which is at // https://www.eclipse.org/legal/epl-2.0/ -- this file only: the rest of Back2Back is not under it. //! A port of `org.deepsymmetry.electro.Metronome`. //! //! A timeline: when beat 1 began, a tempo, beats to the bar and bars to the phrase, and every //! reading derived from them -- the beat, the bar, the phase within each, when a beat began -- at //! a given instant. //! //! Ported from electro 0.1.4's bytecode rather than from its documentation or from memory. The //! arithmetic below is what `javap -c` says, including the places where the operand order matters //! ([`Metronome::set_tempo`] in particular). //! //! One shape change from the Java: every derived value takes the instant it is asked about. Java //! called `System.currentTimeMillis()` inside each getter, so two getters called in a row could //! straddle a beat boundary and disagree. [`Metronome::snapshot`] existed to avoid exactly that, //! and here it is the only way to read several fields at once. use djlink_proto::java_round; /// Wall-clock milliseconds, the same quantity Java's `System.currentTimeMillis()` returns, and the /// unit electro's timeline is measured in. #[must_use] pub fn now_ms() -> i64 { std::time::SystemTime::now() .duration_since(std::time::UNIX_EPOCH) .map_or(0, |d| d.as_millis() as i64) } /// How many milliseconds `beats` beats last at `tempo` BPM. #[must_use] pub fn beats_to_milliseconds(beats: i64, tempo: f64) -> f64 { 60_000.0 / tempo * beats as f64 } /// Which marker (1-based) `instant` falls in, given markers of `interval` starting at `start`. #[must_use] fn marker_number(instant: i64, start: i64, interval: f64) -> i64 { (((instant - start) as f64 / interval).floor() as i64) + 1 } /// How far through its marker `instant` is, in the range `[0, 1)`. #[must_use] fn marker_phase(instant: i64, start: i64, interval: f64) -> f64 { let x = (instant - start) as f64 / interval; x - x.floor() } /// A phase offset moved into `(-0.5, 0.5]`, so "just before the next beat" reads as a small /// negative rather than a large positive. #[must_use] fn find_closest_delta(phase: f64) -> f64 { if phase > 0.5 { phase - 1.0 } else if phase < -0.5 { phase + 1.0 } else { phase } } /// Where we claim to be in the track. #[derive(Debug, Clone, Copy, PartialEq)] pub struct Metronome { /// Wall-clock milliseconds at which beat 1 began. Moving this is how every seek is done. start_time: i64, tempo: f64, beats_per_bar: u32, bars_per_phrase: u32, } impl Default for Metronome { fn default() -> Self { Self::new() } } impl Metronome { /// electro's own defaults: 120 BPM, four beats to the bar, eight bars to the phrase, started now. #[must_use] pub fn new() -> Self { Self { start_time: now_ms(), tempo: 120.0, beats_per_bar: 4, bars_per_phrase: 8, } } #[must_use] pub fn start_time(&self) -> i64 { self.start_time } #[must_use] pub fn tempo(&self) -> f64 { self.tempo } #[must_use] pub fn beats_per_bar(&self) -> u32 { self.beats_per_bar } /// Milliseconds in one beat at the current tempo. #[must_use] pub fn beat_interval(&self) -> f64 { beats_to_milliseconds(1, self.tempo) } /// Milliseconds in one bar at the current tempo. #[must_use] pub fn bar_interval(&self) -> f64 { beats_to_milliseconds(i64::from(self.beats_per_bar), self.tempo) } /// Slide the whole timeline by `delta` milliseconds. Positive moves us *later* in the track. pub fn adjust_start(&mut self, delta: i64) { self.start_time += delta; } /// Move to `beat` without changing tempo, as of `now`. pub fn jump_to_beat(&mut self, beat: i64, now: i64) { self.start_time = now - java_round((beat - 1) as f64 * self.beat_interval()); } /// Change tempo while holding both the current beat **and its phase**. /// /// The order of operations is load-bearing and is why this is not simply `self.tempo = t`: /// the beat and phase are measured at the *old* interval and re-applied at the *new* one. Get /// it wrong and every tempo change is also a seek. pub fn set_tempo(&mut self, tempo: f64, now: i64) { let interval = self.beat_interval(); let beat = marker_number(now, self.start_time, interval); let phase = marker_phase(now, self.start_time, interval); let new_interval = beats_to_milliseconds(1, tempo); self.start_time = now - java_round(new_interval * (phase + beat as f64 - 1.0)); self.tempo = tempo; } /// The beat we are on at `now`. 1-based; beats before the start are zero and negative. #[must_use] pub fn beat(&self, now: i64) -> i64 { marker_number(now, self.start_time, self.beat_interval()) } /// The bar we are on at `now`, 1-based. #[must_use] pub fn bar(&self, now: i64) -> i64 { marker_number(now, self.start_time, self.bar_interval()) } /// When `beat` began (or will begin), in wall-clock milliseconds. #[must_use] pub fn time_of_beat(&self, beat: i64) -> i64 { java_round((beat - 1) as f64 * self.beat_interval()) + self.start_time } /// How far through the current beat we are at `now`, in `[0, 1)`. #[must_use] pub fn beat_phase(&self, now: i64) -> f64 { marker_phase(now, self.start_time, self.beat_interval()) } /// How far through the current bar we are at `now`, in `[0, 1)`. #[must_use] pub fn bar_phase(&self, now: i64) -> f64 { marker_phase(now, self.start_time, self.bar_interval()) } /// Position within the bar, 1-based, derived rigidly from the bar phase. #[must_use] pub fn beat_within_bar(&self, now: i64) -> u8 { let width = 1.0 / f64::from(self.beats_per_bar); (1 + (self.bar_phase(now) / width).floor() as i64) as u8 } /// Milliseconds to the nearest beat boundary: negative just before one, positive just after. #[must_use] pub fn distance_from_beat(&self, now: i64) -> f64 { find_closest_delta(self.beat_phase(now)) * self.beat_interval() } /// Every derived field frozen at one instant, so they cannot disagree with each other. #[must_use] pub fn snapshot(&self, now: i64) -> Snapshot { Snapshot { instant: now, beat: self.beat(now), bar: self.bar(now), beat_within_bar: self.beat_within_bar(now), beat_phase: self.beat_phase(now), tempo: self.tempo, beat_interval: self.beat_interval(), time_of_beat: self.time_of_beat(self.beat(now)), } } } /// One consistent reading of a [`Metronome`]. /// /// A status packet carries beat number, bar position and tempo together; taking them from three /// separate calls lets a beat boundary land between two of them and ship a packet whose beat and /// bar position describe different moments. #[derive(Debug, Clone, Copy, PartialEq)] pub struct Snapshot { /// The wall-clock millisecond this describes. pub instant: i64, pub beat: i64, pub bar: i64, pub beat_within_bar: u8, pub beat_phase: f64, pub tempo: f64, pub beat_interval: f64, /// When the current beat began -- not `instant`, which is when the reading was taken. pub time_of_beat: i64, } #[cfg(test)] mod tests { use super::*; /// A metronome pinned to a known start, so nothing here depends on the wall clock. fn at(start_time: i64, tempo: f64) -> Metronome { Metronome { start_time, tempo, beats_per_bar: 4, bars_per_phrase: 8, } } #[test] fn beats_are_one_based_and_bars_follow_them() { let m = at(0, 120.0); // 500 ms a beat, 2000 ms a bar assert_eq!(m.beat(0), 1); assert_eq!(m.beat(499), 1); assert_eq!(m.beat(500), 2); assert_eq!(m.beat(2000), 5); assert_eq!(m.bar(0), 1); assert_eq!(m.bar(2000), 2); // Beat 1 is the first downbeat, and the bar position walks 1..4 and wraps. assert_eq!(m.beat_within_bar(0), 1); assert_eq!(m.beat_within_bar(500), 2); assert_eq!(m.beat_within_bar(1500), 4); assert_eq!(m.beat_within_bar(2000), 1); } #[test] fn the_metronomes_bar_position_agrees_with_the_one_we_broadcast() { // djlink_proto::beat_within_bar derives it from the beat number; this derives it from the // bar phase. They must never disagree, or the status packet and the beat packet would // describe different bars. let m = at(0, 128.0); for ms in (0..20_000).step_by(37) { let beat = m.beat(ms); assert_eq!( m.beat_within_bar(ms), djlink_proto::beat_within_bar(beat as u32), "disagreed at {ms} ms, beat {beat}" ); } } #[test] fn changing_tempo_holds_the_beat_and_its_phase() { // The property the Java's operand order exists to preserve: if this drifted, every tempo // change would also be a small seek. let mut m = at(0, 120.0); let now = 1234; // partway through beat 3 let beat_before = m.beat(now); let phase_before = m.beat_phase(now); m.set_tempo(175.0, now); assert_eq!(m.beat(now), beat_before); assert!( (m.beat_phase(now) - phase_before).abs() < 1e-3, "phase moved from {phase_before} to {}", m.beat_phase(now) ); assert!((m.tempo() - 175.0).abs() < 1e-9); } #[test] fn jumping_to_a_beat_puts_us_at_the_top_of_it() { let mut m = at(0, 120.0); let now = 9_999; m.jump_to_beat(64, now); assert_eq!(m.beat(now), 64); assert!(m.beat_phase(now) < 1e-9, "a jump lands on the beat, not partway through it"); assert_eq!(m.time_of_beat(64), now); } #[test] fn adjusting_the_start_moves_us_later_into_the_track() { // adjust_start(-ms) is what "move +ms further into the track" means, and the sign is // inverted often enough to be worth pinning down. let mut m = at(0, 120.0); let before = m.beat_phase(1000); m.adjust_start(-250); // a quarter of a 500 ms beat assert!((m.beat_phase(1000) - (before + 0.5)).abs() < 1e-9); } #[test] fn distance_from_beat_is_signed_toward_the_nearer_boundary() { let m = at(0, 120.0); // 500 ms a beat assert!(m.distance_from_beat(10).abs() - 10.0 < 1e-9, "just after a beat: small positive"); assert!(m.distance_from_beat(10) > 0.0); // Just before the next beat reads as a small negative, not as nearly a whole beat. assert!(m.distance_from_beat(490) < 0.0); assert!((m.distance_from_beat(490) + 10.0).abs() < 1e-9); } #[test] fn a_snapshot_cannot_straddle_a_beat_boundary() { let m = at(0, 120.0); // 499.999 ms in: the beat is 1 and the phase is nearly a whole beat. Asked separately at // wall-clock speed these two could come from either side of the boundary. let s = m.snapshot(499); assert_eq!(s.beat, 1); assert_eq!(s.beat_within_bar, 1); assert_eq!(s.time_of_beat, 0, "the anchor is the top of the current beat"); assert!(s.beat_phase > 0.99); } } ==== end of djlink-net/src/metronome.rs ==== libwebrtc (LiveKit's build) webrtc-51ef663 ------------------------------------------ Real-time audio and the Opus codec, with the libraries LiveKit's build compiles into it. Licence: BSD-3-Clause; the libraries it bundles, their own. https://github.com/livekit/rust-sdks/releases/tag/webrtc-51ef663 libwebrtc, as LiveKit builds it: release webrtc-51ef663 of https://github.com/livekit/rust-sdks Every library built into the libwebrtc builds Back2Back ships, with its licence, from each build's own LICENSE.md: mac-arm64-release, mac-x64-release, win-x64-release. A library is named once, with the builds that carry it. Written by tools/libwebrtc_notices.py. ------------------------------------------------------------------------------ webrtc (every build) ------------------------------------------------------------------------------ Copyright (c) 2011, The WebRTC project authors. All rights reserved. Redistribution and use in source and binary forms, with or without modification, are permitted provided that the following conditions are met: * Redistributions of source code must retain the above copyright notice, this list of conditions and the following disclaimer. * Redistributions in binary form must reproduce the above copyright notice, this list of conditions and the following disclaimer in the documentation and/or other materials provided with the distribution. * Neither the name of Google nor the names of its contributors may be used to endorse or promote products derived from this software without specific prior written permission. THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. ------------------------------------------------------------------------------ abseil-cpp (every build) ------------------------------------------------------------------------------ Apache License Version 2.0, January 2004 https://www.apache.org/licenses/ TERMS AND CONDITIONS FOR USE, REPRODUCTION, AND DISTRIBUTION 1. Definitions. "License" shall mean the terms and conditions for use, reproduction, and distribution as defined by Sections 1 through 9 of this document. "Licensor" shall mean the copyright owner or entity authorized by the copyright owner that is granting the License. "Legal Entity" shall mean the union of the acting entity and all other entities that control, are controlled by, or are under common control with that entity. For the purposes of this definition, "control" means (i) the power, direct or indirect, to cause the direction or management of such entity, whether by contract or otherwise, or (ii) ownership of fifty percent (50%) or more of the outstanding shares, or (iii) beneficial ownership of such entity. "You" (or "Your") shall mean an individual or Legal Entity exercising permissions granted by this License. "Source" form shall mean the preferred form for making modifications, including but not limited to software source code, documentation source, and configuration files. "Object" form shall mean any form resulting from mechanical transformation or translation of a Source form, including but not limited to compiled object code, generated documentation, and conversions to other media types. "Work" shall mean the work of authorship, whether in Source or Object form, made available under the License, as indicated by a copyright notice that is included in or attached to the work (an example is provided in the Appendix below). "Derivative Works" shall mean any work, whether in Source or Object form, that is based on (or derived from) the Work and for which the editorial revisions, annotations, elaborations, or other modifications represent, as a whole, an original work of authorship. For the purposes of this License, Derivative Works shall not include works that remain separable from, or merely link (or bind by name) to the interfaces of, the Work and Derivative Works thereof. "Contribution" shall mean any work of authorship, including the original version of the Work and any modifications or additions to that Work or Derivative Works thereof, that is intentionally submitted to Licensor for inclusion in the Work by the copyright owner or by an individual or Legal Entity authorized to submit on behalf of the copyright owner. For the purposes of this definition, "submitted" means any form of electronic, verbal, or written communication sent to the Licensor or its representatives, including but not limited to communication on electronic mailing lists, source code control systems, and issue tracking systems that are managed by, or on behalf of, the Licensor for the purpose of discussing and improving the Work, but excluding communication that is conspicuously marked or otherwise designated in writing by the copyright owner as "Not a Contribution." "Contributor" shall mean Licensor and any individual or Legal Entity on behalf of whom a Contribution has been received by Licensor and subsequently incorporated within the Work. 2. Grant of Copyright License. Subject to the terms and conditions of this License, each Contributor hereby grants to You a perpetual, worldwide, non-exclusive, no-charge, royalty-free, irrevocable copyright license to reproduce, prepare Derivative Works of, publicly display, publicly perform, sublicense, and distribute the Work and such Derivative Works in Source or Object form. 3. Grant of Patent License. Subject to the terms and conditions of this License, each Contributor hereby grants to You a perpetual, worldwide, non-exclusive, no-charge, royalty-free, irrevocable (except as stated in this section) patent license to make, have made, use, offer to sell, sell, import, and otherwise transfer the Work, where such license applies only to those patent claims licensable by such Contributor that are necessarily infringed by their Contribution(s) alone or by combination of their Contribution(s) with the Work to which such Contribution(s) was submitted. If You institute patent litigation against any entity (including a cross-claim or counterclaim in a lawsuit) alleging that the Work or a Contribution incorporated within the Work constitutes direct or contributory patent infringement, then any patent licenses granted to You under this License for that Work shall terminate as of the date such litigation is filed. 4. Redistribution. You may reproduce and distribute copies of the Work or Derivative Works thereof in any medium, with or without modifications, and in Source or Object form, provided that You meet the following conditions: (a) You must give any other recipients of the Work or Derivative Works a copy of this License; and (b) You must cause any modified files to carry prominent notices stating that You changed the files; and (c) You must retain, in the Source form of any Derivative Works that You distribute, all copyright, patent, trademark, and attribution notices from the Source form of the Work, excluding those notices that do not pertain to any part of the Derivative Works; and (d) If the Work includes a "NOTICE" text file as part of its distribution, then any Derivative Works that You distribute must include a readable copy of the attribution notices contained within such NOTICE file, excluding those notices that do not pertain to any part of the Derivative Works, in at least one of the following places: within a NOTICE text file distributed as part of the Derivative Works; within the Source form or documentation, if provided along with the Derivative Works; or, within a display generated by the Derivative Works, if and wherever such third-party notices normally appear. The contents of the NOTICE file are for informational purposes only and do not modify the License. You may add Your own attribution notices within Derivative Works that You distribute, alongside or as an addendum to the NOTICE text from the Work, provided that such additional attribution notices cannot be construed as modifying the License. You may add Your own copyright statement to Your modifications and may provide additional or different license terms and conditions for use, reproduction, or distribution of Your modifications, or for any such Derivative Works as a whole, provided Your use, reproduction, and distribution of the Work otherwise complies with the conditions stated in this License. 5. Submission of Contributions. Unless You explicitly state otherwise, any Contribution intentionally submitted for inclusion in the Work by You to the Licensor shall be under the terms and conditions of this License, without any additional terms or conditions. Notwithstanding the above, nothing herein shall supersede or modify the terms of any separate license agreement you may have executed with Licensor regarding such Contributions. 6. Trademarks. This License does not grant permission to use the trade names, trademarks, service marks, or product names of the Licensor, except as required for reasonable and customary use in describing the origin of the Work and reproducing the content of the NOTICE file. 7. Disclaimer of Warranty. Unless required by applicable law or agreed to in writing, Licensor provides the Work (and each Contributor provides its Contributions) on an "AS IS" BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied, including, without limitation, any warranties or conditions of TITLE, NON-INFRINGEMENT, MERCHANTABILITY, or FITNESS FOR A PARTICULAR PURPOSE. You are solely responsible for determining the appropriateness of using or redistributing the Work and assume any risks associated with Your exercise of permissions under this License. 8. Limitation of Liability. In no event and under no legal theory, whether in tort (including negligence), contract, or otherwise, unless required by applicable law (such as deliberate and grossly negligent acts) or agreed to in writing, shall any Contributor be liable to You for damages, including any direct, indirect, special, incidental, or consequential damages of any character arising as a result of this License or out of the use or inability to use the Work (including but not limited to damages for loss of goodwill, work stoppage, computer failure or malfunction, or any and all other commercial damages or losses), even if such Contributor has been advised of the possibility of such damages. 9. Accepting Warranty or Additional Liability. While redistributing the Work or Derivative Works thereof, You may choose to offer, and charge a fee for, acceptance of support, warranty, indemnity, or other liability obligations and/or rights consistent with this License. However, in accepting such obligations, You may act only on Your own behalf and on Your sole responsibility, not on behalf of any other Contributor, and only if You agree to indemnify, defend, and hold each Contributor harmless for any liability incurred by, or claims asserted against, such Contributor by reason of your accepting any such warranty or additional liability. END OF TERMS AND CONDITIONS APPENDIX: How to apply the Apache License to your work. To apply the Apache License to your work, attach the following boilerplate notice, with the fields enclosed by brackets "[]" replaced with your own identifying information. (Don't include the brackets!) The text should be enclosed in the appropriate comment syntax for the file format. We also recommend that a file or class name and description of purpose be included on the same "printed page" as the copyright notice for easier identification within third-party archives. Copyright [yyyy] [name of copyright owner] Licensed under the Apache License, Version 2.0 (the "License"); you may not use this file except in compliance with the License. You may obtain a copy of the License at https://www.apache.org/licenses/LICENSE-2.0 Unless required by applicable law or agreed to in writing, software distributed under the License is distributed on an "AS IS" BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. See the License for the specific language governing permissions and limitations under the License. ------------------------------------------------------------------------------ boringssl (every build) ------------------------------------------------------------------------------ Apache License Version 2.0, January 2004 http://www.apache.org/licenses/ TERMS AND CONDITIONS FOR USE, REPRODUCTION, AND DISTRIBUTION 1. Definitions. "License" shall mean the terms and conditions for use, reproduction, and distribution as defined by Sections 1 through 9 of this document. "Licensor" shall mean the copyright owner or entity authorized by the copyright owner that is granting the License. "Legal Entity" shall mean the union of the acting entity and all other entities that control, are controlled by, or are under common control with that entity. For the purposes of this definition, "control" means (i) the power, direct or indirect, to cause the direction or management of such entity, whether by contract or otherwise, or (ii) ownership of fifty percent (50%) or more of the outstanding shares, or (iii) beneficial ownership of such entity. "You" (or "Your") shall mean an individual or Legal Entity exercising permissions granted by this License. "Source" form shall mean the preferred form for making modifications, including but not limited to software source code, documentation source, and configuration files. "Object" form shall mean any form resulting from mechanical transformation or translation of a Source form, including but not limited to compiled object code, generated documentation, and conversions to other media types. "Work" shall mean the work of authorship, whether in Source or Object form, made available under the License, as indicated by a copyright notice that is included in or attached to the work (an example is provided in the Appendix below). "Derivative Works" shall mean any work, whether in Source or Object form, that is based on (or derived from) the Work and for which the editorial revisions, annotations, elaborations, or other modifications represent, as a whole, an original work of authorship. For the purposes of this License, Derivative Works shall not include works that remain separable from, or merely link (or bind by name) to the interfaces of, the Work and Derivative Works thereof. "Contribution" shall mean any work of authorship, including the original version of the Work and any modifications or additions to that Work or Derivative Works thereof, that is intentionally submitted to Licensor for inclusion in the Work by the copyright owner or by an individual or Legal Entity authorized to submit on behalf of the copyright owner. For the purposes of this definition, "submitted" means any form of electronic, verbal, or written communication sent to the Licensor or its representatives, including but not limited to communication on electronic mailing lists, source code control systems, and issue tracking systems that are managed by, or on behalf of, the Licensor for the purpose of discussing and improving the Work, but excluding communication that is conspicuously marked or otherwise designated in writing by the copyright owner as "Not a Contribution." "Contributor" shall mean Licensor and any individual or Legal Entity on behalf of whom a Contribution has been received by Licensor and subsequently incorporated within the Work. 2. Grant of Copyright License. Subject to the terms and conditions of this License, each Contributor hereby grants to You a perpetual, worldwide, non-exclusive, no-charge, royalty-free, irrevocable copyright license to reproduce, prepare Derivative Works of, publicly display, publicly perform, sublicense, and distribute the Work and such Derivative Works in Source or Object form. 3. Grant of Patent License. Subject to the terms and conditions of this License, each Contributor hereby grants to You a perpetual, worldwide, non-exclusive, no-charge, royalty-free, irrevocable (except as stated in this section) patent license to make, have made, use, offer to sell, sell, import, and otherwise transfer the Work, where such license applies only to those patent claims licensable by such Contributor that are necessarily infringed by their Contribution(s) alone or by combination of their Contribution(s) with the Work to which such Contribution(s) was submitted. If You institute patent litigation against any entity (including a cross-claim or counterclaim in a lawsuit) alleging that the Work or a Contribution incorporated within the Work constitutes direct or contributory patent infringement, then any patent licenses granted to You under this License for that Work shall terminate as of the date such litigation is filed. 4. Redistribution. You may reproduce and distribute copies of the Work or Derivative Works thereof in any medium, with or without modifications, and in Source or Object form, provided that You meet the following conditions: (a) You must give any other recipients of the Work or Derivative Works a copy of this License; and (b) You must cause any modified files to carry prominent notices stating that You changed the files; and (c) You must retain, in the Source form of any Derivative Works that You distribute, all copyright, patent, trademark, and attribution notices from the Source form of the Work, excluding those notices that do not pertain to any part of the Derivative Works; and (d) If the Work includes a "NOTICE" text file as part of its distribution, then any Derivative Works that You distribute must include a readable copy of the attribution notices contained within such NOTICE file, excluding those notices that do not pertain to any part of the Derivative Works, in at least one of the following places: within a NOTICE text file distributed as part of the Derivative Works; within the Source form or documentation, if provided along with the Derivative Works; or, within a display generated by the Derivative Works, if and wherever such third-party notices normally appear. The contents of the NOTICE file are for informational purposes only and do not modify the License. You may add Your own attribution notices within Derivative Works that You distribute, alongside or as an addendum to the NOTICE text from the Work, provided that such additional attribution notices cannot be construed as modifying the License. You may add Your own copyright statement to Your modifications and may provide additional or different license terms and conditions for use, reproduction, or distribution of Your modifications, or for any such Derivative Works as a whole, provided Your use, reproduction, and distribution of the Work otherwise complies with the conditions stated in this License. 5. Submission of Contributions. Unless You explicitly state otherwise, any Contribution intentionally submitted for inclusion in the Work by You to the Licensor shall be under the terms and conditions of this License, without any additional terms or conditions. Notwithstanding the above, nothing herein shall supersede or modify the terms of any separate license agreement you may have executed with Licensor regarding such Contributions. 6. Trademarks. This License does not grant permission to use the trade names, trademarks, service marks, or product names of the Licensor, except as required for reasonable and customary use in describing the origin of the Work and reproducing the content of the NOTICE file. 7. Disclaimer of Warranty. Unless required by applicable law or agreed to in writing, Licensor provides the Work (and each Contributor provides its Contributions) on an "AS IS" BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied, including, without limitation, any warranties or conditions of TITLE, NON-INFRINGEMENT, MERCHANTABILITY, or FITNESS FOR A PARTICULAR PURPOSE. You are solely responsible for determining the appropriateness of using or redistributing the Work and assume any risks associated with Your exercise of permissions under this License. 8. Limitation of Liability. In no event and under no legal theory, whether in tort (including negligence), contract, or otherwise, unless required by applicable law (such as deliberate and grossly negligent acts) or agreed to in writing, shall any Contributor be liable to You for damages, including any direct, indirect, special, incidental, or consequential damages of any character arising as a result of this License or out of the use or inability to use the Work (including but not limited to damages for loss of goodwill, work stoppage, computer failure or malfunction, or any and all other commercial damages or losses), even if such Contributor has been advised of the possibility of such damages. 9. Accepting Warranty or Additional Liability. While redistributing the Work or Derivative Works thereof, You may choose to offer, and charge a fee for, acceptance of support, warranty, indemnity, or other liability obligations and/or rights consistent with this License. However, in accepting such obligations, You may act only on Your own behalf and on Your sole responsibility, not on behalf of any other Contributor, and only if You agree to indemnify, defend, and hold each Contributor harmless for any liability incurred by, or claims asserted against, such Contributor by reason of your accepting any such warranty or additional liability. END OF TERMS AND CONDITIONS APPENDIX: How to apply the Apache License to your work. To apply the Apache License to your work, attach the following boilerplate notice, with the fields enclosed by brackets "[]" replaced with your own identifying information. (Don't include the brackets!) The text should be enclosed in the appropriate comment syntax for the file format. We also recommend that a file or class name and description of purpose be included on the same "printed page" as the copyright notice for easier identification within third-party archives. Copyright [yyyy] [name of copyright owner] Licensed under the Apache License, Version 2.0 (the "License"); you may not use this file except in compliance with the License. You may obtain a copy of the License at http://www.apache.org/licenses/LICENSE-2.0 Unless required by applicable law or agreed to in writing, software distributed under the License is distributed on an "AS IS" BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. See the License for the specific language governing permissions and limitations under the License. Licenses for support code ------------------------- Parts of the TLS test suite are under the Go license. This code is not included in BoringSSL (i.e. libcrypto and libssl) when compiled, however, so distributing code linked against BoringSSL does not trigger this license: Copyright (c) 2009 The Go Authors. All rights reserved. Redistribution and use in source and binary forms, with or without modification, are permitted provided that the following conditions are met: * Redistributions of source code must retain the above copyright notice, this list of conditions and the following disclaimer. * Redistributions in binary form must reproduce the above copyright notice, this list of conditions and the following disclaimer in the documentation and/or other materials provided with the distribution. * Neither the name of Google Inc. nor the names of its contributors may be used to endorse or promote products derived from this software without specific prior written permission. THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. ------------------------------------------------------------------------------ compiler-rt (win-x64-release) ------------------------------------------------------------------------------ ============================================================================== The LLVM Project is under the Apache License v2.0 with LLVM Exceptions: ============================================================================== Apache License Version 2.0, January 2004 http://www.apache.org/licenses/ TERMS AND CONDITIONS FOR USE, REPRODUCTION, AND DISTRIBUTION 1. Definitions. "License" shall mean the terms and conditions for use, reproduction, and distribution as defined by Sections 1 through 9 of this document. "Licensor" shall mean the copyright owner or entity authorized by the copyright owner that is granting the License. "Legal Entity" shall mean the union of the acting entity and all other entities that control, are controlled by, or are under common control with that entity. For the purposes of this definition, "control" means (i) the power, direct or indirect, to cause the direction or management of such entity, whether by contract or otherwise, or (ii) ownership of fifty percent (50%) or more of the outstanding shares, or (iii) beneficial ownership of such entity. "You" (or "Your") shall mean an individual or Legal Entity exercising permissions granted by this License. "Source" form shall mean the preferred form for making modifications, including but not limited to software source code, documentation source, and configuration files. "Object" form shall mean any form resulting from mechanical transformation or translation of a Source form, including but not limited to compiled object code, generated documentation, and conversions to other media types. "Work" shall mean the work of authorship, whether in Source or Object form, made available under the License, as indicated by a copyright notice that is included in or attached to the work (an example is provided in the Appendix below). "Derivative Works" shall mean any work, whether in Source or Object form, that is based on (or derived from) the Work and for which the editorial revisions, annotations, elaborations, or other modifications represent, as a whole, an original work of authorship. For the purposes of this License, Derivative Works shall not include works that remain separable from, or merely link (or bind by name) to the interfaces of, the Work and Derivative Works thereof. "Contribution" shall mean any work of authorship, including the original version of the Work and any modifications or additions to that Work or Derivative Works thereof, that is intentionally submitted to Licensor for inclusion in the Work by the copyright owner or by an individual or Legal Entity authorized to submit on behalf of the copyright owner. For the purposes of this definition, "submitted" means any form of electronic, verbal, or written communication sent to the Licensor or its representatives, including but not limited to communication on electronic mailing lists, source code control systems, and issue tracking systems that are managed by, or on behalf of, the Licensor for the purpose of discussing and improving the Work, but excluding communication that is conspicuously marked or otherwise designated in writing by the copyright owner as "Not a Contribution." "Contributor" shall mean Licensor and any individual or Legal Entity on behalf of whom a Contribution has been received by Licensor and subsequently incorporated within the Work. 2. Grant of Copyright License. Subject to the terms and conditions of this License, each Contributor hereby grants to You a perpetual, worldwide, non-exclusive, no-charge, royalty-free, irrevocable copyright license to reproduce, prepare Derivative Works of, publicly display, publicly perform, sublicense, and distribute the Work and such Derivative Works in Source or Object form. 3. Grant of Patent License. Subject to the terms and conditions of this License, each Contributor hereby grants to You a perpetual, worldwide, non-exclusive, no-charge, royalty-free, irrevocable (except as stated in this section) patent license to make, have made, use, offer to sell, sell, import, and otherwise transfer the Work, where such license applies only to those patent claims licensable by such Contributor that are necessarily infringed by their Contribution(s) alone or by combination of their Contribution(s) with the Work to which such Contribution(s) was submitted. If You institute patent litigation against any entity (including a cross-claim or counterclaim in a lawsuit) alleging that the Work or a Contribution incorporated within the Work constitutes direct or contributory patent infringement, then any patent licenses granted to You under this License for that Work shall terminate as of the date such litigation is filed. 4. Redistribution. You may reproduce and distribute copies of the Work or Derivative Works thereof in any medium, with or without modifications, and in Source or Object form, provided that You meet the following conditions: (a) You must give any other recipients of the Work or Derivative Works a copy of this License; and (b) You must cause any modified files to carry prominent notices stating that You changed the files; and (c) You must retain, in the Source form of any Derivative Works that You distribute, all copyright, patent, trademark, and attribution notices from the Source form of the Work, excluding those notices that do not pertain to any part of the Derivative Works; and (d) If the Work includes a "NOTICE" text file as part of its distribution, then any Derivative Works that You distribute must include a readable copy of the attribution notices contained within such NOTICE file, excluding those notices that do not pertain to any part of the Derivative Works, in at least one of the following places: within a NOTICE text file distributed as part of the Derivative Works; within the Source form or documentation, if provided along with the Derivative Works; or, within a display generated by the Derivative Works, if and wherever such third-party notices normally appear. The contents of the NOTICE file are for informational purposes only and do not modify the License. You may add Your own attribution notices within Derivative Works that You distribute, alongside or as an addendum to the NOTICE text from the Work, provided that such additional attribution notices cannot be construed as modifying the License. You may add Your own copyright statement to Your modifications and may provide additional or different license terms and conditions for use, reproduction, or distribution of Your modifications, or for any such Derivative Works as a whole, provided Your use, reproduction, and distribution of the Work otherwise complies with the conditions stated in this License. 5. Submission of Contributions. Unless You explicitly state otherwise, any Contribution intentionally submitted for inclusion in the Work by You to the Licensor shall be under the terms and conditions of this License, without any additional terms or conditions. Notwithstanding the above, nothing herein shall supersede or modify the terms of any separate license agreement you may have executed with Licensor regarding such Contributions. 6. Trademarks. This License does not grant permission to use the trade names, trademarks, service marks, or product names of the Licensor, except as required for reasonable and customary use in describing the origin of the Work and reproducing the content of the NOTICE file. 7. Disclaimer of Warranty. Unless required by applicable law or agreed to in writing, Licensor provides the Work (and each Contributor provides its Contributions) on an "AS IS" BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied, including, without limitation, any warranties or conditions of TITLE, NON-INFRINGEMENT, MERCHANTABILITY, or FITNESS FOR A PARTICULAR PURPOSE. You are solely responsible for determining the appropriateness of using or redistributing the Work and assume any risks associated with Your exercise of permissions under this License. 8. Limitation of Liability. In no event and under no legal theory, whether in tort (including negligence), contract, or otherwise, unless required by applicable law (such as deliberate and grossly negligent acts) or agreed to in writing, shall any Contributor be liable to You for damages, including any direct, indirect, special, incidental, or consequential damages of any character arising as a result of this License or out of the use or inability to use the Work (including but not limited to damages for loss of goodwill, work stoppage, computer failure or malfunction, or any and all other commercial damages or losses), even if such Contributor has been advised of the possibility of such damages. 9. Accepting Warranty or Additional Liability. While redistributing the Work or Derivative Works thereof, You may choose to offer, and charge a fee for, acceptance of support, warranty, indemnity, or other liability obligations and/or rights consistent with this License. However, in accepting such obligations, You may act only on Your own behalf and on Your sole responsibility, not on behalf of any other Contributor, and only if You agree to indemnify, defend, and hold each Contributor harmless for any liability incurred by, or claims asserted against, such Contributor by reason of your accepting any such warranty or additional liability. END OF TERMS AND CONDITIONS APPENDIX: How to apply the Apache License to your work. To apply the Apache License to your work, attach the following boilerplate notice, with the fields enclosed by brackets "[]" replaced with your own identifying information. (Don't include the brackets!) The text should be enclosed in the appropriate comment syntax for the file format. We also recommend that a file or class name and description of purpose be included on the same "printed page" as the copyright notice for easier identification within third-party archives. Copyright [yyyy] [name of copyright owner] Licensed under the Apache License, Version 2.0 (the "License"); you may not use this file except in compliance with the License. You may obtain a copy of the License at http://www.apache.org/licenses/LICENSE-2.0 Unless required by applicable law or agreed to in writing, software distributed under the License is distributed on an "AS IS" BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. See the License for the specific language governing permissions and limitations under the License. ---- LLVM Exceptions to the Apache 2.0 License ---- As an exception, if, as a result of your compiling your source code, portions of this Software are embedded into an Object form of such source code, you may redistribute such embedded portions in such Object form without complying with the conditions of Sections 4(a), 4(b) and 4(d) of the License. In addition, if you combine or link compiled forms of this Software with software that is licensed under the GPLv2 ("Combined Software") and if a court of competent jurisdiction determines that the patent provision (Section 3), the indemnity provision (Section 9) or other Section of the License conflicts with the conditions of the GPLv2, you may retroactively and prospectively choose to deem waived or otherwise exclude such Section(s) of the License, but only in their entirety and only with respect to the Combined Software. ============================================================================== Software from third parties included in the LLVM Project: ============================================================================== The LLVM Project contains third party software which is under different license terms. All such code will be identified clearly using at least one of two mechanisms: 1) It will be in a separate directory tree with its own `LICENSE.txt` or `LICENSE` file at the top containing the specific license and restrictions which apply to that software, or 2) It will contain specific license and restriction terms at the top of every file. ============================================================================== Legacy LLVM License (https://llvm.org/docs/DeveloperPolicy.html#legacy): ============================================================================== The compiler_rt library is dual licensed under both the University of Illinois "BSD-Like" license and the MIT license. As a user of this code you may choose to use it under either license. As a contributor, you agree to allow your code to be used under both. Full text of the relevant licenses is included below. ============================================================================== University of Illinois/NCSA Open Source License Copyright (c) 2009-2019 by the contributors listed in CREDITS.TXT All rights reserved. Developed by: LLVM Team University of Illinois at Urbana-Champaign http://llvm.org Permission is hereby granted, free of charge, to any person obtaining a copy of this software and associated documentation files (the "Software"), to deal with 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: * Redistributions of source code must retain the above copyright notice, this list of conditions and the following disclaimers. * Redistributions in binary form must reproduce the above copyright notice, this list of conditions and the following disclaimers in the documentation and/or other materials provided with the distribution. * Neither the names of the LLVM Team, University of Illinois at Urbana-Champaign, nor the names of its contributors may be used to endorse or promote products derived from this Software without specific prior written permission. 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 CONTRIBUTORS 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 WITH THE SOFTWARE. ============================================================================== Copyright (c) 2009-2015 by the contributors listed in CREDITS.TXT 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. ------------------------------------------------------------------------------ crc32c (every build) ------------------------------------------------------------------------------ Copyright 2017, The CRC32C Authors. Redistribution and use in source and binary forms, with or without modification, are permitted provided that the following conditions are met: * Redistributions of source code must retain the above copyright notice, this list of conditions and the following disclaimer. * Redistributions in binary form must reproduce the above copyright notice, this list of conditions and the following disclaimer in the documentation and/or other materials provided with the distribution. * Neither the name of Google Inc. nor the names of its contributors may be used to endorse or promote products derived from this software without specific prior written permission. THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. ------------------------------------------------------------------------------ dav1d (every build) ------------------------------------------------------------------------------ Copyright © 2018, VideoLAN and dav1d authors All rights reserved. Redistribution and use in source and binary forms, with or without modification, are permitted provided that the following conditions are met: 1. Redistributions of source code must retain the above copyright notice, this list of conditions and the following disclaimer. 2. Redistributions in binary form must reproduce the above copyright notice, this list of conditions and the following disclaimer in the documentation and/or other materials provided with the distribution. THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. ------------------------------------------------------------------------------ ffmpeg (every build) ------------------------------------------------------------------------------ GNU GENERAL PUBLIC LICENSE Version 2, June 1991 Copyright (C) 1989, 1991 Free Software Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA Everyone is permitted to copy and distribute verbatim copies of this license document, but changing it is not allowed. Preamble The licenses for most software are designed to take away your freedom to share and change it. By contrast, the GNU General Public License is intended to guarantee your freedom to share and change free software--to make sure the software is free for all its users. This General Public License applies to most of the Free Software Foundation's software and to any other program whose authors commit to using it. (Some other Free Software Foundation software is covered by the GNU Lesser General Public License instead.) You can apply it to your programs, too. When we speak of free software, we are referring to freedom, not price. Our General Public Licenses are designed to make sure that you have the freedom to distribute copies of free software (and charge for this service if you wish), that you receive source code or can get it if you want it, that you can change the software or use pieces of it in new free programs; and that you know you can do these things. To protect your rights, we need to make restrictions that forbid anyone to deny you these rights or to ask you to surrender the rights. These restrictions translate to certain responsibilities for you if you distribute copies of the software, or if you modify it. For example, if you distribute copies of such a program, whether gratis or for a fee, you must give the recipients all the rights that you have. You must make sure that they, too, receive or can get the source code. And you must show them these terms so they know their rights. We protect your rights with two steps: (1) copyright the software, and (2) offer you this license which gives you legal permission to copy, distribute and/or modify the software. Also, for each author's protection and ours, we want to make certain that everyone understands that there is no warranty for this free software. If the software is modified by someone else and passed on, we want its recipients to know that what they have is not the original, so that any problems introduced by others will not reflect on the original authors' reputations. Finally, any free program is threatened constantly by software patents. We wish to avoid the danger that redistributors of a free program will individually obtain patent licenses, in effect making the program proprietary. To prevent this, we have made it clear that any patent must be licensed for everyone's free use or not licensed at all. The precise terms and conditions for copying, distribution and modification follow. GNU GENERAL PUBLIC LICENSE TERMS AND CONDITIONS FOR COPYING, DISTRIBUTION AND MODIFICATION 0. This License applies to any program or other work which contains a notice placed by the copyright holder saying it may be distributed under the terms of this General Public License. The "Program", below, refers to any such program or work, and a "work based on the Program" means either the Program or any derivative work under copyright law: that is to say, a work containing the Program or a portion of it, either verbatim or with modifications and/or translated into another language. (Hereinafter, translation is included without limitation in the term "modification".) Each licensee is addressed as "you". Activities other than copying, distribution and modification are not covered by this License; they are outside its scope. The act of running the Program is not restricted, and the output from the Program is covered only if its contents constitute a work based on the Program (independent of having been made by running the Program). Whether that is true depends on what the Program does. 1. You may copy and distribute verbatim copies of the Program's source code as you receive it, in any medium, provided that you conspicuously and appropriately publish on each copy an appropriate copyright notice and disclaimer of warranty; keep intact all the notices that refer to this License and to the absence of any warranty; and give any other recipients of the Program a copy of this License along with the Program. You may charge a fee for the physical act of transferring a copy, and you may at your option offer warranty protection in exchange for a fee. 2. You may modify your copy or copies of the Program or any portion of it, thus forming a work based on the Program, and copy and distribute such modifications or work under the terms of Section 1 above, provided that you also meet all of these conditions: a) You must cause the modified files to carry prominent notices stating that you changed the files and the date of any change. b) You must cause any work that you distribute or publish, that in whole or in part contains or is derived from the Program or any part thereof, to be licensed as a whole at no charge to all third parties under the terms of this License. c) If the modified program normally reads commands interactively when run, you must cause it, when started running for such interactive use in the most ordinary way, to print or display an announcement including an appropriate copyright notice and a notice that there is no warranty (or else, saying that you provide a warranty) and that users may redistribute the program under these conditions, and telling the user how to view a copy of this License. (Exception: if the Program itself is interactive but does not normally print such an announcement, your work based on the Program is not required to print an announcement.) These requirements apply to the modified work as a whole. If identifiable sections of that work are not derived from the Program, and can be reasonably considered independent and separate works in themselves, then this License, and its terms, do not apply to those sections when you distribute them as separate works. But when you distribute the same sections as part of a whole which is a work based on the Program, the distribution of the whole must be on the terms of this License, whose permissions for other licensees extend to the entire whole, and thus to each and every part regardless of who wrote it. Thus, it is not the intent of this section to claim rights or contest your rights to work written entirely by you; rather, the intent is to exercise the right to control the distribution of derivative or collective works based on the Program. In addition, mere aggregation of another work not based on the Program with the Program (or with a work based on the Program) on a volume of a storage or distribution medium does not bring the other work under the scope of this License. 3. You may copy and distribute the Program (or a work based on it, under Section 2) in object code or executable form under the terms of Sections 1 and 2 above provided that you also do one of the following: a) Accompany it with the complete corresponding machine-readable source code, which must be distributed under the terms of Sections 1 and 2 above on a medium customarily used for software interchange; or, b) Accompany it with a written offer, valid for at least three years, to give any third party, for a charge no more than your cost of physically performing source distribution, a complete machine-readable copy of the corresponding source code, to be distributed under the terms of Sections 1 and 2 above on a medium customarily used for software interchange; or, c) Accompany it with the information you received as to the offer to distribute corresponding source code. (This alternative is allowed only for noncommercial distribution and only if you received the program in object code or executable form with such an offer, in accord with Subsection b above.) The source code for a work means the preferred form of the work for making modifications to it. For an executable work, complete source code means all the source code for all modules it contains, plus any associated interface definition files, plus the scripts used to control compilation and installation of the executable. However, as a special exception, the source code distributed need not include anything that is normally distributed (in either source or binary form) with the major components (compiler, kernel, and so on) of the operating system on which the executable runs, unless that component itself accompanies the executable. If distribution of executable or object code is made by offering access to copy from a designated place, then offering equivalent access to copy the source code from the same place counts as distribution of the source code, even though third parties are not compelled to copy the source along with the object code. 4. You may not copy, modify, sublicense, or distribute the Program except as expressly provided under this License. Any attempt otherwise to copy, modify, sublicense or distribute the Program is void, and will automatically terminate your rights under this License. However, parties who have received copies, or rights, from you under this License will not have their licenses terminated so long as such parties remain in full compliance. 5. You are not required to accept this License, since you have not signed it. However, nothing else grants you permission to modify or distribute the Program or its derivative works. These actions are prohibited by law if you do not accept this License. Therefore, by modifying or distributing the Program (or any work based on the Program), you indicate your acceptance of this License to do so, and all its terms and conditions for copying, distributing or modifying the Program or works based on it. 6. Each time you redistribute the Program (or any work based on the Program), the recipient automatically receives a license from the original licensor to copy, distribute or modify the Program subject to these terms and conditions. You may not impose any further restrictions on the recipients' exercise of the rights granted herein. You are not responsible for enforcing compliance by third parties to this License. 7. If, as a consequence of a court judgment or allegation of patent infringement or for any other reason (not limited to patent issues), conditions are imposed on you (whether by court order, agreement or otherwise) that contradict the conditions of this License, they do not excuse you from the conditions of this License. If you cannot distribute so as to satisfy simultaneously your obligations under this License and any other pertinent obligations, then as a consequence you may not distribute the Program at all. For example, if a patent license would not permit royalty-free redistribution of the Program by all those who receive copies directly or indirectly through you, then the only way you could satisfy both it and this License would be to refrain entirely from distribution of the Program. If any portion of this section is held invalid or unenforceable under any particular circumstance, the balance of the section is intended to apply and the section as a whole is intended to apply in other circumstances. It is not the purpose of this section to induce you to infringe any patents or other property right claims or to contest validity of any such claims; this section has the sole purpose of protecting the integrity of the free software distribution system, which is implemented by public license practices. Many people have made generous contributions to the wide range of software distributed through that system in reliance on consistent application of that system; it is up to the author/donor to decide if he or she is willing to distribute software through any other system and a licensee cannot impose that choice. This section is intended to make thoroughly clear what is believed to be a consequence of the rest of this License. 8. If the distribution and/or use of the Program is restricted in certain countries either by patents or by copyrighted interfaces, the original copyright holder who places the Program under this License may add an explicit geographical distribution limitation excluding those countries, so that distribution is permitted only in or among countries not thus excluded. In such case, this License incorporates the limitation as if written in the body of this License. 9. The Free Software Foundation may publish revised and/or new versions of the General Public License from time to time. Such new versions will be similar in spirit to the present version, but may differ in detail to address new problems or concerns. Each version is given a distinguishing version number. If the Program specifies a version number of this License which applies to it and "any later version", you have the option of following the terms and conditions either of that version or of any later version published by the Free Software Foundation. If the Program does not specify a version number of this License, you may choose any version ever published by the Free Software Foundation. 10. If you wish to incorporate parts of the Program into other free programs whose distribution conditions are different, write to the author to ask for permission. For software which is copyrighted by the Free Software Foundation, write to the Free Software Foundation; we sometimes make exceptions for this. Our decision will be guided by the two goals of preserving the free status of all derivatives of our free software and of promoting the sharing and reuse of software generally. NO WARRANTY 11. BECAUSE THE PROGRAM IS LICENSED FREE OF CHARGE, THERE IS NO WARRANTY FOR THE PROGRAM, TO THE EXTENT PERMITTED BY APPLICABLE LAW. EXCEPT WHEN OTHERWISE STATED IN WRITING THE COPYRIGHT HOLDERS AND/OR OTHER PARTIES PROVIDE THE PROGRAM "AS IS" WITHOUT WARRANTY OF ANY KIND, EITHER EXPRESSED OR IMPLIED, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE. THE ENTIRE RISK AS TO THE QUALITY AND PERFORMANCE OF THE PROGRAM IS WITH YOU. SHOULD THE PROGRAM PROVE DEFECTIVE, YOU ASSUME THE COST OF ALL NECESSARY SERVICING, REPAIR OR CORRECTION. 12. IN NO EVENT UNLESS REQUIRED BY APPLICABLE LAW OR AGREED TO IN WRITING WILL ANY COPYRIGHT HOLDER, OR ANY OTHER PARTY WHO MAY MODIFY AND/OR REDISTRIBUTE THE PROGRAM AS PERMITTED ABOVE, BE LIABLE TO YOU FOR DAMAGES, INCLUDING ANY GENERAL, SPECIAL, INCIDENTAL OR CONSEQUENTIAL DAMAGES ARISING OUT OF THE USE OR INABILITY TO USE THE PROGRAM (INCLUDING BUT NOT LIMITED TO LOSS OF DATA OR DATA BEING RENDERED INACCURATE OR LOSSES SUSTAINED BY YOU OR THIRD PARTIES OR A FAILURE OF THE PROGRAM TO OPERATE WITH ANY OTHER PROGRAMS), EVEN IF SUCH HOLDER OR OTHER PARTY HAS BEEN ADVISED OF THE POSSIBILITY OF SUCH DAMAGES. END OF TERMS AND CONDITIONS How to Apply These Terms to Your New Programs If you develop a new program, and you want it to be of the greatest possible use to the public, the best way to achieve this is to make it free software which everyone can redistribute and change under these terms. To do so, attach the following notices to the program. It is safest to attach them to the start of each source file to most effectively convey the exclusion of warranty; and each file should have at least the "copyright" line and a pointer to where the full notice is found. Copyright (C) This program is free software; you can redistribute it and/or modify it under the terms of the GNU General Public License as published by the Free Software Foundation; either version 2 of the License, or (at your option) any later version. This program is distributed in the hope that it will be useful, but WITHOUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License for more details. You should have received a copy of the GNU General Public License along with this program; if not, write to the Free Software Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA. Also add information on how to contact you by electronic and paper mail. If the program is interactive, make it output a short notice like this when it starts in an interactive mode: Gnomovision version 69, Copyright (C) year name of author Gnomovision comes with ABSOLUTELY NO WARRANTY; for details type `show w'. This is free software, and you are welcome to redistribute it under certain conditions; type `show c' for details. The hypothetical commands `show w' and `show c' should show the appropriate parts of the General Public License. Of course, the commands you use may be called something other than `show w' and `show c'; they could even be mouse-clicks or menu items--whatever suits your program. You should also get your employer (if you work as a programmer) or your school, if any, to sign a "copyright disclaimer" for the program, if necessary. Here is a sample; alter the names: Yoyodyne, Inc., hereby disclaims all copyright interest in the program `Gnomovision' (which makes passes at compilers) written by James Hacker. , 1 April 1989 Ty Coon, President of Vice This General Public License does not permit incorporating your program into proprietary programs. If your program is a subroutine library, you may consider it more useful to permit linking proprietary applications with the library. If this is what you want to do, use the GNU Lesser General Public License instead of this License. GNU GENERAL PUBLIC LICENSE Version 3, 29 June 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 General Public License is a free, copyleft license for software and other kinds of works. The licenses for most software and other practical works are designed to take away your freedom to share and change the works. By contrast, the GNU General Public License is 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. We, the Free Software Foundation, use the GNU General Public License for most of our software; it applies also to any other work released this way by its authors. You can apply it to your programs, too. When we speak of free software, we are referring to freedom, not price. Our General Public Licenses are designed to make sure that you have the freedom to distribute copies of free software (and charge for 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. To protect your rights, we need to prevent others from denying you these rights or asking you to surrender the rights. Therefore, you have certain responsibilities if you distribute copies of the software, or if you modify it: responsibilities to respect the freedom of others. For example, if you distribute copies of such a program, whether gratis or for a fee, you must pass on to the recipients the same freedoms that you received. You must make sure that they, too, receive or can get the source code. And you must show them these terms so they know their rights. Developers that use the GNU GPL protect your rights with two steps: (1) assert copyright on the software, and (2) offer you this License giving you legal permission to copy, distribute and/or modify it. For the developers' and authors' protection, the GPL clearly explains that there is no warranty for this free software. For both users' and authors' sake, the GPL requires that modified versions be marked as changed, so that their problems will not be attributed erroneously to authors of previous versions. Some devices are designed to deny users access to install or run modified versions of the software inside them, although the manufacturer can do so. This is fundamentally incompatible with the aim of protecting users' freedom to change the software. The systematic pattern of such abuse occurs in the area of products for individuals to use, which is precisely where it is most unacceptable. Therefore, we have designed this version of the GPL to prohibit the practice for those products. If such problems arise substantially in other domains, we stand ready to extend this provision to those domains in future versions of the GPL, as needed to protect the freedom of users. Finally, every program is threatened constantly by software patents. States should not allow patents to restrict development and use of software on general-purpose computers, but in those that do, we wish to avoid the special danger that patents applied to a free program could make it effectively proprietary. To prevent this, the GPL assures that patents cannot be used to render the program non-free. 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 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. Use with the GNU Affero General Public License. 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 Affero 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 special requirements of the GNU Affero General Public License, section 13, concerning interaction through a network will apply to the combination as such. 14. Revised Versions of this License. The Free Software Foundation may publish revised and/or new versions of the GNU 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 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 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 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 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 General Public License for more details. You should have received a copy of the GNU General Public License along with this program. If not, see . Also add information on how to contact you by electronic and paper mail. If the program does terminal interaction, make it output a short notice like this when it starts in an interactive mode: Copyright (C) This program comes with ABSOLUTELY NO WARRANTY; for details type `show w'. This is free software, and you are welcome to redistribute it under certain conditions; type `show c' for details. The hypothetical commands `show w' and `show c' should show the appropriate parts of the General Public License. Of course, your program's commands might be different; for a GUI interface, you would use an "about box". 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 GPL, see . The GNU General Public License does not permit incorporating your program into proprietary programs. If your program is a subroutine library, you may consider it more useful to permit linking proprietary applications with the library. If this is what you want to do, use the GNU Lesser General Public License instead of this License. But first, please read . GNU LESSER GENERAL PUBLIC LICENSE Version 2.1, February 1999 Copyright (C) 1991, 1999 Free Software Foundation, Inc. 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA Everyone is permitted to copy and distribute verbatim copies of this license document, but changing it is not allowed. [This is the first released version of the Lesser GPL. It also counts as the successor of the GNU Library Public License, version 2, hence the version number 2.1.] Preamble The licenses for most software are designed to take away your freedom to share and change it. By contrast, the GNU General Public Licenses are intended to guarantee your freedom to share and change free software--to make sure the software is free for all its users. This license, the Lesser General Public License, applies to some specially designated software packages--typically libraries--of the Free Software Foundation and other authors who decide to use it. You can use it too, but we suggest you first think carefully about whether this license or the ordinary General Public License is the better strategy to use in any particular case, based on the explanations below. When we speak of free software, we are referring to freedom of use, not price. Our General Public Licenses are designed to make sure that you have the freedom to distribute copies of free software (and charge for this service if you wish); that you receive source code or can get it if you want it; that you can change the software and use pieces of it in new free programs; and that you are informed that you can do these things. To protect your rights, we need to make restrictions that forbid distributors to deny you these rights or to ask you to surrender these rights. These restrictions translate to certain responsibilities for you if you distribute copies of the library or if you modify it. For example, if you distribute copies of the library, whether gratis or for a fee, you must give the recipients all the rights that we gave you. You must make sure that they, too, receive or can get the source code. If you link other code with the library, you must provide complete object files to the recipients, so that they can relink them with the library after making changes to the library and recompiling it. And you must show them these terms so they know their rights. We protect your rights with a two-step method: (1) we copyright the library, and (2) we offer you this license, which gives you legal permission to copy, distribute and/or modify the library. To protect each distributor, we want to make it very clear that there is no warranty for the free library. Also, if the library is modified by someone else and passed on, the recipients should know that what they have is not the original version, so that the original author's reputation will not be affected by problems that might be introduced by others. Finally, software patents pose a constant threat to the existence of any free program. We wish to make sure that a company cannot effectively restrict the users of a free program by obtaining a restrictive license from a patent holder. Therefore, we insist that any patent license obtained for a version of the library must be consistent with the full freedom of use specified in this license. Most GNU software, including some libraries, is covered by the ordinary GNU General Public License. This license, the GNU Lesser General Public License, applies to certain designated libraries, and is quite different from the ordinary General Public License. We use this license for certain libraries in order to permit linking those libraries into non-free programs. When a program is linked with a library, whether statically or using a shared library, the combination of the two is legally speaking a combined work, a derivative of the original library. The ordinary General Public License therefore permits such linking only if the entire combination fits its criteria of freedom. The Lesser General Public License permits more lax criteria for linking other code with the library. We call this license the "Lesser" General Public License because it does Less to protect the user's freedom than the ordinary General Public License. It also provides other free software developers Less of an advantage over competing non-free programs. These disadvantages are the reason we use the ordinary General Public License for many libraries. However, the Lesser license provides advantages in certain special circumstances. For example, on rare occasions, there may be a special need to encourage the widest possible use of a certain library, so that it becomes a de-facto standard. To achieve this, non-free programs must be allowed to use the library. A more frequent case is that a free library does the same job as widely used non-free libraries. In this case, there is little to gain by limiting the free library to free software only, so we use the Lesser General Public License. In other cases, permission to use a particular library in non-free programs enables a greater number of people to use a large body of free software. For example, permission to use the GNU C Library in non-free programs enables many more people to use the whole GNU operating system, as well as its variant, the GNU/Linux operating system. Although the Lesser General Public License is Less protective of the users' freedom, it does ensure that the user of a program that is linked with the Library has the freedom and the wherewithal to run that program using a modified version of the Library. The precise terms and conditions for copying, distribution and modification follow. Pay close attention to the difference between a "work based on the library" and a "work that uses the library". The former contains code derived from the library, whereas the latter must be combined with the library in order to run. GNU LESSER GENERAL PUBLIC LICENSE TERMS AND CONDITIONS FOR COPYING, DISTRIBUTION AND MODIFICATION 0. This License Agreement applies to any software library or other program which contains a notice placed by the copyright holder or other authorized party saying it may be distributed under the terms of this Lesser General Public License (also called "this License"). Each licensee is addressed as "you". A "library" means a collection of software functions and/or data prepared so as to be conveniently linked with application programs (which use some of those functions and data) to form executables. The "Library", below, refers to any such software library or work which has been distributed under these terms. A "work based on the Library" means either the Library or any derivative work under copyright law: that is to say, a work containing the Library or a portion of it, either verbatim or with modifications and/or translated straightforwardly into another language. (Hereinafter, translation is included without limitation in the term "modification".) "Source code" for a work means the preferred form of the work for making modifications to it. For a library, complete source code means all the source code for all modules it contains, plus any associated interface definition files, plus the scripts used to control compilation and installation of the library. Activities other than copying, distribution and modification are not covered by this License; they are outside its scope. The act of running a program using the Library is not restricted, and output from such a program is covered only if its contents constitute a work based on the Library (independent of the use of the Library in a tool for writing it). Whether that is true depends on what the Library does and what the program that uses the Library does. 1. You may copy and distribute verbatim copies of the Library's complete source code as you receive it, in any medium, provided that you conspicuously and appropriately publish on each copy an appropriate copyright notice and disclaimer of warranty; keep intact all the notices that refer to this License and to the absence of any warranty; and distribute a copy of this License along with the Library. You may charge a fee for the physical act of transferring a copy, and you may at your option offer warranty protection in exchange for a fee. 2. You may modify your copy or copies of the Library or any portion of it, thus forming a work based on the Library, and copy and distribute such modifications or work under the terms of Section 1 above, provided that you also meet all of these conditions: a) The modified work must itself be a software library. b) You must cause the files modified to carry prominent notices stating that you changed the files and the date of any change. c) You must cause the whole of the work to be licensed at no charge to all third parties under the terms of this License. d) If a facility in the modified Library refers to a function or a table of data to be supplied by an application program that uses the facility, other than as an argument passed when the facility is invoked, then you must make a good faith effort to ensure that, in the event an application does not supply such function or table, the facility still operates, and performs whatever part of its purpose remains meaningful. (For example, a function in a library to compute square roots has a purpose that is entirely well-defined independent of the application. Therefore, Subsection 2d requires that any application-supplied function or table used by this function must be optional: if the application does not supply it, the square root function must still compute square roots.) These requirements apply to the modified work as a whole. If identifiable sections of that work are not derived from the Library, and can be reasonably considered independent and separate works in themselves, then this License, and its terms, do not apply to those sections when you distribute them as separate works. But when you distribute the same sections as part of a whole which is a work based on the Library, the distribution of the whole must be on the terms of this License, whose permissions for other licensees extend to the entire whole, and thus to each and every part regardless of who wrote it. Thus, it is not the intent of this section to claim rights or contest your rights to work written entirely by you; rather, the intent is to exercise the right to control the distribution of derivative or collective works based on the Library. In addition, mere aggregation of another work not based on the Library with the Library (or with a work based on the Library) on a volume of a storage or distribution medium does not bring the other work under the scope of this License. 3. You may opt to apply the terms of the ordinary GNU General Public License instead of this License to a given copy of the Library. To do this, you must alter all the notices that refer to this License, so that they refer to the ordinary GNU General Public License, version 2, instead of to this License. (If a newer version than version 2 of the ordinary GNU General Public License has appeared, then you can specify that version instead if you wish.) Do not make any other change in these notices. Once this change is made in a given copy, it is irreversible for that copy, so the ordinary GNU General Public License applies to all subsequent copies and derivative works made from that copy. This option is useful when you wish to copy part of the code of the Library into a program that is not a library. 4. You may copy and distribute the Library (or a portion or derivative of it, under Section 2) in object code or executable form under the terms of Sections 1 and 2 above provided that you accompany it with the complete corresponding machine-readable source code, which must be distributed under the terms of Sections 1 and 2 above on a medium customarily used for software interchange. If distribution of object code is made by offering access to copy from a designated place, then offering equivalent access to copy the source code from the same place satisfies the requirement to distribute the source code, even though third parties are not compelled to copy the source along with the object code. 5. A program that contains no derivative of any portion of the Library, but is designed to work with the Library by being compiled or linked with it, is called a "work that uses the Library". Such a work, in isolation, is not a derivative work of the Library, and therefore falls outside the scope of this License. However, linking a "work that uses the Library" with the Library creates an executable that is a derivative of the Library (because it contains portions of the Library), rather than a "work that uses the library". The executable is therefore covered by this License. Section 6 states terms for distribution of such executables. When a "work that uses the Library" uses material from a header file that is part of the Library, the object code for the work may be a derivative work of the Library even though the source code is not. Whether this is true is especially significant if the work can be linked without the Library, or if the work is itself a library. The threshold for this to be true is not precisely defined by law. If such an object file uses only numerical parameters, data structure layouts and accessors, and small macros and small inline functions (ten lines or less in length), then the use of the object file is unrestricted, regardless of whether it is legally a derivative work. (Executables containing this object code plus portions of the Library will still fall under Section 6.) Otherwise, if the work is a derivative of the Library, you may distribute the object code for the work under the terms of Section 6. Any executables containing that work also fall under Section 6, whether or not they are linked directly with the Library itself. 6. As an exception to the Sections above, you may also combine or link a "work that uses the Library" with the Library to produce a work containing portions of the Library, and distribute that work under terms of your choice, provided that the terms permit modification of the work for the customer's own use and reverse engineering for debugging such modifications. You must give prominent notice with each copy of the work that the Library is used in it and that the Library and its use are covered by this License. You must supply a copy of this License. If the work during execution displays copyright notices, you must include the copyright notice for the Library among them, as well as a reference directing the user to the copy of this License. Also, you must do one of these things: a) Accompany the work with the complete corresponding machine-readable source code for the Library including whatever changes were used in the work (which must be distributed under Sections 1 and 2 above); and, if the work is an executable linked with the Library, with the complete machine-readable "work that uses the Library", as object code and/or source code, so that the user can modify the Library and then relink to produce a modified executable containing the modified Library. (It is understood that the user who changes the contents of definitions files in the Library will not necessarily be able to recompile the application to use the modified definitions.) b) Use a suitable shared library mechanism for linking with the Library. A suitable mechanism is one that (1) uses at run time a copy of the library already present on the user's computer system, rather than copying library functions into the executable, and (2) will operate properly with a modified version of the library, if the user installs one, as long as the modified version is interface-compatible with the version that the work was made with. c) Accompany the work with a written offer, valid for at least three years, to give the same user the materials specified in Subsection 6a, above, for a charge no more than the cost of performing this distribution. d) If distribution of the work is made by offering access to copy from a designated place, offer equivalent access to copy the above specified materials from the same place. e) Verify that the user has already received a copy of these materials or that you have already sent this user a copy. For an executable, the required form of the "work that uses the Library" must include any data and utility programs needed for reproducing the executable from it. However, as a special exception, the materials to be distributed need not include anything that is normally distributed (in either source or binary form) with the major components (compiler, kernel, and so on) of the operating system on which the executable runs, unless that component itself accompanies the executable. It may happen that this requirement contradicts the license restrictions of other proprietary libraries that do not normally accompany the operating system. Such a contradiction means you cannot use both them and the Library together in an executable that you distribute. 7. You may place library facilities that are a work based on the Library side-by-side in a single library together with other library facilities not covered by this License, and distribute such a combined library, provided that the separate distribution of the work based on the Library and of the other library facilities is otherwise permitted, and provided that you do these two things: a) Accompany the combined library with a copy of the same work based on the Library, uncombined with any other library facilities. This must be distributed under the terms of the Sections above. b) Give prominent notice with the combined library of the fact that part of it is a work based on the Library, and explaining where to find the accompanying uncombined form of the same work. 8. You may not copy, modify, sublicense, link with, or distribute the Library except as expressly provided under this License. Any attempt otherwise to copy, modify, sublicense, link with, or distribute the Library is void, and will automatically terminate your rights under this License. However, parties who have received copies, or rights, from you under this License will not have their licenses terminated so long as such parties remain in full compliance. 9. You are not required to accept this License, since you have not signed it. However, nothing else grants you permission to modify or distribute the Library or its derivative works. These actions are prohibited by law if you do not accept this License. Therefore, by modifying or distributing the Library (or any work based on the Library), you indicate your acceptance of this License to do so, and all its terms and conditions for copying, distributing or modifying the Library or works based on it. 10. Each time you redistribute the Library (or any work based on the Library), the recipient automatically receives a license from the original licensor to copy, distribute, link with or modify the Library subject to these terms and conditions. You may not impose any further restrictions on the recipients' exercise of the rights granted herein. You are not responsible for enforcing compliance by third parties with this License. 11. If, as a consequence of a court judgment or allegation of patent infringement or for any other reason (not limited to patent issues), conditions are imposed on you (whether by court order, agreement or otherwise) that contradict the conditions of this License, they do not excuse you from the conditions of this License. If you cannot distribute so as to satisfy simultaneously your obligations under this License and any other pertinent obligations, then as a consequence you may not distribute the Library at all. For example, if a patent license would not permit royalty-free redistribution of the Library by all those who receive copies directly or indirectly through you, then the only way you could satisfy both it and this License would be to refrain entirely from distribution of the Library. If any portion of this section is held invalid or unenforceable under any particular circumstance, the balance of the section is intended to apply, and the section as a whole is intended to apply in other circumstances. It is not the purpose of this section to induce you to infringe any patents or other property right claims or to contest validity of any such claims; this section has the sole purpose of protecting the integrity of the free software distribution system which is implemented by public license practices. Many people have made generous contributions to the wide range of software distributed through that system in reliance on consistent application of that system; it is up to the author/donor to decide if he or she is willing to distribute software through any other system and a licensee cannot impose that choice. This section is intended to make thoroughly clear what is believed to be a consequence of the rest of this License. 12. If the distribution and/or use of the Library is restricted in certain countries either by patents or by copyrighted interfaces, the original copyright holder who places the Library under this License may add an explicit geographical distribution limitation excluding those countries, so that distribution is permitted only in or among countries not thus excluded. In such case, this License incorporates the limitation as if written in the body of this License. 13. The Free Software Foundation may publish revised and/or new versions of the Lesser General Public License from time to time. Such new versions will be similar in spirit to the present version, but may differ in detail to address new problems or concerns. Each version is given a distinguishing version number. If the Library specifies a version number of this License which applies to it and "any later version", you have the option of following the terms and conditions either of that version or of any later version published by the Free Software Foundation. If the Library does not specify a license version number, you may choose any version ever published by the Free Software Foundation. 14. If you wish to incorporate parts of the Library into other free programs whose distribution conditions are incompatible with these, write to the author to ask for permission. For software which is copyrighted by the Free Software Foundation, write to the Free Software Foundation; we sometimes make exceptions for this. Our decision will be guided by the two goals of preserving the free status of all derivatives of our free software and of promoting the sharing and reuse of software generally. NO WARRANTY 15. BECAUSE THE LIBRARY IS LICENSED FREE OF CHARGE, THERE IS NO WARRANTY FOR THE LIBRARY, TO THE EXTENT PERMITTED BY APPLICABLE LAW. EXCEPT WHEN OTHERWISE STATED IN WRITING THE COPYRIGHT HOLDERS AND/OR OTHER PARTIES PROVIDE THE LIBRARY "AS IS" WITHOUT WARRANTY OF ANY KIND, EITHER EXPRESSED OR IMPLIED, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE. THE ENTIRE RISK AS TO THE QUALITY AND PERFORMANCE OF THE LIBRARY IS WITH YOU. SHOULD THE LIBRARY PROVE DEFECTIVE, YOU ASSUME THE COST OF ALL NECESSARY SERVICING, REPAIR OR CORRECTION. 16. IN NO EVENT UNLESS REQUIRED BY APPLICABLE LAW OR AGREED TO IN WRITING WILL ANY COPYRIGHT HOLDER, OR ANY OTHER PARTY WHO MAY MODIFY AND/OR REDISTRIBUTE THE LIBRARY AS PERMITTED ABOVE, BE LIABLE TO YOU FOR DAMAGES, INCLUDING ANY GENERAL, SPECIAL, INCIDENTAL OR CONSEQUENTIAL DAMAGES ARISING OUT OF THE USE OR INABILITY TO USE THE LIBRARY (INCLUDING BUT NOT LIMITED TO LOSS OF DATA OR DATA BEING RENDERED INACCURATE OR LOSSES SUSTAINED BY YOU OR THIRD PARTIES OR A FAILURE OF THE LIBRARY TO OPERATE WITH ANY OTHER SOFTWARE), EVEN IF SUCH HOLDER OR OTHER PARTY HAS BEEN ADVISED OF THE POSSIBILITY OF SUCH DAMAGES. END OF TERMS AND CONDITIONS How to Apply These Terms to Your New Libraries If you develop a new library, and you want it to be of the greatest possible use to the public, we recommend making it free software that everyone can redistribute and change. You can do so by permitting redistribution under these terms (or, alternatively, under the terms of the ordinary General Public License). To apply these terms, attach the following notices to the library. It is safest to attach them to the start of each source file to most effectively convey the exclusion of warranty; and each file should have at least the "copyright" line and a pointer to where the full notice is found. Copyright (C) This library is free software; you can redistribute it and/or modify it under the terms of the GNU Lesser General Public License as published by the Free Software Foundation; either version 2.1 of the License, or (at your option) any later version. This library is distributed in the hope that it will be useful, but WITHOUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU Lesser General Public License for more details. You should have received a copy of the GNU Lesser General Public License along with this library; if not, write to the Free Software Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA Also add information on how to contact you by electronic and paper mail. You should also get your employer (if you work as a programmer) or your school, if any, to sign a "copyright disclaimer" for the library, if necessary. Here is a sample; alter the names: Yoyodyne, Inc., hereby disclaims all copyright interest in the library `Frob' (a library for tweaking knobs) written by James Random Hacker. , 1 April 1990 Ty Coon, President of Vice That's all there is to it! GNU LESSER GENERAL PUBLIC LICENSE Version 3, 29 June 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. This version of the GNU Lesser General Public License incorporates the terms and conditions of version 3 of the GNU General Public License, supplemented by the additional permissions listed below. 0. Additional Definitions. As used herein, "this License" refers to version 3 of the GNU Lesser General Public License, and the "GNU GPL" refers to version 3 of the GNU General Public License. "The Library" refers to a covered work governed by this License, other than an Application or a Combined Work as defined below. An "Application" is any work that makes use of an interface provided by the Library, but which is not otherwise based on the Library. Defining a subclass of a class defined by the Library is deemed a mode of using an interface provided by the Library. A "Combined Work" is a work produced by combining or linking an Application with the Library. The particular version of the Library with which the Combined Work was made is also called the "Linked Version". The "Minimal Corresponding Source" for a Combined Work means the Corresponding Source for the Combined Work, excluding any source code for portions of the Combined Work that, considered in isolation, are based on the Application, and not on the Linked Version. The "Corresponding Application Code" for a Combined Work means the object code and/or source code for the Application, including any data and utility programs needed for reproducing the Combined Work from the Application, but excluding the System Libraries of the Combined Work. 1. Exception to Section 3 of the GNU GPL. You may convey a covered work under sections 3 and 4 of this License without being bound by section 3 of the GNU GPL. 2. Conveying Modified Versions. If you modify a copy of the Library, and, in your modifications, a facility refers to a function or data to be supplied by an Application that uses the facility (other than as an argument passed when the facility is invoked), then you may convey a copy of the modified version: a) under this License, provided that you make a good faith effort to ensure that, in the event an Application does not supply the function or data, the facility still operates, and performs whatever part of its purpose remains meaningful, or b) under the GNU GPL, with none of the additional permissions of this License applicable to that copy. 3. Object Code Incorporating Material from Library Header Files. The object code form of an Application may incorporate material from a header file that is part of the Library. You may convey such object code under terms of your choice, provided that, if the incorporated material is not limited to numerical parameters, data structure layouts and accessors, or small macros, inline functions and templates (ten or fewer lines in length), you do both of the following: a) Give prominent notice with each copy of the object code that the Library is used in it and that the Library and its use are covered by this License. b) Accompany the object code with a copy of the GNU GPL and this license document. 4. Combined Works. You may convey a Combined Work under terms of your choice that, taken together, effectively do not restrict modification of the portions of the Library contained in the Combined Work and reverse engineering for debugging such modifications, if you also do each of the following: a) Give prominent notice with each copy of the Combined Work that the Library is used in it and that the Library and its use are covered by this License. b) Accompany the Combined Work with a copy of the GNU GPL and this license document. c) For a Combined Work that displays copyright notices during execution, include the copyright notice for the Library among these notices, as well as a reference directing the user to the copies of the GNU GPL and this license document. d) Do one of the following: 0) Convey the Minimal Corresponding Source under the terms of this License, and the Corresponding Application Code in a form suitable for, and under terms that permit, the user to recombine or relink the Application with a modified version of the Linked Version to produce a modified Combined Work, in the manner specified by section 6 of the GNU GPL for conveying Corresponding Source. 1) Use a suitable shared library mechanism for linking with the Library. A suitable mechanism is one that (a) uses at run time a copy of the Library already present on the user's computer system, and (b) will operate properly with a modified version of the Library that is interface-compatible with the Linked Version. e) Provide Installation Information, but only if you would otherwise be required to provide such information under section 6 of the GNU GPL, and only to the extent that such information is necessary to install and execute a modified version of the Combined Work produced by recombining or relinking the Application with a modified version of the Linked Version. (If you use option 4d0, the Installation Information must accompany the Minimal Corresponding Source and Corresponding Application Code. If you use option 4d1, you must provide the Installation Information in the manner specified by section 6 of the GNU GPL for conveying Corresponding Source.) 5. Combined Libraries. You may place library facilities that are a work based on the Library side by side in a single library together with other library facilities that are not Applications and are not covered by this License, and convey such a combined library under terms of your choice, if you do both of the following: a) Accompany the combined library with a copy of the same work based on the Library, uncombined with any other library facilities, conveyed under the terms of this License. b) Give prominent notice with the combined library that part of it is a work based on the Library, and explaining where to find the accompanying uncombined form of the same work. 6. Revised Versions of the GNU Lesser General Public License. The Free Software Foundation may publish revised and/or new versions of the GNU Lesser General Public License from time to time. Such new versions will be similar in spirit to the present version, but may differ in detail to address new problems or concerns. Each version is given a distinguishing version number. If the Library as you received it specifies that a certain numbered version of the GNU Lesser General Public License "or any later version" applies to it, you have the option of following the terms and conditions either of that published version or of any later version published by the Free Software Foundation. If the Library as you received it does not specify a version number of the GNU Lesser General Public License, you may choose any version of the GNU Lesser General Public License ever published by the Free Software Foundation. If the Library as you received it specifies that a proxy can decide whether future versions of the GNU Lesser General Public License shall apply, that proxy's public statement of acceptance of any version is permanent authorization for you to choose that version for the Library. ------------------------------------------------------------------------------ fft (every build) ------------------------------------------------------------------------------ /* * Copyright(c)1995,97 Mark Olesen * Queen's Univ at Kingston (Canada) * * Permission to use, copy, modify, and distribute this software for * any purpose without fee is hereby granted, provided that this * entire notice is included in all copies of any software which is * or includes a copy or modification of this software and in all * copies of the supporting documentation for such software. * * THIS SOFTWARE IS BEING PROVIDED "AS IS", WITHOUT ANY EXPRESS OR * IMPLIED WARRANTY. IN PARTICULAR, NEITHER THE AUTHOR NOR QUEEN'S * UNIVERSITY AT KINGSTON MAKES ANY REPRESENTATION OR WARRANTY OF ANY * KIND CONCERNING THE MERCHANTABILITY OF THIS SOFTWARE OR ITS * FITNESS FOR ANY PARTICULAR PURPOSE. * * All of which is to say that you can do what you like with this * source code provided you don't try to sell it as your own and you * include an unaltered copy of this message (including the * copyright). * * It is also implicitly understood that bug fixes and improvements * should make their way back to the general Internet community so * that everyone benefits. */ ------------------------------------------------------------------------------ fiat (every build) ------------------------------------------------------------------------------ The Apache License, Version 2.0 (Apache-2.0) Copyright 2015-2020 the fiat-crypto authors (see the AUTHORS file) Licensed under the Apache License, Version 2.0 (the "License"); you may not use this file except in compliance with the License. You may obtain a copy of the License at http://www.apache.org/licenses/LICENSE-2.0 Unless required by applicable law or agreed to in writing, software distributed under the License is distributed on an "AS IS" BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. See the License for the specific language governing permissions and limitations under the License. ------------------------------------------------------------------------------ g711 (every build) ------------------------------------------------------------------------------ /* * SpanDSP - a series of DSP components for telephony * * g711.h - In line A-law and u-law conversion routines * * Written by Steve Underwood * * Copyright (C) 2001 Steve Underwood * * Despite my general liking of the GPL, I place this code in the * public domain for the benefit of all mankind - even the slimy * ones who might try to proprietize my work and use it to my * detriment. */ ------------------------------------------------------------------------------ g722 (every build) ------------------------------------------------------------------------------ /* * SpanDSP - a series of DSP components for telephony * * g722_decode.c - The ITU G.722 codec, decode part. * * Written by Steve Underwood * * Copyright (C) 2005 Steve Underwood * * Despite my general liking of the GPL, I place my own contributions * to this code in the public domain for the benefit of all mankind - * even the slimy ones who might try to proprietize my work and use it * to my detriment. * * Based in part on a single channel G.722 codec which is: * * Copyright (c) CMU 1993 * Computer Science, Speech Group * Chengxiang Lu and Alex Hauptmann */ ------------------------------------------------------------------------------ libaom (every build) ------------------------------------------------------------------------------ Copyright (c) 2016, Alliance for Open Media. All rights reserved. Redistribution and use in source and binary forms, with or without modification, are permitted provided that the following conditions are met: 1. Redistributions of source code must retain the above copyright notice, this list of conditions and the following disclaimer. 2. Redistributions in binary form must reproduce the above copyright notice, this list of conditions and the following disclaimer in the documentation and/or other materials provided with the distribution. THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. ------------------------------------------------------------------------------ libc++ (every build) ------------------------------------------------------------------------------ ============================================================================== The LLVM Project is under the Apache License v2.0 with LLVM Exceptions: ============================================================================== Apache License Version 2.0, January 2004 http://www.apache.org/licenses/ TERMS AND CONDITIONS FOR USE, REPRODUCTION, AND DISTRIBUTION 1. Definitions. "License" shall mean the terms and conditions for use, reproduction, and distribution as defined by Sections 1 through 9 of this document. "Licensor" shall mean the copyright owner or entity authorized by the copyright owner that is granting the License. "Legal Entity" shall mean the union of the acting entity and all other entities that control, are controlled by, or are under common control with that entity. For the purposes of this definition, "control" means (i) the power, direct or indirect, to cause the direction or management of such entity, whether by contract or otherwise, or (ii) ownership of fifty percent (50%) or more of the outstanding shares, or (iii) beneficial ownership of such entity. "You" (or "Your") shall mean an individual or Legal Entity exercising permissions granted by this License. "Source" form shall mean the preferred form for making modifications, including but not limited to software source code, documentation source, and configuration files. "Object" form shall mean any form resulting from mechanical transformation or translation of a Source form, including but not limited to compiled object code, generated documentation, and conversions to other media types. "Work" shall mean the work of authorship, whether in Source or Object form, made available under the License, as indicated by a copyright notice that is included in or attached to the work (an example is provided in the Appendix below). "Derivative Works" shall mean any work, whether in Source or Object form, that is based on (or derived from) the Work and for which the editorial revisions, annotations, elaborations, or other modifications represent, as a whole, an original work of authorship. For the purposes of this License, Derivative Works shall not include works that remain separable from, or merely link (or bind by name) to the interfaces of, the Work and Derivative Works thereof. "Contribution" shall mean any work of authorship, including the original version of the Work and any modifications or additions to that Work or Derivative Works thereof, that is intentionally submitted to Licensor for inclusion in the Work by the copyright owner or by an individual or Legal Entity authorized to submit on behalf of the copyright owner. For the purposes of this definition, "submitted" means any form of electronic, verbal, or written communication sent to the Licensor or its representatives, including but not limited to communication on electronic mailing lists, source code control systems, and issue tracking systems that are managed by, or on behalf of, the Licensor for the purpose of discussing and improving the Work, but excluding communication that is conspicuously marked or otherwise designated in writing by the copyright owner as "Not a Contribution." "Contributor" shall mean Licensor and any individual or Legal Entity on behalf of whom a Contribution has been received by Licensor and subsequently incorporated within the Work. 2. Grant of Copyright License. Subject to the terms and conditions of this License, each Contributor hereby grants to You a perpetual, worldwide, non-exclusive, no-charge, royalty-free, irrevocable copyright license to reproduce, prepare Derivative Works of, publicly display, publicly perform, sublicense, and distribute the Work and such Derivative Works in Source or Object form. 3. Grant of Patent License. Subject to the terms and conditions of this License, each Contributor hereby grants to You a perpetual, worldwide, non-exclusive, no-charge, royalty-free, irrevocable (except as stated in this section) patent license to make, have made, use, offer to sell, sell, import, and otherwise transfer the Work, where such license applies only to those patent claims licensable by such Contributor that are necessarily infringed by their Contribution(s) alone or by combination of their Contribution(s) with the Work to which such Contribution(s) was submitted. If You institute patent litigation against any entity (including a cross-claim or counterclaim in a lawsuit) alleging that the Work or a Contribution incorporated within the Work constitutes direct or contributory patent infringement, then any patent licenses granted to You under this License for that Work shall terminate as of the date such litigation is filed. 4. Redistribution. You may reproduce and distribute copies of the Work or Derivative Works thereof in any medium, with or without modifications, and in Source or Object form, provided that You meet the following conditions: (a) You must give any other recipients of the Work or Derivative Works a copy of this License; and (b) You must cause any modified files to carry prominent notices stating that You changed the files; and (c) You must retain, in the Source form of any Derivative Works that You distribute, all copyright, patent, trademark, and attribution notices from the Source form of the Work, excluding those notices that do not pertain to any part of the Derivative Works; and (d) If the Work includes a "NOTICE" text file as part of its distribution, then any Derivative Works that You distribute must include a readable copy of the attribution notices contained within such NOTICE file, excluding those notices that do not pertain to any part of the Derivative Works, in at least one of the following places: within a NOTICE text file distributed as part of the Derivative Works; within the Source form or documentation, if provided along with the Derivative Works; or, within a display generated by the Derivative Works, if and wherever such third-party notices normally appear. The contents of the NOTICE file are for informational purposes only and do not modify the License. You may add Your own attribution notices within Derivative Works that You distribute, alongside or as an addendum to the NOTICE text from the Work, provided that such additional attribution notices cannot be construed as modifying the License. You may add Your own copyright statement to Your modifications and may provide additional or different license terms and conditions for use, reproduction, or distribution of Your modifications, or for any such Derivative Works as a whole, provided Your use, reproduction, and distribution of the Work otherwise complies with the conditions stated in this License. 5. Submission of Contributions. Unless You explicitly state otherwise, any Contribution intentionally submitted for inclusion in the Work by You to the Licensor shall be under the terms and conditions of this License, without any additional terms or conditions. Notwithstanding the above, nothing herein shall supersede or modify the terms of any separate license agreement you may have executed with Licensor regarding such Contributions. 6. Trademarks. This License does not grant permission to use the trade names, trademarks, service marks, or product names of the Licensor, except as required for reasonable and customary use in describing the origin of the Work and reproducing the content of the NOTICE file. 7. Disclaimer of Warranty. Unless required by applicable law or agreed to in writing, Licensor provides the Work (and each Contributor provides its Contributions) on an "AS IS" BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied, including, without limitation, any warranties or conditions of TITLE, NON-INFRINGEMENT, MERCHANTABILITY, or FITNESS FOR A PARTICULAR PURPOSE. You are solely responsible for determining the appropriateness of using or redistributing the Work and assume any risks associated with Your exercise of permissions under this License. 8. Limitation of Liability. In no event and under no legal theory, whether in tort (including negligence), contract, or otherwise, unless required by applicable law (such as deliberate and grossly negligent acts) or agreed to in writing, shall any Contributor be liable to You for damages, including any direct, indirect, special, incidental, or consequential damages of any character arising as a result of this License or out of the use or inability to use the Work (including but not limited to damages for loss of goodwill, work stoppage, computer failure or malfunction, or any and all other commercial damages or losses), even if such Contributor has been advised of the possibility of such damages. 9. Accepting Warranty or Additional Liability. While redistributing the Work or Derivative Works thereof, You may choose to offer, and charge a fee for, acceptance of support, warranty, indemnity, or other liability obligations and/or rights consistent with this License. However, in accepting such obligations, You may act only on Your own behalf and on Your sole responsibility, not on behalf of any other Contributor, and only if You agree to indemnify, defend, and hold each Contributor harmless for any liability incurred by, or claims asserted against, such Contributor by reason of your accepting any such warranty or additional liability. END OF TERMS AND CONDITIONS APPENDIX: How to apply the Apache License to your work. To apply the Apache License to your work, attach the following boilerplate notice, with the fields enclosed by brackets "[]" replaced with your own identifying information. (Don't include the brackets!) The text should be enclosed in the appropriate comment syntax for the file format. We also recommend that a file or class name and description of purpose be included on the same "printed page" as the copyright notice for easier identification within third-party archives. Copyright [yyyy] [name of copyright owner] Licensed under the Apache License, Version 2.0 (the "License"); you may not use this file except in compliance with the License. You may obtain a copy of the License at http://www.apache.org/licenses/LICENSE-2.0 Unless required by applicable law or agreed to in writing, software distributed under the License is distributed on an "AS IS" BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. See the License for the specific language governing permissions and limitations under the License. ---- LLVM Exceptions to the Apache 2.0 License ---- As an exception, if, as a result of your compiling your source code, portions of this Software are embedded into an Object form of such source code, you may redistribute such embedded portions in such Object form without complying with the conditions of Sections 4(a), 4(b) and 4(d) of the License. In addition, if you combine or link compiled forms of this Software with software that is licensed under the GPLv2 ("Combined Software") and if a court of competent jurisdiction determines that the patent provision (Section 3), the indemnity provision (Section 9) or other Section of the License conflicts with the conditions of the GPLv2, you may retroactively and prospectively choose to deem waived or otherwise exclude such Section(s) of the License, but only in their entirety and only with respect to the Combined Software. ============================================================================== Software from third parties included in the LLVM Project: ============================================================================== The LLVM Project contains third party software which is under different license terms. All such code will be identified clearly using at least one of two mechanisms: 1) It will be in a separate directory tree with its own `LICENSE.txt` or `LICENSE` file at the top containing the specific license and restrictions which apply to that software, or 2) It will contain specific license and restriction terms at the top of every file. ============================================================================== Legacy LLVM License (https://llvm.org/docs/DeveloperPolicy.html#legacy): ============================================================================== The libc++ library is dual licensed under both the University of Illinois "BSD-Like" license and the MIT license. As a user of this code you may choose to use it under either license. As a contributor, you agree to allow your code to be used under both. Full text of the relevant licenses is included below. ============================================================================== University of Illinois/NCSA Open Source License Copyright (c) 2009-2019 by the contributors listed in CREDITS.TXT All rights reserved. Developed by: LLVM Team University of Illinois at Urbana-Champaign http://llvm.org Permission is hereby granted, free of charge, to any person obtaining a copy of this software and associated documentation files (the "Software"), to deal with 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: * Redistributions of source code must retain the above copyright notice, this list of conditions and the following disclaimers. * Redistributions in binary form must reproduce the above copyright notice, this list of conditions and the following disclaimers in the documentation and/or other materials provided with the distribution. * Neither the names of the LLVM Team, University of Illinois at Urbana-Champaign, nor the names of its contributors may be used to endorse or promote products derived from this Software without specific prior written permission. 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 CONTRIBUTORS 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 WITH THE SOFTWARE. ============================================================================== Copyright (c) 2009-2014 by the contributors listed in CREDITS.TXT 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. ------------------------------------------------------------------------------ libc++abi (mac-x64-release) ------------------------------------------------------------------------------ ============================================================================== The LLVM Project is under the Apache License v2.0 with LLVM Exceptions: ============================================================================== Apache License Version 2.0, January 2004 http://www.apache.org/licenses/ TERMS AND CONDITIONS FOR USE, REPRODUCTION, AND DISTRIBUTION 1. Definitions. "License" shall mean the terms and conditions for use, reproduction, and distribution as defined by Sections 1 through 9 of this document. "Licensor" shall mean the copyright owner or entity authorized by the copyright owner that is granting the License. "Legal Entity" shall mean the union of the acting entity and all other entities that control, are controlled by, or are under common control with that entity. For the purposes of this definition, "control" means (i) the power, direct or indirect, to cause the direction or management of such entity, whether by contract or otherwise, or (ii) ownership of fifty percent (50%) or more of the outstanding shares, or (iii) beneficial ownership of such entity. "You" (or "Your") shall mean an individual or Legal Entity exercising permissions granted by this License. "Source" form shall mean the preferred form for making modifications, including but not limited to software source code, documentation source, and configuration files. "Object" form shall mean any form resulting from mechanical transformation or translation of a Source form, including but not limited to compiled object code, generated documentation, and conversions to other media types. "Work" shall mean the work of authorship, whether in Source or Object form, made available under the License, as indicated by a copyright notice that is included in or attached to the work (an example is provided in the Appendix below). "Derivative Works" shall mean any work, whether in Source or Object form, that is based on (or derived from) the Work and for which the editorial revisions, annotations, elaborations, or other modifications represent, as a whole, an original work of authorship. For the purposes of this License, Derivative Works shall not include works that remain separable from, or merely link (or bind by name) to the interfaces of, the Work and Derivative Works thereof. "Contribution" shall mean any work of authorship, including the original version of the Work and any modifications or additions to that Work or Derivative Works thereof, that is intentionally submitted to Licensor for inclusion in the Work by the copyright owner or by an individual or Legal Entity authorized to submit on behalf of the copyright owner. For the purposes of this definition, "submitted" means any form of electronic, verbal, or written communication sent to the Licensor or its representatives, including but not limited to communication on electronic mailing lists, source code control systems, and issue tracking systems that are managed by, or on behalf of, the Licensor for the purpose of discussing and improving the Work, but excluding communication that is conspicuously marked or otherwise designated in writing by the copyright owner as "Not a Contribution." "Contributor" shall mean Licensor and any individual or Legal Entity on behalf of whom a Contribution has been received by Licensor and subsequently incorporated within the Work. 2. Grant of Copyright License. Subject to the terms and conditions of this License, each Contributor hereby grants to You a perpetual, worldwide, non-exclusive, no-charge, royalty-free, irrevocable copyright license to reproduce, prepare Derivative Works of, publicly display, publicly perform, sublicense, and distribute the Work and such Derivative Works in Source or Object form. 3. Grant of Patent License. Subject to the terms and conditions of this License, each Contributor hereby grants to You a perpetual, worldwide, non-exclusive, no-charge, royalty-free, irrevocable (except as stated in this section) patent license to make, have made, use, offer to sell, sell, import, and otherwise transfer the Work, where such license applies only to those patent claims licensable by such Contributor that are necessarily infringed by their Contribution(s) alone or by combination of their Contribution(s) with the Work to which such Contribution(s) was submitted. If You institute patent litigation against any entity (including a cross-claim or counterclaim in a lawsuit) alleging that the Work or a Contribution incorporated within the Work constitutes direct or contributory patent infringement, then any patent licenses granted to You under this License for that Work shall terminate as of the date such litigation is filed. 4. Redistribution. You may reproduce and distribute copies of the Work or Derivative Works thereof in any medium, with or without modifications, and in Source or Object form, provided that You meet the following conditions: (a) You must give any other recipients of the Work or Derivative Works a copy of this License; and (b) You must cause any modified files to carry prominent notices stating that You changed the files; and (c) You must retain, in the Source form of any Derivative Works that You distribute, all copyright, patent, trademark, and attribution notices from the Source form of the Work, excluding those notices that do not pertain to any part of the Derivative Works; and (d) If the Work includes a "NOTICE" text file as part of its distribution, then any Derivative Works that You distribute must include a readable copy of the attribution notices contained within such NOTICE file, excluding those notices that do not pertain to any part of the Derivative Works, in at least one of the following places: within a NOTICE text file distributed as part of the Derivative Works; within the Source form or documentation, if provided along with the Derivative Works; or, within a display generated by the Derivative Works, if and wherever such third-party notices normally appear. The contents of the NOTICE file are for informational purposes only and do not modify the License. You may add Your own attribution notices within Derivative Works that You distribute, alongside or as an addendum to the NOTICE text from the Work, provided that such additional attribution notices cannot be construed as modifying the License. You may add Your own copyright statement to Your modifications and may provide additional or different license terms and conditions for use, reproduction, or distribution of Your modifications, or for any such Derivative Works as a whole, provided Your use, reproduction, and distribution of the Work otherwise complies with the conditions stated in this License. 5. Submission of Contributions. Unless You explicitly state otherwise, any Contribution intentionally submitted for inclusion in the Work by You to the Licensor shall be under the terms and conditions of this License, without any additional terms or conditions. Notwithstanding the above, nothing herein shall supersede or modify the terms of any separate license agreement you may have executed with Licensor regarding such Contributions. 6. Trademarks. This License does not grant permission to use the trade names, trademarks, service marks, or product names of the Licensor, except as required for reasonable and customary use in describing the origin of the Work and reproducing the content of the NOTICE file. 7. Disclaimer of Warranty. Unless required by applicable law or agreed to in writing, Licensor provides the Work (and each Contributor provides its Contributions) on an "AS IS" BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied, including, without limitation, any warranties or conditions of TITLE, NON-INFRINGEMENT, MERCHANTABILITY, or FITNESS FOR A PARTICULAR PURPOSE. You are solely responsible for determining the appropriateness of using or redistributing the Work and assume any risks associated with Your exercise of permissions under this License. 8. Limitation of Liability. In no event and under no legal theory, whether in tort (including negligence), contract, or otherwise, unless required by applicable law (such as deliberate and grossly negligent acts) or agreed to in writing, shall any Contributor be liable to You for damages, including any direct, indirect, special, incidental, or consequential damages of any character arising as a result of this License or out of the use or inability to use the Work (including but not limited to damages for loss of goodwill, work stoppage, computer failure or malfunction, or any and all other commercial damages or losses), even if such Contributor has been advised of the possibility of such damages. 9. Accepting Warranty or Additional Liability. While redistributing the Work or Derivative Works thereof, You may choose to offer, and charge a fee for, acceptance of support, warranty, indemnity, or other liability obligations and/or rights consistent with this License. However, in accepting such obligations, You may act only on Your own behalf and on Your sole responsibility, not on behalf of any other Contributor, and only if You agree to indemnify, defend, and hold each Contributor harmless for any liability incurred by, or claims asserted against, such Contributor by reason of your accepting any such warranty or additional liability. END OF TERMS AND CONDITIONS APPENDIX: How to apply the Apache License to your work. To apply the Apache License to your work, attach the following boilerplate notice, with the fields enclosed by brackets "[]" replaced with your own identifying information. (Don't include the brackets!) The text should be enclosed in the appropriate comment syntax for the file format. We also recommend that a file or class name and description of purpose be included on the same "printed page" as the copyright notice for easier identification within third-party archives. Copyright [yyyy] [name of copyright owner] Licensed under the Apache License, Version 2.0 (the "License"); you may not use this file except in compliance with the License. You may obtain a copy of the License at http://www.apache.org/licenses/LICENSE-2.0 Unless required by applicable law or agreed to in writing, software distributed under the License is distributed on an "AS IS" BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. See the License for the specific language governing permissions and limitations under the License. ---- LLVM Exceptions to the Apache 2.0 License ---- As an exception, if, as a result of your compiling your source code, portions of this Software are embedded into an Object form of such source code, you may redistribute such embedded portions in such Object form without complying with the conditions of Sections 4(a), 4(b) and 4(d) of the License. In addition, if you combine or link compiled forms of this Software with software that is licensed under the GPLv2 ("Combined Software") and if a court of competent jurisdiction determines that the patent provision (Section 3), the indemnity provision (Section 9) or other Section of the License conflicts with the conditions of the GPLv2, you may retroactively and prospectively choose to deem waived or otherwise exclude such Section(s) of the License, but only in their entirety and only with respect to the Combined Software. ============================================================================== Software from third parties included in the LLVM Project: ============================================================================== The LLVM Project contains third party software which is under different license terms. All such code will be identified clearly using at least one of two mechanisms: 1) It will be in a separate directory tree with its own `LICENSE.txt` or `LICENSE` file at the top containing the specific license and restrictions which apply to that software, or 2) It will contain specific license and restriction terms at the top of every file. ============================================================================== Legacy LLVM License (https://llvm.org/docs/DeveloperPolicy.html#legacy): ============================================================================== The libc++abi library is dual licensed under both the University of Illinois "BSD-Like" license and the MIT license. As a user of this code you may choose to use it under either license. As a contributor, you agree to allow your code to be used under both. Full text of the relevant licenses is included below. ============================================================================== University of Illinois/NCSA Open Source License Copyright (c) 2009-2019 by the contributors listed in CREDITS.TXT All rights reserved. Developed by: LLVM Team University of Illinois at Urbana-Champaign http://llvm.org Permission is hereby granted, free of charge, to any person obtaining a copy of this software and associated documentation files (the "Software"), to deal with 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: * Redistributions of source code must retain the above copyright notice, this list of conditions and the following disclaimers. * Redistributions in binary form must reproduce the above copyright notice, this list of conditions and the following disclaimers in the documentation and/or other materials provided with the distribution. * Neither the names of the LLVM Team, University of Illinois at Urbana-Champaign, nor the names of its contributors may be used to endorse or promote products derived from this Software without specific prior written permission. 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 CONTRIBUTORS 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 WITH THE SOFTWARE. ============================================================================== Copyright (c) 2009-2014 by the contributors listed in CREDITS.TXT 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. ------------------------------------------------------------------------------ libjpeg_turbo (every build) ------------------------------------------------------------------------------ libjpeg-turbo Licenses ====================== libjpeg-turbo is covered by two compatible BSD-style open source licenses: - The IJG (Independent JPEG Group) License, which is listed in [README.ijg](README.ijg) This license applies to the libjpeg API library and associated programs, including any code inherited from libjpeg and any modifications to that code. Note that the libjpeg-turbo SIMD source code bears the [zlib License](https://opensource.org/licenses/Zlib), but in the context of the overall libjpeg API library, the terms of the zlib License are subsumed by the terms of the IJG License. - The Modified (3-clause) BSD License, which is listed below This license applies to the TurboJPEG API library and associated programs, as well as the build system. Note that the TurboJPEG API library wraps the libjpeg API library, so in the context of the overall TurboJPEG API library, both the terms of the IJG License and the terms of the Modified (3-clause) BSD License apply. Complying with the libjpeg-turbo Licenses ========================================= This section provides a roll-up of the libjpeg-turbo licensing terms, to the best of our understanding. This is not a license in and of itself. It is intended solely for clarification. 1. If you are distributing a modified version of the libjpeg-turbo source, then: 1. You cannot alter or remove any existing copyright or license notices from the source. **Origin** - Clause 1 of the IJG License - Clause 1 of the Modified BSD License - Clauses 1 and 3 of the zlib License 2. You must add your own copyright notice to the header of each source file you modified, so others can tell that you modified that file. (If there is not an existing copyright header in that file, then you can simply add a notice stating that you modified the file.) **Origin** - Clause 1 of the IJG License - Clause 2 of the zlib License 3. You must include the IJG README file, and you must not alter any of the copyright or license text in that file. **Origin** - Clause 1 of the IJG License 2. If you are distributing only libjpeg-turbo binaries without the source, or if you are distributing an application that statically links with libjpeg-turbo, then: 1. Your product documentation must include a message stating: This software is based in part on the work of the Independent JPEG Group. **Origin** - Clause 2 of the IJG license 2. If your binary distribution includes or uses the TurboJPEG API, then your product documentation must include the text of the Modified BSD License (see below.) **Origin** - Clause 2 of the Modified BSD License 3. You cannot use the name of the IJG or The libjpeg-turbo Project or the contributors thereof in advertising, publicity, etc. **Origin** - IJG License - Clause 3 of the Modified BSD License 4. The IJG and The libjpeg-turbo Project do not warrant libjpeg-turbo to be free of defects, nor do we accept any liability for undesirable consequences resulting from your use of the software. **Origin** - IJG License - Modified BSD License - zlib License The Modified (3-clause) BSD License =================================== Copyright (C)2009-2024 D. R. Commander. All Rights Reserved.
Copyright (C)2015 Viktor Szathmáry. All Rights Reserved. Redistribution and use in source and binary forms, with or without modification, are permitted provided that the following conditions are met: - Redistributions of source code must retain the above copyright notice, this list of conditions and the following disclaimer. - Redistributions in binary form must reproduce the above copyright notice, this list of conditions and the following disclaimer in the documentation and/or other materials provided with the distribution. - Neither the name of the libjpeg-turbo Project nor the names of its contributors may be used to endorse or promote products derived from this software without specific prior written permission. THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS", AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDERS OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. Why Two Licenses? ================= The zlib License could have been used instead of the Modified (3-clause) BSD License, and since the IJG License effectively subsumes the distribution conditions of the zlib License, this would have effectively placed libjpeg-turbo binary distributions under the IJG License. However, the IJG License specifically refers to the Independent JPEG Group and does not extend attribution and endorsement protections to other entities. Thus, it was desirable to choose a license that granted us the same protections for new code that were granted to the IJG for code derived from their software. ------------------------------------------------------------------------------ libsrtp (every build) ------------------------------------------------------------------------------ /* * * Copyright (c) 2001-2017 Cisco Systems, Inc. * All rights reserved. * * Redistribution and use in source and binary forms, with or without * modification, are permitted provided that the following conditions * are met: * * Redistributions of source code must retain the above copyright * notice, this list of conditions and the following disclaimer. * * Redistributions in binary form must reproduce the above * copyright notice, this list of conditions and the following * disclaimer in the documentation and/or other materials provided * with the distribution. * * Neither the name of the Cisco Systems, Inc. nor the names of its * contributors may be used to endorse or promote products derived * from this software without specific prior written permission. * * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS * "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT * LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS * FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE * COPYRIGHT HOLDERS OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, * INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES * (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR * SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, * STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED * OF THE POSSIBILITY OF SUCH DAMAGE. * */ ------------------------------------------------------------------------------ libvpx (every build) ------------------------------------------------------------------------------ Copyright (c) 2010, The WebM Project authors. All rights reserved. Redistribution and use in source and binary forms, with or without modification, are permitted provided that the following conditions are met: * Redistributions of source code must retain the above copyright notice, this list of conditions and the following disclaimer. * Redistributions in binary form must reproduce the above copyright notice, this list of conditions and the following disclaimer in the documentation and/or other materials provided with the distribution. * Neither the name of Google, nor the WebM Project, nor the names of its contributors may be used to endorse or promote products derived from this software without specific prior written permission. THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. ------------------------------------------------------------------------------ libyuv (every build) ------------------------------------------------------------------------------ Copyright 2011 The LibYuv Project Authors. All rights reserved. Redistribution and use in source and binary forms, with or without modification, are permitted provided that the following conditions are met: * Redistributions of source code must retain the above copyright notice, this list of conditions and the following disclaimer. * Redistributions in binary form must reproduce the above copyright notice, this list of conditions and the following disclaimer in the documentation and/or other materials provided with the distribution. * Neither the name of Google nor the names of its contributors may be used to endorse or promote products derived from this software without specific prior written permission. THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. ------------------------------------------------------------------------------ llvm-libc (mac-x64-release) ------------------------------------------------------------------------------ ============================================================================== The LLVM Project is under the Apache License v2.0 with LLVM Exceptions: ============================================================================== Apache License Version 2.0, January 2004 http://www.apache.org/licenses/ TERMS AND CONDITIONS FOR USE, REPRODUCTION, AND DISTRIBUTION 1. Definitions. "License" shall mean the terms and conditions for use, reproduction, and distribution as defined by Sections 1 through 9 of this document. "Licensor" shall mean the copyright owner or entity authorized by the copyright owner that is granting the License. "Legal Entity" shall mean the union of the acting entity and all other entities that control, are controlled by, or are under common control with that entity. For the purposes of this definition, "control" means (i) the power, direct or indirect, to cause the direction or management of such entity, whether by contract or otherwise, or (ii) ownership of fifty percent (50%) or more of the outstanding shares, or (iii) beneficial ownership of such entity. "You" (or "Your") shall mean an individual or Legal Entity exercising permissions granted by this License. "Source" form shall mean the preferred form for making modifications, including but not limited to software source code, documentation source, and configuration files. "Object" form shall mean any form resulting from mechanical transformation or translation of a Source form, including but not limited to compiled object code, generated documentation, and conversions to other media types. "Work" shall mean the work of authorship, whether in Source or Object form, made available under the License, as indicated by a copyright notice that is included in or attached to the work (an example is provided in the Appendix below). "Derivative Works" shall mean any work, whether in Source or Object form, that is based on (or derived from) the Work and for which the editorial revisions, annotations, elaborations, or other modifications represent, as a whole, an original work of authorship. For the purposes of this License, Derivative Works shall not include works that remain separable from, or merely link (or bind by name) to the interfaces of, the Work and Derivative Works thereof. "Contribution" shall mean any work of authorship, including the original version of the Work and any modifications or additions to that Work or Derivative Works thereof, that is intentionally submitted to Licensor for inclusion in the Work by the copyright owner or by an individual or Legal Entity authorized to submit on behalf of the copyright owner. For the purposes of this definition, "submitted" means any form of electronic, verbal, or written communication sent to the Licensor or its representatives, including but not limited to communication on electronic mailing lists, source code control systems, and issue tracking systems that are managed by, or on behalf of, the Licensor for the purpose of discussing and improving the Work, but excluding communication that is conspicuously marked or otherwise designated in writing by the copyright owner as "Not a Contribution." "Contributor" shall mean Licensor and any individual or Legal Entity on behalf of whom a Contribution has been received by Licensor and subsequently incorporated within the Work. 2. Grant of Copyright License. Subject to the terms and conditions of this License, each Contributor hereby grants to You a perpetual, worldwide, non-exclusive, no-charge, royalty-free, irrevocable copyright license to reproduce, prepare Derivative Works of, publicly display, publicly perform, sublicense, and distribute the Work and such Derivative Works in Source or Object form. 3. Grant of Patent License. Subject to the terms and conditions of this License, each Contributor hereby grants to You a perpetual, worldwide, non-exclusive, no-charge, royalty-free, irrevocable (except as stated in this section) patent license to make, have made, use, offer to sell, sell, import, and otherwise transfer the Work, where such license applies only to those patent claims licensable by such Contributor that are necessarily infringed by their Contribution(s) alone or by combination of their Contribution(s) with the Work to which such Contribution(s) was submitted. If You institute patent litigation against any entity (including a cross-claim or counterclaim in a lawsuit) alleging that the Work or a Contribution incorporated within the Work constitutes direct or contributory patent infringement, then any patent licenses granted to You under this License for that Work shall terminate as of the date such litigation is filed. 4. Redistribution. You may reproduce and distribute copies of the Work or Derivative Works thereof in any medium, with or without modifications, and in Source or Object form, provided that You meet the following conditions: (a) You must give any other recipients of the Work or Derivative Works a copy of this License; and (b) You must cause any modified files to carry prominent notices stating that You changed the files; and (c) You must retain, in the Source form of any Derivative Works that You distribute, all copyright, patent, trademark, and attribution notices from the Source form of the Work, excluding those notices that do not pertain to any part of the Derivative Works; and (d) If the Work includes a "NOTICE" text file as part of its distribution, then any Derivative Works that You distribute must include a readable copy of the attribution notices contained within such NOTICE file, excluding those notices that do not pertain to any part of the Derivative Works, in at least one of the following places: within a NOTICE text file distributed as part of the Derivative Works; within the Source form or documentation, if provided along with the Derivative Works; or, within a display generated by the Derivative Works, if and wherever such third-party notices normally appear. The contents of the NOTICE file are for informational purposes only and do not modify the License. You may add Your own attribution notices within Derivative Works that You distribute, alongside or as an addendum to the NOTICE text from the Work, provided that such additional attribution notices cannot be construed as modifying the License. You may add Your own copyright statement to Your modifications and may provide additional or different license terms and conditions for use, reproduction, or distribution of Your modifications, or for any such Derivative Works as a whole, provided Your use, reproduction, and distribution of the Work otherwise complies with the conditions stated in this License. 5. Submission of Contributions. Unless You explicitly state otherwise, any Contribution intentionally submitted for inclusion in the Work by You to the Licensor shall be under the terms and conditions of this License, without any additional terms or conditions. Notwithstanding the above, nothing herein shall supersede or modify the terms of any separate license agreement you may have executed with Licensor regarding such Contributions. 6. Trademarks. This License does not grant permission to use the trade names, trademarks, service marks, or product names of the Licensor, except as required for reasonable and customary use in describing the origin of the Work and reproducing the content of the NOTICE file. 7. Disclaimer of Warranty. Unless required by applicable law or agreed to in writing, Licensor provides the Work (and each Contributor provides its Contributions) on an "AS IS" BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied, including, without limitation, any warranties or conditions of TITLE, NON-INFRINGEMENT, MERCHANTABILITY, or FITNESS FOR A PARTICULAR PURPOSE. You are solely responsible for determining the appropriateness of using or redistributing the Work and assume any risks associated with Your exercise of permissions under this License. 8. Limitation of Liability. In no event and under no legal theory, whether in tort (including negligence), contract, or otherwise, unless required by applicable law (such as deliberate and grossly negligent acts) or agreed to in writing, shall any Contributor be liable to You for damages, including any direct, indirect, special, incidental, or consequential damages of any character arising as a result of this License or out of the use or inability to use the Work (including but not limited to damages for loss of goodwill, work stoppage, computer failure or malfunction, or any and all other commercial damages or losses), even if such Contributor has been advised of the possibility of such damages. 9. Accepting Warranty or Additional Liability. While redistributing the Work or Derivative Works thereof, You may choose to offer, and charge a fee for, acceptance of support, warranty, indemnity, or other liability obligations and/or rights consistent with this License. However, in accepting such obligations, You may act only on Your own behalf and on Your sole responsibility, not on behalf of any other Contributor, and only if You agree to indemnify, defend, and hold each Contributor harmless for any liability incurred by, or claims asserted against, such Contributor by reason of your accepting any such warranty or additional liability. END OF TERMS AND CONDITIONS APPENDIX: How to apply the Apache License to your work. To apply the Apache License to your work, attach the following boilerplate notice, with the fields enclosed by brackets "[]" replaced with your own identifying information. (Don't include the brackets!) The text should be enclosed in the appropriate comment syntax for the file format. We also recommend that a file or class name and description of purpose be included on the same "printed page" as the copyright notice for easier identification within third-party archives. Copyright [yyyy] [name of copyright owner] Licensed under the Apache License, Version 2.0 (the "License"); you may not use this file except in compliance with the License. You may obtain a copy of the License at http://www.apache.org/licenses/LICENSE-2.0 Unless required by applicable law or agreed to in writing, software distributed under the License is distributed on an "AS IS" BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. See the License for the specific language governing permissions and limitations under the License. ---- LLVM Exceptions to the Apache 2.0 License ---- As an exception, if, as a result of your compiling your source code, portions of this Software are embedded into an Object form of such source code, you may redistribute such embedded portions in such Object form without complying with the conditions of Sections 4(a), 4(b) and 4(d) of the License. In addition, if you combine or link compiled forms of this Software with software that is licensed under the GPLv2 ("Combined Software") and if a court of competent jurisdiction determines that the patent provision (Section 3), the indemnity provision (Section 9) or other Section of the License conflicts with the conditions of the GPLv2, you may retroactively and prospectively choose to deem waived or otherwise exclude such Section(s) of the License, but only in their entirety and only with respect to the Combined Software. ============================================================================== Software from third parties included in the LLVM Project: ============================================================================== The LLVM Project contains third party software which is under different license terms. All such code will be identified clearly using at least one of two mechanisms: 1) It will be in a separate directory tree with its own `LICENSE.txt` or `LICENSE` file at the top containing the specific license and restrictions which apply to that software, or 2) It will contain specific license and restriction terms at the top of every file. ============================================================================== Legacy LLVM License (https://llvm.org/docs/DeveloperPolicy.html#legacy): ============================================================================== University of Illinois/NCSA Open Source License Copyright (c) 2007-2019 University of Illinois at Urbana-Champaign. All rights reserved. Developed by: LLVM Team University of Illinois at Urbana-Champaign http://llvm.org Permission is hereby granted, free of charge, to any person obtaining a copy of this software and associated documentation files (the "Software"), to deal with 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: * Redistributions of source code must retain the above copyright notice, this list of conditions and the following disclaimers. * Redistributions in binary form must reproduce the above copyright notice, this list of conditions and the following disclaimers in the documentation and/or other materials provided with the distribution. * Neither the names of the LLVM Team, University of Illinois at Urbana-Champaign, nor the names of its contributors may be used to endorse or promote products derived from this Software without specific prior written permission. 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 CONTRIBUTORS 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 WITH THE SOFTWARE. ------------------------------------------------------------------------------ nasm (mac-x64-release, win-x64-release) ------------------------------------------------------------------------------ NASM is now licensed under the 2-clause BSD license, also known as the simplified BSD license. Copyright 1996-2010 the NASM Authors - All rights reserved. Redistribution and use in source and binary forms, with or without modification, are permitted provided that the following conditions are met: * Redistributions of source code must retain the above copyright notice, this list of conditions and the following disclaimer. * Redistributions in binary form must reproduce the above copyright notice, this list of conditions and the following disclaimer in the documentation and/or other materials provided with the distribution. THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. ------------------------------------------------------------------------------ ooura (every build) ------------------------------------------------------------------------------ /* * http://www.kurims.kyoto-u.ac.jp/~ooura/fft.html * Copyright Takuya OOURA, 1996-2001 * * You may use, copy, modify and distribute this code for any purpose (include * commercial use) and without fee. Please refer to this package when you modify * this code. */ ------------------------------------------------------------------------------ openh264 (every build) ------------------------------------------------------------------------------ Copyright (c) 2013, Cisco Systems All rights reserved. Redistribution and use in source and binary forms, with or without modification, are permitted provided that the following conditions are met: * Redistributions of source code must retain the above copyright notice, this list of conditions and the following disclaimer. * Redistributions in binary form must reproduce the above copyright notice, this list of conditions and the following disclaimer in the documentation and/or other materials provided with the distribution. THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. ------------------------------------------------------------------------------ opus (every build) ------------------------------------------------------------------------------ Copyright 2001-2023 Xiph.Org, Skype Limited, Octasic, Jean-Marc Valin, Timothy B. Terriberry, CSIRO, Gregory Maxwell, Mark Borgerding, Erik de Castro Lopo, Mozilla, Amazon Redistribution and use in source and binary forms, with or without modification, are permitted provided that the following conditions are met: - Redistributions of source code must retain the above copyright notice, this list of conditions and the following disclaimer. - Redistributions in binary form must reproduce the above copyright notice, this list of conditions and the following disclaimer in the documentation and/or other materials provided with the distribution. - Neither the name of Internet Society, IETF or IETF Trust, nor the names of specific contributors, may be used to endorse or promote products derived from this software without specific prior written permission. THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS ``AS IS'' AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. Opus is subject to the royalty-free patent licenses which are specified at: Xiph.Org Foundation: https://datatracker.ietf.org/ipr/1524/ Microsoft Corporation: https://datatracker.ietf.org/ipr/1914/ Broadcom Corporation: https://datatracker.ietf.org/ipr/1526/ ------------------------------------------------------------------------------ perfetto (every build) ------------------------------------------------------------------------------ Apache License Version 2.0, January 2004 http://www.apache.org/licenses/ TERMS AND CONDITIONS FOR USE, REPRODUCTION, AND DISTRIBUTION 1. Definitions. "License" shall mean the terms and conditions for use, reproduction, and distribution as defined by Sections 1 through 9 of this document. "Licensor" shall mean the copyright owner or entity authorized by the copyright owner that is granting the License. "Legal Entity" shall mean the union of the acting entity and all other entities that control, are controlled by, or are under common control with that entity. For the purposes of this definition, "control" means (i) the power, direct or indirect, to cause the direction or management of such entity, whether by contract or otherwise, or (ii) ownership of fifty percent (50%) or more of the outstanding shares, or (iii) beneficial ownership of such entity. "You" (or "Your") shall mean an individual or Legal Entity exercising permissions granted by this License. "Source" form shall mean the preferred form for making modifications, including but not limited to software source code, documentation source, and configuration files. "Object" form shall mean any form resulting from mechanical transformation or translation of a Source form, including but not limited to compiled object code, generated documentation, and conversions to other media types. "Work" shall mean the work of authorship, whether in Source or Object form, made available under the License, as indicated by a copyright notice that is included in or attached to the work (an example is provided in the Appendix below). "Derivative Works" shall mean any work, whether in Source or Object form, that is based on (or derived from) the Work and for which the editorial revisions, annotations, elaborations, or other modifications represent, as a whole, an original work of authorship. For the purposes of this License, Derivative Works shall not include works that remain separable from, or merely link (or bind by name) to the interfaces of, the Work and Derivative Works thereof. "Contribution" shall mean any work of authorship, including the original version of the Work and any modifications or additions to that Work or Derivative Works thereof, that is intentionally submitted to Licensor for inclusion in the Work by the copyright owner or by an individual or Legal Entity authorized to submit on behalf of the copyright owner. For the purposes of this definition, "submitted" means any form of electronic, verbal, or written communication sent to the Licensor or its representatives, including but not limited to communication on electronic mailing lists, source code control systems, and issue tracking systems that are managed by, or on behalf of, the Licensor for the purpose of discussing and improving the Work, but excluding communication that is conspicuously marked or otherwise designated in writing by the copyright owner as "Not a Contribution." "Contributor" shall mean Licensor and any individual or Legal Entity on behalf of whom a Contribution has been received by Licensor and subsequently incorporated within the Work. 2. Grant of Copyright License. Subject to the terms and conditions of this License, each Contributor hereby grants to You a perpetual, worldwide, non-exclusive, no-charge, royalty-free, irrevocable copyright license to reproduce, prepare Derivative Works of, publicly display, publicly perform, sublicense, and distribute the Work and such Derivative Works in Source or Object form. 3. Grant of Patent License. Subject to the terms and conditions of this License, each Contributor hereby grants to You a perpetual, worldwide, non-exclusive, no-charge, royalty-free, irrevocable (except as stated in this section) patent license to make, have made, use, offer to sell, sell, import, and otherwise transfer the Work, where such license applies only to those patent claims licensable by such Contributor that are necessarily infringed by their Contribution(s) alone or by combination of their Contribution(s) with the Work to which such Contribution(s) was submitted. If You institute patent litigation against any entity (including a cross-claim or counterclaim in a lawsuit) alleging that the Work or a Contribution incorporated within the Work constitutes direct or contributory patent infringement, then any patent licenses granted to You under this License for that Work shall terminate as of the date such litigation is filed. 4. Redistribution. You may reproduce and distribute copies of the Work or Derivative Works thereof in any medium, with or without modifications, and in Source or Object form, provided that You meet the following conditions: (a) You must give any other recipients of the Work or Derivative Works a copy of this License; and (b) You must cause any modified files to carry prominent notices stating that You changed the files; and (c) You must retain, in the Source form of any Derivative Works that You distribute, all copyright, patent, trademark, and attribution notices from the Source form of the Work, excluding those notices that do not pertain to any part of the Derivative Works; and (d) If the Work includes a "NOTICE" text file as part of its distribution, then any Derivative Works that You distribute must include a readable copy of the attribution notices contained within such NOTICE file, excluding those notices that do not pertain to any part of the Derivative Works, in at least one of the following places: within a NOTICE text file distributed as part of the Derivative Works; within the Source form or documentation, if provided along with the Derivative Works; or, within a display generated by the Derivative Works, if and wherever such third-party notices normally appear. The contents of the NOTICE file are for informational purposes only and do not modify the License. You may add Your own attribution notices within Derivative Works that You distribute, alongside or as an addendum to the NOTICE text from the Work, provided that such additional attribution notices cannot be construed as modifying the License. You may add Your own copyright statement to Your modifications and may provide additional or different license terms and conditions for use, reproduction, or distribution of Your modifications, or for any such Derivative Works as a whole, provided Your use, reproduction, and distribution of the Work otherwise complies with the conditions stated in this License. 5. Submission of Contributions. Unless You explicitly state otherwise, any Contribution intentionally submitted for inclusion in the Work by You to the Licensor shall be under the terms and conditions of this License, without any additional terms or conditions. Notwithstanding the above, nothing herein shall supersede or modify the terms of any separate license agreement you may have executed with Licensor regarding such Contributions. 6. Trademarks. This License does not grant permission to use the trade names, trademarks, service marks, or product names of the Licensor, except as required for reasonable and customary use in describing the origin of the Work and reproducing the content of the NOTICE file. 7. Disclaimer of Warranty. Unless required by applicable law or agreed to in writing, Licensor provides the Work (and each Contributor provides its Contributions) on an "AS IS" BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied, including, without limitation, any warranties or conditions of TITLE, NON-INFRINGEMENT, MERCHANTABILITY, or FITNESS FOR A PARTICULAR PURPOSE. You are solely responsible for determining the appropriateness of using or redistributing the Work and assume any risks associated with Your exercise of permissions under this License. 8. Limitation of Liability. In no event and under no legal theory, whether in tort (including negligence), contract, or otherwise, unless required by applicable law (such as deliberate and grossly negligent acts) or agreed to in writing, shall any Contributor be liable to You for damages, including any direct, indirect, special, incidental, or consequential damages of any character arising as a result of this License or out of the use or inability to use the Work (including but not limited to damages for loss of goodwill, work stoppage, computer failure or malfunction, or any and all other commercial damages or losses), even if such Contributor has been advised of the possibility of such damages. 9. Accepting Warranty or Additional Liability. While redistributing the Work or Derivative Works thereof, You may choose to offer, and charge a fee for, acceptance of support, warranty, indemnity, or other liability obligations and/or rights consistent with this License. However, in accepting such obligations, You may act only on Your own behalf and on Your sole responsibility, not on behalf of any other Contributor, and only if You agree to indemnify, defend, and hold each Contributor harmless for any liability incurred by, or claims asserted against, such Contributor by reason of your accepting any such warranty or additional liability. END OF TERMS AND CONDITIONS ------------------ Files: * except those files noted below Copyright (c) 2017, The Android Open Source Project Licensed under the Apache License, Version 2.0 (the "License"); you may not use this file except in compliance with the License. Unless required by applicable law or agreed to in writing, software distributed under the License is distributed on an "AS IS" BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. See the License for the specific language governing permissions and limitations under the License. ------------------ Files: src/trace_processor/perfetto_sql/stdlib/chromium/*, protos/third_party/chromium/*, test/trace_processor/diff_tests/stdlib/chrome/* Copyright 2015 The Chromium Authors Redistribution and use in source and binary forms, with or without modification, are permitted provided that the following conditions are met: * Redistributions of source code must retain the above copyright notice, this list of conditions and the following disclaimer. * Redistributions in binary form must reproduce the above copyright notice, this list of conditions and the following disclaimer in the documentation and/or other materials provided with the distribution. * Neither the name of Google LLC nor the names of its contributors may be used to endorse or promote products derived from this software without specific prior written permission. THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. ------------------ Files: src/trace_processor/perfetto_sql/preprocessor/preprocessor_grammar.{c, h} The author disclaims copyright to this source code. In place of a legal notice, here is a blessing: May you do good and not evil. May you find forgiveness for yourself and forgive others. May you share freely, never taking more than you give. ------------------ Files: src/base/intrusive_tree.cc $OpenBSD: tree.h,v 1.31 2023/03/08 04:43:09 guenther Exp $ Copyright 2002 Niels Provos All rights reserved. Redistribution and use in source and binary forms, with or without modification, are permitted provided that the following conditions are met: 1. Redistributions of source code must retain the above copyright notice, this list of conditions and the following disclaimer. 2. Redistributions in binary form must reproduce the above copyright notice, this list of conditions and the following disclaimer in the documentation and/or other materials provided with the distribution. THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. ------------------------------------------------------------------------------ pffft (every build) ------------------------------------------------------------------------------ Copyright (c) 2013 Julien Pommier ( pommier@modartt.com ) Based on original fortran 77 code from FFTPACKv4 from NETLIB, authored by Dr Paul Swarztrauber of NCAR, in 1985. As confirmed by the NCAR fftpack software curators, the following FFTPACKv5 license applies to FFTPACKv4 sources. My changes are released under the same terms. FFTPACK license: http://www.cisl.ucar.edu/css/software/fftpack5/ftpk.html Copyright (c) 2004 the University Corporation for Atmospheric Research ("UCAR"). All rights reserved. Developed by NCAR's Computational and Information Systems Laboratory, UCAR, www.cisl.ucar.edu. Redistribution and use of the Software in source and binary forms, with or without modification, is permitted provided that the following conditions are met: - Neither the names of NCAR's Computational and Information Systems Laboratory, the University Corporation for Atmospheric Research, nor the names of its sponsors or contributors may be used to endorse or promote products derived from this Software without specific prior written permission. - Redistributions of source code must retain the above copyright notices, this list of conditions, and the disclaimer below. - Redistributions in binary form must reproduce the above copyright notice, this list of conditions, and the disclaimer below in the documentation and/or other materials provided with the distribution. THIS 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 CONTRIBUTORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL 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 WITH THE SOFTWARE. ------------------------------------------------------------------------------ portaudio (mac-arm64-release, mac-x64-release) ------------------------------------------------------------------------------ /* * $Id: pa_memorybarrier.h 1240 2007-07-17 13:05:07Z bjornroche $ * Portable Audio I/O Library * Memory barrier utilities * * Author: Bjorn Roche, XO Audio, LLC * * This program uses the PortAudio Portable Audio Library. * For more information see: http://www.portaudio.com * Copyright (c) 1999-2000 Ross Bencina and Phil Burk * * 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. */ /* * The text above constitutes the entire PortAudio license; however, * the PortAudio community also makes the following non-binding requests: * * Any person wishing to distribute modifications to the Software is * requested to send the modifications to the original developer so that * they can be incorporated into the canonical version. It is also * requested that these non-binding requests be included along with the * license above. */ /* * $Id: pa_ringbuffer.c 1421 2009-11-18 16:09:05Z bjornroche $ * Portable Audio I/O Library * Ring Buffer utility. * * Author: Phil Burk, http://www.softsynth.com * modified for SMP safety on Mac OS X by Bjorn Roche * modified for SMP safety on Linux by Leland Lucius * also, allowed for const where possible * modified for multiple-byte-sized data elements by Sven Fischer * * Note that this is safe only for a single-thread reader and a * single-thread writer. * * This program uses the PortAudio Portable Audio Library. * For more information see: http://www.portaudio.com * Copyright (c) 1999-2000 Ross Bencina and Phil Burk * * 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. */ /* * The text above constitutes the entire PortAudio license; however, * the PortAudio community also makes the following non-binding requests: * * Any person wishing to distribute modifications to the Software is * requested to send the modifications to the original developer so that * they can be incorporated into the canonical version. It is also * requested that these non-binding requests be included along with the * license above. */ ------------------------------------------------------------------------------ protobuf (every build) ------------------------------------------------------------------------------ Copyright 2008 Google Inc. All rights reserved. Redistribution and use in source and binary forms, with or without modification, are permitted provided that the following conditions are met: * Redistributions of source code must retain the above copyright notice, this list of conditions and the following disclaimer. * Redistributions in binary form must reproduce the above copyright notice, this list of conditions and the following disclaimer in the documentation and/or other materials provided with the distribution. * Neither the name of Google Inc. nor the names of its contributors may be used to endorse or promote products derived from this software without specific prior written permission. THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. Code generated by the Protocol Buffer compiler is owned by the owner of the input file used when generating it. This code is not standalone and requires a support library to be linked with it. This support library is itself covered by the above license. ------------------------------------------------------------------------------ rnnoise (every build) ------------------------------------------------------------------------------ Copyright (c) 2017, Mozilla Copyright (c) 2007-2017, Jean-Marc Valin Copyright (c) 2005-2017, Xiph.Org Foundation Copyright (c) 2003-2004, Mark Borgerding Redistribution and use in source and binary forms, with or without modification, are permitted provided that the following conditions are met: - Redistributions of source code must retain the above copyright notice, this list of conditions and the following disclaimer. - Redistributions in binary form must reproduce the above copyright notice, this list of conditions and the following disclaimer in the documentation and/or other materials provided with the distribution. - Neither the name of the Xiph.Org Foundation nor the names of its contributors may be used to endorse or promote products derived from this software without specific prior written permission. THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS ``AS IS'' AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE FOUNDATION OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. ------------------------------------------------------------------------------ spl_sqrt_floor (every build) ------------------------------------------------------------------------------ /* * Written by Wilco Dijkstra, 1996. The following email exchange establishes the * license. * * From: Wilco Dijkstra * Date: Fri, Jun 24, 2011 at 3:20 AM * Subject: Re: sqrt routine * To: Kevin Ma * Hi Kevin, * Thanks for asking. Those routines are public domain (originally posted to * comp.sys.arm a long time ago), so you can use them freely for any purpose. * Cheers, * Wilco * * ----- Original Message ----- * From: "Kevin Ma" * To: * Sent: Thursday, June 23, 2011 11:44 PM * Subject: Fwd: sqrt routine * Hi Wilco, * I saw your sqrt routine from several web sites, including * http://www.finesse.demon.co.uk/steven/sqrt.html. * Just wonder if there's any copyright information with your Successive * approximation routines, or if I can freely use it for any purpose. * Thanks. * Kevin */ ------------------------------------------------------------------------------ zlib (every build) ------------------------------------------------------------------------------ version 1.2.12, March 27th, 2022 Copyright (C) 1995-2022 Jean-loup Gailly and Mark Adler This software is provided 'as-is', without any express or implied warranty. In no event will the authors be held liable for any damages arising from the use of this software. Permission is granted to anyone to use this software for any purpose, including commercial applications, and to alter it and redistribute it freely, subject to the following restrictions: 1. The origin of this software must not be misrepresented; you must not claim that you wrote the original software. If you use this software in a product, an acknowledgment in the product documentation would be appreciated but is not required. 2. Altered source versions must be plainly marked as such, and must not be misrepresented as being the original software. 3. This notice may not be removed or altered from any source distribution. Signalsmith Stretch 1.4.0 ------------------------- Master Tempo in the MIDI version: a track's tempo changed without its pitch. Licence: MIT. https://github.com/Signalsmith-Audio/signalsmith-stretch MIT License Copyright (c) 2022 Geraint Luff / Signalsmith Audio Ltd. 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. Signalsmith Linear 0.6.4 ------------------------ Signalsmith Stretch's maths. Licence: MIT. https://github.com/Signalsmith-Audio/linear MIT License Copyright (c) 2025 Signalsmith Audio 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. Archivo typeface (Omnibus-Type) variable ---------------------------------------- The typeface of the app and the website, unmodified, under the SIL Open Font License 1.1. Licence: OFL-1.1. https://github.com/Omnibus-Type/Archivo Copyright 2020 The Archivo Project Authors (https://github.com/Omnibus-Type/Archivo) This Font Software is licensed under the SIL Open Font License, Version 1.1. This license is copied below, and is also available with a FAQ at: http://scripts.sil.org/OFL ----------------------------------------------------------- SIL OPEN FONT LICENSE Version 1.1 - 26 February 2007 ----------------------------------------------------------- PREAMBLE The goals of the Open Font License (OFL) are to stimulate worldwide development of collaborative font projects, to support the font creation efforts of academic and linguistic communities, and to provide a free and open framework in which fonts may be shared and improved in partnership with others. The OFL allows the licensed fonts to be used, studied, modified and redistributed freely as long as they are not sold by themselves. The fonts, including any derivative works, can be bundled, embedded, redistributed and/or sold with any software provided that any reserved names are not used by derivative works. The fonts and derivatives, however, cannot be released under any other type of license. The requirement for fonts to remain under this license does not apply to any document created using the fonts or their derivatives. DEFINITIONS "Font Software" refers to the set of files released by the Copyright Holder(s) under this license and clearly marked as such. This may include source files, build scripts and documentation. "Reserved Font Name" refers to any names specified as such after the copyright statement(s). "Original Version" refers to the collection of Font Software components as distributed by the Copyright Holder(s). "Modified Version" refers to any derivative made by adding to, deleting, or substituting -- in part or in whole -- any of the components of the Original Version, by changing formats or by porting the Font Software to a new environment. "Author" refers to any designer, engineer, programmer, technical writer or other person who contributed to the Font Software. PERMISSION & CONDITIONS Permission is hereby granted, free of charge, to any person obtaining a copy of the Font Software, to use, study, copy, merge, embed, modify, redistribute, and sell modified and unmodified copies of the Font Software, subject to the following conditions: 1) Neither the Font Software nor any of its individual components, in Original or Modified Versions, may be sold by itself. 2) Original or Modified Versions of the Font Software may be bundled, redistributed and/or sold with any software, provided that each copy contains the above copyright notice and this license. These can be included either as stand-alone text files, human-readable headers or in the appropriate machine-readable metadata fields within text or binary files as long as those fields can be easily viewed by the user. 3) No Modified Version of the Font Software may use the Reserved Font Name(s) unless explicit written permission is granted by the corresponding Copyright Holder. This restriction only applies to the primary font name as presented to the users. 4) The name(s) of the Copyright Holder(s) or the Author(s) of the Font Software shall not be used to promote, endorse or advertise any Modified Version, except to acknowledge the contribution(s) of the Copyright Holder(s) and the Author(s) or with their explicit written permission. 5) The Font Software, modified or unmodified, in part or in whole, must be distributed entirely under this license, and must not be distributed under any other license. The requirement for fonts to remain under this license does not apply to any document created using the Font Software. TERMINATION This license becomes null and void if any of the above conditions are not met. DISCLAIMER THE FONT SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO ANY WARRANTIES OF MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT OF COPYRIGHT, PATENT, TRADEMARK, OR OTHER RIGHT. IN NO EVENT SHALL THE COPYRIGHT HOLDER BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, INCLUDING ANY GENERAL, SPECIAL, INDIRECT, INCIDENTAL, OR CONSEQUENTIAL DAMAGES, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF THE USE OR INABILITY TO USE THE FONT SOFTWARE OR FROM OTHER DEALINGS IN THE FONT SOFTWARE. Symphonia 0.5.5 (Back2Back's changes) ------------------------------------- Symphonia, which Back2Back decodes MP3, AAC, ALAC, FLAC, WAV and AIFF files with, is under the Mozilla Public License 2.0, printed in Part 6 with the Symphonia packages. Back2Back's copies of three of its packages, symphonia-core, symphonia-bundle-mp3 and symphonia-codec-aac 0.5.5, change the files below so that a track decodes to the same samples on every computer: the decoders' tables are worked out by portable.rs, a file Back2Back added to symphonia-core, instead of by the computer's maths library. symphonia-bundle-mp3's Cargo.toml is changed too, by one thing only: the two lint lines at its end, [lints.rust] dead_code = "allow", which stop the compiler warning that a field only the MP2 decoder reads is never read, as Back2Back builds the MP3 decoder alone; they change nothing in what is compiled. Every other file of those three packages, and every other Symphonia package, is the version published on crates.io and at the address below, unchanged. The changed files, portable.rs and that Cargo.toml are printed here in full, as they are compiled into this version of Back2Back, under the Mozilla Public License 2.0. Licence: MPL-2.0. https://github.com/pdeljanov/Symphonia ==== vendor-symphonia-core/src/dsp/fft.rs ==================================== // Symphonia // Copyright (c) 2019-2022 The Project Symphonia Developers. // // This Source Code Form is subject to the terms of the Mozilla Public // License, v. 2.0. If a copy of the MPL was not distributed with this // file, You can obtain one at https://mozilla.org/MPL/2.0/. //! The `fft` module implements the Fast Fourier Transform (FFT). //! //! The complex (I)FFT in this module supports a size up-to 65536. The FFT is implemented using the //! radix-2 Cooley-Tukey algorithm. use std::convert::TryInto; use std::f32; use lazy_static::lazy_static; use super::complex::Complex; macro_rules! fft_twiddle_table { ($bi:expr, $name:ident) => { lazy_static! { static ref $name: [Complex; (1 << $bi) >> 1] = { const N: usize = 1 << $bi; let mut table = [Default::default(); N >> 1]; let theta = std::f64::consts::PI / (N >> 1) as f64; for (k, t) in table.iter_mut().enumerate() { let angle = theta * k as f64; *t = Complex::new( crate::dsp::portable::cos(angle) as f32, -crate::dsp::portable::sin(angle) as f32, ); } table }; } }; } fft_twiddle_table!(6, FFT_TWIDDLE_TABLE_64); fft_twiddle_table!(7, FFT_TWIDDLE_TABLE_128); fft_twiddle_table!(8, FFT_TWIDDLE_TABLE_256); fft_twiddle_table!(9, FFT_TWIDDLE_TABLE_512); fft_twiddle_table!(10, FFT_TWIDDLE_TABLE_1024); fft_twiddle_table!(11, FFT_TWIDDLE_TABLE_2048); fft_twiddle_table!(12, FFT_TWIDDLE_TABLE_4096); fft_twiddle_table!(13, FFT_TWIDDLE_TABLE_8192); fft_twiddle_table!(14, FFT_TWIDDLE_TABLE_16384); fft_twiddle_table!(15, FFT_TWIDDLE_TABLE_32768); fft_twiddle_table!(16, FFT_TWIDDLE_TABLE_65536); /// Get the twiddle factors for a FFT of size `n`. fn fft_twiddle_factors(n: usize) -> &'static [Complex] { // FFT sizes <= 32 use unrolled FFT implementations with hard-coded twiddle factors. match n { 64 => FFT_TWIDDLE_TABLE_64.as_ref(), 128 => FFT_TWIDDLE_TABLE_128.as_ref(), 256 => FFT_TWIDDLE_TABLE_256.as_ref(), 512 => FFT_TWIDDLE_TABLE_512.as_ref(), 1024 => FFT_TWIDDLE_TABLE_1024.as_ref(), 2048 => FFT_TWIDDLE_TABLE_2048.as_ref(), 4096 => FFT_TWIDDLE_TABLE_4096.as_ref(), 8192 => FFT_TWIDDLE_TABLE_8192.as_ref(), 16384 => FFT_TWIDDLE_TABLE_16384.as_ref(), 32768 => FFT_TWIDDLE_TABLE_32768.as_ref(), 65536 => FFT_TWIDDLE_TABLE_65536.as_ref(), _ => panic!("fft size too large"), } } /// The complex Fast Fourier Transform (FFT). pub struct Fft { perm: Box<[u16]>, } impl Fft { /// The maximum FFT size. pub const MAX_SIZE: usize = 1 << 16; pub fn new(n: usize) -> Self { // The FFT size must be a power of two. assert!(n.is_power_of_two()); // The permutation table uses 16-bit indicies. Therefore, the absolute maximum FFT size is // limited to 2^16. assert!(n <= Fft::MAX_SIZE); // Calculate the bit reversal table. let n = n as u16; let shift = n.leading_zeros() + 1; let perm = (0..n).map(|i| i.reverse_bits() >> shift).collect(); Self { perm } } /// Get the size of the FFT. pub fn size(&self) -> usize { self.perm.len() } /// Calculate the inverse FFT. pub fn ifft(&self, x: &[Complex], y: &mut [Complex]) { let n = x.len(); assert_eq!(n, y.len()); assert_eq!(n, self.perm.len()); // Bit reversal using pre-computed permutation table. for (x, y) in self.perm.iter().map(|&i| x[usize::from(i)]).zip(y.iter_mut()) { *y = Complex { re: x.im, im: x.re }; } // Do the forward FFT. Self::transform(y, n); // Output scale. let c = 1.0 / n as f32; for y in y.iter_mut() { *y = Complex { re: c * y.im, im: c * y.re }; } } /// Calculate the inverse FFT in-place. pub fn ifft_inplace(&self, x: &mut [Complex]) { let n = x.len(); assert_eq!(n, self.perm.len()); // Bit reversal using pre-computed permutation table. for (i, &j) in self.perm.iter().enumerate() { let j = usize::from(j); if i <= j { // Swap real and imaginary components while swapping for bit-reversal. let xi = x[i]; let xj = x[j]; x[i] = Complex::new(xj.im, xj.re); x[j] = Complex::new(xi.im, xi.re); } } // Do the forward FFT. Self::transform(x, n); // Output scale. let c = 1.0 / n as f32; for x in x.iter_mut() { *x = Complex { re: c * x.im, im: c * x.re }; } } /// Calculate the FFT in-place. pub fn fft_inplace(&self, x: &mut [Complex]) { let n = x.len(); assert_eq!(n, x.len()); assert_eq!(n, self.perm.len()); for (i, &j) in self.perm.iter().enumerate() { let j = usize::from(j); if i < j { x.swap(i, j); } } // Start FFT recursion. match n { 1 => (), 2 => fft2(x.try_into().unwrap()), 4 => fft4(x.try_into().unwrap()), 8 => fft8(x.try_into().unwrap()), 16 => fft16(x.try_into().unwrap()), _ => Self::transform(x, n), } } /// Calculate the FFT. pub fn fft(&self, x: &[Complex], y: &mut [Complex]) { let n = x.len(); assert_eq!(n, y.len()); assert_eq!(n, self.perm.len()); // Bit reversal using pre-computed permutation table. for (x, y) in self.perm.iter().map(|&i| x[usize::from(i)]).zip(y.iter_mut()) { *y = x; } // Start FFT recursion. match n { 1 => (), 2 => fft2(y.try_into().unwrap()), 4 => fft4(y.try_into().unwrap()), 8 => fft8(y.try_into().unwrap()), 16 => fft16(y.try_into().unwrap()), _ => Self::transform(y, n), } } fn transform(x: &mut [Complex], n: usize) { fn to_arr(x: &mut [Complex]) -> Option<&mut [Complex; 32]> { x.try_into().ok() } if let Some(x) = to_arr(x) { fft32(x); } else { let n_half = n >> 1; let (even, odd) = x.split_at_mut(n_half); Self::transform(even, n_half); Self::transform(odd, n_half); let twiddle = fft_twiddle_factors(n); for ((e, o), w) in even.chunks_exact_mut(2).zip(odd.chunks_exact_mut(2)).zip(twiddle.chunks_exact(2)) { let p0 = e[0]; let q0 = o[0] * w[0]; e[0] = p0 + q0; o[0] = p0 - q0; let p1 = e[1]; let q1 = o[1] * w[1]; e[1] = p1 + q1; o[1] = p1 - q1; } } } } macro_rules! complex { ($re:expr, $im:expr) => { Complex { re: $re, im: $im } }; } fn fft32(x: &mut [Complex; 32]) { let mut x0 = [ x[0], x[1], x[2], x[3], x[4], x[5], x[6], x[7], x[8], x[9], x[10], x[11], x[12], x[13], x[14], x[15], ]; let mut x1 = [ x[16], x[17], x[18], x[19], x[20], x[21], x[22], x[23], x[24], x[25], x[26], x[27], x[28], x[29], x[30], x[31], ]; fft16(&mut x0); fft16(&mut x1); let a4 = f32::consts::FRAC_1_SQRT_2 * x1[4].re; let b4 = f32::consts::FRAC_1_SQRT_2 * x1[4].im; let a12 = -f32::consts::FRAC_1_SQRT_2 * x1[12].re; let b12 = -f32::consts::FRAC_1_SQRT_2 * x1[12].im; let x1p = [ x1[0], complex!(0.98078528040323044913, -0.19509032201612826785) * x1[1], complex!(0.92387953251128675613, -0.38268343236508977173) * x1[2], complex!(0.83146961230254523708, -0.55557023301960222474) * x1[3], complex!(a4 + b4, b4 - a4), complex!(0.55557023301960222474, -0.83146961230254523708) * x1[5], complex!(0.38268343236508977173, -0.92387953251128675613) * x1[6], complex!(0.19509032201612826785, -0.98078528040323044913) * x1[7], complex!(x1[8].im, -x1[8].re), complex!(-0.19509032201612826785, -0.98078528040323044913) * x1[9], complex!(-0.38268343236508977173, -0.92387953251128675613) * x1[10], complex!(-0.55557023301960222474, -0.83146961230254523708) * x1[11], complex!(a12 - b12, a12 + b12), complex!(-0.83146961230254523708, -0.55557023301960222474) * x1[13], complex!(-0.92387953251128675613, -0.38268343236508977173) * x1[14], complex!(-0.98078528040323044913, -0.19509032201612826785) * x1[15], ]; x[0] = x0[0] + x1p[0]; x[1] = x0[1] + x1p[1]; x[2] = x0[2] + x1p[2]; x[3] = x0[3] + x1p[3]; x[4] = x0[4] + x1p[4]; x[5] = x0[5] + x1p[5]; x[6] = x0[6] + x1p[6]; x[7] = x0[7] + x1p[7]; x[8] = x0[8] + x1p[8]; x[9] = x0[9] + x1p[9]; x[10] = x0[10] + x1p[10]; x[11] = x0[11] + x1p[11]; x[12] = x0[12] + x1p[12]; x[13] = x0[13] + x1p[13]; x[14] = x0[14] + x1p[14]; x[15] = x0[15] + x1p[15]; x[16] = x0[0] - x1p[0]; x[17] = x0[1] - x1p[1]; x[18] = x0[2] - x1p[2]; x[19] = x0[3] - x1p[3]; x[20] = x0[4] - x1p[4]; x[21] = x0[5] - x1p[5]; x[22] = x0[6] - x1p[6]; x[23] = x0[7] - x1p[7]; x[24] = x0[8] - x1p[8]; x[25] = x0[9] - x1p[9]; x[26] = x0[10] - x1p[10]; x[27] = x0[11] - x1p[11]; x[28] = x0[12] - x1p[12]; x[29] = x0[13] - x1p[13]; x[30] = x0[14] - x1p[14]; x[31] = x0[15] - x1p[15]; } #[inline(always)] fn fft16(x: &mut [Complex; 16]) { let mut x0 = [x[0], x[1], x[2], x[3], x[4], x[5], x[6], x[7]]; let mut x1 = [x[8], x[9], x[10], x[11], x[12], x[13], x[14], x[15]]; fft8(&mut x0); fft8(&mut x1); let a2 = f32::consts::FRAC_1_SQRT_2 * x1[2].re; let b2 = f32::consts::FRAC_1_SQRT_2 * x1[2].im; let a6 = -f32::consts::FRAC_1_SQRT_2 * x1[6].re; let b6 = -f32::consts::FRAC_1_SQRT_2 * x1[6].im; let x1p = [ x1[0], complex!(0.92387953251128675613, -0.38268343236508977173) * x1[1], complex!(a2 + b2, b2 - a2), complex!(0.38268343236508977173, -0.92387953251128675613) * x1[3], complex!(x1[4].im, -x1[4].re), complex!(-0.38268343236508977173, -0.92387953251128675613) * x1[5], complex!(a6 - b6, a6 + b6), complex!(-0.92387953251128675613, -0.38268343236508977173) * x1[7], ]; x[0] = x0[0] + x1p[0]; x[1] = x0[1] + x1p[1]; x[2] = x0[2] + x1p[2]; x[3] = x0[3] + x1p[3]; x[4] = x0[4] + x1p[4]; x[5] = x0[5] + x1p[5]; x[6] = x0[6] + x1p[6]; x[7] = x0[7] + x1p[7]; x[8] = x0[0] - x1p[0]; x[9] = x0[1] - x1p[1]; x[10] = x0[2] - x1p[2]; x[11] = x0[3] - x1p[3]; x[12] = x0[4] - x1p[4]; x[13] = x0[5] - x1p[5]; x[14] = x0[6] - x1p[6]; x[15] = x0[7] - x1p[7]; } #[inline(always)] fn fft8(x: &mut [Complex; 8]) { let mut x0 = [x[0], x[1], x[2], x[3]]; let mut x1 = [x[4], x[5], x[6], x[7]]; fft4(&mut x0); fft4(&mut x1); let a1 = f32::consts::FRAC_1_SQRT_2 * x1[1].re; let b1 = f32::consts::FRAC_1_SQRT_2 * x1[1].im; let a3 = -f32::consts::FRAC_1_SQRT_2 * x1[3].re; let b3 = -f32::consts::FRAC_1_SQRT_2 * x1[3].im; let x1p = [ x1[0], complex!(a1 + b1, b1 - a1), complex!(x1[2].im, -x1[2].re), complex!(a3 - b3, a3 + b3), ]; x[0] = x0[0] + x1p[0]; x[1] = x0[1] + x1p[1]; x[2] = x0[2] + x1p[2]; x[3] = x0[3] + x1p[3]; x[4] = x0[0] - x1p[0]; x[5] = x0[1] - x1p[1]; x[6] = x0[2] - x1p[2]; x[7] = x0[3] - x1p[3]; } #[inline(always)] fn fft4(x: &mut [Complex; 4]) { let x0 = [x[0] + x[1], x[0] - x[1]]; let x1 = [x[2] + x[3], x[2] - x[3]]; let x1p1 = complex!(x1[1].im, -x1[1].re); x[0] = x0[0] + x1[0]; x[1] = x0[1] + x1p1; x[2] = x0[0] - x1[0]; x[3] = x0[1] - x1p1; } #[inline(always)] fn fft2(x: &mut [Complex; 2]) { let x0 = x[0]; x[0] = x0 + x[1]; x[1] = x0 - x[1]; } #[cfg(test)] mod tests { use super::*; use std::f64; /// Compute a naive DFT. fn dft_naive(x: &[Complex], y: &mut [Complex]) { assert_eq!(x.len(), y.len()); let n = x.len() as u64; let theta = 2.0 * f64::consts::PI / (x.len() as f64); for (i, y) in y.iter_mut().enumerate() { let mut re = 0f64; let mut im = 0f64; for (j, &x) in x.iter().enumerate() { let xre = f64::from(x.re); let xim = f64::from(x.im); let ij = ((i as u64) * (j as u64)) & (n - 1); let wre = (theta * ij as f64).cos(); let wim = -(theta * ij as f64).sin(); re += (xre * wre) - (xim * wim); im += (xre * wim) + (xim * wre); } *y = Complex { re: re as f32, im: im as f32 }; } } /// Compute a naive IDFT. fn idft_naive(x: &[Complex], y: &mut [Complex]) { let n = x.len() as u64; let z = x.iter().map(|x| Complex { re: x.im, im: x.re }).collect::>(); dft_naive(&z, y); let c = 1.0 / n as f32; for y in y.iter_mut() { *y = Complex { re: c * y.im, im: c * y.re }; } } /// Returns true if both real and imaginary complex number components deviate by less than /// `epsilon` between the left-hand side and right-hand side. fn check_complex(lhs: Complex, rhs: Complex, epsilon: f32) -> bool { (lhs.re - rhs.re).abs() < epsilon && (lhs.im - rhs.im).abs() < epsilon } #[rustfmt::skip] const TEST_VECTOR: [Complex; 64] = [ Complex { re: -1.82036, im: -0.72591 }, Complex { re: 1.21002, im: 0.75897 }, Complex { re: 1.31084, im: -0.51285 }, Complex { re: 1.26443, im: 1.57430 }, Complex { re: -1.93680, im: 0.69987 }, Complex { re: 0.85269, im: -0.20148 }, Complex { re: 1.10078, im: 0.88904 }, Complex { re: -1.20634, im: -0.07612 }, Complex { re: 1.43358, im: -1.91248 }, Complex { re: 0.10594, im: -0.30743 }, Complex { re: 1.51258, im: 0.99538 }, Complex { re: -1.33673, im: 0.23797 }, Complex { re: 0.43738, im: -1.69900 }, Complex { re: -0.95355, im: -0.33534 }, Complex { re: -0.05479, im: -0.32739 }, Complex { re: -1.85529, im: -1.93157 }, Complex { re: -1.04220, im: 1.04277 }, Complex { re: -0.17585, im: 0.40640 }, Complex { re: 0.09893, im: 1.89538 }, Complex { re: 1.25018, im: -0.85052 }, Complex { re: -1.60696, im: -1.41320 }, Complex { re: -0.25171, im: -0.13830 }, Complex { re: 1.17782, im: -1.41225 }, Complex { re: -0.35389, im: -0.30323 }, Complex { re: -0.16485, im: -0.83675 }, Complex { re: -1.66729, im: -0.52132 }, Complex { re: 1.41246, im: 1.58295 }, Complex { re: -1.84041, im: 0.15331 }, Complex { re: -1.38897, im: 1.16180 }, Complex { re: 0.27927, im: -1.84254 }, Complex { re: -0.46229, im: 0.09699 }, Complex { re: 1.21027, im: -0.31551 }, Complex { re: 0.26195, im: -1.19340 }, Complex { re: 1.60673, im: 1.07094 }, Complex { re: -0.07456, im: -0.63058 }, Complex { re: -1.77397, im: 1.39608 }, Complex { re: -0.80300, im: 0.08858 }, Complex { re: -0.06289, im: 1.48840 }, Complex { re: 0.66399, im: 0.49451 }, Complex { re: -1.49827, im: 1.61856 }, Complex { re: -1.39006, im: 0.67652 }, Complex { re: -0.90232, im: 0.18255 }, Complex { re: 0.00525, im: -1.05797 }, Complex { re: 0.53688, im: 0.88532 }, Complex { re: 0.52712, im: -0.58205 }, Complex { re: -1.77624, im: -0.66799 }, Complex { re: 1.65335, im: -1.72668 }, Complex { re: -0.24568, im: 1.50477 }, Complex { re: -0.15051, im: 0.67824 }, Complex { re: -1.96744, im: 0.81734 }, Complex { re: -1.62630, im: -0.73233 }, Complex { re: -1.98698, im: 0.63824 }, Complex { re: 0.78115, im: 0.97909 }, Complex { re: 0.97392, im: 1.82166 }, Complex { re: 1.30982, im: -1.23975 }, Complex { re: 0.85813, im: 0.80842 }, Complex { re: -1.13934, im: 0.81352 }, Complex { re: -1.22092, im: 0.98348 }, Complex { re: -1.67949, im: 0.78278 }, Complex { re: -1.77411, im: 0.00424 }, Complex { re: 1.93204, im: -0.03273 }, Complex { re: 1.38529, im: 1.31798 }, Complex { re: 0.61666, im: -0.09798 }, Complex { re: 1.02132, im: 1.70293 }, ]; #[test] fn verify_fft() { let mut actual = [Default::default(); TEST_VECTOR.len()]; let mut expected = [Default::default(); TEST_VECTOR.len()]; // Expected dft_naive(&TEST_VECTOR, &mut expected); // Actual Fft::new(TEST_VECTOR.len()).fft(&TEST_VECTOR, &mut actual); for (&a, &e) in actual.iter().zip(expected.iter()) { assert!(check_complex(a, e, 0.00001)); } } #[test] fn verify_fft_inplace() { let mut actual = [Default::default(); TEST_VECTOR.len()]; let mut expected = [Default::default(); TEST_VECTOR.len()]; // Expected dft_naive(&TEST_VECTOR, &mut expected); // Actual actual.copy_from_slice(&TEST_VECTOR); Fft::new(TEST_VECTOR.len()).fft_inplace(&mut actual); for (&a, &e) in actual.iter().zip(expected.iter()) { assert!(check_complex(a, e, 0.00001)); } } #[test] fn verify_ifft() { let mut actual = [Default::default(); TEST_VECTOR.len()]; let mut expected = [Default::default(); TEST_VECTOR.len()]; // Expected idft_naive(&TEST_VECTOR, &mut expected); // Actual Fft::new(TEST_VECTOR.len()).ifft(&TEST_VECTOR, &mut actual); for (&a, &e) in actual.iter().zip(expected.iter()) { assert!(check_complex(a, e, 0.00001)); } } #[test] fn verify_ifft_inplace() { let mut actual = [Default::default(); TEST_VECTOR.len()]; let mut expected = [Default::default(); TEST_VECTOR.len()]; // Expected idft_naive(&TEST_VECTOR, &mut expected); // Actual actual.copy_from_slice(&TEST_VECTOR); Fft::new(TEST_VECTOR.len()).ifft_inplace(&mut actual); for (&a, &e) in actual.iter().zip(expected.iter()) { assert!(check_complex(a, e, 0.00001)); } } #[test] fn verify_fft_reversible() { let mut fft_out = [Default::default(); TEST_VECTOR.len()]; let mut ifft_out = [Default::default(); TEST_VECTOR.len()]; let fft = Fft::new(TEST_VECTOR.len()); fft.fft(&TEST_VECTOR, &mut fft_out); fft.ifft(&fft_out, &mut ifft_out); for (&a, &e) in ifft_out.iter().zip(TEST_VECTOR.iter()) { assert!(check_complex(a, e, 0.000001)); } } #[test] fn verify_fft_inplace_reversible() { let mut out = [Default::default(); TEST_VECTOR.len()]; out.copy_from_slice(&TEST_VECTOR); let fft = Fft::new(TEST_VECTOR.len()); fft.fft_inplace(&mut out); fft.ifft_inplace(&mut out); for (&a, &e) in out.iter().zip(TEST_VECTOR.iter()) { assert!(check_complex(a, e, 0.000001)); } } } ==== end of vendor-symphonia-core/src/dsp/fft.rs ==== ==== vendor-symphonia-core/src/dsp/mdct/no_simd.rs =========================== // Symphonia // Copyright (c) 2019-2023 The Project Symphonia Developers. // // This Source Code Form is subject to the terms of the Mozilla Public // License, v. 2.0. If a copy of the MPL was not distributed with this // file, You can obtain one at https://mozilla.org/MPL/2.0/. //! The Modified Discrete Cosine Transform (MDCT) implemented without SIMD optimizations. use crate::dsp::complex::Complex; use crate::dsp::fft::*; /// The Inverse Modified Discrete Transform (IMDCT). pub struct Imdct { fft: Fft, fft_in: Box<[Complex]>, fft_out: Box<[Complex]>, twiddle: Box<[Complex]>, } impl Imdct { /// Instantiate a N-point IMDCT with no scaling. /// /// The value of `n` is the number of spectral samples and must be a power-of-2 and less-than or /// equal to `2 * Fft::MAX_SIZE`. pub fn new(n: usize) -> Self { Imdct::new_scaled(n, 1.0) } /// Instantiate a N-point IMDCT with scaling. /// /// The value of `n` is the number of spectral samples and must be a power-of-2 and less-than or /// equal to `2 * Fft::MAX_SIZE`. pub fn new_scaled(n: usize, scale: f64) -> Self { // The FFT requires a power-of-two N. assert!(n.is_power_of_two(), "n must be a power of two"); // A complex FFT of size N/2 is used to compute the IMDCT. Therefore, the maximum value of N // is 2 * Fft::MAX_SIZE. assert!(n <= 2 * Fft::MAX_SIZE, "maximum size exceeded"); let n2 = n / 2; let mut twiddle = Vec::with_capacity(n2); let alpha = 1.0 / 8.0 + if scale.is_sign_positive() { 0.0 } else { n2 as f64 }; let pi_n = std::f64::consts::PI / n as f64; let sqrt_scale = scale.abs().sqrt(); for k in 0..n2 { let theta = pi_n * (alpha + k as f64); let re = sqrt_scale * crate::dsp::portable::cos(theta); let im = sqrt_scale * crate::dsp::portable::sin(theta); twiddle.push(Complex::new(re as f32, im as f32)); } let fft_in = vec![Default::default(); n2].into_boxed_slice(); let fft_out = vec![Default::default(); n2].into_boxed_slice(); Imdct { fft: Fft::new(n2), fft_in, fft_out, twiddle: twiddle.into_boxed_slice() } } /// Performs the the N-point Inverse Modified Discrete Cosine Transform. /// /// The number of input spectral samples provided by the slice `spec` must equal the value of N /// that the IMDCT was instantiated with. The length of the output slice, `out`, must be of /// length 2N. Failing to meet these requirements will throw an assertion. pub fn imdct(&mut self, spec: &[f32], out: &mut [f32]) { // Spectral length: 2x FFT size, 0.5x output length. let n = self.fft.size() << 1; // 1x FFT size, 0.25x output length. let n2 = n >> 1; // 0.5x FFT size. let n4 = n >> 2; // The spectrum length must be the same as N. assert_eq!(spec.len(), n); // The output length must be 2x the spectrum length. assert_eq!(out.len(), 2 * n); // Pre-FFT twiddling and packing of the real input signal values into complex signal values. for (i, (&w, t)) in self.twiddle.iter().zip(self.fft_in.iter_mut()).enumerate() { let even = spec[i * 2]; let odd = -spec[n - 1 - i * 2]; let re = odd * w.im - even * w.re; let im = odd * w.re + even * w.im; *t = Complex::new(re, im); } // Do the FFT. self.fft.fft(&self.fft_in, &mut self.fft_out); // Split the output vector (2N samples) into 4 vectors (N/2 samples each). let (vec0, vec1) = out.split_at_mut(n2); let (vec1, vec2) = vec1.split_at_mut(n2); let (vec2, vec3) = vec2.split_at_mut(n2); // Post-FFT twiddling and processing to expand the N/2 complex output values into 2N real // output samples. for (i, (x, &w)) in self.fft_out[..n4].iter().zip(self.twiddle[..n4].iter()).enumerate() { // The real and imaginary components of the post-twiddled FFT samples are used to // generate 4 reak output samples. Using the first half of the complex FFT output, // populate each of the 4 output vectors. let val = w * x.conj(); // Forward and reverse order indicies that will be populated. let fi = 2 * i; let ri = n2 - 1 - 2 * i; // The odd indicies in vec0 are populated reverse order. vec0[ri] = -val.im; // The even indicies in vec1 are populated forward order. vec1[fi] = val.im; // The odd indicies in vec2 are populated reverse order. vec2[ri] = val.re; // The even indicies in vec3 are populated forward order. vec3[fi] = val.re; } for (i, (x, &w)) in self.fft_out[n4..].iter().zip(self.twiddle[n4..].iter()).enumerate() { // Using the second half of the FFT output samples, finish populating each of the 4 // output vectors. let val = w * x.conj(); // Forward and reverse order indicies that will be populated. let fi = 2 * i; let ri = n2 - 1 - 2 * i; // The even indicies in vec0 are populated in forward order. vec0[fi] = -val.re; // The odd indicies in vec1 are populated in reverse order. vec1[ri] = val.re; // The even indicies in vec2 are populated in forward order. vec2[fi] = val.im; // The odd indicies in vec3 are populated in reverse order. vec3[ri] = val.im; } // Note: As of Rust 1.58, there doesn't appear to be any measurable difference between using // iterators or indexing like above. Either the bounds checks are elided above, or they are // not elided using iterators. Therefore, for clarity, the indexing method is used. // // Additionally, note that vectors 0 and 3 are reversed copies (+ negation for vector 0) of // vectors 1 and 2, respectively. Pulling these copies out into a separate loop using // iterators yielded no measureable difference either. } } ==== end of vendor-symphonia-core/src/dsp/mdct/no_simd.rs ==== ==== vendor-symphonia-core/src/dsp/mdct/simd.rs ============================== // Symphonia // Copyright (c) 2019-2023 The Project Symphonia Developers. // // This Source Code Form is subject to the terms of the Mozilla Public // License, v. 2.0. If a copy of the MPL was not distributed with this // file, You can obtain one at https://mozilla.org/MPL/2.0/. //! The Modified Discrete Cosine Transform (MDCT) implemented with SIMD optimizations. use std::sync::Arc; use rustfft::num_complex::Complex; /// The Inverse Modified Discrete Transform (IMDCT). pub struct Imdct { fft: Arc>, fft_scratch: Box<[Complex]>, scratch: Box<[Complex]>, twiddle: Box<[Complex]>, } impl Imdct { /// Instantiate a N-point IMDCT with no scaling. /// /// The value of `n` is the number of spectral samples and must be a power-of-2 and less-than or /// equal to `2 * Fft::MAX_SIZE`. pub fn new(n: usize) -> Self { Imdct::new_scaled(n, 1.0) } /// Instantiate a N-point IMDCT with scaling. /// /// The value of `n` is the number of spectral samples and must be a power-of-2 and less-than or /// equal to `2 * Fft::MAX_SIZE`. pub fn new_scaled(n: usize, scale: f64) -> Self { // The algorithm requires a power-of-two N. assert!(n.is_power_of_two(), "n must be a power of two"); let n2 = n / 2; // Pre-compute the twiddle factors. let mut twiddle = Vec::with_capacity(n2); let alpha = 1.0 / 8.0 + if scale.is_sign_positive() { 0.0 } else { n2 as f64 }; let pi_n = std::f64::consts::PI / n as f64; let sqrt_scale = scale.abs().sqrt(); for k in 0..n2 { let theta = pi_n * (alpha + k as f64); let re = sqrt_scale * crate::dsp::portable::cos(theta); let im = sqrt_scale * crate::dsp::portable::sin(theta); twiddle.push(Complex::new(re as f32, im as f32)); } // Instantiate a half-length forward FFT. let mut planner = rustfft::FftPlanner::::new(); let fft = planner.plan_fft_forward(n2); // Allocate scratch for the FFT. let fft_scratch = vec![Default::default(); fft.get_inplace_scratch_len()].into_boxed_slice(); // Allocate scratch for the IMDCT. let scratch = vec![Default::default(); n2].into_boxed_slice(); Imdct { fft, fft_scratch, scratch, twiddle: twiddle.into_boxed_slice() } } /// Performs the the N-point Inverse Modified Discrete Cosine Transform. /// /// The number of input spectral samples provided by the slice `spec` must equal the value of N /// that the IMDCT was instantiated with. The length of the output slice, `out`, must be of /// length 2N. Failing to meet these requirements will throw an assertion. pub fn imdct(&mut self, spec: &[f32], out: &mut [f32]) { // Spectral length: 2x FFT size, 0.5x output length. let n = self.fft.len() << 1; // 1x FFT size, 0.25x output length. let n2 = n >> 1; // 0.5x FFT size. let n4 = n >> 2; // The spectrum length must be the same as N. assert_eq!(spec.len(), n); // The output length must be 2x the spectrum length. assert_eq!(out.len(), 2 * n); // Pre-FFT twiddling and packing of the real input signal values into complex signal values. for (i, (&w, t)) in self.twiddle.iter().zip(self.scratch.iter_mut()).enumerate() { let even = spec[i * 2]; let odd = -spec[n - 1 - i * 2]; let re = odd * w.im - even * w.re; let im = odd * w.re + even * w.im; *t = Complex::new(re, im); } // Do the FFT. self.fft.process_with_scratch(&mut self.scratch, &mut self.fft_scratch); // Split the output vector (2N samples) into 4 vectors (N/2 samples each). let (vec0, vec1) = out.split_at_mut(n2); let (vec1, vec2) = vec1.split_at_mut(n2); let (vec2, vec3) = vec2.split_at_mut(n2); // Post-FFT twiddling and processing to expand the N/2 complex output values into 2N real // output samples. for (i, (x, &w)) in self.scratch[..n4].iter().zip(self.twiddle[..n4].iter()).enumerate() { // The real and imaginary components of the post-twiddled FFT samples are used to // generate 4 reak output samples. Using the first half of the complex FFT output, // populate each of the 4 output vectors. let val = w * x.conj(); // Forward and reverse order indicies that will be populated. let fi = 2 * i; let ri = n2 - 1 - 2 * i; // The odd indicies in vec0 are populated reverse order. vec0[ri] = -val.im; // The even indicies in vec1 are populated forward order. vec1[fi] = val.im; // The odd indicies in vec2 are populated reverse order. vec2[ri] = val.re; // The even indicies in vec3 are populated forward order. vec3[fi] = val.re; } for (i, (x, &w)) in self.scratch[n4..].iter().zip(self.twiddle[n4..].iter()).enumerate() { // Using the second half of the FFT output samples, finish populating each of the 4 // output vectors. let val = w * x.conj(); // Forward and reverse order indicies that will be populated. let fi = 2 * i; let ri = n2 - 1 - 2 * i; // The even indicies in vec0 are populated in forward order. vec0[fi] = -val.re; // The odd indicies in vec1 are populated in reverse order. vec1[ri] = val.re; // The even indicies in vec2 are populated in forward order. vec2[fi] = val.im; // The odd indicies in vec3 are populated in reverse order. vec3[ri] = val.im; } // Note: As of Rust 1.58, there doesn't appear to be any measurable difference between using // iterators or indexing like above. Either the bounds checks are elided above, or they are // not elided using iterators. Therefore, for clarity, the indexing method is used. // // Additionally, note that vectors 0 and 3 are reversed copies (+ negation for vector 0) of // vectors 1 and 2, respectively. Pulling these copies out into a separate loop using // iterators yielded no measureable difference either. } } ==== end of vendor-symphonia-core/src/dsp/mdct/simd.rs ==== ==== vendor-symphonia-core/src/dsp/mod.rs ==================================== // Symphonia // Copyright (c) 2019-2022 The Project Symphonia Developers. // // This Source Code Form is subject to the terms of the Mozilla Public // License, v. 2.0. If a copy of the MPL was not distributed with this // file, You can obtain one at https://mozilla.org/MPL/2.0/. //! The `dsp` module provides efficient implementations of common signal processing algorithms. pub mod complex; pub mod fft; pub mod mdct; pub mod portable; ==== end of vendor-symphonia-core/src/dsp/mod.rs ==== ==== vendor-symphonia-core/src/dsp/portable.rs =============================== // Back2Back, 2026-10-30. This file is not Symphonia's: it was added to Back2Back's copy of symphonia-core 0.5.5 // (`vendor-symphonia-core`), and the decoders' tables that called the platform's maths library call it instead. //! **Maths that gives the same bits on every machine** (Back2Back, 2026-10-30). //! //! Jake, 2026-10-30: "Lets make the decoder the same on mac and PC." The decoders built their tables with the //! platform's `sin`, `cos`, `tan` and `powf`, which Apple's, Intel's and Microsoft's maths libraries round differently, //! so one record decoded to other samples on each machine //! (`rust-application/analysis/program_divergence_2026-10-29/`). These routines use nothing but `+`, `-`, `*`, `/` //! and comparisons on `f64`, in a fixed order. Rust never fuses a multiply and an add on its own, and every IEEE 754 //! machine rounds each of those operations alike, so they give the same bits on every processor and every system. //! //! Each works in double-double arithmetic (a value carried as an unevaluated sum of two `f64`s, about 106 bits) and //! rounds once at the end, so the result is the correctly rounded value, short of a true value within about 1e-30 of //! a halfway point: what a correctly rounding maths library gives. Apple silicon's library is not one. Against it, these //! routines differ by one ulp in 59 of the 8207 values of x^(4/3), 2 of 7 tangents, 12 of the AAC sine windows' 1152 //! and about 4 % of the resampler's sines, and a 60-digit check found these routines right and Apple's off in every //! one (`crates/decks/tests/portable_maths.rs`, ignored, and `analysis/portable_decode_2026-10-30/check_rounding.py`). //! //! The arguments are meant to be modest: `sin`, `cos` and `tan` reduce by pi/2 carried to about 160 bits, which is //! exact enough for |x| below about 2^28, and `pow` takes a base above zero (or zero) and a result in the normal //! range. Outside that the results are still the same on every machine, only less accurate. //! //! The constants are the correctly rounded splits of pi/2, ln 2, 1/k! and 1/(2k+1), made with Python's `decimal` at //! 80 digits: `float(v)`, then `float(v - Decimal(that))`, and so on. /// A double-double: the value `hi + lo`, with |lo| at most half an ulp of `hi`. #[derive(Clone, Copy, Debug)] struct Dd { hi: f64, lo: f64, } const ONE: Dd = Dd { hi: 1.0, lo: 0.0 }; /// pi/2 as three `f64`s whose sum is it to about 160 bits. const PIO2: [f64; 3] = [ f64::from_bits(0x3ff921fb54442d18), f64::from_bits(0x3c91a62633145c07), f64::from_bits(0xb91f1976b7ed8fbc), ]; /// ln 2 as three `f64`s whose sum is it to about 160 bits. const LN2: [f64; 3] = [ f64::from_bits(0x3fe62e42fefa39ef), f64::from_bits(0x3c7abc9e3b39803f), f64::from_bits(0x3907b57a079a1934), ]; /// 2^(1/4), 2^(1/2) and 2^(3/4), correctly rounded. const QUARTERS: [f64; 4] = [ 1.0, f64::from_bits(0x3ff306fe0a31b715), f64::from_bits(0x3ff6a09e667f3bcd), f64::from_bits(0x3ffae89f995ad3ad), ]; /// 1/k! for k = 0..32, each as a double-double (high, low) of bit patterns. const INV_FACT: [(u64, u64); 32] = [ (0x3ff0000000000000, 0x0000000000000000), // 0 (0x3ff0000000000000, 0x0000000000000000), // 1 (0x3fe0000000000000, 0x0000000000000000), // 2 (0x3fc5555555555555, 0x3c65555555555555), // 3 (0x3fa5555555555555, 0x3c45555555555555), // 4 (0x3f81111111111111, 0x3c01111111111111), // 5 (0x3f56c16c16c16c17, 0xbbef49f49f49f49f), // 6 (0x3f2a01a01a01a01a, 0x3b6a01a01a01a01a), // 7 (0x3efa01a01a01a01a, 0x3b3a01a01a01a01a), // 8 (0x3ec71de3a556c734, 0xbb6c154f8ddc6c00), // 9 (0x3e927e4fb7789f5c, 0x3b3cbbc05b4fa99a), // 10 (0x3e5ae64567f544e4, 0xbafc062e06d1f209), // 11 (0x3e21eed8eff8d898, 0xbac2aec959e14c06), // 12 (0x3de6124613a86d09, 0x3a8f28e0cc748ebe), // 13 (0x3da93974a8c07c9d, 0x3a305d6f8a2efd1f), // 14 (0x3d6ae7f3e733b81f, 0x39e1d8656b0ee8cb), // 15 (0x3d2ae7f3e733b81f, 0x39a1d8656b0ee8cb), // 16 (0x3ce952c77030ad4a, 0x398ac981465ddc6c), // 17 (0x3ca6827863b97d97, 0x394eec01221a8b0b), // 18 (0x3c62f49b46814157, 0x38f2650f61dbdcb4), // 19 (0x3c1e542ba4020225, 0x387ea72b4afe3c2f), // 20 (0x3bd71b8ef6dcf572, 0xb87d043ae40c4647), // 21 (0x3b90ce396db7f853, 0xb83aebcdbd20331c), // 22 (0x3b4761b41316381a, 0xb7d3423c7d91404f), // 23 (0x3aff2cf01972f578, 0xb789ada5fcc1ab14), // 24 (0x3ab3f3ccdd165fa9, 0xb7458ddadf344487), // 25 (0x3a688e85fc6a4e5a, 0xb7071c37ebd16540), // 26 (0x3a1d1ab1c2dccea3, 0x36a054d0c78aea14), // 27 (0x39d0a18a2635085d, 0x366b9e2e28e1aa54), // 28 (0x398259f98b4358ad, 0x362eaf8c39dd9bc5), // 29 (0x3933932c5047d60e, 0x35d832b7b530a627), // 30 (0x38e434d2e783f5bc, 0x3580b87b91be9aff), // 31 ]; /// 1/(2k+1) for k = 0..32, each as a double-double (high, low) of bit patterns. const INV_ODD: [(u64, u64); 32] = [ (0x3ff0000000000000, 0x0000000000000000), // 0 (0x3fd5555555555555, 0x3c75555555555555), // 1 (0x3fc999999999999a, 0xbc6999999999999a), // 2 (0x3fc2492492492492, 0x3c62492492492492), // 3 (0x3fbc71c71c71c71c, 0x3c5c71c71c71c71c), // 4 (0x3fb745d1745d1746, 0xbc4745d1745d1746), // 5 (0x3fb3b13b13b13b14, 0xbc53b13b13b13b14), // 6 (0x3fb1111111111111, 0x3c31111111111111), // 7 (0x3fae1e1e1e1e1e1e, 0x3c2e1e1e1e1e1e1e), // 8 (0x3faaf286bca1af28, 0x3c4af286bca1af28), // 9 (0x3fa8618618618618, 0x3c48618618618618), // 10 (0x3fa642c8590b2164, 0x3c3642c8590b2164), // 11 (0x3fa47ae147ae147b, 0xbc2eb851eb851eb8), // 12 (0x3fa2f684bda12f68, 0x3c42f684bda12f68), // 13 (0x3fa1a7b9611a7b96, 0x3c21a7b9611a7b96), // 14 (0x3fa0842108421084, 0x3c30842108421084), // 15 (0x3f9f07c1f07c1f08, 0xbc2f07c1f07c1f08), // 16 (0x3f9d41d41d41d41d, 0x3c30750750750750), // 17 (0x3f9bacf914c1bad0, 0xbc3bacf914c1bad0), // 18 (0x3f9a41a41a41a41a, 0x3c30690690690690), // 19 (0x3f98f9c18f9c18fa, 0xbc2f3831f3831f38), // 20 (0x3f97d05f417d05f4, 0x3c17d05f417d05f4), // 21 (0x3f96c16c16c16c17, 0xbc2f49f49f49f49f), // 22 (0x3f95c9882b931057, 0x3c2310572620ae4c), // 23 (0x3f94e5e0a72f0539, 0x3c3e0a72f0539783), // 24 (0x3f94141414141414, 0x3c14141414141414), // 25 (0x3f93521cfb2b78c1, 0x3c2a90e7d95bc60a), // 26 (0x3f929e4129e4129e, 0x3c304a7904a7904a), // 27 (0x3f91f7047dc11f70, 0x3c31f7047dc11f70), // 28 (0x3f915b1e5f75270d, 0x3bf15b1e5f75270d), // 29 (0x3f90c9714fbcda3b, 0xbc2f79b47582192e), // 30 (0x3f90410410410410, 0x3c30410410410410), // 31 ]; #[inline] fn two_sum(a: f64, b: f64) -> Dd { let s = a + b; let bb = s - a; let e = (a - (s - bb)) + (b - bb); Dd { hi: s, lo: e } } #[inline] fn quick_two_sum(a: f64, b: f64) -> Dd { let s = a + b; let e = b - (s - a); Dd { hi: s, lo: e } } /// Dekker's split: `a` as two halves of 26 bits each, whose products are exact. #[inline] fn split(a: f64) -> (f64, f64) { let t = 134_217_729.0 * a; let hi = t - (t - a); (hi, a - hi) } /// `a * b` exactly, as a double-double, without a fused multiply-add. #[inline] fn two_prod(a: f64, b: f64) -> Dd { let p = a * b; let (ah, al) = split(a); let (bh, bl) = split(b); let e = ((ah * bh - p) + ah * bl + al * bh) + al * bl; Dd { hi: p, lo: e } } /// 2^k, for k in the normal range. #[inline] fn power_of_two(k: i64) -> f64 { debug_assert!((-1022..=1023).contains(&k)); f64::from_bits(((k + 1023) as u64) << 52) } impl Dd { #[inline] fn of(f: f64) -> Dd { Dd { hi: f, lo: 0.0 } } #[inline] fn bits(pair: (u64, u64)) -> Dd { Dd { hi: f64::from_bits(pair.0), lo: f64::from_bits(pair.1) } } #[inline] fn neg(self) -> Dd { Dd { hi: -self.hi, lo: -self.lo } } #[inline] fn add(self, o: Dd) -> Dd { let s = two_sum(self.hi, o.hi); let t = two_sum(self.lo, o.lo); let u = quick_two_sum(s.hi, s.lo + t.hi); quick_two_sum(u.hi, u.lo + t.lo) } #[inline] fn sub(self, o: Dd) -> Dd { self.add(o.neg()) } #[inline] fn mul(self, o: Dd) -> Dd { let p = two_prod(self.hi, o.hi); quick_two_sum(p.hi, p.lo + (self.hi * o.lo + self.lo * o.hi)) } #[inline] fn mul_f(self, b: f64) -> Dd { let p = two_prod(self.hi, b); quick_two_sum(p.hi, p.lo + self.lo * b) } /// Times a power of two: exact. #[inline] fn scale(self, p: f64) -> Dd { Dd { hi: self.hi * p, lo: self.lo * p } } fn div(self, o: Dd) -> Dd { let q1 = self.hi / o.hi; let r = self.sub(o.mul_f(q1)); let q2 = r.hi / o.hi; let r = r.sub(o.mul_f(q2)); let q3 = r.hi / o.hi; quick_two_sum(q1, q2).add(Dd::of(q3)) } /// The nearest `f32` to `hi + lo`: `hi`'s own rounding, unless `hi` is exactly halfway between two `f32`s, when /// `lo` says which way the value lies. fn to_f32(self) -> f32 { let r = self.hi as f32; if self.lo == 0.0 || f64::from(r) == self.hi || !r.is_finite() { return r; } let up = |v: f32| if v > 0.0 { f32::from_bits(v.to_bits() + 1) } else if v < 0.0 { f32::from_bits(v.to_bits() - 1) } else { f32::from_bits(1) }; let down = |v: f32| -up(-v); let (below, above) = if f64::from(r) < self.hi { (r, up(r)) } else { (down(r), r) }; if (f64::from(below) + f64::from(above)) * 0.5 == self.hi { if self.lo > 0.0 { above } else { below } } else { r } } } /// `x` less the nearest multiple of pi/2, and which multiple. fn reduce(x: f64) -> (Dd, i64) { let q = (x * core::f64::consts::FRAC_2_PI).round(); let r = Dd::of(x).sub(two_prod(q, PIO2[0])).sub(two_prod(q, PIO2[1])).sub(Dd::of(q * PIO2[2])); (r, q as i64) } /// sin and cos of |r| <= about pi/4, by their Taylor series to the 29th and 28th powers. fn sin_cos_kernel(r: Dd) -> (Dd, Dd) { let t = r.mul(r); // The k-th coefficient of each series in t, (-1)^k / n!. let coefficient = |n: usize, k: usize| { let c = Dd::bits(INV_FACT[n]); if k % 2 == 0 { c } else { c.neg() } }; // sin r = r (1 - t/3! + t^2/5! - ...), cos r = 1 - t/2! + t^2/4! - ... let mut s = coefficient(29, 14); let mut c = coefficient(28, 14); for k in (0..14).rev() { s = s.mul(t).add(coefficient(2 * k + 1, k)); c = c.mul(t).add(coefficient(2 * k, k)); } (r.mul(s), c) } fn sin_cos_dd(x: f64) -> (Dd, Dd) { let (r, q) = reduce(x); let (s, c) = sin_cos_kernel(r); match q.rem_euclid(4) { 0 => (s, c), 1 => (c, s.neg()), 2 => (s.neg(), c.neg()), _ => (c.neg(), s), } } /// e^x, by e^x = 2^k e^r with |r| <= ln 2 / 2, and e^r as (e^(r/1024))^1024 from a Taylor series. fn exp_dd(x: Dd) -> Dd { if x.hi == 0.0 { return ONE; } let k = (x.hi * core::f64::consts::LOG2_E).round(); let r = x.sub(two_prod(k, LN2[0])).sub(two_prod(k, LN2[1])).sub(Dd::of(k * LN2[2])).scale(1.0 / 1024.0); // e^r - 1 = r (1 + r/2! + r^2/3! + ... + r^9/10!), |r| <= 3.4e-4. let mut p = Dd::bits(INV_FACT[10]); for n in (1..10).rev() { p = p.mul(r).add(Dd::bits(INV_FACT[n])); } let mut s = p.mul(r); // (1 + s)^2 - 1 = 2s + s^2, ten times. for _ in 0..10 { s = s.mul_f(2.0).add(s.mul(s)); } s.add(ONE).scale(power_of_two(k as i64)) } /// ln x for x > 0, by ln x = e ln 2 + 2 atanh((m - 1) / (m + 1)) with m in [sqrt(1/2), sqrt(2)]. fn ln_dd(x: f64) -> Dd { debug_assert!(x > 0.0 && x.is_finite()); let (x, mut e) = if x < f64::MIN_POSITIVE { (x * power_of_two(54), -54i64) } else { (x, 0i64) }; let bits = x.to_bits(); e += ((bits >> 52) & 0x7ff) as i64 - 1023; let mut m = f64::from_bits((bits & ((1u64 << 52) - 1)) | (1023u64 << 52)); if m > core::f64::consts::SQRT_2 { m *= 0.5; e += 1; } // m - 1 is exact for m in [1/2, 2]. let s = Dd::of(m - 1.0).div(two_sum(m, 1.0)); let t = s.mul(s); // atanh s = s (1 + t/3 + t^2/5 + ...), t <= 0.0295. let mut p = Dd::bits(INV_ODD[23]); for k in (0..23).rev() { p = p.mul(t).add(Dd::bits(INV_ODD[k])); } let ln_m = s.mul(p).scale(2.0); let ke = e as f64; two_prod(ke, LN2[0]).add(two_prod(ke, LN2[1])).add(Dd::of(ke * LN2[2])).add(ln_m) } fn pow_dd(x: f64, y: f64) -> Dd { debug_assert!(x >= 0.0); if y == 0.0 || x == 1.0 { return ONE; } if x == 0.0 { return Dd::of(if y > 0.0 { 0.0 } else { f64::INFINITY }); } exp_dd(ln_dd(x).mul_f(y)) } /// sin x, the same on every machine. pub fn sin(x: f64) -> f64 { if x == 0.0 { return x; } sin_cos_dd(x).0.hi } /// cos x, the same on every machine. pub fn cos(x: f64) -> f64 { sin_cos_dd(x).1.hi } /// tan x, the same on every machine. pub fn tan(x: f64) -> f64 { if x == 0.0 { return x; } let (s, c) = sin_cos_dd(x); s.div(c).hi } /// x^y for x >= 0, the same on every machine. pub fn pow(x: f64, y: f64) -> f64 { pow_dd(x, y).hi } /// sin x of an `f32`, rounded once to the nearest `f32`, the same on every machine. pub fn sinf(x: f32) -> f32 { if x == 0.0 { return x; } sin_cos_dd(f64::from(x)).0.to_f32() } /// x^y of `f32`s, x >= 0, rounded once to the nearest `f32`, the same on every machine. pub fn powf(x: f32, y: f32) -> f32 { pow_dd(f64::from(x), f64::from(y)).to_f32() } /// 2^(k/4), exactly the correctly rounded value: 2^floor(k/4) times one of four constants, for |k| up to about 4000. pub fn exp2_quarter(k: i32) -> f64 { QUARTERS[k.rem_euclid(4) as usize] * power_of_two(i64::from(k.div_euclid(4))) } ==== end of vendor-symphonia-core/src/dsp/portable.rs ==== ==== vendor-symphonia-bundle-mp3/src/layer3/hybrid_synthesis.rs ============== // Symphonia // Copyright (c) 2019-2022 The Project Symphonia Developers. // // This Source Code Form is subject to the terms of the Mozilla Public // License, v. 2.0. If a copy of the MPL was not distributed with this // file, You can obtain one at https://mozilla.org/MPL/2.0/. // Justification: Some loops are better expressed without a range loop. #![allow(clippy::needless_range_loop)] use crate::common::FrameHeader; use super::{common::*, GranuleChannel}; use std::{convert::TryInto, f64}; use lazy_static::lazy_static; use symphonia_core::dsp::portable; lazy_static! { /// Hybrid synthesesis IMDCT window coefficients for: Long, Start, Short, and End block, in that /// order. /// /// For long blocks: /// /// ```text /// W[ 0..36] = sin(PI/36.0 * (i + 0.5)) /// ``` /// /// For start blocks: /// /// ```text /// W[ 0..18] = sin(PI/36.0 * (i + 0.5)) /// W[18..24] = 1.0 /// W[24..30] = sin(PI/12.0 * ((i - 18) - 0.5)) /// W[30..36] = 0.0 /// ``` /// /// For short blocks (to be applied to each 12 sample window): /// /// ```text /// W[ 0..12] = sin(PI/12.0 * (i + 0.5)) /// W[12..36] = 0.0 /// ``` /// /// For end blocks: /// /// ```text /// W[ 0..6 ] = 0.0 /// W[ 6..12] = sin(PI/12.0 * ((i - 6) + 0.5)) /// W[12..18] = 1.0 /// W[18..36] = sin(PI/36.0 * (i + 0.5)) /// ``` static ref IMDCT_WINDOWS: [[f32; 36]; 4] = { const PI_36: f64 = f64::consts::PI / 36.0; const PI_12: f64 = f64::consts::PI / 12.0; let mut windows = [[0f32; 36]; 4]; // Window for Long blocks. for i in 0..36 { windows[0][i] = portable::sin(PI_36 * (i as f64 + 0.5)) as f32; } // Window for Start blocks (indicies 30..36 implictly 0.0). for i in 0..18 { windows[1][i] = portable::sin(PI_36 * (i as f64 + 0.5)) as f32; } for i in 18..24 { windows[1][i] = 1.0; } for i in 24..30 { windows[1][i] = portable::sin(PI_12 * ((i - 18) as f64 + 0.5)) as f32; } // Window for Short blocks. for i in 0..12 { windows[2][i] = portable::sin(PI_12 * (i as f64 + 0.5)) as f32; } // Window for End blocks (indicies 0..6 implicitly 0.0). for i in 6..12 { windows[3][i] = portable::sin(PI_12 * ((i - 6) as f64 + 0.5)) as f32; } for i in 12..18 { windows[3][i] = 1.0; } for i in 18..36 { windows[3][i] = portable::sin(PI_36 * (i as f64 + 0.5)) as f32; } windows }; } lazy_static! { /// Lookup table of cosine coefficients for half of a 12-point IMDCT. /// /// This table is derived from the general expression: /// /// ```text /// cos12[i][k] = cos(PI/24.0 * (2*i + 1 + N/2) * (2*k + 1)) /// ``` /// where: /// `N=12`, `i=N/4..3N/4`, and `k=0..N/2`. static ref IMDCT_HALF_COS_12: [[f32; 6]; 6] = { const PI_24: f64 = f64::consts::PI / 24.0; let mut cos = [[0f32; 6]; 6]; for (i, cos_i) in cos.iter_mut().enumerate() { for (k, cos_ik) in cos_i.iter_mut().enumerate() { // Only compute the middle half of the cosine lookup table (i offset by 3). let n = (2 * (i + 3) + (12 / 2) + 1) * (2 * k + 1); *cos_ik = portable::cos(PI_24 * n as f64) as f32; } } cos }; } lazy_static! { /// Pair of lookup tables, CS and CA, for alias reduction. /// /// As per ISO/IEC 11172-3, CS and CA are calculated as follows: /// /// ```text /// cs[i] = 1.0 / sqrt(1.0 + c[i]^2) /// ca[i] = c[i] / sqrt(1.0 + c[i]^2) /// ``` /// /// where: /// ```text /// c[i] = [ -0.6, -0.535, -0.33, -0.185, -0.095, -0.041, -0.0142, -0.0037 ] /// ``` static ref ANTIALIAS_CS_CA: ([f32; 8], [f32; 8]) = { const C: [f64; 8] = [ -0.6, -0.535, -0.33, -0.185, -0.095, -0.041, -0.0142, -0.0037 ]; let mut cs = [0f32; 8]; let mut ca = [0f32; 8]; for i in 0..8 { let sqrt = f64::sqrt(1.0 + (C[i] * C[i])); cs[i] = (1.0 / sqrt) as f32; ca[i] = (C[i] / sqrt) as f32; } (cs, ca) }; } /// Reorder samples that are part of short blocks into sub-band order. pub(super) fn reorder(header: &FrameHeader, channel: &mut GranuleChannel, buf: &mut [f32; 576]) { // Only short blocks are reordered. if let BlockType::Short { is_mixed } = channel.block_type { // Every short block is split into 3 equally sized windows as illustrated below (e.g. for // a short scale factor band with win_len=4): // // <- Window #1 -> <- Window #2 -> <- Window #3 -> // [ 0 | 1 | 2 | 3 ][ 4 | 5 | 6 | 7 ][ 8 | 9 | a | b ] // <----- 3 * Short Scale Factor Band Width -----> // // Reordering interleaves the samples of each window as follows: // // [ 0 | 4 | 8 | 1 | 5 | 9 | 2 | 6 | a | 3 | 7 | b ] // <---- 3 * Short Scale Factor Band Width ----> // // Basically, reordering interleaves the 3 windows the same way that 3 planar audio buffers // would be interleaved. debug_assert!(channel.rzero <= 576); // In mixed blocks, only the short bands can be re-ordered. Determine the applicable bands. let bands = if is_mixed { let switch = SFB_MIXED_SWITCH_POINT[header.sample_rate_idx]; &SFB_MIXED_BANDS[header.sample_rate_idx][switch..] } else { &SFB_SHORT_BANDS[header.sample_rate_idx] }; let mut reorder_buf = [0f32; 576]; let start = bands[0]; let mut i = start; for (((s0, s1), s2), s3) in bands.iter().zip(&bands[1..]).zip(&bands[2..]).zip(&bands[3..]).step_by(3) { // Do not reorder short blocks that begin after the rzero partition boundary since // they're zeroed. if *s0 >= channel.rzero { break; } // The three short sample windows. let win0 = &buf[*s0..*s1]; let win1 = &buf[*s1..*s2]; let win2 = &buf[*s2..*s3]; // Interleave the three short sample windows. for ((w0, w1), w2) in win0.iter().zip(win1).zip(win2) { reorder_buf[i + 0] = *w0; reorder_buf[i + 1] = *w1; reorder_buf[i + 2] = *w2; i += 3; } } // Copy reordered samples from the reorder buffer to the actual sample buffer. buf[start..i].copy_from_slice(&reorder_buf[start..i]); // After reordering, the start of the rzero partition may no longer be valid. Update it. channel.rzero = channel.rzero.max(i); } } /// Applies the anti-aliasing filter to sub-bands that are not part of short blocks. pub(super) fn antialias(channel: &mut GranuleChannel, samples: &mut [f32; 576]) { // The maximum number of sub-bands to anti-alias depends on block type. let sb_limit = match channel.block_type { // Short blocks are never anti-aliased. BlockType::Short { is_mixed: false } => return, // Mixed blocks have a long block span the first 36 samples (2 sub-bands). Therefore, only // anti-alias these two sub-bands. BlockType::Short { is_mixed: true } => 2, // All other block types require all 32 sub-bands to be anti-aliased. _ => 32, }; // Amortize the lazy_static fetch over the entire anti-aliasing operation. let (cs, ca): &([f32; 8], [f32; 8]) = &ANTIALIAS_CS_CA; // The sub-band that intersects the start of the rzero partition. All sub-bands after this one // are zeroed and do-not need anti-aliasing. let sb_rzero = channel.rzero / 18; // The anti-aliasing filter must be applied up-to the last non-zero sub-band. After // anti-aliasing, the first zeroed sub-band may have non-zero values "smeared" into it. // Therefore, the rzero must be updated. channel.rzero = 18 * sb_limit.min(sb_rzero + 2).min(32); // Anti-aliasing is performed using 8 butterfly calculations at the boundaries of ADJACENT // sub-bands. For each calculation, there are two samples: lower and upper. For each iteration, // the lower sample index advances backwards from the boundary, while the upper sample index // advances forward from the boundary. // // For example, let B(li, ui) represent the butterfly calculation where li and ui are the // indicies of the lower and upper samples respectively. If j is the index of the first sample // of a sub-band, then the iterations are as follows: // // B(j-1,j), B(j-2,j+1), B(j-3,j+2), B(j-4,j+3), B(j-5,j+4), B(j-6,j+5), B(j-7,j+6), B(j-8,j+7) // // The butterfly calculation itself can be illustrated as follows: // // * cs[i] // l0 -------o------(-)------> l1 // \ / l1 = l0 * cs[i] - u0 * ca[i] // \ / * ca[i] u1 = u0 * cs[i] + l0 * ca[i] // \ // / \ * ca[i] where: // / \ cs[i], ca[i] are constant values for iteration i, // u0 ------o------(+)-------> u1 derived from table B.9 of ISO/IEC 11172-3. // * cs[i] // // Note that all butterfly calculations only involve two samples, and all iterations are // independant of each other. This lends itself well for SIMD processing. for sb in (18..channel.rzero).step_by(18) { for i in 0..8 { let li = sb - 1 - i; let ui = sb + i; let lower = samples[li]; let upper = samples[ui]; samples[li] = lower * cs[i] - upper * ca[i]; samples[ui] = upper * cs[i] + lower * ca[i]; } } } /// Performs hybrid synthesis (IMDCT and windowing). pub(super) fn hybrid_synthesis( channel: &GranuleChannel, overlap: &mut [[f32; 18]; 32], samples: &mut [f32; 576], ) { // The first sub-band after the rzero partition boundary is the sub-band limit. All sub-bands // past this are zeroed. let sb_limit = (channel.rzero + 17) / 18; // Determine the split point of long and short blocks in terms of a sub-band index. // // Short blocks process 0 sub-bands as long blocks, mixed blocks process the first 2 sub-bands // as long blocks, and all other block types (long, start, end) process all 32 sub-bands as long // blocks. let sb_split = match channel.block_type { BlockType::Short { is_mixed: false } => 0, BlockType::Short { is_mixed: true } => 2, _ => 32, }; // If the split point is not 0, then some sub-bands need to be processed as long blocks using // the 36-point IMDCT. if sb_split > 0 { // Select the appropriate window given the block type. let window: &[f32; 36] = match channel.block_type { BlockType::Start => &IMDCT_WINDOWS[1], BlockType::End => &IMDCT_WINDOWS[3], _ => &IMDCT_WINDOWS[0], }; let sb_long_end = sb_split.min(sb_limit); // For each of the sub-bands (18 samples each) in the long block... for sb in 0..sb_long_end { let start = 18 * sb; // Casting to a slice of a known-size lets the compiler elide bounds checks. let sub_band: &mut [f32; 18] = (&mut samples[start..(start + 18)]).try_into().unwrap(); // Perform the 36-point on the entire sub-band. imdct36::imdct36(sub_band, window, &mut overlap[sb]); } } // If the split point is less-than 32, then some sub-bands need to be processed as short blocks // using the 12-point IMDCT on each of the three windows. if sb_split < 32 { // Select the short block window. let window: &[f32; 36] = &IMDCT_WINDOWS[2]; let sb_short_begin = sb_split.min(sb_limit); // For each of the sub-bands (18 samples each) in the short block... for sb in sb_short_begin..sb_limit { let start = 18 * sb; // Casting to a slice of a known-size lets the compiler elide bounds checks. let sub_band: &mut [f32; 18] = (&mut samples[start..(start + 18)]).try_into().unwrap(); // Perform the 12-point IMDCT on each of the 3 short windows within the sub-band (6 // samples each). imdct12_win(sub_band, window, &mut overlap[sb]); } } // Every sub-band after the the sub-band limit are zeroed, however, the overlap for that // sub-band may be non-zero. Therefore, copy it over. for sb in sb_limit..32 { let start = 18 * sb; let sub_band: &mut [f32; 18] = (&mut samples[start..(start + 18)]).try_into().unwrap(); sub_band.copy_from_slice(&overlap[sb]); overlap[sb].fill(0.0); } } /// Performs the 12-point IMDCT, and windowing for each of the 3 short windows of a short block, and /// then overlap-adds the result. fn imdct12_win(x: &mut [f32; 18], window: &[f32; 36], overlap: &mut [f32; 18]) { let cos12: &[[f32; 6]; 6] = &IMDCT_HALF_COS_12; let mut tmp = [0.0; 36]; for w in 0..3 { for i in 0..3 { // Compute the 12-point IMDCT for each of the 3 short windows using a half-size IMDCT // followed by post-processing. // // In general, the IMDCT is defined as: // // (N/2)-1 // y[i] = SUM { x[k] * cos(PI/2N * (2i + 1 + N/2) * (2k + 1)) } // k=0 // // For N=12, the IMDCT becomes: // // 5 // y[i] = SUM { x[k] * cos(PI/24 * (2i + 7) * (2k + 1)) } // k=0 // // The cosine twiddle factors are easily indexable by i and k, and are therefore // pre-computed and placed into a look-up table. // // Further, y[3..0] = -y[3..6], and y[12..9] = y[6..9] which reduces the amount of work // by half. // // Therefore, it is possible to split the half-size IMDCT computation into two halves. // In the calculations below, yl is the left-half output of the half-size IMDCT, and yr // is the right-half. let yl = (x[w] * cos12[i][0]) + (x[3 * 1 + w] * cos12[i][1]) + (x[3 * 2 + w] * cos12[i][2]) + (x[3 * 3 + w] * cos12[i][3]) + (x[3 * 4 + w] * cos12[i][4]) + (x[3 * 5 + w] * cos12[i][5]); let yr = (x[w] * cos12[i + 3][0]) + (x[3 * 1 + w] * cos12[i + 3][1]) + (x[3 * 2 + w] * cos12[i + 3][2]) + (x[3 * 3 + w] * cos12[i + 3][3]) + (x[3 * 4 + w] * cos12[i + 3][4]) + (x[3 * 5 + w] * cos12[i + 3][5]); // Each adjacent 12-point IMDCT windows are overlapped and added in the output, with the // first and last 6 samples of the output always being 0. // // Each sample from the 12-point IMDCT is multiplied by the appropriate window function // as specified in ISO/IEC 11172-3. The values of the window function are pre-computed // and given by window[0..12]. // // Since there are 3 IMDCT windows (indexed by w), y[0..12] is computed 3 times. // For the purpose of the diagram below, we label these IMDCT windows as: y0[0..12], // y1[0..12], and y2[0..12], for IMDCT windows 0..3 respectively. // // Therefore, the overlap-and-add operation can be visualized as below: // // 0 6 12 18 24 30 36 // +-------------+------------+------------+------------+------------+-------------+ // | 0 | y0[..6] | y0[..6] | y1[6..] | y2[6..] | 0 | // | (6) | | + y1[6..] | + y2[..6] | | (6) | // +-------------+------------+------------+------------+------------+-------------+ // . . . . . . . // . +-------------------------+ . . . // . | IMDCT #1 (y0) | . . . // . +-------------------------+ . . . // . . +-------------------------+ . . // . . | IMDCT #2 (y1) | . . // . . +-------------------------+ . . // . . . +-------------------------+ . // . . . | IMDCT #3 (y2) | . // . . . +-------------------------+ . // . . . . . . . // // Since the 12-point IMDCT was decomposed into a half-size IMDCT and post-processing // operations, and further split into left and right halves, each iteration of this loop // produces 4 output samples. tmp[6 + 6 * w + 3 - i - 1] += -yl * window[3 - i - 1]; tmp[6 + 6 * w + i + 3] += yl * window[i + 3]; tmp[6 + 6 * w + i + 6] += yr * window[i + 6]; tmp[6 + 6 * w + 12 - i - 1] += yr * window[12 - i - 1]; } } // Overlap-add. for i in 0..18 { x[i] = tmp[i] + overlap[i]; overlap[i] = tmp[i + 18]; } } /// Inverts odd samples in odd sub-bands. pub fn frequency_inversion(samples: &mut [f32; 576]) { // There are 32 sub-bands spanning 576 samples: // // 0 18 36 54 72 90 108 558 576 // +-----+-----+-----+-----+-----+-----+ . . . . +------+ // s[i] = | sb0 | sb1 | sb2 | sb3 | sb4 | sb5 | . . . . | sb31 | // +-----+-----+-----+-----+-----+-----+ . . . . +------+ // // The odd sub-bands are thusly: // // sb1 -> s[ 18.. 36] // sb3 -> s[ 54.. 72] // sb5 -> s[ 90..108] // ... // sb31 -> s[558..576] // // Each odd sample in the aforementioned sub-bands must be negated. for i in (18..576).step_by(36) { // Sample negation is unrolled into a 2x4 + 1 (9) operation to improve vectorization. for j in (i..i + 16).step_by(8) { samples[j + 1] = -samples[j + 1]; samples[j + 3] = -samples[j + 3]; samples[j + 5] = -samples[j + 5]; samples[j + 7] = -samples[j + 7]; } samples[i + 18 - 1] = -samples[i + 18 - 1]; } } #[cfg(test)] mod tests { use super::imdct12_win; use super::IMDCT_WINDOWS; use std::f64; fn imdct12_analytical(x: &[f32; 6]) -> [f32; 12] { const PI_24: f64 = f64::consts::PI / 24.0; let mut result = [0f32; 12]; for i in 0..12 { let mut sum = 0.0; for k in 0..6 { sum += (x[k] as f64) * (PI_24 * ((2 * i + (12 / 2) + 1) * (2 * k + 1)) as f64).cos(); } result[i] = sum as f32; } result } #[test] fn verify_imdct12_win() { const TEST_VECTOR: [f32; 18] = [ 0.0976, 0.9321, 0.6138, 0.0857, 0.0433, 0.4855, 0.2144, 0.8488, // 0.6889, 0.2983, 0.1957, 0.7037, 0.0052, 0.0197, 0.3188, 0.5123, // 0.2994, 0.7157, ]; let window = &IMDCT_WINDOWS[2]; let mut actual = TEST_VECTOR; let mut overlap = [0.0; 18]; imdct12_win(&mut actual, window, &mut overlap); // The following block performs 3 analytical 12-point IMDCTs over the test vector, and then // windows and overlaps the results to generate the final result. let expected = { let mut expected = [0f32; 36]; let mut x0 = [0f32; 6]; let mut x1 = [0f32; 6]; let mut x2 = [0f32; 6]; for i in 0..6 { x0[i] = TEST_VECTOR[3 * i + 0]; x1[i] = TEST_VECTOR[3 * i + 1]; x2[i] = TEST_VECTOR[3 * i + 2]; } let imdct0 = imdct12_analytical(&x0); let imdct1 = imdct12_analytical(&x1); let imdct2 = imdct12_analytical(&x2); for i in 0..12 { expected[6 + i] += imdct0[i] * window[i]; expected[12 + i] += imdct1[i] * window[i]; expected[18 + i] += imdct2[i] * window[i]; } expected }; for i in 0..18 { assert!((expected[i] - actual[i]).abs() < 0.00001); assert!((expected[i + 18] - overlap[i]).abs() < 0.00001); } } } mod imdct36 { /// Performs an Inverse Modified Discrete Cosine Transform (IMDCT) transforming 18 /// frequency-domain input samples, into 36 time-domain output samples. /// /// This is a straight-forward implementation of the IMDCT using Szu-Wei Lee's algorithm /// published in article [1]. /// /// [1] Szu-Wei Lee, "Improved algorithm for efficient computation of the forward and backward /// MDCT in MPEG audio coder", IEEE Transactions on Circuits and Systems II: Analog and Digital /// Signal Processing, vol. 48, no. 10, pp. 990-994, 2001. /// /// https://ieeexplore.ieee.org/document/974789 pub fn imdct36(x: &mut [f32; 18], window: &[f32; 36], overlap: &mut [f32; 18]) { let mut dct = [0f32; 18]; dct_iv(x, &mut dct); // Mapping of DCT-IV to IMDCT // // 0 9 27 36 // +------------+------------------------+------------+ // | dct[9..18] | -dct[0..18].rev() | -dct[0..9] | // +------------+------------------------+------------+ // // where dct[] is the DCT-IV of x. // First 9 IMDCT values are values 9..18 in the DCT-IV. for i in 0..9 { x[i] = overlap[i] + dct[9 + i] * window[i]; } // Next 18 IMDCT values are negated and /reversed/ values 0..18 in the DCT-IV. for i in 9..18 { x[i] = overlap[i] - dct[27 - i - 1] * window[i]; } for i in 18..27 { overlap[i - 18] = -dct[27 - i - 1] * window[i]; } // Last 9 IMDCT values are negated values 0..9 in the DCT-IV. for i in 27..36 { overlap[i - 18] = -dct[i - 27] * window[i]; } } /// Continutation of `imdct36`. /// /// Step 2: Mapping N/2-point DCT-IV to N/2-point SDCT-II. fn dct_iv(x: &[f32; 18], y: &mut [f32; 18]) { // Scale factors for input samples. Computed from (16). // 2 * cos(PI * (2*m + 1) / (2*36) const SCALE: [f32; 18] = [ 1.998_096_443_163_715_6, // m=0 1.982_889_722_747_620_8, // m=1 1.952_592_014_239_866_7, // m=2 1.907_433_901_496_453_9, // m=3 1.847_759_065_022_573_5, // m=4 1.774_021_666_356_443_4, // m=5 1.686_782_891_625_771_4, // m=6 1.586_706_680_582_470_6, // m=7 1.474_554_673_620_247_9, // m=8 1.351_180_415_231_320_7, // m=9 1.217_522_858_017_441_3, // m=10 1.074_599_216_693_647_8, // m=11 0.923_497_226_470_067_7, // m=12 0.765_366_864_730_179_7, // m=13 0.601_411_599_008_546_1, // m=14 0.432_879_227_876_205_8, // m=15 0.261_052_384_440_103_0, // m=16 0.087_238_774_730_672_0, // m=17 ]; let samples = [ SCALE[0] * x[0], SCALE[1] * x[1], SCALE[2] * x[2], SCALE[3] * x[3], SCALE[4] * x[4], SCALE[5] * x[5], SCALE[6] * x[6], SCALE[7] * x[7], SCALE[8] * x[8], SCALE[9] * x[9], SCALE[10] * x[10], SCALE[11] * x[11], SCALE[12] * x[12], SCALE[13] * x[13], SCALE[14] * x[14], SCALE[15] * x[15], SCALE[16] * x[16], SCALE[17] * x[17], ]; sdct_ii_18(&samples, y); y[0] /= 2.0; for i in 1..17 { y[i] = (y[i] / 2.0) - y[i - 1]; } y[17] = (y[17] / 2.0) - y[16]; } /// Continutation of `imdct36`. /// /// Step 3: Decompose N/2-point SDCT-II into two N/4-point SDCT-IIs. fn sdct_ii_18(x: &[f32; 18], y: &mut [f32; 18]) { // Scale factors for odd input samples. Computed from (23). // 2 * cos(PI * (2*m + 1) / 36) const SCALE: [f32; 9] = [ 1.992_389_396_183_491_1, // m=0 1.931_851_652_578_136_6, // m=1 1.812_615_574_073_299_9, // m=2 1.638_304_088_577_983_6, // m=3 std::f32::consts::SQRT_2, // m=4 1.147_152_872_702_092_3, // m=5 0.845_236_523_481_398_9, // m=6 0.517_638_090_205_041_9, // m=7 0.174_311_485_495_316_3, // m=8 ]; let even = [ x[0] + x[18 - 1], x[1] + x[18 - 2], x[2] + x[18 - 3], x[3] + x[18 - 4], x[4] + x[18 - 5], x[5] + x[18 - 6], x[6] + x[18 - 7], x[7] + x[18 - 8], x[8] + x[18 - 9], ]; sdct_ii_9(&even, y); let odd = [ SCALE[0] * (x[0] - x[18 - 1]), SCALE[1] * (x[1] - x[18 - 2]), SCALE[2] * (x[2] - x[18 - 3]), SCALE[3] * (x[3] - x[18 - 4]), SCALE[4] * (x[4] - x[18 - 5]), SCALE[5] * (x[5] - x[18 - 6]), SCALE[6] * (x[6] - x[18 - 7]), SCALE[7] * (x[7] - x[18 - 8]), SCALE[8] * (x[8] - x[18 - 9]), ]; sdct_ii_9(&odd, &mut y[1..]); y[3] -= y[3 - 2]; y[5] -= y[5 - 2]; y[7] -= y[7 - 2]; y[9] -= y[9 - 2]; y[11] -= y[11 - 2]; y[13] -= y[13 - 2]; y[15] -= y[15 - 2]; y[17] -= y[17 - 2]; } /// Continutation of `imdct36`. /// /// Step 4: Computation of 9-point (N/4) SDCT-II. fn sdct_ii_9(x: &[f32; 9], y: &mut [f32]) { const D: [f32; 7] = [ -1.732_050_807_568_877_2, // -sqrt(3.0) 1.879_385_241_571_816_6, // -2.0 * cos(8.0 * PI / 9.0) -0.347_296_355_333_860_8, // -2.0 * cos(4.0 * PI / 9.0) -1.532_088_886_237_956_0, // -2.0 * cos(2.0 * PI / 9.0) -0.684_040_286_651_337_8, // -2.0 * sin(8.0 * PI / 9.0) -1.969_615_506_024_416_0, // -2.0 * sin(4.0 * PI / 9.0) -1.285_575_219_373_078_5, // -2.0 * sin(2.0 * PI / 9.0) ]; let a01 = x[3] + x[5]; let a02 = x[3] - x[5]; let a03 = x[6] + x[2]; let a04 = x[6] - x[2]; let a05 = x[1] + x[7]; let a06 = x[1] - x[7]; let a07 = x[8] + x[0]; let a08 = x[8] - x[0]; let a09 = x[4] + a05; let a10 = a01 + a03; let a11 = a10 + a07; let a12 = a03 - a07; let a13 = a01 - a07; let a14 = a01 - a03; let a15 = a02 - a04; let a16 = a15 + a08; let a17 = a04 + a08; let a18 = a02 - a08; let a19 = a02 + a04; let a20 = 2.0 * x[4] - a05; let m1 = D[0] * a06; let m2 = D[1] * a12; let m3 = D[2] * a13; let m4 = D[3] * a14; let m5 = D[0] * a16; let m6 = D[4] * a17; let m7 = D[5] * a18; // Note: the cited paper has an error, a1 should be a18. let m8 = D[6] * a19; let a21 = a20 + m2; let a22 = a20 - m2; let a23 = a20 + m3; let a24 = m1 + m6; let a25 = m1 - m6; let a26 = m1 + m7; y[0] = a09 + a11; y[2] = m8 - a26; y[4] = m4 - a21; y[6] = m5; y[8] = a22 - m3; y[10] = a25 - m7; y[12] = a11 - 2.0 * a09; y[14] = a24 + m8; y[16] = a23 + m4; } #[cfg(test)] mod tests { use super::imdct36; use std::f64; fn imdct36_analytical(x: &[f32; 18]) -> [f32; 36] { let mut result = [0f32; 36]; const PI_72: f64 = f64::consts::PI / 72.0; for i in 0..36 { let mut sum = 0.0; for j in 0..18 { sum += (x[j] as f64) * (PI_72 * (((2 * i) + 1 + 18) * ((2 * j) + 1)) as f64).cos(); } result[i] = sum as f32; } result } #[test] fn verify_imdct36() { const TEST_VECTOR: [f32; 18] = [ 0.0976, 0.9321, 0.6138, 0.0857, 0.0433, 0.4855, 0.2144, 0.8488, // 0.6889, 0.2983, 0.1957, 0.7037, 0.0052, 0.0197, 0.3188, 0.5123, // 0.2994, 0.7157, ]; const WINDOW: [f32; 36] = [1.0; 36]; let mut actual = TEST_VECTOR; let mut overlap = [0.0; 18]; imdct36(&mut actual, &WINDOW, &mut overlap); let expected = imdct36_analytical(&TEST_VECTOR); for i in 0..18 { assert!((expected[i] - actual[i]).abs() < 0.00001); assert!((expected[i + 18] - overlap[i]).abs() < 0.00001); } } } } ==== end of vendor-symphonia-bundle-mp3/src/layer3/hybrid_synthesis.rs ==== ==== vendor-symphonia-bundle-mp3/src/layer3/requantize.rs ==================== // Symphonia // Copyright (c) 2019-2022 The Project Symphonia Developers. // // This Source Code Form is subject to the terms of the Mozilla Public // License, v. 2.0. If a copy of the MPL was not distributed with this // file, You can obtain one at https://mozilla.org/MPL/2.0/. use symphonia_core::errors::Result; use symphonia_core::io::ReadBitsLtr; use crate::common::FrameHeader; use super::{codebooks, common::*, GranuleChannel}; use std::cmp::min; use std::f32; use lazy_static::lazy_static; use symphonia_core::dsp::portable; use log::debug; lazy_static! { /// Lookup table for computing x(i) = s(i)^(4/3) where s(i) is a decoded Huffman sample. The /// value of s(i) is bound between 0..8207. static ref REQUANTIZE_POW43: [f32; 8207] = { // It is wasteful to initialize to 0.. however, Symphonia policy is to limit unsafe code to // only symphonia-core. // // TODO: Implement generic lookup table initialization in the core library. let mut pow43 = [0f32; 8207]; for (i, pow43) in pow43.iter_mut().enumerate() { *pow43 = portable::powf(i as f32, 4.0 / 3.0); } pow43 }; } /// Zero a sample buffer. #[inline(always)] pub(super) fn zero(buf: &mut [f32; 576]) { buf.fill(0.0); } /// Reads the Huffman coded spectral samples for a given channel in a granule from a `BitStream` /// into a provided sample buffer. Returns the number of decoded samples (the starting index of the /// rzero partition). /// /// Note, each spectral sample is raised to the (4/3)-rd power. This is not actually part of the /// Huffman decoding process, but, by converting the integer sample to floating point here we don't /// need to do pointless casting or use an extra buffer. pub(super) fn read_huffman_samples( bs: &mut B, channel: &GranuleChannel, part3_bits: u32, buf: &mut [f32; 576], ) -> Result { // If there are no Huffman code bits, zero all samples and return immediately. if part3_bits == 0 { buf.fill(0.0); return Ok(0); } // Dereference the POW43 table once per granule since there is a tiny overhead each time a // lazy_static is dereferenced that should be amortized over as many samples as possible. let pow43_table: &[f32; 8207] = &REQUANTIZE_POW43; let mut bits_read = 0; let mut i = 0; // There are two samples per big_value, therefore multiply big_values by 2 to get number of // samples in the big_value partition. let big_values_len = 2 * channel.big_values as usize; // There are up-to 3 regions in the big_value partition. Determine the sample index denoting the // end of each region (non-inclusive). Clamp to the end of the big_values partition. let regions: [usize; 3] = [ min(channel.region1_start, big_values_len), min(channel.region2_start, big_values_len), min(576, big_values_len), ]; // Iterate over each region in big_values. for (region_idx, region_end) in regions.iter().enumerate() { // Select the Huffman table based on the region's table select value. let table_select = channel.table_select[region_idx] as usize; // Tables 0..16 are all unique, while tables 16..24 and 24..32 each use one table but // differ in the number of linbits to use. let codebook = match table_select { 0..=15 => &codebooks::CODEBOOK_TABLES[table_select], 16..=23 => &codebooks::CODEBOOK_TABLES[16], 24..=31 => &codebooks::CODEBOOK_TABLES[17], _ => unreachable!(), }; let linbits = codebooks::CODEBOOK_LINBITS[table_select]; // If the table for a region is empty, fill the region with zeros and move on to the next // region. if codebook.is_empty() { while i < *region_end { buf[i] = 0.0; i += 1; buf[i] = 0.0; i += 1; } continue; } // Otherwise, read the big_values. while i < *region_end && bits_read < part3_bits { // Decode the next Huffman code. let (value, code_len) = bs.read_codebook(codebook)?; bits_read += code_len; // In the big_values partition, each Huffman code decodes to two sample, x and y. Each // sample being 4-bits long. let mut x = (value >> 4) as usize; let mut y = (value & 0xf) as usize; // If the first sample, x, is not 0, further process it. if x > 0 { // If x is saturated (it is at the maximum possible value), and the table specifies // linbits, then read linbits more bits and add it to the sample. if x == 15 && linbits > 0 { x += bs.read_bits_leq32(linbits)? as usize; bits_read += linbits; } // The next bit is the sign bit. If the sign bit is 1, then the sample should be // negative. The value of the sample is raised to the (4/3) power. buf[i] = (1.0 - 2.0 * bs.read_bit()? as f32) * pow43_table[x]; bits_read += 1; } else { buf[i] = 0.0; } i += 1; // Likewise, repeat the previous two steps for the second sample, y. if y > 0 { if y == 15 && linbits > 0 { y += bs.read_bits_leq32(linbits)? as usize; bits_read += linbits; } buf[i] = (1.0 - 2.0 * bs.read_bit()? as f32) * pow43_table[y]; bits_read += 1; } else { buf[i] = 0.0; } i += 1; } } let count1_codebook = &codebooks::QUADS_CODEBOOK_TABLE[usize::from(channel.count1table_select)]; // Read the count1 partition. while i <= 572 && bits_read < part3_bits { // In the count1 partition, each Huffman code decodes to 4 samples: v, w, x, and y. // Each sample is 1-bit long (1 or 0). // // For each 1-bit sample, if it is 0, then the dequantized sample value is 0 as well. If // the 1-bit sample is 1, then a sign bit is read. The dequantized sample is then either // +/-1.0 depending on the sign bit. // Decode the next Huffman code. let (value, code_len) = bs.read_codebook(count1_codebook)?; bits_read += code_len; // The first 4 bits indicate if a sample if 0 or 1. Count the number of samples with a // non-zero value. let num_ones = (value & 0xf).count_ones(); // Read the sign bits for each non-zero sample in a single read. let mut signs = bs.read_bits_leq32(num_ones)?; bits_read += num_ones; // Unpack the samples. if value & 0x1 != 0 { buf[i + 3] = 1.0 - 2.0 * (signs & 1) as f32; signs >>= 1; } else { buf[i + 3] = 0.0; } if value & 0x2 != 0 { buf[i + 2] = 1.0 - 2.0 * (signs & 1) as f32; signs >>= 1; } else { buf[i + 2] = 0.0; } if value & 0x4 != 0 { buf[i + 1] = 1.0 - 2.0 * (signs & 1) as f32; signs >>= 1; } else { buf[i + 1] = 0.0; } if value & 0x8 != 0 { buf[i + 0] = 1.0 - 2.0 * (signs & 1) as f32; } else { buf[i + 0] = 0.0; } i += 4; } // Ignore any extra "stuffing" bits. if bits_read < part3_bits { bs.ignore_bits(part3_bits - bits_read)?; } // Word on the street is that some encoders are poor at "stuffing" bits, resulting in part3_len // being ever so slightly too large. This causes the Huffman decode loop to decode the next few // bits as spectral samples. However, these bits are actually random data and are not real // samples, therefore, undo them! The caller will be reponsible for re-aligning the bitstream // reader. Candy Pop confirms this. else if bits_read > part3_bits && i > big_values_len { debug!("count1 overrun, malformed bitstream"); i -= 4; } else if bits_read > part3_bits { // It seems that most other decoders don't undo overruns of the big values. We'll just print // a message for now. debug!("big_values overrun, malformed bitstream"); } // The final partition after the count1 partition is the rzero partition. Samples in this // partition are all 0. buf[i..].fill(0.0); Ok(i) } /// Requantize long block samples in `buf`. fn requantize_long(channel: &GranuleChannel, bands: &[usize], buf: &mut [f32; 576]) { // For long blocks dequantization and scaling is governed by the following equation: // // xr(i) = s(i)^(4/3) * 2^(0.25*A) * 2^(-B) // where: // s(i) is the decoded Huffman sample // xr(i) is the dequantized sample // and: // A = global_gain[gr] - 210 // B = scalefac_multiplier * (scalefacs[gr][ch][sfb] + (preflag[gr] * pretab[sfb])) // // Note: The samples in buf are the result of s(i)^(4/3) for each sample i. debug_assert!(bands.len() <= 23); // The preemphasis table is from table B.6 in ISO/IEC 11172-3. const PRE_EMPHASIS: [u8; 22] = [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 2, 2, 3, 3, 3, 2, 0]; // Calculate A, it is constant for the entire requantization. let a = i32::from(channel.global_gain) - 210; let scalefac_shift = if channel.scalefac_scale { 2 } else { 1 }; // Requantize each scale-factor band in buf. for (i, (start, end)) in bands.iter().zip(&bands[1..]).enumerate() { // Do not requantize bands starting after the rzero sample since all samples from there on // are 0. if *start >= channel.rzero { break; } // Lookup the pre-emphasis amount if required. let pre_emphasis = if channel.preflag { PRE_EMPHASIS[i] } else { 0 }; // Calculate B. let b = i32::from((channel.scalefacs[i] + pre_emphasis) << scalefac_shift); // Calculate 2^(0.25*A) * 2^(-B). This can be rewritten as 2^{ 0.25 * (A - 4 * B) }. // Since scalefac_shift was multiplies by 4 above, the final equation becomes // 2^{ 0.25 * (A - B) }. let pow2ab = portable::exp2_quarter(a - b) as f32; // Calculate the ending sample index for the scale-factor band, clamping it to the length of // the sample buffer. let band_end = min(*end, channel.rzero); // The sample buffer contains s(i)^(4/3), now multiply in 2^(0.25*A) * 2^(-B) to get xr(i). for sample in &mut buf[*start..band_end] { *sample *= pow2ab; } } } /// Requantize short block samples in `buf` starting at scale-factor band `sfb_init`. fn requantize_short( channel: &GranuleChannel, bands: &[usize], switch: usize, buf: &mut [f32; 576], ) { // For short blocks dequantization and scaling is governed by the following equation: // // xr(i) = s(i)^(4/3) * 2^(0.25*A) * 2^(-B) // where: // s(i) is the decoded Huffman sample // xr(i) is the dequantized sample // and: // A = global_gain[gr] - 210 - (8 * subblock_gain[gr][win]) // B = scalefac_multiplier * scalefacs[gr][ch][sfb][win] // // Note: The samples in buf are the result of s(i)^(4/3) for each sample i. debug_assert!(bands.len() <= 40); // Calculate the window-independant part of A: global_gain[gr] - 210. let gain = i32::from(channel.global_gain) - 210; // Calculate A for each window. let a = [ gain - 8 * i32::from(channel.subblock_gain[0]), gain - 8 * i32::from(channel.subblock_gain[1]), gain - 8 * i32::from(channel.subblock_gain[2]), ]; // Likweise, the scalefac_multiplier is constant for the granule. The actual scale is multiplied // by 4 to combine the two pow2 operations into one by adding the exponents. The sum of the // exponent is multiplied by 0.25 so B must be multiplied by 4 to counter the quartering. A // bitshift operation is used for the actual multiplication, so scalefac_multiplier is named // scalefac_shift in this case. let scalefac_shift = if channel.scalefac_scale { 2 } else { 1 }; for (i, (start, end)) in bands.iter().zip(&bands[1..]).enumerate() { // Do not requantize bands starting after the rzero sample since all samples from there on // are 0. if *start >= channel.rzero { break; } // Calculate B. let b = i32::from(channel.scalefacs[switch + i] << scalefac_shift); // Calculate 2^(0.25*A) * 2^(-B). This can be rewritten as 2^{ 0.25 * (A - 4 * B) }. // Since scalefac_shift multiplies by 4 above, the final equation becomes // 2^{ 0.25 * (A - B) }. let pow2ab = portable::exp2_quarter(a[i % 3] - b) as f32; // Clamp the ending sample index to the rzero sample index. Since samples starting from // rzero are 0, there is no point in requantizing them. let win_end = min(*end, channel.rzero); // The sample buffer contains s(i)^(4/3), now multiply in 2^(0.25*A) * 2^(-B) to get // xr(i). for sample in &mut buf[*start..win_end] { *sample *= pow2ab; } } } /// Requantize samples in `buf` regardless of block type. pub(super) fn requantize(header: &FrameHeader, channel: &GranuleChannel, buf: &mut [f32; 576]) { match channel.block_type { BlockType::Short { is_mixed: false } => { requantize_short(channel, &SFB_SHORT_BANDS[header.sample_rate_idx], 0, buf); } BlockType::Short { is_mixed: true } => { // A mixed block is a combination of a long block and short blocks. The first few scale // factor bands, and thus samples, belong to a single long block, while the remaining // bands and samples belong to short blocks. Therefore, requantization for mixed blocks // can be decomposed into short and long block requantizations. // // As per ISO/IEC 11172-3, the short scale factor band at which the long block ends and // the short blocks begin is denoted by switch_point_s. let bands = SFB_MIXED_BANDS[header.sample_rate_idx]; let switch = SFB_MIXED_SWITCH_POINT[header.sample_rate_idx]; requantize_long(channel, &bands[..switch], buf); requantize_short(channel, &bands[switch..], switch, buf); } _ => { requantize_long(channel, &SFB_LONG_BANDS[header.sample_rate_idx], buf); } } } ==== end of vendor-symphonia-bundle-mp3/src/layer3/requantize.rs ==== ==== vendor-symphonia-bundle-mp3/src/layer3/stereo.rs ======================== // Symphonia // Copyright (c) 2019-2022 The Project Symphonia Developers. // // This Source Code Form is subject to the terms of the Mozilla Public // License, v. 2.0. If a copy of the MPL was not distributed with this // file, You can obtain one at https://mozilla.org/MPL/2.0/. use symphonia_core::errors::{decode_error, Result}; use crate::common::{ChannelMode, FrameHeader, Mode}; use super::{common::*, Granule}; use std::cmp::max; use std::{f32, f64}; use lazy_static::lazy_static; use symphonia_core::dsp::portable; /// The invalid intensity position for MPEG1 bitstreams. const INTENSITY_INV_POS_MPEG1: u8 = 7; /// The invalid intensity position for MPEG2 and MPEG2.5 bitstreams. /// /// NOTE: Some decoders also consider 7 to be an invalid intensity position in MPEG2 and MPEG2.5. /// However, this appears wrong. According to the standard, the /maximum/ value for the intensity /// position is considered invalid. For MPEG1, since the intensity ratios are only specified for /// is_pos < 7. For MPEG2 the ratios are specified for is_pos < 31. Therefore, it doesn't make sense /// to consider is_pos == 7 invalid for MPEG2 or 2.5. const INTENSITY_INV_POS_MPEG2: u8 = 31; lazy_static! { /// (Left, right) channel coefficients for decoding intensity stereo in MPEG2 bitstreams. /// /// These coefficients are derived from section 2.4.3.2 of ISO/IEC 13818-3. /// /// As per the specification, for a given intensity position, is_pos (0 <= is_pos < 32), the /// channel coefficients, k_l and k_r, may be calculated as per the table below: /// /// ```text /// If... | k_l | k_r /// -----------------+-------------------------+------------------- /// is_pos == 0 | 1.0 | 1.0 /// is_pos & 1 == 1 | i0 ^ [(is_pos + 1) / 2] | 1.0 /// is_pos & 1 == 0 | 1.0 | i0 ^ (is_pos / 2) /// ``` /// /// The value of i0 is dependant on the least significant bit of scalefac_compress. /// /// ```text /// scalefac_compress & 1 | i0 /// ----------------------+--------------------- /// 0 | 1 / sqrt(sqrt(2.0)) /// 1 | 1 / sqrt(2.0) /// ``` /// /// The first dimension of this table is indexed by scalefac_compress & 1 to select i0. The /// second dimension is indexed by is_pos to obtain the channel coefficients. Note that /// is_pos == 31 is considered an invalid position, but IS included in the table. static ref INTENSITY_STEREO_RATIOS_MPEG2: [[(f32, f32); 32]; 2] = { let is_scale: [f64; 2] = [ 1.0 / f64::sqrt(f64::consts::SQRT_2), f64::consts::FRAC_1_SQRT_2, ]; let mut ratios = [[(0.0, 0.0); 32]; 2]; for (i, is_pos) in (0..32).enumerate() { if is_pos & 1 != 0 { // Odd case. ratios[0][i] = (portable::pow(is_scale[0], f64::from(is_pos + 1) / 2.0) as f32, 1.0); ratios[1][i] = (portable::pow(is_scale[1], f64::from(is_pos + 1) / 2.0) as f32, 1.0); } else { // Even & zero case. ratios[0][i] = (1.0, portable::pow(is_scale[0], f64::from(is_pos) / 2.0) as f32); ratios[1][i] = (1.0, portable::pow(is_scale[1], f64::from(is_pos) / 2.0) as f32); } } ratios }; } lazy_static! { /// (Left, right) channel coeffcients for decoding intensity stereo in MPEG1 bitstreams. /// /// These coefficients are derived from section 2.4.3.4.9.3 of ISO/IEC 11172-3. /// /// As per the specification, for a given intensity position, is_pos (0 <= is_pos < 7), a ratio, /// is_ratio, is calculated as follows: /// /// ```text /// is_ratio = tan(is_pos * PI/12) /// ``` /// /// Then, the channel coefficients, k_l and k_r, are calculated as follows: /// /// ```text /// k_l = is_ratio / (1 + is_ratio) /// k_r = 1 / (1 + is_ratio) /// ``` /// /// This table is indexed by is_pos. Note that is_pos == 7 is invalid and is NOT included in the /// table. static ref INTENSITY_STEREO_RATIOS_MPEG1: [(f32, f32); 7] = { const PI_12: f64 = f64::consts::PI / 12.0; let mut ratios = [(0.0, 0.0); 7]; for (is_pos, ratio) in ratios.iter_mut().enumerate() { let is_ratio = portable::tan(PI_12 * is_pos as f64); *ratio = ( (is_ratio / (1.0 + is_ratio)) as f32, (1.0 / (1.0 + is_ratio)) as f32 ); } ratios[6] = (1.0, 0.0); ratios }; } /// Decorrelates mid and side channels into left and right channels. /// /// In mid-side (MS) stereo, the left and right channels are encoded as average (mid) and /// difference (side) components. /// /// As per ISO/IEC 11172-3, to reconstruct the left and right channels, the following calculation /// is performed: /// /// ```text /// l[i] = (m[i] + s[i]) / sqrt(2) /// r[i] = (m[i] - s[i]) / sqrt(2) /// ``` /// where: /// l[i], and r[i] are the left and right channels, respectively. /// m[i], and s[i] are the mid and side channels, respectively. /// /// In the bitstream, m[i] is transmitted in channel 0, while s[i] in channel 1. After decoding, /// the left channel replaces m[i] in channel 0, and the right channel replaces s[i] in channel /// 1. fn process_mid_side(mid: &mut [f32], side: &mut [f32]) { debug_assert!(mid.len() == side.len()); for (m, s) in mid.iter_mut().zip(side) { let left = (*m + *s) * f32::consts::FRAC_1_SQRT_2; let right = (*m - *s) * f32::consts::FRAC_1_SQRT_2; *m = left; *s = right; } } /// Decodes channel 0 of the intensity stereo coded signal into left and right channels. /// /// As per ISO/IEC 11172-3, the following calculation may be performed to decode the intensity /// stereo coded signal into left and right channels. /// /// ```text /// l[i] = ch0[i] * k_l /// r[i] = ch0[i] * l_r /// ``` /// /// where: /// l[i], and r[i] are the left and right channels, respectively. /// ch0[i] is the intensity stereo coded signal found in channel 0. /// k_l, and k_r are the left and right channel ratios, respectively. fn process_intensity( intensity_pos: u8, intensity_table: &[(f32, f32)], intensity_max: u8, mid_side: bool, ch0: &mut [f32], ch1: &mut [f32], ) { if intensity_pos < intensity_max { let (ratio_l, ratio_r) = intensity_table[usize::from(intensity_pos)]; for (l, r) in ch0.iter_mut().zip(ch1) { let is = *l; *l = ratio_l * is; *r = ratio_r * is; } } else if mid_side { process_mid_side(ch0, ch1); } } /// Determines if a band is zeroed. #[inline(always)] fn is_zero_band(band: &[f32]) -> bool { !band.iter().any(|&x| x != 0.0) } /// Decodes all intensity stereo coded bands within an entire long block and returns the intensity /// bound. fn process_intensity_long_block( header: &FrameHeader, granule: &Granule, mid_side: bool, max_bound: usize, ch0: &mut [f32; 576], ch1: &mut [f32; 576], ) -> usize { // As per ISO/IEC 11172-3 and ISO/IEC 13818-3, for long blocks that have intensity stereo // coding enabled, all bands starting after the last non-zero band in channel 1 may be // intensity stereo coded. // // The scale-factors in channel 1 for those respective bands determine the intensity position. // The rzero sample index is the index of last non-zero sample plus 1. let rzero = granule.channels[1].rzero; // Select the intensity stereo ratios table. let (is_table, is_inv_pos) = if header.is_mpeg1() { (&INTENSITY_STEREO_RATIOS_MPEG1[..], INTENSITY_INV_POS_MPEG1) } else { let is_scale = granule.channels[1].scalefac_compress & 1; (&INTENSITY_STEREO_RATIOS_MPEG2[usize::from(is_scale)][..], INTENSITY_INV_POS_MPEG2) }; let bands = &SFB_LONG_BANDS[header.sample_rate_idx]; // The intensity positions are stored in the right channel (channel 1) scalefactors. The // intensity position for band 21 is not coded and is copied from band 20. let mut is_pos = [0; 22]; is_pos.copy_from_slice(&granule.channels[1].scalefacs[..22]); is_pos[21] = is_pos[20]; // Create an iterator that yields a band start-end pair, and scale-factor. let bands_iter = bands.iter().zip(&bands[1..]).zip(is_pos.iter()); let mut bound = max_bound; // Iterate over each band and decode the intensity stereo coding if the band is zero. for ((&start, &end), &is_pos) in bands_iter.rev() { // Bands starting above rzero are always 0, however bands below it are ambiguous. let is_zero_band = start >= rzero || is_zero_band(&ch1[start..end]); if is_zero_band { process_intensity( is_pos, is_table, is_inv_pos, mid_side, &mut ch0[start..end], &mut ch1[start..end], ); } else { break; } // Update the intensity bound to the start of the band since it has now been processed. bound = start; } bound } /// Decodes all intensity stereo coded bands within an entire short block and returns the intensity /// bound. fn process_intensity_short_block( header: &FrameHeader, granule: &Granule, is_mixed: bool, mid_side: bool, max_bound: usize, ch0: &mut [f32; 576], ch1: &mut [f32; 576], ) -> usize { // For short, non-mixed, blocks, each band is composed of 3 windows (windows 0 thru 2). Windows // are interleaved in each band. // // +--------------+--------------+--------------+-------+ // | sfb0 | sfb1 | sfb2 | ... | // +--------------+--------------+--------------+-------+ // | w0 | w1 | w2 | w0 | w1 | w2 | w0 | w1 | w2 | ... | // +--------------+--------------+--------------+-------+ // // However, each window of the same index is logically contiguous as depicted below. // // +------+------+------+------+ // | sfb0 | sfb1 | sfb2 | .... | // +------+------+------+------+ // | w0 | w0 | w0 | .... | // +-------------+------+------+ // | w1 | w1 | w1 | .... | // +-------------+------+------+ // | w2 | w2 | w2 | .... | // +------+------+------+------+ // // Each logically contiguous window may have it's own intensity bound. For example, in the // example below, the intensity bound for window 0 is sfb0, for window 1 it's sfb2, and for // window 2 it's sfb1. // // +------+------+------+------+ // | sfb0 | sfb1 | sfb2 | .... | // +------+------+------+------+ // w0 | 0000 | 0000 | 0000 | 0... | // +-------------+------+------+ // w1 | abcd | xyzw | 0000 | 0... | // +-------------+------+------+ // w2 | xyz0 | 0000 | 0000 | 0... | // +------+------+------+------+ // // For short blocks that are mixed, the long bands at the start follow the same rules as long // blocks (see above). For example, for the block below, if sfb1 is the intensity bound, then // all samples from sfb1 onwards must be zero. If the intensity bound is not within the long // bands then the rules stated above are followed whereby each window has it's own intensity // bound. // // |> Long bands |> Short bands (3 windows) // +------+------+------+--------+--------+------+ // | sfb0 | sfb1 | .... | sfbN-2 | sfbN-1 | sfbN | // |------+------+------+--------+--------+------+ // | | | | w0 | w0 | w0 | // | | | +--------+--------+------+ // | | | .... | w1 | w1 | w1 | // | | | +--------+--------+------+ // | | | | w2 | w2 | w2 | // +------+------+------+--------+--------+------+ // // First, if the short block is mixed, the get pair of short and long bands. Otherwise, if the // block is not mixed, get the short bands. In both cases, the index of the last scale-factor is // also returned. let (short_bands, long_bands, mut sfi) = if is_mixed { let bands = SFB_MIXED_BANDS[header.sample_rate_idx]; let switch = SFB_MIXED_SWITCH_POINT[header.sample_rate_idx]; // Variable number of short and long scalefactor bands based on the switch point. (&bands[switch..], Some(&bands[..switch + 1]), bands.len() - 1) } else { // 39 scalefactors from 13 scalefactor bands with 3 short windows per band. (&SFB_SHORT_BANDS[header.sample_rate_idx][..], None, 39) }; // Select the intensity stereo ratios table based on the bitstream version. let (is_table, is_inv_pos) = if header.is_mpeg1() { (&INTENSITY_STEREO_RATIOS_MPEG1[..], INTENSITY_INV_POS_MPEG1) } else { let is_scale = granule.channels[1].scalefac_compress & 1; (&INTENSITY_STEREO_RATIOS_MPEG2[usize::from(is_scale)][..], INTENSITY_INV_POS_MPEG2) }; // The intensity position for the final band (last three short windows) is not coded and is // copied from the previous band. let mut is_pos = [0; 39]; is_pos[..36].copy_from_slice(&granule.channels[1].scalefacs[..36]); is_pos[36..].copy_from_slice(&granule.channels[1].scalefacs[33..36]); let mut window_is_zero = [true; 3]; let mut bound = max_bound; let mut found_bound = false; // Process the short bands. for (((&s0, &s1), &s2), &s3) in short_bands .iter() .zip(&short_bands[1..]) .zip(&short_bands[2..]) .zip(&short_bands[3..]) .step_by(3) .rev() { // For each short band, the following logic is repeated for each of the three windows. // // First, if the corresponding window in the previous band was zeroed, check if the // window in this band is also zeroed. Note that if the window is non-zero, this statement // short-circuits and avoids the costly zero-check. window_is_zero[2] = window_is_zero[2] && is_zero_band(&ch1[s2..s3]); // If the window is zeroed, process it with intensity stereo. if window_is_zero[2] { process_intensity( is_pos[sfi - 1], is_table, is_inv_pos, mid_side, &mut ch0[s2..s3], &mut ch1[s2..s3], ); } else if mid_side { // If the window is non-zeroed, process it with mid-side stereo. process_mid_side(&mut ch0[s2..s3], &mut ch1[s2..s3]); } // Decrement the scalefactor (intensity position) index to advance to the next window. sfi -= 1; // Repeat the same process for the second window. window_is_zero[1] = window_is_zero[1] && is_zero_band(&ch1[s1..s2]); if window_is_zero[1] { process_intensity( is_pos[sfi - 1], is_table, is_inv_pos, mid_side, &mut ch0[s1..s2], &mut ch1[s1..s2], ); } else if mid_side { process_mid_side(&mut ch0[s1..s2], &mut ch1[s1..s2]); } sfi -= 1; // Repeat the same process for the third window. window_is_zero[0] = window_is_zero[0] && is_zero_band(&ch1[s0..s1]); if window_is_zero[0] { process_intensity( is_pos[sfi - 1], is_table, is_inv_pos, mid_side, &mut ch0[s0..s1], &mut ch1[s0..s1], ); } else if mid_side { process_mid_side(&mut ch0[s0..s1], &mut ch1[s0..s1]); } sfi -= 1; // Update the intensity bound to the start of the first window since all three windows have // now been processed by either intensity or mid-side stereo. Note that this is the "final" // intensity bound of all the windows in the short bands. Individual windows may have // reached their intensity bound earlier. Those windows are processed with mid-side stereo. bound = s0; // Determine if all windows non-zero. found_bound = !window_is_zero[0] && !window_is_zero[1] && !window_is_zero[2]; // If all windows are non-zero then the all the remaining bands should be processed with // mid-side stereo. Break out early in this case. if found_bound { break; } } // If the final intensity bound was not found within the short bands, then it may be found // within the long bands if the short block is mixed. if !found_bound { // If the short block is mixed, the long bands will not be None. if let Some(long_bands) = long_bands { // Process the long bands exactly as if it were a long block. for (&start, &end) in long_bands.iter().zip(&long_bands[1..]).rev() { let is_zero_band = is_zero_band(&ch1[start..end]); if is_zero_band { process_intensity( is_pos[sfi - 1], is_table, is_inv_pos, mid_side, &mut ch0[start..end], &mut ch1[start..end], ); } else { break; } sfi -= 1; bound = start; } } } // Return the intensity bound. bound } /// Perform joint stereo decoding on the channel pair. pub(super) fn stereo( header: &FrameHeader, granule: &mut Granule, ch: &mut [[f32; 576]; 2], ) -> Result<()> { // Determine whether mid-side, and/or intensity stereo coding is used. let (mid_side, intensity) = match header.channel_mode { ChannelMode::JointStereo(Mode::Layer3 { mid_side, intensity }) => (mid_side, intensity), ChannelMode::JointStereo(Mode::Intensity { .. }) => { // This function only supports decoding Layer 3 stereo encodings, it is a fundamental // error in the decoder logic if layer 1 or 2 stereo encodings are being decoded with // this function. panic!("invalid mode extension for layer 3 stereo decoding") } _ => return Ok(()), }; // The block types must be the same. if granule.channels[0].block_type != granule.channels[1].block_type { return decode_error("mpa: stereo channel pair block_type mismatch"); } // Split the sample buffer into two channels. let (ch0, ch1) = { let (ch0, ch1) = ch.split_first_mut().unwrap(); (ch0, &mut ch1[0]) }; // Joint stereo processing as specified in layer 3 is a combination of mid-side, and intensity // encoding schemes. Each scale-factor band may use either mid-side, intensity, or no stereo // encoding. The type of encoding used for each scale-factor band is determined by the MPEG // bitstream version, the mode extension, the block type, and the content of the scale-factor // bands. let end = max(granule.channels[0].rzero, granule.channels[1].rzero); // Decode intensity stereo coded bands if it is enabled and get the intensity bound. let is_bound = if intensity { // Decode intensity stereo coded bands based on bitstream version and block type. match granule.channels[1].block_type { BlockType::Short { is_mixed } => { process_intensity_short_block(header, granule, is_mixed, mid_side, end, ch0, ch1) } _ => process_intensity_long_block(header, granule, mid_side, end, ch0, ch1), } } // If intensity stereo coding is not enabled, then all samples are processed with mid-side // stereo decoding. In other words, there are no samples encoded with intensity stereo and // therefore the intensity bound is equal to the end of the non-zero portion of the samples. else { end }; // If mid-side stereo coding is enabled, all samples up to the intensity bound should be // decoded as mid-side stereo. if mid_side && is_bound > 0 { process_mid_side(&mut ch0[0..is_bound], &mut ch1[0..is_bound]); } // With joint stereo encoding, there is usually a mismatch between the number of samples // initially read from the bitstream for each channel. This count is stored as the rzero sample // index. However, after joint stereo decoding, both channels will have the same number of // samples. Update rzero for both channels with the actual number of samples. if intensity || mid_side { granule.channels[0].rzero = end; granule.channels[1].rzero = end; } Ok(()) } ==== end of vendor-symphonia-bundle-mp3/src/layer3/stereo.rs ==== ==== vendor-symphonia-codec-aac/src/aac/window.rs ============================ // Symphonia // Copyright (c) 2019-2022 The Project Symphonia Developers. // // Previous Author: Kostya Shishkov // // This source file includes code originally written for the NihAV // project. With the author's permission, it has been relicensed for, // and ported to the Symphonia project. // // This Source Code Form is subject to the terms of the Mozilla Public // License, v. 2.0. If a copy of the MPL was not distributed with this // file, You can obtain one at https://mozilla.org/MPL/2.0/. use std::f32::consts; /// Window types. #[derive(Debug, Clone, Copy, PartialEq)] pub enum WindowType { /// Simple sine window. Sine, /// Kaiser-Bessel derived window. KaiserBessel(f32), } /// Calculates window coefficients for the requested window type and size. /// /// Set `half` flag to calculate only the first half of the window. pub fn generate_window(mode: WindowType, scale: f32, size: usize, half: bool, dst: &mut [f32]) { match mode { WindowType::Sine => { let param = if half { consts::PI / ((2 * size) as f32) } else { consts::PI / (size as f32) }; for n in 0..size { dst[n] = symphonia_core::dsp::portable::sinf(((n as f32) + 0.5) * param) * scale; } } WindowType::KaiserBessel(alpha) => { let dlen = if half { size as f32 } else { (size as f32) * 0.5 }; let alpha2 = f64::from((alpha * consts::PI / dlen) * (alpha * consts::PI / dlen)); let mut kb: Vec = Vec::with_capacity(size); let mut sum = 0.0; for n in 0..size { let b = bessel_i0(((n * (size - n)) as f64) * alpha2); sum += b; kb.push(sum); } sum += 1.0; for n in 0..size { dst[n] = (kb[n] / sum).sqrt() as f32; } } }; } fn bessel_i0(inval: f64) -> f64 { let mut val: f64 = 1.0; for n in (1..64).rev() { val *= inval / f64::from(n * n); val += 1.0; } val } ==== end of vendor-symphonia-codec-aac/src/aac/window.rs ==== ==== vendor-symphonia-codec-aac/src/aac/codebooks.rs ========================= // Symphonia // Copyright (c) 2019-2022 The Project Symphonia Developers. // // This Source Code Form is subject to the terms of the Mozilla Public // License, v. 2.0. If a copy of the MPL was not distributed with this // file, You can obtain one at https://mozilla.org/MPL/2.0/. use symphonia_core::io::{vlc::*, ReadBitsLtr}; use lazy_static::lazy_static; #[rustfmt::skip] const SPECTRUM_CODEBOOK1_LENS: [u8; 81] = [ 11, 9, 11, 10, 7, 10, 11, 9, 11, 10, 7, 10, 7, 5, 7, 9, 7, 10, 11, 9, 11, 9, 7, 9, 11, 9, 11, 9, 7, 9, 7, 5, 7, 9, 7, 9, 7, 5, 7, 5, 1, 5, 7, 5, 7, 9, 7, 9, 7, 5, 7, 9, 7, 9, 11, 9, 11, 9, 7, 9, 11, 9, 11, 10, 7, 9, 7, 5, 7, 9, 7, 10, 11, 9, 11, 10, 7, 9, 11, 9, 11 ]; #[rustfmt::skip] const SPECTRUM_CODEBOOK1_CODES: [u32; 81] = [ 0x7f8, 0x1f1, 0x7fd, 0x3f5, 0x068, 0x3f0, 0x7f7, 0x1ec, 0x7f5, 0x3f1, 0x072, 0x3f4, 0x074, 0x011, 0x076, 0x1eb, 0x06c, 0x3f6, 0x7fc, 0x1e1, 0x7f1, 0x1f0, 0x061, 0x1f6, 0x7f2, 0x1ea, 0x7fb, 0x1f2, 0x069, 0x1ed, 0x077, 0x017, 0x06f, 0x1e6, 0x064, 0x1e5, 0x067, 0x015, 0x062, 0x012, 0x000, 0x014, 0x065, 0x016, 0x06d, 0x1e9, 0x063, 0x1e4, 0x06b, 0x013, 0x071, 0x1e3, 0x070, 0x1f3, 0x7fe, 0x1e7, 0x7f3, 0x1ef, 0x060, 0x1ee, 0x7f0, 0x1e2, 0x7fa, 0x3f3, 0x06a, 0x1e8, 0x075, 0x010, 0x073, 0x1f4, 0x06e, 0x3f7, 0x7f6, 0x1e0, 0x7f9, 0x3f2, 0x066, 0x1f5, 0x7ff, 0x1f7, 0x7f4 ]; #[rustfmt::skip] const SPECTRUM_CODEBOOK2_LENS: [u8; 81] = [ 9, 7, 9, 8, 6, 8, 9, 8, 9, 8, 6, 7, 6, 5, 6, 7, 6, 8, 9, 7, 8, 8, 6, 8, 9, 7, 9, 8, 6, 7, 6, 5, 6, 7, 6, 8, 6, 5, 6, 5, 3, 5, 6, 5, 6, 8, 6, 7, 6, 5, 6, 8, 6, 8, 9, 7, 9, 8, 6, 8, 8, 7, 9, 8, 6, 7, 6, 4, 6, 8, 6, 7, 9, 7, 9, 7, 6, 8, 9, 7, 9 ]; #[rustfmt::skip] const SPECTRUM_CODEBOOK2_CODES: [u32; 81] = [ 0x1f3, 0x06f, 0x1fd, 0x0eb, 0x023, 0x0ea, 0x1f7, 0x0e8, 0x1fa, 0x0f2, 0x02d, 0x070, 0x020, 0x006, 0x02b, 0x06e, 0x028, 0x0e9, 0x1f9, 0x066, 0x0f8, 0x0e7, 0x01b, 0x0f1, 0x1f4, 0x06b, 0x1f5, 0x0ec, 0x02a, 0x06c, 0x02c, 0x00a, 0x027, 0x067, 0x01a, 0x0f5, 0x024, 0x008, 0x01f, 0x009, 0x000, 0x007, 0x01d, 0x00b, 0x030, 0x0ef, 0x01c, 0x064, 0x01e, 0x00c, 0x029, 0x0f3, 0x02f, 0x0f0, 0x1fc, 0x071, 0x1f2, 0x0f4, 0x021, 0x0e6, 0x0f7, 0x068, 0x1f8, 0x0ee, 0x022, 0x065, 0x031, 0x002, 0x026, 0x0ed, 0x025, 0x06a, 0x1fb, 0x072, 0x1fe, 0x069, 0x02e, 0x0f6, 0x1ff, 0x06d, 0x1f6 ]; #[rustfmt::skip] const SPECTRUM_CODEBOOK3_LENS: [u8; 81] = [ 1, 4, 8, 4, 5, 8, 9, 9, 10, 4, 6, 9, 6, 6, 9, 9, 9, 10, 9, 10, 13, 9, 9, 11, 11, 10, 12, 4, 6, 10, 6, 7, 10, 10, 10, 12, 5, 7, 11, 6, 7, 10, 9, 9, 11, 9, 10, 13, 8, 9, 12, 10, 11, 12, 8, 10, 15, 9, 11, 15, 13, 14, 16, 8, 10, 14, 9, 10, 14, 12, 12, 15, 11, 12, 16, 10, 11, 15, 12, 12, 15 ]; #[rustfmt::skip] const SPECTRUM_CODEBOOK3_CODES: [u32; 81] = [ 0x0000, 0x0009, 0x00ef, 0x000b, 0x0019, 0x00f0, 0x01eb, 0x01e6, 0x03f2, 0x000a, 0x0035, 0x01ef, 0x0034, 0x0037, 0x01e9, 0x01ed, 0x01e7, 0x03f3, 0x01ee, 0x03ed, 0x1ffa, 0x01ec, 0x01f2, 0x07f9, 0x07f8, 0x03f8, 0x0ff8, 0x0008, 0x0038, 0x03f6, 0x0036, 0x0075, 0x03f1, 0x03eb, 0x03ec, 0x0ff4, 0x0018, 0x0076, 0x07f4, 0x0039, 0x0074, 0x03ef, 0x01f3, 0x01f4, 0x07f6, 0x01e8, 0x03ea, 0x1ffc, 0x00f2, 0x01f1, 0x0ffb, 0x03f5, 0x07f3, 0x0ffc, 0x00ee, 0x03f7, 0x7ffe, 0x01f0, 0x07f5, 0x7ffd, 0x1ffb, 0x3ffa, 0xffff, 0x00f1, 0x03f0, 0x3ffc, 0x01ea, 0x03ee, 0x3ffb, 0x0ff6, 0x0ffa, 0x7ffc, 0x07f2, 0x0ff5, 0xfffe, 0x03f4, 0x07f7, 0x7ffb, 0x0ff7, 0x0ff9, 0x7ffa ]; #[rustfmt::skip] const SPECTRUM_CODEBOOK4_LENS: [u8; 81] = [ 4, 5, 8, 5, 4, 8, 9, 8, 11, 5, 5, 8, 5, 4, 8, 8, 7, 10, 9, 8, 11, 8, 8, 10, 11, 10, 11, 4, 5, 8, 4, 4, 8, 8, 8, 10, 4, 4, 8, 4, 4, 7, 8, 7, 9, 8, 8, 10, 7, 7, 9, 10, 9, 10, 8, 8, 11, 8, 7, 10, 11, 10, 12, 8, 7, 10, 7, 7, 9, 10, 9, 11, 11, 10, 12, 10, 9, 11, 11, 10, 11 ]; #[rustfmt::skip] const SPECTRUM_CODEBOOK4_CODES: [u32; 81] = [ 0x007, 0x016, 0x0f6, 0x018, 0x008, 0x0ef, 0x1ef, 0x0f3, 0x7f8, 0x019, 0x017, 0x0ed, 0x015, 0x001, 0x0e2, 0x0f0, 0x070, 0x3f0, 0x1ee, 0x0f1, 0x7fa, 0x0ee, 0x0e4, 0x3f2, 0x7f6, 0x3ef, 0x7fd, 0x005, 0x014, 0x0f2, 0x009, 0x004, 0x0e5, 0x0f4, 0x0e8, 0x3f4, 0x006, 0x002, 0x0e7, 0x003, 0x000, 0x06b, 0x0e3, 0x069, 0x1f3, 0x0eb, 0x0e6, 0x3f6, 0x06e, 0x06a, 0x1f4, 0x3ec, 0x1f0, 0x3f9, 0x0f5, 0x0ec, 0x7fb, 0x0ea, 0x06f, 0x3f7, 0x7f9, 0x3f3, 0xfff, 0x0e9, 0x06d, 0x3f8, 0x06c, 0x068, 0x1f5, 0x3ee, 0x1f2, 0x7f4, 0x7f7, 0x3f1, 0xffe, 0x3ed, 0x1f1, 0x7f5, 0x7fe, 0x3f5, 0x7fc ]; #[rustfmt::skip] const SPECTRUM_CODEBOOK5_LENS: [u8; 81] = [ 13, 12, 11, 11, 10, 11, 11, 12, 13, 12, 11, 10, 9, 8, 9, 10, 11, 12, 12, 10, 9, 8, 7, 8, 9, 10, 11, 11, 9, 8, 5, 4, 5, 8, 9, 11, 10, 8, 7, 4, 1, 4, 7, 8, 11, 11, 9, 8, 5, 4, 5, 8, 9, 11, 11, 10, 9, 8, 7, 8, 9, 10, 11, 12, 11, 10, 9, 8, 9, 10, 11, 12, 13, 12, 12, 11, 10, 10, 11, 12, 13 ]; #[rustfmt::skip] const SPECTRUM_CODEBOOK5_CODES: [u32; 81] = [ 0x1fff, 0x0ff7, 0x07f4, 0x07e8, 0x03f1, 0x07ee, 0x07f9, 0x0ff8, 0x1ffd, 0x0ffd, 0x07f1, 0x03e8, 0x01e8, 0x00f0, 0x01ec, 0x03ee, 0x07f2, 0x0ffa, 0x0ff4, 0x03ef, 0x01f2, 0x00e8, 0x0070, 0x00ec, 0x01f0, 0x03ea, 0x07f3, 0x07eb, 0x01eb, 0x00ea, 0x001a, 0x0008, 0x0019, 0x00ee, 0x01ef, 0x07ed, 0x03f0, 0x00f2, 0x0073, 0x000b, 0x0000, 0x000a, 0x0071, 0x00f3, 0x07e9, 0x07ef, 0x01ee, 0x00ef, 0x0018, 0x0009, 0x001b, 0x00eb, 0x01e9, 0x07ec, 0x07f6, 0x03eb, 0x01f3, 0x00ed, 0x0072, 0x00e9, 0x01f1, 0x03ed, 0x07f7, 0x0ff6, 0x07f0, 0x03e9, 0x01ed, 0x00f1, 0x01ea, 0x03ec, 0x07f8, 0x0ff9, 0x1ffc, 0x0ffc, 0x0ff5, 0x07ea, 0x03f3, 0x03f2, 0x07f5, 0x0ffb, 0x1ffe ]; #[rustfmt::skip] const SPECTRUM_CODEBOOK6_LENS: [u8; 81] = [ 11, 10, 9, 9, 9, 9, 9, 10, 11, 10, 9, 8, 7, 7, 7, 8, 9, 10, 9, 8, 6, 6, 6, 6, 6, 8, 9, 9, 7, 6, 4, 4, 4, 6, 7, 9, 9, 7, 6, 4, 4, 4, 6, 7, 9, 9, 7, 6, 4, 4, 4, 6, 7, 9, 9, 8, 6, 6, 6, 6, 6, 8, 9, 10, 9, 8, 7, 7, 7, 7, 8, 10, 11, 10, 9, 9, 9, 9, 9, 10, 11 ]; #[rustfmt::skip] const SPECTRUM_CODEBOOK6_CODES: [u32; 81] = [ 0x7fe, 0x3fd, 0x1f1, 0x1eb, 0x1f4, 0x1ea, 0x1f0, 0x3fc, 0x7fd, 0x3f6, 0x1e5, 0x0ea, 0x06c, 0x071, 0x068, 0x0f0, 0x1e6, 0x3f7, 0x1f3, 0x0ef, 0x032, 0x027, 0x028, 0x026, 0x031, 0x0eb, 0x1f7, 0x1e8, 0x06f, 0x02e, 0x008, 0x004, 0x006, 0x029, 0x06b, 0x1ee, 0x1ef, 0x072, 0x02d, 0x002, 0x000, 0x003, 0x02f, 0x073, 0x1fa, 0x1e7, 0x06e, 0x02b, 0x007, 0x001, 0x005, 0x02c, 0x06d, 0x1ec, 0x1f9, 0x0ee, 0x030, 0x024, 0x02a, 0x025, 0x033, 0x0ec, 0x1f2, 0x3f8, 0x1e4, 0x0ed, 0x06a, 0x070, 0x069, 0x074, 0x0f1, 0x3fa, 0x7ff, 0x3f9, 0x1f6, 0x1ed, 0x1f8, 0x1e9, 0x1f5, 0x3fb, 0x7fc ]; #[rustfmt::skip] const SPECTRUM_CODEBOOK7_LENS: [u8; 64] = [ 1, 3, 6, 7, 8, 9, 10, 11, 3, 4, 6, 7, 8, 8, 9, 9, 6, 6, 7, 8, 8, 9, 9, 10, 7, 7, 8, 8, 9, 9, 10, 10, 8, 8, 9, 9, 10, 10, 10, 11, 9, 8, 9, 9, 10, 10, 11, 11, 10, 9, 9, 10, 10, 11, 12, 12, 11, 10, 10, 10, 11, 11, 12, 12 ]; #[rustfmt::skip] const SPECTRUM_CODEBOOK7_CODES: [u32; 64] = [ 0x000, 0x005, 0x037, 0x074, 0x0f2, 0x1eb, 0x3ed, 0x7f7, 0x004, 0x00c, 0x035, 0x071, 0x0ec, 0x0ee, 0x1ee, 0x1f5, 0x036, 0x034, 0x072, 0x0ea, 0x0f1, 0x1e9, 0x1f3, 0x3f5, 0x073, 0x070, 0x0eb, 0x0f0, 0x1f1, 0x1f0, 0x3ec, 0x3fa, 0x0f3, 0x0ed, 0x1e8, 0x1ef, 0x3ef, 0x3f1, 0x3f9, 0x7fb, 0x1ed, 0x0ef, 0x1ea, 0x1f2, 0x3f3, 0x3f8, 0x7f9, 0x7fc, 0x3ee, 0x1ec, 0x1f4, 0x3f4, 0x3f7, 0x7f8, 0xffd, 0xffe, 0x7f6, 0x3f0, 0x3f2, 0x3f6, 0x7fa, 0x7fd, 0xffc, 0xfff ]; #[rustfmt::skip] const SPECTRUM_CODEBOOK8_LENS: [u8; 64] = [ 5, 4, 5, 6, 7, 8, 9, 10, 4, 3, 4, 5, 6, 7, 7, 8, 5, 4, 4, 5, 6, 7, 7, 8, 6, 5, 5, 6, 6, 7, 8, 8, 7, 6, 6, 6, 7, 7, 8, 9, 8, 7, 6, 7, 7, 8, 8, 10, 9, 7, 7, 8, 8, 8, 9, 9, 10, 8, 8, 8, 9, 9, 9, 10 ]; #[rustfmt::skip] const SPECTRUM_CODEBOOK8_CODES: [u32; 64] = [ 0x00e, 0x005, 0x010, 0x030, 0x06f, 0x0f1, 0x1fa, 0x3fe, 0x003, 0x000, 0x004, 0x012, 0x02c, 0x06a, 0x075, 0x0f8, 0x00f, 0x002, 0x006, 0x014, 0x02e, 0x069, 0x072, 0x0f5, 0x02f, 0x011, 0x013, 0x02a, 0x032, 0x06c, 0x0ec, 0x0fa, 0x071, 0x02b, 0x02d, 0x031, 0x06d, 0x070, 0x0f2, 0x1f9, 0x0ef, 0x068, 0x033, 0x06b, 0x06e, 0x0ee, 0x0f9, 0x3fc, 0x1f8, 0x074, 0x073, 0x0ed, 0x0f0, 0x0f6, 0x1f6, 0x1fd, 0x3fd, 0x0f3, 0x0f4, 0x0f7, 0x1f7, 0x1fb, 0x1fc, 0x3ff ]; #[rustfmt::skip] const SPECTRUM_CODEBOOK9_LENS: [u8; 169] = [ 1, 3, 6, 8, 9, 10, 10, 11, 11, 12, 12, 13, 13, 3, 4, 6, 7, 8, 8, 9, 10, 10, 10, 11, 12, 12, 6, 6, 7, 8, 8, 9, 10, 10, 10, 11, 12, 12, 12, 8, 7, 8, 9, 9, 10, 10, 11, 11, 11, 12, 12, 13, 9, 8, 9, 9, 10, 10, 11, 11, 11, 12, 12, 12, 13, 10, 9, 9, 10, 11, 11, 11, 12, 11, 12, 12, 13, 13, 11, 9, 10, 11, 11, 11, 12, 12, 12, 12, 13, 13, 13, 11, 10, 10, 11, 11, 12, 12, 13, 13, 13, 13, 13, 13, 11, 10, 10, 11, 11, 11, 12, 12, 13, 13, 14, 13, 14, 11, 10, 11, 11, 12, 12, 12, 12, 13, 13, 14, 14, 14, 12, 11, 11, 12, 12, 12, 13, 13, 13, 14, 14, 14, 15, 12, 11, 12, 12, 12, 13, 13, 13, 13, 14, 14, 15, 15, 13, 12, 12, 12, 13, 13, 13, 13, 14, 14, 14, 14, 15 ]; #[rustfmt::skip] const SPECTRUM_CODEBOOK9_CODES: [u32; 169] = [ 0x0000, 0x0005, 0x0037, 0x00e7, 0x01de, 0x03ce, 0x03d9, 0x07c8, 0x07cd, 0x0fc8, 0x0fdd, 0x1fe4, 0x1fec, 0x0004, 0x000c, 0x0035, 0x0072, 0x00ea, 0x00ed, 0x01e2, 0x03d1, 0x03d3, 0x03e0, 0x07d8, 0x0fcf, 0x0fd5, 0x0036, 0x0034, 0x0071, 0x00e8, 0x00ec, 0x01e1, 0x03cf, 0x03dd, 0x03db, 0x07d0, 0x0fc7, 0x0fd4, 0x0fe4, 0x00e6, 0x0070, 0x00e9, 0x01dd, 0x01e3, 0x03d2, 0x03dc, 0x07cc, 0x07ca, 0x07de, 0x0fd8, 0x0fea, 0x1fdb, 0x01df, 0x00eb, 0x01dc, 0x01e6, 0x03d5, 0x03de, 0x07cb, 0x07dd, 0x07dc, 0x0fcd, 0x0fe2, 0x0fe7, 0x1fe1, 0x03d0, 0x01e0, 0x01e4, 0x03d6, 0x07c5, 0x07d1, 0x07db, 0x0fd2, 0x07e0, 0x0fd9, 0x0feb, 0x1fe3, 0x1fe9, 0x07c4, 0x01e5, 0x03d7, 0x07c6, 0x07cf, 0x07da, 0x0fcb, 0x0fda, 0x0fe3, 0x0fe9, 0x1fe6, 0x1ff3, 0x1ff7, 0x07d3, 0x03d8, 0x03e1, 0x07d4, 0x07d9, 0x0fd3, 0x0fde, 0x1fdd, 0x1fd9, 0x1fe2, 0x1fea, 0x1ff1, 0x1ff6, 0x07d2, 0x03d4, 0x03da, 0x07c7, 0x07d7, 0x07e2, 0x0fce, 0x0fdb, 0x1fd8, 0x1fee, 0x3ff0, 0x1ff4, 0x3ff2, 0x07e1, 0x03df, 0x07c9, 0x07d6, 0x0fca, 0x0fd0, 0x0fe5, 0x0fe6, 0x1feb, 0x1fef, 0x3ff3, 0x3ff4, 0x3ff5, 0x0fe0, 0x07ce, 0x07d5, 0x0fc6, 0x0fd1, 0x0fe1, 0x1fe0, 0x1fe8, 0x1ff0, 0x3ff1, 0x3ff8, 0x3ff6, 0x7ffc, 0x0fe8, 0x07df, 0x0fc9, 0x0fd7, 0x0fdc, 0x1fdc, 0x1fdf, 0x1fed, 0x1ff5, 0x3ff9, 0x3ffb, 0x7ffd, 0x7ffe, 0x1fe7, 0x0fcc, 0x0fd6, 0x0fdf, 0x1fde, 0x1fda, 0x1fe5, 0x1ff2, 0x3ffa, 0x3ff7, 0x3ffc, 0x3ffd, 0x7fff ]; #[rustfmt::skip] const SPECTRUM_CODEBOOK10_LENS: [u8; 169] = [ 6, 5, 6, 6, 7, 8, 9, 10, 10, 10, 11, 11, 12, 5, 4, 4, 5, 6, 7, 7, 8, 8, 9, 10, 10, 11, 6, 4, 5, 5, 6, 6, 7, 8, 8, 9, 9, 10, 10, 6, 5, 5, 5, 6, 7, 7, 8, 8, 9, 9, 10, 10, 7, 6, 6, 6, 6, 7, 7, 8, 8, 9, 9, 10, 10, 8, 7, 6, 7, 7, 7, 8, 8, 8, 9, 10, 10, 11, 9, 7, 7, 7, 7, 8, 8, 9, 9, 9, 10, 10, 11, 9, 8, 8, 8, 8, 8, 9, 9, 9, 10, 10, 11, 11, 9, 8, 8, 8, 8, 8, 9, 9, 10, 10, 10, 11, 11, 10, 9, 9, 9, 9, 9, 9, 10, 10, 10, 11, 11, 12, 10, 9, 9, 9, 9, 10, 10, 10, 10, 11, 11, 11, 12, 11, 10, 9, 10, 10, 10, 10, 10, 11, 11, 11, 11, 12, 11, 10, 10, 10, 10, 10, 10, 11, 11, 12, 12, 12, 12 ]; #[rustfmt::skip] const SPECTRUM_CODEBOOK10_CODES: [u32; 169] = [ 0x022, 0x008, 0x01d, 0x026, 0x05f, 0x0d3, 0x1cf, 0x3d0, 0x3d7, 0x3ed, 0x7f0, 0x7f6, 0xffd, 0x007, 0x000, 0x001, 0x009, 0x020, 0x054, 0x060, 0x0d5, 0x0dc, 0x1d4, 0x3cd, 0x3de, 0x7e7, 0x01c, 0x002, 0x006, 0x00c, 0x01e, 0x028, 0x05b, 0x0cd, 0x0d9, 0x1ce, 0x1dc, 0x3d9, 0x3f1, 0x025, 0x00b, 0x00a, 0x00d, 0x024, 0x057, 0x061, 0x0cc, 0x0dd, 0x1cc, 0x1de, 0x3d3, 0x3e7, 0x05d, 0x021, 0x01f, 0x023, 0x027, 0x059, 0x064, 0x0d8, 0x0df, 0x1d2, 0x1e2, 0x3dd, 0x3ee, 0x0d1, 0x055, 0x029, 0x056, 0x058, 0x062, 0x0ce, 0x0e0, 0x0e2, 0x1da, 0x3d4, 0x3e3, 0x7eb, 0x1c9, 0x05e, 0x05a, 0x05c, 0x063, 0x0ca, 0x0da, 0x1c7, 0x1ca, 0x1e0, 0x3db, 0x3e8, 0x7ec, 0x1e3, 0x0d2, 0x0cb, 0x0d0, 0x0d7, 0x0db, 0x1c6, 0x1d5, 0x1d8, 0x3ca, 0x3da, 0x7ea, 0x7f1, 0x1e1, 0x0d4, 0x0cf, 0x0d6, 0x0de, 0x0e1, 0x1d0, 0x1d6, 0x3d1, 0x3d5, 0x3f2, 0x7ee, 0x7fb, 0x3e9, 0x1cd, 0x1c8, 0x1cb, 0x1d1, 0x1d7, 0x1df, 0x3cf, 0x3e0, 0x3ef, 0x7e6, 0x7f8, 0xffa, 0x3eb, 0x1dd, 0x1d3, 0x1d9, 0x1db, 0x3d2, 0x3cc, 0x3dc, 0x3ea, 0x7ed, 0x7f3, 0x7f9, 0xff9, 0x7f2, 0x3ce, 0x1e4, 0x3cb, 0x3d8, 0x3d6, 0x3e2, 0x3e5, 0x7e8, 0x7f4, 0x7f5, 0x7f7, 0xffb, 0x7fa, 0x3ec, 0x3df, 0x3e1, 0x3e4, 0x3e6, 0x3f0, 0x7e9, 0x7ef, 0xff8, 0xffe, 0xffc, 0xfff ]; #[rustfmt::skip] const SPECTRUM_CODEBOOK11_LENS: [u8; 289] = [ 4, 5, 6, 7, 8, 8, 9, 10, 10, 10, 11, 11, 12, 11, 12, 12, 10, 5, 4, 5, 6, 7, 7, 8, 8, 9, 9, 9, 10, 10, 10, 10, 11, 8, 6, 5, 5, 6, 7, 7, 8, 8, 8, 9, 9, 9, 10, 10, 10, 10, 8, 7, 6, 6, 6, 7, 7, 8, 8, 8, 9, 9, 9, 10, 10, 10, 10, 8, 8, 7, 7, 7, 7, 8, 8, 8, 8, 9, 9, 9, 10, 10, 10, 10, 8, 8, 7, 7, 7, 7, 8, 8, 8, 9, 9, 9, 9, 10, 10, 10, 10, 8, 9, 8, 8, 8, 8, 8, 8, 8, 9, 9, 9, 10, 10, 10, 10, 10, 8, 9, 8, 8, 8, 8, 8, 8, 9, 9, 9, 10, 10, 10, 10, 10, 10, 8, 10, 9, 8, 8, 9, 9, 9, 9, 9, 10, 10, 10, 10, 10, 10, 11, 8, 10, 9, 9, 9, 9, 9, 9, 9, 10, 10, 10, 10, 10, 10, 11, 11, 8, 11, 9, 9, 9, 9, 9, 9, 10, 10, 10, 10, 10, 11, 10, 11, 11, 8, 11, 10, 9, 9, 10, 9, 10, 10, 10, 10, 10, 11, 11, 11, 11, 11, 8, 11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 11, 11, 11, 11, 11, 9, 11, 10, 9, 9, 10, 10, 10, 10, 10, 10, 11, 11, 11, 11, 11, 11, 9, 11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 11, 11, 11, 11, 11, 11, 9, 12, 10, 10, 10, 10, 10, 10, 10, 11, 11, 11, 11, 11, 11, 12, 12, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 9, 5 ]; #[rustfmt::skip] const SPECTRUM_CODEBOOK11_CODES: [u32; 289] = [ 0x000, 0x006, 0x019, 0x03d, 0x09c, 0x0c6, 0x1a7, 0x390, 0x3c2, 0x3df, 0x7e6, 0x7f3, 0xffb, 0x7ec, 0xffa, 0xffe, 0x38e, 0x005, 0x001, 0x008, 0x014, 0x037, 0x042, 0x092, 0x0af, 0x191, 0x1a5, 0x1b5, 0x39e, 0x3c0, 0x3a2, 0x3cd, 0x7d6, 0x0ae, 0x017, 0x007, 0x009, 0x018, 0x039, 0x040, 0x08e, 0x0a3, 0x0b8, 0x199, 0x1ac, 0x1c1, 0x3b1, 0x396, 0x3be, 0x3ca, 0x09d, 0x03c, 0x015, 0x016, 0x01a, 0x03b, 0x044, 0x091, 0x0a5, 0x0be, 0x196, 0x1ae, 0x1b9, 0x3a1, 0x391, 0x3a5, 0x3d5, 0x094, 0x09a, 0x036, 0x038, 0x03a, 0x041, 0x08c, 0x09b, 0x0b0, 0x0c3, 0x19e, 0x1ab, 0x1bc, 0x39f, 0x38f, 0x3a9, 0x3cf, 0x093, 0x0bf, 0x03e, 0x03f, 0x043, 0x045, 0x09e, 0x0a7, 0x0b9, 0x194, 0x1a2, 0x1ba, 0x1c3, 0x3a6, 0x3a7, 0x3bb, 0x3d4, 0x09f, 0x1a0, 0x08f, 0x08d, 0x090, 0x098, 0x0a6, 0x0b6, 0x0c4, 0x19f, 0x1af, 0x1bf, 0x399, 0x3bf, 0x3b4, 0x3c9, 0x3e7, 0x0a8, 0x1b6, 0x0ab, 0x0a4, 0x0aa, 0x0b2, 0x0c2, 0x0c5, 0x198, 0x1a4, 0x1b8, 0x38c, 0x3a4, 0x3c4, 0x3c6, 0x3dd, 0x3e8, 0x0ad, 0x3af, 0x192, 0x0bd, 0x0bc, 0x18e, 0x197, 0x19a, 0x1a3, 0x1b1, 0x38d, 0x398, 0x3b7, 0x3d3, 0x3d1, 0x3db, 0x7dd, 0x0b4, 0x3de, 0x1a9, 0x19b, 0x19c, 0x1a1, 0x1aa, 0x1ad, 0x1b3, 0x38b, 0x3b2, 0x3b8, 0x3ce, 0x3e1, 0x3e0, 0x7d2, 0x7e5, 0x0b7, 0x7e3, 0x1bb, 0x1a8, 0x1a6, 0x1b0, 0x1b2, 0x1b7, 0x39b, 0x39a, 0x3ba, 0x3b5, 0x3d6, 0x7d7, 0x3e4, 0x7d8, 0x7ea, 0x0ba, 0x7e8, 0x3a0, 0x1bd, 0x1b4, 0x38a, 0x1c4, 0x392, 0x3aa, 0x3b0, 0x3bc, 0x3d7, 0x7d4, 0x7dc, 0x7db, 0x7d5, 0x7f0, 0x0c1, 0x7fb, 0x3c8, 0x3a3, 0x395, 0x39d, 0x3ac, 0x3ae, 0x3c5, 0x3d8, 0x3e2, 0x3e6, 0x7e4, 0x7e7, 0x7e0, 0x7e9, 0x7f7, 0x190, 0x7f2, 0x393, 0x1be, 0x1c0, 0x394, 0x397, 0x3ad, 0x3c3, 0x3c1, 0x3d2, 0x7da, 0x7d9, 0x7df, 0x7eb, 0x7f4, 0x7fa, 0x195, 0x7f8, 0x3bd, 0x39c, 0x3ab, 0x3a8, 0x3b3, 0x3b9, 0x3d0, 0x3e3, 0x3e5, 0x7e2, 0x7de, 0x7ed, 0x7f1, 0x7f9, 0x7fc, 0x193, 0xffd, 0x3dc, 0x3b6, 0x3c7, 0x3cc, 0x3cb, 0x3d9, 0x3da, 0x7d3, 0x7e1, 0x7ee, 0x7ef, 0x7f5, 0x7f6, 0xffc, 0xfff, 0x19d, 0x1c2, 0x0b5, 0x0a1, 0x096, 0x097, 0x095, 0x099, 0x0a0, 0x0a2, 0x0ac, 0x0a9, 0x0b1, 0x0b3, 0x0bb, 0x0c0, 0x18f, 0x004 ]; #[rustfmt::skip] const SCF_CODEBOOK_LENS: [u8; 121] = [ 18, 18, 18, 18, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 18, 19, 18, 17, 17, 16, 17, 16, 16, 16, 16, 15, 15, 14, 14, 14, 14, 14, 14, 13, 13, 12, 12, 12, 11, 12, 11, 10, 10, 10, 9, 9, 8, 8, 8, 7, 6, 6, 5, 4, 3, 1, 4, 4, 5, 6, 6, 7, 7, 8, 8, 9, 9, 10, 10, 10, 11, 11, 11, 11, 12, 12, 13, 13, 13, 14, 14, 16, 15, 16, 15, 18, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19 ]; #[rustfmt::skip] const SCF_CODEBOOK_CODES: [u32; 121] = [ 0x3FFE8, 0x3FFE6, 0x3FFE7, 0x3FFE5, 0x7FFF5, 0x7FFF1, 0x7FFED, 0x7FFF6, 0x7FFEE, 0x7FFEF, 0x7FFF0, 0x7FFFC, 0x7FFFD, 0x7FFFF, 0x7FFFE, 0x7FFF7, 0x7FFF8, 0x7FFFB, 0x7FFF9, 0x3FFE4, 0x7FFFA, 0x3FFE3, 0x1FFEF, 0x1FFF0, 0x0FFF5, 0x1FFEE, 0x0FFF2, 0x0FFF3, 0x0FFF4, 0x0FFF1, 0x07FF6, 0x07FF7, 0x03FF9, 0x03FF5, 0x03FF7, 0x03FF3, 0x03FF6, 0x03FF2, 0x01FF7, 0x01FF5, 0x00FF9, 0x00FF7, 0x00FF6, 0x007F9, 0x00FF4, 0x007F8, 0x003F9, 0x003F7, 0x003F5, 0x001F8, 0x001F7, 0x000FA, 0x000F8, 0x000F6, 0x00079, 0x0003A, 0x00038, 0x0001A, 0x0000B, 0x00004, 0x00000, 0x0000A, 0x0000C, 0x0001B, 0x00039, 0x0003B, 0x00078, 0x0007A, 0x000F7, 0x000F9, 0x001F6, 0x001F9, 0x003F4, 0x003F6, 0x003F8, 0x007F5, 0x007F4, 0x007F6, 0x007F7, 0x00FF5, 0x00FF8, 0x01FF4, 0x01FF6, 0x01FF8, 0x03FF8, 0x03FF4, 0x0FFF0, 0x07FF4, 0x0FFF6, 0x07FF5, 0x3FFE2, 0x7FFD9, 0x7FFDA, 0x7FFDB, 0x7FFDC, 0x7FFDD, 0x7FFDE, 0x7FFD8, 0x7FFD2, 0x7FFD3, 0x7FFD4, 0x7FFD5, 0x7FFD6, 0x7FFF2, 0x7FFDF, 0x7FFE7, 0x7FFE8, 0x7FFE9, 0x7FFEA, 0x7FFEB, 0x7FFE6, 0x7FFE0, 0x7FFE1, 0x7FFE2, 0x7FFE3, 0x7FFE4, 0x7FFE5, 0x7FFD7, 0x7FFEC, 0x7FFF4, 0x7FFF3 ]; const AAC_QUADS: [(u8, u8, u8, u8); 81] = [ (0, 0, 0, 0), (0, 0, 0, 1), (0, 0, 0, 2), (0, 0, 1, 0), (0, 0, 1, 1), (0, 0, 1, 2), (0, 0, 2, 0), (0, 0, 2, 1), (0, 0, 2, 2), (0, 1, 0, 0), (0, 1, 0, 1), (0, 1, 0, 2), (0, 1, 1, 0), (0, 1, 1, 1), (0, 1, 1, 2), (0, 1, 2, 0), (0, 1, 2, 1), (0, 1, 2, 2), (0, 2, 0, 0), (0, 2, 0, 1), (0, 2, 0, 2), (0, 2, 1, 0), (0, 2, 1, 1), (0, 2, 1, 2), (0, 2, 2, 0), (0, 2, 2, 1), (0, 2, 2, 2), (1, 0, 0, 0), (1, 0, 0, 1), (1, 0, 0, 2), (1, 0, 1, 0), (1, 0, 1, 1), (1, 0, 1, 2), (1, 0, 2, 0), (1, 0, 2, 1), (1, 0, 2, 2), (1, 1, 0, 0), (1, 1, 0, 1), (1, 1, 0, 2), (1, 1, 1, 0), (1, 1, 1, 1), (1, 1, 1, 2), (1, 1, 2, 0), (1, 1, 2, 1), (1, 1, 2, 2), (1, 2, 0, 0), (1, 2, 0, 1), (1, 2, 0, 2), (1, 2, 1, 0), (1, 2, 1, 1), (1, 2, 1, 2), (1, 2, 2, 0), (1, 2, 2, 1), (1, 2, 2, 2), (2, 0, 0, 0), (2, 0, 0, 1), (2, 0, 0, 2), (2, 0, 1, 0), (2, 0, 1, 1), (2, 0, 1, 2), (2, 0, 2, 0), (2, 0, 2, 1), (2, 0, 2, 2), (2, 1, 0, 0), (2, 1, 0, 1), (2, 1, 0, 2), (2, 1, 1, 0), (2, 1, 1, 1), (2, 1, 1, 2), (2, 1, 2, 0), (2, 1, 2, 1), (2, 1, 2, 2), (2, 2, 0, 0), (2, 2, 0, 1), (2, 2, 0, 2), (2, 2, 1, 0), (2, 2, 1, 1), (2, 2, 1, 2), (2, 2, 2, 0), (2, 2, 2, 1), (2, 2, 2, 2), ]; struct VlcTable { codes: &'static [u32], lens: &'static [u8], } const SPECTRUM_TABLES: [VlcTable; 11] = [ VlcTable { codes: &SPECTRUM_CODEBOOK1_CODES, lens: &SPECTRUM_CODEBOOK1_LENS }, VlcTable { codes: &SPECTRUM_CODEBOOK2_CODES, lens: &SPECTRUM_CODEBOOK2_LENS }, VlcTable { codes: &SPECTRUM_CODEBOOK3_CODES, lens: &SPECTRUM_CODEBOOK3_LENS }, VlcTable { codes: &SPECTRUM_CODEBOOK4_CODES, lens: &SPECTRUM_CODEBOOK4_LENS }, VlcTable { codes: &SPECTRUM_CODEBOOK5_CODES, lens: &SPECTRUM_CODEBOOK5_LENS }, VlcTable { codes: &SPECTRUM_CODEBOOK6_CODES, lens: &SPECTRUM_CODEBOOK6_LENS }, VlcTable { codes: &SPECTRUM_CODEBOOK7_CODES, lens: &SPECTRUM_CODEBOOK7_LENS }, VlcTable { codes: &SPECTRUM_CODEBOOK8_CODES, lens: &SPECTRUM_CODEBOOK8_LENS }, VlcTable { codes: &SPECTRUM_CODEBOOK9_CODES, lens: &SPECTRUM_CODEBOOK9_LENS }, VlcTable { codes: &SPECTRUM_CODEBOOK10_CODES, lens: &SPECTRUM_CODEBOOK10_LENS }, VlcTable { codes: &SPECTRUM_CODEBOOK11_CODES, lens: &SPECTRUM_CODEBOOK11_LENS }, ]; /// Make a codebook that returns the index of the read code. trait MakeBasicCodebook { type ValueType; fn new(codebook: Codebook) -> Self; } /// Make a codebook that returns a value. trait MakeValueCodebook { type ValueType; fn new(codebook: Codebook, values: Box<[Self::ValueType]>) -> Self; } /// Codebook for spectral quads. #[derive(Default)] pub struct QuadsCodebook { codebook: Codebook, } impl QuadsCodebook { #[inline(always)] pub fn read_quant(&self, bs: &mut B) -> std::io::Result<(u8, u8, u8, u8)> { bs.read_codebook(&self.codebook).map(|(cw, _)| AAC_QUADS[cw as usize]) } } impl MakeBasicCodebook for QuadsCodebook { type ValueType = (u8, u8, u8, u8); fn new(codebook: Codebook) -> Self { Self { codebook } } } /// Codebook for spectral pairs. #[derive(Default)] pub struct PairsCodebook { codebook: Codebook, values: Box<[(f32, f32)]>, } impl PairsCodebook { #[inline(always)] pub fn read_dequant(&self, bs: &mut B) -> std::io::Result<(f32, f32)> { bs.read_codebook(&self.codebook).map(|(cw, _)| self.values[cw as usize]) } } impl MakeValueCodebook for PairsCodebook { type ValueType = (f32, f32); fn new(codebook: Codebook, values: Box<[Self::ValueType]>) -> Self { Self { codebook, values } } } /// Codebook for spectral pairs with an escape code. pub struct EscapeCodebook { codebook: Codebook, values: Box<[(u16, u16)]>, } impl EscapeCodebook { #[inline(always)] pub fn read_quant(&self, bs: &mut B) -> std::io::Result<(u16, u16)> { bs.read_codebook(&self.codebook).map(|(cw, _)| self.values[cw as usize]) } } impl MakeValueCodebook for EscapeCodebook { type ValueType = (u16, u16); fn new(codebook: Codebook, values: Box<[Self::ValueType]>) -> Self { Self { codebook, values } } } /// Given an AAC table containing a list of variable length codes and the length of each code, /// generate a codebook. fn make_raw_codebook(table: &VlcTable) -> Codebook { assert_eq!(table.codes.len(), table.lens.len()); let len = table.codes.len() as u16; // Generate the indicies for each code. let indicies: Vec = (0..len).collect(); // Generate the codebook. let mut builder = CodebookBuilder::new(BitOrder::Verbatim); // Read in 8-bit blocks. builder.bits_per_read(8); builder.make(table.codes, table.lens, &indicies).unwrap() } /// Generate a codebook, but also generate a list of values for each variable length code using /// the function `f`. The function `f` maps the index of a code to a value. fn make_value_codebook(table: &VlcTable, f: F) -> C where C: MakeValueCodebook, F: Fn(usize) -> C::ValueType, { let codebook = make_raw_codebook(table); // Generate values for the codebook. let values: Vec = (0..table.codes.len()).map(f).collect(); C::new(codebook, values.into_boxed_slice()) } /// Generate a codebook without any stored values. fn make_basic_codebook(table: &VlcTable) -> C where C: MakeBasicCodebook, { C::new(make_raw_codebook(table)) } /// Inverse quantization. #[inline(always)] fn iquant(val: usize) -> f32 { symphonia_core::dsp::portable::powf(val as f32, 4.0 / 3.0) } fn signed_pair(cw: usize) -> (f32, f32) { let modulo_2 = MOD >> 1; let a = cw / MOD; let b = cw % MOD; let x = if modulo_2 > a { -iquant(modulo_2 - a) } else { iquant(a - modulo_2) }; let y = if modulo_2 > b { -iquant(modulo_2 - b) } else { iquant(b - modulo_2) }; (x, y) } fn unsigned_pair(cw: usize) -> (f32, f32) { (iquant(cw / MOD), iquant(cw % MOD)) } fn escape_pair(cw: usize) -> (u16, u16) { ((cw / MOD) as u16, (cw % MOD) as u16) } lazy_static! { pub static ref QUADS: [QuadsCodebook; 4] = [ make_basic_codebook(&SPECTRUM_TABLES[0]), make_basic_codebook(&SPECTRUM_TABLES[1]), make_basic_codebook(&SPECTRUM_TABLES[2]), make_basic_codebook(&SPECTRUM_TABLES[3]), ]; } lazy_static! { pub static ref PAIRS: [PairsCodebook; 6] = [ make_value_codebook(&SPECTRUM_TABLES[4], signed_pair::<9>), make_value_codebook(&SPECTRUM_TABLES[5], signed_pair::<9>), make_value_codebook(&SPECTRUM_TABLES[6], unsigned_pair::<8>), make_value_codebook(&SPECTRUM_TABLES[7], unsigned_pair::<8>), make_value_codebook(&SPECTRUM_TABLES[8], unsigned_pair::<13>), make_value_codebook(&SPECTRUM_TABLES[9], unsigned_pair::<13>), ]; } lazy_static! { pub static ref ESC: EscapeCodebook = make_value_codebook(&SPECTRUM_TABLES[10], escape_pair::<17>); } lazy_static! { pub static ref SCALEFACTORS: Codebook = { assert_eq!(SCF_CODEBOOK_CODES.len(), SCF_CODEBOOK_LENS.len()); let len = SCF_CODEBOOK_CODES.len() as u8; // Generate the values for the codebook. let values: Vec = (0..len).collect(); // Generate the codebook. let mut builder = CodebookBuilder::new(BitOrder::Verbatim); // Read in 8-bit blocks. builder.bits_per_read(8); builder.make(&SCF_CODEBOOK_CODES, &SCF_CODEBOOK_LENS, &values).unwrap() }; } ==== end of vendor-symphonia-codec-aac/src/aac/codebooks.rs ==== ==== vendor-symphonia-codec-aac/src/aac/ics/mod.rs =========================== // Symphonia // Copyright (c) 2019-2022 The Project Symphonia Developers. // // Previous Author: Kostya Shishkov // // This source file includes code originally written for the NihAV // project. With the author's permission, it has been relicensed for, // and ported to the Symphonia project. // // This Source Code Form is subject to the terms of the Mozilla Public // License, v. 2.0. If a copy of the MPL was not distributed with this // file, You can obtain one at https://mozilla.org/MPL/2.0/. use symphonia_core::dsp::portable; use symphonia_core::errors::{decode_error, Result}; use symphonia_core::io::vlc::{Codebook, Entry8x16}; use symphonia_core::io::ReadBitsLtr; use crate::aac::codebooks; use crate::aac::common::*; use crate::aac::dsp; use crate::common::M4AType; use lazy_static::lazy_static; use log::debug; mod gain; mod ltp; mod pulse; mod tns; const ZERO_HCB: u8 = 0; const RESERVED_HCB: u8 = 12; const NOISE_HCB: u8 = 13; const INTENSITY_HCB2: u8 = 14; const INTENSITY_HCB: u8 = 15; const INTENSITY_SCALE_MIN: i16 = -155; const NORMAL_SCALE_MIN: i16 = -100; lazy_static! { /// Pre-computed table of y = x^(4/3). static ref POW43_TABLE: [f32; 8192] = { let mut pow43 = [0f32; 8192]; for (i, pow43) in pow43.iter_mut().enumerate() { *pow43 = portable::powf(i as f32, 4.0 / 3.0); } pow43 }; } lazy_static! { /// Pre-computed table of y = 2^(0.25 * (x - 156)) for decoding scale factors for normal bands. /// This table is indexed relative to -100, the minimum encoded scale factor value for normal /// bands. Therefore, an input of 0 corresponds to -100. static ref NORMAL_SCF_TABLE: [f32; 256] = { let mut table = [0f32; 256]; for (i, table) in table.iter_mut().enumerate() { *table = portable::powf(2.0, 0.25 * f32::from(i as i16 - 56 + NORMAL_SCALE_MIN)) } table }; } lazy_static! { /// Pre-computed table of y = 0.5^(0.25 * (x - 155)) for decoding scale factors for intensity /// coded bands. This table is indexed relative to -155, the minimum encoded scale factor value /// for intensity coded bands. Therefore, an input of 0 corresponds to -155. static ref INTENSITY_SCF_TABLE: [f32; 256] = { let mut table = [0f32; 256]; for (i, table) in table.iter_mut().enumerate() { *table = portable::powf(0.5, 0.25 * f32::from(i as i16 + INTENSITY_SCALE_MIN)); } table }; } #[derive(Clone)] pub struct IcsInfo { pub window_sequence: u8, pub prev_window_sequence: u8, pub window_shape: bool, pub prev_window_shape: bool, pub scale_factor_grouping: [bool; MAX_WINDOWS], pub group_start: [usize; MAX_WINDOWS], pub window_groups: usize, pub num_windows: usize, pub max_sfb: usize, pub long_win: bool, pub ltp: Option, } impl IcsInfo { fn new() -> Self { Self { window_sequence: 0, prev_window_sequence: 0, window_shape: false, prev_window_shape: false, scale_factor_grouping: [false; MAX_WINDOWS], group_start: [0; MAX_WINDOWS], num_windows: 0, window_groups: 0, max_sfb: 0, ltp: None, long_win: true, } } pub fn decode(&mut self, bs: &mut B) -> Result<()> { self.prev_window_sequence = self.window_sequence; self.prev_window_shape = self.window_shape; if bs.read_bool()? { return decode_error("aac: ics reserved bit set"); } self.window_sequence = bs.read_bits_leq32(2)? as u8; match self.prev_window_sequence { ONLY_LONG_SEQUENCE | LONG_STOP_SEQUENCE => { if (self.window_sequence != ONLY_LONG_SEQUENCE) && (self.window_sequence != LONG_START_SEQUENCE) { debug!("previous window is invalid"); } } LONG_START_SEQUENCE | EIGHT_SHORT_SEQUENCE => { if (self.window_sequence != EIGHT_SHORT_SEQUENCE) && (self.window_sequence != LONG_STOP_SEQUENCE) { debug!("previous window is invalid"); } } _ => {} }; self.window_shape = bs.read_bool()?; self.window_groups = 1; if self.window_sequence == EIGHT_SHORT_SEQUENCE { self.long_win = false; self.num_windows = 8; self.max_sfb = bs.read_bits_leq32(4)? as usize; for i in 0..MAX_WINDOWS - 1 { self.scale_factor_grouping[i] = bs.read_bool()?; if !self.scale_factor_grouping[i] { self.group_start[self.window_groups] = i + 1; self.window_groups += 1; } } } else { self.long_win = true; self.num_windows = 1; self.max_sfb = bs.read_bits_leq32(6)? as usize; self.ltp = ltp::LtpData::read(bs)?; } Ok(()) } pub fn copy_from_common(&mut self, other: &IcsInfo) { // Maintain the previous window sequence and shape. let prev_window_sequence = self.window_sequence; let prev_window_shape = self.window_shape; *self = other.clone(); self.prev_window_sequence = prev_window_sequence; self.prev_window_shape = prev_window_shape; } fn get_group_start(&self, g: usize) -> usize { if g == 0 { 0 } else if g >= self.window_groups { if self.long_win { 1 } else { 8 } } else { self.group_start[g] } } } #[derive(Clone)] pub struct Ics { global_gain: u8, pub info: IcsInfo, pulse: Option, tns: Option, gain: Option, sect_cb: [[u8; MAX_SFBS]; MAX_WINDOWS], sect_len: [[usize; MAX_SFBS]; MAX_WINDOWS], sfb_cb: [[u8; MAX_SFBS]; MAX_WINDOWS], num_sec: [usize; MAX_WINDOWS], pub scales: [[f32; MAX_SFBS]; MAX_WINDOWS], sbinfo: GASubbandInfo, pub coeffs: [f32; 1024], delay: [f32; 1024], } impl Ics { pub fn new(sbinfo: GASubbandInfo) -> Self { Self { global_gain: 0, info: IcsInfo::new(), pulse: None, tns: None, gain: None, sect_cb: [[0; MAX_SFBS]; MAX_WINDOWS], sect_len: [[0; MAX_SFBS]; MAX_WINDOWS], sfb_cb: [[0; MAX_SFBS]; MAX_WINDOWS], scales: [[0.0; MAX_SFBS]; MAX_WINDOWS], num_sec: [0; MAX_WINDOWS], sbinfo, coeffs: [0.0; 1024], delay: [0.0; 1024], } } pub fn reset(&mut self) { self.info = IcsInfo::new(); self.delay = [0.0; 1024]; } fn decode_section_data(&mut self, bs: &mut B) -> Result<()> { let sect_bits = if self.info.long_win { 5 } else { 3 }; let sect_esc_val = (1 << sect_bits) - 1; for g in 0..self.info.window_groups { let mut k = 0; let mut l = 0; while k < self.info.max_sfb { self.sect_cb[g][l] = bs.read_bits_leq32(4)? as u8; self.sect_len[g][l] = 0; if self.sect_cb[g][l] == RESERVED_HCB { return decode_error("aac: invalid band type"); } loop { let sect_len_incr = bs.read_bits_leq32(sect_bits)? as usize; self.sect_len[g][l] += sect_len_incr; if sect_len_incr < sect_esc_val { break; } } validate!(k + self.sect_len[g][l] <= self.info.max_sfb); for sfb in k..k + self.sect_len[g][l] { self.sfb_cb[g][sfb] = self.sect_cb[g][l]; } k += self.sect_len[g][l]; l += 1; } self.num_sec[g] = l; } Ok(()) } #[inline(always)] pub fn is_zero(&self, g: usize, sfb: usize) -> bool { self.sfb_cb[g][sfb] == ZERO_HCB } #[inline(always)] pub fn is_intensity(&self, g: usize, sfb: usize) -> bool { (self.sfb_cb[g][sfb] == INTENSITY_HCB) || (self.sfb_cb[g][sfb] == INTENSITY_HCB2) } #[inline(always)] pub fn is_noise(&self, g: usize, sfb: usize) -> bool { self.sfb_cb[g][sfb] == NOISE_HCB } #[inline(always)] pub fn get_intensity_dir(&self, g: usize, sfb: usize) -> bool { self.sfb_cb[g][sfb] == INTENSITY_HCB } fn decode_scale_factor_data(&mut self, bs: &mut B) -> Result<()> { let mut noise_pcm_flag = true; let mut scf_intensity = -INTENSITY_SCALE_MIN; let mut scf_noise = i16::from(self.global_gain) - 90 - NORMAL_SCALE_MIN; let mut scf_normal = i16::from(self.global_gain); let scf_cb: &Codebook = &codebooks::SCALEFACTORS; let table_normal_scf: &[f32; 256] = &NORMAL_SCF_TABLE; let table_intensity_scf: &[f32; 256] = &INTENSITY_SCF_TABLE; for g in 0..self.info.window_groups { for sfb in 0..self.info.max_sfb { self.scales[g][sfb] = if self.is_zero(g, sfb) { 0.0 } else if self.is_intensity(g, sfb) { scf_intensity += i16::from(bs.read_codebook(scf_cb)?.0) - 60; // Valid range is -155 to 100. Value offset by 155 for lookup table indexing. validate!((scf_intensity >= 0) && (scf_intensity < 256)); table_intensity_scf[scf_intensity as usize] } else if self.is_noise(g, sfb) { if noise_pcm_flag { noise_pcm_flag = false; scf_noise += (bs.read_bits_leq32(9)? as i16) - 256; } else { scf_noise += i16::from(bs.read_codebook(scf_cb)?.0) - 60; } // Valid range is -100 to 155. Value offset by 100 for lookup table indexing. validate!((scf_noise >= 0) && (scf_noise < 256)); table_normal_scf[scf_noise as usize] } else { scf_normal += i16::from(bs.read_codebook(scf_cb)?.0) - 60; // Valid range is -100 to 155. Value offset by 100 for lookup table indexing. validate!((scf_normal >= 0) && (scf_normal < 256)); table_normal_scf[scf_normal as usize] } } } Ok(()) } pub fn get_bands(&self) -> &'static [usize] { if self.info.long_win { self.sbinfo.long_bands } else { self.sbinfo.short_bands } } fn decode_spectrum(&mut self, bs: &mut B, lcg: &mut Lcg) -> Result<()> { // Zero all spectral coefficients. self.coeffs.fill(0.0); let bands = self.get_bands(); for g in 0..self.info.window_groups { let cur_w = self.info.get_group_start(g); let next_w = self.info.get_group_start(g + 1); for sfb in 0..self.info.max_sfb { let start = bands[sfb]; let end = bands[sfb + 1]; let cb_idx = self.sfb_cb[g][sfb]; let scale = self.scales[g][sfb]; for w in cur_w..next_w { let dst = &mut self.coeffs[start + w * 128..end + w * 128]; // Derived from ISO/IEC-14496-3 Table 4.151. match cb_idx { ZERO_HCB => (), RESERVED_HCB => (), NOISE_HCB => decode_noise(lcg, scale, dst), INTENSITY_HCB2 => (), INTENSITY_HCB => (), 1 => decode_quads_signed(bs, &codebooks::QUADS[0], scale, dst)?, 2 => decode_quads_signed(bs, &codebooks::QUADS[1], scale, dst)?, 3 => decode_quads_unsigned(bs, &codebooks::QUADS[2], scale, dst)?, 4 => decode_quads_unsigned(bs, &codebooks::QUADS[3], scale, dst)?, 5 => decode_pairs_signed(bs, &codebooks::PAIRS[0], scale, dst)?, 6 => decode_pairs_signed(bs, &codebooks::PAIRS[1], scale, dst)?, 7 => decode_pairs_unsigned(bs, &codebooks::PAIRS[2], scale, dst)?, 8 => decode_pairs_unsigned(bs, &codebooks::PAIRS[3], scale, dst)?, 9 => decode_pairs_unsigned(bs, &codebooks::PAIRS[4], scale, dst)?, 10 => decode_pairs_unsigned(bs, &codebooks::PAIRS[5], scale, dst)?, 11 => decode_pairs_unsigned_escape(bs, &codebooks::ESC, scale, dst)?, _ => unreachable!(), } } } } Ok(()) } pub fn decode( &mut self, bs: &mut B, lcg: &mut Lcg, m4atype: M4AType, common_window: bool, ) -> Result<()> { self.global_gain = bs.read_bits_leq32(8)? as u8; // If a common window is used, a common ICS info was decoded previously. if !common_window { self.info.decode(bs)?; } self.decode_section_data(bs)?; self.decode_scale_factor_data(bs)?; self.pulse = pulse::Pulse::read(bs)?; validate!(self.pulse.is_none() || self.info.long_win); let is_aac_lc = m4atype == M4AType::Lc; self.tns = tns::Tns::read(bs, &self.info, is_aac_lc)?; match m4atype { M4AType::Ssr => self.gain = gain::GainControl::read(bs)?, _ => { let gain_control_data_present = bs.read_bool()?; validate!(!gain_control_data_present); } } self.decode_spectrum(bs, lcg)?; Ok(()) } pub fn synth_channel(&mut self, dsp: &mut dsp::Dsp, rate_idx: usize, dst: &mut [f32]) { let bands = self.get_bands(); if let Some(pulse) = &self.pulse { pulse.synth(bands, &self.scales, &mut self.coeffs); } if let Some(tns) = &self.tns { tns.synth(&self.info, bands, rate_idx, &mut self.coeffs); } dsp.synth( &self.coeffs, &mut self.delay, self.info.window_sequence, self.info.window_shape, self.info.prev_window_shape, dst, ); } } /// Perceptual noise substitution decode step. Section 4.6.13.3. fn decode_noise(lcg: &mut Lcg, sf: f32, dst: &mut [f32]) { let mut energy = 0.0; for spec in dst.iter_mut() { // The random number generator outputs i32, but the largest signed // integer that can convert to f32 is i16. *spec = f32::from((lcg.next() >> 16) as i16); energy += *spec * *spec; } let scale = sf / energy.sqrt(); for spec in dst.iter_mut() { *spec *= scale; } } #[inline(always)] fn decode_sign(val: u32) -> f32 { 1.0 - 2.0 * val as f32 } fn decode_quads_unsigned( bs: &mut B, cb: &codebooks::QuadsCodebook, scale: f32, dst: &mut [f32], ) -> Result<()> { // Table of dequantized samples for all possible quantized values. let iquant = [0.0, scale, 2.51984209978974632953 * scale]; for out in dst.chunks_exact_mut(4) { let (a, b, c, d) = cb.read_quant(bs)?; if a != 0 { out[0] = decode_sign(bs.read_bit()?) * iquant[a as usize]; } if b != 0 { out[1] = decode_sign(bs.read_bit()?) * iquant[b as usize]; } if c != 0 { out[2] = decode_sign(bs.read_bit()?) * iquant[c as usize]; } if d != 0 { out[3] = decode_sign(bs.read_bit()?) * iquant[d as usize]; } } Ok(()) } fn decode_quads_signed( bs: &mut B, cb: &codebooks::QuadsCodebook, scale: f32, dst: &mut [f32], ) -> Result<()> { // Table of dequantized samples for all possible quantized values. let iquant = [-scale, 0.0, scale]; for out in dst.chunks_exact_mut(4) { let (a, b, c, d) = cb.read_quant(bs)?; out[0] = iquant[a as usize]; out[1] = iquant[b as usize]; out[2] = iquant[c as usize]; out[3] = iquant[d as usize]; } Ok(()) } fn decode_pairs_signed( bs: &mut B, cb: &codebooks::PairsCodebook, scale: f32, dst: &mut [f32], ) -> Result<()> { for out in dst.chunks_exact_mut(2) { let (x, y) = cb.read_dequant(bs)?; out[0] = x * scale; out[1] = y * scale; } Ok(()) } fn decode_pairs_unsigned( bs: &mut B, cb: &codebooks::PairsCodebook, scale: f32, dst: &mut [f32], ) -> Result<()> { for out in dst.chunks_exact_mut(2) { let (x, y) = cb.read_dequant(bs)?; let sign_x = if x != 0.0 { decode_sign(bs.read_bit()?) } else { 1.0 }; let sign_y = if y != 0.0 { decode_sign(bs.read_bit()?) } else { 1.0 }; out[0] = sign_x * x * scale; out[1] = sign_y * y * scale; } Ok(()) } fn decode_pairs_unsigned_escape( bs: &mut B, cb: &codebooks::EscapeCodebook, scale: f32, dst: &mut [f32], ) -> Result<()> { let iquant: &[f32; 8192] = &POW43_TABLE; for out in dst.chunks_exact_mut(2) { let (a, b) = cb.read_quant(bs)?; // Read the signs of the dequantized samples. let sign_x = if a != 0 { decode_sign(bs.read_bit()?) } else { 1.0 }; let sign_y = if b != 0 { decode_sign(bs.read_bit()?) } else { 1.0 }; let x = iquant[if a == 16 { read_escape(bs)? } else { a } as usize]; let y = iquant[if b == 16 { read_escape(bs)? } else { b } as usize]; out[0] = sign_x * x * scale; out[1] = sign_y * y * scale; } Ok(()) } fn read_escape(bs: &mut B) -> Result { let n = bs.read_unary_ones()?; validate!(n < 9); // The escape word is added to 2^(n + 4) to yield the unsigned value. let word = (1 << (n + 4)) + bs.read_bits_leq32(n + 4)? as u16; Ok(word) } ==== end of vendor-symphonia-codec-aac/src/aac/ics/mod.rs ==== ==== vendor-symphonia-codec-aac/src/aac/ics/pulse.rs ========================= // Symphonia // Copyright (c) 2019-2022 The Project Symphonia Developers. // // Previous Author: Kostya Shishkov // // This source file includes code originally written for the NihAV // project. With the author's permission, it has been relicensed for, // and ported to the Symphonia project. // // This Source Code Form is subject to the terms of the Mozilla Public // License, v. 2.0. If a copy of the MPL was not distributed with this // file, You can obtain one at https://mozilla.org/MPL/2.0/. use symphonia_core::dsp::portable; use symphonia_core::errors::Result; use symphonia_core::io::ReadBitsLtr; use crate::aac::common::{MAX_SFBS, MAX_WINDOWS}; #[inline(always)] fn iquant(val: f32) -> f32 { if val < 0.0 { -portable::powf(-val, 4.0 / 3.0) } else { portable::powf(val, 4.0 / 3.0) } } #[inline(always)] fn requant(val: f32, scale: f32) -> f32 { if scale == 0.0 { return 0.0; } let bval = val / scale; if bval >= 0.0 { portable::powf(val, 3.0 / 4.0) } else { -portable::powf(-val, 3.0 / 4.0) } } #[derive(Clone, Copy)] #[allow(dead_code)] pub struct Pulse { number_pulse: usize, pulse_start_sfb: usize, pulse_offset: [u8; 4], pulse_amp: [u8; 4], } impl Pulse { pub fn read(bs: &mut B) -> Result> { let pulse_data_present = bs.read_bool()?; if !pulse_data_present { return Ok(None); } let number_pulse = bs.read_bits_leq32(2)? as usize + 1; let pulse_start_sfb = bs.read_bits_leq32(6)? as usize; let mut pulse_offset: [u8; 4] = [0; 4]; let mut pulse_amp: [u8; 4] = [0; 4]; for i in 0..number_pulse { pulse_offset[i] = bs.read_bits_leq32(5)? as u8; pulse_amp[i] = bs.read_bits_leq32(4)? as u8; } Ok(Some(Self { number_pulse, pulse_start_sfb, pulse_offset, pulse_amp })) } pub fn synth( &self, bands: &[usize], scales: &[[f32; MAX_SFBS]; MAX_WINDOWS], coeffs: &mut [f32; 1024], ) { if self.pulse_start_sfb >= bands.len() - 1 { return; } let mut k = bands[self.pulse_start_sfb]; let mut band = self.pulse_start_sfb; for pno in 0..self.number_pulse { k += self.pulse_offset[pno] as usize; if k >= 1024 { return; } while bands[band + 1] <= k { band += 1; } let scale = scales[0][band]; let mut base = coeffs[k]; if base != 0.0 { base = requant(coeffs[k], scale); } if base > 0.0 { base += f32::from(self.pulse_amp[pno]); } else { base -= f32::from(self.pulse_amp[pno]); } coeffs[k] = iquant(base) * scale; } } } ==== end of vendor-symphonia-codec-aac/src/aac/ics/pulse.rs ==== ==== vendor-symphonia-codec-aac/src/aac/ics/tns.rs =========================== // Symphonia // Copyright (c) 2019-2022 The Project Symphonia Developers. // // Previous Author: Kostya Shishkov // // This source file includes code originally written for the NihAV // project. With the author's permission, it has been relicensed for, // and ported to the Symphonia project. // // This Source Code Form is subject to the terms of the Mozilla Public // License, v. 2.0. If a copy of the MPL was not distributed with this // file, You can obtain one at https://mozilla.org/MPL/2.0/. use symphonia_core::errors::Result; use symphonia_core::io::ReadBitsLtr; use std::f32::consts; use crate::aac::common::*; use crate::aac::ics::IcsInfo; const TNS_MAX_ORDER: usize = 20; const TNS_MAX_LONG_BANDS: [usize; 12] = [31, 31, 34, 40, 42, 51, 46, 46, 42, 42, 42, 39]; const TNS_MAX_SHORT_BANDS: [usize; 12] = [9, 9, 10, 14, 14, 14, 14, 14, 14, 14, 14, 14]; #[derive(Copy, Clone)] struct TnsCoeffs { length: usize, order: usize, direction: bool, coef: [f32; TNS_MAX_ORDER + 1], } impl TnsCoeffs { fn new() -> Self { Self { length: 0, order: 0, direction: false, coef: [0.0; TNS_MAX_ORDER + 1] } } fn read( &mut self, bs: &mut B, long_win: bool, coef_res: bool, max_order: usize, ) -> Result<()> { self.length = bs.read_bits_leq32(if long_win { 6 } else { 4 })? as usize; self.order = bs.read_bits_leq32(if long_win { 5 } else { 3 })? as usize; validate!(self.order <= max_order); if self.order > 0 { self.direction = bs.read_bool()?; let coef_compress = bs.read_bool()?; // If coef_res is true, then the transmitted resolution of the filter coefficients // is 4 bits, otherwise it's 3 (4.6.9.2). let mut coef_res_bits = if coef_res { 4 } else { 3 }; // If true, the most significant bit of the filter coefficient is not transmitted // (4.6.9.2). if coef_compress { coef_res_bits -= 1; } let sign_mask = 1 << (coef_res_bits - 1); let neg_mask = !((1 << coef_res_bits) - 1); // Derived from `1 << (coef_res_bits - 1)` before compression. let fac_base = if coef_res { 8.0 } else { 4.0 }; let iqfac = (fac_base - 0.5) / consts::FRAC_PI_2; let iqfac_m = (fac_base + 0.5) / consts::FRAC_PI_2; let mut tmp: [f32; TNS_MAX_ORDER] = [0.0; TNS_MAX_ORDER]; for el in tmp[..self.order].iter_mut() { let val = bs.read_bits_leq32(coef_res_bits)? as u8; // Convert to signed integer. let c = f32::from(if (val & sign_mask) != 0 { (val | neg_mask) as i8 } else { val as i8 }); *el = symphonia_core::dsp::portable::sinf(if c >= 0.0 { c / iqfac } else { c / iqfac_m }); } // Generate LPC coefficients let mut b: [f32; TNS_MAX_ORDER + 1] = [0.0; TNS_MAX_ORDER + 1]; for m in 1..=self.order { for i in 1..m { b[i] = self.coef[i - 1] + tmp[m - 1] * self.coef[m - i - 1]; } self.coef[..(m - 1)].copy_from_slice(&b[1..m]); self.coef[m - 1] = tmp[m - 1]; } } Ok(()) } } #[derive(Copy, Clone)] pub struct Tns { n_filt: [usize; MAX_WINDOWS], coeffs: [[TnsCoeffs; 4]; MAX_WINDOWS], } impl Tns { pub fn read(bs: &mut B, info: &IcsInfo, is_lc: bool) -> Result> { let tns_data_present = bs.read_bool()?; if !tns_data_present { return Ok(None); } // Table 4.156 let max_order = if !info.long_win { 7 } else if is_lc { 12 } else { TNS_MAX_ORDER }; let mut n_filt: [usize; MAX_WINDOWS] = [0; MAX_WINDOWS]; let mut coeffs: [[TnsCoeffs; 4]; MAX_WINDOWS] = [[TnsCoeffs::new(); 4]; MAX_WINDOWS]; for w in 0..info.num_windows { n_filt[w] = bs.read_bits_leq32(if info.long_win { 2 } else { 1 })? as usize; let coef_res = if n_filt[w] != 0 { bs.read_bool()? } else { false }; for filt in 0..n_filt[w] { coeffs[w][filt].read(bs, info.long_win, coef_res, max_order)?; } } Ok(Some(Self { n_filt, coeffs })) } pub fn synth( &self, info: &IcsInfo, bands: &[usize], rate_idx: usize, coeffs: &mut [f32; 1024], ) { let tns_max_bands = (if info.long_win { TNS_MAX_LONG_BANDS[rate_idx] } else { TNS_MAX_SHORT_BANDS[rate_idx] }) .min(info.max_sfb); for w in 0..info.num_windows { let mut bottom = bands.len() - 1; for f in 0..self.n_filt[w] { let top = bottom; bottom = top.saturating_sub(self.coeffs[w][f].length); let order = self.coeffs[w][f].order; if order == 0 { continue; } let start = w * 128 + bands[bottom.min(tns_max_bands)]; let end = w * 128 + bands[top.min(tns_max_bands)]; let lpc = &self.coeffs[w][f].coef; if !self.coeffs[w][f].direction { for (m, i) in (start..end).enumerate() { for j in 0..order.min(m) { coeffs[i] -= coeffs[i - j - 1] * lpc[j]; } } } else { for (m, i) in (start..end).rev().enumerate() { for j in 0..order.min(m) { coeffs[i] -= coeffs[i + j + 1] * lpc[j]; } } } } } } } ==== end of vendor-symphonia-codec-aac/src/aac/ics/tns.rs ==== ==== vendor-symphonia-bundle-mp3/Cargo.toml ================================== # THIS FILE IS AUTOMATICALLY GENERATED BY CARGO # # When uploading crates to the registry Cargo will automatically # "normalize" Cargo.toml files for maximal compatibility # with all versions of Cargo and also rewrite `path` dependencies # to registry (e.g., crates.io) dependencies. # # If you are reading this file be aware that the original Cargo.toml # will likely look very different (and much more reasonable). # See Cargo.toml.orig for the original contents. [package] edition = "2018" rust-version = "1.53" name = "symphonia-bundle-mp3" version = "0.5.5" authors = ["Philip Deljanov "] build = false autolib = false autobins = false autoexamples = false autotests = false autobenches = false description = "Pure Rust MP1, MP2, and MP3 demuxer and decoder (a part of project Symphonia)." homepage = "https://github.com/pdeljanov/Symphonia" readme = "README.md" keywords = [ "audio", "codec", "decoder", "mp3", "mpeg", ] categories = [ "multimedia", "multimedia::audio", "multimedia::encoding", ] license = "MPL-2.0" repository = "https://github.com/pdeljanov/Symphonia" [features] default = [ "mp1", "mp2", "mp3", ] mp1 = [] mp2 = [] mp3 = [] [lib] name = "symphonia_bundle_mp3" path = "src/lib.rs" [dependencies.lazy_static] version = "1.4.0" [dependencies.log] version = "0.4" [dependencies.symphonia-core] version = "0.5.5" [dependencies.symphonia-metadata] version = "0.5.5" [lints.rust] dead_code = "allow" ==== end of vendor-symphonia-bundle-mp3/Cargo.toml ==== ============================================================================== PART 2. THE MIT LICENCE ============================================================================== Printed once; it applies to each of the 527 packages listed after it, each with the copyright lines of its own copy. 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. The packages: adler2 2.0.1 (0BSD OR MIT OR Apache-2.0) https://github.com/oyvindln/adler2 aho-corasick 1.1.5 (Unlicense OR MIT) https://github.com/BurntSushi/aho-corasick Copyright (c) 2015 Andrew Gallant alsa 0.9.1 (Apache-2.0 OR MIT) https://github.com/diwic/alsa-rs Copyright (c) 2015-2021 David Henningsson, and other contributors. alsa-sys 0.3.1 (MIT) https://github.com/diwic/alsa-sys Copyright (c) 2018 diwic android_system_properties 0.1.6 (MIT OR Apache-2.0) https://github.com/nical/android_system_properties Copyright (c) 2013 Nicolas Silva anyhow 1.0.104 (MIT OR Apache-2.0) https://github.com/dtolnay/anyhow arrayvec 0.7.8 (MIT OR Apache-2.0) https://github.com/bluss/arrayvec Copyright (c) Ulrik Sverdrup "bluss" 2015-2023 async-broadcast 0.7.2 (MIT OR Apache-2.0) https://github.com/smol-rs/async-broadcast Copyright (c) 2020 Yoshua Wuyts async-channel 1.9.0 (Apache-2.0 OR MIT) https://github.com/smol-rs/async-channel async-channel 2.5.0 (Apache-2.0 OR MIT) https://github.com/smol-rs/async-channel async-compression 0.4.43 (MIT OR Apache-2.0) https://github.com/Nullus157/async-compression Copyright (c) 2018 the rustasync developers async-executor 1.14.0 (Apache-2.0 OR MIT) https://github.com/smol-rs/async-executor async-global-executor 2.4.1 (Apache-2.0 OR MIT) https://github.com/Keruspe/async-global-executor async-io 2.6.0 (Apache-2.0 OR MIT) https://github.com/smol-rs/async-io async-lock 3.4.2 (Apache-2.0 OR MIT) https://github.com/smol-rs/async-lock async-native-tls 0.5.0 (MIT OR Apache-2.0) https://github.com/async-email/async-native-tls async-process 2.5.0 (Apache-2.0 OR MIT) https://github.com/smol-rs/async-process async-recursion 1.1.1 (MIT OR Apache-2.0) https://github.com/dcchut/async-recursion async-signal 0.2.14 (Apache-2.0 OR MIT) https://github.com/smol-rs/async-signal async-std 1.13.2 (Apache-2.0 OR MIT) https://github.com/async-rs/async-std async-task 4.7.1 (Apache-2.0 OR MIT) https://github.com/smol-rs/async-task async-trait 0.1.92 (MIT OR Apache-2.0) https://github.com/dtolnay/async-trait async-tungstenite 0.29.1 (MIT) https://github.com/sdroege/async-tungstenite Copyright (c) 2017 Daniel Abramov Copyright (c) 2017 Alexey Galakhov Copyright (c) 2019 Sebastian Dröge atk 0.18.2 (MIT) https://github.com/gtk-rs/gtk3-rs atk-sys 0.18.2 (MIT) https://github.com/gtk-rs/gtk3-rs atomic-waker 1.1.2 (Apache-2.0 OR MIT) https://github.com/smol-rs/atomic-waker autocfg 1.5.1 (Apache-2.0 OR MIT) https://github.com/cuviper/autocfg Copyright (c) 2018 Josh Stone base64 0.21.7 (MIT OR Apache-2.0) https://github.com/marshallpierce/rust-base64 Copyright (c) 2015 Alice Maz base64 0.22.1 (MIT OR Apache-2.0) https://github.com/marshallpierce/rust-base64 Copyright (c) 2015 Alice Maz bit-set 0.8.0 (Apache-2.0 OR MIT) https://github.com/contain-rs/bit-set Copyright (c) 2023 The Rust Project Developers bit-vec 0.8.0 (Apache-2.0 OR MIT) https://github.com/contain-rs/bit-vec Copyright (c) 2023 The Rust Project Developers bitflags 1.3.2 (MIT OR Apache-2.0) https://github.com/bitflags/bitflags Copyright (c) 2014 The Rust Project Developers bitflags 2.13.1 (MIT OR Apache-2.0) https://github.com/bitflags/bitflags Copyright (c) 2014 The Rust Project Developers block-buffer 0.10.4 (MIT OR Apache-2.0) https://github.com/RustCrypto/utils Copyright (c) 2018-2019 The RustCrypto Project Developers block2 0.6.2 (MIT) https://github.com/madsmtm/objc2 ships no copy of this licence; it declares it in its Cargo.toml blocking 1.6.2 (Apache-2.0 OR MIT) https://github.com/smol-rs/blocking bmrng 0.5.2 (MIT OR Apache-2.0) https://github.com/oguzbilgener/bmrng ships no copy of this licence; it declares it in its Cargo.toml brotli 8.0.4 (BSD-3-Clause AND MIT) https://github.com/dropbox/rust-brotli Copyright (c) 2009, 2010, 2013-2016 by the Brotli Authors. bs58 0.5.1 (MIT OR Apache-2.0) https://github.com/Nullus157/bs58-rs Copyright (c) 2016 The roaring-rs developers. bumpalo 3.20.3 (MIT OR Apache-2.0) https://github.com/fitzgen/bumpalo Copyright (c) 2019 Nick Fitzgerald byteorder 1.5.0 (Unlicense OR MIT) https://github.com/BurntSushi/byteorder Copyright (c) 2015 Andrew Gallant bytes 1.12.1 (MIT) https://github.com/tokio-rs/bytes Copyright (c) 2018 Carl Lerche cairo-rs 0.18.5 (MIT) https://github.com/gtk-rs/gtk-rs-core cairo-sys-rs 0.18.2 (MIT) https://github.com/gtk-rs/gtk-rs-core camino 1.2.5 (MIT OR Apache-2.0) https://github.com/camino-rs/camino cargo-platform 0.1.9 (MIT OR Apache-2.0) https://github.com/rust-lang/cargo cargo_metadata 0.19.2 (MIT) https://github.com/oli-obk/cargo_metadata cc 1.4.2 (MIT OR Apache-2.0) https://github.com/rust-lang/cc-rs Copyright (c) 2014 Alex Crichton cesu8 1.1.0 (Apache-2.0 OR MIT) https://github.com/emk/cesu8-rs ships no copy of this licence; it declares it in its Cargo.toml cexpr 0.6.0 (Apache-2.0 OR MIT) https://github.com/jethrogb/rust-cexpr (C) Copyright 2016 Jethro G. Beekman cfb 0.7.3 (MIT) https://github.com/mdsteele/rust-cfb Copyright (c) 2017 Matthew D. Steele cfg-expr 0.15.8 (MIT OR Apache-2.0) https://github.com/EmbarkStudios/cfg-expr Copyright (c) 2019 Embark Studios cfg-if 1.0.4 (MIT OR Apache-2.0) https://github.com/rust-lang/cfg-if Copyright (c) 2014 Alex Crichton cfg_aliases 0.2.2 (MIT) https://github.com/katharostech/cfg_aliases Copyright (c) 2020 Katharos Technology chacha20 0.10.1 (MIT OR Apache-2.0) https://github.com/RustCrypto/stream-ciphers Copyright (c) 2019-2026 The RustCrypto Project Developers combine 4.6.7 (MIT) https://github.com/Marwes/combine Copyright (c) 2015 Markus Westerlind compression-codecs 0.4.38 (MIT OR Apache-2.0) https://github.com/Nullus157/async-compression Copyright (c) 2018 the rustasync developers compression-core 0.4.32 (MIT OR Apache-2.0) https://github.com/Nullus157/async-compression Copyright (c) 2018 the rustasync developers concurrent-queue 2.5.0 (Apache-2.0 OR MIT) https://github.com/smol-rs/concurrent-queue cookie 0.18.1 (MIT OR Apache-2.0) https://github.com/SergioBenitez/cookie-rs Copyright (c) 2017 Sergio Benitez Copyright (c) 2014 Alex Crichton core-foundation 0.10.1 (MIT OR Apache-2.0) https://github.com/servo/core-foundation-rs Copyright (c) 2012-2013 Mozilla Foundation core-foundation-sys 0.8.7 (MIT OR Apache-2.0) https://github.com/servo/core-foundation-rs Copyright (c) 2012-2013 Mozilla Foundation core-graphics 0.25.0 (MIT OR Apache-2.0) https://github.com/servo/core-foundation-rs Copyright (c) 2012-2013 Mozilla Foundation core-graphics-types 0.2.0 (MIT OR Apache-2.0) https://github.com/servo/core-foundation-rs Copyright (c) 2012-2013 Mozilla Foundation coreaudio-rs 0.11.3 (MIT OR Apache-2.0) https://github.com/RustAudio/coreaudio-rs.git Copyright (c) 2015 coreaudio-sys 0.2.18 (MIT) https://github.com/RustAudio/coreaudio-sys.git Copyright (c) 2015 coremidi 0.9.2 (MIT) https://github.com/chris-zen/coremidi Copyright (c) 2016 Christian Perez-Llamas coremidi-sys 3.2.1 (MIT) https://github.com/jonas-k/coremidi-sys Copyright (c) 2015 Jonas Klesy cpufeatures 0.2.17 (MIT OR Apache-2.0) https://github.com/RustCrypto/utils Copyright (c) 2020-2025 The RustCrypto Project Developers cpufeatures 0.3.0 (MIT OR Apache-2.0) https://github.com/RustCrypto/utils Copyright (c) 2020-2025 The RustCrypto Project Developers crc32fast 1.5.0 (MIT OR Apache-2.0) https://github.com/srijs/rust-crc32fast Copyright (c) 2018 Sam Rijs, Alex Crichton and contributors crossbeam-channel 0.5.16 (MIT OR Apache-2.0) https://github.com/crossbeam-rs/crossbeam Copyright (c) 2019 The Crossbeam Project Developers crossbeam-utils 0.8.22 (MIT OR Apache-2.0) https://github.com/crossbeam-rs/crossbeam Copyright (c) 2019 The Crossbeam Project Developers crypto-common 0.1.7 (MIT OR Apache-2.0) https://github.com/RustCrypto/traits Copyright (c) 2021 RustCrypto Developers ctor 0.8.0 (Apache-2.0 OR MIT) https://github.com/mmastrac/rust-ctor ctor-proc-macro 0.0.7 (Apache-2.0 OR MIT) https://github.com/mmastrac/rust-ctor cxx 1.0.199 (MIT OR Apache-2.0) https://github.com/dtolnay/cxx cxx-build 1.0.199 (MIT OR Apache-2.0) https://github.com/dtolnay/cxx cxxbridge-flags 1.0.199 (MIT OR Apache-2.0) https://github.com/dtolnay/cxx cxxbridge-macro 1.0.199 (MIT OR Apache-2.0) https://github.com/dtolnay/cxx darling 0.14.4 (MIT) https://github.com/TedDriggs/darling Copyright (c) 2017 Ted Driggs darling 0.23.0 (MIT) https://github.com/TedDriggs/darling Copyright (c) 2017 Ted Driggs darling_core 0.14.4 (MIT) https://github.com/TedDriggs/darling Copyright (c) 2017 Ted Driggs darling_core 0.23.0 (MIT) https://github.com/TedDriggs/darling Copyright (c) 2017 Ted Driggs darling_macro 0.14.4 (MIT) https://github.com/TedDriggs/darling Copyright (c) 2017 Ted Driggs darling_macro 0.23.0 (MIT) https://github.com/TedDriggs/darling Copyright (c) 2017 Ted Driggs dasp_sample 0.11.0 (MIT OR Apache-2.0) https://github.com/rustaudio/sample.git ships no copy of this licence; it declares it in its Cargo.toml data-encoding 2.11.1 (MIT) https://github.com/ia0/data-encoding Copyright (c) 2015-2020 Julien Cretin Copyright (c) 2017-2020 Google Inc. dbus 0.9.12 (Apache-2.0 OR MIT) https://github.com/diwic/dbus-rs Copyright (c) 2014-2018 David Henningsson and other contributors deranged 0.5.8 (MIT OR Apache-2.0) https://github.com/jhpratt/deranged Copyright (c) 2024 Jacob Pratt et al. derive_more 2.1.1 (MIT) https://github.com/JelteF/derive_more Copyright (c) 2016 Jelte Fennema derive_more-impl 2.1.1 (MIT) https://github.com/JelteF/derive_more Copyright (c) 2016 Jelte Fennema digest 0.10.7 (MIT OR Apache-2.0) https://github.com/RustCrypto/traits Copyright (c) 2017 Artyom Pavlov dirs 6.0.0 (MIT OR Apache-2.0) https://github.com/soc/dirs-rs Copyright (c) 2018-2019 dirs-rs contributors dirs-sys 0.5.0 (MIT OR Apache-2.0) https://github.com/dirs-dev/dirs-sys-rs Copyright (c) 2018-2019 dirs-rs contributors dispatch2 0.3.1 (Zlib OR Apache-2.0 OR MIT) https://github.com/madsmtm/objc2 ships no copy of this licence; it declares it in its Cargo.toml displaydoc 0.2.7 (MIT OR Apache-2.0) https://github.com/yaahc/displaydoc dlopen2 0.8.2 (MIT) https://github.com/OpenByteDev/dlopen2 ships no copy of this licence; it declares it in its Cargo.toml dlopen2_derive 0.4.3 (MIT) https://github.com/OpenByteDev/dlopen2 ships no copy of this licence; it declares it in its Cargo.toml dtoa 1.0.11 (MIT OR Apache-2.0) https://github.com/dtolnay/dtoa dtor 0.3.0 (Apache-2.0 OR MIT) https://github.com/mmastrac/rust-ctor dtor-proc-macro 0.0.6 (Apache-2.0 OR MIT) https://github.com/mmastrac/rust-ctor dyn-clone 1.0.20 (MIT OR Apache-2.0) https://github.com/dtolnay/dyn-clone either 1.17.0 (MIT OR Apache-2.0) https://github.com/rayon-rs/either Copyright (c) 2015 embed-resource 3.0.11 (MIT) https://github.com/nabijaczleweli/rust-embed-resource Copyright (c) 2017 nabijaczleweli embed_plist 1.2.2 (MIT OR Apache-2.0) https://github.com/nvzqz/embed-plist-rs Copyright (c) 2020 Nikolai Vazquez encoding_rs 0.8.35 ((Apache-2.0 OR MIT) AND BSD-3-Clause) https://github.com/hsivonen/encoding_rs Copyright Mozilla Foundation endi 1.1.1 (MIT) https://github.com/zeenix/endi enumflags2 0.7.12 (MIT OR Apache-2.0) https://github.com/meithecatte/enumflags2 Copyright (c) 2017-2023 Maik Klein, Maja Kądziołka enumflags2_derive 0.7.12 (MIT OR Apache-2.0) https://github.com/meithecatte/enumflags2 Copyright (c) 2017 Maik Klein equivalent 1.0.2 (Apache-2.0 OR MIT) https://github.com/indexmap-rs/equivalent Copyright (c) 2016--2023 erased-serde 0.4.10 (MIT OR Apache-2.0) https://github.com/dtolnay/erased-serde errno 0.3.14 (MIT OR Apache-2.0) https://github.com/lambda-fairy/rust-errno Copyright (c) 2014 Chris Wong event-listener 2.5.3 (Apache-2.0 OR MIT) https://github.com/smol-rs/event-listener event-listener 5.4.2 (Apache-2.0 OR MIT) https://github.com/smol-rs/event-listener event-listener-strategy 0.5.4 (Apache-2.0 OR MIT) https://github.com/smol-rs/event-listener-strategy extended 0.1.0 (MIT) https://github.com/depp/extended-rs Copyright 2022 Dietrich Epp fastrand 2.5.0 (Apache-2.0 OR MIT) https://github.com/smol-rs/fastrand fdeflate 0.3.7 (MIT OR Apache-2.0) https://github.com/image-rs/fdeflate field-offset 0.3.6 (MIT OR Apache-2.0) https://github.com/Diggsey/rust-field-offset Copyright (c) 2016-2021 Diggory Blake, and other contributors. find-msvc-tools 0.1.10 (MIT OR Apache-2.0) https://github.com/rust-lang/cc-rs Copyright (c) 2014 Alex Crichton fixedbitset 0.4.2 (MIT OR Apache-2.0) https://github.com/petgraph/fixedbitset Copyright (c) 2015-2017 flate2 1.1.9 (MIT OR Apache-2.0) https://github.com/rust-lang/flate2-rs Copyright (c) 2014-2026 Alex Crichton fnv 1.0.7 (Apache-2.0 OR MIT) https://github.com/servo/rust-fnv Copyright (c) 2017 Contributors foreign-types 0.3.2 (MIT OR Apache-2.0) https://github.com/sfackler/foreign-types Copyright (c) 2017 The foreign-types Developers foreign-types 0.5.0 (MIT OR Apache-2.0) https://github.com/sfackler/foreign-types Copyright (c) 2017 The foreign-types Developers foreign-types-macros 0.2.4 (MIT OR Apache-2.0) https://github.com/sfackler/foreign-types Copyright (c) 2017 The foreign-types Developers foreign-types-shared 0.1.1 (MIT OR Apache-2.0) https://github.com/sfackler/foreign-types Copyright (c) 2017 The foreign-types Developers foreign-types-shared 0.3.1 (MIT OR Apache-2.0) https://github.com/sfackler/foreign-types Copyright (c) 2017 The foreign-types Developers form_urlencoded 1.2.2 (MIT OR Apache-2.0) https://github.com/servo/rust-url Copyright (c) 2013-2016 The rust-url developers from_variants 1.0.2 (MIT OR Apache-2.0) https://github.com/TedDriggs/from_variants ships no copy of this licence; it declares it in its Cargo.toml from_variants_impl 1.0.2 (MIT OR Apache-2.0) https://github.com/TedDriggs/from_variants ships no copy of this licence; it declares it in its Cargo.toml fs2 0.4.3 (MIT OR Apache-2.0) https://github.com/danburkert/fs2-rs Copyright (c) 2015 The Rust Project Developers futures 0.3.33 (MIT OR Apache-2.0) https://github.com/rust-lang/futures-rs Copyright (c) 2016 Alex Crichton Copyright (c) 2017 The Tokio Authors futures-channel 0.3.33 (MIT OR Apache-2.0) https://github.com/rust-lang/futures-rs Copyright (c) 2016 Alex Crichton Copyright (c) 2017 The Tokio Authors futures-core 0.3.33 (MIT OR Apache-2.0) https://github.com/rust-lang/futures-rs Copyright (c) 2016 Alex Crichton Copyright (c) 2017 The Tokio Authors futures-executor 0.3.33 (MIT OR Apache-2.0) https://github.com/rust-lang/futures-rs Copyright (c) 2016 Alex Crichton Copyright (c) 2017 The Tokio Authors futures-io 0.3.33 (MIT OR Apache-2.0) https://github.com/rust-lang/futures-rs Copyright (c) 2016 Alex Crichton Copyright (c) 2017 The Tokio Authors futures-lite 2.6.1 (Apache-2.0 OR MIT) https://github.com/smol-rs/futures-lite futures-macro 0.3.33 (MIT OR Apache-2.0) https://github.com/rust-lang/futures-rs Copyright (c) 2016 Alex Crichton Copyright (c) 2017 The Tokio Authors futures-sink 0.3.33 (MIT OR Apache-2.0) https://github.com/rust-lang/futures-rs Copyright (c) 2016 Alex Crichton Copyright (c) 2017 The Tokio Authors futures-task 0.3.33 (MIT OR Apache-2.0) https://github.com/rust-lang/futures-rs Copyright (c) 2016 Alex Crichton Copyright (c) 2017 The Tokio Authors futures-util 0.3.33 (MIT OR Apache-2.0) https://github.com/rust-lang/futures-rs Copyright (c) 2016 Alex Crichton Copyright (c) 2017 The Tokio Authors gdk 0.18.2 (MIT) https://github.com/gtk-rs/gtk3-rs gdk-pixbuf 0.18.5 (MIT) https://github.com/gtk-rs/gtk-rs-core gdk-pixbuf-sys 0.18.0 (MIT) https://github.com/gtk-rs/gtk-rs-core gdk-sys 0.18.2 (MIT) https://github.com/gtk-rs/gtk3-rs gdkwayland-sys 0.18.2 (MIT) https://github.com/gtk-rs/gtk3-rs gdkx11 0.18.2 (MIT) https://github.com/gtk-rs/gtk3-rs gdkx11-sys 0.18.2 (MIT) https://github.com/gtk-rs/gtk3-rs generic-array 0.14.7 (MIT) https://github.com/fizyk20/generic-array.git Copyright (c) 2015 Bartłomiej Kamiński getrandom 0.2.17 (MIT OR Apache-2.0) https://github.com/rust-random/getrandom Copyright (c) 2018-2024 The rust-random Project Developers Copyright (c) 2014 The Rust Project Developers getrandom 0.3.4 (MIT OR Apache-2.0) https://github.com/rust-random/getrandom Copyright (c) 2018-2025 The rust-random Project Developers Copyright (c) 2014 The Rust Project Developers getrandom 0.4.3 (MIT OR Apache-2.0) https://github.com/rust-random/getrandom Copyright (c) 2018-2026 The rust-random Project Developers Copyright (c) 2014 The Rust Project Developers gio 0.18.4 (MIT) https://github.com/gtk-rs/gtk-rs-core gio-sys 0.18.1 (MIT) https://github.com/gtk-rs/gtk-rs-core glib 0.18.5 (MIT) https://github.com/gtk-rs/gtk-rs-core glib-macros 0.18.5 (MIT) https://github.com/gtk-rs/gtk-rs-core glib-sys 0.18.1 (MIT) https://github.com/gtk-rs/gtk-rs-core glob 0.3.4 (MIT OR Apache-2.0) https://github.com/rust-lang/glob Copyright (c) 2014 The Rust Project Developers gloo-timers 0.3.0 (MIT OR Apache-2.0) https://github.com/rustwasm/gloo/tree/master/crates/timers ships no copy of this licence; it declares it in its Cargo.toml gobject-sys 0.18.0 (MIT) https://github.com/gtk-rs/gtk-rs-core gtk 0.18.2 (MIT) https://github.com/gtk-rs/gtk3-rs gtk-sys 0.18.2 (MIT) https://github.com/gtk-rs/gtk3-rs gtk3-macros 0.18.2 (MIT) https://github.com/gtk-rs/gtk3-rs hashbrown 0.12.3 (MIT OR Apache-2.0) https://github.com/rust-lang/hashbrown Copyright (c) 2016 Amanieu d'Antras hashbrown 0.17.1 (MIT OR Apache-2.0) https://github.com/rust-lang/hashbrown Copyright (c) 2016 Amanieu d'Antras heck 0.4.1 (MIT OR Apache-2.0) https://github.com/withoutboats/heck Copyright (c) 2015 The Rust Project Developers heck 0.5.0 (MIT OR Apache-2.0) https://github.com/withoutboats/heck Copyright (c) 2015 The Rust Project Developers hermit-abi 0.5.2 (MIT OR Apache-2.0) https://github.com/hermit-os/hermit-rs hex 0.4.3 (MIT OR Apache-2.0) https://github.com/KokaKiwi/rust-hex Copyright (c) 2013-2014 The Rust Project Developers. Copyright (c) 2015-2020 The rust-hex Developers hmac 0.12.1 (MIT OR Apache-2.0) https://github.com/RustCrypto/MACs Copyright (c) 2017 Artyom Pavlov html5ever 0.38.0 (MIT OR Apache-2.0) https://github.com/servo/html5ever Copyright (c) 2014 The html5ever Project Developers http 1.5.0 (MIT OR Apache-2.0) https://github.com/hyperium/http Copyright (c) 2017 http-rs authors http-body 1.1.0 (MIT) https://github.com/hyperium/http-body Copyright (c) 2019-2026 Sean McArthur & Hyper Contributors http-body-util 0.1.4 (MIT) https://github.com/hyperium/http-body Copyright (c) 2019-2026 Sean McArthur & Hyper Contributors httparse 1.10.1 (MIT OR Apache-2.0) https://github.com/seanmonstar/httparse Copyright (c) 2015-2025 Sean McArthur hyper 1.11.0 (MIT) https://github.com/hyperium/hyper Copyright (c) 2014-2026 Sean McArthur hyper-rustls 0.27.9 (Apache-2.0 OR ISC OR MIT) https://github.com/rustls/hyper-rustls Copyright (c) 2016 Joseph Birr-Pixton hyper-tls 0.6.0 (MIT OR Apache-2.0) https://github.com/hyperium/hyper-tls Copyright (c) 2017 Sean McArthur hyper-util 0.1.20 (MIT) https://github.com/hyperium/hyper-util Copyright (c) 2023-2025 Sean McArthur iana-time-zone 0.1.65 (MIT OR Apache-2.0) https://github.com/strawlab/iana-time-zone Copyright (c) 2020 Andrew D. Straw iana-time-zone-haiku 0.1.2 (MIT OR Apache-2.0) https://github.com/strawlab/iana-time-zone Copyright (c) 2020 Andrew D. Straw ico 0.5.0 (MIT) https://github.com/mdsteele/rust-ico Copyright (c) 2018 Matthew D. Steele ident_case 1.0.1 (MIT OR Apache-2.0) https://github.com/TedDriggs/ident_case idna 1.1.0 (MIT OR Apache-2.0) https://github.com/servo/rust-url/ Copyright (c) 2013-2025 The rust-url developers idna_adapter 1.2.2 (Apache-2.0 OR MIT) https://github.com/hsivonen/idna_adapter Copyright (c) The rust-url developers if-addrs 0.15.0 (MIT OR BSD-3-Clause) https://github.com/messense/if-addrs Copyright 2018 MaidSafe.net limited. Copyright 2020 messense indexmap 1.9.3 (Apache-2.0 OR MIT) https://github.com/bluss/indexmap Copyright (c) 2016--2017 indexmap 2.14.0 (Apache-2.0 OR MIT) https://github.com/indexmap-rs/indexmap Copyright (c) 2016--2017 infer 0.19.0 (MIT) https://github.com/bojand/infer Copyright (c) 2019 Bojan ipnet 2.12.1 (MIT OR Apache-2.0) https://github.com/krisprice/ipnet Copyright 2017 Juniper Networks, Inc. itertools 0.11.0 (MIT OR Apache-2.0) https://github.com/rust-itertools/itertools Copyright (c) 2015 itertools 0.12.1 (MIT OR Apache-2.0) https://github.com/rust-itertools/itertools Copyright (c) 2015 itertools 0.13.0 (MIT OR Apache-2.0) https://github.com/rust-itertools/itertools Copyright (c) 2015 itoa 1.0.18 (MIT OR Apache-2.0) https://github.com/dtolnay/itoa javascriptcore-rs 1.1.2 (MIT) https://github.com/tauri-apps/javascriptcore-rs Copyright (c) 2013-2021, The Gtk-rs Project Developers. Copyright (c) 2021, Tauri Programme within The Commons Conservancy. javascriptcore-rs-sys 1.1.1 (MIT) https://github.com/tauri-apps/javascriptcore-rs Copyright (c) 2013-2017, The Gtk-rs Project Developers. jni 0.21.1 (MIT OR Apache-2.0) https://github.com/jni-rs/jni-rs Copyright (c) 2016 Prevoty, Inc. and jni-rs contributors jni-sys 0.3.1 (MIT OR Apache-2.0) https://github.com/jni-rs/jni-sys Copyright (c) 2015 The rust-jni-sys Developers jni-sys 0.4.1 (MIT OR Apache-2.0) https://github.com/jni-rs/jni-sys Copyright (c) 2015 The rust-jni-sys Developers jni-sys-macros 0.4.1 (MIT OR Apache-2.0) https://github.com/jni-rs/jni-sys ships no copy of this licence; it declares it in its Cargo.toml jobserver 0.1.35 (MIT OR Apache-2.0) https://github.com/rust-lang/jobserver-rs Copyright (c) 2014 Alex Crichton js-sys 0.3.104 (MIT OR Apache-2.0) https://github.com/wasm-bindgen/wasm-bindgen/tree/master/crates/js-sys Copyright (c) 2014 Alex Crichton json-patch 3.0.1 (MIT OR Apache-2.0) https://github.com/idubrov/json-patch Copyright (c) 2017 Ivan Dubrov jsonptr 0.6.3 (MIT OR Apache-2.0) https://github.com/chanced/jsonptr Copyright (c) 2022 Chance Dinkins jsonwebtoken 10.4.0 (MIT) https://github.com/Keats/jsonwebtoken Copyright (c) 2015 Vincent Prouillet keyboard-types 0.7.0 (MIT OR Apache-2.0) https://github.com/pyfisch/keyboard-types Copyright (c) 2017 Pyfisch kv-log-macro 1.0.7 (MIT OR Apache-2.0) https://github.com/yoshuawuyts/kv-log-macro Copyright (c) 2019 Yoshua Wuyts lazy_static 1.5.0 (MIT OR Apache-2.0) https://github.com/rust-lang-nursery/lazy-static.rs Copyright (c) 2010 The Rust Project Developers libappindicator 0.9.0 (Apache-2.0 OR MIT) Copyright (c) 2017-2021 qDot Copyright (c) 2021 Tauri Apps Contributors libappindicator-sys 0.9.0 (Apache-2.0 OR MIT) ships no copy of this licence; it declares it in its Cargo.toml libc 0.2.189 (MIT OR Apache-2.0) https://github.com/rust-lang/libc Copyright (c) The Rust Project Developers libdbus-sys 0.2.7 (Apache-2.0 OR MIT) https://github.com/diwic/dbus-rs Copyright (c) 2014-2018 David Henningsson and other contributors libredox 0.1.19 (MIT) https://gitlab.redox-os.org/redox-os/libredox.git Copyright (c) 2023 4lDO2 link-cplusplus 1.0.12 (MIT OR Apache-2.0) https://github.com/dtolnay/link-cplusplus linux-raw-sys 0.12.1 (Apache-2.0 WITH LLVM-exception OR Apache-2.0 OR MIT) https://github.com/sunfishcode/linux-raw-sys lock_api 0.4.14 (MIT OR Apache-2.0) https://github.com/Amanieu/parking_lot Copyright (c) 2016 The Rust Project Developers log 0.4.33 (MIT OR Apache-2.0) https://github.com/rust-lang/log Copyright (c) 2014 The Rust Project Developers lru-slab 0.1.2 (MIT OR Apache-2.0 OR Zlib) https://github.com/Ralith/lru-slab Copyright (c) 2024 The lru-slab Developers mac_address 1.1.8 (MIT OR Apache-2.0) https://github.com/rep-nop/mac_address Copyright © 2018 Wesley Norris mach2 0.4.3 (BSD-2-Clause OR MIT OR Apache-2.0) https://github.com/JohnTitor/mach2 Copyright (c) 2019 Nick Fitzgerald, 2021 Yuki Okushi markup5ever 0.38.0 (MIT OR Apache-2.0) https://github.com/servo/html5ever Copyright (c) 2014 The html5ever Project Developers matchers 0.2.0 (MIT) https://github.com/hawkw/matchers Copyright (c) 2019 Eliza Weisman memchr 2.8.3 (Unlicense OR MIT) https://github.com/BurntSushi/memchr Copyright (c) 2015 Andrew Gallant memoffset 0.9.1 (MIT) https://github.com/Gilnaa/memoffset Copyright (c) 2017 Gilad Naaman midir 0.10.4 (MIT) https://github.com/Boddlnagg/midir Copyright (c) 2015 Patrick Reisert and the RtMidi contributors mime 0.3.17 (MIT OR Apache-2.0) https://github.com/hyperium/mime Copyright (c) 2014 Sean McArthur minimal-lexical 0.2.1 (MIT OR Apache-2.0) https://github.com/Alexhuszagh/minimal-lexical miniz_oxide 0.8.9 (MIT OR Zlib OR Apache-2.0) https://github.com/Frommi/miniz_oxide/tree/master/miniz_oxide Copyright 2013-2014 RAD Game Tools and Valve Software Copyright 2010-2014 Rich Geldreich and Tenacious Software LLC Copyright (c) 2017 Frommi Copyright (c) 2017-2024 oyvindln mio 1.2.2 (MIT) https://github.com/tokio-rs/mio Copyright (c) 2014 Carl Lerche and other MIO contributors muda 0.19.3 (Apache-2.0 OR MIT) https://github.com/tauri-apps/muda Copyright (c) 2022-2022 Tauri Programme within The Commons Conservancy multimap 0.10.1 (MIT OR Apache-2.0) https://github.com/havarnov/multimap Copyright (c) 2016 multimap developers native-tls 0.2.18 (MIT OR Apache-2.0) https://github.com/rust-native-tls/rust-native-tls Copyright (c) 2016 The rust-native-tls Developers ndk 0.8.0 (MIT OR Apache-2.0) https://github.com/rust-mobile/ndk ships no copy of this licence; it declares it in its Cargo.toml ndk 0.9.0 (MIT OR Apache-2.0) https://github.com/rust-mobile/ndk ships no copy of this licence; it declares it in its Cargo.toml ndk-context 0.1.1 (MIT OR Apache-2.0) https://github.com/rust-windowing/android-ndk-rs ships no copy of this licence; it declares it in its Cargo.toml ndk-sys 0.5.0+25.2.9519653 (MIT OR Apache-2.0) https://github.com/rust-mobile/ndk ships no copy of this licence; it declares it in its Cargo.toml ndk-sys 0.6.0+11769913 (MIT OR Apache-2.0) https://github.com/rust-mobile/ndk ships no copy of this licence; it declares it in its Cargo.toml new_debug_unreachable 1.0.6 (MIT) https://github.com/mbrubeck/rust-debug-unreachable Copyright (c) 2015 Jonathan Reem nix 0.29.0 (MIT) https://github.com/nix-rust/nix Copyright (c) 2015 Carl Lerche + nix-rust Authors nix 0.31.3 (MIT) https://github.com/nix-rust/nix Copyright (c) 2015 Carl Lerche + nix-rust Authors nom 7.1.3 (MIT) https://github.com/Geal/nom Copyright (c) 2014-2019 Geoffroy Couprie nu-ansi-term 0.50.3 (MIT) https://github.com/nushell/nu-ansi-term Copyright (c) 2014 Benjamin Sago Copyright (c) 2021-2022 The Nushell Project Developers num-complex 0.4.6 (MIT OR Apache-2.0) https://github.com/rust-num/num-complex Copyright (c) 2014 The Rust Project Developers num-conv 0.2.2 (MIT OR Apache-2.0) https://github.com/jhpratt/num-conv Copyright (c) Jacob Pratt num-derive 0.4.2 (MIT OR Apache-2.0) https://github.com/rust-num/num-derive Copyright (c) 2014 The Rust Project Developers num-integer 0.1.47 (MIT OR Apache-2.0) https://github.com/rust-num/num-integer Copyright (c) 2014 The Rust Project Developers num-traits 0.2.19 (MIT OR Apache-2.0) https://github.com/rust-num/num-traits Copyright (c) 2014 The Rust Project Developers num_enum 0.7.6 (BSD-3-Clause OR MIT OR Apache-2.0) https://github.com/illicitonion/num_enum num_enum_derive 0.7.6 (BSD-3-Clause OR MIT OR Apache-2.0) https://github.com/illicitonion/num_enum objc2 0.6.4 (MIT) https://github.com/madsmtm/objc2 ships no copy of this licence; it declares it in its Cargo.toml objc2-app-kit 0.3.2 (Zlib OR Apache-2.0 OR MIT) https://github.com/madsmtm/objc2 ships no copy of this licence; it declares it in its Cargo.toml objc2-cloud-kit 0.3.2 (Zlib OR Apache-2.0 OR MIT) https://github.com/madsmtm/objc2 ships no copy of this licence; it declares it in its Cargo.toml objc2-core-data 0.3.2 (Zlib OR Apache-2.0 OR MIT) https://github.com/madsmtm/objc2 ships no copy of this licence; it declares it in its Cargo.toml objc2-core-foundation 0.3.2 (Zlib OR Apache-2.0 OR MIT) https://github.com/madsmtm/objc2 ships no copy of this licence; it declares it in its Cargo.toml objc2-core-graphics 0.3.2 (Zlib OR Apache-2.0 OR MIT) https://github.com/madsmtm/objc2 ships no copy of this licence; it declares it in its Cargo.toml objc2-core-image 0.3.2 (Zlib OR Apache-2.0 OR MIT) https://github.com/madsmtm/objc2 ships no copy of this licence; it declares it in its Cargo.toml objc2-core-location 0.3.2 (Zlib OR Apache-2.0 OR MIT) https://github.com/madsmtm/objc2 ships no copy of this licence; it declares it in its Cargo.toml objc2-core-text 0.3.2 (Zlib OR Apache-2.0 OR MIT) https://github.com/madsmtm/objc2 ships no copy of this licence; it declares it in its Cargo.toml objc2-encode 4.1.0 (MIT) https://github.com/madsmtm/objc2 ships no copy of this licence; it declares it in its Cargo.toml objc2-exception-helper 0.1.1 (Zlib OR Apache-2.0 OR MIT) https://github.com/madsmtm/objc2 ships no copy of this licence; it declares it in its Cargo.toml objc2-foundation 0.3.2 (MIT) https://github.com/madsmtm/objc2 ships no copy of this licence; it declares it in its Cargo.toml objc2-io-surface 0.3.2 (Zlib OR Apache-2.0 OR MIT) https://github.com/madsmtm/objc2 ships no copy of this licence; it declares it in its Cargo.toml objc2-quartz-core 0.3.2 (Zlib OR Apache-2.0 OR MIT) https://github.com/madsmtm/objc2 ships no copy of this licence; it declares it in its Cargo.toml objc2-ui-kit 0.3.2 (Zlib OR Apache-2.0 OR MIT) https://github.com/madsmtm/objc2 ships no copy of this licence; it declares it in its Cargo.toml objc2-user-notifications 0.3.2 (Zlib OR Apache-2.0 OR MIT) https://github.com/madsmtm/objc2 ships no copy of this licence; it declares it in its Cargo.toml objc2-web-kit 0.3.2 (Zlib OR Apache-2.0 OR MIT) https://github.com/madsmtm/objc2 ships no copy of this licence; it declares it in its Cargo.toml once_cell 1.21.4 (MIT OR Apache-2.0) https://github.com/matklad/once_cell openssl-macros 0.1.1 (MIT OR Apache-2.0) Copyright (c) 2022 Steven Fackler openssl-probe 0.2.1 (MIT OR Apache-2.0) https://github.com/rustls/openssl-probe Copyright (c) 2014 Alex Crichton openssl-sys 0.9.117 (MIT) https://github.com/rust-openssl/rust-openssl Copyright (c) 2014 Alex Crichton ordered-stream 0.2.0 (MIT OR Apache-2.0) https://github.com/danieldg/ordered-stream os_info 3.15.0 (MIT) https://github.com/stanislav-tkach/os_info Copyright (c) 2017 Stanislav Tkach pango 0.18.3 (MIT) https://github.com/gtk-rs/gtk-rs-core pango-sys 0.18.0 (MIT) https://github.com/gtk-rs/gtk-rs-core parking 2.2.1 (Apache-2.0 OR MIT) https://github.com/smol-rs/parking parking_lot 0.12.5 (MIT OR Apache-2.0) https://github.com/Amanieu/parking_lot Copyright (c) 2016 The Rust Project Developers parking_lot_core 0.9.12 (MIT OR Apache-2.0) https://github.com/Amanieu/parking_lot Copyright (c) 2016 The Rust Project Developers pbjson 0.6.0 (MIT) https://github.com/influxdata/pbjson ships no copy of this licence; it declares it in its Cargo.toml pbjson-build 0.6.2 (MIT) https://github.com/influxdata/pbjson ships no copy of this licence; it declares it in its Cargo.toml pbjson-types 0.6.0 (MIT) https://github.com/influxdata/pbjson ships no copy of this licence; it declares it in its Cargo.toml percent-encoding 2.3.2 (MIT OR Apache-2.0) https://github.com/servo/rust-url/ Copyright (c) 2013-2025 The rust-url developers petgraph 0.6.5 (MIT OR Apache-2.0) https://github.com/petgraph/petgraph Copyright (c) 2015 phf 0.13.1 (MIT) https://github.com/rust-phf/rust-phf Copyright (c) 2014-2022 Steven Fackler, Yuki Okushi phf_codegen 0.13.1 (MIT) https://github.com/rust-phf/rust-phf Copyright (c) 2014-2022 Steven Fackler, Yuki Okushi phf_generator 0.13.1 (MIT) https://github.com/rust-phf/rust-phf Copyright (c) 2014-2022 Steven Fackler, Yuki Okushi phf_macros 0.13.1 (MIT) https://github.com/rust-phf/rust-phf Copyright (c) 2014-2022 Steven Fackler, Yuki Okushi phf_shared 0.13.1 (MIT) https://github.com/rust-phf/rust-phf Copyright (c) 2014-2022 Steven Fackler, Yuki Okushi pin-project-lite 0.2.17 (Apache-2.0 OR MIT) https://github.com/taiki-e/pin-project-lite pin-utils 0.1.0 (MIT OR Apache-2.0) https://github.com/rust-lang-nursery/pin-utils Copyright (c) 2018 The pin-utils authors piper 0.2.5 (MIT OR Apache-2.0) https://github.com/smol-rs/piper pkg-config 0.3.33 (MIT OR Apache-2.0) https://github.com/rust-lang/pkg-config-rs Copyright (c) 2014 Alex Crichton plist 1.10.0 (MIT) https://github.com/ebarnard/rust-plist/ Copyright (c) 2015 Edward Barnard png 0.17.16 (MIT OR Apache-2.0) https://github.com/image-rs/image-png Copyright (c) 2015 nwin png 0.18.1 (MIT OR Apache-2.0) https://github.com/image-rs/image-png Copyright (c) 2015 nwin polling 3.11.0 (Apache-2.0 OR MIT) https://github.com/smol-rs/polling powerfmt 0.2.0 (MIT OR Apache-2.0) https://github.com/jhpratt/powerfmt Copyright (c) 2023 Jacob Pratt et al. ppv-lite86 0.2.21 (MIT OR Apache-2.0) https://github.com/cryptocorrosion/cryptocorrosion Copyright (c) 2019 The CryptoCorrosion Contributors precomputed-hash 0.1.1 (MIT) https://github.com/emilio/precomputed-hash Copyright (c) 2017 Emilio Cobos Álvarez prettyplease 0.2.37 (MIT OR Apache-2.0) https://github.com/dtolnay/prettyplease primal-check 0.3.4 (MIT OR Apache-2.0) https://github.com/huonw/primal Copyright (c) 2014 Huon Wilson proc-macro-crate 1.3.1 (MIT OR Apache-2.0) https://github.com/bkchr/proc-macro-crate proc-macro-crate 2.0.2 (MIT OR Apache-2.0) https://github.com/bkchr/proc-macro-crate proc-macro-crate 3.5.0 (MIT OR Apache-2.0) https://github.com/bkchr/proc-macro-crate proc-macro-error 1.0.4 (MIT OR Apache-2.0) https://gitlab.com/CreepySkeleton/proc-macro-error Copyright (c) 2019-2020 CreepySkeleton proc-macro-error-attr 1.0.4 (MIT OR Apache-2.0) https://gitlab.com/CreepySkeleton/proc-macro-error Copyright (c) 2019-2020 CreepySkeleton proc-macro2 1.0.107 (MIT OR Apache-2.0) https://github.com/dtolnay/proc-macro2 quick-xml 0.41.0 (MIT) https://github.com/tafia/quick-xml Copyright (c) 2016 Johann Tuffe quinn 0.11.11 (MIT OR Apache-2.0) https://github.com/quinn-rs/quinn Copyright (c) 2018 The quinn Developers quinn-proto 0.11.16 (MIT OR Apache-2.0) https://github.com/quinn-rs/quinn Copyright (c) 2018 The quinn Developers quinn-udp 0.5.15 (MIT OR Apache-2.0) https://github.com/quinn-rs/quinn Copyright (c) 2018 The quinn Developers quote 1.0.47 (MIT OR Apache-2.0) https://github.com/dtolnay/quote r-efi 5.3.0 (MIT OR Apache-2.0 OR LGPL-2.1-or-later) https://github.com/r-efi/r-efi ships no copy of this licence; it declares it in its Cargo.toml r-efi 6.0.0 (MIT OR Apache-2.0 OR LGPL-2.1-or-later) https://github.com/r-efi/r-efi ships no copy of this licence; it declares it in its Cargo.toml rand 0.10.2 (MIT OR Apache-2.0) https://github.com/rust-random/rand Copyright 2018 Developers of the Rand project Copyright (c) 2014 The Rust Project Developers rand 0.4.6 (MIT OR Apache-2.0) https://github.com/rust-lang-nursery/rand Copyright (c) 2014 The Rust Project Developers rand 0.9.5 (MIT OR Apache-2.0) https://github.com/rust-random/rand Copyright 2018 Developers of the Rand project Copyright (c) 2014 The Rust Project Developers rand_chacha 0.9.0 (MIT OR Apache-2.0) https://github.com/rust-random/rand Copyright 2018 Developers of the Rand project Copyright (c) 2014 The Rust Project Developers rand_core 0.10.1 (MIT OR Apache-2.0) https://github.com/rust-random/rand_core Copyright (c) 2018-2026 The Rand Project Developers rand_core 0.3.1 (MIT OR Apache-2.0) https://github.com/rust-random/rand Copyright 2018 Developers of the Rand project Copyright (c) 2014 The Rust Project Developers rand_core 0.4.2 (MIT OR Apache-2.0) https://github.com/rust-random/rand Copyright 2018 Developers of the Rand project Copyright (c) 2014 The Rust Project Developers rand_core 0.6.4 (MIT OR Apache-2.0) https://github.com/rust-random/rand Copyright 2018 Developers of the Rand project Copyright (c) 2014 The Rust Project Developers rand_core 0.9.5 (MIT OR Apache-2.0) https://github.com/rust-random/rand Copyright 2018 Developers of the Rand project Copyright (c) 2014 The Rust Project Developers rand_pcg 0.10.2 (MIT OR Apache-2.0) https://github.com/rust-random/rngs Copyright (c) 2014-2017 Melissa O'Neill and PCG Project contributors Copyright 2018 Developers of the Rand project raw-window-handle 0.6.2 (MIT OR Apache-2.0 OR Zlib) https://github.com/rust-windowing/raw-window-handle Copyright (c) 2019 Osspial redox_syscall 0.5.18 (MIT) https://gitlab.redox-os.org/redox-os/syscall Copyright (c) 2017 Redox OS Developers redox_users 0.5.2 (MIT) https://gitlab.redox-os.org/redox-os/users Copyright (c) 2017 Jose Narvaez ref-cast 1.0.26 (MIT OR Apache-2.0) https://github.com/dtolnay/ref-cast ref-cast-impl 1.0.26 (MIT OR Apache-2.0) https://github.com/dtolnay/ref-cast regex 1.13.1 (MIT OR Apache-2.0) https://github.com/rust-lang/regex Copyright (c) 2014 The Rust Project Developers regex-automata 0.4.18 (MIT OR Apache-2.0) https://github.com/rust-lang/regex Copyright (c) 2014 The Rust Project Developers regex-syntax 0.8.11 (MIT OR Apache-2.0) https://github.com/rust-lang/regex Copyright (c) 2014 The Rust Project Developers remove_dir_all 0.5.3 (MIT OR Apache-2.0) https://github.com/XAMPPRocky/remove_dir_all.git Copyright (c) 2017 Aaron Power reqwest 0.12.28 (MIT OR Apache-2.0) https://github.com/seanmonstar/reqwest Copyright (c) 2016-2025 Sean McArthur reqwest 0.13.4 (MIT OR Apache-2.0) https://github.com/seanmonstar/reqwest Copyright (c) 2016-2026 Sean McArthur rfd 0.16.0 (MIT) https://github.com/PolyMeilex/rfd Copyright (c) 2022 Bartłomiej Maryńczak rtrb 0.3.4 (MIT OR Apache-2.0) https://github.com/mgeier/rtrb rustc-hash 2.1.3 (Apache-2.0 OR MIT) https://github.com/rust-lang/rustc-hash rustc_version 0.4.1 (MIT OR Apache-2.0) https://github.com/djc/rustc-version-rs Copyright (c) 2016 The Rust Project Developers rustfft 6.4.1 (MIT OR Apache-2.0) https://github.com/ejmahler/RustFFT Copyright (c) 2015 The RustFFT Developers rustix 1.1.4 (Apache-2.0 WITH LLVM-exception OR Apache-2.0 OR MIT) https://github.com/bytecodealliance/rustix rustls 0.23.46 (Apache-2.0 OR ISC OR MIT) https://github.com/rustls/rustls Copyright (c) 2016 Joseph Birr-Pixton rustls-native-certs 0.8.4 (Apache-2.0 OR ISC OR MIT) https://github.com/rustls/rustls-native-certs Copyright (c) 2016 Joseph Birr-Pixton rustls-pki-types 1.15.1 (MIT OR Apache-2.0) https://github.com/rustls/pki-types Copyright (c) 2023 Dirkjan Ochtman rustversion 1.0.23 (MIT OR Apache-2.0) https://github.com/dtolnay/rustversion same-file 1.0.6 (Unlicense OR MIT) https://github.com/BurntSushi/same-file Copyright (c) 2017 Andrew Gallant schannel 0.1.29 (MIT) https://github.com/steffengy/schannel-rs Copyright (c) 2015 steffengy schemars 0.8.22 (MIT) https://github.com/GREsau/schemars Copyright (c) 2019 Graham Esau schemars 0.9.0 (MIT) https://github.com/GREsau/schemars Copyright (c) 2019 Graham Esau schemars 1.2.2 (MIT) https://github.com/GREsau/schemars Copyright (c) 2019 Graham Esau schemars_derive 0.8.22 (MIT) https://github.com/GREsau/schemars Copyright (c) 2019 Graham Esau scopeguard 1.2.0 (MIT OR Apache-2.0) https://github.com/bluss/scopeguard Copyright (c) 2016-2019 Ulrik Sverdrup "bluss" and scopeguard developers scratch 1.0.9 (MIT OR Apache-2.0) https://github.com/dtolnay/scratch security-framework 3.7.0 (MIT OR Apache-2.0) https://github.com/kornelski/rust-security-framework Copyright (c) 2015 Steven Fackler security-framework-sys 2.17.0 (MIT OR Apache-2.0) https://github.com/kornelski/rust-security-framework Copyright (c) 2015 Steven Fackler semver 1.0.28 (MIT OR Apache-2.0) https://github.com/dtolnay/semver serde 1.0.229 (MIT OR Apache-2.0) https://github.com/serde-rs/serde serde-untagged 0.1.9 (MIT OR Apache-2.0) https://github.com/dtolnay/serde-untagged serde_core 1.0.229 (MIT OR Apache-2.0) https://github.com/serde-rs/serde serde_derive 1.0.229 (MIT OR Apache-2.0) https://github.com/serde-rs/serde serde_derive_internals 0.29.1 (MIT OR Apache-2.0) https://github.com/serde-rs/serde serde_json 1.0.151 (MIT OR Apache-2.0) https://github.com/serde-rs/json serde_repr 0.1.21 (MIT OR Apache-2.0) https://github.com/dtolnay/serde-repr serde_spanned 0.6.9 (MIT OR Apache-2.0) https://github.com/toml-rs/toml Copyright (c) Individual contributors serde_spanned 1.1.1 (MIT OR Apache-2.0) https://github.com/toml-rs/toml Copyright (c) Individual contributors serde_urlencoded 0.7.1 (MIT OR Apache-2.0) https://github.com/nox/serde_urlencoded Copyright (c) 2016 Anthony Ramine serde_with 3.21.0 (MIT OR Apache-2.0) https://github.com/jonasbb/serde_with/ Copyright (c) 2015 serde_with_macros 3.21.0 (MIT OR Apache-2.0) https://github.com/jonasbb/serde_with/ Copyright (c) 2015 serialize-to-javascript 0.1.2 (MIT OR Apache-2.0) https://github.com/chippers/serialize-to-javascript Copyright (c) 2021 Chip Reed serialize-to-javascript-impl 0.1.2 (MIT OR Apache-2.0) https://github.com/chippers/serialize-to-javascript Copyright (c) 2021 Chip Reed servo_arc 0.4.3 (MIT OR Apache-2.0) https://github.com/servo/stylo sha1 0.10.7 (MIT OR Apache-2.0) https://github.com/RustCrypto/hashes Copyright (c) 2006-2009 Graydon Hoare Copyright (c) 2009-2013 Mozilla Foundation Copyright (c) 2016 Artyom Pavlov sha2 0.10.9 (MIT OR Apache-2.0) https://github.com/RustCrypto/hashes Copyright (c) 2006-2009 Graydon Hoare Copyright (c) 2009-2013 Mozilla Foundation Copyright (c) 2016 Artyom Pavlov sharded-slab 0.1.7 (MIT) https://github.com/hawkw/sharded-slab Copyright (c) 2019 Eliza Weisman shlex 1.3.0 (MIT OR Apache-2.0) https://github.com/comex/rust-shlex Copyright (c) 2015 Nicholas Allegra (comex). shlex 2.0.1 (MIT OR Apache-2.0) https://github.com/comex/rust-shlex Copyright (c) 2015 Nicholas Allegra (comex). signal-hook-registry 1.4.8 (MIT OR Apache-2.0) https://github.com/vorner/signal-hook Copyright (c) 2017 tokio-jsonrpc developers signature 2.2.0 (Apache-2.0 OR MIT) https://github.com/RustCrypto/traits/tree/master/signature Copyright (c) 2018-2023 RustCrypto Developers simd-adler32 0.3.10 (MIT) https://github.com/mcountryman/simd-adler32 Copyright (c) [2021] [Marvin Countryman] siphasher 1.0.3 (MIT OR Apache-2.0) https://github.com/jedisct1/rust-siphash ships no copy of this licence; it declares it in its Cargo.toml slab 0.4.12 (MIT) https://github.com/tokio-rs/slab Copyright (c) 2019 Carl Lerche smallvec 1.15.2 (MIT OR Apache-2.0) https://github.com/servo/rust-smallvec Copyright (c) 2018 The Servo Project Developers socket2 0.6.5 (MIT OR Apache-2.0) https://github.com/rust-lang/socket2 Copyright (c) 2014 Alex Crichton softbuffer 0.4.8 (MIT OR Apache-2.0) https://github.com/rust-windowing/softbuffer Copyright 2022 Kirill Chibisov soup3 0.5.0 (MIT) https://gitlab.gnome.org/World/Rust/soup3-rs Copyright (c) 2013-2017, The Gtk-rs Project Developers. soup3-sys 0.5.0 (MIT) https://gitlab.gnome.org/World/Rust/soup3-rs Copyright (c) 2013-2017, The Gtk-rs Project Developers. stable_deref_trait 1.2.1 (MIT OR Apache-2.0) https://github.com/storyyeller/stable_deref_trait Copyright (c) 2017 Robert Grosse strength_reduce 0.2.4 (MIT OR Apache-2.0) http://github.com/ejmahler/strength_reduce Copyright (c) 2015 The RustFFT Developers string_cache 0.9.0 (MIT OR Apache-2.0) https://github.com/servo/string-cache Copyright (c) 2012-2013 Mozilla Foundation string_cache_codegen 0.6.1 (MIT OR Apache-2.0) https://github.com/servo/string-cache Copyright (c) 2012-2013 Mozilla Foundation strsim 0.10.0 (MIT) https://github.com/dguo/strsim-rs Copyright (c) 2015 Danny Guo Copyright (c) 2016 Titus Wormer Copyright (c) 2018 Akash Kurdekar strsim 0.11.1 (MIT) https://github.com/rapidfuzz/strsim-rs Copyright (c) 2015 Danny Guo Copyright (c) 2016 Titus Wormer Copyright (c) 2018 Akash Kurdekar swift-rs 1.0.7 (MIT OR Apache-2.0) https://github.com/Brendonovich/swift-rs Copyright (c) 2023 The swift-rs Developers syn 1.0.109 (MIT OR Apache-2.0) https://github.com/dtolnay/syn syn 2.0.119 (MIT OR Apache-2.0) https://github.com/dtolnay/syn syn 3.0.3 (MIT OR Apache-2.0) https://github.com/dtolnay/syn synstructure 0.13.2 (MIT) https://github.com/mystor/synstructure Copyright 2016 Nika Layzell system-deps 6.2.2 (MIT OR Apache-2.0) https://github.com/gdesmott/system-deps tao-macros 0.1.4 (MIT OR Apache-2.0) https://github.com/tauri-apps/tao Copyright (c) 2022 - Present Tauri Apps Contributors tauri 2.11.5 (Apache-2.0 OR MIT) https://github.com/tauri-apps/tauri Copyright (c) 2017 - Present Tauri Apps Contributors tauri-build 2.6.3 (Apache-2.0 OR MIT) https://github.com/tauri-apps/tauri Copyright (c) 2017 - Present Tauri Apps Contributors tauri-codegen 2.6.3 (Apache-2.0 OR MIT) https://github.com/tauri-apps/tauri Copyright (c) 2017 - Present Tauri Apps Contributors tauri-macros 2.6.3 (Apache-2.0 OR MIT) https://github.com/tauri-apps/tauri Copyright (c) 2017 - Present Tauri Apps Contributors tauri-plugin 2.6.3 (Apache-2.0 OR MIT) https://github.com/tauri-apps/tauri ships no copy of this licence; it declares it in its Cargo.toml tauri-plugin-dialog 2.7.3 (Apache-2.0 OR MIT) https://github.com/tauri-apps/plugins-workspace Copyright (c) 2017 - Present Tauri Apps Contributors tauri-plugin-fs 2.5.2 (Apache-2.0 OR MIT) https://github.com/tauri-apps/plugins-workspace Copyright (c) 2017 - Present Tauri Apps Contributors tauri-plugin-single-instance 2.4.5 (Apache-2.0 OR MIT) https://github.com/tauri-apps/plugins-workspace Copyright (c) 2017 - Present The Tauri Programme in the Commons Conservancy tauri-runtime 2.11.3 (Apache-2.0 OR MIT) https://github.com/tauri-apps/tauri Copyright (c) 2017 - Present Tauri Apps Contributors tauri-runtime-wry 2.11.4 (Apache-2.0 OR MIT) https://github.com/tauri-apps/tauri Copyright (c) 2017 - Present Tauri Apps Contributors tauri-utils 2.9.3 (Apache-2.0 OR MIT) https://github.com/tauri-apps/tauri Copyright (c) 2017 - Present Tauri Apps Contributors tauri-winres 0.3.6 (MIT) https://github.com/tauri-apps/winres Copyright (c) 2023 - Present Tauri Apps Contributors Copyright (c) 2016 Max Resch tempdir 0.3.7 (MIT OR Apache-2.0) https://github.com/rust-lang/tempdir Copyright (c) 2014 The Rust Project Developers tempfile 3.27.0 (MIT OR Apache-2.0) https://github.com/Stebalien/tempfile Copyright (c) 2015 Steven Allen tendril 0.5.1 (MIT OR Apache-2.0) https://github.com/servo/html5ever Copyright (c) 2015 Keegan McAllister termcolor 1.4.1 (Unlicense OR MIT) https://github.com/BurntSushi/termcolor Copyright (c) 2015 Andrew Gallant thiserror 1.0.69 (MIT OR Apache-2.0) https://github.com/dtolnay/thiserror thiserror 2.0.20 (MIT OR Apache-2.0) https://github.com/dtolnay/thiserror thiserror-impl 1.0.69 (MIT OR Apache-2.0) https://github.com/dtolnay/thiserror thiserror-impl 2.0.20 (MIT OR Apache-2.0) https://github.com/dtolnay/thiserror thread_local 1.1.10 (MIT OR Apache-2.0) https://github.com/Amanieu/thread_local-rs Copyright (c) 2016 The Rust Project Developers time 0.3.55 (MIT OR Apache-2.0) https://github.com/time-rs/time Copyright (c) Jacob Pratt et al. time-core 0.1.9 (MIT OR Apache-2.0) https://github.com/time-rs/time Copyright (c) Jacob Pratt et al. time-macros 0.2.32 (MIT OR Apache-2.0) https://github.com/time-rs/time Copyright (c) Jacob Pratt et al. tinyvec 1.12.0 (Zlib OR Apache-2.0 OR MIT) https://github.com/Lokathor/tinyvec tinyvec_macros 0.1.1 (MIT OR Apache-2.0 OR Zlib) https://github.com/Soveu/tinyvec_macros Copyright (c) 2020 Soveu tokio 1.53.1 (MIT) https://github.com/tokio-rs/tokio Copyright (c) Tokio Contributors tokio-macros 2.7.2 (MIT) https://github.com/tokio-rs/tokio Copyright (c) 2019 Yoshua Wuyts Copyright (c) Tokio Contributors tokio-native-tls 0.3.1 (MIT) https://github.com/tokio-rs/tls Copyright (c) 2019 Tokio Contributors tokio-rustls 0.26.4 (MIT OR Apache-2.0) https://github.com/rustls/tokio-rustls Copyright (c) 2017 quininer kel tokio-stream 0.1.19 (MIT) https://github.com/tokio-rs/tokio Copyright (c) Tokio Contributors tokio-tungstenite 0.29.0 (MIT) https://github.com/snapview/tokio-tungstenite Copyright (c) 2017 Daniel Abramov Copyright (c) 2017 Alexey Galakhov tokio-util 0.7.19 (MIT) https://github.com/tokio-rs/tokio Copyright (c) Tokio Contributors toml 0.8.2 (MIT OR Apache-2.0) https://github.com/toml-rs/toml Copyright (c) Individual contributors toml 0.9.12+spec-1.1.0 (MIT OR Apache-2.0) https://github.com/toml-rs/toml Copyright (c) Individual contributors toml 1.1.4+spec-1.1.0 (MIT OR Apache-2.0) https://github.com/toml-rs/toml Copyright (c) Individual contributors toml_datetime 0.6.3 (MIT OR Apache-2.0) https://github.com/toml-rs/toml Copyright (c) 2014 Alex Crichton toml_datetime 0.7.5+spec-1.1.0 (MIT OR Apache-2.0) https://github.com/toml-rs/toml Copyright (c) Individual contributors toml_datetime 1.1.1+spec-1.1.0 (MIT OR Apache-2.0) https://github.com/toml-rs/toml Copyright (c) Individual contributors toml_edit 0.19.15 (MIT OR Apache-2.0) https://github.com/toml-rs/toml Copyright (c) Individual contributors toml_edit 0.20.2 (MIT OR Apache-2.0) https://github.com/toml-rs/toml Copyright (c) Individual contributors toml_edit 0.25.15+spec-1.1.0 (MIT OR Apache-2.0) https://github.com/toml-rs/toml Copyright (c) Individual contributors toml_parser 1.1.3+spec-1.1.0 (MIT OR Apache-2.0) https://github.com/toml-rs/toml Copyright (c) Individual contributors toml_writer 1.1.2+spec-1.1.0 (MIT OR Apache-2.0) https://github.com/toml-rs/toml Copyright (c) Individual contributors tower 0.5.3 (MIT) https://github.com/tower-rs/tower Copyright (c) 2019 Tower Contributors tower-http 0.6.11 (MIT) https://github.com/tower-rs/tower-http Copyright (c) 2019-2021 Tower Contributors tower-layer 0.3.3 (MIT) https://github.com/tower-rs/tower Copyright (c) 2019 Tower Contributors tower-service 0.3.3 (MIT) https://github.com/tower-rs/tower Copyright (c) 2019 Tower Contributors tracing 0.1.44 (MIT) https://github.com/tokio-rs/tracing Copyright (c) 2019 Tokio Contributors tracing-attributes 0.1.31 (MIT) https://github.com/tokio-rs/tracing Copyright (c) 2019 Tokio Contributors tracing-core 0.1.36 (MIT) https://github.com/tokio-rs/tracing Copyright (c) 2019 Tokio Contributors tracing-log 0.2.0 (MIT) https://github.com/tokio-rs/tracing Copyright (c) 2019 Tokio Contributors tracing-subscriber 0.3.23 (MIT) https://github.com/tokio-rs/tracing Copyright (c) 2019 Tokio Contributors transpose 0.2.3 (MIT OR Apache-2.0) https://github.com/ejmahler/transpose Copyright (c) 2022 The transpose Developers tray-icon 0.24.2 (MIT OR Apache-2.0) https://github.com/tauri-apps/tray-icon Copyright (c) 2022-2022 Tauri Programme within The Commons Conservancy try-lock 0.2.5 (MIT) https://github.com/seanmonstar/try-lock Copyright (c) 2018-2023 Sean McArthur Copyright (c) 2016 Alex Crichton tungstenite 0.26.2 (MIT OR Apache-2.0) https://github.com/snapview/tungstenite-rs Copyright (c) 2017 Alexey Galakhov Copyright (c) 2016 Jason Housley tungstenite 0.29.0 (MIT OR Apache-2.0) https://github.com/snapview/tungstenite-rs Copyright (c) 2017 Alexey Galakhov Copyright (c) 2016 Jason Housley typeid 1.0.3 (MIT OR Apache-2.0) https://github.com/dtolnay/typeid typenum 1.20.1 (MIT OR Apache-2.0) https://github.com/paholg/typenum Copyright (c) 2014 Paho Lurie-Gregg unic-char-property 0.9.0 (MIT OR Apache-2.0) https://github.com/open-i18n/rust-unic/ ships no copy of this licence; it declares it in its Cargo.toml unic-char-range 0.9.0 (MIT OR Apache-2.0) https://github.com/open-i18n/rust-unic/ ships no copy of this licence; it declares it in its Cargo.toml unic-common 0.9.0 (MIT OR Apache-2.0) https://github.com/open-i18n/rust-unic/ ships no copy of this licence; it declares it in its Cargo.toml unic-ucd-ident 0.9.0 (MIT OR Apache-2.0) https://github.com/open-i18n/rust-unic/ ships no copy of this licence; it declares it in its Cargo.toml unic-ucd-version 0.9.0 (MIT OR Apache-2.0) https://github.com/open-i18n/rust-unic/ ships no copy of this licence; it declares it in its Cargo.toml unicode-ident 1.0.24 ((MIT OR Apache-2.0) AND Unicode-3.0) https://github.com/dtolnay/unicode-ident unicode-segmentation 1.13.3 (MIT OR Apache-2.0) https://github.com/unicode-rs/unicode-segmentation Copyright (c) 2015 The Rust Project Developers unicode-width 0.2.2 (MIT OR Apache-2.0) https://github.com/unicode-rs/unicode-width Copyright (c) 2015 The Rust Project Developers url 2.5.8 (MIT OR Apache-2.0) https://github.com/servo/rust-url Copyright (c) 2013-2025 The rust-url developers urlpattern 0.3.0 (MIT) https://github.com/denoland/rust-urlpattern Copyright (c) 2021 the Deno authors utf-8 0.7.6 (MIT OR Apache-2.0) https://github.com/SimonSapin/rust-utf8 utf16_iter 1.0.5 (Apache-2.0 OR MIT) https://github.com/hsivonen/utf16_iter Copyright Mozilla Foundation utf8_iter 1.0.4 (Apache-2.0 OR MIT) https://github.com/hsivonen/utf8_iter Copyright Mozilla Foundation uuid 1.24.0 (Apache-2.0 OR MIT) https://github.com/uuid-rs/uuid Copyright (c) 2014 The Rust Project Developers Copyright (c) 2018 Ashley Mannix, Christopher Armstrong, Dylan DPC, Hunar Roop Kahlon valuable 0.1.1 (MIT) https://github.com/tokio-rs/valuable ships no copy of this licence; it declares it in its Cargo.toml value-bag 1.13.2 (Apache-2.0 OR MIT) https://github.com/sval-rs/value-bag Copyright (c) 2020 sval-rs vcpkg 0.2.15 (MIT OR Apache-2.0) https://github.com/mcgoo/vcpkg-rs Copyright (c) 2017 Jim McGrath version-compare 0.2.1 (MIT) https://gitlab.com/timvisee/version-compare Copyright (c) 2017 Tim Visée version_check 0.9.5 (MIT OR Apache-2.0) https://github.com/SergioBenitez/version_check Copyright (c) 2017-2018 Sergio Benitez vswhom 0.1.0 (MIT) https://github.com/nabijaczleweli/vswhom.rs Copyright (c) 2019 nabijaczleweli vswhom-sys 0.1.3 (MIT) https://github.com/nabijaczleweli/vswhom-sys.rs Copyright (c) 2019 nabijaczleweli walkdir 2.5.0 (Unlicense OR MIT) https://github.com/BurntSushi/walkdir Copyright (c) 2015 Andrew Gallant want 0.3.1 (MIT) https://github.com/seanmonstar/want Copyright (c) 2018-2019 Sean McArthur wasi 0.11.1+wasi-snapshot-preview1 (Apache-2.0 WITH LLVM-exception OR Apache-2.0 OR MIT) https://github.com/bytecodealliance/wasi wasip2 1.0.4+wasi-0.2.12 (Apache-2.0 WITH LLVM-exception OR Apache-2.0 OR MIT) https://github.com/bytecodealliance/wasi-rs wasm-bindgen 0.2.127 (MIT OR Apache-2.0) https://github.com/wasm-bindgen/wasm-bindgen Copyright (c) 2014 Alex Crichton wasm-bindgen-futures 0.4.77 (MIT OR Apache-2.0) https://github.com/wasm-bindgen/wasm-bindgen/tree/master/crates/futures Copyright (c) 2014 Alex Crichton wasm-bindgen-macro 0.2.127 (MIT OR Apache-2.0) https://github.com/wasm-bindgen/wasm-bindgen/tree/master/crates/macro Copyright (c) 2014 Alex Crichton wasm-bindgen-macro-support 0.2.127 (MIT OR Apache-2.0) https://github.com/wasm-bindgen/wasm-bindgen/tree/master/crates/macro-support Copyright (c) 2014 Alex Crichton wasm-bindgen-shared 0.2.127 (MIT OR Apache-2.0) https://github.com/wasm-bindgen/wasm-bindgen/tree/master/crates/shared Copyright (c) 2014 Alex Crichton wasm-streams 0.4.2 (MIT OR Apache-2.0) https://github.com/MattiasBuelens/wasm-streams/ wasm-streams 0.5.0 (MIT OR Apache-2.0) https://github.com/MattiasBuelens/wasm-streams/ web-sys 0.3.104 (MIT OR Apache-2.0) https://github.com/wasm-bindgen/wasm-bindgen/tree/master/crates/web-sys Copyright (c) 2014 Alex Crichton web-time 1.1.0 (MIT OR Apache-2.0) https://github.com/daxpedda/web-time Copyright (c) 2023 dAxpeDDa web_atoms 0.2.5 (MIT OR Apache-2.0) https://github.com/servo/html5ever Copyright (c) 2014 The html5ever Project Developers webkit2gtk 2.0.2 (MIT) https://github.com/tauri-apps/webkit2gtk-rs Copyright (c) 2016 Boucher, Antoni Copyright (c) 2017-2021, The Gtk-rs Project Developers. Copyright (c) 2021, Tauri Programme within The Commons Conservancy webkit2gtk-sys 2.0.2 (MIT) https://github.com/tauri-apps/webkit2gtk-rs Copyright (c) 2016 Boucher, Antoni webview2-com 0.38.2 (MIT) https://github.com/wravery/webview2-rs ships no copy of this licence; it declares it in its Cargo.toml webview2-com-macros 0.8.1 (MIT) https://github.com/wravery/webview2-rs ships no copy of this licence; it declares it in its Cargo.toml webview2-com-sys 0.38.2 (MIT) https://github.com/wravery/webview2-rs ships no copy of this licence; it declares it in its Cargo.toml winapi 0.3.9 (MIT OR Apache-2.0) https://github.com/retep998/winapi-rs Copyright (c) 2015-2018 The winapi-rs Developers winapi-i686-pc-windows-gnu 0.4.0 (MIT OR Apache-2.0) https://github.com/retep998/winapi-rs ships no copy of this licence; it declares it in its Cargo.toml winapi-util 0.1.11 (Unlicense OR MIT) https://github.com/BurntSushi/winapi-util Copyright (c) 2017 Andrew Gallant winapi-x86_64-pc-windows-gnu 0.4.0 (MIT OR Apache-2.0) https://github.com/retep998/winapi-rs ships no copy of this licence; it declares it in its Cargo.toml window-vibrancy 0.6.0 (Apache-2.0 OR MIT) https://github.com/tauri-apps/tauri-plugin-vibrancy Copyright (c) 2020-2022 Tauri Programme within The Commons Conservancy winnow 0.5.40 (MIT) https://github.com/winnow-rs/winnow winnow 0.7.15 (MIT) https://github.com/winnow-rs/winnow winnow 1.0.4 (MIT) https://github.com/winnow-rs/winnow winreg 0.55.0 (MIT) https://github.com/gentoo90/winreg-rs Copyright (c) 2015 Igor Shaula wit-bindgen 0.57.1 (Apache-2.0 WITH LLVM-exception OR Apache-2.0 OR MIT) https://github.com/bytecodealliance/wit-bindgen write16 1.0.0 (Apache-2.0 OR MIT) https://github.com/hsivonen/write16 Copyright Mozilla Foundation wry 0.55.1 (Apache-2.0 OR MIT) https://github.com/tauri-apps/wry Copyright (c) 2020-2023 Ngo Iok Ui & Tauri Programme within The Commons Conservancy x11 2.21.0 (MIT) https://github.com/AltF02/x11-rs.git x11-dl 2.21.0 (MIT) https://github.com/AltF02/x11-rs.git zbus 5.19.0 (MIT) https://github.com/z-galaxy/zbus/ Copyright (c) 2024 Zeeshan Ali Khan & zbus contributors zbus_macros 5.19.0 (MIT) https://github.com/z-galaxy/zbus/ Copyright (c) 2024 Zeeshan Ali Khan & zbus contributors zbus_names 4.3.4 (MIT) https://github.com/z-galaxy/zbus/ Copyright (c) 2024 Zeeshan Ali Khan & zbus contributors zcheapstr 1.1.0 (MIT) https://github.com/z-galaxy/zcheapstr/ Copyright (c) 2026 Zeeshan Ali Khan & zcheapstr contributors zerocopy 0.8.56 (BSD-2-Clause OR Apache-2.0 OR MIT) https://github.com/google/zerocopy Copyright 2023 The Fuchsia Authors zerocopy-derive 0.8.56 (BSD-2-Clause OR Apache-2.0 OR MIT) https://github.com/google/zerocopy Copyright 2023 The Fuchsia Authors zeroize 1.9.0 (Apache-2.0 OR MIT) https://github.com/RustCrypto/utils Copyright (c) 2018-2026 The RustCrypto Project Developers zeroize_derive 1.5.0 (Apache-2.0 OR MIT) https://github.com/RustCrypto/utils Copyright (c) 2019-2026 The RustCrypto Project Developers zip 0.6.6 (MIT) https://github.com/zip-rs/zip.git Copyright (c) 2014 Mathijs van de Nes zmij 1.0.23 (MIT) https://github.com/dtolnay/zmij zvariant 5.15.0 (MIT) https://github.com/z-galaxy/zbus/ Copyright (c) 2024 Zeeshan Ali Khan & zbus contributors zvariant_derive 5.15.0 (MIT) https://github.com/z-galaxy/zbus/ Copyright (c) 2024 Zeeshan Ali Khan & zbus contributors zvariant_utils 4.2.0 (MIT) https://github.com/z-galaxy/zbus/ ============================================================================== PART 3. THE APACHE LICENSE 2.0 ============================================================================== Printed once; it applies to each of the 412 packages listed after it, each with the copyright lines of its own copy. Apache License Version 2.0, January 2004 http://www.apache.org/licenses/ TERMS AND CONDITIONS FOR USE, REPRODUCTION, AND DISTRIBUTION 1. Definitions. "License" shall mean the terms and conditions for use, reproduction, and distribution as defined by Sections 1 through 9 of this document. "Licensor" shall mean the copyright owner or entity authorized by the copyright owner that is granting the License. "Legal Entity" shall mean the union of the acting entity and all other entities that control, are controlled by, or are under common control with that entity. For the purposes of this definition, "control" means (i) the power, direct or indirect, to cause the direction or management of such entity, whether by contract or otherwise, or (ii) ownership of fifty percent (50%) or more of the outstanding shares, or (iii) beneficial ownership of such entity. "You" (or "Your") shall mean an individual or Legal Entity exercising permissions granted by this License. "Source" form shall mean the preferred form for making modifications, including but not limited to software source code, documentation source, and configuration files. "Object" form shall mean any form resulting from mechanical transformation or translation of a Source form, including but not limited to compiled object code, generated documentation, and conversions to other media types. "Work" shall mean the work of authorship, whether in Source or Object form, made available under the License, as indicated by a copyright notice that is included in or attached to the work (an example is provided in the Appendix below). "Derivative Works" shall mean any work, whether in Source or Object form, that is based on (or derived from) the Work and for which the editorial revisions, annotations, elaborations, or other modifications represent, as a whole, an original work of authorship. For the purposes of this License, Derivative Works shall not include works that remain separable from, or merely link (or bind by name) to the interfaces of, the Work and Derivative Works thereof. "Contribution" shall mean any work of authorship, including the original version of the Work and any modifications or additions to that Work or Derivative Works thereof, that is intentionally submitted to Licensor for inclusion in the Work by the copyright owner or by an individual or Legal Entity authorized to submit on behalf of the copyright owner. For the purposes of this definition, "submitted" means any form of electronic, verbal, or written communication sent to the Licensor or its representatives, including but not limited to communication on electronic mailing lists, source code control systems, and issue tracking systems that are managed by, or on behalf of, the Licensor for the purpose of discussing and improving the Work, but excluding communication that is conspicuously marked or otherwise designated in writing by the copyright owner as "Not a Contribution." "Contributor" shall mean Licensor and any individual or Legal Entity on behalf of whom a Contribution has been received by Licensor and subsequently incorporated within the Work. 2. Grant of Copyright License. Subject to the terms and conditions of this License, each Contributor hereby grants to You a perpetual, worldwide, non-exclusive, no-charge, royalty-free, irrevocable copyright license to reproduce, prepare Derivative Works of, publicly display, publicly perform, sublicense, and distribute the Work and such Derivative Works in Source or Object form. 3. Grant of Patent License. Subject to the terms and conditions of this License, each Contributor hereby grants to You a perpetual, worldwide, non-exclusive, no-charge, royalty-free, irrevocable (except as stated in this section) patent license to make, have made, use, offer to sell, sell, import, and otherwise transfer the Work, where such license applies only to those patent claims licensable by such Contributor that are necessarily infringed by their Contribution(s) alone or by combination of their Contribution(s) with the Work to which such Contribution(s) was submitted. If You institute patent litigation against any entity (including a cross-claim or counterclaim in a lawsuit) alleging that the Work or a Contribution incorporated within the Work constitutes direct or contributory patent infringement, then any patent licenses granted to You under this License for that Work shall terminate as of the date such litigation is filed. 4. Redistribution. You may reproduce and distribute copies of the Work or Derivative Works thereof in any medium, with or without modifications, and in Source or Object form, provided that You meet the following conditions: (a) You must give any other recipients of the Work or Derivative Works a copy of this License; and (b) You must cause any modified files to carry prominent notices stating that You changed the files; and (c) You must retain, in the Source form of any Derivative Works that You distribute, all copyright, patent, trademark, and attribution notices from the Source form of the Work, excluding those notices that do not pertain to any part of the Derivative Works; and (d) If the Work includes a "NOTICE" text file as part of its distribution, then any Derivative Works that You distribute must include a readable copy of the attribution notices contained within such NOTICE file, excluding those notices that do not pertain to any part of the Derivative Works, in at least one of the following places: within a NOTICE text file distributed as part of the Derivative Works; within the Source form or documentation, if provided along with the Derivative Works; or, within a display generated by the Derivative Works, if and wherever such third-party notices normally appear. The contents of the NOTICE file are for informational purposes only and do not modify the License. You may add Your own attribution notices within Derivative Works that You distribute, alongside or as an addendum to the NOTICE text from the Work, provided that such additional attribution notices cannot be construed as modifying the License. You may add Your own copyright statement to Your modifications and may provide additional or different license terms and conditions for use, reproduction, or distribution of Your modifications, or for any such Derivative Works as a whole, provided Your use, reproduction, and distribution of the Work otherwise complies with the conditions stated in this License. 5. Submission of Contributions. Unless You explicitly state otherwise, any Contribution intentionally submitted for inclusion in the Work by You to the Licensor shall be under the terms and conditions of this License, without any additional terms or conditions. Notwithstanding the above, nothing herein shall supersede or modify the terms of any separate license agreement you may have executed with Licensor regarding such Contributions. 6. Trademarks. This License does not grant permission to use the trade names, trademarks, service marks, or product names of the Licensor, except as required for reasonable and customary use in describing the origin of the Work and reproducing the content of the NOTICE file. 7. Disclaimer of Warranty. Unless required by applicable law or agreed to in writing, Licensor provides the Work (and each Contributor provides its Contributions) on an "AS IS" BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied, including, without limitation, any warranties or conditions of TITLE, NON-INFRINGEMENT, MERCHANTABILITY, or FITNESS FOR A PARTICULAR PURPOSE. You are solely responsible for determining the appropriateness of using or redistributing the Work and assume any risks associated with Your exercise of permissions under this License. 8. Limitation of Liability. In no event and under no legal theory, whether in tort (including negligence), contract, or otherwise, unless required by applicable law (such as deliberate and grossly negligent acts) or agreed to in writing, shall any Contributor be liable to You for damages, including any direct, indirect, special, incidental, or consequential damages of any character arising as a result of this License or out of the use or inability to use the Work (including but not limited to damages for loss of goodwill, work stoppage, computer failure or malfunction, or any and all other commercial damages or losses), even if such Contributor has been advised of the possibility of such damages. 9. Accepting Warranty or Additional Liability. While redistributing the Work or Derivative Works thereof, You may choose to offer, and charge a fee for, acceptance of support, warranty, indemnity, or other liability obligations and/or rights consistent with this License. However, in accepting such obligations, You may act only on Your own behalf and on Your sole responsibility, not on behalf of any other Contributor, and only if You agree to indemnify, defend, and hold each Contributor harmless for any liability incurred by, or claims asserted against, such Contributor by reason of your accepting any such warranty or additional liability. END OF TERMS AND CONDITIONS APPENDIX: How to apply the Apache License to your work. To apply the Apache License to your work, attach the following boilerplate notice, with the fields enclosed by brackets "[]" replaced with your own identifying information. (Don't include the brackets!) The text should be enclosed in the appropriate comment syntax for the file format. We also recommend that a file or class name and description of purpose be included on the same "printed page" as the copyright notice for easier identification within third-party archives. Copyright [yyyy] [name of copyright owner] Licensed under the Apache License, Version 2.0 (the "License"); you may not use this file except in compliance with the License. You may obtain a copy of the License at http://www.apache.org/licenses/LICENSE-2.0 Unless required by applicable law or agreed to in writing, software distributed under the License is distributed on an "AS IS" BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. See the License for the specific language governing permissions and limitations under the License. The packages: adler2 2.0.1 (0BSD OR MIT OR Apache-2.0) https://github.com/oyvindln/adler2 alsa 0.9.1 (Apache-2.0 OR MIT) https://github.com/diwic/alsa-rs anyhow 1.0.104 (MIT OR Apache-2.0) https://github.com/dtolnay/anyhow arrayvec 0.7.8 (MIT OR Apache-2.0) https://github.com/bluss/arrayvec async-broadcast 0.7.2 (MIT OR Apache-2.0) https://github.com/smol-rs/async-broadcast Copyright 2020 Yoshua Wuyts async-channel 1.9.0 (Apache-2.0 OR MIT) https://github.com/smol-rs/async-channel async-channel 2.5.0 (Apache-2.0 OR MIT) https://github.com/smol-rs/async-channel async-compression 0.4.43 (MIT OR Apache-2.0) https://github.com/Nullus157/async-compression async-executor 1.14.0 (Apache-2.0 OR MIT) https://github.com/smol-rs/async-executor async-global-executor 2.4.1 (Apache-2.0 OR MIT) https://github.com/Keruspe/async-global-executor async-io 2.6.0 (Apache-2.0 OR MIT) https://github.com/smol-rs/async-io async-lock 3.4.2 (Apache-2.0 OR MIT) https://github.com/smol-rs/async-lock async-native-tls 0.5.0 (MIT OR Apache-2.0) https://github.com/async-email/async-native-tls Copyright 2019 Friedel Ziegelmayer async-process 2.5.0 (Apache-2.0 OR MIT) https://github.com/smol-rs/async-process async-recursion 1.1.1 (MIT OR Apache-2.0) https://github.com/dcchut/async-recursion async-signal 0.2.14 (Apache-2.0 OR MIT) https://github.com/smol-rs/async-signal async-std 1.13.2 (Apache-2.0 OR MIT) https://github.com/async-rs/async-std async-task 4.7.1 (Apache-2.0 OR MIT) https://github.com/smol-rs/async-task async-trait 0.1.92 (MIT OR Apache-2.0) https://github.com/dtolnay/async-trait atomic-waker 1.1.2 (Apache-2.0 OR MIT) https://github.com/smol-rs/atomic-waker autocfg 1.5.1 (Apache-2.0 OR MIT) https://github.com/cuviper/autocfg base64 0.21.7 (MIT OR Apache-2.0) https://github.com/marshallpierce/rust-base64 base64 0.22.1 (MIT OR Apache-2.0) https://github.com/marshallpierce/rust-base64 bit-set 0.8.0 (Apache-2.0 OR MIT) https://github.com/contain-rs/bit-set bit-vec 0.8.0 (Apache-2.0 OR MIT) https://github.com/contain-rs/bit-vec bitflags 1.3.2 (MIT OR Apache-2.0) https://github.com/bitflags/bitflags bitflags 2.13.1 (MIT OR Apache-2.0) https://github.com/bitflags/bitflags block-buffer 0.10.4 (MIT OR Apache-2.0) https://github.com/RustCrypto/utils blocking 1.6.2 (Apache-2.0 OR MIT) https://github.com/smol-rs/blocking bs58 0.5.1 (MIT OR Apache-2.0) https://github.com/Nullus157/bs58-rs bumpalo 3.20.3 (MIT OR Apache-2.0) https://github.com/fitzgen/bumpalo bytemuck 1.25.2 (Zlib OR Apache-2.0 OR MIT) https://github.com/Lokathor/bytemuck camino 1.2.5 (MIT OR Apache-2.0) https://github.com/camino-rs/camino cargo-platform 0.1.9 (MIT OR Apache-2.0) https://github.com/rust-lang/cargo cc 1.4.2 (MIT OR Apache-2.0) https://github.com/rust-lang/cc-rs cexpr 0.6.0 (Apache-2.0 OR MIT) https://github.com/jethrogb/rust-cexpr cfg-expr 0.15.8 (MIT OR Apache-2.0) https://github.com/EmbarkStudios/cfg-expr cfg-if 1.0.4 (MIT OR Apache-2.0) https://github.com/rust-lang/cfg-if chacha20 0.10.1 (MIT OR Apache-2.0) https://github.com/RustCrypto/stream-ciphers clang-sys 1.9.1 (Apache-2.0) https://github.com/KyleMayes/clang-sys codespan-reporting 0.13.1 (Apache-2.0) https://github.com/brendanzab/codespan compression-codecs 0.4.38 (MIT OR Apache-2.0) https://github.com/Nullus157/async-compression compression-core 0.4.32 (MIT OR Apache-2.0) https://github.com/Nullus157/async-compression concurrent-queue 2.5.0 (Apache-2.0 OR MIT) https://github.com/smol-rs/concurrent-queue cookie 0.18.1 (MIT OR Apache-2.0) https://github.com/SergioBenitez/cookie-rs Copyright 2017 Sergio Benitez Copyright 2014 Alex Chricton core-foundation 0.10.1 (MIT OR Apache-2.0) https://github.com/servo/core-foundation-rs core-foundation-sys 0.8.7 (MIT OR Apache-2.0) https://github.com/servo/core-foundation-rs core-graphics 0.25.0 (MIT OR Apache-2.0) https://github.com/servo/core-foundation-rs core-graphics-types 0.2.0 (MIT OR Apache-2.0) https://github.com/servo/core-foundation-rs coreaudio-rs 0.11.3 (MIT OR Apache-2.0) https://github.com/RustAudio/coreaudio-rs.git cpal 0.15.3 (Apache-2.0) https://github.com/rustaudio/cpal a copy modified for Back2Back, kept in rust-application/vendor-cpal cpufeatures 0.2.17 (MIT OR Apache-2.0) https://github.com/RustCrypto/utils cpufeatures 0.3.0 (MIT OR Apache-2.0) https://github.com/RustCrypto/utils crc32fast 1.5.0 (MIT OR Apache-2.0) https://github.com/srijs/rust-crc32fast crossbeam-channel 0.5.16 (MIT OR Apache-2.0) https://github.com/crossbeam-rs/crossbeam crossbeam-utils 0.8.22 (MIT OR Apache-2.0) https://github.com/crossbeam-rs/crossbeam crypto-common 0.1.7 (MIT OR Apache-2.0) https://github.com/RustCrypto/traits ctor 0.8.0 (Apache-2.0 OR MIT) https://github.com/mmastrac/rust-ctor ctor-proc-macro 0.0.7 (Apache-2.0 OR MIT) https://github.com/mmastrac/rust-ctor cxx 1.0.199 (MIT OR Apache-2.0) https://github.com/dtolnay/cxx cxx-build 1.0.199 (MIT OR Apache-2.0) https://github.com/dtolnay/cxx cxxbridge-flags 1.0.199 (MIT OR Apache-2.0) https://github.com/dtolnay/cxx cxxbridge-macro 1.0.199 (MIT OR Apache-2.0) https://github.com/dtolnay/cxx dbus 0.9.12 (Apache-2.0 OR MIT) https://github.com/diwic/dbus-rs Copyright 2014-2018 David Henningsson and other contributors deranged 0.5.8 (MIT OR Apache-2.0) https://github.com/jhpratt/deranged Copyright 2024 Jacob Pratt et al. device-info 0.1.1 (Apache-2.0) https://github.com/livekit/rust-sdks ships no copy of this licence; it declares it in its Cargo.toml digest 0.10.7 (MIT OR Apache-2.0) https://github.com/RustCrypto/traits dirs 6.0.0 (MIT OR Apache-2.0) https://github.com/soc/dirs-rs dirs-sys 0.5.0 (MIT OR Apache-2.0) https://github.com/dirs-dev/dirs-sys-rs displaydoc 0.2.7 (MIT OR Apache-2.0) https://github.com/yaahc/displaydoc dpi 0.1.2 (Apache-2.0 AND MIT) https://github.com/rust-windowing/winit dtoa 1.0.11 (MIT OR Apache-2.0) https://github.com/dtolnay/dtoa dtor 0.3.0 (Apache-2.0 OR MIT) https://github.com/mmastrac/rust-ctor dtor-proc-macro 0.0.6 (Apache-2.0 OR MIT) https://github.com/mmastrac/rust-ctor dyn-clone 1.0.20 (MIT OR Apache-2.0) https://github.com/dtolnay/dyn-clone either 1.17.0 (MIT OR Apache-2.0) https://github.com/rayon-rs/either embed_plist 1.2.2 (MIT OR Apache-2.0) https://github.com/nvzqz/embed-plist-rs encoding_rs 0.8.35 ((Apache-2.0 OR MIT) AND BSD-3-Clause) https://github.com/hsivonen/encoding_rs equivalent 1.0.2 (Apache-2.0 OR MIT) https://github.com/indexmap-rs/equivalent erased-serde 0.4.10 (MIT OR Apache-2.0) https://github.com/dtolnay/erased-serde errno 0.3.14 (MIT OR Apache-2.0) https://github.com/lambda-fairy/rust-errno event-listener 2.5.3 (Apache-2.0 OR MIT) https://github.com/smol-rs/event-listener event-listener 5.4.2 (Apache-2.0 OR MIT) https://github.com/smol-rs/event-listener event-listener-strategy 0.5.4 (Apache-2.0 OR MIT) https://github.com/smol-rs/event-listener-strategy fastrand 2.5.0 (Apache-2.0 OR MIT) https://github.com/smol-rs/fastrand fdeflate 0.3.7 (MIT OR Apache-2.0) https://github.com/image-rs/fdeflate field-offset 0.3.6 (MIT OR Apache-2.0) https://github.com/Diggsey/rust-field-offset find-msvc-tools 0.1.10 (MIT OR Apache-2.0) https://github.com/rust-lang/cc-rs fixedbitset 0.4.2 (MIT OR Apache-2.0) https://github.com/petgraph/fixedbitset flate2 1.1.9 (MIT OR Apache-2.0) https://github.com/rust-lang/flate2-rs fnv 1.0.7 (Apache-2.0 OR MIT) https://github.com/servo/rust-fnv foreign-types 0.3.2 (MIT OR Apache-2.0) https://github.com/sfackler/foreign-types foreign-types 0.5.0 (MIT OR Apache-2.0) https://github.com/sfackler/foreign-types foreign-types-macros 0.2.4 (MIT OR Apache-2.0) https://github.com/sfackler/foreign-types foreign-types-shared 0.1.1 (MIT OR Apache-2.0) https://github.com/sfackler/foreign-types foreign-types-shared 0.3.1 (MIT OR Apache-2.0) https://github.com/sfackler/foreign-types form_urlencoded 1.2.2 (MIT OR Apache-2.0) https://github.com/servo/rust-url fs2 0.4.3 (MIT OR Apache-2.0) https://github.com/danburkert/fs2-rs futures 0.3.33 (MIT OR Apache-2.0) https://github.com/rust-lang/futures-rs Copyright (c) 2016 Alex Crichton Copyright (c) 2017 The Tokio Authors futures-channel 0.3.33 (MIT OR Apache-2.0) https://github.com/rust-lang/futures-rs Copyright (c) 2016 Alex Crichton Copyright (c) 2017 The Tokio Authors futures-core 0.3.33 (MIT OR Apache-2.0) https://github.com/rust-lang/futures-rs Copyright (c) 2016 Alex Crichton Copyright (c) 2017 The Tokio Authors futures-executor 0.3.33 (MIT OR Apache-2.0) https://github.com/rust-lang/futures-rs Copyright (c) 2016 Alex Crichton Copyright (c) 2017 The Tokio Authors futures-io 0.3.33 (MIT OR Apache-2.0) https://github.com/rust-lang/futures-rs Copyright (c) 2016 Alex Crichton Copyright (c) 2017 The Tokio Authors futures-lite 2.6.1 (Apache-2.0 OR MIT) https://github.com/smol-rs/futures-lite futures-macro 0.3.33 (MIT OR Apache-2.0) https://github.com/rust-lang/futures-rs Copyright (c) 2016 Alex Crichton Copyright (c) 2017 The Tokio Authors futures-sink 0.3.33 (MIT OR Apache-2.0) https://github.com/rust-lang/futures-rs Copyright (c) 2016 Alex Crichton Copyright (c) 2017 The Tokio Authors futures-task 0.3.33 (MIT OR Apache-2.0) https://github.com/rust-lang/futures-rs Copyright (c) 2016 Alex Crichton Copyright (c) 2017 The Tokio Authors futures-util 0.3.33 (MIT OR Apache-2.0) https://github.com/rust-lang/futures-rs Copyright (c) 2016 Alex Crichton Copyright (c) 2017 The Tokio Authors getrandom 0.2.17 (MIT OR Apache-2.0) https://github.com/rust-random/getrandom getrandom 0.3.4 (MIT OR Apache-2.0) https://github.com/rust-random/getrandom getrandom 0.4.3 (MIT OR Apache-2.0) https://github.com/rust-random/getrandom glob 0.3.4 (MIT OR Apache-2.0) https://github.com/rust-lang/glob hashbrown 0.12.3 (MIT OR Apache-2.0) https://github.com/rust-lang/hashbrown hashbrown 0.17.1 (MIT OR Apache-2.0) https://github.com/rust-lang/hashbrown heck 0.4.1 (MIT OR Apache-2.0) https://github.com/withoutboats/heck heck 0.5.0 (MIT OR Apache-2.0) https://github.com/withoutboats/heck hermit-abi 0.5.2 (MIT OR Apache-2.0) https://github.com/hermit-os/hermit-rs hex 0.4.3 (MIT OR Apache-2.0) https://github.com/KokaKiwi/rust-hex hmac 0.12.1 (MIT OR Apache-2.0) https://github.com/RustCrypto/MACs html5ever 0.38.0 (MIT OR Apache-2.0) https://github.com/servo/html5ever http 1.5.0 (MIT OR Apache-2.0) https://github.com/hyperium/http Copyright 2017 http-rs authors httparse 1.10.1 (MIT OR Apache-2.0) https://github.com/seanmonstar/httparse hyper-rustls 0.27.9 (Apache-2.0 OR ISC OR MIT) https://github.com/rustls/hyper-rustls hyper-tls 0.6.0 (MIT OR Apache-2.0) https://github.com/hyperium/hyper-tls iana-time-zone 0.1.65 (MIT OR Apache-2.0) https://github.com/strawlab/iana-time-zone Copyright 2020 Andrew Straw iana-time-zone-haiku 0.1.2 (MIT OR Apache-2.0) https://github.com/strawlab/iana-time-zone Copyright 2020 Andrew Straw idna 1.1.0 (MIT OR Apache-2.0) https://github.com/servo/rust-url/ idna_adapter 1.2.2 (Apache-2.0 OR MIT) https://github.com/hsivonen/idna_adapter indexmap 1.9.3 (Apache-2.0 OR MIT) https://github.com/bluss/indexmap indexmap 2.14.0 (Apache-2.0 OR MIT) https://github.com/indexmap-rs/indexmap ipnet 2.12.1 (MIT OR Apache-2.0) https://github.com/krisprice/ipnet Copyright 2017 Juniper Networks, Inc. itertools 0.11.0 (MIT OR Apache-2.0) https://github.com/rust-itertools/itertools itertools 0.12.1 (MIT OR Apache-2.0) https://github.com/rust-itertools/itertools itertools 0.13.0 (MIT OR Apache-2.0) https://github.com/rust-itertools/itertools itoa 1.0.18 (MIT OR Apache-2.0) https://github.com/dtolnay/itoa jni 0.21.1 (MIT OR Apache-2.0) https://github.com/jni-rs/jni-rs jni-sys 0.3.1 (MIT OR Apache-2.0) https://github.com/jni-rs/jni-sys jni-sys 0.4.1 (MIT OR Apache-2.0) https://github.com/jni-rs/jni-sys jobserver 0.1.35 (MIT OR Apache-2.0) https://github.com/rust-lang/jobserver-rs js-sys 0.3.104 (MIT OR Apache-2.0) https://github.com/wasm-bindgen/wasm-bindgen/tree/master/crates/js-sys json-patch 3.0.1 (MIT OR Apache-2.0) https://github.com/idubrov/json-patch jsonptr 0.6.3 (MIT OR Apache-2.0) https://github.com/chanced/jsonptr Copyright 2024 Chance Dinkins keyboard-types 0.7.0 (MIT OR Apache-2.0) https://github.com/pyfisch/keyboard-types kv-log-macro 1.0.7 (MIT OR Apache-2.0) https://github.com/yoshuawuyts/kv-log-macro Copyright 2019 Yoshua Wuyts lazy_static 1.5.0 (MIT OR Apache-2.0) https://github.com/rust-lang-nursery/lazy-static.rs libappindicator 0.9.0 (Apache-2.0 OR MIT) libc 0.2.189 (MIT OR Apache-2.0) https://github.com/rust-lang/libc libdbus-sys 0.2.7 (Apache-2.0 OR MIT) https://github.com/diwic/dbus-rs Copyright 2014-2018 David Henningsson and other contributors libwebrtc 0.3.45 (Apache-2.0) https://github.com/livekit/rust-sdks a copy modified for Back2Back, kept in rust-application/vendor-libwebrtc link-cplusplus 1.0.12 (MIT OR Apache-2.0) https://github.com/dtolnay/link-cplusplus linux-raw-sys 0.12.1 (Apache-2.0 WITH LLVM-exception OR Apache-2.0 OR MIT) https://github.com/sunfishcode/linux-raw-sys livekit 0.8.3 (Apache-2.0) https://github.com/livekit/rust-sdks a copy modified for Back2Back, kept in rust-application/vendor-livekit livekit-api 0.6.3 (Apache-2.0) https://github.com/livekit/rust-sdks ships no copy of this licence; it declares it in its Cargo.toml livekit-common 0.1.1 (Apache-2.0) https://github.com/livekit/rust-sdks ships no copy of this licence; it declares it in its Cargo.toml livekit-data-stream 0.1.2 (Apache-2.0) https://github.com/livekit/rust-sdks ships no copy of this licence; it declares it in its Cargo.toml livekit-datatrack 0.1.13 (Apache-2.0) https://github.com/livekit/rust-sdks ships no copy of this licence; it declares it in its Cargo.toml livekit-net 0.1.2 (Apache-2.0) https://github.com/livekit/rust-sdks ships no copy of this licence; it declares it in its Cargo.toml livekit-protocol 0.7.12 (Apache-2.0) https://github.com/livekit/rust-sdks ships no copy of this licence; it declares it in its Cargo.toml livekit-runtime 0.4.0 (Apache-2.0) https://github.com/livekit/rust-sdks ships no copy of this licence; it declares it in its Cargo.toml lock_api 0.4.14 (MIT OR Apache-2.0) https://github.com/Amanieu/parking_lot log 0.4.33 (MIT OR Apache-2.0) https://github.com/rust-lang/log lru-slab 0.1.2 (MIT OR Apache-2.0 OR Zlib) https://github.com/Ralith/lru-slab mac_address 1.1.8 (MIT OR Apache-2.0) https://github.com/rep-nop/mac_address Copyright 2018 Wesley Norris mach2 0.4.3 (BSD-2-Clause OR MIT OR Apache-2.0) https://github.com/JohnTitor/mach2 markup5ever 0.38.0 (MIT OR Apache-2.0) https://github.com/servo/html5ever mime 0.3.17 (MIT OR Apache-2.0) https://github.com/hyperium/mime minimal-lexical 0.2.1 (MIT OR Apache-2.0) https://github.com/Alexhuszagh/minimal-lexical miniz_oxide 0.8.9 (MIT OR Zlib OR Apache-2.0) https://github.com/Frommi/miniz_oxide/tree/master/miniz_oxide muda 0.19.3 (Apache-2.0 OR MIT) https://github.com/tauri-apps/muda multimap 0.10.1 (MIT OR Apache-2.0) https://github.com/havarnov/multimap native-tls 0.2.18 (MIT OR Apache-2.0) https://github.com/rust-native-tls/rust-native-tls num-complex 0.4.6 (MIT OR Apache-2.0) https://github.com/rust-num/num-complex num-conv 0.2.2 (MIT OR Apache-2.0) https://github.com/jhpratt/num-conv num-derive 0.4.2 (MIT OR Apache-2.0) https://github.com/rust-num/num-derive num-integer 0.1.47 (MIT OR Apache-2.0) https://github.com/rust-num/num-integer num-traits 0.2.19 (MIT OR Apache-2.0) https://github.com/rust-num/num-traits num_enum 0.7.6 (BSD-3-Clause OR MIT OR Apache-2.0) https://github.com/illicitonion/num_enum num_enum_derive 0.7.6 (BSD-3-Clause OR MIT OR Apache-2.0) https://github.com/illicitonion/num_enum oboe 0.6.1 (Apache-2.0) https://github.com/katyo/oboe-rs ships no copy of this licence; it declares it in its Cargo.toml oboe-sys 0.6.1 (Apache-2.0) https://github.com/katyo/oboe-rs ships no copy of this licence; it declares it in its Cargo.toml once_cell 1.21.4 (MIT OR Apache-2.0) https://github.com/matklad/once_cell openssl 0.10.81 (Apache-2.0) https://github.com/rust-openssl/rust-openssl openssl-macros 0.1.1 (MIT OR Apache-2.0) openssl-probe 0.2.1 (MIT OR Apache-2.0) https://github.com/rustls/openssl-probe ordered-stream 0.2.0 (MIT OR Apache-2.0) https://github.com/danieldg/ordered-stream parking 2.2.1 (Apache-2.0 OR MIT) https://github.com/smol-rs/parking parking_lot 0.12.5 (MIT OR Apache-2.0) https://github.com/Amanieu/parking_lot parking_lot_core 0.9.12 (MIT OR Apache-2.0) https://github.com/Amanieu/parking_lot percent-encoding 2.3.2 (MIT OR Apache-2.0) https://github.com/servo/rust-url/ petgraph 0.6.5 (MIT OR Apache-2.0) https://github.com/petgraph/petgraph pin-project-lite 0.2.17 (Apache-2.0 OR MIT) https://github.com/taiki-e/pin-project-lite pin-utils 0.1.0 (MIT OR Apache-2.0) https://github.com/rust-lang-nursery/pin-utils Copyright 2018 The pin-utils authors piper 0.2.5 (MIT OR Apache-2.0) https://github.com/smol-rs/piper pkg-config 0.3.33 (MIT OR Apache-2.0) https://github.com/rust-lang/pkg-config-rs png 0.17.16 (MIT OR Apache-2.0) https://github.com/image-rs/image-png png 0.18.1 (MIT OR Apache-2.0) https://github.com/image-rs/image-png polling 3.11.0 (Apache-2.0 OR MIT) https://github.com/smol-rs/polling powerfmt 0.2.0 (MIT OR Apache-2.0) https://github.com/jhpratt/powerfmt Copyright 2023 Jacob Pratt et al. ppv-lite86 0.2.21 (MIT OR Apache-2.0) https://github.com/cryptocorrosion/cryptocorrosion Copyright 2019 The CryptoCorrosion Contributors prettyplease 0.2.37 (MIT OR Apache-2.0) https://github.com/dtolnay/prettyplease primal-check 0.3.4 (MIT OR Apache-2.0) https://github.com/huonw/primal proc-macro-crate 1.3.1 (MIT OR Apache-2.0) https://github.com/bkchr/proc-macro-crate proc-macro-crate 2.0.2 (MIT OR Apache-2.0) https://github.com/bkchr/proc-macro-crate proc-macro-crate 3.5.0 (MIT OR Apache-2.0) https://github.com/bkchr/proc-macro-crate proc-macro-error 1.0.4 (MIT OR Apache-2.0) https://gitlab.com/CreepySkeleton/proc-macro-error Copyright 2019-2020 CreepySkeleton proc-macro-error-attr 1.0.4 (MIT OR Apache-2.0) https://gitlab.com/CreepySkeleton/proc-macro-error Copyright 2019-2020 CreepySkeleton proc-macro2 1.0.107 (MIT OR Apache-2.0) https://github.com/dtolnay/proc-macro2 prost 0.12.6 (Apache-2.0) https://github.com/tokio-rs/prost ships no copy of this licence; it declares it in its Cargo.toml prost-build 0.12.6 (Apache-2.0) https://github.com/tokio-rs/prost prost-derive 0.12.6 (Apache-2.0) https://github.com/tokio-rs/prost prost-types 0.12.6 (Apache-2.0) https://github.com/tokio-rs/prost quinn 0.11.11 (MIT OR Apache-2.0) https://github.com/quinn-rs/quinn quinn-proto 0.11.16 (MIT OR Apache-2.0) https://github.com/quinn-rs/quinn quinn-udp 0.5.15 (MIT OR Apache-2.0) https://github.com/quinn-rs/quinn quote 1.0.47 (MIT OR Apache-2.0) https://github.com/dtolnay/quote rand 0.10.2 (MIT OR Apache-2.0) https://github.com/rust-random/rand rand 0.4.6 (MIT OR Apache-2.0) https://github.com/rust-lang-nursery/rand rand 0.9.5 (MIT OR Apache-2.0) https://github.com/rust-random/rand rand_chacha 0.9.0 (MIT OR Apache-2.0) https://github.com/rust-random/rand rand_core 0.10.1 (MIT OR Apache-2.0) https://github.com/rust-random/rand_core rand_core 0.3.1 (MIT OR Apache-2.0) https://github.com/rust-random/rand rand_core 0.4.2 (MIT OR Apache-2.0) https://github.com/rust-random/rand rand_core 0.6.4 (MIT OR Apache-2.0) https://github.com/rust-random/rand rand_core 0.9.5 (MIT OR Apache-2.0) https://github.com/rust-random/rand rand_pcg 0.10.2 (MIT OR Apache-2.0) https://github.com/rust-random/rngs raw-window-handle 0.6.2 (MIT OR Apache-2.0 OR Zlib) https://github.com/rust-windowing/raw-window-handle ref-cast 1.0.26 (MIT OR Apache-2.0) https://github.com/dtolnay/ref-cast ref-cast-impl 1.0.26 (MIT OR Apache-2.0) https://github.com/dtolnay/ref-cast regex 1.13.1 (MIT OR Apache-2.0) https://github.com/rust-lang/regex regex-automata 0.4.18 (MIT OR Apache-2.0) https://github.com/rust-lang/regex regex-syntax 0.8.11 (MIT OR Apache-2.0) https://github.com/rust-lang/regex remove_dir_all 0.5.3 (MIT OR Apache-2.0) https://github.com/XAMPPRocky/remove_dir_all.git Copyright 2017 Aaron Power reqwest 0.12.28 (MIT OR Apache-2.0) https://github.com/seanmonstar/reqwest Copyright 2016 Sean McArthur reqwest 0.13.4 (MIT OR Apache-2.0) https://github.com/seanmonstar/reqwest Copyright 2016 Sean McArthur rtrb 0.3.4 (MIT OR Apache-2.0) https://github.com/mgeier/rtrb rustc-hash 2.1.3 (Apache-2.0 OR MIT) https://github.com/rust-lang/rustc-hash rustc_version 0.4.1 (MIT OR Apache-2.0) https://github.com/djc/rustc-version-rs rustfft 6.4.1 (MIT OR Apache-2.0) https://github.com/ejmahler/RustFFT rustix 1.1.4 (Apache-2.0 WITH LLVM-exception OR Apache-2.0 OR MIT) https://github.com/bytecodealliance/rustix rustls 0.23.46 (Apache-2.0 OR ISC OR MIT) https://github.com/rustls/rustls rustls-native-certs 0.8.4 (Apache-2.0 OR ISC OR MIT) https://github.com/rustls/rustls-native-certs rustls-pki-types 1.15.1 (MIT OR Apache-2.0) https://github.com/rustls/pki-types Copyright 2023 Dirkjan Ochtman rustversion 1.0.23 (MIT OR Apache-2.0) https://github.com/dtolnay/rustversion ryu 1.0.23 (Apache-2.0 OR BSL-1.0) https://github.com/dtolnay/ryu scopeguard 1.2.0 (MIT OR Apache-2.0) https://github.com/bluss/scopeguard scratch 1.0.9 (MIT OR Apache-2.0) https://github.com/dtolnay/scratch security-framework 3.7.0 (MIT OR Apache-2.0) https://github.com/kornelski/rust-security-framework security-framework-sys 2.17.0 (MIT OR Apache-2.0) https://github.com/kornelski/rust-security-framework semver 1.0.28 (MIT OR Apache-2.0) https://github.com/dtolnay/semver serde 1.0.229 (MIT OR Apache-2.0) https://github.com/serde-rs/serde serde-untagged 0.1.9 (MIT OR Apache-2.0) https://github.com/dtolnay/serde-untagged serde_core 1.0.229 (MIT OR Apache-2.0) https://github.com/serde-rs/serde serde_derive 1.0.229 (MIT OR Apache-2.0) https://github.com/serde-rs/serde serde_derive_internals 0.29.1 (MIT OR Apache-2.0) https://github.com/serde-rs/serde serde_json 1.0.151 (MIT OR Apache-2.0) https://github.com/serde-rs/json serde_repr 0.1.21 (MIT OR Apache-2.0) https://github.com/dtolnay/serde-repr serde_spanned 0.6.9 (MIT OR Apache-2.0) https://github.com/toml-rs/toml serde_spanned 1.1.1 (MIT OR Apache-2.0) https://github.com/toml-rs/toml serde_urlencoded 0.7.1 (MIT OR Apache-2.0) https://github.com/nox/serde_urlencoded serde_with 3.21.0 (MIT OR Apache-2.0) https://github.com/jonasbb/serde_with/ serde_with_macros 3.21.0 (MIT OR Apache-2.0) https://github.com/jonasbb/serde_with/ serialize-to-javascript 0.1.2 (MIT OR Apache-2.0) https://github.com/chippers/serialize-to-javascript serialize-to-javascript-impl 0.1.2 (MIT OR Apache-2.0) https://github.com/chippers/serialize-to-javascript servo_arc 0.4.3 (MIT OR Apache-2.0) https://github.com/servo/stylo sha1 0.10.7 (MIT OR Apache-2.0) https://github.com/RustCrypto/hashes sha2 0.10.9 (MIT OR Apache-2.0) https://github.com/RustCrypto/hashes signal-hook-registry 1.4.8 (MIT OR Apache-2.0) https://github.com/vorner/signal-hook signature 2.2.0 (Apache-2.0 OR MIT) https://github.com/RustCrypto/traits/tree/master/signature smallvec 1.15.2 (MIT OR Apache-2.0) https://github.com/servo/rust-smallvec socket2 0.6.5 (MIT OR Apache-2.0) https://github.com/rust-lang/socket2 softbuffer 0.4.8 (MIT OR Apache-2.0) https://github.com/rust-windowing/softbuffer Copyright 2022 Kirill Chibisov stable_deref_trait 1.2.1 (MIT OR Apache-2.0) https://github.com/storyyeller/stable_deref_trait strength_reduce 0.2.4 (MIT OR Apache-2.0) http://github.com/ejmahler/strength_reduce string_cache 0.9.0 (MIT OR Apache-2.0) https://github.com/servo/string-cache string_cache_codegen 0.6.1 (MIT OR Apache-2.0) https://github.com/servo/string-cache swift-rs 1.0.7 (MIT OR Apache-2.0) https://github.com/Brendonovich/swift-rs Copyright 2023 The swift-rs developers syn 1.0.109 (MIT OR Apache-2.0) https://github.com/dtolnay/syn syn 2.0.119 (MIT OR Apache-2.0) https://github.com/dtolnay/syn syn 3.0.3 (MIT OR Apache-2.0) https://github.com/dtolnay/syn sync_wrapper 1.0.2 (Apache-2.0) https://github.com/Actyx/sync_wrapper system-deps 6.2.2 (MIT OR Apache-2.0) https://github.com/gdesmott/system-deps tao 0.35.3 (Apache-2.0) https://github.com/tauri-apps/tao tao-macros 0.1.4 (MIT OR Apache-2.0) https://github.com/tauri-apps/tao tauri 2.11.5 (Apache-2.0 OR MIT) https://github.com/tauri-apps/tauri tauri-build 2.6.3 (Apache-2.0 OR MIT) https://github.com/tauri-apps/tauri tauri-codegen 2.6.3 (Apache-2.0 OR MIT) https://github.com/tauri-apps/tauri tauri-macros 2.6.3 (Apache-2.0 OR MIT) https://github.com/tauri-apps/tauri tauri-plugin-dialog 2.7.3 (Apache-2.0 OR MIT) https://github.com/tauri-apps/plugins-workspace tauri-plugin-fs 2.5.2 (Apache-2.0 OR MIT) https://github.com/tauri-apps/plugins-workspace tauri-plugin-single-instance 2.4.5 (Apache-2.0 OR MIT) https://github.com/tauri-apps/plugins-workspace tauri-runtime 2.11.3 (Apache-2.0 OR MIT) https://github.com/tauri-apps/tauri tauri-runtime-wry 2.11.4 (Apache-2.0 OR MIT) https://github.com/tauri-apps/tauri tauri-utils 2.9.3 (Apache-2.0 OR MIT) https://github.com/tauri-apps/tauri tempdir 0.3.7 (MIT OR Apache-2.0) https://github.com/rust-lang/tempdir tempfile 3.27.0 (MIT OR Apache-2.0) https://github.com/Stebalien/tempfile tendril 0.5.1 (MIT OR Apache-2.0) https://github.com/servo/html5ever thiserror 1.0.69 (MIT OR Apache-2.0) https://github.com/dtolnay/thiserror thiserror 2.0.20 (MIT OR Apache-2.0) https://github.com/dtolnay/thiserror thiserror-impl 1.0.69 (MIT OR Apache-2.0) https://github.com/dtolnay/thiserror thiserror-impl 2.0.20 (MIT OR Apache-2.0) https://github.com/dtolnay/thiserror thread_local 1.1.10 (MIT OR Apache-2.0) https://github.com/Amanieu/thread_local-rs time 0.3.55 (MIT OR Apache-2.0) https://github.com/time-rs/time time-core 0.1.9 (MIT OR Apache-2.0) https://github.com/time-rs/time time-macros 0.2.32 (MIT OR Apache-2.0) https://github.com/time-rs/time tinyvec 1.12.0 (Zlib OR Apache-2.0 OR MIT) https://github.com/Lokathor/tinyvec tinyvec_macros 0.1.1 (MIT OR Apache-2.0 OR Zlib) https://github.com/Soveu/tinyvec_macros Copyright 2020 Tomasz "Soveu" Marx tokio-rustls 0.26.4 (MIT OR Apache-2.0) https://github.com/rustls/tokio-rustls Copyright 2017 quininer kel toml 0.8.2 (MIT OR Apache-2.0) https://github.com/toml-rs/toml toml 0.9.12+spec-1.1.0 (MIT OR Apache-2.0) https://github.com/toml-rs/toml toml 1.1.4+spec-1.1.0 (MIT OR Apache-2.0) https://github.com/toml-rs/toml toml_datetime 0.6.3 (MIT OR Apache-2.0) https://github.com/toml-rs/toml toml_datetime 0.7.5+spec-1.1.0 (MIT OR Apache-2.0) https://github.com/toml-rs/toml toml_datetime 1.1.1+spec-1.1.0 (MIT OR Apache-2.0) https://github.com/toml-rs/toml toml_edit 0.19.15 (MIT OR Apache-2.0) https://github.com/toml-rs/toml toml_edit 0.20.2 (MIT OR Apache-2.0) https://github.com/toml-rs/toml toml_edit 0.25.15+spec-1.1.0 (MIT OR Apache-2.0) https://github.com/toml-rs/toml toml_parser 1.1.3+spec-1.1.0 (MIT OR Apache-2.0) https://github.com/toml-rs/toml toml_writer 1.1.2+spec-1.1.0 (MIT OR Apache-2.0) https://github.com/toml-rs/toml transpose 0.2.3 (MIT OR Apache-2.0) https://github.com/ejmahler/transpose Copyright 2022 The transpose developers tray-icon 0.24.2 (MIT OR Apache-2.0) https://github.com/tauri-apps/tray-icon tungstenite 0.26.2 (MIT OR Apache-2.0) https://github.com/snapview/tungstenite-rs tungstenite 0.29.0 (MIT OR Apache-2.0) https://github.com/snapview/tungstenite-rs typeid 1.0.3 (MIT OR Apache-2.0) https://github.com/dtolnay/typeid typenum 1.20.1 (MIT OR Apache-2.0) https://github.com/paholg/typenum Copyright 2014 Paho Lurie-Gregg unicode-ident 1.0.24 ((MIT OR Apache-2.0) AND Unicode-3.0) https://github.com/dtolnay/unicode-ident unicode-segmentation 1.13.3 (MIT OR Apache-2.0) https://github.com/unicode-rs/unicode-segmentation unicode-width 0.2.2 (MIT OR Apache-2.0) https://github.com/unicode-rs/unicode-width url 2.5.8 (MIT OR Apache-2.0) https://github.com/servo/rust-url utf-8 0.7.6 (MIT OR Apache-2.0) https://github.com/SimonSapin/rust-utf8 utf16_iter 1.0.5 (Apache-2.0 OR MIT) https://github.com/hsivonen/utf16_iter utf8_iter 1.0.4 (Apache-2.0 OR MIT) https://github.com/hsivonen/utf8_iter uuid 1.24.0 (Apache-2.0 OR MIT) https://github.com/uuid-rs/uuid value-bag 1.13.2 (Apache-2.0 OR MIT) https://github.com/sval-rs/value-bag vcpkg 0.2.15 (MIT OR Apache-2.0) https://github.com/mcgoo/vcpkg-rs version_check 0.9.5 (MIT OR Apache-2.0) https://github.com/SergioBenitez/version_check wasi 0.11.1+wasi-snapshot-preview1 (Apache-2.0 WITH LLVM-exception OR Apache-2.0 OR MIT) https://github.com/bytecodealliance/wasi wasip2 1.0.4+wasi-0.2.12 (Apache-2.0 WITH LLVM-exception OR Apache-2.0 OR MIT) https://github.com/bytecodealliance/wasi-rs wasm-bindgen 0.2.127 (MIT OR Apache-2.0) https://github.com/wasm-bindgen/wasm-bindgen wasm-bindgen-futures 0.4.77 (MIT OR Apache-2.0) https://github.com/wasm-bindgen/wasm-bindgen/tree/master/crates/futures wasm-bindgen-macro 0.2.127 (MIT OR Apache-2.0) https://github.com/wasm-bindgen/wasm-bindgen/tree/master/crates/macro wasm-bindgen-macro-support 0.2.127 (MIT OR Apache-2.0) https://github.com/wasm-bindgen/wasm-bindgen/tree/master/crates/macro-support wasm-bindgen-shared 0.2.127 (MIT OR Apache-2.0) https://github.com/wasm-bindgen/wasm-bindgen/tree/master/crates/shared wasm-streams 0.4.2 (MIT OR Apache-2.0) https://github.com/MattiasBuelens/wasm-streams/ wasm-streams 0.5.0 (MIT OR Apache-2.0) https://github.com/MattiasBuelens/wasm-streams/ web-sys 0.3.104 (MIT OR Apache-2.0) https://github.com/wasm-bindgen/wasm-bindgen/tree/master/crates/web-sys web-time 1.1.0 (MIT OR Apache-2.0) https://github.com/daxpedda/web-time Copyright 2023 dAxpeDDa web_atoms 0.2.5 (MIT OR Apache-2.0) https://github.com/servo/html5ever webrtc-sys 0.3.42 (Apache-2.0) https://github.com/livekit/rust-sdks ships no copy of this licence; it declares it in its Cargo.toml webrtc-sys-build 0.3.18 (Apache-2.0) https://github.com/livekit/rust-sdks ships no copy of this licence; it declares it in its Cargo.toml winapi 0.3.9 (MIT OR Apache-2.0) https://github.com/retep998/winapi-rs window-vibrancy 0.6.0 (Apache-2.0 OR MIT) https://github.com/tauri-apps/tauri-plugin-vibrancy windows 0.54.0 (MIT OR Apache-2.0) https://github.com/microsoft/windows-rs Copyright (c) Microsoft Corporation. windows 0.56.0 (MIT OR Apache-2.0) https://github.com/microsoft/windows-rs Copyright (c) Microsoft Corporation. windows 0.61.3 (MIT OR Apache-2.0) https://github.com/microsoft/windows-rs Copyright (c) Microsoft Corporation. windows-collections 0.2.0 (MIT OR Apache-2.0) https://github.com/microsoft/windows-rs Copyright (c) Microsoft Corporation. windows-core 0.54.0 (MIT OR Apache-2.0) https://github.com/microsoft/windows-rs Copyright (c) Microsoft Corporation. windows-core 0.56.0 (MIT OR Apache-2.0) https://github.com/microsoft/windows-rs Copyright (c) Microsoft Corporation. windows-core 0.61.2 (MIT OR Apache-2.0) https://github.com/microsoft/windows-rs Copyright (c) Microsoft Corporation. windows-core 0.62.2 (MIT OR Apache-2.0) https://github.com/microsoft/windows-rs Copyright (c) Microsoft Corporation. windows-future 0.2.1 (MIT OR Apache-2.0) https://github.com/microsoft/windows-rs Copyright (c) Microsoft Corporation. windows-implement 0.56.0 (MIT OR Apache-2.0) https://github.com/microsoft/windows-rs Copyright (c) Microsoft Corporation. windows-implement 0.60.2 (MIT OR Apache-2.0) https://github.com/microsoft/windows-rs Copyright (c) Microsoft Corporation. windows-interface 0.56.0 (MIT OR Apache-2.0) https://github.com/microsoft/windows-rs Copyright (c) Microsoft Corporation. windows-interface 0.59.3 (MIT OR Apache-2.0) https://github.com/microsoft/windows-rs Copyright (c) Microsoft Corporation. windows-link 0.1.3 (MIT OR Apache-2.0) https://github.com/microsoft/windows-rs Copyright (c) Microsoft Corporation. windows-link 0.2.1 (MIT OR Apache-2.0) https://github.com/microsoft/windows-rs Copyright (c) Microsoft Corporation. windows-numerics 0.2.0 (MIT OR Apache-2.0) https://github.com/microsoft/windows-rs Copyright (c) Microsoft Corporation. windows-result 0.1.2 (MIT OR Apache-2.0) https://github.com/microsoft/windows-rs Copyright (c) Microsoft Corporation. windows-result 0.3.4 (MIT OR Apache-2.0) https://github.com/microsoft/windows-rs Copyright (c) Microsoft Corporation. windows-result 0.4.1 (MIT OR Apache-2.0) https://github.com/microsoft/windows-rs Copyright (c) Microsoft Corporation. windows-strings 0.4.2 (MIT OR Apache-2.0) https://github.com/microsoft/windows-rs Copyright (c) Microsoft Corporation. windows-strings 0.5.1 (MIT OR Apache-2.0) https://github.com/microsoft/windows-rs Copyright (c) Microsoft Corporation. windows-sys 0.45.0 (MIT OR Apache-2.0) https://github.com/microsoft/windows-rs Copyright (c) Microsoft Corporation. windows-sys 0.52.0 (MIT OR Apache-2.0) https://github.com/microsoft/windows-rs Copyright (c) Microsoft Corporation. windows-sys 0.59.0 (MIT OR Apache-2.0) https://github.com/microsoft/windows-rs Copyright (c) Microsoft Corporation. windows-sys 0.60.2 (MIT OR Apache-2.0) https://github.com/microsoft/windows-rs Copyright (c) Microsoft Corporation. windows-sys 0.61.2 (MIT OR Apache-2.0) https://github.com/microsoft/windows-rs Copyright (c) Microsoft Corporation. windows-targets 0.42.2 (MIT OR Apache-2.0) https://github.com/microsoft/windows-rs Copyright (c) Microsoft Corporation. windows-targets 0.52.6 (MIT OR Apache-2.0) https://github.com/microsoft/windows-rs Copyright (c) Microsoft Corporation. windows-targets 0.53.5 (MIT OR Apache-2.0) https://github.com/microsoft/windows-rs Copyright (c) Microsoft Corporation. windows-threading 0.1.0 (MIT OR Apache-2.0) https://github.com/microsoft/windows-rs Copyright (c) Microsoft Corporation. windows-version 0.1.7 (MIT OR Apache-2.0) https://github.com/microsoft/windows-rs Copyright (c) Microsoft Corporation. windows_aarch64_gnullvm 0.42.2 (MIT OR Apache-2.0) https://github.com/microsoft/windows-rs Copyright (c) Microsoft Corporation. windows_aarch64_gnullvm 0.52.6 (MIT OR Apache-2.0) https://github.com/microsoft/windows-rs Copyright (c) Microsoft Corporation. windows_aarch64_gnullvm 0.53.1 (MIT OR Apache-2.0) https://github.com/microsoft/windows-rs Copyright (c) Microsoft Corporation. windows_aarch64_msvc 0.42.2 (MIT OR Apache-2.0) https://github.com/microsoft/windows-rs Copyright (c) Microsoft Corporation. windows_aarch64_msvc 0.52.6 (MIT OR Apache-2.0) https://github.com/microsoft/windows-rs Copyright (c) Microsoft Corporation. windows_aarch64_msvc 0.53.1 (MIT OR Apache-2.0) https://github.com/microsoft/windows-rs Copyright (c) Microsoft Corporation. windows_i686_gnu 0.42.2 (MIT OR Apache-2.0) https://github.com/microsoft/windows-rs Copyright (c) Microsoft Corporation. windows_i686_gnu 0.52.6 (MIT OR Apache-2.0) https://github.com/microsoft/windows-rs Copyright (c) Microsoft Corporation. windows_i686_gnu 0.53.1 (MIT OR Apache-2.0) https://github.com/microsoft/windows-rs Copyright (c) Microsoft Corporation. windows_i686_gnullvm 0.52.6 (MIT OR Apache-2.0) https://github.com/microsoft/windows-rs Copyright (c) Microsoft Corporation. windows_i686_gnullvm 0.53.1 (MIT OR Apache-2.0) https://github.com/microsoft/windows-rs Copyright (c) Microsoft Corporation. windows_i686_msvc 0.42.2 (MIT OR Apache-2.0) https://github.com/microsoft/windows-rs Copyright (c) Microsoft Corporation. windows_i686_msvc 0.52.6 (MIT OR Apache-2.0) https://github.com/microsoft/windows-rs Copyright (c) Microsoft Corporation. windows_i686_msvc 0.53.1 (MIT OR Apache-2.0) https://github.com/microsoft/windows-rs Copyright (c) Microsoft Corporation. windows_x86_64_gnu 0.42.2 (MIT OR Apache-2.0) https://github.com/microsoft/windows-rs Copyright (c) Microsoft Corporation. windows_x86_64_gnu 0.52.6 (MIT OR Apache-2.0) https://github.com/microsoft/windows-rs Copyright (c) Microsoft Corporation. windows_x86_64_gnu 0.53.1 (MIT OR Apache-2.0) https://github.com/microsoft/windows-rs Copyright (c) Microsoft Corporation. windows_x86_64_gnullvm 0.42.2 (MIT OR Apache-2.0) https://github.com/microsoft/windows-rs Copyright (c) Microsoft Corporation. windows_x86_64_gnullvm 0.52.6 (MIT OR Apache-2.0) https://github.com/microsoft/windows-rs Copyright (c) Microsoft Corporation. windows_x86_64_gnullvm 0.53.1 (MIT OR Apache-2.0) https://github.com/microsoft/windows-rs Copyright (c) Microsoft Corporation. windows_x86_64_msvc 0.42.2 (MIT OR Apache-2.0) https://github.com/microsoft/windows-rs Copyright (c) Microsoft Corporation. windows_x86_64_msvc 0.52.6 (MIT OR Apache-2.0) https://github.com/microsoft/windows-rs Copyright (c) Microsoft Corporation. windows_x86_64_msvc 0.53.1 (MIT OR Apache-2.0) https://github.com/microsoft/windows-rs Copyright (c) Microsoft Corporation. wit-bindgen 0.57.1 (Apache-2.0 WITH LLVM-exception OR Apache-2.0 OR MIT) https://github.com/bytecodealliance/wit-bindgen write16 1.0.0 (Apache-2.0 OR MIT) https://github.com/hsivonen/write16 wry 0.55.1 (Apache-2.0 OR MIT) https://github.com/tauri-apps/wry zerocopy 0.8.56 (BSD-2-Clause OR Apache-2.0 OR MIT) https://github.com/google/zerocopy Copyright 2023 The Fuchsia Authors zerocopy-derive 0.8.56 (BSD-2-Clause OR Apache-2.0 OR MIT) https://github.com/google/zerocopy Copyright 2023 The Fuchsia Authors zeroize 1.9.0 (Apache-2.0 OR MIT) https://github.com/RustCrypto/utils zeroize_derive 1.5.0 (Apache-2.0 OR MIT) https://github.com/RustCrypto/utils ============================================================================== PART 4. OTHER LICENCE TEXTS, EXACTLY AS SHIPPED ============================================================================== [4.1] Shipped by 1 package: adler2 2.0.1 (0BSD OR MIT OR Apache-2.0) https://github.com/oyvindln/adler2 Copyright (C) Jonas Schievink Permission to use, copy, modify, and/or distribute this software for any purpose with or without fee is hereby granted. THE SOFTWARE IS PROVIDED "AS IS" AND THE AUTHOR DISCLAIMS ALL WARRANTIES WITH REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY SPECIAL, DIRECT, INDIRECT, OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR PROFITS, WHETHER IN AN ACTION OF CONTRACT, NEGLIGENCE OR OTHER TORTIOUS ACTION, ARISING OUT OF OR IN CONNECTION WITH THE USE OR PERFORMANCE OF THIS SOFTWARE. ------------------------------------------------------------------------------ [4.2] Shipped by 7 packages: aho-corasick 1.1.5 (Unlicense OR MIT) https://github.com/BurntSushi/aho-corasick byteorder 1.5.0 (Unlicense OR MIT) https://github.com/BurntSushi/byteorder memchr 2.8.3 (Unlicense OR MIT) https://github.com/BurntSushi/memchr same-file 1.0.6 (Unlicense OR MIT) https://github.com/BurntSushi/same-file termcolor 1.4.1 (Unlicense OR MIT) https://github.com/BurntSushi/termcolor walkdir 2.5.0 (Unlicense OR MIT) https://github.com/BurntSushi/walkdir winapi-util 0.1.11 (Unlicense OR MIT) https://github.com/BurntSushi/winapi-util This project is dual-licensed under the Unlicense and MIT licenses. You may use this code under the terms of either license. ------------------------------------------------------------------------------ [4.3] Shipped by 7 packages: aho-corasick 1.1.5 (Unlicense OR MIT) https://github.com/BurntSushi/aho-corasick byteorder 1.5.0 (Unlicense OR MIT) https://github.com/BurntSushi/byteorder memchr 2.8.3 (Unlicense OR MIT) https://github.com/BurntSushi/memchr same-file 1.0.6 (Unlicense OR MIT) https://github.com/BurntSushi/same-file termcolor 1.4.1 (Unlicense OR MIT) https://github.com/BurntSushi/termcolor walkdir 2.5.0 (Unlicense OR MIT) https://github.com/BurntSushi/walkdir winapi-util 0.1.11 (Unlicense OR MIT) https://github.com/BurntSushi/winapi-util This is free and unencumbered software released into the public domain. Anyone is free to copy, modify, publish, use, compile, sell, or distribute this software, either in source code form or as a compiled binary, for any purpose, commercial or non-commercial, and by any means. In jurisdictions that recognize copyright laws, the author or authors of this software dedicate any and all copyright interest in the software to the public domain. We make this dedication for the benefit of the public at large and to the detriment of our heirs and successors. We intend this dedication to be an overt act of relinquishment in perpetuity of all present and future rights to this software under copyright law. 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 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. For more information, please refer to ------------------------------------------------------------------------------ [4.4] Shipped by 3 packages: alloc-no-stdlib 2.0.4 (BSD-3-Clause) https://github.com/dropbox/rust-alloc-no-stdlib brotli 8.0.4 (BSD-3-Clause AND MIT) https://github.com/dropbox/rust-brotli brotli-decompressor 5.0.3 (BSD-3-Clause OR MIT) https://github.com/dropbox/rust-brotli-decompressor Copyright (c) 2016 Dropbox, Inc. All rights reserved. Redistribution and use in source and binary forms, with or without modification, are permitted provided that the following conditions are met: 1. Redistributions of source code must retain the above copyright notice, this list of conditions and the following disclaimer. 2. Redistributions in binary form must reproduce the above copyright notice, this list of conditions and the following disclaimer in the documentation and/or other materials provided with the distribution. 3. Neither the name of the copyright holder nor the names of its contributors may be used to endorse or promote products derived from this software without specific prior written permission. THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. ------------------------------------------------------------------------------ [4.5] Shipped by 1 package: android_system_properties 0.1.6 (MIT OR Apache-2.0) https://github.com/nical/android_system_properties Copyright 2016 Nicolas Silva Licensed under the Apache License, Version 2.0 (the "License"); you may not use this file except in compliance with the License. You may obtain a copy of the License at http://www.apache.org/licenses/LICENSE-2.0 Unless required by applicable law or agreed to in writing, software distributed under the License is distributed on an "AS IS" BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. See the License for the specific language governing permissions and limitations under the License. ------------------------------------------------------------------------------ [4.6] Shipped by 2 packages: atomic-waker 1.1.2 (Apache-2.0 OR MIT) https://github.com/smol-rs/atomic-waker futures-lite 2.6.1 (Apache-2.0 OR MIT) https://github.com/smol-rs/futures-lite =============================================================================== Copyright (c) 2016 Alex Crichton Copyright (c) 2017 The Tokio Authors Licensed under the Apache License, Version 2.0 (the "License"); you may not use this file except in compliance with the License. You may obtain a copy of the License at http://www.apache.org/licenses/LICENSE-2.0 Unless required by applicable law or agreed to in writing, software distributed under the License is distributed on an "AS IS" BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. See the License for the specific language governing permissions and limitations under the License. =============================================================================== Copyright (c) 2016 Alex Crichton Copyright (c) 2017 The Tokio Authors 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. ------------------------------------------------------------------------------ [4.7] Shipped by 1 package: bindgen 0.72.1 (BSD-3-Clause) https://github.com/rust-lang/rust-bindgen BSD 3-Clause License Copyright (c) 2013, Jyun-Yan You All rights reserved. Redistribution and use in source and binary forms, with or without modification, are permitted provided that the following conditions are met: * Redistributions of source code must retain the above copyright notice, this list of conditions and the following disclaimer. * Redistributions in binary form must reproduce the above copyright notice, this list of conditions and the following disclaimer in the documentation and/or other materials provided with the distribution. * Neither the name of the copyright holder nor the names of its contributors may be used to endorse or promote products derived from this software without specific prior written permission. THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. ------------------------------------------------------------------------------ [4.8] Shipped by 2 packages: bmrng 0.5.2 (MIT OR Apache-2.0) https://github.com/oguzbilgener/bmrng typenum 1.20.1 (MIT OR Apache-2.0) https://github.com/paholg/typenum MIT OR Apache-2.0 ------------------------------------------------------------------------------ [4.9] Shipped by 1 package: bytemuck 1.25.2 (Zlib OR Apache-2.0 OR MIT) https://github.com/Lokathor/bytemuck MIT License Copyright (c) 2019 Daniel "Lokathor" Gee. 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 (including the next paragraph) 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. ------------------------------------------------------------------------------ [4.10] Shipped by 2 packages: bytemuck 1.25.2 (Zlib OR Apache-2.0 OR MIT) https://github.com/Lokathor/bytemuck tinyvec 1.12.0 (Zlib OR Apache-2.0 OR MIT) https://github.com/Lokathor/tinyvec Copyright (c) 2019 Daniel "Lokathor" Gee. This software is provided 'as-is', without any express or implied warranty. In no event will the authors be held liable for any damages arising from the use of this software. Permission is granted to anyone to use this software for any purpose, including commercial applications, and to alter it and redistribute it freely, subject to the following restrictions: 1. The origin of this software must not be misrepresented; you must not claim that you wrote the original software. If you use this software in a product, an acknowledgment in the product documentation would be appreciated but is not required. 2. Altered source versions must be plainly marked as such, and must not be misrepresented as being the original software. 3. This notice may not be removed or altered from any source distribution. ------------------------------------------------------------------------------ [4.11] Shipped by 1 package: cargo_toml 0.22.3 (Apache-2.0 OR MIT) https://gitlab.com/lib.rs/cargo_toml © Kornel Lesiński Apache License Version 2.0, January 2004 http://www.apache.org/licenses/ TERMS AND CONDITIONS FOR USE, REPRODUCTION, AND DISTRIBUTION 1. Definitions. "License" shall mean the terms and conditions for use, reproduction, and distribution as defined by Sections 1 through 9 of this document. "Licensor" shall mean the copyright owner or entity authorized by the copyright owner that is granting the License. "Legal Entity" shall mean the union of the acting entity and all other entities that control, are controlled by, or are under common control with that entity. For the purposes of this definition, "control" means (i) the power, direct or indirect, to cause the direction or management of such entity, whether by contract or otherwise, or (ii) ownership of fifty percent (50%) or more of the outstanding shares, or (iii) beneficial ownership of such entity. "You" (or "Your") shall mean an individual or Legal Entity exercising permissions granted by this License. "Source" form shall mean the preferred form for making modifications, including but not limited to software source code, documentation source, and configuration files. "Object" form shall mean any form resulting from mechanical transformation or translation of a Source form, including but not limited to compiled object code, generated documentation, and conversions to other media types. "Work" shall mean the work of authorship, whether in Source or Object form, made available under the License, as indicated by a copyright notice that is included in or attached to the work (an example is provided in the Appendix below). "Derivative Works" shall mean any work, whether in Source or Object form, that is based on (or derived from) the Work and for which the editorial revisions, annotations, elaborations, or other modifications represent, as a whole, an original work of authorship. For the purposes of this License, Derivative Works shall not include works that remain separable from, or merely link (or bind by name) to the interfaces of, the Work and Derivative Works thereof. "Contribution" shall mean any work of authorship, including the original version of the Work and any modifications or additions to that Work or Derivative Works thereof, that is intentionally submitted to Licensor for inclusion in the Work by the copyright owner or by an individual or Legal Entity authorized to submit on behalf of the copyright owner. For the purposes of this definition, "submitted" means any form of electronic, verbal, or written communication sent to the Licensor or its representatives, including but not limited to communication on electronic mailing lists, source code control systems, and issue tracking systems that are managed by, or on behalf of, the Licensor for the purpose of discussing and improving the Work, but excluding communication that is conspicuously marked or otherwise designated in writing by the copyright owner as "Not a Contribution." "Contributor" shall mean Licensor and any individual or Legal Entity on behalf of whom a Contribution has been received by Licensor and subsequently incorporated within the Work. 2. Grant of Copyright License. Subject to the terms and conditions of this License, each Contributor hereby grants to You a perpetual, worldwide, non-exclusive, no-charge, royalty-free, irrevocable copyright license to reproduce, prepare Derivative Works of, publicly display, publicly perform, sublicense, and distribute the Work and such Derivative Works in Source or Object form. 3. Grant of Patent License. Subject to the terms and conditions of this License, each Contributor hereby grants to You a perpetual, worldwide, non-exclusive, no-charge, royalty-free, irrevocable (except as stated in this section) patent license to make, have made, use, offer to sell, sell, import, and otherwise transfer the Work, where such license applies only to those patent claims licensable by such Contributor that are necessarily infringed by their Contribution(s) alone or by combination of their Contribution(s) with the Work to which such Contribution(s) was submitted. If You institute patent litigation against any entity (including a cross-claim or counterclaim in a lawsuit) alleging that the Work or a Contribution incorporated within the Work constitutes direct or contributory patent infringement, then any patent licenses granted to You under this License for that Work shall terminate as of the date such litigation is filed. 4. Redistribution. You may reproduce and distribute copies of the Work or Derivative Works thereof in any medium, with or without modifications, and in Source or Object form, provided that You meet the following conditions: (a) You must give any other recipients of the Work or Derivative Works a copy of this License; and (b) You must cause any modified files to carry prominent notices stating that You changed the files; and (c) You must retain, in the Source form of any Derivative Works that You distribute, all copyright, patent, trademark, and attribution notices from the Source form of the Work, excluding those notices that do not pertain to any part of the Derivative Works; and (d) If the Work includes a "NOTICE" text file as part of its distribution, then any Derivative Works that You distribute must include a readable copy of the attribution notices contained within such NOTICE file, excluding those notices that do not pertain to any part of the Derivative Works, in at least one of the following places: within a NOTICE text file distributed as part of the Derivative Works; within the Source form or documentation, if provided along with the Derivative Works; or, within a display generated by the Derivative Works, if and wherever such third-party notices normally appear. The contents of the NOTICE file are for informational purposes only and do not modify the License. You may add Your own attribution notices within Derivative Works that You distribute, alongside or as an addendum to the NOTICE text from the Work, provided that such additional attribution notices cannot be construed as modifying the License. You may add Your own copyright statement to Your modifications and may provide additional or different license terms and conditions for use, reproduction, or distribution of Your modifications, or for any such Derivative Works as a whole, provided Your use, reproduction, and distribution of the Work otherwise complies with the conditions stated in this License. 5. Submission of Contributions. Unless You explicitly state otherwise, any Contribution intentionally submitted for inclusion in the Work by You to the Licensor shall be under the terms and conditions of this License, without any additional terms or conditions. Notwithstanding the above, nothing herein shall supersede or modify the terms of any separate license agreement you may have executed with Licensor regarding such Contributions. 6. Trademarks. This License does not grant permission to use the trade names, trademarks, service marks, or product names of the Licensor, except as required for reasonable and customary use in describing the origin of the Work and reproducing the content of the NOTICE file. 7. Disclaimer of Warranty. Unless required by applicable law or agreed to in writing, Licensor provides the Work (and each Contributor provides its Contributions) on an "AS IS" BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied, including, without limitation, any warranties or conditions of TITLE, NON-INFRINGEMENT, MERCHANTABILITY, or FITNESS FOR A PARTICULAR PURPOSE. You are solely responsible for determining the appropriateness of using or redistributing the Work and assume any risks associated with Your exercise of permissions under this License. 8. Limitation of Liability. In no event and under no legal theory, whether in tort (including negligence), contract, or otherwise, unless required by applicable law (such as deliberate and grossly negligent acts) or agreed to in writing, shall any Contributor be liable to You for damages, including any direct, indirect, special, incidental, or consequential damages of any character arising as a result of this License or out of the use or inability to use the Work (including but not limited to damages for loss of goodwill, work stoppage, computer failure or malfunction, or any and all other commercial damages or losses), even if such Contributor has been advised of the possibility of such damages. 9. Accepting Warranty or Additional Liability. While redistributing the Work or Derivative Works thereof, You may choose to offer, and charge a fee for, acceptance of support, warranty, indemnity, or other liability obligations and/or rights consistent with this License. However, in accepting such obligations, You may act only on Your own behalf and on Your sole responsibility, not on behalf of any other Contributor, and only if You agree to indemnify, defend, and hold each Contributor harmless for any liability incurred by, or claims asserted against, such Contributor by reason of your accepting any such warranty or additional liability. ---- 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. ------------------------------------------------------------------------------ [4.12] Shipped by 1 package: chrono 0.4.45 (MIT OR Apache-2.0) https://github.com/chronotope/chrono Rust-chrono is dual-licensed under The MIT License [1] and Apache 2.0 License [2]. Copyright (c) 2014--2026, Kang Seonghoon and contributors. Nota Bene: This is same as the Rust Project's own license. [1]: , which is reproduced below: ~~~~ The MIT License (MIT) Copyright (c) 2014, Kang Seonghoon. 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. ~~~~ [2]: , which is reproduced below: ~~~~ Apache License Version 2.0, January 2004 http://www.apache.org/licenses/ TERMS AND CONDITIONS FOR USE, REPRODUCTION, AND DISTRIBUTION 1. Definitions. "License" shall mean the terms and conditions for use, reproduction, and distribution as defined by Sections 1 through 9 of this document. "Licensor" shall mean the copyright owner or entity authorized by the copyright owner that is granting the License. "Legal Entity" shall mean the union of the acting entity and all other entities that control, are controlled by, or are under common control with that entity. For the purposes of this definition, "control" means (i) the power, direct or indirect, to cause the direction or management of such entity, whether by contract or otherwise, or (ii) ownership of fifty percent (50%) or more of the outstanding shares, or (iii) beneficial ownership of such entity. "You" (or "Your") shall mean an individual or Legal Entity exercising permissions granted by this License. "Source" form shall mean the preferred form for making modifications, including but not limited to software source code, documentation source, and configuration files. "Object" form shall mean any form resulting from mechanical transformation or translation of a Source form, including but not limited to compiled object code, generated documentation, and conversions to other media types. "Work" shall mean the work of authorship, whether in Source or Object form, made available under the License, as indicated by a copyright notice that is included in or attached to the work (an example is provided in the Appendix below). "Derivative Works" shall mean any work, whether in Source or Object form, that is based on (or derived from) the Work and for which the editorial revisions, annotations, elaborations, or other modifications represent, as a whole, an original work of authorship. For the purposes of this License, Derivative Works shall not include works that remain separable from, or merely link (or bind by name) to the interfaces of, the Work and Derivative Works thereof. "Contribution" shall mean any work of authorship, including the original version of the Work and any modifications or additions to that Work or Derivative Works thereof, that is intentionally submitted to Licensor for inclusion in the Work by the copyright owner or by an individual or Legal Entity authorized to submit on behalf of the copyright owner. For the purposes of this definition, "submitted" means any form of electronic, verbal, or written communication sent to the Licensor or its representatives, including but not limited to communication on electronic mailing lists, source code control systems, and issue tracking systems that are managed by, or on behalf of, the Licensor for the purpose of discussing and improving the Work, but excluding communication that is conspicuously marked or otherwise designated in writing by the copyright owner as "Not a Contribution." "Contributor" shall mean Licensor and any individual or Legal Entity on behalf of whom a Contribution has been received by Licensor and subsequently incorporated within the Work. 2. Grant of Copyright License. Subject to the terms and conditions of this License, each Contributor hereby grants to You a perpetual, worldwide, non-exclusive, no-charge, royalty-free, irrevocable copyright license to reproduce, prepare Derivative Works of, publicly display, publicly perform, sublicense, and distribute the Work and such Derivative Works in Source or Object form. 3. Grant of Patent License. Subject to the terms and conditions of this License, each Contributor hereby grants to You a perpetual, worldwide, non-exclusive, no-charge, royalty-free, irrevocable (except as stated in this section) patent license to make, have made, use, offer to sell, sell, import, and otherwise transfer the Work, where such license applies only to those patent claims licensable by such Contributor that are necessarily infringed by their Contribution(s) alone or by combination of their Contribution(s) with the Work to which such Contribution(s) was submitted. If You institute patent litigation against any entity (including a cross-claim or counterclaim in a lawsuit) alleging that the Work or a Contribution incorporated within the Work constitutes direct or contributory patent infringement, then any patent licenses granted to You under this License for that Work shall terminate as of the date such litigation is filed. 4. Redistribution. You may reproduce and distribute copies of the Work or Derivative Works thereof in any medium, with or without modifications, and in Source or Object form, provided that You meet the following conditions: (a) You must give any other recipients of the Work or Derivative Works a copy of this License; and (b) You must cause any modified files to carry prominent notices stating that You changed the files; and (c) You must retain, in the Source form of any Derivative Works that You distribute, all copyright, patent, trademark, and attribution notices from the Source form of the Work, excluding those notices that do not pertain to any part of the Derivative Works; and (d) If the Work includes a "NOTICE" text file as part of its distribution, then any Derivative Works that You distribute must include a readable copy of the attribution notices contained within such NOTICE file, excluding those notices that do not pertain to any part of the Derivative Works, in at least one of the following places: within a NOTICE text file distributed as part of the Derivative Works; within the Source form or documentation, if provided along with the Derivative Works; or, within a display generated by the Derivative Works, if and wherever such third-party notices normally appear. The contents of the NOTICE file are for informational purposes only and do not modify the License. You may add Your own attribution notices within Derivative Works that You distribute, alongside or as an addendum to the NOTICE text from the Work, provided that such additional attribution notices cannot be construed as modifying the License. You may add Your own copyright statement to Your modifications and may provide additional or different license terms and conditions for use, reproduction, or distribution of Your modifications, or for any such Derivative Works as a whole, provided Your use, reproduction, and distribution of the Work otherwise complies with the conditions stated in this License. 5. Submission of Contributions. Unless You explicitly state otherwise, any Contribution intentionally submitted for inclusion in the Work by You to the Licensor shall be under the terms and conditions of this License, without any additional terms or conditions. Notwithstanding the above, nothing herein shall supersede or modify the terms of any separate license agreement you may have executed with Licensor regarding such Contributions. 6. Trademarks. This License does not grant permission to use the trade names, trademarks, service marks, or product names of the Licensor, except as required for reasonable and customary use in describing the origin of the Work and reproducing the content of the NOTICE file. 7. Disclaimer of Warranty. Unless required by applicable law or agreed to in writing, Licensor provides the Work (and each Contributor provides its Contributions) on an "AS IS" BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied, including, without limitation, any warranties or conditions of TITLE, NON-INFRINGEMENT, MERCHANTABILITY, or FITNESS FOR A PARTICULAR PURPOSE. You are solely responsible for determining the appropriateness of using or redistributing the Work and assume any risks associated with Your exercise of permissions under this License. 8. Limitation of Liability. In no event and under no legal theory, whether in tort (including negligence), contract, or otherwise, unless required by applicable law (such as deliberate and grossly negligent acts) or agreed to in writing, shall any Contributor be liable to You for damages, including any direct, indirect, special, incidental, or consequential damages of any character arising as a result of this License or out of the use or inability to use the Work (including but not limited to damages for loss of goodwill, work stoppage, computer failure or malfunction, or any and all other commercial damages or losses), even if such Contributor has been advised of the possibility of such damages. 9. Accepting Warranty or Additional Liability. While redistributing the Work or Derivative Works thereof, You may choose to offer, and charge a fee for, acceptance of support, warranty, indemnity, or other liability obligations and/or rights consistent with this License. However, in accepting such obligations, You may act only on Your own behalf and on Your sole responsibility, not on behalf of any other Contributor, and only if You agree to indemnify, defend, and hold each Contributor harmless for any liability incurred by, or claims asserted against, such Contributor by reason of your accepting any such warranty or additional liability. END OF TERMS AND CONDITIONS APPENDIX: How to apply the Apache License to your work. To apply the Apache License to your work, attach the following boilerplate notice, with the fields enclosed by brackets "[]" replaced with your own identifying information. (Don't include the brackets!) The text should be enclosed in the appropriate comment syntax for the file format. We also recommend that a file or class name and description of purpose be included on the same "printed page" as the copyright notice for easier identification within third-party archives. Copyright [yyyy] [name of copyright owner] Licensed under the Apache License, Version 2.0 (the "License"); you may not use this file except in compliance with the License. You may obtain a copy of the License at http://www.apache.org/licenses/LICENSE-2.0 Unless required by applicable law or agreed to in writing, software distributed under the License is distributed on an "AS IS" BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. See the License for the specific language governing permissions and limitations under the License. ~~~~ ------------------------------------------------------------------------------ [4.13] Shipped by 1 package: crossbeam-channel 0.5.16 (MIT OR Apache-2.0) https://github.com/crossbeam-rs/crossbeam =============================================================================== matching.go https://creativecommons.org/licenses/by/3.0/legalcode Creative Commons Legal Code Attribution 3.0 Unported CREATIVE COMMONS CORPORATION IS NOT A LAW FIRM AND DOES NOT PROVIDE LEGAL SERVICES. DISTRIBUTION OF THIS LICENSE DOES NOT CREATE AN ATTORNEY-CLIENT RELATIONSHIP. CREATIVE COMMONS PROVIDES THIS INFORMATION ON AN "AS-IS" BASIS. CREATIVE COMMONS MAKES NO WARRANTIES REGARDING THE INFORMATION PROVIDED, AND DISCLAIMS LIABILITY FOR DAMAGES RESULTING FROM ITS USE. License THE WORK (AS DEFINED BELOW) IS PROVIDED UNDER THE TERMS OF THIS CREATIVE COMMONS PUBLIC LICENSE ("CCPL" OR "LICENSE"). THE WORK IS PROTECTED BY COPYRIGHT AND/OR OTHER APPLICABLE LAW. ANY USE OF THE WORK OTHER THAN AS AUTHORIZED UNDER THIS LICENSE OR COPYRIGHT LAW IS PROHIBITED. BY EXERCISING ANY RIGHTS TO THE WORK PROVIDED HERE, YOU ACCEPT AND AGREE TO BE BOUND BY THE TERMS OF THIS LICENSE. TO THE EXTENT THIS LICENSE MAY BE CONSIDERED TO BE A CONTRACT, THE LICENSOR GRANTS YOU THE RIGHTS CONTAINED HERE IN CONSIDERATION OF YOUR ACCEPTANCE OF SUCH TERMS AND CONDITIONS. 1. Definitions a. "Adaptation" means a work based upon the Work, or upon the Work and other pre-existing works, such as a translation, adaptation, derivative work, arrangement of music or other alterations of a literary or artistic work, or phonogram or performance and includes cinematographic adaptations or any other form in which the Work may be recast, transformed, or adapted including in any form recognizably derived from the original, except that a work that constitutes a Collection will not be considered an Adaptation for the purpose of this License. For the avoidance of doubt, where the Work is a musical work, performance or phonogram, the synchronization of the Work in timed-relation with a moving image ("synching") will be considered an Adaptation for the purpose of this License. b. "Collection" means a collection of literary or artistic works, such as encyclopedias and anthologies, or performances, phonograms or broadcasts, or other works or subject matter other than works listed in Section 1(f) below, which, by reason of the selection and arrangement of their contents, constitute intellectual creations, in which the Work is included in its entirety in unmodified form along with one or more other contributions, each constituting separate and independent works in themselves, which together are assembled into a collective whole. A work that constitutes a Collection will not be considered an Adaptation (as defined above) for the purposes of this License. c. "Distribute" means to make available to the public the original and copies of the Work or Adaptation, as appropriate, through sale or other transfer of ownership. d. "Licensor" means the individual, individuals, entity or entities that offer(s) the Work under the terms of this License. e. "Original Author" means, in the case of a literary or artistic work, the individual, individuals, entity or entities who created the Work or if no individual or entity can be identified, the publisher; and in addition (i) in the case of a performance the actors, singers, musicians, dancers, and other persons who act, sing, deliver, declaim, play in, interpret or otherwise perform literary or artistic works or expressions of folklore; (ii) in the case of a phonogram the producer being the person or legal entity who first fixes the sounds of a performance or other sounds; and, (iii) in the case of broadcasts, the organization that transmits the broadcast. f. "Work" means the literary and/or artistic work offered under the terms of this License including without limitation any production in the literary, scientific and artistic domain, whatever may be the mode or form of its expression including digital form, such as a book, pamphlet and other writing; a lecture, address, sermon or other work of the same nature; a dramatic or dramatico-musical work; a choreographic work or entertainment in dumb show; a musical composition with or without words; a cinematographic work to which are assimilated works expressed by a process analogous to cinematography; a work of drawing, painting, architecture, sculpture, engraving or lithography; a photographic work to which are assimilated works expressed by a process analogous to photography; a work of applied art; an illustration, map, plan, sketch or three-dimensional work relative to geography, topography, architecture or science; a performance; a broadcast; a phonogram; a compilation of data to the extent it is protected as a copyrightable work; or a work performed by a variety or circus performer to the extent it is not otherwise considered a literary or artistic work. g. "You" means an individual or entity exercising rights under this License who has not previously violated the terms of this License with respect to the Work, or who has received express permission from the Licensor to exercise rights under this License despite a previous violation. h. "Publicly Perform" means to perform public recitations of the Work and to communicate to the public those public recitations, by any means or process, including by wire or wireless means or public digital performances; to make available to the public Works in such a way that members of the public may access these Works from a place and at a place individually chosen by them; to perform the Work to the public by any means or process and the communication to the public of the performances of the Work, including by public digital performance; to broadcast and rebroadcast the Work by any means including signs, sounds or images. i. "Reproduce" means to make copies of the Work by any means including without limitation by sound or visual recordings and the right of fixation and reproducing fixations of the Work, including storage of a protected performance or phonogram in digital form or other electronic medium. 2. Fair Dealing Rights. Nothing in this License is intended to reduce, limit, or restrict any uses free from copyright or rights arising from limitations or exceptions that are provided for in connection with the copyright protection under copyright law or other applicable laws. 3. License Grant. Subject to the terms and conditions of this License, Licensor hereby grants You a worldwide, royalty-free, non-exclusive, perpetual (for the duration of the applicable copyright) license to exercise the rights in the Work as stated below: a. to Reproduce the Work, to incorporate the Work into one or more Collections, and to Reproduce the Work as incorporated in the Collections; b. to create and Reproduce Adaptations provided that any such Adaptation, including any translation in any medium, takes reasonable steps to clearly label, demarcate or otherwise identify that changes were made to the original Work. For example, a translation could be marked "The original work was translated from English to Spanish," or a modification could indicate "The original work has been modified."; c. to Distribute and Publicly Perform the Work including as incorporated in Collections; and, d. to Distribute and Publicly Perform Adaptations. e. For the avoidance of doubt: i. Non-waivable Compulsory License Schemes. In those jurisdictions in which the right to collect royalties through any statutory or compulsory licensing scheme cannot be waived, the Licensor reserves the exclusive right to collect such royalties for any exercise by You of the rights granted under this License; ii. Waivable Compulsory License Schemes. In those jurisdictions in which the right to collect royalties through any statutory or compulsory licensing scheme can be waived, the Licensor waives the exclusive right to collect such royalties for any exercise by You of the rights granted under this License; and, iii. Voluntary License Schemes. The Licensor waives the right to collect royalties, whether individually or, in the event that the Licensor is a member of a collecting society that administers voluntary licensing schemes, via that society, from any exercise by You of the rights granted under this License. The above rights may be exercised in all media and formats whether now known or hereafter devised. The above rights include the right to make such modifications as are technically necessary to exercise the rights in other media and formats. Subject to Section 8(f), all rights not expressly granted by Licensor are hereby reserved. 4. Restrictions. The license granted in Section 3 above is expressly made subject to and limited by the following restrictions: a. You may Distribute or Publicly Perform the Work only under the terms of this License. You must include a copy of, or the Uniform Resource Identifier (URI) for, this License with every copy of the Work You Distribute or Publicly Perform. You may not offer or impose any terms on the Work that restrict the terms of this License or the ability of the recipient of the Work to exercise the rights granted to that recipient under the terms of the License. You may not sublicense the Work. You must keep intact all notices that refer to this License and to the disclaimer of warranties with every copy of the Work You Distribute or Publicly Perform. When You Distribute or Publicly Perform the Work, You may not impose any effective technological measures on the Work that restrict the ability of a recipient of the Work from You to exercise the rights granted to that recipient under the terms of the License. This Section 4(a) applies to the Work as incorporated in a Collection, but this does not require the Collection apart from the Work itself to be made subject to the terms of this License. If You create a Collection, upon notice from any Licensor You must, to the extent practicable, remove from the Collection any credit as required by Section 4(b), as requested. If You create an Adaptation, upon notice from any Licensor You must, to the extent practicable, remove from the Adaptation any credit as required by Section 4(b), as requested. b. If You Distribute, or Publicly Perform the Work or any Adaptations or Collections, You must, unless a request has been made pursuant to Section 4(a), keep intact all copyright notices for the Work and provide, reasonable to the medium or means You are utilizing: (i) the name of the Original Author (or pseudonym, if applicable) if supplied, and/or if the Original Author and/or Licensor designate another party or parties (e.g., a sponsor institute, publishing entity, journal) for attribution ("Attribution Parties") in Licensor's copyright notice, terms of service or by other reasonable means, the name of such party or parties; (ii) the title of the Work if supplied; (iii) to the extent reasonably practicable, the URI, if any, that Licensor specifies to be associated with the Work, unless such URI does not refer to the copyright notice or licensing information for the Work; and (iv) , consistent with Section 3(b), in the case of an Adaptation, a credit identifying the use of the Work in the Adaptation (e.g., "French translation of the Work by Original Author," or "Screenplay based on original Work by Original Author"). The credit required by this Section 4 (b) may be implemented in any reasonable manner; provided, however, that in the case of a Adaptation or Collection, at a minimum such credit will appear, if a credit for all contributing authors of the Adaptation or Collection appears, then as part of these credits and in a manner at least as prominent as the credits for the other contributing authors. For the avoidance of doubt, You may only use the credit required by this Section for the purpose of attribution in the manner set out above and, by exercising Your rights under this License, You may not implicitly or explicitly assert or imply any connection with, sponsorship or endorsement by the Original Author, Licensor and/or Attribution Parties, as appropriate, of You or Your use of the Work, without the separate, express prior written permission of the Original Author, Licensor and/or Attribution Parties. c. Except as otherwise agreed in writing by the Licensor or as may be otherwise permitted by applicable law, if You Reproduce, Distribute or Publicly Perform the Work either by itself or as part of any Adaptations or Collections, You must not distort, mutilate, modify or take other derogatory action in relation to the Work which would be prejudicial to the Original Author's honor or reputation. Licensor agrees that in those jurisdictions (e.g. Japan), in which any exercise of the right granted in Section 3(b) of this License (the right to make Adaptations) would be deemed to be a distortion, mutilation, modification or other derogatory action prejudicial to the Original Author's honor and reputation, the Licensor will waive or not assert, as appropriate, this Section, to the fullest extent permitted by the applicable national law, to enable You to reasonably exercise Your right under Section 3(b) of this License (right to make Adaptations) but not otherwise. 5. Representations, Warranties and Disclaimer UNLESS OTHERWISE MUTUALLY AGREED TO BY THE PARTIES IN WRITING, LICENSOR OFFERS THE WORK AS-IS AND MAKES NO REPRESENTATIONS OR WARRANTIES OF ANY KIND CONCERNING THE WORK, EXPRESS, IMPLIED, STATUTORY OR OTHERWISE, INCLUDING, WITHOUT LIMITATION, WARRANTIES OF TITLE, MERCHANTIBILITY, FITNESS FOR A PARTICULAR PURPOSE, NONINFRINGEMENT, OR THE ABSENCE OF LATENT OR OTHER DEFECTS, ACCURACY, OR THE PRESENCE OF ABSENCE OF ERRORS, WHETHER OR NOT DISCOVERABLE. SOME JURISDICTIONS DO NOT ALLOW THE EXCLUSION OF IMPLIED WARRANTIES, SO SUCH EXCLUSION MAY NOT APPLY TO YOU. 6. Limitation on Liability. EXCEPT TO THE EXTENT REQUIRED BY APPLICABLE LAW, IN NO EVENT WILL LICENSOR BE LIABLE TO YOU ON ANY LEGAL THEORY FOR ANY SPECIAL, INCIDENTAL, CONSEQUENTIAL, PUNITIVE OR EXEMPLARY DAMAGES ARISING OUT OF THIS LICENSE OR THE USE OF THE WORK, EVEN IF LICENSOR HAS BEEN ADVISED OF THE POSSIBILITY OF SUCH DAMAGES. 7. Termination a. This License and the rights granted hereunder will terminate automatically upon any breach by You of the terms of this License. Individuals or entities who have received Adaptations or Collections from You under this License, however, will not have their licenses terminated provided such individuals or entities remain in full compliance with those licenses. Sections 1, 2, 5, 6, 7, and 8 will survive any termination of this License. b. Subject to the above terms and conditions, the license granted here is perpetual (for the duration of the applicable copyright in the Work). Notwithstanding the above, Licensor reserves the right to release the Work under different license terms or to stop distributing the Work at any time; provided, however that any such election will not serve to withdraw this License (or any other license that has been, or is required to be, granted under the terms of this License), and this License will continue in full force and effect unless terminated as stated above. 8. Miscellaneous a. Each time You Distribute or Publicly Perform the Work or a Collection, the Licensor offers to the recipient a license to the Work on the same terms and conditions as the license granted to You under this License. b. Each time You Distribute or Publicly Perform an Adaptation, Licensor offers to the recipient a license to the original Work on the same terms and conditions as the license granted to You under this License. c. If any provision of this License is invalid or unenforceable under applicable law, it shall not affect the validity or enforceability of the remainder of the terms of this License, and without further action by the parties to this agreement, such provision shall be reformed to the minimum extent necessary to make such provision valid and enforceable. d. No term or provision of this License shall be deemed waived and no breach consented to unless such waiver or consent shall be in writing and signed by the party to be charged with such waiver or consent. e. This License constitutes the entire agreement between the parties with respect to the Work licensed here. There are no understandings, agreements or representations with respect to the Work not specified here. Licensor shall not be bound by any additional provisions that may appear in any communication from You. This License may not be modified without the mutual written agreement of the Licensor and You. f. The rights granted under, and the subject matter referenced, in this License were drafted utilizing the terminology of the Berne Convention for the Protection of Literary and Artistic Works (as amended on September 28, 1979), the Rome Convention of 1961, the WIPO Copyright Treaty of 1996, the WIPO Performances and Phonograms Treaty of 1996 and the Universal Copyright Convention (as revised on July 24, 1971). These rights and subject matter take effect in the relevant jurisdiction in which the License terms are sought to be enforced according to the corresponding provisions of the implementation of those treaty provisions in the applicable national law. If the standard suite of rights granted under applicable copyright law includes additional rights not granted under this License, such additional rights are deemed to be included in the License; this License is not intended to restrict the license of any rights under applicable law. Creative Commons Notice Creative Commons is not a party to this License, and makes no warranty whatsoever in connection with the Work. Creative Commons will not be liable to You or any party on any legal theory for any damages whatsoever, including without limitation any general, special, incidental or consequential damages arising in connection to this license. Notwithstanding the foregoing two (2) sentences, if Creative Commons has expressly identified itself as the Licensor hereunder, it shall have all rights and obligations of Licensor. Except for the limited purpose of indicating to the public that the Work is licensed under the CCPL, Creative Commons does not authorize the use by either party of the trademark "Creative Commons" or any related trademark or logo of Creative Commons without the prior written consent of Creative Commons. Any permitted use will be in compliance with Creative Commons' then-current trademark usage guidelines, as may be published on its website or otherwise made available upon request from time to time. For the avoidance of doubt, this trademark restriction does not form part of this License. Creative Commons may be contacted at https://creativecommons.org/. =============================================================================== The Go Programming Language https://golang.org/LICENSE Copyright (c) 2009 The Go Authors. All rights reserved. Redistribution and use in source and binary forms, with or without modification, are permitted provided that the following conditions are met: * Redistributions of source code must retain the above copyright notice, this list of conditions and the following disclaimer. * Redistributions in binary form must reproduce the above copyright notice, this list of conditions and the following disclaimer in the documentation and/or other materials provided with the distribution. * Neither the name of Google Inc. nor the names of its contributors may be used to endorse or promote products derived from this software without specific prior written permission. THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. =============================================================================== The Rust Programming Language https://github.com/rust-lang/rust/blob/master/LICENSE-MIT 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. =============================================================================== The Rust Programming Language https://github.com/rust-lang/rust/blob/master/LICENSE-APACHE Apache License Version 2.0, January 2004 http://www.apache.org/licenses/ TERMS AND CONDITIONS FOR USE, REPRODUCTION, AND DISTRIBUTION 1. Definitions. "License" shall mean the terms and conditions for use, reproduction, and distribution as defined by Sections 1 through 9 of this document. "Licensor" shall mean the copyright owner or entity authorized by the copyright owner that is granting the License. "Legal Entity" shall mean the union of the acting entity and all other entities that control, are controlled by, or are under common control with that entity. For the purposes of this definition, "control" means (i) the power, direct or indirect, to cause the direction or management of such entity, whether by contract or otherwise, or (ii) ownership of fifty percent (50%) or more of the outstanding shares, or (iii) beneficial ownership of such entity. "You" (or "Your") shall mean an individual or Legal Entity exercising permissions granted by this License. "Source" form shall mean the preferred form for making modifications, including but not limited to software source code, documentation source, and configuration files. "Object" form shall mean any form resulting from mechanical transformation or translation of a Source form, including but not limited to compiled object code, generated documentation, and conversions to other media types. "Work" shall mean the work of authorship, whether in Source or Object form, made available under the License, as indicated by a copyright notice that is included in or attached to the work (an example is provided in the Appendix below). "Derivative Works" shall mean any work, whether in Source or Object form, that is based on (or derived from) the Work and for which the editorial revisions, annotations, elaborations, or other modifications represent, as a whole, an original work of authorship. For the purposes of this License, Derivative Works shall not include works that remain separable from, or merely link (or bind by name) to the interfaces of, the Work and Derivative Works thereof. "Contribution" shall mean any work of authorship, including the original version of the Work and any modifications or additions to that Work or Derivative Works thereof, that is intentionally submitted to Licensor for inclusion in the Work by the copyright owner or by an individual or Legal Entity authorized to submit on behalf of the copyright owner. For the purposes of this definition, "submitted" means any form of electronic, verbal, or written communication sent to the Licensor or its representatives, including but not limited to communication on electronic mailing lists, source code control systems, and issue tracking systems that are managed by, or on behalf of, the Licensor for the purpose of discussing and improving the Work, but excluding communication that is conspicuously marked or otherwise designated in writing by the copyright owner as "Not a Contribution." "Contributor" shall mean Licensor and any individual or Legal Entity on behalf of whom a Contribution has been received by Licensor and subsequently incorporated within the Work. 2. Grant of Copyright License. Subject to the terms and conditions of this License, each Contributor hereby grants to You a perpetual, worldwide, non-exclusive, no-charge, royalty-free, irrevocable copyright license to reproduce, prepare Derivative Works of, publicly display, publicly perform, sublicense, and distribute the Work and such Derivative Works in Source or Object form. 3. Grant of Patent License. Subject to the terms and conditions of this License, each Contributor hereby grants to You a perpetual, worldwide, non-exclusive, no-charge, royalty-free, irrevocable (except as stated in this section) patent license to make, have made, use, offer to sell, sell, import, and otherwise transfer the Work, where such license applies only to those patent claims licensable by such Contributor that are necessarily infringed by their Contribution(s) alone or by combination of their Contribution(s) with the Work to which such Contribution(s) was submitted. If You institute patent litigation against any entity (including a cross-claim or counterclaim in a lawsuit) alleging that the Work or a Contribution incorporated within the Work constitutes direct or contributory patent infringement, then any patent licenses granted to You under this License for that Work shall terminate as of the date such litigation is filed. 4. Redistribution. You may reproduce and distribute copies of the Work or Derivative Works thereof in any medium, with or without modifications, and in Source or Object form, provided that You meet the following conditions: (a) You must give any other recipients of the Work or Derivative Works a copy of this License; and (b) You must cause any modified files to carry prominent notices stating that You changed the files; and (c) You must retain, in the Source form of any Derivative Works that You distribute, all copyright, patent, trademark, and attribution notices from the Source form of the Work, excluding those notices that do not pertain to any part of the Derivative Works; and (d) If the Work includes a "NOTICE" text file as part of its distribution, then any Derivative Works that You distribute must include a readable copy of the attribution notices contained within such NOTICE file, excluding those notices that do not pertain to any part of the Derivative Works, in at least one of the following places: within a NOTICE text file distributed as part of the Derivative Works; within the Source form or documentation, if provided along with the Derivative Works; or, within a display generated by the Derivative Works, if and wherever such third-party notices normally appear. The contents of the NOTICE file are for informational purposes only and do not modify the License. You may add Your own attribution notices within Derivative Works that You distribute, alongside or as an addendum to the NOTICE text from the Work, provided that such additional attribution notices cannot be construed as modifying the License. You may add Your own copyright statement to Your modifications and may provide additional or different license terms and conditions for use, reproduction, or distribution of Your modifications, or for any such Derivative Works as a whole, provided Your use, reproduction, and distribution of the Work otherwise complies with the conditions stated in this License. 5. Submission of Contributions. Unless You explicitly state otherwise, any Contribution intentionally submitted for inclusion in the Work by You to the Licensor shall be under the terms and conditions of this License, without any additional terms or conditions. Notwithstanding the above, nothing herein shall supersede or modify the terms of any separate license agreement you may have executed with Licensor regarding such Contributions. 6. Trademarks. This License does not grant permission to use the trade names, trademarks, service marks, or product names of the Licensor, except as required for reasonable and customary use in describing the origin of the Work and reproducing the content of the NOTICE file. 7. Disclaimer of Warranty. Unless required by applicable law or agreed to in writing, Licensor provides the Work (and each Contributor provides its Contributions) on an "AS IS" BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied, including, without limitation, any warranties or conditions of TITLE, NON-INFRINGEMENT, MERCHANTABILITY, or FITNESS FOR A PARTICULAR PURPOSE. You are solely responsible for determining the appropriateness of using or redistributing the Work and assume any risks associated with Your exercise of permissions under this License. 8. Limitation of Liability. In no event and under no legal theory, whether in tort (including negligence), contract, or otherwise, unless required by applicable law (such as deliberate and grossly negligent acts) or agreed to in writing, shall any Contributor be liable to You for damages, including any direct, indirect, special, incidental, or consequential damages of any character arising as a result of this License or out of the use or inability to use the Work (including but not limited to damages for loss of goodwill, work stoppage, computer failure or malfunction, or any and all other commercial damages or losses), even if such Contributor has been advised of the possibility of such damages. 9. Accepting Warranty or Additional Liability. While redistributing the Work or Derivative Works thereof, You may choose to offer, and charge a fee for, acceptance of support, warranty, indemnity, or other liability obligations and/or rights consistent with this License. However, in accepting such obligations, You may act only on Your own behalf and on Your sole responsibility, not on behalf of any other Contributor, and only if You agree to indemnify, defend, and hold each Contributor harmless for any liability incurred by, or claims asserted against, such Contributor by reason of your accepting any such warranty or additional liability. END OF TERMS AND CONDITIONS APPENDIX: How to apply the Apache License to your work. To apply the Apache License to your work, attach the following boilerplate notice, with the fields enclosed by brackets "[]" replaced with your own identifying information. (Don't include the brackets!) The text should be enclosed in the appropriate comment syntax for the file format. We also recommend that a file or class name and description of purpose be included on the same "printed page" as the copyright notice for easier identification within third-party archives. Copyright [yyyy] [name of copyright owner] Licensed under the Apache License, Version 2.0 (the "License"); you may not use this file except in compliance with the License. You may obtain a copy of the License at http://www.apache.org/licenses/LICENSE-2.0 Unless required by applicable law or agreed to in writing, software distributed under the License is distributed on an "AS IS" BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. See the License for the specific language governing permissions and limitations under the License. ------------------------------------------------------------------------------ [4.14] Shipped by 3 packages: cssparser 0.36.0 (MPL-2.0) https://github.com/servo/rust-cssparser cssparser-macros 0.6.1 (MPL-2.0) https://github.com/servo/rust-cssparser dtoa-short 0.3.5 (MPL-2.0) https://github.com/upsuper/dtoa-short Mozilla Public License Version 2.0 ================================== 1. Definitions -------------- 1.1. "Contributor" means each individual or legal entity that creates, contributes to the creation of, or owns Covered Software. 1.2. "Contributor Version" means the combination of the Contributions of others (if any) used by a Contributor and that particular Contributor's Contribution. 1.3. "Contribution" means Covered Software of a particular Contributor. 1.4. "Covered Software" means Source Code Form to which the initial Contributor has attached the notice in Exhibit A, the Executable Form of such Source Code Form, and Modifications of such Source Code Form, in each case including portions thereof. 1.5. "Incompatible With Secondary Licenses" means (a) that the initial Contributor has attached the notice described in Exhibit B to the Covered Software; or (b) that the Covered Software was made available under the terms of version 1.1 or earlier of the License, but not also under the terms of a Secondary License. 1.6. "Executable Form" means any form of the work other than Source Code Form. 1.7. "Larger Work" means a work that combines Covered Software with other material, in a separate file or files, that is not Covered Software. 1.8. "License" means this document. 1.9. "Licensable" means having the right to grant, to the maximum extent possible, whether at the time of the initial grant or subsequently, any and all of the rights conveyed by this License. 1.10. "Modifications" means any of the following: (a) any file in Source Code Form that results from an addition to, deletion from, or modification of the contents of Covered Software; or (b) any new file in Source Code Form that contains any Covered Software. 1.11. "Patent Claims" of a Contributor means any patent claim(s), including without limitation, method, process, and apparatus claims, in any patent Licensable by such Contributor that would be infringed, but for the grant of the License, by the making, using, selling, offering for sale, having made, import, or transfer of either its Contributions or its Contributor Version. 1.12. "Secondary License" means either the GNU General Public License, Version 2.0, the GNU Lesser General Public License, Version 2.1, the GNU Affero General Public License, Version 3.0, or any later versions of those licenses. 1.13. "Source Code Form" means the form of the work preferred for making modifications. 1.14. "You" (or "Your") means an individual or a legal entity exercising rights under this License. For legal entities, "You" includes any entity that controls, is controlled by, or is under common control with You. For purposes of this definition, "control" means (a) the power, direct or indirect, to cause the direction or management of such entity, whether by contract or otherwise, or (b) ownership of more than fifty percent (50%) of the outstanding shares or beneficial ownership of such entity. 2. License Grants and Conditions -------------------------------- 2.1. Grants Each Contributor hereby grants You a world-wide, royalty-free, non-exclusive license: (a) under intellectual property rights (other than patent or trademark) Licensable by such Contributor to use, reproduce, make available, modify, display, perform, distribute, and otherwise exploit its Contributions, either on an unmodified basis, with Modifications, or as part of a Larger Work; and (b) under Patent Claims of such Contributor to make, use, sell, offer for sale, have made, import, and otherwise transfer either its Contributions or its Contributor Version. 2.2. Effective Date The licenses granted in Section 2.1 with respect to any Contribution become effective for each Contribution on the date the Contributor first distributes such Contribution. 2.3. Limitations on Grant Scope The licenses granted in this Section 2 are the only rights granted under this License. No additional rights or licenses will be implied from the distribution or licensing of Covered Software under this License. Notwithstanding Section 2.1(b) above, no patent license is granted by a Contributor: (a) for any code that a Contributor has removed from Covered Software; or (b) for infringements caused by: (i) Your and any other third party's modifications of Covered Software, or (ii) the combination of its Contributions with other software (except as part of its Contributor Version); or (c) under Patent Claims infringed by Covered Software in the absence of its Contributions. This License does not grant any rights in the trademarks, service marks, or logos of any Contributor (except as may be necessary to comply with the notice requirements in Section 3.4). 2.4. Subsequent Licenses No Contributor makes additional grants as a result of Your choice to distribute the Covered Software under a subsequent version of this License (see Section 10.2) or under the terms of a Secondary License (if permitted under the terms of Section 3.3). 2.5. Representation Each Contributor represents that the Contributor believes its Contributions are its original creation(s) or it has sufficient rights to grant the rights to its Contributions conveyed by this License. 2.6. Fair Use This License is not intended to limit any rights You have under applicable copyright doctrines of fair use, fair dealing, or other equivalents. 2.7. Conditions Sections 3.1, 3.2, 3.3, and 3.4 are conditions of the licenses granted in Section 2.1. 3. Responsibilities ------------------- 3.1. Distribution of Source Form All distribution of Covered Software in Source Code Form, including any Modifications that You create or to which You contribute, must be under the terms of this License. You must inform recipients that the Source Code Form of the Covered Software is governed by the terms of this License, and how they can obtain a copy of this License. You may not attempt to alter or restrict the recipients' rights in the Source Code Form. 3.2. Distribution of Executable Form If You distribute Covered Software in Executable Form then: (a) such Covered Software must also be made available in Source Code Form, as described in Section 3.1, and You must inform recipients of the Executable Form how they can obtain a copy of such Source Code Form by reasonable means in a timely manner, at a charge no more than the cost of distribution to the recipient; and (b) You may distribute such Executable Form under the terms of this License, or sublicense it under different terms, provided that the license for the Executable Form does not attempt to limit or alter the recipients' rights in the Source Code Form under this License. 3.3. Distribution of a Larger Work You may create and distribute a Larger Work under terms of Your choice, provided that You also comply with the requirements of this License for the Covered Software. If the Larger Work is a combination of Covered Software with a work governed by one or more Secondary Licenses, and the Covered Software is not Incompatible With Secondary Licenses, this License permits You to additionally distribute such Covered Software under the terms of such Secondary License(s), so that the recipient of the Larger Work may, at their option, further distribute the Covered Software under the terms of either this License or such Secondary License(s). 3.4. Notices You may not remove or alter the substance of any license notices (including copyright notices, patent notices, disclaimers of warranty, or limitations of liability) contained within the Source Code Form of the Covered Software, except that You may alter any license notices to the extent required to remedy known factual inaccuracies. 3.5. Application of Additional Terms You may choose to offer, and to charge a fee for, warranty, support, indemnity or liability obligations to one or more recipients of Covered Software. However, You may do so only on Your own behalf, and not on behalf of any Contributor. You must make it absolutely clear that any such warranty, support, indemnity, or liability obligation is offered by You alone, and You hereby agree to indemnify every Contributor for any liability incurred by such Contributor as a result of warranty, support, indemnity or liability terms You offer. You may include additional disclaimers of warranty and limitations of liability specific to any jurisdiction. 4. Inability to Comply Due to Statute or Regulation --------------------------------------------------- If it is impossible for You to comply with any of the terms of this License with respect to some or all of the Covered Software due to statute, judicial order, or regulation then You must: (a) comply with the terms of this License to the maximum extent possible; and (b) describe the limitations and the code they affect. Such description must be placed in a text file included with all distributions of the Covered Software under this License. Except to the extent prohibited by statute or regulation, such description must be sufficiently detailed for a recipient of ordinary skill to be able to understand it. 5. Termination -------------- 5.1. The rights granted under this License will terminate automatically if You fail to comply with any of its terms. However, if You become compliant, then the rights granted under this License from a particular Contributor are reinstated (a) provisionally, unless and until such Contributor explicitly and finally terminates Your grants, and (b) on an ongoing basis, if such Contributor fails to notify You of the non-compliance by some reasonable means prior to 60 days after You have come back into compliance. Moreover, Your grants from a particular Contributor are reinstated on an ongoing basis if such Contributor notifies You of the non-compliance by some reasonable means, this is the first time You have received notice of non-compliance with this License from such Contributor, and You become compliant prior to 30 days after Your receipt of the notice. 5.2. If You initiate litigation against any entity by asserting a patent infringement claim (excluding declaratory judgment actions, counter-claims, and cross-claims) alleging that a Contributor Version directly or indirectly infringes any patent, then the rights granted to You by any and all Contributors for the Covered Software under Section 2.1 of this License shall terminate. 5.3. In the event of termination under Sections 5.1 or 5.2 above, all end user license agreements (excluding distributors and resellers) which have been validly granted by You or Your distributors under this License prior to termination shall survive termination. ************************************************************************ * * * 6. Disclaimer of Warranty * * ------------------------- * * * * Covered Software is provided under this License on an "as is" * * basis, without warranty of any kind, either expressed, implied, or * * statutory, including, without limitation, warranties that the * * Covered Software is free of defects, merchantable, fit for a * * particular purpose or non-infringing. The entire risk as to the * * quality and performance of the Covered Software is with You. * * Should any Covered Software prove defective in any respect, You * * (not any Contributor) assume the cost of any necessary servicing, * * repair, or correction. This disclaimer of warranty constitutes an * * essential part of this License. No use of any Covered Software is * * authorized under this License except under this disclaimer. * * * ************************************************************************ ************************************************************************ * * * 7. Limitation of Liability * * -------------------------- * * * * Under no circumstances and under no legal theory, whether tort * * (including negligence), contract, or otherwise, shall any * * Contributor, or anyone who distributes Covered Software as * * permitted above, be liable to You for any direct, indirect, * * special, incidental, or consequential damages of any character * * including, without limitation, damages for lost profits, loss of * * goodwill, work stoppage, computer failure or malfunction, or any * * and all other commercial damages or losses, even if such party * * shall have been informed of the possibility of such damages. This * * limitation of liability shall not apply to liability for death or * * personal injury resulting from such party's negligence to the * * extent applicable law prohibits such limitation. Some * * jurisdictions do not allow the exclusion or limitation of * * incidental or consequential damages, so this exclusion and * * limitation may not apply to You. * * * ************************************************************************ 8. Litigation ------------- Any litigation relating to this License may be brought only in the courts of a jurisdiction where the defendant maintains its principal place of business and such litigation shall be governed by laws of that jurisdiction, without reference to its conflict-of-law provisions. Nothing in this Section shall prevent a party's ability to bring cross-claims or counter-claims. 9. Miscellaneous ---------------- This License represents the complete agreement concerning the subject matter hereof. If any provision of this License is held to be unenforceable, such provision shall be reformed only to the extent necessary to make it enforceable. Any law or regulation which provides that the language of a contract shall be construed against the drafter shall not be used to construe this License against a Contributor. 10. Versions of the License --------------------------- 10.1. New Versions Mozilla Foundation is the license steward. Except as provided in Section 10.3, no one other than the license steward has the right to modify or publish new versions of this License. Each version will be given a distinguishing version number. 10.2. Effect of New Versions You may distribute the Covered Software under the terms of the version of the License under which You originally received the Covered Software, or under the terms of any subsequent version published by the license steward. 10.3. Modified Versions If you create software not governed by this License, and you want to create a new license for such software, you may create and use a modified version of this License if you rename the license and remove any references to the name of the license steward (except to note that such modified license differs from this License). 10.4. Distributing Source Code Form that is Incompatible With Secondary Licenses If You choose to distribute Source Code Form that is Incompatible With Secondary Licenses under the terms of this version of the License, the notice described in Exhibit B of this License must be attached. Exhibit A - Source Code Form License Notice ------------------------------------------- This Source Code Form is subject to the terms of the Mozilla Public License, v. 2.0. If a copy of the MPL was not distributed with this file, You can obtain one at http://mozilla.org/MPL/2.0/. If it is not possible or desirable to put the notice in a particular file, then You may include the notice in a location (such as a LICENSE file in a relevant directory) where a recipient would be likely to look for such a notice. You may add additional accurate notices of copyright ownership. Exhibit B - "Incompatible With Secondary Licenses" Notice --------------------------------------------------------- This Source Code Form is "Incompatible With Secondary Licenses", as defined by the Mozilla Public License, v. 2.0. ------------------------------------------------------------------------------ [4.15] Shipped by 1 package: dom_query 0.27.0 (MIT) https://github.com/niklak/dom_query MIT License Copyright (c) 2023 Mykola Humanov 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. --- This project contains portions of code and architectural concepts originally derived from the "nipper" project (https://github.com/importcjj/nipper), developed by Chen Jiaju, licensed under the MIT License and the Apache License 2.0 (dual licensed). ------------------------------------------------------------------------------ [4.16] Shipped by 1 package: dpi 0.1.2 (Apache-2.0 AND MIT) https://github.com/rust-windowing/winit rust-lang/libm as a whole is available for use under the MIT license: ------------------------------------------------------------------------------ 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. ------------------------------------------------------------------------------ This Rust library contains the following copyrights: Copyright (c) 2018 Jorge Aparicio Portions of this software are derived from third-party works licensed under terms compatible with the above MIT license: * musl libc https://www.musl-libc.org/. This library contains the following copyright: Copyright © 2005-2020 Rich Felker, et al. * The CORE-MATH project https://core-math.gitlabpages.inria.fr/. CORE-MATH routines are available under the MIT license on a per-file basis. The musl libc COPYRIGHT file also includes the following notice relevant to math portions of the library: ------------------------------------------------------------------------------ Much of the math library code (src/math/* and src/complex/*) is Copyright © 1993,2004 Sun Microsystems or Copyright © 2003-2011 David Schultz or Copyright © 2003-2009 Steven G. Kargl or Copyright © 2003-2009 Bruce D. Evans or Copyright © 2008 Stephen L. Moshier or Copyright © 2017-2018 Arm Limited and labelled as such in comments in the individual source files. All have been licensed under extremely permissive terms. ------------------------------------------------------------------------------ ------------------------------------------------------------------------------ [4.17] Shipped by 1 package: dunce 1.0.5 (CC0-1.0 OR MIT-0 OR Apache-2.0) https://gitlab.com/kornelski/dunce Creative Commons Legal Code CC0 1.0 Universal CREATIVE COMMONS CORPORATION IS NOT A LAW FIRM AND DOES NOT PROVIDE LEGAL SERVICES. DISTRIBUTION OF THIS DOCUMENT DOES NOT CREATE AN ATTORNEY-CLIENT RELATIONSHIP. CREATIVE COMMONS PROVIDES THIS INFORMATION ON AN "AS-IS" BASIS. CREATIVE COMMONS MAKES NO WARRANTIES REGARDING THE USE OF THIS DOCUMENT OR THE INFORMATION OR WORKS PROVIDED HEREUNDER, AND DISCLAIMS LIABILITY FOR DAMAGES RESULTING FROM THE USE OF THIS DOCUMENT OR THE INFORMATION OR WORKS PROVIDED HEREUNDER. Statement of Purpose The laws of most jurisdictions throughout the world automatically confer exclusive Copyright and Related Rights (defined below) upon the creator and subsequent owner(s) (each and all, an "owner") of an original work of authorship and/or a database (each, a "Work"). Certain owners wish to permanently relinquish those rights to a Work for the purpose of contributing to a commons of creative, cultural and scientific works ("Commons") that the public can reliably and without fear of later claims of infringement build upon, modify, incorporate in other works, reuse and redistribute as freely as possible in any form whatsoever and for any purposes, including without limitation commercial purposes. These owners may contribute to the Commons to promote the ideal of a free culture and the further production of creative, cultural and scientific works, or to gain reputation or greater distribution for their Work in part through the use and efforts of others. For these and/or other purposes and motivations, and without any expectation of additional consideration or compensation, the person associating CC0 with a Work (the "Affirmer"), to the extent that he or she is an owner of Copyright and Related Rights in the Work, voluntarily elects to apply CC0 to the Work and publicly distribute the Work under its terms, with knowledge of his or her Copyright and Related Rights in the Work and the meaning and intended legal effect of CC0 on those rights. 1. Copyright and Related Rights. A Work made available under CC0 may be protected by copyright and related or neighboring rights ("Copyright and Related Rights"). Copyright and Related Rights include, but are not limited to, the following: i. the right to reproduce, adapt, distribute, perform, display, communicate, and translate a Work; ii. moral rights retained by the original author(s) and/or performer(s); iii. publicity and privacy rights pertaining to a person's image or likeness depicted in a Work; iv. rights protecting against unfair competition in regards to a Work, subject to the limitations in paragraph 4(a), below; v. rights protecting the extraction, dissemination, use and reuse of data in a Work; vi. database rights (such as those arising under Directive 96/9/EC of the European Parliament and of the Council of 11 March 1996 on the legal protection of databases, and under any national implementation thereof, including any amended or successor version of such directive); and vii. other similar, equivalent or corresponding rights throughout the world based on applicable law or treaty, and any national implementations thereof. 2. Waiver. To the greatest extent permitted by, but not in contravention of, applicable law, Affirmer hereby overtly, fully, permanently, irrevocably and unconditionally waives, abandons, and surrenders all of Affirmer's Copyright and Related Rights and associated claims and causes of action, whether now known or unknown (including existing as well as future claims and causes of action), in the Work (i) in all territories worldwide, (ii) for the maximum duration provided by applicable law or treaty (including future time extensions), (iii) in any current or future medium and for any number of copies, and (iv) for any purpose whatsoever, including without limitation commercial, advertising or promotional purposes (the "Waiver"). Affirmer makes the Waiver for the benefit of each member of the public at large and to the detriment of Affirmer's heirs and successors, fully intending that such Waiver shall not be subject to revocation, rescission, cancellation, termination, or any other legal or equitable action to disrupt the quiet enjoyment of the Work by the public as contemplated by Affirmer's express Statement of Purpose. 3. Public License Fallback. Should any part of the Waiver for any reason be judged legally invalid or ineffective under applicable law, then the Waiver shall be preserved to the maximum extent permitted taking into account Affirmer's express Statement of Purpose. In addition, to the extent the Waiver is so judged Affirmer hereby grants to each affected person a royalty-free, non transferable, non sublicensable, non exclusive, irrevocable and unconditional license to exercise Affirmer's Copyright and Related Rights in the Work (i) in all territories worldwide, (ii) for the maximum duration provided by applicable law or treaty (including future time extensions), (iii) in any current or future medium and for any number of copies, and (iv) for any purpose whatsoever, including without limitation commercial, advertising or promotional purposes (the "License"). The License shall be deemed effective as of the date CC0 was applied by Affirmer to the Work. Should any part of the License for any reason be judged legally invalid or ineffective under applicable law, such partial invalidity or ineffectiveness shall not invalidate the remainder of the License, and in such case Affirmer hereby affirms that he or she will not (i) exercise any of his or her remaining Copyright and Related Rights in the Work or (ii) assert any associated claims and causes of action with respect to the Work, in either case contrary to Affirmer's express Statement of Purpose. 4. Limitations and Disclaimers. a. No trademark or patent rights held by Affirmer are waived, abandoned, surrendered, licensed or otherwise affected by this document. b. Affirmer offers the Work as-is and makes no representations or warranties of any kind concerning the Work, express, implied, statutory or otherwise, including without limitation warranties of title, merchantability, fitness for a particular purpose, non infringement, or the absence of latent or other defects, accuracy, or the present or absence of errors, whether or not discoverable, all to the greatest extent permissible under applicable law. c. Affirmer disclaims responsibility for clearing rights of other persons that may apply to the Work or any use thereof, including without limitation any person's Copyright and Related Rights in the Work. Further, Affirmer disclaims responsibility for obtaining any necessary consents, permissions or other rights required for any use of the Work. d. Affirmer understands and acknowledges that Creative Commons is not a party to this document and has no duty or obligation with respect to this CC0 or use of the Work. ------------------------------------------------------------------------------ [4.18] Shipped by 1 package: encoding_rs 0.8.35 ((Apache-2.0 OR MIT) AND BSD-3-Clause) https://github.com/hsivonen/encoding_rs Copyright © WHATWG (Apple, Google, Mozilla, Microsoft). Redistribution and use in source and binary forms, with or without modification, are permitted provided that the following conditions are met: 1. Redistributions of source code must retain the above copyright notice, this list of conditions and the following disclaimer. 2. Redistributions in binary form must reproduce the above copyright notice, this list of conditions and the following disclaimer in the documentation and/or other materials provided with the distribution. 3. Neither the name of the copyright holder nor the names of its contributors may be used to endorse or promote products derived from this software without specific prior written permission. THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. ------------------------------------------------------------------------------ [4.19] Shipped by 1 package: enumflags2 0.7.12 (MIT OR Apache-2.0) https://github.com/meithecatte/enumflags2 Apache License Version 2.0, January 2004 http://www.apache.org/licenses/ TERMS AND CONDITIONS FOR USE, REPRODUCTION, AND DISTRIBUTION 1. Definitions. "License" shall mean the terms and conditions for use, reproduction, and distribution as defined by Sections 1 through 9 of this document. "Licensor" shall mean the copyright owner or entity authorized by the copyright owner that is granting the License. "Legal Entity" shall mean the union of the acting entity and all other entities that control, are controlled by, or are under common control with that entity. For the purposes of this definition, "control" means (i) the power, direct or indirect, to cause the direction or management of such entity, whether by contract or otherwise, or (ii) ownership of fifty percent (50%) or more of the outstanding shares, or (iii) beneficial ownership of such entity. "You" (or "Your") shall mean an individual or Legal Entity exercising permissions granted by this License. "Source" form shall mean the preferred form for making modifications, including but not limited to software source code, documentation source, and configuration files. "Object" form shall mean any form resulting from mechanical transformation or translation of a Source form, including but not limited to compiled object code, generated documentation, and conversions to other media types. "Work" shall mean the work of authorship, whether in Source or Object form, made available under the License, as indicated by a copyright notice that is included in or attached to the work (an example is provided in the Appendix below). "Derivative Works" shall mean any work, whether in Source or Object form, that is based on (or derived from) the Work and for which the editorial revisions, annotations, elaborations, or other modifications represent, as a whole, an original work of authorship. For the purposes of this License, Derivative Works shall not include works that remain separable from, or merely link (or bind by name) to the interfaces of, the Work and Derivative Works thereof. "Contribution" shall mean any work of authorship, including the original version of the Work and any modifications or additions to that Work or Derivative Works thereof, that is intentionally submitted to Licensor for inclusion in the Work by the copyright owner or by an individual or Legal Entity authorized to submit on behalf of the copyright owner. For the purposes of this definition, "submitted" means any form of electronic, verbal, or written communication sent to the Licensor or its representatives, including but not limited to communication on electronic mailing lists, source code control systems, and issue tracking systems that are managed by, or on behalf of, the Licensor for the purpose of discussing and improving the Work, but excluding communication that is conspicuously marked or otherwise designated in writing by the copyright owner as "Not a Contribution." "Contributor" shall mean Licensor and any individual or Legal Entity on behalf of whom a Contribution has been received by Licensor and subsequently incorporated within the Work. 2. Grant of Copyright License. Subject to the terms and conditions of this License, each Contributor hereby grants to You a perpetual, worldwide, non-exclusive, no-charge, royalty-free, irrevocable copyright license to reproduce, prepare Derivative Works of, publicly display, publicly perform, sublicense, and distribute the Work and such Derivative Works in Source or Object form. 3. Grant of Patent License. Subject to the terms and conditions of this License, each Contributor hereby grants to You a perpetual, worldwide, non-exclusive, no-charge, royalty-free, irrevocable (except as stated in this section) patent license to make, have made, use, offer to sell, sell, import, and otherwise transfer the Work, where such license applies only to those patent claims licensable by such Contributor that are necessarily infringed by their Contribution(s) alone or by combination of their Contribution(s) with the Work to which such Contribution(s) was submitted. If You institute patent litigation against any entity (including a cross-claim or counterclaim in a lawsuit) alleging that the Work or a Contribution incorporated within the Work constitutes direct or contributory patent infringement, then any patent licenses granted to You under this License for that Work shall terminate as of the date such litigation is filed. 4. Redistribution. You may reproduce and distribute copies of the Work or Derivative Works thereof in any medium, with or without modifications, and in Source or Object form, provided that You meet the following conditions: You must give any other recipients of the Work or Derivative Works a copy of this License; and You must cause any modified files to carry prominent notices stating that You changed the files; and You must retain, in the Source form of any Derivative Works that You distribute, all copyright, patent, trademark, and attribution notices from the Source form of the Work, excluding those notices that do not pertain to any part of the Derivative Works; and If the Work includes a "NOTICE" text file as part of its distribution, then any Derivative Works that You distribute must include a readable copy of the attribution notices contained within such NOTICE file, excluding those notices that do not pertain to any part of the Derivative Works, in at least one of the following places: within a NOTICE text file distributed as part of the Derivative Works; within the Source form or documentation, if provided along with the Derivative Works; or, within a display generated by the Derivative Works, if and wherever such third-party notices normally appear. The contents of the NOTICE file are for informational purposes only and do not modify the License. You may add Your own attribution notices within Derivative Works that You distribute, alongside or as an addendum to the NOTICE text from the Work, provided that such additional attribution notices cannot be construed as modifying the License. You may add Your own copyright statement to Your modifications and may provide additional or different license terms and conditions for use, reproduction, or distribution of Your modifications, or for any such Derivative Works as a whole, provided Your use, reproduction, and distribution of the Work otherwise complies with the conditions stated in this License. 5. Submission of Contributions. Unless You explicitly state otherwise, any Contribution intentionally submitted for inclusion in the Work by You to the Licensor shall be under the terms and conditions of this License, without any additional terms or conditions. Notwithstanding the above, nothing herein shall supersede or modify the terms of any separate license agreement you may have executed with Licensor regarding such Contributions. 6. Trademarks. This License does not grant permission to use the trade names, trademarks, service marks, or product names of the Licensor, except as required for reasonable and customary use in describing the origin of the Work and reproducing the content of the NOTICE file. 7. Disclaimer of Warranty. Unless required by applicable law or agreed to in writing, Licensor provides the Work (and each Contributor provides its Contributions) on an "AS IS" BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied, including, without limitation, any warranties or conditions of TITLE, NON-INFRINGEMENT, MERCHANTABILITY, or FITNESS FOR A PARTICULAR PURPOSE. You are solely responsible for determining the appropriateness of using or redistributing the Work and assume any risks associated with Your exercise of permissions under this License. 8. Limitation of Liability. In no event and under no legal theory, whether in tort (including negligence), contract, or otherwise, unless required by applicable law (such as deliberate and grossly negligent acts) or agreed to in writing, shall any Contributor be liable to You for damages, including any direct, indirect, special, incidental, or consequential damages of any character arising as a result of this License or out of the use or inability to use the Work (including but not limited to damages for loss of goodwill, work stoppage, computer failure or malfunction, or any and all other commercial damages or losses), even if such Contributor has been advised of the possibility of such damages. 9. Accepting Warranty or Additional Liability. While redistributing the Work or Derivative Works thereof, You may choose to offer, and charge a fee for, acceptance of support, warranty, indemnity, or other liability obligations and/or rights consistent with this License. However, in accepting such obligations, You may act only on Your own behalf and on Your sole responsibility, not on behalf of any other Contributor, and only if You agree to indemnify, defend, and hold each Contributor harmless for any liability incurred by, or claims asserted against, such Contributor by reason of your accepting any such warranty or additional liability. END OF TERMS AND CONDITIONS Copyright 2017-2023 Maik Klein, Maja Kądziołka Licensed under the Apache License, Version 2.0 (the "License"); you may not use this file except in compliance with the License. You may obtain a copy of the License at http://www.apache.org/licenses/LICENSE-2.0 Unless required by applicable law or agreed to in writing, software distributed under the License is distributed on an "AS IS" BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. See the License for the specific language governing permissions and limitations under the License. ------------------------------------------------------------------------------ [4.20] Shipped by 1 package: enumflags2_derive 0.7.12 (MIT OR Apache-2.0) https://github.com/meithecatte/enumflags2 Apache License Version 2.0, January 2004 http://www.apache.org/licenses/ TERMS AND CONDITIONS FOR USE, REPRODUCTION, AND DISTRIBUTION 1. Definitions. "License" shall mean the terms and conditions for use, reproduction, and distribution as defined by Sections 1 through 9 of this document. "Licensor" shall mean the copyright owner or entity authorized by the copyright owner that is granting the License. "Legal Entity" shall mean the union of the acting entity and all other entities that control, are controlled by, or are under common control with that entity. For the purposes of this definition, "control" means (i) the power, direct or indirect, to cause the direction or management of such entity, whether by contract or otherwise, or (ii) ownership of fifty percent (50%) or more of the outstanding shares, or (iii) beneficial ownership of such entity. "You" (or "Your") shall mean an individual or Legal Entity exercising permissions granted by this License. "Source" form shall mean the preferred form for making modifications, including but not limited to software source code, documentation source, and configuration files. "Object" form shall mean any form resulting from mechanical transformation or translation of a Source form, including but not limited to compiled object code, generated documentation, and conversions to other media types. "Work" shall mean the work of authorship, whether in Source or Object form, made available under the License, as indicated by a copyright notice that is included in or attached to the work (an example is provided in the Appendix below). "Derivative Works" shall mean any work, whether in Source or Object form, that is based on (or derived from) the Work and for which the editorial revisions, annotations, elaborations, or other modifications represent, as a whole, an original work of authorship. For the purposes of this License, Derivative Works shall not include works that remain separable from, or merely link (or bind by name) to the interfaces of, the Work and Derivative Works thereof. "Contribution" shall mean any work of authorship, including the original version of the Work and any modifications or additions to that Work or Derivative Works thereof, that is intentionally submitted to Licensor for inclusion in the Work by the copyright owner or by an individual or Legal Entity authorized to submit on behalf of the copyright owner. For the purposes of this definition, "submitted" means any form of electronic, verbal, or written communication sent to the Licensor or its representatives, including but not limited to communication on electronic mailing lists, source code control systems, and issue tracking systems that are managed by, or on behalf of, the Licensor for the purpose of discussing and improving the Work, but excluding communication that is conspicuously marked or otherwise designated in writing by the copyright owner as "Not a Contribution." "Contributor" shall mean Licensor and any individual or Legal Entity on behalf of whom a Contribution has been received by Licensor and subsequently incorporated within the Work. 2. Grant of Copyright License. Subject to the terms and conditions of this License, each Contributor hereby grants to You a perpetual, worldwide, non-exclusive, no-charge, royalty-free, irrevocable copyright license to reproduce, prepare Derivative Works of, publicly display, publicly perform, sublicense, and distribute the Work and such Derivative Works in Source or Object form. 3. Grant of Patent License. Subject to the terms and conditions of this License, each Contributor hereby grants to You a perpetual, worldwide, non-exclusive, no-charge, royalty-free, irrevocable (except as stated in this section) patent license to make, have made, use, offer to sell, sell, import, and otherwise transfer the Work, where such license applies only to those patent claims licensable by such Contributor that are necessarily infringed by their Contribution(s) alone or by combination of their Contribution(s) with the Work to which such Contribution(s) was submitted. If You institute patent litigation against any entity (including a cross-claim or counterclaim in a lawsuit) alleging that the Work or a Contribution incorporated within the Work constitutes direct or contributory patent infringement, then any patent licenses granted to You under this License for that Work shall terminate as of the date such litigation is filed. 4. Redistribution. You may reproduce and distribute copies of the Work or Derivative Works thereof in any medium, with or without modifications, and in Source or Object form, provided that You meet the following conditions: You must give any other recipients of the Work or Derivative Works a copy of this License; and You must cause any modified files to carry prominent notices stating that You changed the files; and You must retain, in the Source form of any Derivative Works that You distribute, all copyright, patent, trademark, and attribution notices from the Source form of the Work, excluding those notices that do not pertain to any part of the Derivative Works; and If the Work includes a "NOTICE" text file as part of its distribution, then any Derivative Works that You distribute must include a readable copy of the attribution notices contained within such NOTICE file, excluding those notices that do not pertain to any part of the Derivative Works, in at least one of the following places: within a NOTICE text file distributed as part of the Derivative Works; within the Source form or documentation, if provided along with the Derivative Works; or, within a display generated by the Derivative Works, if and wherever such third-party notices normally appear. The contents of the NOTICE file are for informational purposes only and do not modify the License. You may add Your own attribution notices within Derivative Works that You distribute, alongside or as an addendum to the NOTICE text from the Work, provided that such additional attribution notices cannot be construed as modifying the License. You may add Your own copyright statement to Your modifications and may provide additional or different license terms and conditions for use, reproduction, or distribution of Your modifications, or for any such Derivative Works as a whole, provided Your use, reproduction, and distribution of the Work otherwise complies with the conditions stated in this License. 5. Submission of Contributions. Unless You explicitly state otherwise, any Contribution intentionally submitted for inclusion in the Work by You to the Licensor shall be under the terms and conditions of this License, without any additional terms or conditions. Notwithstanding the above, nothing herein shall supersede or modify the terms of any separate license agreement you may have executed with Licensor regarding such Contributions. 6. Trademarks. This License does not grant permission to use the trade names, trademarks, service marks, or product names of the Licensor, except as required for reasonable and customary use in describing the origin of the Work and reproducing the content of the NOTICE file. 7. Disclaimer of Warranty. Unless required by applicable law or agreed to in writing, Licensor provides the Work (and each Contributor provides its Contributions) on an "AS IS" BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied, including, without limitation, any warranties or conditions of TITLE, NON-INFRINGEMENT, MERCHANTABILITY, or FITNESS FOR A PARTICULAR PURPOSE. You are solely responsible for determining the appropriateness of using or redistributing the Work and assume any risks associated with Your exercise of permissions under this License. 8. Limitation of Liability. In no event and under no legal theory, whether in tort (including negligence), contract, or otherwise, unless required by applicable law (such as deliberate and grossly negligent acts) or agreed to in writing, shall any Contributor be liable to You for damages, including any direct, indirect, special, incidental, or consequential damages of any character arising as a result of this License or out of the use or inability to use the Work (including but not limited to damages for loss of goodwill, work stoppage, computer failure or malfunction, or any and all other commercial damages or losses), even if such Contributor has been advised of the possibility of such damages. 9. Accepting Warranty or Additional Liability. While redistributing the Work or Derivative Works thereof, You may choose to offer, and charge a fee for, acceptance of support, warranty, indemnity, or other liability obligations and/or rights consistent with this License. However, in accepting such obligations, You may act only on Your own behalf and on Your sole responsibility, not on behalf of any other Contributor, and only if You agree to indemnify, defend, and hold each Contributor harmless for any liability incurred by, or claims asserted against, such Contributor by reason of your accepting any such warranty or additional liability. END OF TERMS AND CONDITIONS Copyright [2017] [Maik Klein] Licensed under the Apache License, Version 2.0 (the "License"); you may not use this file except in compliance with the License. You may obtain a copy of the License at http://www.apache.org/licenses/LICENSE-2.0 Unless required by applicable law or agreed to in writing, software distributed under the License is distributed on an "AS IS" BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. See the License for the specific language governing permissions and limitations under the License. ------------------------------------------------------------------------------ [4.21] Shipped by 1 package: foldhash 0.2.0 (Zlib) https://github.com/orlp/foldhash Copyright (c) 2024 Orson Peters This software is provided 'as-is', without any express or implied warranty. In no event will the authors be held liable for any damages arising from the use of this software. Permission is granted to anyone to use this software for any purpose, including commercial applications, and to alter it and redistribute it freely, subject to the following restrictions: 1. The origin of this software must not be misrepresented; you must not claim that you wrote the original software. If you use this software in a product, an acknowledgment in the product documentation would be appreciated but is not required. 2. Altered source versions must be plainly marked as such, and must not be misrepresented as being the original software. 3. This notice may not be removed or altered from any source distribution. ------------------------------------------------------------------------------ [4.22] Shipped by 1 package: fuchsia-cprng 0.1.1 (no licence declared) https://fuchsia.googlesource.com/fuchsia/+/master/garnet/public/rust/fuchsia-cprng Copyright 2019 The Fuchsia Authors. All rights reserved. Redistribution and use in source and binary forms, with or without modification, are permitted provided that the following conditions are met: * Redistributions of source code must retain the above copyright notice, this list of conditions and the following disclaimer. * Redistributions in binary form must reproduce the above copyright notice, this list of conditions and the following disclaimer in the documentation and/or other materials provided with the distribution. * Neither the name of Google Inc. nor the names of its contributors may be used to endorse or promote products derived from this software without specific prior written permission. THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. ------------------------------------------------------------------------------ [4.23] Shipped by 3 packages: hyper-rustls 0.27.9 (Apache-2.0 OR ISC OR MIT) https://github.com/rustls/hyper-rustls rustls 0.23.46 (Apache-2.0 OR ISC OR MIT) https://github.com/rustls/rustls rustls-native-certs 0.8.4 (Apache-2.0 OR ISC OR MIT) https://github.com/rustls/rustls-native-certs ISC License (ISC) Copyright (c) 2016, Joseph Birr-Pixton Permission to use, copy, modify, and/or distribute this software for any purpose with or without fee is hereby granted, provided that the above copyright notice and this permission notice appear in all copies. THE SOFTWARE IS PROVIDED "AS IS" AND THE AUTHOR DISCLAIMS ALL WARRANTIES WITH REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY SPECIAL, DIRECT, INDIRECT, OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR PROFITS, WHETHER IN AN ACTION OF CONTRACT, NEGLIGENCE OR OTHER TORTIOUS ACTION, ARISING OUT OF OR IN CONNECTION WITH THE USE OR PERFORMANCE OF THIS SOFTWARE. ------------------------------------------------------------------------------ [4.24] Shipped by 18 packages: icu_collections 2.2.0 (Unicode-3.0) https://github.com/unicode-org/icu4x icu_locale_core 2.2.0 (Unicode-3.0) https://github.com/unicode-org/icu4x icu_normalizer 2.2.0 (Unicode-3.0) https://github.com/unicode-org/icu4x icu_normalizer_data 2.2.0 (Unicode-3.0) https://github.com/unicode-org/icu4x icu_properties 2.2.0 (Unicode-3.0) https://github.com/unicode-org/icu4x icu_properties_data 2.2.0 (Unicode-3.0) https://github.com/unicode-org/icu4x icu_provider 2.2.0 (Unicode-3.0) https://github.com/unicode-org/icu4x litemap 0.8.2 (Unicode-3.0) https://github.com/unicode-org/icu4x potential_utf 0.1.5 (Unicode-3.0) https://github.com/unicode-org/icu4x tinystr 0.8.3 (Unicode-3.0) https://github.com/unicode-org/icu4x writeable 0.6.3 (Unicode-3.0) https://github.com/unicode-org/icu4x yoke 0.8.3 (Unicode-3.0) https://github.com/unicode-org/icu4x yoke-derive 0.8.2 (Unicode-3.0) https://github.com/unicode-org/icu4x zerofrom 0.1.8 (Unicode-3.0) https://github.com/unicode-org/icu4x zerofrom-derive 0.1.7 (Unicode-3.0) https://github.com/unicode-org/icu4x zerotrie 0.2.4 (Unicode-3.0) https://github.com/unicode-org/icu4x zerovec 0.11.6 (Unicode-3.0) https://github.com/unicode-org/icu4x zerovec-derive 0.11.3 (Unicode-3.0) https://github.com/unicode-org/icu4x UNICODE LICENSE V3 COPYRIGHT AND PERMISSION NOTICE Copyright © 2020-2024 Unicode, Inc. NOTICE TO USER: Carefully read the following legal agreement. BY DOWNLOADING, INSTALLING, COPYING OR OTHERWISE USING DATA FILES, AND/OR SOFTWARE, YOU UNEQUIVOCALLY ACCEPT, AND AGREE TO BE BOUND BY, ALL OF THE TERMS AND CONDITIONS OF THIS AGREEMENT. IF YOU DO NOT AGREE, DO NOT DOWNLOAD, INSTALL, COPY, DISTRIBUTE OR USE THE DATA FILES OR SOFTWARE. Permission is hereby granted, free of charge, to any person obtaining a copy of data files and any associated documentation (the "Data Files") or software and any associated documentation (the "Software") to deal in the Data Files or Software without restriction, including without limitation the rights to use, copy, modify, merge, publish, distribute, and/or sell copies of the Data Files or Software, and to permit persons to whom the Data Files or Software are furnished to do so, provided that either (a) this copyright and permission notice appear with all copies of the Data Files or Software, or (b) this copyright and permission notice appear in associated Documentation. THE DATA FILES AND SOFTWARE ARE 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 OF THIRD PARTY RIGHTS. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR HOLDERS INCLUDED IN THIS NOTICE BE LIABLE FOR ANY CLAIM, OR ANY SPECIAL INDIRECT OR CONSEQUENTIAL DAMAGES, OR ANY DAMAGES WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR PROFITS, WHETHER IN AN ACTION OF CONTRACT, NEGLIGENCE OR OTHER TORTIOUS ACTION, ARISING OUT OF OR IN CONNECTION WITH THE USE OR PERFORMANCE OF THE DATA FILES OR SOFTWARE. Except as contained in this notice, the name of a copyright holder shall not be used in advertising or otherwise to promote the sale, use or other dealings in these Data Files or Software without prior written authorization of the copyright holder. SPDX-License-Identifier: Unicode-3.0 — Portions of ICU4X may have been adapted from ICU4C and/or ICU4J. ICU 1.8.1 to ICU 57.1 © 1995-2016 International Business Machines Corporation and others. ------------------------------------------------------------------------------ [4.25] Shipped by 1 package: if-addrs 0.15.0 (MIT OR BSD-3-Clause) https://github.com/messense/if-addrs Copyright 2018 MaidSafe.net limited. Copyright 2020 messense Redistribution and use in source and binary forms, with or without modification, are permitted provided that the following conditions are met: 1. Redistributions of source code must retain the above copyright notice, this list of conditions and the following disclaimer. 2. Redistributions in binary form must reproduce the above copyright notice, this list of conditions and the following disclaimer in the documentation and/or other materials provided with the distribution. 3. Neither the name of the copyright holder nor the names of its contributors may be used to endorse or promote products derived from this software without specific prior written permission. THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. ------------------------------------------------------------------------------ [4.26] Shipped by 2 packages: libloading 0.7.4 (ISC) https://github.com/nagisa/rust_libloading/ libloading 0.8.9 (ISC) https://github.com/nagisa/rust_libloading/ Copyright © 2015, Simonas Kazlauskas Permission to use, copy, modify, and/or distribute this software for any purpose with or without fee is hereby granted, provided that the above copyright notice and this permission notice appear in all copies. THE SOFTWARE IS PROVIDED "AS IS" AND THE AUTHOR DISCLAIMS ALL WARRANTIES WITH REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY SPECIAL, DIRECT, INDIRECT, OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR PROFITS, WHETHER IN AN ACTION OF CONTRACT, NEGLIGENCE OR OTHER TORTIOUS ACTION, ARISING OUT OF OR IN CONNECTION WITH THE USE OR PERFORMANCE OF THIS SOFTWARE. ------------------------------------------------------------------------------ [4.27] Shipped by 6 packages: linux-raw-sys 0.12.1 (Apache-2.0 WITH LLVM-exception OR Apache-2.0 OR MIT) https://github.com/sunfishcode/linux-raw-sys rustix 1.1.4 (Apache-2.0 WITH LLVM-exception OR Apache-2.0 OR MIT) https://github.com/bytecodealliance/rustix target-lexicon 0.12.16 (Apache-2.0 WITH LLVM-exception) https://github.com/bytecodealliance/target-lexicon wasi 0.11.1+wasi-snapshot-preview1 (Apache-2.0 WITH LLVM-exception OR Apache-2.0 OR MIT) https://github.com/bytecodealliance/wasi wasip2 1.0.4+wasi-0.2.12 (Apache-2.0 WITH LLVM-exception OR Apache-2.0 OR MIT) https://github.com/bytecodealliance/wasi-rs wit-bindgen 0.57.1 (Apache-2.0 WITH LLVM-exception OR Apache-2.0 OR MIT) https://github.com/bytecodealliance/wit-bindgen Apache License Version 2.0, January 2004 http://www.apache.org/licenses/ TERMS AND CONDITIONS FOR USE, REPRODUCTION, AND DISTRIBUTION 1. Definitions. "License" shall mean the terms and conditions for use, reproduction, and distribution as defined by Sections 1 through 9 of this document. "Licensor" shall mean the copyright owner or entity authorized by the copyright owner that is granting the License. "Legal Entity" shall mean the union of the acting entity and all other entities that control, are controlled by, or are under common control with that entity. For the purposes of this definition, "control" means (i) the power, direct or indirect, to cause the direction or management of such entity, whether by contract or otherwise, or (ii) ownership of fifty percent (50%) or more of the outstanding shares, or (iii) beneficial ownership of such entity. "You" (or "Your") shall mean an individual or Legal Entity exercising permissions granted by this License. "Source" form shall mean the preferred form for making modifications, including but not limited to software source code, documentation source, and configuration files. "Object" form shall mean any form resulting from mechanical transformation or translation of a Source form, including but not limited to compiled object code, generated documentation, and conversions to other media types. "Work" shall mean the work of authorship, whether in Source or Object form, made available under the License, as indicated by a copyright notice that is included in or attached to the work (an example is provided in the Appendix below). "Derivative Works" shall mean any work, whether in Source or Object form, that is based on (or derived from) the Work and for which the editorial revisions, annotations, elaborations, or other modifications represent, as a whole, an original work of authorship. For the purposes of this License, Derivative Works shall not include works that remain separable from, or merely link (or bind by name) to the interfaces of, the Work and Derivative Works thereof. "Contribution" shall mean any work of authorship, including the original version of the Work and any modifications or additions to that Work or Derivative Works thereof, that is intentionally submitted to Licensor for inclusion in the Work by the copyright owner or by an individual or Legal Entity authorized to submit on behalf of the copyright owner. For the purposes of this definition, "submitted" means any form of electronic, verbal, or written communication sent to the Licensor or its representatives, including but not limited to communication on electronic mailing lists, source code control systems, and issue tracking systems that are managed by, or on behalf of, the Licensor for the purpose of discussing and improving the Work, but excluding communication that is conspicuously marked or otherwise designated in writing by the copyright owner as "Not a Contribution." "Contributor" shall mean Licensor and any individual or Legal Entity on behalf of whom a Contribution has been received by Licensor and subsequently incorporated within the Work. 2. Grant of Copyright License. Subject to the terms and conditions of this License, each Contributor hereby grants to You a perpetual, worldwide, non-exclusive, no-charge, royalty-free, irrevocable copyright license to reproduce, prepare Derivative Works of, publicly display, publicly perform, sublicense, and distribute the Work and such Derivative Works in Source or Object form. 3. Grant of Patent License. Subject to the terms and conditions of this License, each Contributor hereby grants to You a perpetual, worldwide, non-exclusive, no-charge, royalty-free, irrevocable (except as stated in this section) patent license to make, have made, use, offer to sell, sell, import, and otherwise transfer the Work, where such license applies only to those patent claims licensable by such Contributor that are necessarily infringed by their Contribution(s) alone or by combination of their Contribution(s) with the Work to which such Contribution(s) was submitted. If You institute patent litigation against any entity (including a cross-claim or counterclaim in a lawsuit) alleging that the Work or a Contribution incorporated within the Work constitutes direct or contributory patent infringement, then any patent licenses granted to You under this License for that Work shall terminate as of the date such litigation is filed. 4. Redistribution. You may reproduce and distribute copies of the Work or Derivative Works thereof in any medium, with or without modifications, and in Source or Object form, provided that You meet the following conditions: (a) You must give any other recipients of the Work or Derivative Works a copy of this License; and (b) You must cause any modified files to carry prominent notices stating that You changed the files; and (c) You must retain, in the Source form of any Derivative Works that You distribute, all copyright, patent, trademark, and attribution notices from the Source form of the Work, excluding those notices that do not pertain to any part of the Derivative Works; and (d) If the Work includes a "NOTICE" text file as part of its distribution, then any Derivative Works that You distribute must include a readable copy of the attribution notices contained within such NOTICE file, excluding those notices that do not pertain to any part of the Derivative Works, in at least one of the following places: within a NOTICE text file distributed as part of the Derivative Works; within the Source form or documentation, if provided along with the Derivative Works; or, within a display generated by the Derivative Works, if and wherever such third-party notices normally appear. The contents of the NOTICE file are for informational purposes only and do not modify the License. You may add Your own attribution notices within Derivative Works that You distribute, alongside or as an addendum to the NOTICE text from the Work, provided that such additional attribution notices cannot be construed as modifying the License. You may add Your own copyright statement to Your modifications and may provide additional or different license terms and conditions for use, reproduction, or distribution of Your modifications, or for any such Derivative Works as a whole, provided Your use, reproduction, and distribution of the Work otherwise complies with the conditions stated in this License. 5. Submission of Contributions. Unless You explicitly state otherwise, any Contribution intentionally submitted for inclusion in the Work by You to the Licensor shall be under the terms and conditions of this License, without any additional terms or conditions. Notwithstanding the above, nothing herein shall supersede or modify the terms of any separate license agreement you may have executed with Licensor regarding such Contributions. 6. Trademarks. This License does not grant permission to use the trade names, trademarks, service marks, or product names of the Licensor, except as required for reasonable and customary use in describing the origin of the Work and reproducing the content of the NOTICE file. 7. Disclaimer of Warranty. Unless required by applicable law or agreed to in writing, Licensor provides the Work (and each Contributor provides its Contributions) on an "AS IS" BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied, including, without limitation, any warranties or conditions of TITLE, NON-INFRINGEMENT, MERCHANTABILITY, or FITNESS FOR A PARTICULAR PURPOSE. You are solely responsible for determining the appropriateness of using or redistributing the Work and assume any risks associated with Your exercise of permissions under this License. 8. Limitation of Liability. In no event and under no legal theory, whether in tort (including negligence), contract, or otherwise, unless required by applicable law (such as deliberate and grossly negligent acts) or agreed to in writing, shall any Contributor be liable to You for damages, including any direct, indirect, special, incidental, or consequential damages of any character arising as a result of this License or out of the use or inability to use the Work (including but not limited to damages for loss of goodwill, work stoppage, computer failure or malfunction, or any and all other commercial damages or losses), even if such Contributor has been advised of the possibility of such damages. 9. Accepting Warranty or Additional Liability. While redistributing the Work or Derivative Works thereof, You may choose to offer, and charge a fee for, acceptance of support, warranty, indemnity, or other liability obligations and/or rights consistent with this License. However, in accepting such obligations, You may act only on Your own behalf and on Your sole responsibility, not on behalf of any other Contributor, and only if You agree to indemnify, defend, and hold each Contributor harmless for any liability incurred by, or claims asserted against, such Contributor by reason of your accepting any such warranty or additional liability. END OF TERMS AND CONDITIONS APPENDIX: How to apply the Apache License to your work. To apply the Apache License to your work, attach the following boilerplate notice, with the fields enclosed by brackets "[]" replaced with your own identifying information. (Don't include the brackets!) The text should be enclosed in the appropriate comment syntax for the file format. We also recommend that a file or class name and description of purpose be included on the same "printed page" as the copyright notice for easier identification within third-party archives. Copyright [yyyy] [name of copyright owner] Licensed under the Apache License, Version 2.0 (the "License"); you may not use this file except in compliance with the License. You may obtain a copy of the License at http://www.apache.org/licenses/LICENSE-2.0 Unless required by applicable law or agreed to in writing, software distributed under the License is distributed on an "AS IS" BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. See the License for the specific language governing permissions and limitations under the License. --- LLVM Exceptions to the Apache 2.0 License ---- As an exception, if, as a result of your compiling your source code, portions of this Software are embedded into an Object form of such source code, you may redistribute such embedded portions in such Object form without complying with the conditions of Sections 4(a), 4(b) and 4(d) of the License. In addition, if you combine or link compiled forms of this Software with software that is licensed under the GPLv2 ("Combined Software") and if a court of competent jurisdiction determines that the patent provision (Section 3), the indemnity provision (Section 9) or other Section of the License conflicts with the conditions of the GPLv2, you may retroactively and prospectively choose to deem waived or otherwise exclude such Section(s) of the License, but only in their entirety and only with respect to the Combined Software. ------------------------------------------------------------------------------ [4.28] Shipped by 1 package: lru-slab 0.1.2 (MIT OR Apache-2.0 OR Zlib) https://github.com/Ralith/lru-slab Copyright (c) 2024 The lru-slab Developers This software is provided 'as-is', without any express or implied warranty. In no event will the authors be held liable for any damages arising from the use of this software. Permission is granted to anyone to use this software for any purpose, including commercial applications, and to alter it and redistribute it freely, subject to the following restrictions: 1. The origin of this software must not be misrepresented; you must not claim that you wrote the original software. If you use this software in a product, an acknowledgment in the product documentation would be appreciated but is not required. 2. Altered source versions must be plainly marked as such, and must not be misrepresented as being the original software. 3. This notice may not be removed or altered from any source distribution. ------------------------------------------------------------------------------ [4.29] Shipped by 1 package: mach2 0.4.3 (BSD-2-Clause OR MIT OR Apache-2.0) https://github.com/JohnTitor/mach2 Copyright (c) 2019 Nick Fitzgerald, 2021 Yuki Okushi All rights reserved. Redistribution and use in source and binary forms, with or without modification, are permitted provided that the following conditions are met: 1. Redistributions of source code must retain the above copyright notice, this list of conditions and the following disclaimer. 2. Redistributions in binary form must reproduce the above copyright notice, this list of conditions and the following disclaimer in the documentation and/or other materials provided with the distribution. THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. ------------------------------------------------------------------------------ [4.30] Shipped by 1 package: minimal-lexical 0.2.1 (MIT OR Apache-2.0) https://github.com/Alexhuszagh/minimal-lexical Minimal-lexical is dual licensed under the Apache 2.0 license as well as the MIT license. See the LICENCE-MIT and the LICENCE-APACHE files for the licenses. --- `src/bellerophon.rs` is loosely based off the Golang implementation, found [here](https://github.com/golang/go/blob/b10849fbb97a2244c086991b4623ae9f32c212d0/src/strconv/extfloat.go). That code (used if the `compact` feature is enabled) is subject to a [3-clause BSD license](https://github.com/golang/go/blob/b10849fbb97a2244c086991b4623ae9f32c212d0/LICENSE): Copyright (c) 2009 The Go Authors. All rights reserved. Redistribution and use in source and binary forms, with or without modification, are permitted provided that the following conditions are met: * Redistributions of source code must retain the above copyright notice, this list of conditions and the following disclaimer. * Redistributions in binary form must reproduce the above copyright notice, this list of conditions and the following disclaimer in the documentation and/or other materials provided with the distribution. * Neither the name of Google Inc. nor the names of its contributors may be used to endorse or promote products derived from this software without specific prior written permission. THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. ------------------------------------------------------------------------------ [4.31] Shipped by 1 package: miniz_oxide 0.8.9 (MIT OR Zlib OR Apache-2.0) https://github.com/Frommi/miniz_oxide/tree/master/miniz_oxide Copyright 2013-2014 RAD Game Tools and Valve Software Copyright 2010-2014 Rich Geldreich and Tenacious Software LLC Copyright (c) 2020 Frommi Copyright (c) 2017-2024 oyvindln This software is provided 'as-is', without any express or implied warranty. In no event will the authors be held liable for any damages arising from the use of this software. Permission is granted to anyone to use this software for any purpose, including commercial applications, and to alter it and redistribute it freely, subject to the following restrictions: 1. The origin of this software must not be misrepresented; you must not claim that you wrote the original software. If you use this software in a product, an acknowledgment in the product documentation would be appreciated but is not required. 2. Altered source versions must be plainly marked as such, and must not be misrepresented as being the original software. 3. This notice may not be removed or altered from any source distribution. ------------------------------------------------------------------------------ [4.32] Shipped by 1 package: muda 0.19.3 (Apache-2.0 OR MIT) https://github.com/tauri-apps/muda SPDXVersion: SPDX-2.1 DataLicense: CC0-1.0 PackageName: muda DataFormat: SPDXRef-1 PackageSupplier: Organization: The Tauri Programme in the Commons Conservancy PackageHomePage: https://tauri.app PackageLicenseDeclared: Apache-2.0 PackageLicenseDeclared: MIT PackageCopyrightText: 2020-2022, The Tauri Programme in the Commons Conservancy PackageSummary: Menu Utilities for Desktop Applications. PackageComment: The package includes the following libraries; see Relationship information. Created: 2022-12-05T09:00:00Z PackageDownloadLocation: git://github.com/tauri-apps/muda PackageDownloadLocation: git+https://github.com/tauri-apps/muda.git PackageDownloadLocation: git+ssh://github.com/tauri-apps/muda.git Creator: Person: Daniel Thompson-Yvetot ------------------------------------------------------------------------------ [4.33] Shipped by 2 packages: num_enum 0.7.6 (BSD-3-Clause OR MIT OR Apache-2.0) https://github.com/illicitonion/num_enum num_enum_derive 0.7.6 (BSD-3-Clause OR MIT OR Apache-2.0) https://github.com/illicitonion/num_enum Copyright (c) 2018, Daniel Wagner-Hall All rights reserved. Redistribution and use in source and binary forms, with or without modification, are permitted provided that the following conditions are met: * Redistributions of source code must retain the above copyright notice, this list of conditions and the following disclaimer. * Redistributions in binary form must reproduce the above copyright notice, this list of conditions and the following disclaimer in the documentation and/or other materials provided with the distribution. * Neither the name of num_enum nor the names of its contributors may be used to endorse or promote products derived from this software without specific prior written permission. THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. ------------------------------------------------------------------------------ [4.34] Shipped by 1 package: openssl 0.10.81 (Apache-2.0) https://github.com/rust-openssl/rust-openssl Copyright 2011-2017 Google Inc. 2013 Jack Lloyd 2013-2014 Steven Fackler Licensed under the Apache License, Version 2.0 (the "License"); you may not use this file except in compliance with the License. You may obtain a copy of the License at http://www.apache.org/licenses/LICENSE-2.0 Unless required by applicable law or agreed to in writing, software distributed under the License is distributed on an "AS IS" BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. See the License for the specific language governing permissions and limitations under the License. ------------------------------------------------------------------------------ [4.35] Shipped by 1 package: option-ext 0.2.0 (MPL-2.0) https://github.com/soc/option-ext.git Mozilla Public License Version 2.0 ================================== 1. Definitions -------------- 1.1. "Contributor" means each individual or legal entity that creates, contributes to the creation of, or owns Covered Software. 1.2. "Contributor Version" means the combination of the Contributions of others (if any) used by a Contributor and that particular Contributor's Contribution. 1.3. "Contribution" means Covered Software of a particular Contributor. 1.4. "Covered Software" means Source Code Form to which the initial Contributor has attached the notice in Exhibit A, the Executable Form of such Source Code Form, and Modifications of such Source Code Form, in each case including portions thereof. 1.5. "Incompatible With Secondary Licenses" means (a) that the initial Contributor has attached the notice described in Exhibit B to the Covered Software; or (b) that the Covered Software was made available under the terms of version 1.1 or earlier of the License, but not also under the terms of a Secondary License. 1.6. "Executable Form" means any form of the work other than Source Code Form. 1.7. "Larger Work" means a work that combines Covered Software with other material, in a separate file or files, that is not Covered Software. 1.8. "License" means this document. 1.9. "Licensable" means having the right to grant, to the maximum extent possible, whether at the time of the initial grant or subsequently, any and all of the rights conveyed by this License. 1.10. "Modifications" means any of the following: (a) any file in Source Code Form that results from an addition to, deletion from, or modification of the contents of Covered Software; or (b) any new file in Source Code Form that contains any Covered Software. 1.11. "Patent Claims" of a Contributor means any patent claim(s), including without limitation, method, process, and apparatus claims, in any patent Licensable by such Contributor that would be infringed, but for the grant of the License, by the making, using, selling, offering for sale, having made, import, or transfer of either its Contributions or its Contributor Version. 1.12. "Secondary License" means either the GNU General Public License, Version 2.0, the GNU Lesser General Public License, Version 2.1, the GNU Affero General Public License, Version 3.0, or any later versions of those licenses. 1.13. "Source Code Form" means the form of the work preferred for making modifications. 1.14. "You" (or "Your") means an individual or a legal entity exercising rights under this License. For legal entities, "You" includes any entity that controls, is controlled by, or is under common control with You. For purposes of this definition, "control" means (a) the power, direct or indirect, to cause the direction or management of such entity, whether by contract or otherwise, or (b) ownership of more than fifty percent (50%) of the outstanding shares or beneficial ownership of such entity. 2. License Grants and Conditions -------------------------------- 2.1. Grants Each Contributor hereby grants You a world-wide, royalty-free, non-exclusive license: (a) under intellectual property rights (other than patent or trademark) Licensable by such Contributor to use, reproduce, make available, modify, display, perform, distribute, and otherwise exploit its Contributions, either on an unmodified basis, with Modifications, or as part of a Larger Work; and (b) under Patent Claims of such Contributor to make, use, sell, offer for sale, have made, import, and otherwise transfer either its Contributions or its Contributor Version. 2.2. Effective Date The licenses granted in Section 2.1 with respect to any Contribution become effective for each Contribution on the date the Contributor first distributes such Contribution. 2.3. Limitations on Grant Scope The licenses granted in this Section 2 are the only rights granted under this License. No additional rights or licenses will be implied from the distribution or licensing of Covered Software under this License. Notwithstanding Section 2.1(b) above, no patent license is granted by a Contributor: (a) for any code that a Contributor has removed from Covered Software; or (b) for infringements caused by: (i) Your and any other third party's modifications of Covered Software, or (ii) the combination of its Contributions with other software (except as part of its Contributor Version); or (c) under Patent Claims infringed by Covered Software in the absence of its Contributions. This License does not grant any rights in the trademarks, service marks, or logos of any Contributor (except as may be necessary to comply with the notice requirements in Section 3.4). 2.4. Subsequent Licenses No Contributor makes additional grants as a result of Your choice to distribute the Covered Software under a subsequent version of this License (see Section 10.2) or under the terms of a Secondary License (if permitted under the terms of Section 3.3). 2.5. Representation Each Contributor represents that the Contributor believes its Contributions are its original creation(s) or it has sufficient rights to grant the rights to its Contributions conveyed by this License. 2.6. Fair Use This License is not intended to limit any rights You have under applicable copyright doctrines of fair use, fair dealing, or other equivalents. 2.7. Conditions Sections 3.1, 3.2, 3.3, and 3.4 are conditions of the licenses granted in Section 2.1. 3. Responsibilities ------------------- 3.1. Distribution of Source Form All distribution of Covered Software in Source Code Form, including any Modifications that You create or to which You contribute, must be under the terms of this License. You must inform recipients that the Source Code Form of the Covered Software is governed by the terms of this License, and how they can obtain a copy of this License. You may not attempt to alter or restrict the recipients' rights in the Source Code Form. 3.2. Distribution of Executable Form If You distribute Covered Software in Executable Form then: (a) such Covered Software must also be made available in Source Code Form, as described in Section 3.1, and You must inform recipients of the Executable Form how they can obtain a copy of such Source Code Form by reasonable means in a timely manner, at a charge no more than the cost of distribution to the recipient; and (b) You may distribute such Executable Form under the terms of this License, or sublicense it under different terms, provided that the license for the Executable Form does not attempt to limit or alter the recipients' rights in the Source Code Form under this License. 3.3. Distribution of a Larger Work You may create and distribute a Larger Work under terms of Your choice, provided that You also comply with the requirements of this License for the Covered Software. If the Larger Work is a combination of Covered Software with a work governed by one or more Secondary Licenses, and the Covered Software is not Incompatible With Secondary Licenses, this License permits You to additionally distribute such Covered Software under the terms of such Secondary License(s), so that the recipient of the Larger Work may, at their option, further distribute the Covered Software under the terms of either this License or such Secondary License(s). 3.4. Notices You may not remove or alter the substance of any license notices (including copyright notices, patent notices, disclaimers of warranty, or limitations of liability) contained within the Source Code Form of the Covered Software, except that You may alter any license notices to the extent required to remedy known factual inaccuracies. 3.5. Application of Additional Terms You may choose to offer, and to charge a fee for, warranty, support, indemnity or liability obligations to one or more recipients of Covered Software. However, You may do so only on Your own behalf, and not on behalf of any Contributor. You must make it absolutely clear that any such warranty, support, indemnity, or liability obligation is offered by You alone, and You hereby agree to indemnify every Contributor for any liability incurred by such Contributor as a result of warranty, support, indemnity or liability terms You offer. You may include additional disclaimers of warranty and limitations of liability specific to any jurisdiction. 4. Inability to Comply Due to Statute or Regulation --------------------------------------------------- If it is impossible for You to comply with any of the terms of this License with respect to some or all of the Covered Software due to statute, judicial order, or regulation then You must: (a) comply with the terms of this License to the maximum extent possible; and (b) describe the limitations and the code they affect. Such description must be placed in a text file included with all distributions of the Covered Software under this License. Except to the extent prohibited by statute or regulation, such description must be sufficiently detailed for a recipient of ordinary skill to be able to understand it. 5. Termination -------------- 5.1. The rights granted under this License will terminate automatically if You fail to comply with any of its terms. However, if You become compliant, then the rights granted under this License from a particular Contributor are reinstated (a) provisionally, unless and until such Contributor explicitly and finally terminates Your grants, and (b) on an ongoing basis, if such Contributor fails to notify You of the non-compliance by some reasonable means prior to 60 days after You have come back into compliance. Moreover, Your grants from a particular Contributor are reinstated on an ongoing basis if such Contributor notifies You of the non-compliance by some reasonable means, this is the first time You have received notice of non-compliance with this License from such Contributor, and You become compliant prior to 30 days after Your receipt of the notice. 5.2. If You initiate litigation against any entity by asserting a patent infringement claim (excluding declaratory judgment actions, counter-claims, and cross-claims) alleging that a Contributor Version directly or indirectly infringes any patent, then the rights granted to You by any and all Contributors for the Covered Software under Section 2.1 of this License shall terminate. 5.3. In the event of termination under Sections 5.1 or 5.2 above, all end user license agreements (excluding distributors and resellers) which have been validly granted by You or Your distributors under this License prior to termination shall survive termination. ************************************************************************ * * * 6. Disclaimer of Warranty * * ------------------------- * * * * Covered Software is provided under this License on an "as is" * * basis, without warranty of any kind, either expressed, implied, or * * statutory, including, without limitation, warranties that the * * Covered Software is free of defects, merchantable, fit for a * * particular purpose or non-infringing. The entire risk as to the * * quality and performance of the Covered Software is with You. * * Should any Covered Software prove defective in any respect, You * * (not any Contributor) assume the cost of any necessary servicing, * * repair, or correction. This disclaimer of warranty constitutes an * * essential part of this License. No use of any Covered Software is * * authorized under this License except under this disclaimer. * * * ************************************************************************ ************************************************************************ * * * 7. Limitation of Liability * * -------------------------- * * * * Under no circumstances and under no legal theory, whether tort * * (including negligence), contract, or otherwise, shall any * * Contributor, or anyone who distributes Covered Software as * * permitted above, be liable to You for any direct, indirect, * * special, incidental, or consequential damages of any character * * including, without limitation, damages for lost profits, loss of * * goodwill, work stoppage, computer failure or malfunction, or any * * and all other commercial damages or losses, even if such party * * shall have been informed of the possibility of such damages. This * * limitation of liability shall not apply to liability for death or * * personal injury resulting from such party's negligence to the * * extent applicable law prohibits such limitation. Some * * jurisdictions do not allow the exclusion or limitation of * * incidental or consequential damages, so this exclusion and * * limitation may not apply to You. * * * ************************************************************************ 8. Litigation ------------- Any litigation relating to this License may be brought only in the courts of a jurisdiction where the defendant maintains its principal place of business and such litigation shall be governed by laws of that jurisdiction, without reference to its conflict-of-law provisions. Nothing in this Section shall prevent a party's ability to bring cross-claims or counter-claims. 9. Miscellaneous ---------------- This License represents the complete agreement concerning the subject matter hereof. If any provision of this License is held to be unenforceable, such provision shall be reformed only to the extent necessary to make it enforceable. Any law or regulation which provides that the language of a contract shall be construed against the drafter shall not be used to construe this License against a Contributor. 10. Versions of the License --------------------------- 10.1. New Versions Mozilla Foundation is the license steward. Except as provided in Section 10.3, no one other than the license steward has the right to modify or publish new versions of this License. Each version will be given a distinguishing version number. 10.2. Effect of New Versions You may distribute the Covered Software under the terms of the version of the License under which You originally received the Covered Software, or under the terms of any subsequent version published by the license steward. 10.3. Modified Versions If you create software not governed by this License, and you want to create a new license for such software, you may create and use a modified version of this License if you rename the license and remove any references to the name of the license steward (except to note that such modified license differs from this License). 10.4. Distributing Source Code Form that is Incompatible With Secondary Licenses If You choose to distribute Source Code Form that is Incompatible With Secondary Licenses under the terms of this version of the License, the notice described in Exhibit B of this License must be attached. Exhibit A - Source Code Form License Notice ------------------------------------------- This Source Code Form is subject to the terms of the Mozilla Public License, v. 2.0. If a copy of the MPL was not distributed with this file, You can obtain one at https://mozilla.org/MPL/2.0/. If it is not possible or desirable to put the notice in a particular file, then You may include the notice in a location (such as a LICENSE file in a relevant directory) where a recipient would be likely to look for such a notice. You may add additional accurate notices of copyright ownership. Exhibit B - "Incompatible With Secondary Licenses" Notice --------------------------------------------------------- This Source Code Form is "Incompatible With Secondary Licenses", as defined by the Mozilla Public License, v. 2.0. ------------------------------------------------------------------------------ [4.36] Shipped by 1 package: parking 2.2.1 (Apache-2.0 OR MIT) https://github.com/smol-rs/parking =============================================================================== Copyright 2014-2020 The Rust Project Developers Licensed under the Apache License, Version 2.0 or the MIT license , at your option. All files in the project carrying such notice may not be copied, modified, or distributed except according to those terms. ------------------------------------------------------------------------------ [4.37] Shipped by 1 package: raw-window-handle 0.6.2 (MIT OR Apache-2.0 OR Zlib) https://github.com/rust-windowing/raw-window-handle Copyright (c) 2020 Osspial This software is provided 'as-is', without any express or implied warranty. In no event will the authors be held liable for any damages arising from the use of this software. Permission is granted to anyone to use this software for any purpose, including commercial applications, and to alter it and redistribute it freely, subject to the following restrictions: 1. The origin of this software must not be misrepresented; you must not claim that you wrote the original software. If you use this software in a product, an acknowledgment in the product documentation would be appreciated but is not required. 2. Altered source versions must be plainly marked as such, and must not be misrepresented as being the original software. 3. This notice may not be removed or altered from any source distribution. ------------------------------------------------------------------------------ [4.38] Shipped by 1 package: rdrand 0.4.0 (ISC) https://github.com/nagisa/rust_rdrand/ Copyright © 2014, Simonas Kazlauskas Permission to use, copy, modify, and/or distribute this software for any purpose with or without fee is hereby granted, provided that the above copyright notice and this permission notice appear in all copies. THE SOFTWARE IS PROVIDED "AS IS" AND THE AUTHOR DISCLAIMS ALL WARRANTIES WITH REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY SPECIAL, DIRECT, INDIRECT, OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR PROFITS, WHETHER IN AN ACTION OF CONTRACT, NEGLIGENCE OR OTHER TORTIOUS ACTION, ARISING OUT OF OR IN CONNECTION WITH THE USE OR PERFORMANCE OF THIS SOFTWARE. ------------------------------------------------------------------------------ [4.39] Shipped by 1 package: ring 0.17.14 (Apache-2.0 AND ISC) https://github.com/briansmith/ring *ring* uses an "ISC" license, like BoringSSL used to use, for new code files. See LICENSE-other-bits for the text of that license. See LICENSE-BoringSSL for code that was sourced from BoringSSL under the Apache 2.0 license. Some code that was sourced from BoringSSL under the ISC license. In each case, the license info is at the top of the file. See src/polyfill/once_cell/LICENSE-APACHE and src/polyfill/once_cell/LICENSE-MIT for the license to code that was sourced from the once_cell project. ------------------------------------------------------------------------------ [4.40] Shipped by 1 package: ring 0.17.14 (Apache-2.0 AND ISC) https://github.com/briansmith/ring Apache License Version 2.0, January 2004 http://www.apache.org/licenses/ TERMS AND CONDITIONS FOR USE, REPRODUCTION, AND DISTRIBUTION 1. Definitions. "License" shall mean the terms and conditions for use, reproduction, and distribution as defined by Sections 1 through 9 of this document. "Licensor" shall mean the copyright owner or entity authorized by the copyright owner that is granting the License. "Legal Entity" shall mean the union of the acting entity and all other entities that control, are controlled by, or are under common control with that entity. For the purposes of this definition, "control" means (i) the power, direct or indirect, to cause the direction or management of such entity, whether by contract or otherwise, or (ii) ownership of fifty percent (50%) or more of the outstanding shares, or (iii) beneficial ownership of such entity. "You" (or "Your") shall mean an individual or Legal Entity exercising permissions granted by this License. "Source" form shall mean the preferred form for making modifications, including but not limited to software source code, documentation source, and configuration files. "Object" form shall mean any form resulting from mechanical transformation or translation of a Source form, including but not limited to compiled object code, generated documentation, and conversions to other media types. "Work" shall mean the work of authorship, whether in Source or Object form, made available under the License, as indicated by a copyright notice that is included in or attached to the work (an example is provided in the Appendix below). "Derivative Works" shall mean any work, whether in Source or Object form, that is based on (or derived from) the Work and for which the editorial revisions, annotations, elaborations, or other modifications represent, as a whole, an original work of authorship. For the purposes of this License, Derivative Works shall not include works that remain separable from, or merely link (or bind by name) to the interfaces of, the Work and Derivative Works thereof. "Contribution" shall mean any work of authorship, including the original version of the Work and any modifications or additions to that Work or Derivative Works thereof, that is intentionally submitted to Licensor for inclusion in the Work by the copyright owner or by an individual or Legal Entity authorized to submit on behalf of the copyright owner. For the purposes of this definition, "submitted" means any form of electronic, verbal, or written communication sent to the Licensor or its representatives, including but not limited to communication on electronic mailing lists, source code control systems, and issue tracking systems that are managed by, or on behalf of, the Licensor for the purpose of discussing and improving the Work, but excluding communication that is conspicuously marked or otherwise designated in writing by the copyright owner as "Not a Contribution." "Contributor" shall mean Licensor and any individual or Legal Entity on behalf of whom a Contribution has been received by Licensor and subsequently incorporated within the Work. 2. Grant of Copyright License. Subject to the terms and conditions of this License, each Contributor hereby grants to You a perpetual, worldwide, non-exclusive, no-charge, royalty-free, irrevocable copyright license to reproduce, prepare Derivative Works of, publicly display, publicly perform, sublicense, and distribute the Work and such Derivative Works in Source or Object form. 3. Grant of Patent License. Subject to the terms and conditions of this License, each Contributor hereby grants to You a perpetual, worldwide, non-exclusive, no-charge, royalty-free, irrevocable (except as stated in this section) patent license to make, have made, use, offer to sell, sell, import, and otherwise transfer the Work, where such license applies only to those patent claims licensable by such Contributor that are necessarily infringed by their Contribution(s) alone or by combination of their Contribution(s) with the Work to which such Contribution(s) was submitted. If You institute patent litigation against any entity (including a cross-claim or counterclaim in a lawsuit) alleging that the Work or a Contribution incorporated within the Work constitutes direct or contributory patent infringement, then any patent licenses granted to You under this License for that Work shall terminate as of the date such litigation is filed. 4. Redistribution. You may reproduce and distribute copies of the Work or Derivative Works thereof in any medium, with or without modifications, and in Source or Object form, provided that You meet the following conditions: (a) You must give any other recipients of the Work or Derivative Works a copy of this License; and (b) You must cause any modified files to carry prominent notices stating that You changed the files; and (c) You must retain, in the Source form of any Derivative Works that You distribute, all copyright, patent, trademark, and attribution notices from the Source form of the Work, excluding those notices that do not pertain to any part of the Derivative Works; and (d) If the Work includes a "NOTICE" text file as part of its distribution, then any Derivative Works that You distribute must include a readable copy of the attribution notices contained within such NOTICE file, excluding those notices that do not pertain to any part of the Derivative Works, in at least one of the following places: within a NOTICE text file distributed as part of the Derivative Works; within the Source form or documentation, if provided along with the Derivative Works; or, within a display generated by the Derivative Works, if and wherever such third-party notices normally appear. The contents of the NOTICE file are for informational purposes only and do not modify the License. You may add Your own attribution notices within Derivative Works that You distribute, alongside or as an addendum to the NOTICE text from the Work, provided that such additional attribution notices cannot be construed as modifying the License. You may add Your own copyright statement to Your modifications and may provide additional or different license terms and conditions for use, reproduction, or distribution of Your modifications, or for any such Derivative Works as a whole, provided Your use, reproduction, and distribution of the Work otherwise complies with the conditions stated in this License. 5. Submission of Contributions. Unless You explicitly state otherwise, any Contribution intentionally submitted for inclusion in the Work by You to the Licensor shall be under the terms and conditions of this License, without any additional terms or conditions. Notwithstanding the above, nothing herein shall supersede or modify the terms of any separate license agreement you may have executed with Licensor regarding such Contributions. 6. Trademarks. This License does not grant permission to use the trade names, trademarks, service marks, or product names of the Licensor, except as required for reasonable and customary use in describing the origin of the Work and reproducing the content of the NOTICE file. 7. Disclaimer of Warranty. Unless required by applicable law or agreed to in writing, Licensor provides the Work (and each Contributor provides its Contributions) on an "AS IS" BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied, including, without limitation, any warranties or conditions of TITLE, NON-INFRINGEMENT, MERCHANTABILITY, or FITNESS FOR A PARTICULAR PURPOSE. You are solely responsible for determining the appropriateness of using or redistributing the Work and assume any risks associated with Your exercise of permissions under this License. 8. Limitation of Liability. In no event and under no legal theory, whether in tort (including negligence), contract, or otherwise, unless required by applicable law (such as deliberate and grossly negligent acts) or agreed to in writing, shall any Contributor be liable to You for damages, including any direct, indirect, special, incidental, or consequential damages of any character arising as a result of this License or out of the use or inability to use the Work (including but not limited to damages for loss of goodwill, work stoppage, computer failure or malfunction, or any and all other commercial damages or losses), even if such Contributor has been advised of the possibility of such damages. 9. Accepting Warranty or Additional Liability. While redistributing the Work or Derivative Works thereof, You may choose to offer, and charge a fee for, acceptance of support, warranty, indemnity, or other liability obligations and/or rights consistent with this License. However, in accepting such obligations, You may act only on Your own behalf and on Your sole responsibility, not on behalf of any other Contributor, and only if You agree to indemnify, defend, and hold each Contributor harmless for any liability incurred by, or claims asserted against, such Contributor by reason of your accepting any such warranty or additional liability. END OF TERMS AND CONDITIONS APPENDIX: How to apply the Apache License to your work. To apply the Apache License to your work, attach the following boilerplate notice, with the fields enclosed by brackets "[]" replaced with your own identifying information. (Don't include the brackets!) The text should be enclosed in the appropriate comment syntax for the file format. We also recommend that a file or class name and description of purpose be included on the same "printed page" as the copyright notice for easier identification within third-party archives. Copyright [yyyy] [name of copyright owner] Licensed under the Apache License, Version 2.0 (the "License"); you may not use this file except in compliance with the License. You may obtain a copy of the License at http://www.apache.org/licenses/LICENSE-2.0 Unless required by applicable law or agreed to in writing, software distributed under the License is distributed on an "AS IS" BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. See the License for the specific language governing permissions and limitations under the License. Licenses for support code ------------------------- Parts of the TLS test suite are under the Go license. This code is not included in BoringSSL (i.e. libcrypto and libssl) when compiled, however, so distributing code linked against BoringSSL does not trigger this license: Copyright (c) 2009 The Go Authors. All rights reserved. Redistribution and use in source and binary forms, with or without modification, are permitted provided that the following conditions are met: * Redistributions of source code must retain the above copyright notice, this list of conditions and the following disclaimer. * Redistributions in binary form must reproduce the above copyright notice, this list of conditions and the following disclaimer in the documentation and/or other materials provided with the distribution. * Neither the name of Google Inc. nor the names of its contributors may be used to endorse or promote products derived from this software without specific prior written permission. THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. BoringSSL uses the Chromium test infrastructure to run a continuous build, trybots etc. The scripts which manage this, and the script for generating build metadata, are under the Chromium license. Distributing code linked against BoringSSL does not trigger this license. Copyright 2015 The Chromium Authors. All rights reserved. Redistribution and use in source and binary forms, with or without modification, are permitted provided that the following conditions are met: * Redistributions of source code must retain the above copyright notice, this list of conditions and the following disclaimer. * Redistributions in binary form must reproduce the above copyright notice, this list of conditions and the following disclaimer in the documentation and/or other materials provided with the distribution. * Neither the name of Google Inc. nor the names of its contributors may be used to endorse or promote products derived from this software without specific prior written permission. THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. ------------------------------------------------------------------------------ [4.41] Shipped by 1 package: ring 0.17.14 (Apache-2.0 AND ISC) https://github.com/briansmith/ring Copyright 2015-2025 Brian Smith. Permission to use, copy, modify, and/or distribute this software for any purpose with or without fee is hereby granted, provided that the above copyright notice and this permission notice appear in all copies. THE SOFTWARE IS PROVIDED "AS IS" AND THE AUTHOR DISCLAIMS ALL WARRANTIES WITH REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY SPECIAL, DIRECT, INDIRECT, OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR PROFITS, WHETHER IN AN ACTION OF CONTRACT, NEGLIGENCE OR OTHER TORTIOUS ACTION, ARISING OUT OF OR IN CONNECTION WITH THE USE OR PERFORMANCE OF THIS SOFTWARE. ------------------------------------------------------------------------------ [4.42] Shipped by 1 package: rustls-native-certs 0.8.4 (Apache-2.0 OR ISC OR MIT) https://github.com/rustls/rustls-native-certs Rustls is distributed under the following three licenses: - Apache License version 2.0. - MIT license. - ISC license. These are included as LICENSE-APACHE, LICENSE-MIT and LICENSE-ISC respectively. You may use this software under the terms of any of these licenses, at your option. ------------------------------------------------------------------------------ [4.43] Shipped by 1 package: rustls-webpki 0.103.16 (ISC) https://github.com/rustls/webpki Except as otherwise noted, this project is licensed under the following (ISC-style) terms: Copyright 2015 Brian Smith. Permission to use, copy, modify, and/or distribute this software for any purpose with or without fee is hereby granted, provided that the above copyright notice and this permission notice appear in all copies. THE SOFTWARE IS PROVIDED "AS IS" AND THE AUTHORS DISCLAIM ALL WARRANTIES WITH REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS. IN NO EVENT SHALL THE AUTHORS BE LIABLE FOR ANY SPECIAL, DIRECT, INDIRECT, OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR PROFITS, WHETHER IN AN ACTION OF CONTRACT, NEGLIGENCE OR OTHER TORTIOUS ACTION, ARISING OUT OF OR IN CONNECTION WITH THE USE OR PERFORMANCE OF THIS SOFTWARE. The files under third-party/chromium are licensed as described in third-party/chromium/LICENSE. ------------------------------------------------------------------------------ [4.44] Shipped by 1 package: ryu 1.0.23 (Apache-2.0 OR BSL-1.0) https://github.com/dtolnay/ryu Boost Software License - Version 1.0 - August 17th, 2003 Permission is hereby granted, free of charge, to any person or organization obtaining a copy of the software and accompanying documentation covered by this license (the "Software") to use, reproduce, display, distribute, execute, and transmit the Software, and to prepare derivative works of the Software, and to permit third-parties to whom the Software is furnished to do so, all subject to the following: The copyright notices in the Software and this entire statement, including the above license grant, this restriction and the following disclaimer, must be included in all copies of the Software, in whole or in part, and all derivative works of the Software, unless such copies or derivative works are solely in the form of machine-executable object code generated by a source language processor. 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, TITLE AND NON-INFRINGEMENT. IN NO EVENT SHALL THE COPYRIGHT HOLDERS OR ANYONE DISTRIBUTING THE SOFTWARE BE LIABLE FOR ANY DAMAGES OR OTHER LIABILITY, WHETHER IN CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE. ------------------------------------------------------------------------------ [4.45] Shipped by 2 packages: shlex 1.3.0 (MIT OR Apache-2.0) https://github.com/comex/rust-shlex shlex 2.0.1 (MIT OR Apache-2.0) https://github.com/comex/rust-shlex Copyright 2015 Nicholas Allegra (comex). Licensed under the Apache License, Version 2.0 (the "License"); you may not use this file except in compliance with the License. You may obtain a copy of the License at http://www.apache.org/licenses/LICENSE-2.0 Unless required by applicable law or agreed to in writing, software distributed under the License is distributed on an "AS IS" BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. See the License for the specific language governing permissions and limitations under the License. ------------------------------------------------------------------------------ [4.46] Shipped by 1 package: siphasher 1.0.3 (MIT OR Apache-2.0) https://github.com/jedisct1/rust-siphash Copyright 2012-2016 The Rust Project Developers. Copyright 2016-2026 Frank Denis. Licensed under the Apache License, Version 2.0 or the MIT license , at your option. ------------------------------------------------------------------------------ [4.47] Shipped by 1 package: subtle 2.6.1 (BSD-3-Clause) https://github.com/dalek-cryptography/subtle Copyright (c) 2016-2017 Isis Agora Lovecruft, Henry de Valence. All rights reserved. Copyright (c) 2016-2024 Isis Agora Lovecruft. All rights reserved. Redistribution and use in source and binary forms, with or without modification, are permitted provided that the following conditions are met: 1. Redistributions of source code must retain the above copyright notice, this list of conditions and the following disclaimer. 2. Redistributions in binary form must reproduce the above copyright notice, this list of conditions and the following disclaimer in the documentation and/or other materials provided with the distribution. 3. Neither the name of the copyright holder nor the names of its contributors may be used to endorse or promote products derived from this software without specific prior written permission. THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. ------------------------------------------------------------------------------ [4.48] Shipped by 1 package: tao 0.35.3 (Apache-2.0) https://github.com/tauri-apps/tao SPDXVersion: SPDX-2.1 DataLicense: CC0-1.0 PackageName: tao DataFormat: SPDXRef-1 PackageSupplier: Organization: The Tauri Programme in the Commons Conservancy PackageHomePage: https://tauri.app PackageLicenseDeclared: Apache-2.0 PackageCopyrightText: 2021-2023, The Tauri Programme in the Commons Conservancy PackageSummary: Tao is the official, rust-based window manager for Wry. PackageComment: The package includes the following libraries; see Relationship information. Created: 2020-05-20T09:00:00Z PackageDownloadLocation: git://github.com/tauri-apps/tao PackageDownloadLocation: git+https://github.com/tauri-apps/tao.git PackageDownloadLocation: git+ssh://github.com/tauri-apps/tao.git Creator: Person: Daniel Thompson-Yvetot ------------------------------------------------------------------------------ [4.49] Shipped by 1 package: tao-macros 0.1.4 (MIT OR Apache-2.0) https://github.com/tauri-apps/tao SPDXVersion: SPDX-2.1 DataLicense: CC0-1.0 PackageName: tao-macros DataFormat: SPDXRef-1 PackageSupplier: Organization: The Tauri Programme in the Commons Conservancy PackageHomePage: https://tauri.app PackageLicenseDeclared: Apache-2.0 PackageLicenseDeclared: MIT PackageCopyrightText: 2020-2023, The Tauri Programme in the Commons Conservancy PackageSummary: tao-macros is part of Tao, the official, rust-based window manager for Wry. PackageComment: The package includes the following libraries; see Relationship information. Created: 2020-05-20T09:00:00Z PackageDownloadLocation: git://github.com/tauri-apps/tao PackageDownloadLocation: git+https://github.com/tauri-apps/tao.git PackageDownloadLocation: git+ssh://github.com/tauri-apps/tao.git Creator: Person: Daniel Thompson-Yvetot ------------------------------------------------------------------------------ [4.50] Shipped by 3 packages: tauri-plugin-dialog 2.7.3 (Apache-2.0 OR MIT) https://github.com/tauri-apps/plugins-workspace tauri-plugin-fs 2.5.2 (Apache-2.0 OR MIT) https://github.com/tauri-apps/plugins-workspace tauri-plugin-single-instance 2.4.5 (Apache-2.0 OR MIT) https://github.com/tauri-apps/plugins-workspace SPDXVersion: SPDX-2.1 DataLicense: CC0-1.0 PackageName: tauri DataFormat: SPDXRef-1 PackageSupplier: Organization: The Tauri Programme in the Commons Conservancy PackageHomePage: https://tauri.app PackageLicenseDeclared: Apache-2.0 PackageLicenseDeclared: MIT PackageCopyrightText: 2019-2022, The Tauri Programme in the Commons Conservancy PackageSummary: Tauri is a rust project that enables developers to make secure and small desktop applications using a web frontend. PackageComment: The package includes the following libraries; see Relationship information. Created: 2019-05-20T09:00:00Z PackageDownloadLocation: git://github.com/tauri-apps/tauri PackageDownloadLocation: git+https://github.com/tauri-apps/tauri.git PackageDownloadLocation: git+ssh://github.com/tauri-apps/tauri.git Creator: Person: Daniel Thompson-Yvetot ------------------------------------------------------------------------------ [4.51] Shipped by 1 package: tinyvec_macros 0.1.1 (MIT OR Apache-2.0 OR Zlib) https://github.com/Soveu/tinyvec_macros zlib License (C) 2020 Tomasz "Soveu" Marx This software is provided 'as-is', without any express or implied warranty. In no event will the authors be held liable for any damages arising from the use of this software. Permission is granted to anyone to use this software for any purpose, including commercial applications, and to alter it and redistribute it freely, subject to the following restrictions: 1. The origin of this software must not be misrepresented; you must not claim that you wrote the original software. If you use this software in a product, an acknowledgment in the product documentation would be appreciated but is not required. 2. Altered source versions must be plainly marked as such, and must not be misrepresented as being the original software. 3. This notice may not be removed or altered from any source distribution. ------------------------------------------------------------------------------ [4.52] Shipped by 1 package: tray-icon 0.24.2 (MIT OR Apache-2.0) https://github.com/tauri-apps/tray-icon SPDXVersion: SPDX-2.1 DataLicense: CC0-1.0 PackageName: tray-icon DataFormat: SPDXRef-1 PackageSupplier: Organization: The Tauri Programme in the Commons Conservancy PackageHomePage: https://tauri.app PackageLicenseDeclared: Apache-2.0 PackageLicenseDeclared: MIT PackageCopyrightText: 2020-2022, The Tauri Programme in the Commons Conservancy PackageSummary: Create tray icons for desktop applications. PackageComment: The package includes the following libraries; see Relationship information. Created: 2022-12-05T09:00:00Z PackageDownloadLocation: git://github.com/tauri-apps/tray-icon PackageDownloadLocation: git+https://github.com/tauri-apps/tray-icon.git PackageDownloadLocation: git+ssh://github.com/tauri-apps/tray-icon.git Creator: Person: Daniel Thompson-Yvetot ------------------------------------------------------------------------------ [4.53] Shipped by 1 package: uds_windows 1.2.1 (MIT) https://github.com/haraldh/rust_uds_windows MIT License Copyright (c) Microsoft Corporation. All rights reserved. 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 ------------------------------------------------------------------------------ [4.54] Shipped by 1 package: unicode-ident 1.0.24 ((MIT OR Apache-2.0) AND Unicode-3.0) https://github.com/dtolnay/unicode-ident UNICODE LICENSE V3 COPYRIGHT AND PERMISSION NOTICE Copyright © 1991-2023 Unicode, Inc. NOTICE TO USER: Carefully read the following legal agreement. BY DOWNLOADING, INSTALLING, COPYING OR OTHERWISE USING DATA FILES, AND/OR SOFTWARE, YOU UNEQUIVOCALLY ACCEPT, AND AGREE TO BE BOUND BY, ALL OF THE TERMS AND CONDITIONS OF THIS AGREEMENT. IF YOU DO NOT AGREE, DO NOT DOWNLOAD, INSTALL, COPY, DISTRIBUTE OR USE THE DATA FILES OR SOFTWARE. Permission is hereby granted, free of charge, to any person obtaining a copy of data files and any associated documentation (the "Data Files") or software and any associated documentation (the "Software") to deal in the Data Files or Software without restriction, including without limitation the rights to use, copy, modify, merge, publish, distribute, and/or sell copies of the Data Files or Software, and to permit persons to whom the Data Files or Software are furnished to do so, provided that either (a) this copyright and permission notice appear with all copies of the Data Files or Software, or (b) this copyright and permission notice appear in associated Documentation. THE DATA FILES AND SOFTWARE ARE 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 OF THIRD PARTY RIGHTS. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR HOLDERS INCLUDED IN THIS NOTICE BE LIABLE FOR ANY CLAIM, OR ANY SPECIAL INDIRECT OR CONSEQUENTIAL DAMAGES, OR ANY DAMAGES WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR PROFITS, WHETHER IN AN ACTION OF CONTRACT, NEGLIGENCE OR OTHER TORTIOUS ACTION, ARISING OUT OF OR IN CONNECTION WITH THE USE OR PERFORMANCE OF THE DATA FILES OR SOFTWARE. Except as contained in this notice, the name of a copyright holder shall not be used in advertising or otherwise to promote the sale, use or other dealings in these Data Files or Software without prior written authorization of the copyright holder. ------------------------------------------------------------------------------ [4.55] Shipped by 1 package: untrusted 0.9.0 (ISC) https://github.com/briansmith/untrusted // Copyright 2015-2016 Brian Smith. // // Permission to use, copy, modify, and/or distribute this software for any // purpose with or without fee is hereby granted, provided that the above // copyright notice and this permission notice appear in all copies. // // THE SOFTWARE IS PROVIDED "AS IS" AND THE AUTHORS DISCLAIM ALL WARRANTIES // WITH REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED WARRANTIES OF // MERCHANTABILITY AND FITNESS. IN NO EVENT SHALL THE AUTHORS BE LIABLE FOR // ANY SPECIAL, DIRECT, INDIRECT, OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES // WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR PROFITS, WHETHER IN AN // ACTION OF CONTRACT, NEGLIGENCE OR OTHER TORTIOUS ACTION, ARISING OUT OF // OR IN CONNECTION WITH THE USE OR PERFORMANCE OF THIS SOFTWARE. ------------------------------------------------------------------------------ [4.56] Shipped by 1 package: window-vibrancy 0.6.0 (Apache-2.0 OR MIT) https://github.com/tauri-apps/tauri-plugin-vibrancy SPDXVersion: SPDX-2.1 DataLicense: CC0-1.0 PackageName: window-vibrancy DataFormat: SPDXRef-1 PackageSupplier: Organization: The Tauri Programme in the Commons Conservancy PackageHomePage: https://tauri.app PackageLicenseDeclared: Apache-2.0 PackageLicenseDeclared: MIT PackageCopyrightText: 2020-2022, The Tauri Programme in the Commons Conservancy PackageSummary: Make your windows vibrant. PackageComment: The package includes the following libraries; see Relationship information. Created: 2020-05-20T09:00:00Z PackageDownloadLocation: git://github.com/tauri-apps/window-vibrancy PackageDownloadLocation: git+https://github.com/tauri-apps/window-vibrancy.git PackageDownloadLocation: git+ssh://github.com/tauri-apps/window-vibrancy.git Creator: Person: Daniel Thompson-Yvetot ------------------------------------------------------------------------------ [4.57] Shipped by 54 packages: windows 0.54.0 (MIT OR Apache-2.0) https://github.com/microsoft/windows-rs windows 0.56.0 (MIT OR Apache-2.0) https://github.com/microsoft/windows-rs windows 0.61.3 (MIT OR Apache-2.0) https://github.com/microsoft/windows-rs windows-collections 0.2.0 (MIT OR Apache-2.0) https://github.com/microsoft/windows-rs windows-core 0.54.0 (MIT OR Apache-2.0) https://github.com/microsoft/windows-rs windows-core 0.56.0 (MIT OR Apache-2.0) https://github.com/microsoft/windows-rs windows-core 0.61.2 (MIT OR Apache-2.0) https://github.com/microsoft/windows-rs windows-core 0.62.2 (MIT OR Apache-2.0) https://github.com/microsoft/windows-rs windows-future 0.2.1 (MIT OR Apache-2.0) https://github.com/microsoft/windows-rs windows-implement 0.56.0 (MIT OR Apache-2.0) https://github.com/microsoft/windows-rs windows-implement 0.60.2 (MIT OR Apache-2.0) https://github.com/microsoft/windows-rs windows-interface 0.56.0 (MIT OR Apache-2.0) https://github.com/microsoft/windows-rs windows-interface 0.59.3 (MIT OR Apache-2.0) https://github.com/microsoft/windows-rs windows-link 0.1.3 (MIT OR Apache-2.0) https://github.com/microsoft/windows-rs windows-link 0.2.1 (MIT OR Apache-2.0) https://github.com/microsoft/windows-rs windows-numerics 0.2.0 (MIT OR Apache-2.0) https://github.com/microsoft/windows-rs windows-result 0.1.2 (MIT OR Apache-2.0) https://github.com/microsoft/windows-rs windows-result 0.3.4 (MIT OR Apache-2.0) https://github.com/microsoft/windows-rs windows-result 0.4.1 (MIT OR Apache-2.0) https://github.com/microsoft/windows-rs windows-strings 0.4.2 (MIT OR Apache-2.0) https://github.com/microsoft/windows-rs windows-strings 0.5.1 (MIT OR Apache-2.0) https://github.com/microsoft/windows-rs windows-sys 0.45.0 (MIT OR Apache-2.0) https://github.com/microsoft/windows-rs windows-sys 0.52.0 (MIT OR Apache-2.0) https://github.com/microsoft/windows-rs windows-sys 0.59.0 (MIT OR Apache-2.0) https://github.com/microsoft/windows-rs windows-sys 0.60.2 (MIT OR Apache-2.0) https://github.com/microsoft/windows-rs windows-sys 0.61.2 (MIT OR Apache-2.0) https://github.com/microsoft/windows-rs windows-targets 0.42.2 (MIT OR Apache-2.0) https://github.com/microsoft/windows-rs windows-targets 0.52.6 (MIT OR Apache-2.0) https://github.com/microsoft/windows-rs windows-targets 0.53.5 (MIT OR Apache-2.0) https://github.com/microsoft/windows-rs windows-threading 0.1.0 (MIT OR Apache-2.0) https://github.com/microsoft/windows-rs windows-version 0.1.7 (MIT OR Apache-2.0) https://github.com/microsoft/windows-rs windows_aarch64_gnullvm 0.42.2 (MIT OR Apache-2.0) https://github.com/microsoft/windows-rs windows_aarch64_gnullvm 0.52.6 (MIT OR Apache-2.0) https://github.com/microsoft/windows-rs windows_aarch64_gnullvm 0.53.1 (MIT OR Apache-2.0) https://github.com/microsoft/windows-rs windows_aarch64_msvc 0.42.2 (MIT OR Apache-2.0) https://github.com/microsoft/windows-rs windows_aarch64_msvc 0.52.6 (MIT OR Apache-2.0) https://github.com/microsoft/windows-rs windows_aarch64_msvc 0.53.1 (MIT OR Apache-2.0) https://github.com/microsoft/windows-rs windows_i686_gnu 0.42.2 (MIT OR Apache-2.0) https://github.com/microsoft/windows-rs windows_i686_gnu 0.52.6 (MIT OR Apache-2.0) https://github.com/microsoft/windows-rs windows_i686_gnu 0.53.1 (MIT OR Apache-2.0) https://github.com/microsoft/windows-rs windows_i686_gnullvm 0.52.6 (MIT OR Apache-2.0) https://github.com/microsoft/windows-rs windows_i686_gnullvm 0.53.1 (MIT OR Apache-2.0) https://github.com/microsoft/windows-rs windows_i686_msvc 0.42.2 (MIT OR Apache-2.0) https://github.com/microsoft/windows-rs windows_i686_msvc 0.52.6 (MIT OR Apache-2.0) https://github.com/microsoft/windows-rs windows_i686_msvc 0.53.1 (MIT OR Apache-2.0) https://github.com/microsoft/windows-rs windows_x86_64_gnu 0.42.2 (MIT OR Apache-2.0) https://github.com/microsoft/windows-rs windows_x86_64_gnu 0.52.6 (MIT OR Apache-2.0) https://github.com/microsoft/windows-rs windows_x86_64_gnu 0.53.1 (MIT OR Apache-2.0) https://github.com/microsoft/windows-rs windows_x86_64_gnullvm 0.42.2 (MIT OR Apache-2.0) https://github.com/microsoft/windows-rs windows_x86_64_gnullvm 0.52.6 (MIT OR Apache-2.0) https://github.com/microsoft/windows-rs windows_x86_64_gnullvm 0.53.1 (MIT OR Apache-2.0) https://github.com/microsoft/windows-rs windows_x86_64_msvc 0.42.2 (MIT OR Apache-2.0) https://github.com/microsoft/windows-rs windows_x86_64_msvc 0.52.6 (MIT OR Apache-2.0) https://github.com/microsoft/windows-rs windows_x86_64_msvc 0.53.1 (MIT OR Apache-2.0) https://github.com/microsoft/windows-rs MIT License Copyright (c) Microsoft Corporation. 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 ------------------------------------------------------------------------------ [4.58] Shipped by 1 package: wry 0.55.1 (Apache-2.0 OR MIT) https://github.com/tauri-apps/wry SPDXVersion: SPDX-2.1 DataLicense: CC0-1.0 PackageName: wry DataFormat: SPDXRef-1 PackageSupplier: Organization: The Tauri Programme in the Commons Conservancy PackageHomePage: https://tauri.app PackageLicenseDeclared: Apache-2.0 PackageLicenseDeclared: MIT PackageCopyrightText: 2020-2023, The Tauri Programme in the Commons Conservancy PackageSummary: Wry is the official, rust-based webview windowing service for Tauri. PackageComment: The package includes the following libraries; see Relationship information. Created: 2020-05-20T09:00:00Z PackageDownloadLocation: git://github.com/tauri-apps/wry PackageDownloadLocation: git+https://github.com/tauri-apps/wry.git PackageDownloadLocation: git+ssh://github.com/tauri-apps/wry.git Creator: Person: Daniel Thompson-Yvetot ------------------------------------------------------------------------------ [4.59] Shipped by 2 packages: zerocopy 0.8.56 (BSD-2-Clause OR Apache-2.0 OR MIT) https://github.com/google/zerocopy zerocopy-derive 0.8.56 (BSD-2-Clause OR Apache-2.0 OR MIT) https://github.com/google/zerocopy Copyright 2019 The Fuchsia Authors. Redistribution and use in source and binary forms, with or without modification, are permitted provided that the following conditions are met: * Redistributions of source code must retain the above copyright notice, this list of conditions and the following disclaimer. * Redistributions in binary form must reproduce the above copyright notice, this list of conditions and the following disclaimer in the documentation and/or other materials provided with the distribution. THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. ------------------------------------------------------------------------------ ============================================================================== PART 5. NOTICE AND COPYRIGHT FILES, EXACTLY AS SHIPPED ============================================================================== [5.1] Shipped by 11 packages: atk 0.18.2 (MIT) https://github.com/gtk-rs/gtk3-rs cairo-rs 0.18.5 (MIT) https://github.com/gtk-rs/gtk-rs-core gdk 0.18.2 (MIT) https://github.com/gtk-rs/gtk3-rs gdk-pixbuf 0.18.5 (MIT) https://github.com/gtk-rs/gtk-rs-core gdkx11 0.18.2 (MIT) https://github.com/gtk-rs/gtk3-rs gio 0.18.4 (MIT) https://github.com/gtk-rs/gtk-rs-core glib 0.18.5 (MIT) https://github.com/gtk-rs/gtk-rs-core glib-macros 0.18.5 (MIT) https://github.com/gtk-rs/gtk-rs-core gtk 0.18.2 (MIT) https://github.com/gtk-rs/gtk3-rs gtk3-macros 0.18.2 (MIT) https://github.com/gtk-rs/gtk3-rs pango 0.18.3 (MIT) https://github.com/gtk-rs/gtk-rs-core The gtk-rs Project is licensed under the MIT license, see the LICENSE file or . Copyrights in the gtk-rs Project project are retained by their contributors. No copyright assignment is required to contribute to the gtk-rs Project project. For full authorship information, see the version control history. This project provides interoperability with various GNOME libraries but doesn't distribute any parts of them. Distributing compiled libraries and executables that link to those libraries may be subject to terms of the GNU LGPL or other licenses. For more information check the license of each GNOME library. ------------------------------------------------------------------------------ [5.2] Shipped by 1 package: cesu8 1.1.0 (Apache-2.0 OR MIT) https://github.com/emk/cesu8-rs Short version for non-lawyers: The Rust Project is dual-licensed under Apache 2.0 and MIT terms. Longer version: The Rust Project is copyright 2014, The Rust Project Developers (given in the file AUTHORS.txt). Licensed under the Apache License, Version 2.0 or the MIT license , at your option. All files in the project carrying such notice may not be copied, modified, or distributed except according to those terms. The Rust Project includes packages written by third parties. The following third party packages are included, and carry their own copyright notices and license terms: * Two header files that are part of the Valgrind package. These files are found at src/rt/vg/valgrind.h and src/rt/vg/memcheck.h, within this distribution. These files are redistributed under the following terms, as noted in them: for src/rt/vg/valgrind.h: This file is part of Valgrind, a dynamic binary instrumentation framework. Copyright (C) 2000-2010 Julian Seward. All rights reserved. Redistribution and use in source and binary forms, with or without modification, are permitted provided that the following conditions are met: 1. Redistributions of source code must retain the above copyright notice, this list of conditions and the following disclaimer. 2. The origin of this software must not be misrepresented; you must not claim that you wrote the original software. If you use this software in a product, an acknowledgment in the product documentation would be appreciated but is not required. 3. Altered source versions must be plainly marked as such, and must not be misrepresented as being the original software. 4. The name of the author may not be used to endorse or promote products derived from this software without specific prior written permission. THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. for src/rt/vg/memcheck.h: This file is part of MemCheck, a heavyweight Valgrind tool for detecting memory errors. Copyright (C) 2000-2010 Julian Seward. All rights reserved. Redistribution and use in source and binary forms, with or without modification, are permitted provided that the following conditions are met: 1. Redistributions of source code must retain the above copyright notice, this list of conditions and the following disclaimer. 2. The origin of this software must not be misrepresented; you must not claim that you wrote the original software. If you use this software in a product, an acknowledgment in the product documentation would be appreciated but is not required. 3. Altered source versions must be plainly marked as such, and must not be misrepresented as being the original software. 4. The name of the author may not be used to endorse or promote products derived from this software without specific prior written permission. THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. * The auxiliary file src/etc/pkg/modpath.iss contains a library routine compiled, by Inno Setup, into the Windows installer binary. This file is licensed under the LGPL, version 3, but, in our legal interpretation, this does not affect the aggregate "collected work" license of the Rust distribution (MIT/ASL2) nor any other components of it. We believe that the terms governing distribution of the binary Windows installer built from modpath.iss are therefore LGPL, but not the terms governing distribution of any of the files installed by such an installer (such as the Rust compiler or runtime libraries themselves). * The src/rt/miniz.c file, carrying an implementation of RFC1950/RFC1951 DEFLATE, by Rich Geldreich . All uses of this file are permitted by the embedded "unlicense" notice (effectively: public domain with warranty disclaimer). * LLVM. Code for this package is found in src/llvm. Copyright (c) 2003-2013 University of Illinois at Urbana-Champaign. All rights reserved. Developed by: LLVM Team University of Illinois at Urbana-Champaign http://llvm.org Permission is hereby granted, free of charge, to any person obtaining a copy of this software and associated documentation files (the "Software"), to deal with 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: * Redistributions of source code must retain the above copyright notice, this list of conditions and the following disclaimers. * Redistributions in binary form must reproduce the above copyright notice, this list of conditions and the following disclaimers in the documentation and/or other materials provided with the distribution. * Neither the names of the LLVM Team, University of Illinois at Urbana-Champaign, nor the names of its contributors may be used to endorse or promote products derived from this Software without specific prior written permission. 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 CONTRIBUTORS 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 WITH THE SOFTWARE. * Additional libraries included in LLVM carry separate BSD-compatible licenses. See src/llvm/LICENSE.txt for details. * compiler-rt, in src/compiler-rt is dual licensed under LLVM's license and MIT: Copyright (c) 2009-2014 by the contributors listed in CREDITS.TXT All rights reserved. Developed by: LLVM Team University of Illinois at Urbana-Champaign http://llvm.org Permission is hereby granted, free of charge, to any person obtaining a copy of this software and associated documentation files (the "Software"), to deal with 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: * Redistributions of source code must retain the above copyright notice, this list of conditions and the following disclaimers. * Redistributions in binary form must reproduce the above copyright notice, this list of conditions and the following disclaimers in the documentation and/or other materials provided with the distribution. * Neither the names of the LLVM Team, University of Illinois at Urbana-Champaign, nor the names of its contributors may be used to endorse or promote products derived from this Software without specific prior written permission. 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 CONTRIBUTORS 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 WITH THE SOFTWARE. ======================================================== Copyright (c) 2009-2014 by the contributors listed in CREDITS.TXT 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. * Portions of the FFI code for interacting with the native ABI is derived from the Clay programming language, which carries the following license. Copyright (C) 2008-2010 Tachyon Technologies. All rights reserved. Redistribution and use in source and binary forms, with or without modification, are permitted provided that the following conditions are met: 1. Redistributions of source code must retain the above copyright notice, this list of conditions and the following disclaimer. 2. Redistributions in binary form must reproduce the above copyright notice, this list of conditions and the following disclaimer in the documentation and/or other materials provided with the distribution. THIS SOFTWARE IS PROVIDED ``AS IS'' AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE DEVELOPERS AND CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. * Hoedown, the markdown parser, under src/rt/hoedown, is licensed as follows. Copyright (c) 2008, Natacha Porté Copyright (c) 2011, Vicent Martí Copyright (c) 2013, Devin Torres and the Hoedown authors Permission to use, copy, modify, and distribute this software for any purpose with or without fee is hereby granted, provided that the above copyright notice and this permission notice appear in all copies. THE SOFTWARE IS PROVIDED "AS IS" AND THE AUTHOR DISCLAIMS ALL WARRANTIES WITH REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY SPECIAL, DIRECT, INDIRECT, OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR PROFITS, WHETHER IN AN ACTION OF CONTRACT, NEGLIGENCE OR OTHER TORTIOUS ACTION, ARISING OUT OF OR IN CONNECTION WITH THE USE OR PERFORMANCE OF THIS SOFTWARE. * libbacktrace, under src/libbacktrace: Copyright (C) 2012-2014 Free Software Foundation, Inc. Written by Ian Lance Taylor, Google. Redistribution and use in source and binary forms, with or without modification, are permitted provided that the following conditions are met: (1) Redistributions of source code must retain the above copyright notice, this list of conditions and the following disclaimer. (2) Redistributions in binary form must reproduce the above copyright notice, this list of conditions and the following disclaimer in the documentation and/or other materials provided with the distribution. (3) The name of the author may not be used to endorse or promote products derived from this software without specific prior written permission. THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. */ * jemalloc, under src/jemalloc: Copyright (C) 2002-2014 Jason Evans . All rights reserved. Copyright (C) 2007-2012 Mozilla Foundation. All rights reserved. Copyright (C) 2009-2014 Facebook, Inc. All rights reserved. Redistribution and use in source and binary forms, with or without modification, are permitted provided that the following conditions are met: 1. Redistributions of source code must retain the above copyright notice(s), this list of conditions and the following disclaimer. 2. Redistributions in binary form must reproduce the above copyright notice(s), this list of conditions and the following disclaimer in the documentation and/or other materials provided with the distribution. THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDER(S) ``AS IS'' AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER(S) BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. * Additional copyright may be retained by contributors other than Mozilla, the Rust Project Developers, or the parties enumerated in this file. Such copyright can be determined on a case-by-case basis by examining the author of each portion of a file in the revision-control commit records of the project, or by consulting representative comments claiming copyright ownership for a file. For example, the text: "Copyright (c) 2011 Google Inc." appears in some files, and these files thereby denote that their author and copyright-holder is Google Inc. In all such cases, the absence of explicit licensing text indicates that the contributor chose to license their work for distribution under identical terms to those Mozilla has chosen for the collective work, enumerated at the top of this file. The only difference is the retention of copyright itself, held by the contributor. ------------------------------------------------------------------------------ [5.3] Shipped by 1 package: cfg_aliases 0.2.2 (MIT) https://github.com/katharostech/cfg_aliases # 3rd Party Notices The `cfg_aliases!` macro uses a lot of the code from [`tectonic_cfg_support::target_cfg!`] macro which is under the following license: [`tectonic_cfg_support::target_cfg!`]: https://github.com/tectonic-typesetting/tectonic/blob/f2439b936470ad27bdf92882064bc4702ee01899/cfg_support/src/lib.rs#L166 tectonic_cfg_support is licensed under the MIT License. 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. --- ------------------------------------------------------------------------------ [5.4] Shipped by 3 packages: core-graphics 0.25.0 (MIT OR Apache-2.0) https://github.com/servo/core-foundation-rs unicode-segmentation 1.13.3 (MIT OR Apache-2.0) https://github.com/unicode-rs/unicode-segmentation unicode-width 0.2.2 (MIT OR Apache-2.0) https://github.com/unicode-rs/unicode-width Licensed under the Apache License, Version 2.0 or the MIT license , at your option. All files in the project carrying such notice may not be copied, modified, or distributed except according to those terms. ------------------------------------------------------------------------------ [5.5] Shipped by 1 package: encoding_rs 0.8.35 ((Apache-2.0 OR MIT) AND BSD-3-Clause) https://github.com/hsivonen/encoding_rs encoding_rs is copyright Mozilla Foundation. Licensed under the Apache License, Version 2.0 or the MIT license , at your option. All files in the project carrying such notice may not be copied, modified, or distributed except according to those terms. This crate includes data derived from the data files supplied with the WHATWG Encoding Standard, which, when incorporated into source code, are licensed under the BSD 3-Clause License . Test code within encoding_rs is dedicated to the Public Domain when so designated (see the individual files for PD/CC0-dedicated sections). ------------------------------------------------------------------------------ [5.6] Shipped by 2 packages: libwebrtc 0.3.45 (Apache-2.0) https://github.com/livekit/rust-sdks a copy modified for Back2Back, kept in rust-application/vendor-libwebrtc livekit 0.8.3 (Apache-2.0) https://github.com/livekit/rust-sdks a copy modified for Back2Back, kept in rust-application/vendor-livekit Copyright 2023 LiveKit, Inc. Licensed under the Apache License, Version 2.0 (the "License"); you may not use this file except in compliance with the License. You may obtain a copy of the License at http://www.apache.org/licenses/LICENSE-2.0 Unless required by applicable law or agreed to in writing, software distributed under the License is distributed on an "AS IS" BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. See the License for the specific language governing permissions and limitations under the License. ------------------------------------------------------------------------------ [5.7] Shipped by 1 package: linux-raw-sys 0.12.1 (Apache-2.0 WITH LLVM-exception OR Apache-2.0 OR MIT) https://github.com/sunfishcode/linux-raw-sys Short version for non-lawyers: `linux-raw-sys` is triple-licensed under Apache 2.0 with the LLVM Exception, Apache 2.0, and MIT terms. Longer version: Copyrights in the `linux-raw-sys` project are retained by their contributors. No copyright assignment is required to contribute to the `linux-raw-sys` project. Some files include code derived from Rust's `libstd`; see the comments in the code for details. Except as otherwise noted (below and/or in individual files), `linux-raw-sys` is licensed under: - the Apache License, Version 2.0, with the LLVM Exception or - the Apache License, Version 2.0 or , - or the MIT license or , at your option. ------------------------------------------------------------------------------ [5.8] Shipped by 8 packages: rand 0.10.2 (MIT OR Apache-2.0) https://github.com/rust-random/rand rand 0.9.5 (MIT OR Apache-2.0) https://github.com/rust-random/rand rand_chacha 0.9.0 (MIT OR Apache-2.0) https://github.com/rust-random/rand rand_core 0.3.1 (MIT OR Apache-2.0) https://github.com/rust-random/rand rand_core 0.4.2 (MIT OR Apache-2.0) https://github.com/rust-random/rand rand_core 0.6.4 (MIT OR Apache-2.0) https://github.com/rust-random/rand rand_core 0.9.5 (MIT OR Apache-2.0) https://github.com/rust-random/rand rand_pcg 0.10.2 (MIT OR Apache-2.0) https://github.com/rust-random/rngs Copyrights in the Rand project are retained by their contributors. No copyright assignment is required to contribute to the Rand project. For full authorship information, see the version control history. Except as otherwise noted (below and/or in individual files), Rand is licensed under the Apache License, Version 2.0 or or the MIT license or , at your option. The Rand project includes code from the Rust project published under these same licenses. ------------------------------------------------------------------------------ [5.9] Shipped by 1 package: rand_core 0.10.1 (MIT OR Apache-2.0) https://github.com/rust-random/rand_core Copyrights in the Rand project are retained by their contributors. No copyright assignment is required to contribute to the Rand project. For full authorship information, see the version control history. Except as otherwise noted (below and/or in individual files), Rand is licensed under the Apache License, Version 2.0 or or the MIT license or , at your option. ------------------------------------------------------------------------------ [5.10] Shipped by 1 package: rustix 1.1.4 (Apache-2.0 WITH LLVM-exception OR Apache-2.0 OR MIT) https://github.com/bytecodealliance/rustix Short version for non-lawyers: `rustix` is triple-licensed under Apache 2.0 with the LLVM Exception, Apache 2.0, and MIT terms. Longer version: Copyrights in the `rustix` project are retained by their contributors. No copyright assignment is required to contribute to the `rustix` project. Some files include code derived from Rust's `libstd`; see the comments in the code for details. Except as otherwise noted (below and/or in individual files), `rustix` is licensed under: - the Apache License, Version 2.0, with the LLVM Exception or - the Apache License, Version 2.0 or , - or the MIT license or , at your option. ------------------------------------------------------------------------------ [5.11] Shipped by 1 package: uds_windows 1.2.1 (MIT) https://github.com/haraldh/rust_uds_windows Third Party Notices *** rust Copyright 2016 The Rust Project Developers 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. *** mio Copyright (c) 2014 Carl Lerche and other MIO contributors 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. *** miow Copyright (c) 2014 Alex Crichton 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. ------------------------------------------------------------------------------ [5.12] Shipped by 1 package: utf16_iter 1.0.5 (Apache-2.0 OR MIT) https://github.com/hsivonen/utf16_iter Copyright Mozilla Foundation Licensed under the Apache License (Version 2.0), or the MIT license, (the "Licenses") at your option. You may not use this file except in compliance with one of the Licenses. You may obtain copies of the Licenses at: https://www.apache.org/licenses/LICENSE-2.0 https://opensource.org/licenses/MIT Unless required by applicable law or agreed to in writing, software distributed under the Licenses is distributed on an "AS IS" BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. See the Licenses for the specific language governing permissions and limitations under the Licenses. -- Test code is dedicated to the Public Domain when so designated (see the individual files for PD/CC0-dedicated sections). -- The implementation for Utf16CharIndices was adapted from the CharIndices implementation of the Rust standard library at revision ab32548539ec38a939c1b58599249f3b54130026 (https://github.com/rust-lang/rust/blob/ab32548539ec38a939c1b58599249f3b54130026/library/core/src/str/iter.rs). Excerpt from https://github.com/rust-lang/rust/blob/ab32548539ec38a939c1b58599249f3b54130026/COPYRIGHT , which refers to https://github.com/rust-lang/rust/blob/ab32548539ec38a939c1b58599249f3b54130026/LICENSE-APACHE and https://github.com/rust-lang/rust/blob/ab32548539ec38a939c1b58599249f3b54130026/LICENSE-MIT : For full authorship information, see the version control history or https://thanks.rust-lang.org Except as otherwise noted (below and/or in individual files), Rust is licensed under the Apache License, Version 2.0 or or the MIT license or , at your option. ------------------------------------------------------------------------------ [5.13] Shipped by 1 package: utf8_iter 1.0.4 (Apache-2.0 OR MIT) https://github.com/hsivonen/utf8_iter Copyright Mozilla Foundation Licensed under the Apache License (Version 2.0), or the MIT license, (the "Licenses") at your option. You may not use this file except in compliance with one of the Licenses. You may obtain copies of the Licenses at: https://www.apache.org/licenses/LICENSE-2.0 https://opensource.org/licenses/MIT Unless required by applicable law or agreed to in writing, software distributed under the Licenses is distributed on an "AS IS" BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. See the Licenses for the specific language governing permissions and limitations under the Licenses. -- Test code is dedicated to the Public Domain when so designated (see the individual files for PD/CC0-dedicated sections). -- The implementation for Utf8CharIndices was adapted from the CharIndices implementation of the Rust standard library at revision ab32548539ec38a939c1b58599249f3b54130026 (https://github.com/rust-lang/rust/blob/ab32548539ec38a939c1b58599249f3b54130026/library/core/src/str/iter.rs). Excerpt from https://github.com/rust-lang/rust/blob/ab32548539ec38a939c1b58599249f3b54130026/COPYRIGHT , which refers to https://github.com/rust-lang/rust/blob/ab32548539ec38a939c1b58599249f3b54130026/LICENSE-APACHE and https://github.com/rust-lang/rust/blob/ab32548539ec38a939c1b58599249f3b54130026/LICENSE-MIT : For full authorship information, see the version control history or https://thanks.rust-lang.org Except as otherwise noted (below and/or in individual files), Rust is licensed under the Apache License, Version 2.0 or or the MIT license or , at your option. ------------------------------------------------------------------------------ [5.14] Shipped by 1 package: webrtc-sys 0.3.42 (Apache-2.0) https://github.com/livekit/rust-sdks ## webrtc patches APACHE 2.0 License License of some patches we use to build webrtc ``` Copyright 2019-2022, Wandbox LLC (Original Author) Copyright 2019-2022, tnoho (Original Author) Copyright 2019-2022, Shiguredo Inc. Licensed under the Apache License, Version 2.0 (the "License"); you may not use this file except in compliance with the License. You may obtain a copy of the License at http://www.apache.org/licenses/LICENSE-2.0 Unless required by applicable law or agreed to in writing, software distributed under the License is distributed on an "AS IS" BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. See the License for the specific language governing permissions and limitations under the License. ``` ## littlebearlabs/arcas-io MIT License The build system and the bindings are inspired by arcas-io (https://github.com/arcas-io) ``` MIT License Copyright (c) 2022 arcas-io 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. Footer ``` ## Shiguredo Apache 2.0 License The Android build system is inspired by Shiguredo sora-cpp-sdk. ``` Sora C++ SDK Copyright 2021-2022, Wandbox LLC (Original Author) Copyright 2021-2022, Shiguredo Inc. Apache License Version 2.0, January 2004 http://www.apache.org/licenses/ TERMS AND CONDITIONS FOR USE, REPRODUCTION, AND DISTRIBUTION 1. Definitions. "License" shall mean the terms and conditions for use, reproduction, and distribution as defined by Sections 1 through 9 of this document. "Licensor" shall mean the copyright owner or entity authorized by the copyright owner that is granting the License. "Legal Entity" shall mean the union of the acting entity and all other entities that control, are controlled by, or are under common control with that entity. For the purposes of this definition, "control" means (i) the power, direct or indirect, to cause the direction or management of such entity, whether by contract or otherwise, or (ii) ownership of fifty percent (50%) or more of the outstanding shares, or (iii) beneficial ownership of such entity. "You" (or "Your") shall mean an individual or Legal Entity exercising permissions granted by this License. "Source" form shall mean the preferred form for making modifications, including but not limited to software source code, documentation source, and configuration files. "Object" form shall mean any form resulting from mechanical transformation or translation of a Source form, including but not limited to compiled object code, generated documentation, and conversions to other media types. "Work" shall mean the work of authorship, whether in Source or Object form, made available under the License, as indicated by a copyright notice that is included in or attached to the work (an example is provided in the Appendix below). "Derivative Works" shall mean any work, whether in Source or Object form, that is based on (or derived from) the Work and for which the editorial revisions, annotations, elaborations, or other modifications represent, as a whole, an original work of authorship. For the purposes of this License, Derivative Works shall not include works that remain separable from, or merely link (or bind by name) to the interfaces of, the Work and Derivative Works thereof. "Contribution" shall mean any work of authorship, including the original version of the Work and any modifications or additions to that Work or Derivative Works thereof, that is intentionally submitted to Licensor for inclusion in the Work by the copyright owner or by an individual or Legal Entity authorized to submit on behalf of the copyright owner. For the purposes of this definition, "submitted" means any form of electronic, verbal, or written communication sent to the Licensor or its representatives, including but not limited to communication on electronic mailing lists, source code control systems, and issue tracking systems that are managed by, or on behalf of, the Licensor for the purpose of discussing and improving the Work, but excluding communication that is conspicuously marked or otherwise designated in writing by the copyright owner as "Not a Contribution." "Contributor" shall mean Licensor and any individual or Legal Entity on behalf of whom a Contribution has been received by Licensor and subsequently incorporated within the Work. 2. Grant of Copyright License. Subject to the terms and conditions of this License, each Contributor hereby grants to You a perpetual, worldwide, non-exclusive, no-charge, royalty-free, irrevocable copyright license to reproduce, prepare Derivative Works of, publicly display, publicly perform, sublicense, and distribute the Work and such Derivative Works in Source or Object form. 3. Grant of Patent License. Subject to the terms and conditions of this License, each Contributor hereby grants to You a perpetual, worldwide, non-exclusive, no-charge, royalty-free, irrevocable (except as stated in this section) patent license to make, have made, use, offer to sell, sell, import, and otherwise transfer the Work, where such license applies only to those patent claims licensable by such Contributor that are necessarily infringed by their Contribution(s) alone or by combination of their Contribution(s) with the Work to which such Contribution(s) was submitted. If You institute patent litigation against any entity (including a cross-claim or counterclaim in a lawsuit) alleging that the Work or a Contribution incorporated within the Work constitutes direct or contributory patent infringement, then any patent licenses granted to You under this License for that Work shall terminate as of the date such litigation is filed. 4. Redistribution. You may reproduce and distribute copies of the Work or Derivative Works thereof in any medium, with or without modifications, and in Source or Object form, provided that You meet the following conditions: (a) You must give any other recipients of the Work or Derivative Works a copy of this License; and (b) You must cause any modified files to carry prominent notices stating that You changed the files; and (c) You must retain, in the Source form of any Derivative Works that You distribute, all copyright, patent, trademark, and attribution notices from the Source form of the Work, excluding those notices that do not pertain to any part of the Derivative Works; and (d) If the Work includes a "NOTICE" text file as part of its distribution, then any Derivative Works that You distribute must include a readable copy of the attribution notices contained within such NOTICE file, excluding those notices that do not pertain to any part of the Derivative Works, in at least one of the following places: within a NOTICE text file distributed as part of the Derivative Works; within the Source form or documentation, if provided along with the Derivative Works; or, within a display generated by the Derivative Works, if and wherever such third-party notices normally appear. The contents of the NOTICE file are for informational purposes only and do not modify the License. You may add Your own attribution notices within Derivative Works that You distribute, alongside or as an addendum to the NOTICE text from the Work, provided that such additional attribution notices cannot be construed as modifying the License. You may add Your own copyright statement to Your modifications and may provide additional or different license terms and conditions for use, reproduction, or distribution of Your modifications, or for any such Derivative Works as a whole, provided Your use, reproduction, and distribution of the Work otherwise complies with the conditions stated in this License. 5. Submission of Contributions. Unless You explicitly state otherwise, any Contribution intentionally submitted for inclusion in the Work by You to the Licensor shall be under the terms and conditions of this License, without any additional terms or conditions. Notwithstanding the above, nothing herein shall supersede or modify the terms of any separate license agreement you may have executed with Licensor regarding such Contributions. 6. Trademarks. This License does not grant permission to use the trade names, trademarks, service marks, or product names of the Licensor, except as required for reasonable and customary use in describing the origin of the Work and reproducing the content of the NOTICE file. 7. Disclaimer of Warranty. Unless required by applicable law or agreed to in writing, Licensor provides the Work (and each Contributor provides its Contributions) on an "AS IS" BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied, including, without limitation, any warranties or conditions of TITLE, NON-INFRINGEMENT, MERCHANTABILITY, or FITNESS FOR A PARTICULAR PURPOSE. You are solely responsible for determining the appropriateness of using or redistributing the Work and assume any risks associated with Your exercise of permissions under this License. 8. Limitation of Liability. In no event and under no legal theory, whether in tort (including negligence), contract, or otherwise, unless required by applicable law (such as deliberate and grossly negligent acts) or agreed to in writing, shall any Contributor be liable to You for damages, including any direct, indirect, special, incidental, or consequential damages of any character arising as a result of this License or out of the use or inability to use the Work (including but not limited to damages for loss of goodwill, work stoppage, computer failure or malfunction, or any and all other commercial damages or losses), even if such Contributor has been advised of the possibility of such damages. 9. Accepting Warranty or Additional Liability. While redistributing the Work or Derivative Works thereof, You may choose to offer, and charge a fee for, acceptance of support, warranty, indemnity, or other liability obligations and/or rights consistent with this License. However, in accepting such obligations, You may act only on Your own behalf and on Your sole responsibility, not on behalf of any other Contributor, and only if You agree to indemnify, defend, and hold each Contributor harmless for any liability incurred by, or claims asserted against, such Contributor by reason of your accepting any such warranty or additional liability. END OF TERMS AND CONDITIONS ``` ## webrtc build scripts APACHE 2.0 License The webrtc builds scripts are inspired by Unity-Technologies com.unity.webrtc ``` com.unity.webrtc copyright © 2022 Unity Technologies ApS Licensed under the Apache License, Version 2.0 (the "License"); you may not use this file except in compliance with the License. You may obtain a copy of the License at http://www.apache.org/licenses/LICENSE-2.0 Unless required by applicable law or agreed to in writing, software distributed under the License is distributed on an "AS IS" BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. See the License for the specific language governing permissions and limitations under the License. --- Apache License Version 2.0, January 2004 http://www.apache.org/licenses/ TERMS AND CONDITIONS FOR USE, REPRODUCTION, AND DISTRIBUTION 1. Definitions. "License" shall mean the terms and conditions for use, reproduction, and distribution as defined by Sections 1 through 9 of this document. "Licensor" shall mean the copyright owner or entity authorized by the copyright owner that is granting the License. "Legal Entity" shall mean the union of the acting entity and all other entities that control, are controlled by, or are under common control with that entity. For the purposes of this definition, "control" means (i) the power, direct or indirect, to cause the direction or management of such entity, whether by contract or otherwise, or (ii) ownership of fifty percent (50%) or more of the outstanding shares, or (iii) beneficial ownership of such entity. "You" (or "Your") shall mean an individual or Legal Entity exercising permissions granted by this License. "Source" form shall mean the preferred form for making modifications, including but not limited to software source code, documentation source, and configuration files. "Object" form shall mean any form resulting from mechanical transformation or translation of a Source form, including but not limited to compiled object code, generated documentation, and conversions to other media types. "Work" shall mean the work of authorship, whether in Source or Object form, made available under the License, as indicated by a copyright notice that is included in or attached to the work (an example is provided in the Appendix below). "Derivative Works" shall mean any work, whether in Source or Object form, that is based on (or derived from) the Work and for which the editorial revisions, annotations, elaborations, or other modifications represent, as a whole, an original work of authorship. For the purposes of this License, Derivative Works shall not include works that remain separable from, or merely link (or bind by name) to the interfaces of, the Work and Derivative Works thereof. "Contribution" shall mean any work of authorship, including the original version of the Work and any modifications or additions to that Work or Derivative Works thereof, that is intentionally submitted to Licensor for inclusion in the Work by the copyright owner or by an individual or Legal Entity authorized to submit on behalf of the copyright owner. For the purposes of this definition, "submitted" means any form of electronic, verbal, or written communication sent to the Licensor or its representatives, including but not limited to communication on electronic mailing lists, source code control systems, and issue tracking systems that are managed by, or on behalf of, the Licensor for the purpose of discussing and improving the Work, but excluding communication that is conspicuously marked or otherwise designated in writing by the copyright owner as "Not a Contribution." "Contributor" shall mean Licensor and any individual or Legal Entity on behalf of whom a Contribution has been received by Licensor and subsequently incorporated within the Work. 2. Grant of Copyright License. Subject to the terms and conditions of this License, each Contributor hereby grants to You a perpetual, worldwide, non-exclusive, no-charge, royalty-free, irrevocable copyright license to reproduce, prepare Derivative Works of, publicly display, publicly perform, sublicense, and distribute the Work and such Derivative Works in Source or Object form. 3. Grant of Patent License. Subject to the terms and conditions of this License, each Contributor hereby grants to You a perpetual, worldwide, non-exclusive, no-charge, royalty-free, irrevocable (except as stated in this section) patent license to make, have made, use, offer to sell, sell, import, and otherwise transfer the Work, where such license applies only to those patent claims licensable by such Contributor that are necessarily infringed by their Contribution(s) alone or by combination of their Contribution(s) with the Work to which such Contribution(s) was submitted. If You institute patent litigation against any entity (including a cross-claim or counterclaim in a lawsuit) alleging that the Work or a Contribution incorporated within the Work constitutes direct or contributory patent infringement, then any patent licenses granted to You under this License for that Work shall terminate as of the date such litigation is filed. 4. Redistribution. You may reproduce and distribute copies of the Work or Derivative Works thereof in any medium, with or without modifications, and in Source or Object form, provided that You meet the following conditions: (a) You must give any other recipients of the Work or Derivative Works a copy of this License; and (b) You must cause any modified files to carry prominent notices stating that You changed the files; and (c) You must retain, in the Source form of any Derivative Works that You distribute, all copyright, patent, trademark, and attribution notices from the Source form of the Work, excluding those notices that do not pertain to any part of the Derivative Works; and (d) If the Work includes a "NOTICE" text file as part of its distribution, then any Derivative Works that You distribute must include a readable copy of the attribution notices contained within such NOTICE file, excluding those notices that do not pertain to any part of the Derivative Works, in at least one of the following places: within a NOTICE text file distributed as part of the Derivative Works; within the Source form or documentation, if provided along with the Derivative Works; or, within a display generated by the Derivative Works, if and wherever such third-party notices normally appear. The contents of the NOTICE file are for informational purposes only and do not modify the License. You may add Your own attribution notices within Derivative Works that You distribute, alongside or as an addendum to the NOTICE text from the Work, provided that such additional attribution notices cannot be construed as modifying the License. You may add Your own copyright statement to Your modifications and may provide additional or different license terms and conditions for use, reproduction, or distribution of Your modifications, or for any such Derivative Works as a whole, provided Your use, reproduction, and distribution of the Work otherwise complies with the conditions stated in this License. 5. Submission of Contributions. Unless You explicitly state otherwise, any Contribution intentionally submitted for inclusion in the Work by You to the Licensor shall be under the terms and conditions of this License, without any additional terms or conditions. Notwithstanding the above, nothing herein shall supersede or modify the terms of any separate license agreement you may have executed with Licensor regarding such Contributions. 6. Trademarks. This License does not grant permission to use the trade names, trademarks, service marks, or product names of the Licensor, except as required for reasonable and customary use in describing the origin of the Work and reproducing the content of the NOTICE file. 7. Disclaimer of Warranty. Unless required by applicable law or agreed to in writing, Licensor provides the Work (and each Contributor provides its Contributions) on an "AS IS" BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied, including, without limitation, any warranties or conditions of TITLE, NON-INFRINGEMENT, MERCHANTABILITY, or FITNESS FOR A PARTICULAR PURPOSE. You are solely responsible for determining the appropriateness of using or redistributing the Work and assume any risks associated with Your exercise of permissions under this License. 8. Limitation of Liability. In no event and under no legal theory, whether in tort (including negligence), contract, or otherwise, unless required by applicable law (such as deliberate and grossly negligent acts) or agreed to in writing, shall any Contributor be liable to You for damages, including any direct, indirect, special, incidental, or consequential damages of any character arising as a result of this License or out of the use or inability to use the Work (including but not limited to damages for loss of goodwill, work stoppage, computer failure or malfunction, or any and all other commercial damages or losses), even if such Contributor has been advised of the possibility of such damages. 9. Accepting Warranty or Additional Liability. While redistributing the Work or Derivative Works thereof, You may choose to offer, and charge a fee for, acceptance of support, warranty, indemnity, or other liability obligations and/or rights consistent with this License. However, in accepting such obligations, You may act only on Your own behalf and on Your sole responsibility, not on behalf of any other Contributor, and only if You agree to indemnify, defend, and hold each Contributor harmless for any liability incurred by, or claims asserted against, such Contributor by reason of your accepting any such warranty or additional liability. END OF TERMS AND CONDITIONS ``` ------------------------------------------------------------------------------ [5.15] Shipped by 1 package: write16 1.0.0 (Apache-2.0 OR MIT) https://github.com/hsivonen/write16 Copyright Mozilla Foundation Licensed under the Apache License (Version 2.0), or the MIT license, (the "Licenses") at your option. You may not use this file except in compliance with one of the Licenses. You may obtain copies of the Licenses at: https://www.apache.org/licenses/LICENSE-2.0 https://opensource.org/licenses/MIT Unless required by applicable law or agreed to in writing, software distributed under the Licenses is distributed on an "AS IS" BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. See the Licenses for the specific language governing permissions and limitations under the Licenses. -- Test code is dedicated to the Public Domain when so designated (see the individual files for PD/CC0-dedicated sections). ------------------------------------------------------------------------------ ============================================================================== PART 6. PACKAGES THAT SHIP NO COPY OF THE LICENCE THEY DECLARE ============================================================================== Each is listed under the standard text of the licence its Cargo.toml declares, with its authors. Those under MIT or the Apache License 2.0 are listed in Part 2 or 3, where that text is printed. [6.1] Declared BSD-3-Clause: alloc-stdlib 0.2.4 (BSD-3-Clause) https://github.com/dropbox/rust-alloc-no-stdlib authors: Daniel Reiter Horn BSD 3-Clause License Redistribution and use in source and binary forms, with or without modification, are permitted provided that the following conditions are met: 1. Redistributions of source code must retain the above copyright notice, this list of conditions and the following disclaimer. 2. Redistributions in binary form must reproduce the above copyright notice, this list of conditions and the following disclaimer in the documentation and/or other materials provided with the distribution. 3. Neither the name of the copyright holder nor the names of its contributors may be used to endorse or promote products derived from this software without specific prior written permission. THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. ------------------------------------------------------------------------------ [6.2] Declared ISC: untrusted 0.9.0 (ISC) https://github.com/briansmith/untrusted authors: Brian Smith Permission to use, copy, modify, and/or distribute this software for any purpose with or without fee is hereby granted, provided that the above copyright notice and this permission notice appear in all copies. THE SOFTWARE IS PROVIDED "AS IS" AND THE AUTHOR DISCLAIMS ALL WARRANTIES WITH REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY SPECIAL, DIRECT, INDIRECT, OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR PROFITS, WHETHER IN AN ACTION OF CONTRACT, NEGLIGENCE OR OTHER TORTIOUS ACTION, ARISING OUT OF OR IN CONNECTION WITH THE USE OR PERFORMANCE OF THIS SOFTWARE. ------------------------------------------------------------------------------ [6.3] Declared MPL-2.0: selectors 0.36.1 (MPL-2.0) https://github.com/servo/stylo authors: The Servo Project Developers symphonia 0.5.5 (MPL-2.0) https://github.com/pdeljanov/Symphonia authors: Philip Deljanov symphonia-bundle-flac 0.5.5 (MPL-2.0) https://github.com/pdeljanov/Symphonia authors: Philip Deljanov symphonia-bundle-mp3 0.5.5 (MPL-2.0) https://github.com/pdeljanov/Symphonia a copy modified for Back2Back, kept in rust-application/vendor-symphonia-bundle-mp3 authors: Philip Deljanov symphonia-codec-aac 0.5.5 (MPL-2.0) https://github.com/pdeljanov/Symphonia a copy modified for Back2Back, kept in rust-application/vendor-symphonia-codec-aac authors: Philip Deljanov, Kostya Shishkov symphonia-codec-adpcm 0.5.5 (MPL-2.0) https://github.com/pdeljanov/Symphonia authors: Philip Deljanov, Johannes Hackel symphonia-codec-alac 0.5.5 (MPL-2.0) https://github.com/pdeljanov/Symphonia authors: Philip Deljanov symphonia-codec-pcm 0.5.5 (MPL-2.0) https://github.com/pdeljanov/Symphonia authors: Philip Deljanov symphonia-codec-vorbis 0.5.5 (MPL-2.0) https://github.com/pdeljanov/Symphonia authors: Philip Deljanov symphonia-core 0.5.5 (MPL-2.0) https://github.com/pdeljanov/Symphonia a copy modified for Back2Back, kept in rust-application/vendor-symphonia-core authors: Philip Deljanov symphonia-format-isomp4 0.5.5 (MPL-2.0) https://github.com/pdeljanov/Symphonia authors: Philip Deljanov symphonia-format-mkv 0.5.5 (MPL-2.0) https://github.com/pdeljanov/Symphonia authors: Dariusz Niedoba symphonia-format-ogg 0.5.5 (MPL-2.0) https://github.com/pdeljanov/Symphonia authors: Philip Deljanov symphonia-format-riff 0.5.5 (MPL-2.0) https://github.com/pdeljanov/Symphonia authors: Philip Deljanov, dedobbin symphonia-metadata 0.5.5 (MPL-2.0) https://github.com/pdeljanov/Symphonia authors: Philip Deljanov symphonia-utils-xiph 0.5.5 (MPL-2.0) https://github.com/pdeljanov/Symphonia authors: Philip Deljanov Mozilla Public License Version 2.0 ================================== 1. Definitions -------------- 1.1. "Contributor" means each individual or legal entity that creates, contributes to the creation of, or owns Covered Software. 1.2. "Contributor Version" means the combination of the Contributions of others (if any) used by a Contributor and that particular Contributor's Contribution. 1.3. "Contribution" means Covered Software of a particular Contributor. 1.4. "Covered Software" means Source Code Form to which the initial Contributor has attached the notice in Exhibit A, the Executable Form of such Source Code Form, and Modifications of such Source Code Form, in each case including portions thereof. 1.5. "Incompatible With Secondary Licenses" means (a) that the initial Contributor has attached the notice described in Exhibit B to the Covered Software; or (b) that the Covered Software was made available under the terms of version 1.1 or earlier of the License, but not also under the terms of a Secondary License. 1.6. "Executable Form" means any form of the work other than Source Code Form. 1.7. "Larger Work" means a work that combines Covered Software with other material, in a separate file or files, that is not Covered Software. 1.8. "License" means this document. 1.9. "Licensable" means having the right to grant, to the maximum extent possible, whether at the time of the initial grant or subsequently, any and all of the rights conveyed by this License. 1.10. "Modifications" means any of the following: (a) any file in Source Code Form that results from an addition to, deletion from, or modification of the contents of Covered Software; or (b) any new file in Source Code Form that contains any Covered Software. 1.11. "Patent Claims" of a Contributor means any patent claim(s), including without limitation, method, process, and apparatus claims, in any patent Licensable by such Contributor that would be infringed, but for the grant of the License, by the making, using, selling, offering for sale, having made, import, or transfer of either its Contributions or its Contributor Version. 1.12. "Secondary License" means either the GNU General Public License, Version 2.0, the GNU Lesser General Public License, Version 2.1, the GNU Affero General Public License, Version 3.0, or any later versions of those licenses. 1.13. "Source Code Form" means the form of the work preferred for making modifications. 1.14. "You" (or "Your") means an individual or a legal entity exercising rights under this License. For legal entities, "You" includes any entity that controls, is controlled by, or is under common control with You. For purposes of this definition, "control" means (a) the power, direct or indirect, to cause the direction or management of such entity, whether by contract or otherwise, or (b) ownership of more than fifty percent (50%) of the outstanding shares or beneficial ownership of such entity. 2. License Grants and Conditions -------------------------------- 2.1. Grants Each Contributor hereby grants You a world-wide, royalty-free, non-exclusive license: (a) under intellectual property rights (other than patent or trademark) Licensable by such Contributor to use, reproduce, make available, modify, display, perform, distribute, and otherwise exploit its Contributions, either on an unmodified basis, with Modifications, or as part of a Larger Work; and (b) under Patent Claims of such Contributor to make, use, sell, offer for sale, have made, import, and otherwise transfer either its Contributions or its Contributor Version. 2.2. Effective Date The licenses granted in Section 2.1 with respect to any Contribution become effective for each Contribution on the date the Contributor first distributes such Contribution. 2.3. Limitations on Grant Scope The licenses granted in this Section 2 are the only rights granted under this License. No additional rights or licenses will be implied from the distribution or licensing of Covered Software under this License. Notwithstanding Section 2.1(b) above, no patent license is granted by a Contributor: (a) for any code that a Contributor has removed from Covered Software; or (b) for infringements caused by: (i) Your and any other third party's modifications of Covered Software, or (ii) the combination of its Contributions with other software (except as part of its Contributor Version); or (c) under Patent Claims infringed by Covered Software in the absence of its Contributions. This License does not grant any rights in the trademarks, service marks, or logos of any Contributor (except as may be necessary to comply with the notice requirements in Section 3.4). 2.4. Subsequent Licenses No Contributor makes additional grants as a result of Your choice to distribute the Covered Software under a subsequent version of this License (see Section 10.2) or under the terms of a Secondary License (if permitted under the terms of Section 3.3). 2.5. Representation Each Contributor represents that the Contributor believes its Contributions are its original creation(s) or it has sufficient rights to grant the rights to its Contributions conveyed by this License. 2.6. Fair Use This License is not intended to limit any rights You have under applicable copyright doctrines of fair use, fair dealing, or other equivalents. 2.7. Conditions Sections 3.1, 3.2, 3.3, and 3.4 are conditions of the licenses granted in Section 2.1. 3. Responsibilities ------------------- 3.1. Distribution of Source Form All distribution of Covered Software in Source Code Form, including any Modifications that You create or to which You contribute, must be under the terms of this License. You must inform recipients that the Source Code Form of the Covered Software is governed by the terms of this License, and how they can obtain a copy of this License. You may not attempt to alter or restrict the recipients' rights in the Source Code Form. 3.2. Distribution of Executable Form If You distribute Covered Software in Executable Form then: (a) such Covered Software must also be made available in Source Code Form, as described in Section 3.1, and You must inform recipients of the Executable Form how they can obtain a copy of such Source Code Form by reasonable means in a timely manner, at a charge no more than the cost of distribution to the recipient; and (b) You may distribute such Executable Form under the terms of this License, or sublicense it under different terms, provided that the license for the Executable Form does not attempt to limit or alter the recipients' rights in the Source Code Form under this License. 3.3. Distribution of a Larger Work You may create and distribute a Larger Work under terms of Your choice, provided that You also comply with the requirements of this License for the Covered Software. If the Larger Work is a combination of Covered Software with a work governed by one or more Secondary Licenses, and the Covered Software is not Incompatible With Secondary Licenses, this License permits You to additionally distribute such Covered Software under the terms of such Secondary License(s), so that the recipient of the Larger Work may, at their option, further distribute the Covered Software under the terms of either this License or such Secondary License(s). 3.4. Notices You may not remove or alter the substance of any license notices (including copyright notices, patent notices, disclaimers of warranty, or limitations of liability) contained within the Source Code Form of the Covered Software, except that You may alter any license notices to the extent required to remedy known factual inaccuracies. 3.5. Application of Additional Terms You may choose to offer, and to charge a fee for, warranty, support, indemnity or liability obligations to one or more recipients of Covered Software. However, You may do so only on Your own behalf, and not on behalf of any Contributor. You must make it absolutely clear that any such warranty, support, indemnity, or liability obligation is offered by You alone, and You hereby agree to indemnify every Contributor for any liability incurred by such Contributor as a result of warranty, support, indemnity or liability terms You offer. You may include additional disclaimers of warranty and limitations of liability specific to any jurisdiction. 4. Inability to Comply Due to Statute or Regulation --------------------------------------------------- If it is impossible for You to comply with any of the terms of this License with respect to some or all of the Covered Software due to statute, judicial order, or regulation then You must: (a) comply with the terms of this License to the maximum extent possible; and (b) describe the limitations and the code they affect. Such description must be placed in a text file included with all distributions of the Covered Software under this License. Except to the extent prohibited by statute or regulation, such description must be sufficiently detailed for a recipient of ordinary skill to be able to understand it. 5. Termination -------------- 5.1. The rights granted under this License will terminate automatically if You fail to comply with any of its terms. However, if You become compliant, then the rights granted under this License from a particular Contributor are reinstated (a) provisionally, unless and until such Contributor explicitly and finally terminates Your grants, and (b) on an ongoing basis, if such Contributor fails to notify You of the non-compliance by some reasonable means prior to 60 days after You have come back into compliance. Moreover, Your grants from a particular Contributor are reinstated on an ongoing basis if such Contributor notifies You of the non-compliance by some reasonable means, this is the first time You have received notice of non-compliance with this License from such Contributor, and You become compliant prior to 30 days after Your receipt of the notice. 5.2. If You initiate litigation against any entity by asserting a patent infringement claim (excluding declaratory judgment actions, counter-claims, and cross-claims) alleging that a Contributor Version directly or indirectly infringes any patent, then the rights granted to You by any and all Contributors for the Covered Software under Section 2.1 of this License shall terminate. 5.3. In the event of termination under Sections 5.1 or 5.2 above, all end user license agreements (excluding distributors and resellers) which have been validly granted by You or Your distributors under this License prior to termination shall survive termination. ************************************************************************ * * * 6. Disclaimer of Warranty * * ------------------------- * * * * Covered Software is provided under this License on an "as is" * * basis, without warranty of any kind, either expressed, implied, or * * statutory, including, without limitation, warranties that the * * Covered Software is free of defects, merchantable, fit for a * * particular purpose or non-infringing. The entire risk as to the * * quality and performance of the Covered Software is with You. * * Should any Covered Software prove defective in any respect, You * * (not any Contributor) assume the cost of any necessary servicing, * * repair, or correction. This disclaimer of warranty constitutes an * * essential part of this License. No use of any Covered Software is * * authorized under this License except under this disclaimer. * * * ************************************************************************ ************************************************************************ * * * 7. Limitation of Liability * * -------------------------- * * * * Under no circumstances and under no legal theory, whether tort * * (including negligence), contract, or otherwise, shall any * * Contributor, or anyone who distributes Covered Software as * * permitted above, be liable to You for any direct, indirect, * * special, incidental, or consequential damages of any character * * including, without limitation, damages for lost profits, loss of * * goodwill, work stoppage, computer failure or malfunction, or any * * and all other commercial damages or losses, even if such party * * shall have been informed of the possibility of such damages. This * * limitation of liability shall not apply to liability for death or * * personal injury resulting from such party's negligence to the * * extent applicable law prohibits such limitation. Some * * jurisdictions do not allow the exclusion or limitation of * * incidental or consequential damages, so this exclusion and * * limitation may not apply to You. * * * ************************************************************************ 8. Litigation ------------- Any litigation relating to this License may be brought only in the courts of a jurisdiction where the defendant maintains its principal place of business and such litigation shall be governed by laws of that jurisdiction, without reference to its conflict-of-law provisions. Nothing in this Section shall prevent a party's ability to bring cross-claims or counter-claims. 9. Miscellaneous ---------------- This License represents the complete agreement concerning the subject matter hereof. If any provision of this License is held to be unenforceable, such provision shall be reformed only to the extent necessary to make it enforceable. Any law or regulation which provides that the language of a contract shall be construed against the drafter shall not be used to construe this License against a Contributor. 10. Versions of the License --------------------------- 10.1. New Versions Mozilla Foundation is the license steward. Except as provided in Section 10.3, no one other than the license steward has the right to modify or publish new versions of this License. Each version will be given a distinguishing version number. 10.2. Effect of New Versions You may distribute the Covered Software under the terms of the version of the License under which You originally received the Covered Software, or under the terms of any subsequent version published by the license steward. 10.3. Modified Versions If you create software not governed by this License, and you want to create a new license for such software, you may create and use a modified version of this License if you rename the license and remove any references to the name of the license steward (except to note that such modified license differs from this License). 10.4. Distributing Source Code Form that is Incompatible With Secondary Licenses If You choose to distribute Source Code Form that is Incompatible With Secondary Licenses under the terms of this version of the License, the notice described in Exhibit B of this License must be attached. Exhibit A - Source Code Form License Notice ------------------------------------------- This Source Code Form is subject to the terms of the Mozilla Public License, v. 2.0. If a copy of the MPL was not distributed with this file, You can obtain one at https://mozilla.org/MPL/2.0/. If it is not possible or desirable to put the notice in a particular file, then You may include the notice in a location (such as a LICENSE file in a relevant directory) where a recipient would be likely to look for such a notice. You may add additional accurate notices of copyright ownership. Exhibit B - "Incompatible With Secondary Licenses" Notice --------------------------------------------------------- This Source Code Form is "Incompatible With Secondary Licenses", as defined by the Mozilla Public License, v. 2.0. ------------------------------------------------------------------------------ ============================================================================== PART 7. THE WEBSITE ============================================================================== Everything above is in the app as well. What the website itself sends to browsers: livekit-client (JavaScript) 2.21.0 ---------------------------------- The listener page's audio, sent to every browser that opens it, unmodified. Its NOTICE is below; the Apache License 2.0 it is under is printed once, in Part 3. Licence: Apache-2.0. https://github.com/livekit/client-sdk-js Copyright 2021 LiveKit, Inc. Licensed under the Apache License, Version 2.0 (the "License"); you may not use this file except in compliance with the License. You may obtain a copy of the License at http://www.apache.org/licenses/LICENSE-2.0 Unless required by applicable law or agreed to in writing, software distributed under the License is distributed on an "AS IS" BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. See the License for the specific language governing permissions and limitations under the License. The Archivo typeface is in Part 1, and is served with its licence at /fonts/Archivo-OFL.txt. Run on the server, and never handed to anybody -- named with their licences: livekit-server 1.13.5 -- Apache-2.0 -- https://github.com/livekit/livekit Caddy 2 -- Apache-2.0 -- https://github.com/caddyserver/caddy LAME (libmp3lame) 3.100 -- LGPL-2.0-or-later -- https://lame.sourceforge.io and the 61 Rust packages only the server is built with, each named with its licence in /third-party.txt.