Mercurial > mplayer.hg
view gui/util/list.c @ 34675:45b2c7bbec60
Revise listMgr() command PLAYLIST_ITEM_INSERT.
Remove unnecessary variable curr.
Additionally, some cosmetic formatting changes.
author | ib |
---|---|
date | Thu, 23 Feb 2012 12:25:57 +0000 |
parents | a99f159b137d |
children | 207272df4aef |
line wrap: on
line source
/* * This file is part of MPlayer. * * MPlayer 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. * * MPlayer 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 MPlayer; if not, write to the Free Software Foundation, Inc., * 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA. */ #include <stdlib.h> #include <string.h> #include "list.h" #include "string.h" static plItem *plList; static plItem *plCurrent; static urlItem *urlList; void *listMgr(int cmd, void *data) { plItem *pdat = (plItem *)data; urlItem *udat = (urlItem *)data; int is_added = 1; switch (cmd) { // playlist case PLAYLIST_GET: return plList; case PLAYLIST_ITEM_ADD: if (plList) { plItem *item = plList; while (item->next) item = item->next; item->next = pdat; pdat->prev = item; pdat->next = NULL; } else { pdat->next = pdat->prev = NULL; plCurrent = plList = pdat; } return plCurrent; case PLAYLIST_ITEM_INSERT: if (plCurrent) { pdat->next = plCurrent->next; if (pdat->next) pdat->next->prev = pdat; pdat->prev = plCurrent; plCurrent->next = pdat; plCurrent = pdat; return plCurrent; } else return listMgr(PLAYLIST_ITEM_ADD, pdat); case PLAYLIST_ITEM_GET_NEXT: if (plCurrent && plCurrent->next) { plCurrent = plCurrent->next; // if (!plCurrent && plList) // { // plItem *next = plList; // // while (next->next) // { // if (!next->next) break; // next = next->next; // } // // plCurrent = next; // } return plCurrent; } return NULL; case PLAYLIST_ITEM_GET_PREV: if (plCurrent && plCurrent->prev) { plCurrent = plCurrent->prev; // if ( !plCurrent && plList ) plCurrent=plList; return plCurrent; } return NULL; case PLAYLIST_ITEM_SET_CURR: plCurrent = pdat; return plCurrent; case PLAYLIST_ITEM_GET_CURR: return plCurrent; case PLAYLIST_ITEM_DEL_CURR: { plItem *curr = plCurrent; if (!curr) return NULL; if (curr->prev) curr->prev->next = curr->next; if (curr->next) curr->next->prev = curr->prev; if (curr == plList) plList = curr->next; plCurrent = curr->next; free(curr->path); free(curr->name); free(curr); } //uiCurr(); // instead of using uiNext && uiPrev return plCurrent; case PLAYLIST_DELETE: while (plList) { plItem *item = plList->next; free(plList->path); free(plList->name); free(plList); plList = item; } plCurrent = NULL; return NULL; // url list case URLLIST_GET: return urlList; case URLLIST_ITEM_ADD: if (urlList) { urlItem *item = urlList; is_added = 0; while (item->next) { if (!gstrcmp(item->url, udat->url)) { is_added = 1; break; } item = item->next; } if (!is_added && gstrcmp(item->url, udat->url)) item->next = udat; } else { udat->next = NULL; urlList = udat; } return NULL; case URLLIST_DELETE: while (urlList) { urlItem *item = urlList->next; free(urlList->url); free(urlList); urlList = item; } return NULL; } return NULL; } /** * @brief Set list to @a entry. * * @param list pointer to the char pointer list * @param entry the new (and only) element of the list * * @note Actually, a new list will be created and the old list will be freed. */ void listSet(char ***list, const char *entry) { if (*list) { char **l = *list; while (*l) { free(*l); l++; } free(*list); } *list = malloc(2 * sizeof(char *)); if (*list) { (*list)[0] = gstrdup(entry); (*list)[1] = NULL; } } /** * @brief Replace the first element in list that starts with @a search. * * @note If no such element is found, @a replace will be appended. * * @param list pointer to the char pointer list * @param search element to search * @param replace replacement element */ void listRepl(char ***list, const char *search, const char *replace) { int i = 0; char **org = *list; if (!replace) return; if (*list) { size_t len = (search ? strlen(search) : 0); for (i = 0; (*list)[i]; i++) { if (gstrncmp((*list)[i], search, len) == 0) { free((*list)[i]); (*list)[i] = strdup(replace); return; } } *list = realloc(*list, (i + 2) * sizeof(char *)); } else *list = malloc(2 * sizeof(char *)); if (!*list) { *list = org; return; } (*list)[i] = strdup(replace); (*list)[i + 1] = NULL; }