Documentation: W1: minor typo corrections

Correct one typo/spello and remove one duplicated word in the
W1 documentation.

Signed-off-by: Randy Dunlap <rdunlap@infradead.org>
Cc: Jonathan Corbet <corbet@lwn.net>
Cc: linux-doc@vger.kernel.org
Cc: Evgeniy Polyakov <zbr@ioremap.net>
Link: https://lore.kernel.org/r/20220828002845.7022-1-rdunlap@infradead.org
Signed-off-by: Jonathan Corbet <corbet@lwn.net>
This commit is contained in:
Randy Dunlap 2022-08-27 17:28:45 -07:00 committed by Jonathan Corbet
parent 60e89a10ee
commit b270228753
2 changed files with 2 additions and 2 deletions

View File

@ -52,7 +52,7 @@ Notes and limitations.
clear the entire bulk in buffer. It would be possible to read the clear the entire bulk in buffer. It would be possible to read the
maximum buffer size to not run into this error condition, only extra maximum buffer size to not run into this error condition, only extra
bytes in the buffer is a logic error in the driver. The code should bytes in the buffer is a logic error in the driver. The code should
should match reads and writes as well as data sizes. Reads and match reads and writes as well as data sizes. Reads and
writes are serialized and the status verifies that the chip is idle writes are serialized and the status verifies that the chip is idle
(and data is available) before the read is executed, so it should (and data is available) before the read is executed, so it should
not happen. not happen.

View File

@ -113,7 +113,7 @@ generally only make sense when searching is disabled, as a search will
redetect manually removed devices that are present and timeout manually redetect manually removed devices that are present and timeout manually
added devices that aren't on the bus. added devices that aren't on the bus.
Bus searches occur at an interval, specified as a summ of timeout and Bus searches occur at an interval, specified as a sum of timeout and
timeout_us module parameters (either of which may be 0) for as long as timeout_us module parameters (either of which may be 0) for as long as
w1_master_search remains greater than 0 or is -1. Each search attempt w1_master_search remains greater than 0 or is -1. Each search attempt
decrements w1_master_search by 1 (down to 0) and increments decrements w1_master_search by 1 (down to 0) and increments