Eric Andersen | aad1a88 | 2001-03-16 22:47:14 +0000 | [diff] [blame^] | 1 | /* vi: set sw=4 ts=4: */ |
| 2 | /* |
| 3 | * Utility routines. |
| 4 | * |
| 5 | * Copyright (C) tons of folks. Tracking down who wrote what |
| 6 | * isn't something I'm going to worry about... If you wrote something |
| 7 | * here, please feel free to acknowledge your work. |
| 8 | * |
| 9 | * This program is free software; you can redistribute it and/or modify |
| 10 | * it under the terms of the GNU General Public License as published by |
| 11 | * the Free Software Foundation; either version 2 of the License, or |
| 12 | * (at your option) any later version. |
| 13 | * |
| 14 | * This program is distributed in the hope that it will be useful, |
| 15 | * but WITHOUT ANY WARRANTY; without even the implied warranty of |
| 16 | * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU |
| 17 | * General Public License for more details. |
| 18 | * |
| 19 | * You should have received a copy of the GNU General Public License |
| 20 | * along with this program; if not, write to the Free Software |
| 21 | * Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA |
| 22 | * |
| 23 | * Based in part on code from sash, Copyright (c) 1999 by David I. Bell |
| 24 | * Permission has been granted to redistribute this code under the GPL. |
| 25 | * |
| 26 | */ |
| 27 | |
| 28 | #include <stdio.h> |
| 29 | #include <stdlib.h> |
| 30 | #include "libbb.h" |
| 31 | |
| 32 | #define HASH_SIZE 311 /* Should be prime */ |
| 33 | #define hash_inode(i) ((i) % HASH_SIZE) |
| 34 | |
| 35 | static ino_dev_hashtable_bucket_t *ino_dev_hashtable[HASH_SIZE]; |
| 36 | |
| 37 | /* |
| 38 | * Return 1 if statbuf->st_ino && statbuf->st_dev are recorded in |
| 39 | * `ino_dev_hashtable', else return 0 |
| 40 | * |
| 41 | * If NAME is a non-NULL pointer to a character pointer, and there is |
| 42 | * a match, then set *NAME to the value of the name slot in that |
| 43 | * bucket. |
| 44 | */ |
| 45 | int is_in_ino_dev_hashtable(const struct stat *statbuf, char **name) |
| 46 | { |
| 47 | ino_dev_hashtable_bucket_t *bucket; |
| 48 | |
| 49 | bucket = ino_dev_hashtable[hash_inode(statbuf->st_ino)]; |
| 50 | while (bucket != NULL) { |
| 51 | if ((bucket->ino == statbuf->st_ino) && |
| 52 | (bucket->dev == statbuf->st_dev)) |
| 53 | { |
| 54 | if (name) *name = bucket->name; |
| 55 | return 1; |
| 56 | } |
| 57 | bucket = bucket->next; |
| 58 | } |
| 59 | return 0; |
| 60 | } |
| 61 | |
| 62 | /* Add statbuf to statbuf hash table */ |
| 63 | void add_to_ino_dev_hashtable(const struct stat *statbuf, const char *name) |
| 64 | { |
| 65 | int i; |
| 66 | size_t s; |
| 67 | ino_dev_hashtable_bucket_t *bucket; |
| 68 | |
| 69 | i = hash_inode(statbuf->st_ino); |
| 70 | s = name ? strlen(name) : 0; |
| 71 | bucket = xmalloc(sizeof(ino_dev_hashtable_bucket_t) + s); |
| 72 | bucket->ino = statbuf->st_ino; |
| 73 | bucket->dev = statbuf->st_dev; |
| 74 | if (name) |
| 75 | strcpy(bucket->name, name); |
| 76 | else |
| 77 | bucket->name[0] = '\0'; |
| 78 | bucket->next = ino_dev_hashtable[i]; |
| 79 | ino_dev_hashtable[i] = bucket; |
| 80 | } |
| 81 | |
| 82 | /* Clear statbuf hash table */ |
| 83 | void reset_ino_dev_hashtable(void) |
| 84 | { |
| 85 | int i; |
| 86 | ino_dev_hashtable_bucket_t *bucket; |
| 87 | |
| 88 | for (i = 0; i < HASH_SIZE; i++) { |
| 89 | while (ino_dev_hashtable[i] != NULL) { |
| 90 | bucket = ino_dev_hashtable[i]->next; |
| 91 | free(ino_dev_hashtable[i]); |
| 92 | ino_dev_hashtable[i] = bucket; |
| 93 | } |
| 94 | } |
| 95 | } |
| 96 | |
| 97 | |
| 98 | /* END CODE */ |
| 99 | /* |
| 100 | Local Variables: |
| 101 | c-file-style: "linux" |
| 102 | c-basic-offset: 4 |
| 103 | tab-width: 4 |
| 104 | End: |
| 105 | */ |