head	1.2;
access;
symbols
	morgan_0_75:1.1.1.2
	pam_unpruned:1.1.1.1
	morgan_0_65:1.1.1.1
	MORGAN:1.1.1;
locks; strict;
comment	@# @;


1.2
date	98.11.25.19.45.53;	author jdp;	state dead;
branches;
next	1.1;

1.1
date	98.11.18.01.16.20;	author jdp;	state Exp;
branches
	1.1.1.1;
next	;

1.1.1.1
date	98.11.18.01.16.20;	author jdp;	state Exp;
branches;
next	1.1.1.2;

1.1.1.2
date	2001.05.03.09.36.05;	author markm;	state Exp;
branches;
next	;


desc
@@


1.2
log
@Remove files that we don't use and are unlikely to use.  You can
still get them with "cvs upd -r pam_unpruned" if you want to look at
them.
@
text
@
pam_cracklib:
	check the passwd against dictionary words.

RECOGNIZED ARGUMENTS:
	debug		verbose log

	type=XXX	alter the message printed as a prompt to the user.
			the message printed is in the form
			"New XXX password: ".
			Default XXX=UNIX

	retry=N		Prompt user at most N times before returning with
			error. Default N=1.

MODULE SERVICES PROVIDED:
	passwd		chauthtok

AUTHOR:
	Cristian Gafton <gafton@@sorosis.ro>

@


1.1
log
@Initial revision
@
text
@@


1.1.1.1
log
@Initial import of virgin Linux-PAM 0.65, slightly stripped down.
@
text
@@


1.1.1.2
log
@Vendor import Linux PAM 0.75
@
text
@a15 16
	difok=N         How many characters can be the same in the new
			password relative to the old
	difignore=N	How many characters long should the password be
			before we ignore difok.

	minlen=N	The minimum simplicity count for a good password.

	dcredit=N
	ucredit=N
	lcredit=N
	ocredit=N 	Weight, digits, upper, lower, other characters with
			count N. Use these values to compute the
			'unsimplicity' of the password.

	use_authtok	Get the proposed password from PAM_AUTHTOK

d20 1
a20 1
	Cristian Gafton <gafton@@redhat.com>
@

