Index: uspace/srv/devman/devman.c
===================================================================
--- uspace/srv/devman/devman.c	(revision 463e73487913f21bac827e1a143dfeb4e9d442ae)
+++ uspace/srv/devman/devman.c	(revision c0bd08d13ec5f4a113b4a8f25fbbb456b69a1cd2)
@@ -766,7 +766,4 @@
 		start_driver(drv);
 	}
-	fibril_mutex_unlock(&drv->driver_mutex);
-	
-	fibril_mutex_lock(&drv->driver_mutex);
 	bool is_running = drv->state == DRIVER_RUNNING;
 	fibril_mutex_unlock(&drv->driver_mutex);
Index: uspace/srv/devman/main.c
===================================================================
--- uspace/srv/devman/main.c	(revision 463e73487913f21bac827e1a143dfeb4e9d442ae)
+++ uspace/srv/devman/main.c	(revision c0bd08d13ec5f4a113b4a8f25fbbb456b69a1cd2)
@@ -246,9 +246,9 @@
 
 	/*
-	 * Try to find suitable driver and assign it to the device.
-	 * We do not want to block current fibril that is used to processing
-	 * incoming calls: we will launch a separate fibril to handle
-	 * the driver assigning. That is because assign_driver can actually
-	 * include task spawning which could take some time.
+	 * Try to find a suitable driver and assign it to the device.  We do
+	 * not want to block the current fibril that is used for processing
+	 * incoming calls: we will launch a separate fibril to handle the
+	 * driver assigning. That is because assign_driver can actually include
+	 * task spawning which could take some time.
 	 */
 	fid_t assign_fibril = fibril_create(assign_driver_fibril, node);
Index: uspace/srv/devman/match.c
===================================================================
--- uspace/srv/devman/match.c	(revision 463e73487913f21bac827e1a143dfeb4e9d442ae)
+++ uspace/srv/devman/match.c	(revision c0bd08d13ec5f4a113b4a8f25fbbb456b69a1cd2)
@@ -46,5 +46,5 @@
 	if (str_cmp(driver->id, device->id) == 0) {
 		/*
-		 * The strings matches, return their score multiplied.
+		 * The strings match, return the product of their scores.
 		 */
 		return driver->score * device->score;
@@ -66,5 +66,5 @@
 	
 	/*
-	 * Go through all pairs, return the highest score obtainetd.
+	 * Go through all pairs, return the highest score obtained.
 	 */
 	int highest_score = 0;