treewide: convert ISO_8859-1 text comments to utf-8
Almost all files in the kernel are either plain text or UTF-8 encoded. A couple however are ISO_8859-1, usually just a few characters in a C comments, for historic reasons. This converts them all to UTF-8 for consistency. Link: http://lkml.kernel.org/r/20180724111600.4158975-1-arnd@arndb.de Signed-off-by: Arnd Bergmann <arnd@arndb.de> Acked-by: Simon Horman <horms@verge.net.au> [IPVS portion] Acked-by: Jonathan Cameron <Jonathan.Cameron@huawei.com> [IIO] Acked-by: Michael Ellerman <mpe@ellerman.id.au> [powerpc] Acked-by: Rob Herring <robh@kernel.org> Cc: Joe Perches <joe@perches.com> Cc: Arnd Bergmann <arnd@arndb.de> Cc: Samuel Ortiz <sameo@linux.intel.com> Cc: "David S. Miller" <davem@davemloft.net> Cc: Rob Herring <robh+dt@kernel.org> Signed-off-by: Andrew Morton <akpm@linux-foundation.org> Signed-off-by: Linus Torvalds <torvalds@linux-foundation.org>
This commit is contained in:
committed by
Linus Torvalds
parent
0edf681375
commit
3723c63247
@@ -296,10 +296,10 @@ config IP_VS_MH_TAB_INDEX
|
||||
stored in a hash table. This table is assigned by a preference
|
||||
list of the positions to each destination until all slots in
|
||||
the table are filled. The index determines the prime for size of
|
||||
the table as 251, 509, 1021, 2039, 4093, 8191, 16381, 32749,
|
||||
65521 or 131071. When using weights to allow destinations to
|
||||
receive more connections, the table is assigned an amount
|
||||
proportional to the weights specified. The table needs to be large
|
||||
the table as 251, 509, 1021, 2039, 4093, 8191, 16381, 32749,
|
||||
65521 or 131071. When using weights to allow destinations to
|
||||
receive more connections, the table is assigned an amount
|
||||
proportional to the weights specified. The table needs to be large
|
||||
enough to effectively fit all the destinations multiplied by their
|
||||
respective weights.
|
||||
|
||||
|
||||
@@ -5,10 +5,10 @@
|
||||
*
|
||||
*/
|
||||
|
||||
/* The mh algorithm is to assign a preference list of all the lookup
|
||||
/* The mh algorithm is to assign a preference list of all the lookup
|
||||
* table positions to each destination and populate the table with
|
||||
* the most-preferred position of destinations. Then it is to select
|
||||
* destination with the hash key of source IP address through looking
|
||||
* destination with the hash key of source IP address through looking
|
||||
* up a the lookup table.
|
||||
*
|
||||
* The algorithm is detailed in:
|
||||
|
||||
Reference in New Issue
Block a user