Description: a bunch of typo fixes
Author: Ana Guerrero Lopez <ana@ekaia.org>
Last-Update: 2016-09-08

--- opensm-3.3.20.orig/doc/current-routing.txt
+++ opensm-3.3.20/doc/current-routing.txt
@@ -824,7 +824,7 @@ The DFSSSP algorithm consists of five ma
    each switch:
 2.1) use Dijkstra's algorithm to find the shortest path from all nodes
      to the current selected destination;
-2.2) update the egde weights in the graph, i.e. add the number of
+2.2) update the edge weights in the graph, i.e. add the number of
      routes, which use a link to reach the destination, to the link/edge;
 2.3) update the LFT of each switch with the outgoing port which was used
      in the current step to route the traffic to the destination node.
@@ -836,7 +836,7 @@ The DFSSSP algorithm consists of five ma
    the following substeps:
 4.1) search for a cycle in the current CDG;
 4.2) when a cycle is found, i.e. a possible deadlock is present,
-     one edge is selected and all routes, which induced this egde, are moved
+     one edge is selected and all routes, which induced this edge, are moved
      to the "next higher" virtual layer (CDG[i+1]);
 4.3) the cycle search is continued until all cycles are broken and
      routes are moved "up".
--- opensm-3.3.20.orig/man/opensm.8
+++ opensm-3.3.20/man/opensm.8
@@ -1272,7 +1272,7 @@ each switch:
 2.1) use Dijkstra's algorithm to find the shortest path from all
 nodes to the current selected destination;
 .br
-2.2) update the egde weights in the graph, i.e. add the number of
+2.2) update the edge weights in the graph, i.e. add the number of
 routes, which use a link to reach the destination,
 to the link/edge;
 .br
@@ -1291,7 +1291,7 @@ the following substeps:
 4.1) search for a cycle in the current CDG;
 .br
 4.2) when a cycle is found, i.e. a possible deadlock is present,
-one edge is selected and all routes, which induced this egde,
+one edge is selected and all routes, which induced this edge,
 are moved to the "next higher" virtual layer (CDG[i+1]);
 .br
 4.3) the cycle search is continued until all cycles are broken and
--- opensm-3.3.20.orig/man/opensm.8.in
+++ opensm-3.3.20/man/opensm.8.in
@@ -1272,7 +1272,7 @@ each switch:
 2.1) use Dijkstra's algorithm to find the shortest path from all
 nodes to the current selected destination;
 .br
-2.2) update the egde weights in the graph, i.e. add the number of
+2.2) update the edge weights in the graph, i.e. add the number of
 routes, which use a link to reach the destination,
 to the link/edge;
 .br
@@ -1291,7 +1291,7 @@ the following substeps:
 4.1) search for a cycle in the current CDG;
 .br
 4.2) when a cycle is found, i.e. a possible deadlock is present,
-one edge is selected and all routes, which induced this egde,
+one edge is selected and all routes, which induced this edge,
 are moved to the "next higher" virtual layer (CDG[i+1]);
 .br
 4.3) the cycle search is continued until all cycles are broken and
--- opensm-3.3.20.orig/man/torus-2QoS.8
+++ opensm-3.3.20/man/torus-2QoS.8
@@ -381,7 +381,7 @@ will not be placed into the torus.
 .
 .SH QUALITY OF SERVICE CONFIGURATION
 .
-OpenSM will not program switchs and channel adapters with
+OpenSM will not program switches and channel adapters with
 SL2VL maps or VL arbitration configuration unless it is invoked with -Q.
 Since torus-2QoS depends on such functionality for correct operation,
 always invoke OpenSM with -Q when torus-2QoS is in the list of routing
--- opensm-3.3.20.orig/man/torus-2QoS.8.in
+++ opensm-3.3.20/man/torus-2QoS.8.in
@@ -381,7 +381,7 @@ will not be placed into the torus.
 .
 .SH QUALITY OF SERVICE CONFIGURATION
 .
-OpenSM will not program switchs and channel adapters with
+OpenSM will not program switches and channel adapters with
 SL2VL maps or VL arbitration configuration unless it is invoked with -Q.
 Since torus-2QoS depends on such functionality for correct operation,
 always invoke OpenSM with -Q when torus-2QoS is in the list of routing
--- opensm-3.3.20.orig/opensm/osm_console.c
+++ opensm-3.3.20/opensm/osm_console.c
@@ -260,12 +260,12 @@ static void help_perfmgr(FILE * out, int
 			"   [dump_counters [mach]] -- dump the counters (optionally in [mach]ine readable format)\n");
 		fprintf(out,
 			"   [print_counters [<nodename|nodeguid>][:<port>]] -- print the internal counters\n"
-			"                                                      Optionaly limit output by name, guid, or port\n");
+			"                                                      Optionally limit output by name, guid, or port\n");
 		fprintf(out,
 			"   [pc [<nodename|nodeguid>][:<port>]] -- same as print_counters\n");
 		fprintf(out,
 			"   [print_errors [<nodename|nodeguid>]] -- print only ports with errors\n"
-			"                                           Optionaly limit output by name or guid\n");
+			"                                           Optionally limit output by name or guid\n");
 		fprintf(out,
 			"   [pe [<nodename|nodeguid>]] -- same as print_errors\n");
 		fprintf(out,
--- opensm-3.3.20.orig/opensm/osm_event_plugin.c
+++ opensm-3.3.20/opensm/osm_event_plugin.c
@@ -103,7 +103,7 @@ osm_epi_plugin_t *osm_epi_construct(osm_
 	old_impl = (struct old_if *) rc->impl;
 	if (old_impl->ver == OSM_ORIG_EVENT_PLUGIN_INTERFACE_VER) {
 		OSM_LOG(&osm->log, OSM_LOG_ERROR, "Error loading plugin: "
-			"\'%s\' contains a depricated interface version %d\n"
+			"\'%s\' contains a deprecated interface version %d\n"
 			"   Please recompile with the new interface.\n",
 			plugin_name, old_impl->ver);
 		goto Exit;
--- opensm-3.3.20.orig/opensm/osm_sa.c
+++ opensm-3.3.20/opensm/osm_sa.c
@@ -1125,7 +1125,7 @@ int osm_sa_db_file_load(osm_opensm_t * p
 	file_name = p_osm->subn.opt.sa_db_file;
 	if (!file_name) {
 		OSM_LOG(&p_osm->log, OSM_LOG_VERBOSE,
-			"sa db file name is not specifed. Skip restore\n");
+			"sa db file name is not specified. Skip restore\n");
 		return 0;
 	}
 
--- opensm-3.3.20.orig/opensm/osm_subnet.c
+++ opensm-3.3.20/opensm/osm_subnet.c
@@ -2783,7 +2783,7 @@ void osm_subn_output_conf(FILE *out, IN
 		"qos %s\n\n"
 		"# QoS policy file to be used\n"
 		"qos_policy_file %s\n"
-		"# Supress QoS MAD status errors\n"
+		"# Suppress QoS MAD status errors\n"
 		"suppress_sl2vl_mad_status_errors %s\n\n",
 		p_opts->qos ? "TRUE" : "FALSE", p_opts->qos_policy_file,
 		p_opts->suppress_sl2vl_mad_status_errors ? "TRUE" : "FALSE");
--- opensm-3.3.20.orig/opensm/osm_ucast_ftree.c
+++ opensm-3.3.20/opensm/osm_ucast_ftree.c
@@ -1749,7 +1749,7 @@ static int fabric_create_leaf_switch_arr
 
 	if (first_leaf_idx >= last_leaf_idx) {
 		osm_log_v2(&p_ftree->p_osm->log, OSM_LOG_INFO, FILE_ID,
-			   "Faild to find leaf switches - topology is not "
+			   "Failed to find leaf switches - topology is not "
 			   "fat-tree\n");
 		res = -1;
 		goto Exit;
@@ -3257,7 +3257,7 @@ static int rank_leaf_switches(IN ftree_f
 			/* HCA connected directly to another HCA - not FatTree */
 			OSM_LOG(&p_ftree->p_osm->log, OSM_LOG_ERROR,
 				"ERR AB0F: "
-				"CA conected directly to another CA: " "0x%016"
+				"CA connected directly to another CA: " "0x%016"
 				PRIx64 " <---> 0x%016" PRIx64 "\n",
 				hca_get_guid_ho(p_hca),
 				cl_ntoh64(osm_node_get_node_guid
@@ -3377,7 +3377,7 @@ fabric_construct_hca_ports(IN ftree_fabr
 			/* HCA connected directly to another HCA - not FatTree */
 			OSM_LOG(&p_ftree->p_osm->log, OSM_LOG_ERROR,
 				"ERR AB11: "
-				"CA conected directly to another CA: " "0x%016"
+				"CA connected directly to another CA: " "0x%016"
 				PRIx64 " <---> 0x%016" PRIx64 "\n",
 				cl_ntoh64(osm_node_get_node_guid(p_node)),
 				cl_ntoh64(remote_node_guid));
--- opensm-3.3.20.orig/osmtest/osmt_multicast.c
+++ opensm-3.3.20/osmtest/osmt_multicast.c
@@ -2423,7 +2423,7 @@ ib_api_status_t osmt_run_mcast_flow(IN o
 		/* Check invalid Join with max mlid which is more than the
 		   Mellanox switches support 0xC000+0x1000 = 0xd000 */
 		OSM_LOG(&p_osmt->log, OSM_LOG_INFO,
-			"Checking Creation of Maximum avaliable Groups (MulticastFDBCap)...\n");
+			"Checking Creation of Maximum available Groups (MulticastFDBCap)...\n");
 		tmp_mlid = cl_ntoh16(max_mlid) - cnt;
 
 		while (tmp_mlid > 0) {
