summary refs log tree commit diff
path: root/search.c
diff options
context:
space:
mode:
authorokan <okan>2014-09-18 13:56:58 +0000
committerokan <okan>2014-09-18 13:56:58 +0000
commit2540b3f4fe34c6bc6ed0593e9c6d713d84b2c301 (patch)
tree640369d4716c7067b56d78f937397887a07260c8 /search.c
parent973592780997d20ff46e8df168df5246ddb1df82 (diff)
parentcbc7f760748f0519c70fa6c6d3c40a05810b7f9c (diff)
downloadcwm-2540b3f4fe34c6bc6ed0593e9c6d713d84b2c301.tar.gz
cwm-2540b3f4fe34c6bc6ed0593e9c6d713d84b2c301.tar.xz
cwm-2540b3f4fe34c6bc6ed0593e9c6d713d84b2c301.zip
cvsimport
Diffstat (limited to 'search.c')
-rw-r--r--search.c14
1 files changed, 7 insertions, 7 deletions
diff --git a/search.c b/search.c
index 4012400..49e3184 100644
--- a/search.c
+++ b/search.c
@@ -102,7 +102,7 @@ search_match_client(struct menu_q *menuq, struct menu_q *resultq, char *search)
 			tier++;
 
 		/* Clients that are hidden get ranked one up. */
-		if (cc->flags & CLIENT_HIDDEN && tier > 0)
+		if ((cc->flags & CLIENT_HIDDEN) && (tier > 0))
 			tier--;
 
 		assert(tier < nitems(tierp));
@@ -194,13 +194,13 @@ search_match_path(struct menu_q *menuq, struct menu_q *resultq, char *search, in
 static void
 search_match_path_exec(struct menu_q *menuq, struct menu_q *resultq, char *search)
 {
-	return (search_match_path(menuq, resultq, search, PATH_EXEC));
+	return(search_match_path(menuq, resultq, search, PATH_EXEC));
 }
 
 void
 search_match_path_any(struct menu_q *menuq, struct menu_q *resultq, char *search)
 {
-	return (search_match_path(menuq, resultq, search, PATH_ANY));
+	return(search_match_path(menuq, resultq, search, PATH_ANY));
 }
 
 void
@@ -254,13 +254,13 @@ strsubmatch(char *sub, char *str, int zeroidx)
 	unsigned int	 n, flen;
 
 	if (sub == NULL || str == NULL)
-		return (0);
+		return(0);
 
 	len = strlen(str);
 	sublen = strlen(sub);
 
 	if (sublen > len)
-		return (0);
+		return(0);
 
 	if (!zeroidx)
 		flen = len - sublen;
@@ -269,7 +269,7 @@ strsubmatch(char *sub, char *str, int zeroidx)
 
 	for (n = 0; n <= flen; n++)
 		if (strncasecmp(sub, str + n, sublen) == 0)
-			return (1);
+			return(1);
 
-	return (0);
+	return(0);
 }