Artifact e55efe4a5c7fcb55e1fcbbb3188db21b0bd61e4acfad369aff6f30e68ca16726:
- File search.c — part of check-in [c14cf350df] at 2014-05-15 21:36:21 on branch manualheaven — Move src and doc files to top directory (user: base@atomicules.co.uk size: 6005) [more...]
- File src/search.c — part of check-in [f05023e8f3] at 2011-02-15 22:24:16 on branch origin/tweaks — Tweak search internals to always track the parent of items, and use this to allow locating of search entries git-svn-id: https://pwman.svn.sourceforge.net/svnroot/pwman/trunk@121 db5f1c25-4851-472e-ac1e-5437d07aece1 (user: gagravarr@users.sourceforge.net size: 6005)
/* * PWMan - password management application * * Copyright (C) 2002 Ivan Kelly <ivan@ivankelly.net> * * This program is free software; you can redistribute it and/or modify * it under the terms of the GNU General Public License as published by * the Free Software Foundation; either version 2 of the License, or * (at your option) any later version. * * This program is distributed in the hope that it will be useful, * but WITHOUT ANY WARRANTY; without even the implied warranty of * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the * GNU General Public License for more details. * * You should have received a copy of the GNU General Public License * along with this program; if not, write to the Free Software * Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA */ #include <stdlib.h> #include <string.h> #include <pwman.h> #include <ui.h> /*xtern int curitem;*/ PwSearch * search_new() { PwSearch *new; new = malloc(sizeof(PwSearch)); if(new == NULL) { pw_abort("Failed to allocate memory to hold search details!"); } new->search_term = malloc(STRING_LONG); if(new->search_term == NULL) { pw_abort("Failed to allocate memory to hold search term!"); } new->search_term[0] = 0; return new; } /* * String checking only case insensitive using gnu glibc */ static char* search_strcasestr(char *haystack, char *needle){ // Never matches if null/empty string given if(haystack == NULL) { return 0; } if(strlen(haystack) == 0) { return 0; } #ifdef HAVE_STRCASESTR return (char*)strcasestr(haystack, needle); #else return (char*)strstr(haystack, needle); #endif } PWSearchResult* _search_add_if_matches(PWSearchResult* current, Pw* entry, PWList* list) { PWSearchResult* next = NULL; // Did we get an entry of a list? if(entry != NULL) { if(search_strcasestr(entry->name, options->search->search_term) || search_strcasestr(entry->host, options->search->search_term) || search_strcasestr(entry->user, options->search->search_term) || search_strcasestr(entry->passwd, options->search->search_term) || search_strcasestr(entry->launch, options->search->search_term) ) { next = malloc( sizeof(PWSearchResult) ); next->entry = entry; next->sublist = list; debug("Matched entry on host '%s'", entry->host); } } else { if(search_strcasestr(list->name, options->search->search_term)) { next = malloc( sizeof(PWSearchResult) ); next->sublist = list; next->entry = NULL; debug("Matched sublist '%s'", list->name); } } // If we matched, append if(next == NULL) { return current; } else { if(current == NULL) { // First hit search_results = next; } else { // Additional hit, append current->next = next; } // For now, nothing follows us next->next = NULL; // We are the new current entry return next; } } int search_apply() { PWList *stack[MAX_SEARCH_DEPTH]; PWList *tmpList = NULL; Pw *tmp = NULL; int depth; int stepping_back; PWSearchResult *cur = NULL; // Tidy up any existing search results if(search_results != NULL) { _search_free(); } // If no search term, then nothing to do! if( search_active(options->search) == 0 ) { return 1; } // Make sure we have a clean search stack so we won't get confused for(depth=0; depth<MAX_SEARCH_DEPTH; depth++) { stack[depth] = NULL; } // Setup for start depth = 0; tmpList = pwlist; stepping_back = 0; // Find anything we like the look of while(depth >= 0) { // Any sublists? if(!stepping_back && tmpList->sublists != NULL && depth < MAX_SEARCH_DEPTH) { // Prepare to descend stack[depth] = tmpList; depth++; tmpList = tmpList->sublists; // Test first child cur = _search_add_if_matches(cur, NULL, tmpList); // Descend into first child continue; } stepping_back = 0; // Any entries? if(tmpList->list) { tmp = tmpList->list; while(tmp != NULL) { // Test this entry cur = _search_add_if_matches(cur, tmp, tmpList); // Next entry tmp = tmp->next; } } // Next sibling if there is one if(tmpList->next != NULL) { tmpList = tmpList->next; // Test sibling cur = _search_add_if_matches(cur, NULL, tmpList); // Process sibling continue; } // Otherwise step up depth--; stepping_back = 1; if(depth >= 0) { tmpList = stack[depth]; stack[depth] = NULL; } } // All done return 1; } int search_remove() { // Put things back how they should have been current_pw_sublist = pwlist; current_pw_sublist->current_item = -1; // Free the memory held by the search results _search_free(); // Clear the search term too options->search->search_term[0] = 0; // Back to the old screen uilist_refresh(); } int _search_free() { PWSearchResult *cur; PWSearchResult *next; // Free the memory held by the search results cur = search_results; while(cur != NULL) { next = cur->next; free(cur); cur = next; } search_results = NULL; } void search_get() { char c; if(options->search == NULL) { debug("No options->search"); } else { if(options->search->search_term == NULL) { debug("No options->search->search_term"); } else { debug("Len was %d", strlen(options->search->search_term)); } } ui_statusline_ask_str("String to search for: ", options->search->search_term, STRING_MEDIUM); search_apply(); current_pw_sublist->current_item = -1; uilist_refresh(); } int search_alert(PwSearch* srch) { char alert[80]; if( search_active(srch) == 0 ) { return 1; } if(search_results == NULL) { sprintf(alert, " (No results found for '%s')", srch->search_term); } else { sprintf(alert, " (Search results for '%s')", srch->search_term); } ui_statusline_clear(); ui_statusline_msg(alert); } int search_active(PwSearch* srch) { if( (srch == NULL) || (srch->search_term == NULL) ){ /* no search object */ return 0; } if( strlen(srch->search_term) == 0 ){ /* no search */ return 0; } return 1; }