2 Unix SMB/CIFS implementation.
4 Copyright (C) Simo Sorce 2003
5 Copyright (C) Jeremy Allison 2006
6 Copyright (C) Michael Adam 2010
8 This program is free software; you can redistribute it and/or modify
9 it under the terms of the GNU General Public License as published by
10 the Free Software Foundation; either version 3 of the License, or
11 (at your option) any later version.
13 This program is distributed in the hope that it will be useful,
14 but WITHOUT ANY WARRANTY; without even the implied warranty of
15 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
16 GNU General Public License for more details.
18 You should have received a copy of the GNU General Public License
19 along with this program. If not, see <http://www.gnu.org/licenses/>.*/
23 #include "winbindd_proto.h"
25 #include "idmap_cache.h"
26 #include "../libcli/security/security.h"
30 #define DBGC_CLASS DBGC_IDMAP
33 * check whether a given unix id is inside the filter range of an idmap domain
35 bool idmap_unix_id_is_in_range(uint32_t id, struct idmap_domain *dom)
37 if ((dom->low_id && (id < dom->low_id)) ||
38 (dom->high_id && (id > dom->high_id)))
47 * Helper for unixids_to_sids: find entry by id in mapping array,
48 * search up to IDMAP_AD_MAX_IDS entries
50 struct id_map *idmap_find_map_by_id(struct id_map **maps, enum id_type type,
55 for (i = 0; maps[i] != NULL; i++) {
56 if ((maps[i]->xid.type == type) && (maps[i]->xid.id == id)) {
65 * Helper for sids_to_unix_ids: find entry by SID in mapping array,
66 * search up to IDMAP_AD_MAX_IDS entries
68 struct id_map *idmap_find_map_by_sid(struct id_map **maps, struct dom_sid *sid)
72 for (i = 0; i < IDMAP_LDAP_MAX_IDS; i++) {
73 if (maps[i] == NULL) { /* end of the run */
76 if (dom_sid_equal(maps[i]->sid, sid)) {
84 char *idmap_fetch_secret(const char *backend, const char *domain,
90 r = asprintf(&tmp, "IDMAP_%s_%s", backend, domain);
95 /* make sure the key is case insensitive */
96 if (!strupper_m(tmp)) {
101 ret = secrets_fetch_generic(tmp, identity);
108 struct id_map **id_map_ptrs_init(TALLOC_CTX *mem_ctx, size_t num_ids)
110 struct id_map **ptrs;
112 struct dom_sid *sids;
115 ptrs = talloc_array(mem_ctx, struct id_map *, num_ids+1);
119 maps = talloc_array(ptrs, struct id_map, num_ids);
124 sids = talloc_zero_array(ptrs, struct dom_sid, num_ids);
130 for (i=0; i<num_ids; i++) {
131 maps[i] = (struct id_map) { .sid = &sids[i] };
134 ptrs[num_ids] = NULL;