tst-pam_pwhistory1.c 4.8 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169
  1. /*
  2. * Redistribution and use in source and binary forms, with or without
  3. * modification, are permitted provided that the following conditions
  4. * are met:
  5. * 1. Redistributions of source code must retain the above copyright
  6. * notice, and the entire permission notice in its entirety,
  7. * including the disclaimer of warranties.
  8. * 2. Redistributions in binary form must reproduce the above copyright
  9. * notice, this list of conditions and the following disclaimer in the
  10. * documentation and/or other materials provided with the distribution.
  11. * 3. The name of the author may not be used to endorse or promote
  12. * products derived from this software without specific prior
  13. * written permission.
  14. *
  15. * ALTERNATIVELY, this product may be distributed under the terms of
  16. * the GNU Public License, in which case the provisions of the GPL are
  17. * required INSTEAD OF the above restrictions. (This clause is
  18. * necessary due to a potential bad interaction between the GPL and
  19. * the restrictions contained in a BSD-style copyright.)
  20. *
  21. * THIS SOFTWARE IS PROVIDED ``AS IS'' AND ANY EXPRESS OR IMPLIED
  22. * WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES
  23. * OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
  24. * DISCLAIMED. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT,
  25. * INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES
  26. * (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR
  27. * SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
  28. * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT,
  29. * STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
  30. * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED
  31. * OF THE POSSIBILITY OF SUCH DAMAGE.
  32. */
  33. /*
  34. * Check remember handling
  35. * Change ten times the password
  36. * Try the ten passwords again, should always be rejected
  37. * Try a new password, should succeed
  38. */
  39. #ifdef HAVE_CONFIG_H
  40. #include <config.h>
  41. #endif
  42. #include <stdio.h>
  43. #include <stdlib.h>
  44. #include <string.h>
  45. #include <security/pam_appl.h>
  46. #include "pam_inline.h"
  47. static unsigned int in_test;
  48. static const char *passwords[] = {
  49. "pamhistory01", "pamhistory02", "pamhistory03",
  50. "pamhistory04", "pamhistory05", "pamhistory06",
  51. "pamhistory07", "pamhistory08", "pamhistory09",
  52. "pamhistory10",
  53. "pamhistory01", "pamhistory02", "pamhistory03",
  54. "pamhistory04", "pamhistory05", "pamhistory06",
  55. "pamhistory07", "pamhistory08", "pamhistory09",
  56. "pamhistory10",
  57. "pamhistory11",
  58. "pamhistory01", "pamhistory02", "pamhistory03",
  59. "pamhistory04", "pamhistory05", "pamhistory06",
  60. "pamhistory07", "pamhistory08", "pamhistory09",
  61. "pamhistory10"};
  62. static int debug;
  63. /* A conversation function which uses an internally-stored value for
  64. the responses. */
  65. static int
  66. fake_conv (int num_msg, const struct pam_message **msgm,
  67. struct pam_response **response, void *appdata_ptr UNUSED)
  68. {
  69. struct pam_response *reply;
  70. int count;
  71. /* Sanity test. */
  72. if (num_msg <= 0)
  73. return PAM_CONV_ERR;
  74. if (debug)
  75. fprintf (stderr, "msg_style=%d, msg=%s\n", msgm[0]->msg_style,
  76. msgm[0]->msg);
  77. if (msgm[0]->msg_style != 1)
  78. return PAM_SUCCESS;
  79. /* Allocate memory for the responses. */
  80. reply = calloc (num_msg, sizeof (struct pam_response));
  81. if (reply == NULL)
  82. return PAM_CONV_ERR;
  83. /* Each prompt elicits the same response. */
  84. for (count = 0; count < num_msg; ++count)
  85. {
  86. reply[count].resp_retcode = 0;
  87. reply[count].resp = strdup (passwords[in_test]);
  88. if (debug)
  89. fprintf (stderr, "send password %s\n", reply[count].resp);
  90. }
  91. /* Set the pointers in the response structure and return. */
  92. *response = reply;
  93. return PAM_SUCCESS;
  94. }
  95. static struct pam_conv conv = {
  96. fake_conv,
  97. NULL
  98. };
  99. int
  100. main(int argc, char *argv[])
  101. {
  102. pam_handle_t *pamh=NULL;
  103. const char *user="tstpampwhistory";
  104. int retval;
  105. if (argc > 1 && strcmp (argv[1], "-d") == 0)
  106. debug = 1;
  107. for (in_test = 0; in_test < PAM_ARRAY_SIZE(passwords); in_test++)
  108. {
  109. retval = pam_start("tst-pam_pwhistory1", user, &conv, &pamh);
  110. if (retval != PAM_SUCCESS)
  111. {
  112. if (debug)
  113. fprintf (stderr, "pwhistory1-%u: pam_start returned %d\n",
  114. in_test, retval);
  115. return 1;
  116. }
  117. retval = pam_chauthtok (pamh, 0);
  118. if (in_test < 10 || in_test == 20)
  119. {
  120. if (retval != PAM_SUCCESS)
  121. {
  122. if (debug)
  123. fprintf (stderr, "pwhistory1-%u: pam_chauthtok returned %d\n",
  124. in_test, retval);
  125. return 1;
  126. }
  127. }
  128. else if (in_test < 20)
  129. {
  130. if (retval != PAM_MAXTRIES)
  131. {
  132. if (debug)
  133. fprintf (stderr, "pwhistory1-%u: pam_chauthtok returned %d\n",
  134. in_test, retval);
  135. return 1;
  136. }
  137. }
  138. retval = pam_end (pamh,retval);
  139. if (retval != PAM_SUCCESS)
  140. {
  141. if (debug)
  142. fprintf (stderr, "pwhistory1: pam_end returned %d\n", retval);
  143. return 1;
  144. }
  145. }
  146. return 0;
  147. }