4 * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
6 * This program is free software; you can redistribute it and/or modify
7 * it under the terms of the GNU General Public License version 2 only,
8 * as published by the Free Software Foundation.
10 * This program is distributed in the hope that it will be useful, but
11 * WITHOUT ANY WARRANTY; without even the implied warranty of
12 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
13 * General Public License version 2 for more details (a copy is included
14 * in the LICENSE file that accompanied this code).
16 * You should have received a copy of the GNU General Public License
17 * version 2 along with this program; If not, see
18 * http://www.gnu.org/licenses/gpl-2.0.html
23 * Copyright (c) 2008, 2010, Oracle and/or its affiliates. All rights reserved.
24 * Use is subject to license terms.
26 * Copyright (c) 2012, 2014, Intel Corporation.
29 * This file is part of Lustre, http://www.lustre.org/
30 * Lustre is a trademark of Sun Microsystems, Inc.
32 * lustre/obdclass/idmap.c
34 * Lustre user identity mapping.
36 * Author: Fan Yong <fanyong@clusterfs.com>
39 #define DEBUG_SUBSYSTEM S_SEC
41 #include <linux/user_namespace.h>
42 #ifdef HAVE_UIDGID_HEADER
43 # include <linux/uidgid.h>
45 #include <lustre_idmap.h>
46 #include <upcall_cache.h>
47 #include <md_object.h>
48 #include <obd_support.h>
50 #define lustre_get_group_info(group_info) do { \
51 atomic_inc(&(group_info)->usage); \
54 #define lustre_put_group_info(group_info) do { \
55 if (atomic_dec_and_test(&(group_info)->usage)) \
56 groups_free(group_info); \
60 * groups_search() is copied from linux kernel!
63 static int lustre_groups_search(struct group_info *group_info,
72 right = group_info->ngroups;
73 while (left < right) {
74 int mid = (left + right) / 2;
76 from_kgid(&init_user_ns, CFS_GROUP_AT(group_info, mid));
88 void lustre_groups_from_list(struct group_info *ginfo, gid_t *glist)
91 int count = ginfo->ngroups;
93 /* fill group_info from gid array */
94 for (i = 0; i < ginfo->nblocks && count > 0; i++) {
95 int cp_count = min(CFS_NGROUPS_PER_BLOCK, count);
96 int off = i * CFS_NGROUPS_PER_BLOCK;
97 int len = cp_count * sizeof(*glist);
99 memcpy(ginfo->blocks[i], glist + off, len);
103 EXPORT_SYMBOL(lustre_groups_from_list);
105 /* groups_sort() is copied from linux kernel! */
106 /* a simple shell-metzner sort */
107 void lustre_groups_sort(struct group_info *group_info)
109 int base, max, stride;
110 int gidsetsize = group_info->ngroups;
112 for (stride = 1; stride < gidsetsize; stride = 3 * stride + 1)
117 max = gidsetsize - stride;
118 for (base = 0; base < max; base++) {
120 int right = left + stride;
121 gid_t tmp = from_kgid(&init_user_ns,
122 CFS_GROUP_AT(group_info, right));
125 tmp < from_kgid(&init_user_ns,
126 CFS_GROUP_AT(group_info, left))) {
127 CFS_GROUP_AT(group_info, right) =
128 CFS_GROUP_AT(group_info, left);
132 CFS_GROUP_AT(group_info, right) =
133 make_kgid(&init_user_ns, tmp);
138 EXPORT_SYMBOL(lustre_groups_sort);
140 int lustre_in_group_p(struct lu_ucred *mu, gid_t grp)
144 if (grp != mu->uc_fsgid) {
145 struct group_info *group_info = NULL;
147 if (mu->uc_ginfo || !mu->uc_identity ||
148 mu->uc_valid == UCRED_OLD)
149 if (grp == mu->uc_suppgids[0] ||
150 grp == mu->uc_suppgids[1])
154 group_info = mu->uc_ginfo;
155 else if (mu->uc_identity)
156 group_info = mu->uc_identity->mi_ginfo;
161 lustre_get_group_info(group_info);
162 rc = lustre_groups_search(group_info, grp);
163 lustre_put_group_info(group_info);
167 EXPORT_SYMBOL(lustre_in_group_p);