linux-kernel - [PATCH] timekeeping.txt: Correct maxCount of n-bit binary counter

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-next>] [day] [month] [year] [list]

Date:   Thu, 19 Jul 2018 22:06:51 +0530
From:   Siddaraju DH <siddarajudh@...il.com>
To:     john.stultz@...aro.org
Cc:     tglx@...utronix.de, corbet@....net, linux-kernel@...r.kernel.org,
        linux-doc@...r.kernel.org, Siddaraju DH <siddarajudh@...il.com>
Subject: [PATCH] timekeeping.txt: Correct maxCount of n-bit binary counter

A n-bit binary counter can count a maximum of 2^n events and the count
value ranges from 0 to (2^n)-1

Signed-off-by: Siddaraju DH <siddarajudh@...il.com>
---
 Documentation/timers/timekeeping.txt | 2 +-
 1 file changed, 1 insertion(+), 1 deletion(-)

diff --git a/Documentation/timers/timekeeping.txt b/Documentation/timers/timekeeping.txt
index f3a8cf2..2d1732b 100644
--- a/Documentation/timers/timekeeping.txt
+++ b/Documentation/timers/timekeeping.txt
@@ -27,7 +27,7 @@ a Linux system will eventually read the clock source to determine exactly
 what time it is.
 
 Typically the clock source is a monotonic, atomic counter which will provide
-n bits which count from 0 to 2^(n-1) and then wraps around to 0 and start over.
+n bits which count from 0 to (2^n)-1 and then wraps around to 0 and start over.
 It will ideally NEVER stop ticking as long as the system is running. It
 may stop during system suspend.
 
-- 
2.7.4