47 	hash_node_t *node;  in nsc_insert_node()  local
49 	node = (hash_node_t *)malloc(sizeof (hash_node_t));  in nsc_insert_node()
50 	if (!node) {  in nsc_insert_node()
53 	node->key = strdup(key);  in nsc_insert_node()
54 	node->data = data;  in nsc_insert_node()
61 	node->next = hash[ index ];  in nsc_insert_node()
62 	hash[ index ] = node;  in nsc_insert_node()
81 	hash_node_t *node;  in nsc_lookup()  local
84 	node = hash[ index ];  in nsc_lookup()
85 	while (node) {  in nsc_lookup()
86 		if (strcmp(node->key, key) == 0)  in nsc_lookup()
87 			return (node->data);  in nsc_lookup()
88 		node = node->next;  in nsc_lookup()
97 	hash_node_t *node, *prev;  in nsc_remove_node()  local
106 		node = hash[ index ];  in nsc_remove_node()
107 		retval = node->data;  in nsc_remove_node()
109 		free(node->key);  in nsc_remove_node()
110 		free(node);  in nsc_remove_node()
114 	node = prev->next;  in nsc_remove_node()
115 	while (node && (strcmp(node->key, key) != 0)) {  in nsc_remove_node()
116 		prev = node;  in nsc_remove_node()
117 		node = node->next;  in nsc_remove_node()
121 	if (node) {  in nsc_remove_node()
122 		prev->next = node->next;  in nsc_remove_node()
123 		retval = node->data;  in nsc_remove_node()
124 		free(node->key);  in nsc_remove_node()
125 		free(node);  in nsc_remove_node()