diff options
| author | Matt LaPlante <kernel1@cyberdogtech.com> | 2006-10-03 22:49:15 +0200 |
|---|---|---|
| committer | Adrian Bunk <bunk@stusta.de> | 2006-10-03 22:49:15 +0200 |
| commit | a2ffd2751683f4275d4d1aa5ce37e5a6a1ae21df (patch) | |
| tree | 81d772c66b92c87e585dde45f89b91904055471b /Documentation/networking | |
| parent | fff9289b219f48cb2296714fea3d71f516991f9f (diff) | |
| download | linux-a2ffd2751683f4275d4d1aa5ce37e5a6a1ae21df.tar.gz linux-a2ffd2751683f4275d4d1aa5ce37e5a6a1ae21df.tar.bz2 linux-a2ffd2751683f4275d4d1aa5ce37e5a6a1ae21df.zip | |
Fix typos in Documentation/: 'F'-'G'
This patch fixes typos in various Documentation txts. The patch addresses
some words starting with the letters 'F'-'G'.
Signed-off-by: Matt LaPlante <kernel1@cyberdogtech.com>
Signed-off-by: Adrian Bunk <bunk@stusta.de>
Diffstat (limited to 'Documentation/networking')
| -rw-r--r-- | Documentation/networking/cxgb.txt | 2 | ||||
| -rw-r--r-- | Documentation/networking/fib_trie.txt | 2 |
2 files changed, 2 insertions, 2 deletions
diff --git a/Documentation/networking/cxgb.txt b/Documentation/networking/cxgb.txt index 7b231752f25b..20a887615c4a 100644 --- a/Documentation/networking/cxgb.txt +++ b/Documentation/networking/cxgb.txt @@ -172,7 +172,7 @@ PERFORMANCE smaller window prevents congestion and facilitates better pacing, especially if/when MAC level flow control does not work well or when it is not supported on the machine. Experimentation may be necessary to attain - the correct value. This method is provided as a starting point fot the + the correct value. This method is provided as a starting point for the correct receive buffer size. Setting the min, max, and default receive buffer (RX_WINDOW) size is performed in the same manner as single connection. diff --git a/Documentation/networking/fib_trie.txt b/Documentation/networking/fib_trie.txt index f50d0c673c57..0723db7f8495 100644 --- a/Documentation/networking/fib_trie.txt +++ b/Documentation/networking/fib_trie.txt @@ -79,7 +79,7 @@ trie_rebalance() resize() Analyzes a tnode and optimizes the child array size by either inflating - or shrinking it repeatedly until it fullfills the criteria for optimal + or shrinking it repeatedly until it fulfills the criteria for optimal level compression. This part follows the original paper pretty closely and there may be some room for experimentation here. |