Logo Search packages:      
Sourcecode: scummvm version File versions  Download package

archive.cpp

/* ScummVM - Graphic Adventure Engine
 *
 * ScummVM is the legal property of its developers, whose names
 * are too numerous to list here. Please refer to the COPYRIGHT
 * file distributed with this source distribution.
 *
 * 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., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301, USA.
 *
 * $URL: https://scummvm.svn.sourceforge.net/svnroot/scummvm/scummvm/tags/release-1-1-0/common/archive.cpp $
 * $Id: archive.cpp 46048 2009-11-21 20:26:55Z lordhoto $
 *
 */

#include "common/archive.h"
#include "common/fs.h"
#include "common/util.h"
#include "common/system.h"

namespace Common {

GenericArchiveMember::GenericArchiveMember(String name, Archive *parent)
      : _parent(parent), _name(name) {
}

String GenericArchiveMember::getName() const {
      return _name;
}

SeekableReadStream *GenericArchiveMember::createReadStream() const {
      return _parent->createReadStreamForMember(_name);
}


00046 int Archive::listMatchingMembers(ArchiveMemberList &list, const String &pattern) {
      // Get all "names" (TODO: "files" ?)
      ArchiveMemberList allNames;
      listMembers(allNames);

      int matches = 0;

      ArchiveMemberList::iterator it = allNames.begin();
      for ( ; it != allNames.end(); ++it) {
            // TODO: We match case-insenstivie for now, our API does not define whether that's ok or not though...
            // For our use case case-insensitive is probably what we want to have though.
            if ((*it)->getName().matchString(pattern, true, true)) {
                  list.push_back(*it);
                  matches++;
            }
      }

      return matches;
}



SearchSet::ArchiveNodeList::iterator SearchSet::find(const String &name) {
      ArchiveNodeList::iterator it = _list.begin();
      for ( ; it != _list.end(); ++it) {
            if (it->_name == name)
                  break;
      }
      return it;
}

SearchSet::ArchiveNodeList::const_iterator SearchSet::find(const String &name) const {
      ArchiveNodeList::const_iterator it = _list.begin();
      for ( ; it != _list.end(); ++it) {
            if (it->_name == name)
                  break;
      }
      return it;
}

/*
      Keep the nodes sorted according to descending priorities.
      In case two or node nodes have the same priority, insertion
      order prevails.
*/
void SearchSet::insert(const Node &node) {
      ArchiveNodeList::iterator it = _list.begin();
      for ( ; it != _list.end(); ++it) {
            if (it->_priority < node._priority)
                  break;
      }
      _list.insert(it, node);
}

00100 void SearchSet::add(const String &name, Archive *archive, int priority, bool autoFree) {
      if (find(name) == _list.end()) {
            Node node(priority, name, archive, autoFree);
            insert(node);
      } else {
            if (autoFree)
                  delete archive;
            warning("SearchSet::add: archive '%s' already present", name.c_str());
      }

}

00112 void SearchSet::addDirectory(const String &name, const String &directory, int priority, int depth, bool flat) {
      FSNode dir(directory);
      addDirectory(name, dir, priority, depth, flat);
}

00117 void SearchSet::addDirectory(const String &name, const FSNode &dir, int priority, int depth, bool flat) {
      if (!dir.exists() || !dir.isDirectory())
            return;

      add(name, new FSDirectory(dir, depth, flat), priority);
}

00124 void SearchSet::addSubDirectoriesMatching(const FSNode &directory, String origPattern, bool ignoreCase, int priority) {
      FSList subDirs;
      if (!directory.getChildren(subDirs))
            return;

      String nextPattern, pattern;
      String::const_iterator sep = Common::find(origPattern.begin(), origPattern.end(), '/');
      if (sep != origPattern.end()) {
            pattern = String(origPattern.begin(), sep);

            ++sep;
            if (sep != origPattern.end())
                  nextPattern = String(sep, origPattern.end());
      }
      else {
            pattern = origPattern;
      }

      // TODO: The code we have for displaying all matches, which vary only in case, might
      // be a bit overhead, but as long as we want to display all useful information to the
      // user we will need to keep track of all directory names added so far. We might
      // want to reconsider this though.
      typedef HashMap<String, bool, IgnoreCase_Hash, IgnoreCase_EqualTo> MatchList;
      MatchList multipleMatches;
      MatchList::iterator matchIter;

      for (FSList::const_iterator i = subDirs.begin(); i != subDirs.end(); ++i) {
            String name = i->getName();

            if (Common::matchString(name.c_str(), pattern.c_str(), ignoreCase)) {
                  matchIter = multipleMatches.find(name);
                  if (matchIter == multipleMatches.end()) {
                        multipleMatches[name] = true;
                  } else {
                        if (matchIter->_value) {
                              warning("Clash in case for match of pattern \"%s\" found in directory \"%s\": \"%s\"", pattern.c_str(), directory.getPath().c_str(), matchIter->_key.c_str());
                              matchIter->_value = false;
                        }

                        warning("Clash in case for match of pattern \"%s\" found in directory \"%s\": \"%s\"", pattern.c_str(), directory.getPath().c_str(), name.c_str());
                  }

                  if (nextPattern.empty())
                        addDirectory(name, *i, priority);
                  else
                        addSubDirectoriesMatching(*i, nextPattern, ignoreCase, priority);
            }
      }
}

00174 void SearchSet::remove(const String &name) {
      ArchiveNodeList::iterator it = find(name);
      if (it != _list.end()) {
            if (it->_autoFree)
                  delete it->_arc;
            _list.erase(it);
      }
}

00183 bool SearchSet::hasArchive(const String &name) const {
      return (find(name) != _list.end());
}

00187 void SearchSet::clear() {
      for (ArchiveNodeList::iterator i = _list.begin(); i != _list.end(); ++i) {
            if (i->_autoFree)
                  delete i->_arc;
      }

      _list.clear();
}

00196 void SearchSet::setPriority(const String &name, int priority) {
      ArchiveNodeList::iterator it = find(name);
      if (it == _list.end()) {
            warning("SearchSet::setPriority: archive '%s' is not present", name.c_str());
            return;
      }

      if (priority == it->_priority)
            return;

      Node node(*it);
      _list.erase(it);
      node._priority = priority;
      insert(node);
}

00212 bool SearchSet::hasFile(const String &name) {
      if (name.empty())
            return false;

      ArchiveNodeList::iterator it = _list.begin();
      for ( ; it != _list.end(); ++it) {
            if (it->_arc->hasFile(name))
                  return true;
      }

      return false;
}

00225 int SearchSet::listMatchingMembers(ArchiveMemberList &list, const String &pattern) {
      int matches = 0;

      ArchiveNodeList::iterator it = _list.begin();
      for ( ; it != _list.end(); ++it)
            matches += it->_arc->listMatchingMembers(list, pattern);

      return matches;
}

00235 int SearchSet::listMembers(ArchiveMemberList &list) {
      int matches = 0;

      ArchiveNodeList::iterator it = _list.begin();
      for ( ; it != _list.end(); ++it)
            matches += it->_arc->listMembers(list);

      return matches;
}

00245 ArchiveMemberPtr SearchSet::getMember(const String &name) {
      if (name.empty())
            return ArchiveMemberPtr();

      ArchiveNodeList::iterator it = _list.begin();
      for ( ; it != _list.end(); ++it) {
            if (it->_arc->hasFile(name))
                  return it->_arc->getMember(name);
      }

      return ArchiveMemberPtr();
}

00258 SeekableReadStream *SearchSet::createReadStreamForMember(const String &name) const {
      if (name.empty())
            return 0;

      ArchiveNodeList::const_iterator it = _list.begin();
      for ( ; it != _list.end(); ++it) {
            SeekableReadStream *stream = it->_arc->createReadStreamForMember(name);
            if (stream)
                  return stream;
      }

      return 0;
}


DECLARE_SINGLETON(SearchManager);

SearchManager::SearchManager() {
      clear();    // Force a reset
}

void SearchManager::clear() {
      SearchSet::clear();

      // Always keep system specific archives in the SearchManager.
      // But we give them a lower priority than the default priority (which is 0),
      // so that archives added by client code are searched first.
      if (g_system)
            g_system->addSysArchivesToSearchSet(*this, -1);

      // Add the current dir as a very last resort.
      // See also bug #2137680.
      addDirectory(".", ".", -2);
}

} // namespace Common

Generated by  Doxygen 1.6.0   Back to index