X-Git-Url: http://git.droids-corp.org/?p=dpdk.git;a=blobdiff_plain;f=lib%2Flibrte_sched%2Frte_red.h;h=6edf914f2cf1359dd9c5c165c518d169af15c7f1;hp=ca1222755df409f6057aa38605ed42669b45b889;hb=e32cb57973fc311b4b5f60ae5dac37d99e48c94d;hpb=82bf1caf5f93cd04c43b24a0bd9805b4fac1074a

diff --git a/lib/librte_sched/rte_red.h b/lib/librte_sched/rte_red.h
index ca1222755d..6edf914f2c 100644
--- a/lib/librte_sched/rte_red.h
+++ b/lib/librte_sched/rte_red.h
@@ -139,7 +139,7 @@ rte_red_config_init(struct rte_red_config *red_cfg,
 /**
  * @brief Generate random number for RED
  *
- * Implemenetation based on:
+ * Implementation based on:
  * http://software.intel.com/en-us/articles/fast-random-number-generator-on-the-intel-pentiumr-4-processor/
  *
  * 10 bit shift has been found through empirical tests (was 16).
@@ -200,7 +200,7 @@ __rte_red_calc_qempty_factor(uint8_t wq_log2, uint16_t m)
 	 * Now using basic math we compute 2^n:
 	 *   2^(f+n) = 2^f * 2^n
 	 *   2^f - we use lookup table
-	 *   2^n - can be replaced with bit shift right oeprations
+	 *   2^n - can be replaced with bit shift right operations
 	 */
 
 	f = (n >> 6) & 0xf;