linux-kernel - Re: [PATCH v1] ASoC: jz4740-i2s: Make I2S divider calculations more robust

lists.openwall.net		lists / announce owl-users owl-dev john-users john-dev passwdqc-users yescrypt popa3d-users / oss-security kernel-hardening musl sabotage tlsify passwords / crypt-dev xvendor / Bugtraq Full-Disclosure linux-kernel linux-netdev linux-ext4 linux-hardening linux-cve-announce PHC
Open Source and information security mailing list archives

Hash Suite: Windows password security audit tool. GUI, reports in PDF.

[<prev] [next>] [<thread-prev] [day] [month] [year] [list]

Message-Id: <168378338586.323079.4615747574575722094.b4-ty@kernel.org>
Date:   Thu, 11 May 2023 14:36:25 +0900
From:   Mark Brown <broonie@...nel.org>
To:     paul@...pouillou.net,
        Aidan MacDonald <aidanmacdonald.0x0@...il.com>
Cc:     lgirdwood@...il.com, perex@...ex.cz, tiwai@...e.com,
        linux-mips@...r.kernel.org, alsa-devel@...a-project.org,
        linux-kernel@...r.kernel.org
Subject: Re: [PATCH v1] ASoC: jz4740-i2s: Make I2S divider calculations
 more robust

On Tue, 09 May 2023 13:51:34 +0100, Aidan MacDonald wrote:
> When the CPU supplies bit/frame clocks, the system clock (clk_i2s)
> is divided to produce the bit clock. This is a simple 1/N divider
> with a fairly limited range, so for a given system clock frequency
> only a few sample rates can be produced. Usually a wider range of
> sample rates is supported by varying the system clock frequency.
> 
> The old calculation method was not very robust and could easily
> produce the wrong clock rate, especially with non-standard rates.
> For example, if the system clock is 1.99x the target bit clock
> rate, the divider would be calculated as 1 instead of the more
> accurate 2.
> 
> [...]

Applied to

   https://git.kernel.org/pub/scm/linux/kernel/git/broonie/sound.git for-next

Thanks!

[1/1] ASoC: jz4740-i2s: Make I2S divider calculations more robust
      commit: ad721bc919edfd8b4b06977458a412011e2f0c50

All being well this means that it will be integrated into the linux-next
tree (usually sometime in the next 24 hours) and sent to Linus during
the next merge window (or sooner if it is a bug fix), however if
problems are discovered then the patch may be dropped or reverted.

You may get further e-mails resulting from automated or manual testing
and review of the tree, please engage with people reporting problems and
send followup patches addressing any issues that are reported if needed.

If any updates are required or you are submitting further changes they
should be sent as incremental updates against current git, existing
patches will not be replaced.

Please add any relevant lists and maintainers to the CCs when replying
to this mail.

Thanks,
Mark