167 lines
4.8 KiB
C
167 lines
4.8 KiB
C
/*
|
|
* Redistribution and use in source and binary forms, with or without
|
|
* modification, are permitted provided that the following conditions
|
|
* are met:
|
|
* 1. Redistributions of source code must retain the above copyright
|
|
* notice, and the entire permission notice in its entirety,
|
|
* including the disclaimer of warranties.
|
|
* 2. Redistributions in binary form must reproduce the above copyright
|
|
* notice, this list of conditions and the following disclaimer in the
|
|
* documentation and/or other materials provided with the distribution.
|
|
* 3. The name of the author may not be used to endorse or promote
|
|
* products derived from this software without specific prior
|
|
* written permission.
|
|
*
|
|
* ALTERNATIVELY, this product may be distributed under the terms of
|
|
* the GNU Public License, in which case the provisions of the GPL are
|
|
* required INSTEAD OF the above restrictions. (This clause is
|
|
* necessary due to a potential bad interaction between the GPL and
|
|
* the restrictions contained in a BSD-style copyright.)
|
|
*
|
|
* THIS SOFTWARE IS PROVIDED ``AS IS'' AND ANY EXPRESS OR IMPLIED
|
|
* WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES
|
|
* OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
|
|
* DISCLAIMED. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT,
|
|
* INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES
|
|
* (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR
|
|
* SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
|
|
* HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT,
|
|
* STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
|
|
* ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED
|
|
* OF THE POSSIBILITY OF SUCH DAMAGE.
|
|
*/
|
|
|
|
/*
|
|
* Check remember handling
|
|
* Change ten times the password
|
|
* Try the ten passwords again, should always be rejected
|
|
* Try a new password, should succeed
|
|
*/
|
|
|
|
#include <config.h>
|
|
|
|
#include <stdio.h>
|
|
#include <stdlib.h>
|
|
#include <string.h>
|
|
#include <security/pam_appl.h>
|
|
#include "pam_inline.h"
|
|
|
|
static unsigned int in_test;
|
|
|
|
static const char *passwords[] = {
|
|
"pamhistory01", "pamhistory02", "pamhistory03",
|
|
"pamhistory04", "pamhistory05", "pamhistory06",
|
|
"pamhistory07", "pamhistory08", "pamhistory09",
|
|
"pamhistory10",
|
|
"pamhistory01", "pamhistory02", "pamhistory03",
|
|
"pamhistory04", "pamhistory05", "pamhistory06",
|
|
"pamhistory07", "pamhistory08", "pamhistory09",
|
|
"pamhistory10",
|
|
"pamhistory11",
|
|
"pamhistory01", "pamhistory02", "pamhistory03",
|
|
"pamhistory04", "pamhistory05", "pamhistory06",
|
|
"pamhistory07", "pamhistory08", "pamhistory09",
|
|
"pamhistory10"};
|
|
|
|
static int debug;
|
|
|
|
/* A conversation function which uses an internally-stored value for
|
|
the responses. */
|
|
static int
|
|
fake_conv (int num_msg, const struct pam_message **msgm,
|
|
struct pam_response **response, void *appdata_ptr UNUSED)
|
|
{
|
|
struct pam_response *reply;
|
|
int count;
|
|
|
|
/* Sanity test. */
|
|
if (num_msg <= 0)
|
|
return PAM_CONV_ERR;
|
|
|
|
if (debug)
|
|
fprintf (stderr, "msg_style=%d, msg=%s\n", msgm[0]->msg_style,
|
|
msgm[0]->msg);
|
|
|
|
if (msgm[0]->msg_style != 1)
|
|
return PAM_SUCCESS;
|
|
|
|
/* Allocate memory for the responses. */
|
|
reply = calloc (num_msg, sizeof (struct pam_response));
|
|
if (reply == NULL)
|
|
return PAM_CONV_ERR;
|
|
|
|
/* Each prompt elicits the same response. */
|
|
for (count = 0; count < num_msg; ++count)
|
|
{
|
|
reply[count].resp_retcode = 0;
|
|
reply[count].resp = strdup (passwords[in_test]);
|
|
if (debug)
|
|
fprintf (stderr, "send password %s\n", reply[count].resp);
|
|
}
|
|
|
|
/* Set the pointers in the response structure and return. */
|
|
*response = reply;
|
|
return PAM_SUCCESS;
|
|
}
|
|
|
|
static struct pam_conv conv = {
|
|
fake_conv,
|
|
NULL
|
|
};
|
|
|
|
|
|
int
|
|
main(int argc, char *argv[])
|
|
{
|
|
pam_handle_t *pamh=NULL;
|
|
const char *user="tstpampwhistory";
|
|
int retval;
|
|
|
|
if (argc > 1 && strcmp (argv[1], "-d") == 0)
|
|
debug = 1;
|
|
|
|
for (in_test = 0; in_test < PAM_ARRAY_SIZE(passwords); in_test++)
|
|
{
|
|
|
|
retval = pam_start("tst-pam_pwhistory1", user, &conv, &pamh);
|
|
if (retval != PAM_SUCCESS)
|
|
{
|
|
if (debug)
|
|
fprintf (stderr, "pwhistory1-%u: pam_start returned %d\n",
|
|
in_test, retval);
|
|
return 1;
|
|
}
|
|
|
|
retval = pam_chauthtok (pamh, 0);
|
|
if (in_test < 10 || in_test == 20)
|
|
{
|
|
if (retval != PAM_SUCCESS)
|
|
{
|
|
if (debug)
|
|
fprintf (stderr, "pwhistory1-%u: pam_chauthtok returned %d\n",
|
|
in_test, retval);
|
|
return 1;
|
|
}
|
|
}
|
|
else if (in_test < 20)
|
|
{
|
|
if (retval != PAM_MAXTRIES)
|
|
{
|
|
if (debug)
|
|
fprintf (stderr, "pwhistory1-%u: pam_chauthtok returned %d\n",
|
|
in_test, retval);
|
|
return 1;
|
|
}
|
|
}
|
|
|
|
retval = pam_end (pamh,retval);
|
|
if (retval != PAM_SUCCESS)
|
|
{
|
|
if (debug)
|
|
fprintf (stderr, "pwhistory1: pam_end returned %d\n", retval);
|
|
return 1;
|
|
}
|
|
}
|
|
|
|
return 0;
|
|
}
|