2010-11-24 03:19:34 +08:00
|
|
|
//===--- FileManager.cpp - File System Probing and Caching ----------------===//
|
2006-06-18 13:43:12 +08:00
|
|
|
//
|
|
|
|
// The LLVM Compiler Infrastructure
|
|
|
|
//
|
2007-12-30 03:59:25 +08:00
|
|
|
// This file is distributed under the University of Illinois Open Source
|
|
|
|
// License. See LICENSE.TXT for details.
|
2006-06-18 13:43:12 +08:00
|
|
|
//
|
|
|
|
//===----------------------------------------------------------------------===//
|
|
|
|
//
|
|
|
|
// This file implements the FileManager interface.
|
|
|
|
//
|
|
|
|
//===----------------------------------------------------------------------===//
|
|
|
|
//
|
|
|
|
// TODO: This should index all interesting directories with dirent calls.
|
|
|
|
// getdirentries ?
|
|
|
|
// opendir/readdir_r/closedir ?
|
|
|
|
//
|
|
|
|
//===----------------------------------------------------------------------===//
|
|
|
|
|
|
|
|
#include "clang/Basic/FileManager.h"
|
2010-11-24 03:19:34 +08:00
|
|
|
#include "clang/Basic/FileSystemStatCache.h"
|
2006-10-30 11:55:17 +08:00
|
|
|
#include "llvm/ADT/SmallString.h"
|
2012-12-04 17:13:33 +08:00
|
|
|
#include "llvm/Config/llvm-config.h"
|
2010-12-22 00:45:57 +08:00
|
|
|
#include "llvm/Support/FileSystem.h"
|
2010-11-04 06:45:23 +08:00
|
|
|
#include "llvm/Support/MemoryBuffer.h"
|
2010-11-30 02:12:39 +08:00
|
|
|
#include "llvm/Support/Path.h"
|
2012-12-04 17:13:33 +08:00
|
|
|
#include "llvm/Support/raw_ostream.h"
|
2010-12-10 01:36:38 +08:00
|
|
|
#include "llvm/Support/system_error.h"
|
2009-09-05 17:49:39 +08:00
|
|
|
#include <map>
|
|
|
|
#include <set>
|
|
|
|
#include <string>
|
2010-11-24 05:53:15 +08:00
|
|
|
|
|
|
|
// FIXME: This is terrible, we need this for ::close.
|
|
|
|
#if !defined(_MSC_VER) && !defined(__MINGW32__)
|
|
|
|
#include <unistd.h>
|
|
|
|
#include <sys/uio.h>
|
|
|
|
#else
|
|
|
|
#include <io.h>
|
2012-11-07 01:08:24 +08:00
|
|
|
#ifndef S_ISFIFO
|
|
|
|
#define S_ISFIFO(x) (0)
|
|
|
|
#endif
|
2010-11-24 05:53:15 +08:00
|
|
|
#endif
|
2006-06-18 13:43:12 +08:00
|
|
|
using namespace clang;
|
|
|
|
|
|
|
|
// FIXME: Enhance libsystem to support inode and other fields.
|
|
|
|
#include <sys/stat.h>
|
|
|
|
|
2008-01-12 04:42:05 +08:00
|
|
|
/// NON_EXISTENT_DIR - A special value distinct from null that is used to
|
2006-10-30 11:06:54 +08:00
|
|
|
/// represent a dir name that doesn't exist on the disk.
|
2008-01-12 04:42:05 +08:00
|
|
|
#define NON_EXISTENT_DIR reinterpret_cast<DirectoryEntry*>((intptr_t)-1)
|
2006-10-30 11:06:54 +08:00
|
|
|
|
2010-11-24 04:50:22 +08:00
|
|
|
/// NON_EXISTENT_FILE - A special value distinct from null that is used to
|
|
|
|
/// represent a filename that doesn't exist on the disk.
|
|
|
|
#define NON_EXISTENT_FILE reinterpret_cast<FileEntry*>((intptr_t)-1)
|
|
|
|
|
|
|
|
|
|
|
|
FileEntry::~FileEntry() {
|
|
|
|
// If this FileEntry owns an open file descriptor that never got used, close
|
|
|
|
// it.
|
|
|
|
if (FD != -1) ::close(FD);
|
|
|
|
}
|
|
|
|
|
2012-11-06 06:53:33 +08:00
|
|
|
bool FileEntry::isNamedPipe() const {
|
2012-11-07 01:08:24 +08:00
|
|
|
return S_ISFIFO(FileMode);
|
2012-11-06 06:53:33 +08:00
|
|
|
}
|
|
|
|
|
2009-01-28 08:27:31 +08:00
|
|
|
//===----------------------------------------------------------------------===//
|
|
|
|
// Windows.
|
|
|
|
//===----------------------------------------------------------------------===//
|
|
|
|
|
2008-02-24 11:15:25 +08:00
|
|
|
#ifdef LLVM_ON_WIN32
|
|
|
|
|
|
|
|
namespace {
|
2009-09-09 23:08:12 +08:00
|
|
|
static std::string GetFullPath(const char *relPath) {
|
2008-02-24 11:15:25 +08:00
|
|
|
char *absPathStrPtr = _fullpath(NULL, relPath, 0);
|
|
|
|
assert(absPathStrPtr && "_fullpath() returned NULL!");
|
|
|
|
|
|
|
|
std::string absPath(absPathStrPtr);
|
|
|
|
|
|
|
|
free(absPathStrPtr);
|
|
|
|
return absPath;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
class FileManager::UniqueDirContainer {
|
|
|
|
/// UniqueDirs - Cache from full path to existing directories/files.
|
|
|
|
///
|
2009-09-09 23:08:12 +08:00
|
|
|
llvm::StringMap<DirectoryEntry> UniqueDirs;
|
2008-02-24 11:15:25 +08:00
|
|
|
|
|
|
|
public:
|
2011-02-12 02:44:49 +08:00
|
|
|
/// getDirectory - Return an existing DirectoryEntry with the given
|
|
|
|
/// name if there is already one; otherwise create and return a
|
|
|
|
/// default-constructed DirectoryEntry.
|
|
|
|
DirectoryEntry &getDirectory(const char *Name,
|
|
|
|
const struct stat & /*StatBuf*/) {
|
2008-02-24 11:15:25 +08:00
|
|
|
std::string FullPath(GetFullPath(Name));
|
2010-11-24 04:30:42 +08:00
|
|
|
return UniqueDirs.GetOrCreateValue(FullPath).getValue();
|
2008-02-24 11:15:25 +08:00
|
|
|
}
|
2009-09-09 23:08:12 +08:00
|
|
|
|
2010-11-24 04:30:42 +08:00
|
|
|
size_t size() const { return UniqueDirs.size(); }
|
2008-02-24 11:15:25 +08:00
|
|
|
};
|
|
|
|
|
|
|
|
class FileManager::UniqueFileContainer {
|
|
|
|
/// UniqueFiles - Cache from full path to existing directories/files.
|
|
|
|
///
|
2009-01-28 09:01:07 +08:00
|
|
|
llvm::StringMap<FileEntry, llvm::BumpPtrAllocator> UniqueFiles;
|
2008-02-24 11:15:25 +08:00
|
|
|
|
|
|
|
public:
|
2011-02-12 02:44:49 +08:00
|
|
|
/// getFile - Return an existing FileEntry with the given name if
|
|
|
|
/// there is already one; otherwise create and return a
|
|
|
|
/// default-constructed FileEntry.
|
|
|
|
FileEntry &getFile(const char *Name, const struct stat & /*StatBuf*/) {
|
2008-02-24 11:15:25 +08:00
|
|
|
std::string FullPath(GetFullPath(Name));
|
2011-02-12 02:44:49 +08:00
|
|
|
|
2011-11-07 04:36:48 +08:00
|
|
|
// Lowercase string because Windows filesystem is case insensitive.
|
|
|
|
FullPath = StringRef(FullPath).lower();
|
2010-11-24 04:30:42 +08:00
|
|
|
return UniqueFiles.GetOrCreateValue(FullPath).getValue();
|
2008-02-24 11:15:25 +08:00
|
|
|
}
|
|
|
|
|
2010-11-24 04:30:42 +08:00
|
|
|
size_t size() const { return UniqueFiles.size(); }
|
2012-06-27 17:17:42 +08:00
|
|
|
|
2012-07-11 17:41:34 +08:00
|
|
|
void erase(const FileEntry *Entry) {
|
|
|
|
std::string FullPath(GetFullPath(Entry->getName()));
|
|
|
|
|
|
|
|
// Lowercase string because Windows filesystem is case insensitive.
|
|
|
|
FullPath = StringRef(FullPath).lower();
|
|
|
|
UniqueFiles.erase(FullPath);
|
|
|
|
}
|
2008-02-24 11:15:25 +08:00
|
|
|
};
|
|
|
|
|
2009-01-28 08:27:31 +08:00
|
|
|
//===----------------------------------------------------------------------===//
|
|
|
|
// Unix-like Systems.
|
|
|
|
//===----------------------------------------------------------------------===//
|
|
|
|
|
2008-02-24 11:15:25 +08:00
|
|
|
#else
|
|
|
|
|
|
|
|
class FileManager::UniqueDirContainer {
|
|
|
|
/// UniqueDirs - Cache from ID's to existing directories/files.
|
2009-09-09 23:08:12 +08:00
|
|
|
std::map<std::pair<dev_t, ino_t>, DirectoryEntry> UniqueDirs;
|
2008-02-24 11:15:25 +08:00
|
|
|
|
|
|
|
public:
|
2011-02-12 02:44:49 +08:00
|
|
|
/// getDirectory - Return an existing DirectoryEntry with the given
|
|
|
|
/// ID's if there is already one; otherwise create and return a
|
|
|
|
/// default-constructed DirectoryEntry.
|
|
|
|
DirectoryEntry &getDirectory(const char * /*Name*/,
|
|
|
|
const struct stat &StatBuf) {
|
2008-02-24 11:15:25 +08:00
|
|
|
return UniqueDirs[std::make_pair(StatBuf.st_dev, StatBuf.st_ino)];
|
|
|
|
}
|
|
|
|
|
2010-11-24 04:30:42 +08:00
|
|
|
size_t size() const { return UniqueDirs.size(); }
|
2008-02-24 11:15:25 +08:00
|
|
|
};
|
|
|
|
|
|
|
|
class FileManager::UniqueFileContainer {
|
|
|
|
/// UniqueFiles - Cache from ID's to existing directories/files.
|
|
|
|
std::set<FileEntry> UniqueFiles;
|
|
|
|
|
|
|
|
public:
|
2011-02-12 02:44:49 +08:00
|
|
|
/// getFile - Return an existing FileEntry with the given ID's if
|
|
|
|
/// there is already one; otherwise create and return a
|
|
|
|
/// default-constructed FileEntry.
|
|
|
|
FileEntry &getFile(const char * /*Name*/, const struct stat &StatBuf) {
|
2008-02-24 11:15:25 +08:00
|
|
|
return
|
|
|
|
const_cast<FileEntry&>(
|
|
|
|
*UniqueFiles.insert(FileEntry(StatBuf.st_dev,
|
2009-02-12 11:17:57 +08:00
|
|
|
StatBuf.st_ino,
|
|
|
|
StatBuf.st_mode)).first);
|
2008-02-24 11:15:25 +08:00
|
|
|
}
|
|
|
|
|
2010-11-24 04:30:42 +08:00
|
|
|
size_t size() const { return UniqueFiles.size(); }
|
2012-06-27 17:17:42 +08:00
|
|
|
|
2012-07-11 00:50:27 +08:00
|
|
|
void erase(const FileEntry *Entry) { UniqueFiles.erase(*Entry); }
|
2008-02-24 11:15:25 +08:00
|
|
|
};
|
|
|
|
|
|
|
|
#endif
|
|
|
|
|
2009-01-28 08:27:31 +08:00
|
|
|
//===----------------------------------------------------------------------===//
|
|
|
|
// Common logic.
|
|
|
|
//===----------------------------------------------------------------------===//
|
2008-02-24 11:15:25 +08:00
|
|
|
|
2010-11-23 15:51:02 +08:00
|
|
|
FileManager::FileManager(const FileSystemOptions &FSO)
|
|
|
|
: FileSystemOpts(FSO),
|
2011-02-12 02:44:49 +08:00
|
|
|
UniqueRealDirs(*new UniqueDirContainer()),
|
|
|
|
UniqueRealFiles(*new UniqueFileContainer()),
|
|
|
|
SeenDirEntries(64), SeenFileEntries(64), NextFileUID(0) {
|
2008-02-24 11:15:25 +08:00
|
|
|
NumDirLookups = NumFileLookups = 0;
|
|
|
|
NumDirCacheMisses = NumFileCacheMisses = 0;
|
|
|
|
}
|
|
|
|
|
|
|
|
FileManager::~FileManager() {
|
2011-02-12 02:44:49 +08:00
|
|
|
delete &UniqueRealDirs;
|
|
|
|
delete &UniqueRealFiles;
|
2010-11-24 04:30:42 +08:00
|
|
|
for (unsigned i = 0, e = VirtualFileEntries.size(); i != e; ++i)
|
|
|
|
delete VirtualFileEntries[i];
|
2011-02-12 02:44:49 +08:00
|
|
|
for (unsigned i = 0, e = VirtualDirectoryEntries.size(); i != e; ++i)
|
|
|
|
delete VirtualDirectoryEntries[i];
|
2008-02-24 11:15:25 +08:00
|
|
|
}
|
|
|
|
|
2010-11-24 03:19:34 +08:00
|
|
|
void FileManager::addStatCache(FileSystemStatCache *statCache,
|
|
|
|
bool AtBeginning) {
|
2009-10-17 02:18:30 +08:00
|
|
|
assert(statCache && "No stat cache provided?");
|
|
|
|
if (AtBeginning || StatCache.get() == 0) {
|
|
|
|
statCache->setNextStatCache(StatCache.take());
|
|
|
|
StatCache.reset(statCache);
|
|
|
|
return;
|
|
|
|
}
|
|
|
|
|
2010-11-24 03:19:34 +08:00
|
|
|
FileSystemStatCache *LastCache = StatCache.get();
|
2009-10-17 02:18:30 +08:00
|
|
|
while (LastCache->getNextStatCache())
|
|
|
|
LastCache = LastCache->getNextStatCache();
|
|
|
|
|
|
|
|
LastCache->setNextStatCache(statCache);
|
|
|
|
}
|
|
|
|
|
2010-11-24 03:19:34 +08:00
|
|
|
void FileManager::removeStatCache(FileSystemStatCache *statCache) {
|
2009-10-17 02:18:30 +08:00
|
|
|
if (!statCache)
|
|
|
|
return;
|
|
|
|
|
|
|
|
if (StatCache.get() == statCache) {
|
|
|
|
// This is the first stat cache.
|
|
|
|
StatCache.reset(StatCache->takeNextStatCache());
|
|
|
|
return;
|
|
|
|
}
|
|
|
|
|
|
|
|
// Find the stat cache in the list.
|
2010-11-24 03:19:34 +08:00
|
|
|
FileSystemStatCache *PrevCache = StatCache.get();
|
2009-10-17 02:18:30 +08:00
|
|
|
while (PrevCache && PrevCache->getNextStatCache() != statCache)
|
|
|
|
PrevCache = PrevCache->getNextStatCache();
|
2010-11-24 04:50:22 +08:00
|
|
|
|
|
|
|
assert(PrevCache && "Stat cache not found for removal");
|
|
|
|
PrevCache->setNextStatCache(statCache->getNextStatCache());
|
2009-10-17 02:18:30 +08:00
|
|
|
}
|
|
|
|
|
2012-07-31 21:56:54 +08:00
|
|
|
void FileManager::clearStatCaches() {
|
|
|
|
StatCache.reset(0);
|
|
|
|
}
|
|
|
|
|
2009-12-03 02:12:28 +08:00
|
|
|
/// \brief Retrieve the directory that the given file name resides in.
|
2011-02-12 02:44:49 +08:00
|
|
|
/// Filename can point to either a real file or a virtual file.
|
2009-12-03 02:12:28 +08:00
|
|
|
static const DirectoryEntry *getDirectoryFromFile(FileManager &FileMgr,
|
2011-09-14 07:15:45 +08:00
|
|
|
StringRef Filename,
|
|
|
|
bool CacheFailure) {
|
2011-02-12 05:25:35 +08:00
|
|
|
if (Filename.empty())
|
|
|
|
return NULL;
|
2011-02-12 02:44:49 +08:00
|
|
|
|
2011-02-12 05:25:35 +08:00
|
|
|
if (llvm::sys::path::is_separator(Filename[Filename.size() - 1]))
|
|
|
|
return NULL; // If Filename is a directory.
|
2010-11-21 19:32:22 +08:00
|
|
|
|
2011-07-23 18:55:15 +08:00
|
|
|
StringRef DirName = llvm::sys::path::parent_path(Filename);
|
2010-11-21 17:50:16 +08:00
|
|
|
// Use the current directory if file has no path component.
|
2011-02-12 05:25:35 +08:00
|
|
|
if (DirName.empty())
|
|
|
|
DirName = ".";
|
2010-11-21 19:32:22 +08:00
|
|
|
|
2011-09-14 07:15:45 +08:00
|
|
|
return FileMgr.getDirectory(DirName, CacheFailure);
|
2009-12-03 02:12:28 +08:00
|
|
|
}
|
|
|
|
|
2011-02-12 02:44:49 +08:00
|
|
|
/// Add all ancestors of the given path (pointing to either a file or
|
|
|
|
/// a directory) as virtual directories.
|
2011-07-23 18:55:15 +08:00
|
|
|
void FileManager::addAncestorsAsVirtualDirs(StringRef Path) {
|
|
|
|
StringRef DirName = llvm::sys::path::parent_path(Path);
|
2011-02-12 05:25:35 +08:00
|
|
|
if (DirName.empty())
|
2011-02-12 02:44:49 +08:00
|
|
|
return;
|
|
|
|
|
|
|
|
llvm::StringMapEntry<DirectoryEntry *> &NamedDirEnt =
|
|
|
|
SeenDirEntries.GetOrCreateValue(DirName);
|
|
|
|
|
|
|
|
// When caching a virtual directory, we always cache its ancestors
|
|
|
|
// at the same time. Therefore, if DirName is already in the cache,
|
|
|
|
// we don't need to recurse as its ancestors must also already be in
|
|
|
|
// the cache.
|
|
|
|
if (NamedDirEnt.getValue())
|
|
|
|
return;
|
|
|
|
|
|
|
|
// Add the virtual directory to the cache.
|
|
|
|
DirectoryEntry *UDE = new DirectoryEntry;
|
|
|
|
UDE->Name = NamedDirEnt.getKeyData();
|
|
|
|
NamedDirEnt.setValue(UDE);
|
|
|
|
VirtualDirectoryEntries.push_back(UDE);
|
|
|
|
|
|
|
|
// Recursively add the other ancestors.
|
|
|
|
addAncestorsAsVirtualDirs(DirName);
|
|
|
|
}
|
|
|
|
|
2011-09-14 07:15:45 +08:00
|
|
|
const DirectoryEntry *FileManager::getDirectory(StringRef DirName,
|
|
|
|
bool CacheFailure) {
|
2012-06-16 14:04:10 +08:00
|
|
|
// stat doesn't like trailing separators except for root directory.
|
2011-11-17 14:16:05 +08:00
|
|
|
// At least, on Win32 MSVCRT, stat() cannot strip trailing '/'.
|
|
|
|
// (though it can strip '\\')
|
2012-06-16 14:04:10 +08:00
|
|
|
if (DirName.size() > 1 &&
|
|
|
|
DirName != llvm::sys::path::root_path(DirName) &&
|
|
|
|
llvm::sys::path::is_separator(DirName.back()))
|
2011-11-17 14:16:05 +08:00
|
|
|
DirName = DirName.substr(0, DirName.size()-1);
|
|
|
|
|
2006-06-18 13:43:12 +08:00
|
|
|
++NumDirLookups;
|
2007-06-16 07:05:46 +08:00
|
|
|
llvm::StringMapEntry<DirectoryEntry *> &NamedDirEnt =
|
2011-02-12 02:44:49 +08:00
|
|
|
SeenDirEntries.GetOrCreateValue(DirName);
|
2009-09-09 23:08:12 +08:00
|
|
|
|
2011-02-12 02:44:49 +08:00
|
|
|
// See if there was already an entry in the map. Note that the map
|
|
|
|
// contains both virtual and real directories.
|
2007-02-09 03:08:49 +08:00
|
|
|
if (NamedDirEnt.getValue())
|
2008-01-12 04:42:05 +08:00
|
|
|
return NamedDirEnt.getValue() == NON_EXISTENT_DIR
|
2007-02-09 03:08:49 +08:00
|
|
|
? 0 : NamedDirEnt.getValue();
|
2009-09-09 23:08:12 +08:00
|
|
|
|
2006-06-18 13:43:12 +08:00
|
|
|
++NumDirCacheMisses;
|
2009-09-09 23:08:12 +08:00
|
|
|
|
2006-10-30 11:06:54 +08:00
|
|
|
// By default, initialize it to invalid.
|
2008-01-12 04:42:05 +08:00
|
|
|
NamedDirEnt.setValue(NON_EXISTENT_DIR);
|
2009-09-09 23:08:12 +08:00
|
|
|
|
2006-10-30 11:40:58 +08:00
|
|
|
// Get the null-terminated directory name as stored as the key of the
|
2011-02-12 02:44:49 +08:00
|
|
|
// SeenDirEntries map.
|
2007-02-09 03:08:49 +08:00
|
|
|
const char *InterndDirName = NamedDirEnt.getKeyData();
|
2009-09-09 23:08:12 +08:00
|
|
|
|
2006-10-30 11:06:54 +08:00
|
|
|
// Check to see if the directory exists.
|
2006-06-18 13:43:12 +08:00
|
|
|
struct stat StatBuf;
|
2012-12-11 15:48:23 +08:00
|
|
|
if (getStatValue(InterndDirName, StatBuf, false, 0/*directory lookup*/)) {
|
2011-02-12 02:44:49 +08:00
|
|
|
// There's no real directory at the given path.
|
2011-09-14 07:15:45 +08:00
|
|
|
if (!CacheFailure)
|
|
|
|
SeenDirEntries.erase(DirName);
|
2006-06-18 13:43:12 +08:00
|
|
|
return 0;
|
2011-02-12 02:44:49 +08:00
|
|
|
}
|
2008-02-24 11:15:25 +08:00
|
|
|
|
2011-02-12 02:44:49 +08:00
|
|
|
// It exists. See if we have already opened a directory with the
|
|
|
|
// same inode (this occurs on Unix-like systems when one dir is
|
|
|
|
// symlinked to another, for example) or the same path (on
|
|
|
|
// Windows).
|
|
|
|
DirectoryEntry &UDE = UniqueRealDirs.getDirectory(InterndDirName, StatBuf);
|
2009-09-09 23:08:12 +08:00
|
|
|
|
2007-02-09 03:08:49 +08:00
|
|
|
NamedDirEnt.setValue(&UDE);
|
2011-02-12 02:44:49 +08:00
|
|
|
if (!UDE.getName()) {
|
|
|
|
// We don't have this directory yet, add it. We use the string
|
|
|
|
// key from the SeenDirEntries map as the string.
|
|
|
|
UDE.Name = InterndDirName;
|
|
|
|
}
|
2009-09-09 23:08:12 +08:00
|
|
|
|
2007-02-09 03:08:49 +08:00
|
|
|
return &UDE;
|
2006-06-18 13:43:12 +08:00
|
|
|
}
|
|
|
|
|
2011-09-14 07:15:45 +08:00
|
|
|
const FileEntry *FileManager::getFile(StringRef Filename, bool openFile,
|
|
|
|
bool CacheFailure) {
|
2006-06-18 13:43:12 +08:00
|
|
|
++NumFileLookups;
|
2009-09-09 23:08:12 +08:00
|
|
|
|
2006-06-18 13:43:12 +08:00
|
|
|
// See if there is already an entry in the map.
|
2007-06-16 07:05:46 +08:00
|
|
|
llvm::StringMapEntry<FileEntry *> &NamedFileEnt =
|
2011-02-12 02:44:49 +08:00
|
|
|
SeenFileEntries.GetOrCreateValue(Filename);
|
2006-06-18 13:43:12 +08:00
|
|
|
|
2006-10-30 11:55:17 +08:00
|
|
|
// See if there is already an entry in the map.
|
2007-02-09 03:08:49 +08:00
|
|
|
if (NamedFileEnt.getValue())
|
2008-01-12 04:42:05 +08:00
|
|
|
return NamedFileEnt.getValue() == NON_EXISTENT_FILE
|
2007-02-09 03:08:49 +08:00
|
|
|
? 0 : NamedFileEnt.getValue();
|
2009-09-09 23:08:12 +08:00
|
|
|
|
2006-06-18 13:43:12 +08:00
|
|
|
++NumFileCacheMisses;
|
|
|
|
|
2006-10-30 11:55:17 +08:00
|
|
|
// By default, initialize it to invalid.
|
2008-01-12 04:42:05 +08:00
|
|
|
NamedFileEnt.setValue(NON_EXISTENT_FILE);
|
2006-06-18 13:43:12 +08:00
|
|
|
|
2006-10-30 11:55:17 +08:00
|
|
|
// Get the null-terminated file name as stored as the key of the
|
2011-02-12 02:44:49 +08:00
|
|
|
// SeenFileEntries map.
|
2007-02-09 03:08:49 +08:00
|
|
|
const char *InterndFileName = NamedFileEnt.getKeyData();
|
2009-09-09 23:08:12 +08:00
|
|
|
|
2010-11-24 04:30:42 +08:00
|
|
|
// Look up the directory for the file. When looking up something like
|
|
|
|
// sys/foo.h we'll discover all of the search directories that have a 'sys'
|
|
|
|
// subdirectory. This will let us avoid having to waste time on known-to-fail
|
|
|
|
// searches when we go to find sys/bar.h, because all the search directories
|
|
|
|
// without a 'sys' subdir will get a cached failure result.
|
2011-09-14 07:15:45 +08:00
|
|
|
const DirectoryEntry *DirInfo = getDirectoryFromFile(*this, Filename,
|
|
|
|
CacheFailure);
|
|
|
|
if (DirInfo == 0) { // Directory doesn't exist, file can't exist.
|
|
|
|
if (!CacheFailure)
|
|
|
|
SeenFileEntries.erase(Filename);
|
|
|
|
|
2009-12-03 02:12:28 +08:00
|
|
|
return 0;
|
2011-09-14 07:15:45 +08:00
|
|
|
}
|
|
|
|
|
2006-06-18 13:43:12 +08:00
|
|
|
// FIXME: Use the directory info to prune this, before doing the stat syscall.
|
|
|
|
// FIXME: This will reduce the # syscalls.
|
2009-09-09 23:08:12 +08:00
|
|
|
|
2006-06-18 13:43:12 +08:00
|
|
|
// Nope, there isn't. Check to see if the file exists.
|
2010-11-24 05:17:56 +08:00
|
|
|
int FileDescriptor = -1;
|
2006-06-18 13:43:12 +08:00
|
|
|
struct stat StatBuf;
|
2012-12-11 15:48:23 +08:00
|
|
|
if (getStatValue(InterndFileName, StatBuf, true,
|
|
|
|
openFile ? &FileDescriptor : 0)) {
|
2011-02-12 02:44:49 +08:00
|
|
|
// There's no real file at the given path.
|
2011-09-14 07:15:45 +08:00
|
|
|
if (!CacheFailure)
|
|
|
|
SeenFileEntries.erase(Filename);
|
|
|
|
|
2006-06-18 13:43:12 +08:00
|
|
|
return 0;
|
2011-02-12 02:44:49 +08:00
|
|
|
}
|
2009-09-09 23:08:12 +08:00
|
|
|
|
2011-03-17 03:17:25 +08:00
|
|
|
if (FileDescriptor != -1 && !openFile) {
|
|
|
|
close(FileDescriptor);
|
|
|
|
FileDescriptor = -1;
|
|
|
|
}
|
|
|
|
|
2007-12-19 06:29:39 +08:00
|
|
|
// It exists. See if we have already opened a file with the same inode.
|
2006-06-18 13:43:12 +08:00
|
|
|
// This occurs when one dir is symlinked to another, for example.
|
2011-02-12 02:44:49 +08:00
|
|
|
FileEntry &UFE = UniqueRealFiles.getFile(InterndFileName, StatBuf);
|
2009-09-09 23:08:12 +08:00
|
|
|
|
2007-02-09 03:08:49 +08:00
|
|
|
NamedFileEnt.setValue(&UFE);
|
2010-11-24 05:17:56 +08:00
|
|
|
if (UFE.getName()) { // Already have an entry with this inode, return it.
|
|
|
|
// If the stat process opened the file, close it to avoid a FD leak.
|
|
|
|
if (FileDescriptor != -1)
|
|
|
|
close(FileDescriptor);
|
2011-02-12 02:44:49 +08:00
|
|
|
|
2007-02-09 03:08:49 +08:00
|
|
|
return &UFE;
|
2010-11-24 05:17:56 +08:00
|
|
|
}
|
2006-06-25 14:23:00 +08:00
|
|
|
|
2006-06-18 13:43:12 +08:00
|
|
|
// Otherwise, we don't have this directory yet, add it.
|
2011-02-12 02:44:49 +08:00
|
|
|
// FIXME: Change the name to be a char* that points back to the
|
|
|
|
// 'SeenFileEntries' key.
|
2006-10-30 11:55:17 +08:00
|
|
|
UFE.Name = InterndFileName;
|
|
|
|
UFE.Size = StatBuf.st_size;
|
|
|
|
UFE.ModTime = StatBuf.st_mtime;
|
|
|
|
UFE.Dir = DirInfo;
|
|
|
|
UFE.UID = NextFileUID++;
|
2010-11-24 05:17:56 +08:00
|
|
|
UFE.FD = FileDescriptor;
|
2007-02-09 03:08:49 +08:00
|
|
|
return &UFE;
|
2006-06-18 13:43:12 +08:00
|
|
|
}
|
|
|
|
|
2009-12-03 02:12:28 +08:00
|
|
|
const FileEntry *
|
2011-07-23 18:55:15 +08:00
|
|
|
FileManager::getVirtualFile(StringRef Filename, off_t Size,
|
2010-11-23 16:35:12 +08:00
|
|
|
time_t ModificationTime) {
|
2009-12-03 02:12:28 +08:00
|
|
|
++NumFileLookups;
|
|
|
|
|
|
|
|
// See if there is already an entry in the map.
|
|
|
|
llvm::StringMapEntry<FileEntry *> &NamedFileEnt =
|
2011-02-12 02:44:49 +08:00
|
|
|
SeenFileEntries.GetOrCreateValue(Filename);
|
2009-12-03 02:12:28 +08:00
|
|
|
|
|
|
|
// See if there is already an entry in the map.
|
2011-01-27 18:55:51 +08:00
|
|
|
if (NamedFileEnt.getValue() && NamedFileEnt.getValue() != NON_EXISTENT_FILE)
|
|
|
|
return NamedFileEnt.getValue();
|
2009-12-03 02:12:28 +08:00
|
|
|
|
|
|
|
++NumFileCacheMisses;
|
|
|
|
|
|
|
|
// By default, initialize it to invalid.
|
|
|
|
NamedFileEnt.setValue(NON_EXISTENT_FILE);
|
|
|
|
|
2011-02-12 02:44:49 +08:00
|
|
|
addAncestorsAsVirtualDirs(Filename);
|
2011-02-06 03:42:43 +08:00
|
|
|
FileEntry *UFE = 0;
|
2011-02-12 02:44:49 +08:00
|
|
|
|
|
|
|
// Now that all ancestors of Filename are in the cache, the
|
|
|
|
// following call is guaranteed to find the DirectoryEntry from the
|
|
|
|
// cache.
|
2011-09-14 07:15:45 +08:00
|
|
|
const DirectoryEntry *DirInfo = getDirectoryFromFile(*this, Filename,
|
|
|
|
/*CacheFailure=*/true);
|
2011-02-12 02:44:49 +08:00
|
|
|
assert(DirInfo &&
|
|
|
|
"The directory of a virtual file should already be in the cache.");
|
|
|
|
|
|
|
|
// Check to see if the file exists. If so, drop the virtual file
|
|
|
|
struct stat StatBuf;
|
|
|
|
const char *InterndFileName = NamedFileEnt.getKeyData();
|
2012-12-11 15:48:23 +08:00
|
|
|
if (getStatValue(InterndFileName, StatBuf, true, 0) == 0) {
|
2011-02-12 02:44:49 +08:00
|
|
|
StatBuf.st_size = Size;
|
|
|
|
StatBuf.st_mtime = ModificationTime;
|
|
|
|
UFE = &UniqueRealFiles.getFile(InterndFileName, StatBuf);
|
|
|
|
|
|
|
|
NamedFileEnt.setValue(UFE);
|
|
|
|
|
|
|
|
// If we had already opened this file, close it now so we don't
|
|
|
|
// leak the descriptor. We're not going to use the file
|
|
|
|
// descriptor anyway, since this is a virtual file.
|
|
|
|
if (UFE->FD != -1) {
|
|
|
|
close(UFE->FD);
|
|
|
|
UFE->FD = -1;
|
2011-02-06 03:42:43 +08:00
|
|
|
}
|
2011-02-12 02:44:49 +08:00
|
|
|
|
|
|
|
// If we already have an entry with this inode, return it.
|
|
|
|
if (UFE->getName())
|
|
|
|
return UFE;
|
2011-02-06 03:42:43 +08:00
|
|
|
}
|
2009-12-03 02:12:28 +08:00
|
|
|
|
2011-02-06 03:42:43 +08:00
|
|
|
if (!UFE) {
|
|
|
|
UFE = new FileEntry();
|
|
|
|
VirtualFileEntries.push_back(UFE);
|
|
|
|
NamedFileEnt.setValue(UFE);
|
|
|
|
}
|
2009-12-03 02:12:28 +08:00
|
|
|
|
2010-11-24 04:50:22 +08:00
|
|
|
UFE->Name = InterndFileName;
|
2009-12-03 02:12:28 +08:00
|
|
|
UFE->Size = Size;
|
|
|
|
UFE->ModTime = ModificationTime;
|
|
|
|
UFE->Dir = DirInfo;
|
|
|
|
UFE->UID = NextFileUID++;
|
2011-02-06 03:42:43 +08:00
|
|
|
UFE->FD = -1;
|
2009-12-03 02:12:28 +08:00
|
|
|
return UFE;
|
|
|
|
}
|
|
|
|
|
2011-07-23 18:55:15 +08:00
|
|
|
void FileManager::FixupRelativePath(SmallVectorImpl<char> &path) const {
|
|
|
|
StringRef pathRef(path.data(), path.size());
|
2011-03-07 06:25:35 +08:00
|
|
|
|
2011-03-14 09:13:54 +08:00
|
|
|
if (FileSystemOpts.WorkingDir.empty()
|
|
|
|
|| llvm::sys::path::is_absolute(pathRef))
|
2010-12-18 05:22:22 +08:00
|
|
|
return;
|
|
|
|
|
2012-02-05 10:13:05 +08:00
|
|
|
SmallString<128> NewPath(FileSystemOpts.WorkingDir);
|
2011-03-07 06:25:35 +08:00
|
|
|
llvm::sys::path::append(NewPath, pathRef);
|
2010-11-23 12:45:28 +08:00
|
|
|
path = NewPath;
|
|
|
|
}
|
|
|
|
|
2010-11-23 17:19:42 +08:00
|
|
|
llvm::MemoryBuffer *FileManager::
|
2012-07-12 04:59:04 +08:00
|
|
|
getBufferForFile(const FileEntry *Entry, std::string *ErrorStr,
|
|
|
|
bool isVolatile) {
|
2012-02-05 10:12:40 +08:00
|
|
|
OwningPtr<llvm::MemoryBuffer> Result;
|
2010-12-10 01:36:38 +08:00
|
|
|
llvm::error_code ec;
|
2010-11-24 06:32:37 +08:00
|
|
|
|
2012-07-12 04:59:04 +08:00
|
|
|
uint64_t FileSize = Entry->getSize();
|
|
|
|
// If there's a high enough chance that the file have changed since we
|
|
|
|
// got its size, force a stat before opening it.
|
|
|
|
if (isVolatile)
|
|
|
|
FileSize = -1;
|
|
|
|
|
2011-03-15 08:47:44 +08:00
|
|
|
const char *Filename = Entry->getName();
|
|
|
|
// If the file is already open, use the open file descriptor.
|
|
|
|
if (Entry->FD != -1) {
|
2012-07-12 04:59:04 +08:00
|
|
|
ec = llvm::MemoryBuffer::getOpenFile(Entry->FD, Filename, Result, FileSize);
|
2011-03-15 08:47:44 +08:00
|
|
|
if (ErrorStr)
|
|
|
|
*ErrorStr = ec.message();
|
|
|
|
|
|
|
|
close(Entry->FD);
|
|
|
|
Entry->FD = -1;
|
|
|
|
return Result.take();
|
|
|
|
}
|
|
|
|
|
|
|
|
// Otherwise, open the file.
|
|
|
|
|
|
|
|
if (FileSystemOpts.WorkingDir.empty()) {
|
2012-07-12 04:59:04 +08:00
|
|
|
ec = llvm::MemoryBuffer::getFile(Filename, Result, FileSize);
|
2010-12-16 11:28:14 +08:00
|
|
|
if (ec && ErrorStr)
|
2010-12-10 01:36:38 +08:00
|
|
|
*ErrorStr = ec.message();
|
2010-12-16 11:28:14 +08:00
|
|
|
return Result.take();
|
2010-11-24 06:32:37 +08:00
|
|
|
}
|
2011-03-07 06:25:35 +08:00
|
|
|
|
2012-02-05 10:13:05 +08:00
|
|
|
SmallString<128> FilePath(Entry->getName());
|
2011-03-07 09:28:33 +08:00
|
|
|
FixupRelativePath(FilePath);
|
2012-07-12 04:59:04 +08:00
|
|
|
ec = llvm::MemoryBuffer::getFile(FilePath.str(), Result, FileSize);
|
2010-12-16 11:28:14 +08:00
|
|
|
if (ec && ErrorStr)
|
2010-12-10 01:36:38 +08:00
|
|
|
*ErrorStr = ec.message();
|
2010-12-16 11:28:14 +08:00
|
|
|
return Result.take();
|
2010-11-23 17:19:42 +08:00
|
|
|
}
|
2010-11-23 12:45:28 +08:00
|
|
|
|
2010-11-21 17:50:16 +08:00
|
|
|
llvm::MemoryBuffer *FileManager::
|
2011-07-23 18:55:15 +08:00
|
|
|
getBufferForFile(StringRef Filename, std::string *ErrorStr) {
|
2012-02-05 10:12:40 +08:00
|
|
|
OwningPtr<llvm::MemoryBuffer> Result;
|
2010-12-10 01:36:38 +08:00
|
|
|
llvm::error_code ec;
|
|
|
|
if (FileSystemOpts.WorkingDir.empty()) {
|
2010-12-16 11:28:14 +08:00
|
|
|
ec = llvm::MemoryBuffer::getFile(Filename, Result);
|
|
|
|
if (ec && ErrorStr)
|
2010-12-10 01:36:38 +08:00
|
|
|
*ErrorStr = ec.message();
|
2010-12-16 11:28:14 +08:00
|
|
|
return Result.take();
|
2010-12-10 01:36:38 +08:00
|
|
|
}
|
|
|
|
|
2012-02-05 10:13:05 +08:00
|
|
|
SmallString<128> FilePath(Filename);
|
2011-03-07 09:28:33 +08:00
|
|
|
FixupRelativePath(FilePath);
|
2010-12-16 11:28:14 +08:00
|
|
|
ec = llvm::MemoryBuffer::getFile(FilePath.c_str(), Result);
|
|
|
|
if (ec && ErrorStr)
|
2010-12-10 01:36:38 +08:00
|
|
|
*ErrorStr = ec.message();
|
2010-12-16 11:28:14 +08:00
|
|
|
return Result.take();
|
2010-11-04 06:45:23 +08:00
|
|
|
}
|
|
|
|
|
2011-02-12 02:44:49 +08:00
|
|
|
/// getStatValue - Get the 'stat' information for the specified path,
|
|
|
|
/// using the cache to accelerate it if possible. This returns true
|
|
|
|
/// if the path points to a virtual file or does not exist, or returns
|
|
|
|
/// false if it's an existent real file. If FileDescriptor is NULL,
|
|
|
|
/// do directory look-up instead of file look-up.
|
2010-11-24 04:50:22 +08:00
|
|
|
bool FileManager::getStatValue(const char *Path, struct stat &StatBuf,
|
2012-12-11 15:48:23 +08:00
|
|
|
bool isFile, int *FileDescriptor) {
|
2010-11-24 03:19:34 +08:00
|
|
|
// FIXME: FileSystemOpts shouldn't be passed in here, all paths should be
|
|
|
|
// absolute!
|
2010-11-24 03:56:39 +08:00
|
|
|
if (FileSystemOpts.WorkingDir.empty())
|
2012-12-11 15:48:23 +08:00
|
|
|
return FileSystemStatCache::get(Path, StatBuf, isFile, FileDescriptor,
|
2010-11-24 05:17:56 +08:00
|
|
|
StatCache.get());
|
2011-02-12 02:44:49 +08:00
|
|
|
|
2012-02-05 10:13:05 +08:00
|
|
|
SmallString<128> FilePath(Path);
|
2011-03-07 09:28:33 +08:00
|
|
|
FixupRelativePath(FilePath);
|
2010-11-24 03:56:39 +08:00
|
|
|
|
2012-12-11 15:48:23 +08:00
|
|
|
return FileSystemStatCache::get(FilePath.c_str(), StatBuf,
|
|
|
|
isFile, FileDescriptor, StatCache.get());
|
2010-11-04 06:45:23 +08:00
|
|
|
}
|
|
|
|
|
2011-07-23 18:55:15 +08:00
|
|
|
bool FileManager::getNoncachedStatValue(StringRef Path,
|
2011-03-19 03:23:19 +08:00
|
|
|
struct stat &StatBuf) {
|
2012-02-05 10:13:05 +08:00
|
|
|
SmallString<128> FilePath(Path);
|
2011-03-19 03:23:19 +08:00
|
|
|
FixupRelativePath(FilePath);
|
|
|
|
|
|
|
|
return ::stat(FilePath.c_str(), &StatBuf) != 0;
|
|
|
|
}
|
|
|
|
|
2012-07-11 00:50:27 +08:00
|
|
|
void FileManager::invalidateCache(const FileEntry *Entry) {
|
|
|
|
assert(Entry && "Cannot invalidate a NULL FileEntry");
|
2012-06-27 17:17:42 +08:00
|
|
|
|
|
|
|
SeenFileEntries.erase(Entry->getName());
|
2012-07-11 00:50:27 +08:00
|
|
|
|
|
|
|
// FileEntry invalidation should not block future optimizations in the file
|
|
|
|
// caches. Possible alternatives are cache truncation (invalidate last N) or
|
|
|
|
// invalidation of the whole cache.
|
|
|
|
UniqueRealFiles.erase(Entry);
|
2012-06-27 17:17:42 +08:00
|
|
|
}
|
|
|
|
|
|
|
|
|
Implement two related optimizations that make de-serialization of
AST/PCH files more lazy:
- Don't preload all of the file source-location entries when reading
the AST file. Instead, load them lazily, when needed.
- Only look up header-search information (whether a header was already
#import'd, how many times it's been included, etc.) when it's needed
by the preprocessor, rather than pre-populating it.
Previously, we would pre-load all of the file source-location entries,
which also populated the header-search information structure. This was
a relatively minor performance issue, since we would end up stat()'ing
all of the headers stored within a AST/PCH file when the AST/PCH file
was loaded. In the normal PCH use case, the stat()s were cached, so
the cost--of preloading ~860 source-location entries in the Cocoa.h
case---was relatively low.
However, the recent optimization that replaced stat+open with
open+fstat turned this into a major problem, since the preloading of
source-location entries would now end up opening those files. Worse,
those files wouldn't be closed until the file manager was destroyed,
so just opening a Cocoa.h PCH file would hold on to ~860 file
descriptors, and it was easy to blow through the process's limit on
the number of open file descriptors.
By eliminating the preloading of these files, we neither open nor stat
the headers stored in the PCH/AST file until they're actually needed
for something. Concretely, we went from
*** HeaderSearch Stats:
835 files tracked.
364 #import/#pragma once files.
823 included exactly once.
6 max times a file is included.
3 #include/#include_next/#import.
0 #includes skipped due to the multi-include optimization.
1 framework lookups.
0 subframework lookups.
*** Source Manager Stats:
835 files mapped, 3 mem buffers mapped.
37460 SLocEntry's allocated, 11215575B of Sloc address space used.
62 bytes of files mapped, 0 files with line #'s computed.
with a trivial program that uses a chained PCH including a Cocoa PCH
to
*** HeaderSearch Stats:
4 files tracked.
1 #import/#pragma once files.
3 included exactly once.
2 max times a file is included.
3 #include/#include_next/#import.
0 #includes skipped due to the multi-include optimization.
1 framework lookups.
0 subframework lookups.
*** Source Manager Stats:
3 files mapped, 3 mem buffers mapped.
37460 SLocEntry's allocated, 11215575B of Sloc address space used.
62 bytes of files mapped, 0 files with line #'s computed.
for the same program.
llvm-svn: 125286
2011-02-11 01:09:37 +08:00
|
|
|
void FileManager::GetUniqueIDMapping(
|
2011-07-23 18:55:15 +08:00
|
|
|
SmallVectorImpl<const FileEntry *> &UIDToFiles) const {
|
Implement two related optimizations that make de-serialization of
AST/PCH files more lazy:
- Don't preload all of the file source-location entries when reading
the AST file. Instead, load them lazily, when needed.
- Only look up header-search information (whether a header was already
#import'd, how many times it's been included, etc.) when it's needed
by the preprocessor, rather than pre-populating it.
Previously, we would pre-load all of the file source-location entries,
which also populated the header-search information structure. This was
a relatively minor performance issue, since we would end up stat()'ing
all of the headers stored within a AST/PCH file when the AST/PCH file
was loaded. In the normal PCH use case, the stat()s were cached, so
the cost--of preloading ~860 source-location entries in the Cocoa.h
case---was relatively low.
However, the recent optimization that replaced stat+open with
open+fstat turned this into a major problem, since the preloading of
source-location entries would now end up opening those files. Worse,
those files wouldn't be closed until the file manager was destroyed,
so just opening a Cocoa.h PCH file would hold on to ~860 file
descriptors, and it was easy to blow through the process's limit on
the number of open file descriptors.
By eliminating the preloading of these files, we neither open nor stat
the headers stored in the PCH/AST file until they're actually needed
for something. Concretely, we went from
*** HeaderSearch Stats:
835 files tracked.
364 #import/#pragma once files.
823 included exactly once.
6 max times a file is included.
3 #include/#include_next/#import.
0 #includes skipped due to the multi-include optimization.
1 framework lookups.
0 subframework lookups.
*** Source Manager Stats:
835 files mapped, 3 mem buffers mapped.
37460 SLocEntry's allocated, 11215575B of Sloc address space used.
62 bytes of files mapped, 0 files with line #'s computed.
with a trivial program that uses a chained PCH including a Cocoa PCH
to
*** HeaderSearch Stats:
4 files tracked.
1 #import/#pragma once files.
3 included exactly once.
2 max times a file is included.
3 #include/#include_next/#import.
0 #includes skipped due to the multi-include optimization.
1 framework lookups.
0 subframework lookups.
*** Source Manager Stats:
3 files mapped, 3 mem buffers mapped.
37460 SLocEntry's allocated, 11215575B of Sloc address space used.
62 bytes of files mapped, 0 files with line #'s computed.
for the same program.
llvm-svn: 125286
2011-02-11 01:09:37 +08:00
|
|
|
UIDToFiles.clear();
|
|
|
|
UIDToFiles.resize(NextFileUID);
|
|
|
|
|
|
|
|
// Map file entries
|
|
|
|
for (llvm::StringMap<FileEntry*, llvm::BumpPtrAllocator>::const_iterator
|
2011-02-12 02:44:49 +08:00
|
|
|
FE = SeenFileEntries.begin(), FEEnd = SeenFileEntries.end();
|
Implement two related optimizations that make de-serialization of
AST/PCH files more lazy:
- Don't preload all of the file source-location entries when reading
the AST file. Instead, load them lazily, when needed.
- Only look up header-search information (whether a header was already
#import'd, how many times it's been included, etc.) when it's needed
by the preprocessor, rather than pre-populating it.
Previously, we would pre-load all of the file source-location entries,
which also populated the header-search information structure. This was
a relatively minor performance issue, since we would end up stat()'ing
all of the headers stored within a AST/PCH file when the AST/PCH file
was loaded. In the normal PCH use case, the stat()s were cached, so
the cost--of preloading ~860 source-location entries in the Cocoa.h
case---was relatively low.
However, the recent optimization that replaced stat+open with
open+fstat turned this into a major problem, since the preloading of
source-location entries would now end up opening those files. Worse,
those files wouldn't be closed until the file manager was destroyed,
so just opening a Cocoa.h PCH file would hold on to ~860 file
descriptors, and it was easy to blow through the process's limit on
the number of open file descriptors.
By eliminating the preloading of these files, we neither open nor stat
the headers stored in the PCH/AST file until they're actually needed
for something. Concretely, we went from
*** HeaderSearch Stats:
835 files tracked.
364 #import/#pragma once files.
823 included exactly once.
6 max times a file is included.
3 #include/#include_next/#import.
0 #includes skipped due to the multi-include optimization.
1 framework lookups.
0 subframework lookups.
*** Source Manager Stats:
835 files mapped, 3 mem buffers mapped.
37460 SLocEntry's allocated, 11215575B of Sloc address space used.
62 bytes of files mapped, 0 files with line #'s computed.
with a trivial program that uses a chained PCH including a Cocoa PCH
to
*** HeaderSearch Stats:
4 files tracked.
1 #import/#pragma once files.
3 included exactly once.
2 max times a file is included.
3 #include/#include_next/#import.
0 #includes skipped due to the multi-include optimization.
1 framework lookups.
0 subframework lookups.
*** Source Manager Stats:
3 files mapped, 3 mem buffers mapped.
37460 SLocEntry's allocated, 11215575B of Sloc address space used.
62 bytes of files mapped, 0 files with line #'s computed.
for the same program.
llvm-svn: 125286
2011-02-11 01:09:37 +08:00
|
|
|
FE != FEEnd; ++FE)
|
|
|
|
if (FE->getValue() && FE->getValue() != NON_EXISTENT_FILE)
|
|
|
|
UIDToFiles[FE->getValue()->getUID()] = FE->getValue();
|
|
|
|
|
|
|
|
// Map virtual file entries
|
2011-07-23 18:55:15 +08:00
|
|
|
for (SmallVector<FileEntry*, 4>::const_iterator
|
Implement two related optimizations that make de-serialization of
AST/PCH files more lazy:
- Don't preload all of the file source-location entries when reading
the AST file. Instead, load them lazily, when needed.
- Only look up header-search information (whether a header was already
#import'd, how many times it's been included, etc.) when it's needed
by the preprocessor, rather than pre-populating it.
Previously, we would pre-load all of the file source-location entries,
which also populated the header-search information structure. This was
a relatively minor performance issue, since we would end up stat()'ing
all of the headers stored within a AST/PCH file when the AST/PCH file
was loaded. In the normal PCH use case, the stat()s were cached, so
the cost--of preloading ~860 source-location entries in the Cocoa.h
case---was relatively low.
However, the recent optimization that replaced stat+open with
open+fstat turned this into a major problem, since the preloading of
source-location entries would now end up opening those files. Worse,
those files wouldn't be closed until the file manager was destroyed,
so just opening a Cocoa.h PCH file would hold on to ~860 file
descriptors, and it was easy to blow through the process's limit on
the number of open file descriptors.
By eliminating the preloading of these files, we neither open nor stat
the headers stored in the PCH/AST file until they're actually needed
for something. Concretely, we went from
*** HeaderSearch Stats:
835 files tracked.
364 #import/#pragma once files.
823 included exactly once.
6 max times a file is included.
3 #include/#include_next/#import.
0 #includes skipped due to the multi-include optimization.
1 framework lookups.
0 subframework lookups.
*** Source Manager Stats:
835 files mapped, 3 mem buffers mapped.
37460 SLocEntry's allocated, 11215575B of Sloc address space used.
62 bytes of files mapped, 0 files with line #'s computed.
with a trivial program that uses a chained PCH including a Cocoa PCH
to
*** HeaderSearch Stats:
4 files tracked.
1 #import/#pragma once files.
3 included exactly once.
2 max times a file is included.
3 #include/#include_next/#import.
0 #includes skipped due to the multi-include optimization.
1 framework lookups.
0 subframework lookups.
*** Source Manager Stats:
3 files mapped, 3 mem buffers mapped.
37460 SLocEntry's allocated, 11215575B of Sloc address space used.
62 bytes of files mapped, 0 files with line #'s computed.
for the same program.
llvm-svn: 125286
2011-02-11 01:09:37 +08:00
|
|
|
VFE = VirtualFileEntries.begin(), VFEEnd = VirtualFileEntries.end();
|
|
|
|
VFE != VFEEnd; ++VFE)
|
|
|
|
if (*VFE && *VFE != NON_EXISTENT_FILE)
|
|
|
|
UIDToFiles[(*VFE)->getUID()] = *VFE;
|
|
|
|
}
|
2010-11-24 03:19:34 +08:00
|
|
|
|
2012-05-04 05:50:39 +08:00
|
|
|
void FileManager::modifyFileEntry(FileEntry *File,
|
|
|
|
off_t Size, time_t ModificationTime) {
|
|
|
|
File->Size = Size;
|
|
|
|
File->ModTime = ModificationTime;
|
|
|
|
}
|
|
|
|
|
2010-11-24 03:19:34 +08:00
|
|
|
|
2006-06-18 13:43:12 +08:00
|
|
|
void FileManager::PrintStats() const {
|
2009-08-23 20:08:50 +08:00
|
|
|
llvm::errs() << "\n*** File Manager Stats:\n";
|
2011-02-12 02:44:49 +08:00
|
|
|
llvm::errs() << UniqueRealFiles.size() << " real files found, "
|
|
|
|
<< UniqueRealDirs.size() << " real dirs found.\n";
|
|
|
|
llvm::errs() << VirtualFileEntries.size() << " virtual files found, "
|
|
|
|
<< VirtualDirectoryEntries.size() << " virtual dirs found.\n";
|
2009-08-23 20:08:50 +08:00
|
|
|
llvm::errs() << NumDirLookups << " dir lookups, "
|
|
|
|
<< NumDirCacheMisses << " dir cache misses.\n";
|
|
|
|
llvm::errs() << NumFileLookups << " file lookups, "
|
|
|
|
<< NumFileCacheMisses << " file cache misses.\n";
|
2009-09-09 23:08:12 +08:00
|
|
|
|
2009-08-23 20:08:50 +08:00
|
|
|
//llvm::errs() << PagesMapped << BytesOfPagesMapped << FSLookups;
|
2006-06-18 13:43:12 +08:00
|
|
|
}
|