2 * Copyright (c) 2002-2003 Networks Associates Technology, Inc.
5 * This software was developed for the FreeBSD Project by ThinkSec AS and
6 * Network Associates Laboratories, the Security Research Division of
7 * Network Associates, Inc. under DARPA/SPAWAR contract N66001-01-C-8035
8 * ("CBOSS"), as part of the DARPA CHATS research program.
10 * Redistribution and use in source and binary forms, with or without
11 * modification, are permitted provided that the following conditions
13 * 1. Redistributions of source code must retain the above copyright
14 * notice, this list of conditions and the following disclaimer.
15 * 2. Redistributions in binary form must reproduce the above copyright
16 * notice, this list of conditions and the following disclaimer in the
17 * documentation and/or other materials provided with the distribution.
18 * 3. The name of the author may not be used to endorse or promote
19 * products derived from this software without specific prior written
22 * THIS SOFTWARE IS PROVIDED BY THE AUTHOR AND CONTRIBUTORS ``AS IS'' AND
23 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
24 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
25 * ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE
26 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
27 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
28 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
29 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
30 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
31 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
34 * $P4: //depot/projects/openpam/lib/openpam_load.c#21 $
41 #include <security/pam_appl.h>
43 #include "openpam_impl.h"
45 const char *_pam_func_name
[PAM_NUM_PRIMITIVES
] = {
54 const char *_pam_sm_func_name
[PAM_NUM_PRIMITIVES
] = {
55 "pam_sm_authenticate",
58 "pam_sm_open_session",
59 "pam_sm_close_session",
63 static pam_module_t
*modules
;
66 * Locate a matching dynamic or static module. Keep a list of previously
67 * found modules to speed up the process.
71 openpam_load_module(const char *path
)
75 /* check cache first */
76 for (module
= modules
; module
!= NULL
; module
= module
->next
)
77 if (strcmp(module
->path
, path
) == 0)
80 /* nope; try to load */
81 module
= openpam_dynamic(path
);
82 openpam_log(PAM_LOG_DEBUG
, "%s dynamic %s",
83 (module
== NULL
) ? "no" : "using", path
);
85 #ifdef OPENPAM_STATIC_MODULES
86 /* look for a static module */
87 if (module
== NULL
&& strchr(path
, '/') == NULL
) {
88 module
= openpam_static(path
);
89 openpam_log(PAM_LOG_DEBUG
, "%s static %s",
90 (module
== NULL
) ? "no" : "using", path
);
94 openpam_log(PAM_LOG_ERROR
, "no %s found", path
);
97 openpam_log(PAM_LOG_DEBUG
, "adding %s to cache", module
->path
);
98 module
->next
= modules
;
99 if (module
->next
!= NULL
)
100 module
->next
->prev
= module
;
111 * XXX highly thread-unsafe
115 openpam_release_module(pam_module_t
*module
)
120 if (module
->refcount
> 0)
123 if (module
->refcount
< 0) {
124 openpam_log(PAM_LOG_ERROR
, "module %s has negative refcount",
126 module
->refcount
= 0;
128 if (module
->dlh
== NULL
)
131 dlclose(module
->dlh
);
132 if (module
->prev
!= NULL
)
133 module
->prev
->next
= module
->next
;
134 if (module
->next
!= NULL
)
135 module
->next
->prev
= module
->prev
;
136 if (module
== modules
)
137 modules
= module
->next
;
138 openpam_log(PAM_LOG_DEBUG
, "releasing %s", module
->path
);
145 * Destroy a chain, freeing all its links and releasing the modules
150 openpam_destroy_chain(pam_chain_t
*chain
)
154 openpam_destroy_chain(chain
->next
);
156 while (chain
->optc
) {
158 FREE(chain
->optv
[chain
->optc
]);
161 openpam_release_module(chain
->module
);
162 chain
->module
= NULL
;
168 * Clear the chains and release the modules
172 openpam_clear_chains(pam_chain_t
*policy
[])
176 for (i
= 0; i
< PAM_NUM_FACILITIES
; ++i
) {
177 openpam_destroy_chain(policy
[i
]);