Merge tag 'iwlwifi-next-for-kalle-2014-12-30' of https://git.kernel.org/pub/scm/linux...

[cascardo/linux.git] / Documentation / networking / fib_trie.txt

diff --git a/Documentation/networking/fib_trie.txt b/Documentation/networking/fib_trie.txt
index f50d0c6..fe71938 100644 (file)
--- a/Documentation/networking/fib_trie.txt
+++ b/Documentation/networking/fib_trie.txt
@@ -73,13 +73,13 @@ trie_leaf_remove()
 
 trie_rebalance()
        The key function for the dynamic trie after any change in the trie
-       it is run to optimize and reorganize. Tt will walk the trie upwards 
-       towards the root from a given tnode, doing a resize() at each step 
+       it is run to optimize and reorganize. It will walk the trie upwards
+       towards the root from a given tnode, doing a resize() at each step
        to implement level compression.
 
 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.