summaryrefslogtreecommitdiff
path: root/obt/paths.c
diff options
context:
space:
mode:
authorDana Jansens <danakj@orodu.net>2010-03-29 23:21:22 -0400
committerDana Jansens <danakj@orodu.net>2010-03-29 23:24:15 -0400
commit262591ec1adc1badfcb36e9e6876dd81f2df9492 (patch)
tree509d6e55264081d03d76895685ba3b83c1863bfd /obt/paths.c
parent3121146eccd031a56d410eb48f3002558f41b40a (diff)
add BSEARCH() macros in obt/bsearch.h that to a binary search on an array, use it when searching for a group in obt_paths_try_exec()
Diffstat (limited to 'obt/paths.c')
-rw-r--r--obt/paths.c20
1 files changed, 16 insertions, 4 deletions
diff --git a/obt/paths.c b/obt/paths.c
index f723ae2c..e2e4859b 100644
--- a/obt/paths.c
+++ b/obt/paths.c
@@ -16,9 +16,13 @@
See the COPYING file for a copy of the GNU General Public License.
*/
+#include "obt/bsearch.h"
#include "obt/paths.h"
#include "obt/util.h"
+#ifdef HAVE_STDLIB_H
+# include <stdlib.h>
+#endif
#ifdef HAVE_SYS_STAT_H
# include <sys/stat.h>
#endif
@@ -90,6 +94,12 @@ static GSList* split_paths(const gchar *paths)
return list;
}
+int gid_cmp(const void *va, const void *vb)
+{
+ const gid_t a = *(const gid_t*)va, b = *(const gid_t*)vb;
+ return a>b ? 1 : (a == b ? 0 : -1);
+}
+
static void find_uid_gid(uid_t *u, gid_t **g, guint *n)
{
struct passwd *pw;
@@ -115,6 +125,8 @@ static void find_uid_gid(uid_t *u, gid_t **g, guint *n)
}
}
endgrent();
+
+ qsort(*g, sizeof(gid_t), *n, gid_cmp);
}
ObtPaths* obt_paths_new(void)
@@ -317,7 +329,7 @@ static inline gboolean try_exec(const ObtPaths *const p,
const gchar *const path)
{
struct stat st;
- guint i;
+ BSEARCH_SETUP(guint);
stat(path, &st);
@@ -325,9 +337,9 @@ static inline gboolean try_exec(const ObtPaths *const p,
return FALSE;
if (st.st_uid == p->uid)
return st.st_mode & S_IXUSR;
- for (i = 0; i < p->n_gid; ++i)
- if (st.st_gid == p->gid[i])
- return st.st_mode & S_IXGRP;
+ BSEARCH(guint, p->gid, 0, p->n_gid, st.st_gid);
+ if (BSEARCH_FOUND())
+ return st.st_mode & S_IXGRP;
return st.st_mode & S_IXOTH;
}