d/freebsd-dev
1
0
Fork 0
Code Issues Pull Requests Packages Projects Releases Wiki Activity
0773ff183a
freebsd-dev/libexec/mknetid/hash.h

55 lines
2.2 KiB
C
Raw Normal View History

(This import had better work correctly or so help me I'll move to the Himalayas and become a hermit.) Import new mknetid program. This replaces the crufty, soon to be defunct mknetid script packaged with ypserv. This program parses the group, passwd, hosts and netid databases into the netid.byname map. Duplicate checking is performed using hash tables. Testing on my 486DX2/66 with FreeBSD 2.1.0 showed that this program can process a 30,000-entry passwd database into a netid map (along with assorted group and hosts information) in about 22 seconds. On my SPARC IPX with SunOS 4.1.3, it takes about 15 seconds. This compares favorably with the SunOS mknetid program, which parses the same database(s) in 13 seconds. (With smaller databases, my program is actually slightly faster. Go figure.)
1996-06-25 20:26:38 +00:00
/*
Improve performance with very large user databases by increasing hash table size from 256 to 1024. Generate output that looks more like the SunOS mknetid: uses a space instead of tabs for white space. Fix typo in comment in hash.h: Groupit -> Groupid.
1996-06-27 05:42:01 +00:00
* Copyright (c) 1995, 1996
(This import had better work correctly or so help me I'll move to the Himalayas and become a hermit.) Import new mknetid program. This replaces the crufty, soon to be defunct mknetid script packaged with ypserv. This program parses the group, passwd, hosts and netid databases into the netid.byname map. Duplicate checking is performed using hash tables. Testing on my 486DX2/66 with FreeBSD 2.1.0 showed that this program can process a 30,000-entry passwd database into a netid map (along with assorted group and hosts information) in about 22 seconds. On my SPARC IPX with SunOS 4.1.3, it takes about 15 seconds. This compares favorably with the SunOS mknetid program, which parses the same database(s) in 13 seconds. (With smaller databases, my program is actually slightly faster. Go figure.)
1996-06-25 20:26:38 +00:00
* Bill Paul <wpaul@ctr.columbia.edu>. All rights reserved.
*
* 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, this list of conditions and the following disclaimer.
* 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. All advertising materials mentioning features or use of this software
* must display the following acknowledgement:
* This product includes software developed by Bill Paul.
* 4. Neither the name of the author nor the names of any co-contributors
* may be used to endorse or promote products derived from this software
* without specific prior written permission.
*
* THIS SOFTWARE IS PROVIDED BY Bill Paul AND CONTRIBUTORS ``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 Bill Paul OR CONTRIBUTORS 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.
*
$Id$ -> $FreeBSD$
1999-08-28 00:22:10 +00:00
* $FreeBSD$
(This import had better work correctly or so help me I'll move to the Himalayas and become a hermit.) Import new mknetid program. This replaces the crufty, soon to be defunct mknetid script packaged with ypserv. This program parses the group, passwd, hosts and netid databases into the netid.byname map. Duplicate checking is performed using hash tables. Testing on my 486DX2/66 with FreeBSD 2.1.0 showed that this program can process a 30,000-entry passwd database into a netid map (along with assorted group and hosts information) in about 22 seconds. On my SPARC IPX with SunOS 4.1.3, it takes about 15 seconds. This compares favorably with the SunOS mknetid program, which parses the same database(s) in 13 seconds. (With smaller databases, my program is actually slightly faster. Go figure.)
1996-06-25 20:26:38 +00:00
*/
Improve performance with very large user databases by increasing hash table size from 256 to 1024. Generate output that looks more like the SunOS mknetid: uses a space instead of tabs for white space. Fix typo in comment in hash.h: Groupit -> Groupid.
1996-06-27 05:42:01 +00:00
/* Groupid entry hung off a member_entry node. */
(This import had better work correctly or so help me I'll move to the Himalayas and become a hermit.) Import new mknetid program. This replaces the crufty, soon to be defunct mknetid script packaged with ypserv. This program parses the group, passwd, hosts and netid databases into the netid.byname map. Duplicate checking is performed using hash tables. Testing on my 486DX2/66 with FreeBSD 2.1.0 showed that this program can process a 30,000-entry passwd database into a netid map (along with assorted group and hosts information) in about 22 seconds. On my SPARC IPX with SunOS 4.1.3, it takes about 15 seconds. This compares favorably with the SunOS mknetid program, which parses the same database(s) in 13 seconds. (With smaller databases, my program is actually slightly faster. Go figure.)
1996-06-25 20:26:38 +00:00
struct grouplist {
gid_t groupid;
struct grouplist *next;
};
/* Entry in the cooked member list hash table. */
struct member_entry {
char *key; /* username */
struct grouplist *groups;
struct member_entry *next;
};
/* Table size (chosen arbitrarily). Not too big, not too small. */
Improve performance with very large user databases by increasing hash table size from 256 to 1024. Generate output that looks more like the SunOS mknetid: uses a space instead of tabs for white space. Fix typo in comment in hash.h: Groupit -> Groupid.
1996-06-27 05:42:01 +00:00
#define TABLESIZE 1024
#define HASH_MASK 0x000003FF
(This import had better work correctly or so help me I'll move to the Himalayas and become a hermit.) Import new mknetid program. This replaces the crufty, soon to be defunct mknetid script packaged with ypserv. This program parses the group, passwd, hosts and netid databases into the netid.byname map. Duplicate checking is performed using hash tables. Testing on my 486DX2/66 with FreeBSD 2.1.0 showed that this program can process a 30,000-entry passwd database into a netid map (along with assorted group and hosts information) in about 22 seconds. On my SPARC IPX with SunOS 4.1.3, it takes about 15 seconds. This compares favorably with the SunOS mknetid program, which parses the same database(s) in 13 seconds. (With smaller databases, my program is actually slightly faster. Go figure.)
1996-06-25 20:26:38 +00:00
o __P removal o use Ansi-style function definitions
2002-02-17 19:09:20 +00:00
extern void mstore(struct member_entry ** , char *, int, int);
extern struct grouplist *lookup(struct member_entry **, char *);
(This import had better work correctly or so help me I'll move to the Himalayas and become a hermit.) Import new mknetid program. This replaces the crufty, soon to be defunct mknetid script packaged with ypserv. This program parses the group, passwd, hosts and netid databases into the netid.byname map. Duplicate checking is performed using hash tables. Testing on my 486DX2/66 with FreeBSD 2.1.0 showed that this program can process a 30,000-entry passwd database into a netid map (along with assorted group and hosts information) in about 22 seconds. On my SPARC IPX with SunOS 4.1.3, it takes about 15 seconds. This compares favorably with the SunOS mknetid program, which parses the same database(s) in 13 seconds. (With smaller databases, my program is actually slightly faster. Go figure.)
1996-06-25 20:26:38 +00:00
Reference in New Issue Copy Permalink