diff options
| author | Siddaraju DH <siddarajudh@gmail.com> | 2018-07-19 12:36:51 -0400 |
|---|---|---|
| committer | Jonathan Corbet <corbet@lwn.net> | 2018-07-23 11:33:06 -0400 |
| commit | 9e7c758ec4768cf47779dea3cc8452f871f8d07e (patch) | |
| tree | b18e0f6c0466c0471bcce191c4759ccfd2c560cc | |
| parent | 701b3a3c0ac42630f74a5efba8545d61ac0e3293 (diff) | |
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@gmail.com>
Signed-off-by: Jonathan Corbet <corbet@lwn.net>
| -rw-r--r-- | Documentation/timers/timekeeping.txt | 2 |
1 files changed, 1 insertions, 1 deletions
diff --git a/Documentation/timers/timekeeping.txt b/Documentation/timers/timekeeping.txt index f3a8cf28f802..2d1732b0a868 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 | |||
| 27 | what time it is. | 27 | what time it is. |
| 28 | 28 | ||
| 29 | Typically the clock source is a monotonic, atomic counter which will provide | 29 | Typically the clock source is a monotonic, atomic counter which will provide |
| 30 | n bits which count from 0 to 2^(n-1) and then wraps around to 0 and start over. | 30 | n bits which count from 0 to (2^n)-1 and then wraps around to 0 and start over. |
| 31 | It will ideally NEVER stop ticking as long as the system is running. It | 31 | It will ideally NEVER stop ticking as long as the system is running. It |
| 32 | may stop during system suspend. | 32 | may stop during system suspend. |
| 33 | 33 | ||
