2003-03-29 07:09:13 +00:00
|
|
|
/**
|
2007-04-26 04:41:58 +00:00
|
|
|
* \file BufferList.cpp
|
2003-03-29 07:09:13 +00:00
|
|
|
* This file is part of LyX, the document processor.
|
|
|
|
* Licence details can be found in the file COPYING.
|
2002-03-21 17:27:08 +00:00
|
|
|
*
|
2008-11-14 15:58:50 +00:00
|
|
|
* \author Lars Gullik Bjønnes
|
1999-09-27 18:44:28 +00:00
|
|
|
*
|
2003-08-23 00:17:00 +00:00
|
|
|
* Full author contact details are available in file CREDITS.
|
1999-09-27 18:44:28 +00:00
|
|
|
*/
|
|
|
|
|
2001-12-10 20:06:59 +00:00
|
|
|
#include <config.h>
|
|
|
|
|
2007-04-26 04:41:58 +00:00
|
|
|
#include "BufferList.h"
|
2003-09-06 18:38:02 +00:00
|
|
|
|
2007-04-26 04:41:58 +00:00
|
|
|
#include "Author.h"
|
|
|
|
#include "Buffer.h"
|
|
|
|
#include "BufferParams.h"
|
1999-09-27 18:44:28 +00:00
|
|
|
|
2007-04-28 20:44:46 +00:00
|
|
|
#include "frontends/alert.h"
|
2001-12-10 20:06:59 +00:00
|
|
|
|
2007-12-17 18:37:13 +00:00
|
|
|
#include "support/ExceptionMessage.h"
|
2007-11-29 07:04:28 +00:00
|
|
|
#include "support/debug.h"
|
2008-07-29 07:53:08 +00:00
|
|
|
#include "support/FileName.h"
|
2008-07-29 08:52:25 +00:00
|
|
|
#include "support/FileNameList.h"
|
|
|
|
#include "support/filetools.h"
|
2007-11-13 23:50:28 +00:00
|
|
|
#include "support/lstrings.h"
|
2001-12-10 20:06:59 +00:00
|
|
|
|
2008-04-30 08:26:40 +00:00
|
|
|
#include "support/lassert.h"
|
2002-08-20 20:04:24 +00:00
|
|
|
|
2004-11-06 15:23:12 +00:00
|
|
|
#include <algorithm>
|
2010-04-22 11:45:34 +00:00
|
|
|
#include <iterator>
|
2010-06-05 11:06:13 +00:00
|
|
|
#include <memory>
|
2004-01-31 15:30:24 +00:00
|
|
|
|
2007-12-12 10:16:00 +00:00
|
|
|
using namespace std;
|
2007-12-12 18:57:56 +00:00
|
|
|
using namespace lyx::support;
|
2007-07-17 17:40:44 +00:00
|
|
|
|
|
|
|
namespace lyx {
|
|
|
|
|
2006-10-07 16:47:54 +00:00
|
|
|
namespace Alert = lyx::frontend::Alert;
|
|
|
|
|
1999-11-15 12:27:25 +00:00
|
|
|
|
1999-09-27 18:44:28 +00:00
|
|
|
BufferList::BufferList()
|
2000-01-20 01:41:55 +00:00
|
|
|
{}
|
1999-09-27 18:44:28 +00:00
|
|
|
|
|
|
|
|
2008-10-13 20:40:58 +00:00
|
|
|
BufferList::~BufferList()
|
|
|
|
{
|
2019-02-25 14:14:58 +00:00
|
|
|
for (Buffer * buf : binternal)
|
|
|
|
delete buf;
|
2008-10-13 20:40:58 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
|
2000-02-03 17:09:33 +00:00
|
|
|
bool BufferList::empty() const
|
1999-09-27 18:44:28 +00:00
|
|
|
{
|
1999-11-05 06:02:34 +00:00
|
|
|
return bstore.empty();
|
1999-09-27 18:44:28 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
|
2006-11-26 16:39:39 +00:00
|
|
|
BufferList::iterator BufferList::begin()
|
|
|
|
{
|
|
|
|
return bstore.begin();
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
BufferList::const_iterator BufferList::begin() const
|
|
|
|
{
|
|
|
|
return bstore.begin();
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
BufferList::iterator BufferList::end()
|
|
|
|
{
|
|
|
|
return bstore.end();
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
BufferList::const_iterator BufferList::end() const
|
|
|
|
{
|
|
|
|
return bstore.end();
|
|
|
|
}
|
|
|
|
|
|
|
|
|
2003-02-15 19:21:11 +00:00
|
|
|
void BufferList::release(Buffer * buf)
|
|
|
|
{
|
2013-04-25 21:27:10 +00:00
|
|
|
// We may leak here, but we probably do not need to
|
|
|
|
// shut down.
|
|
|
|
LASSERT(buf, return);
|
2005-01-05 20:21:27 +00:00
|
|
|
BufferStorage::iterator const it =
|
|
|
|
find(bstore.begin(), bstore.end(), buf);
|
2003-02-15 19:21:11 +00:00
|
|
|
if (it != bstore.end()) {
|
2017-07-06 12:14:43 +00:00
|
|
|
Buffer const * parent = buf->parent();
|
2003-02-15 19:21:11 +00:00
|
|
|
Buffer * tmp = (*it);
|
|
|
|
bstore.erase(it);
|
2013-04-25 21:27:10 +00:00
|
|
|
LASSERT(tmp, return);
|
2003-02-15 19:21:11 +00:00
|
|
|
delete tmp;
|
2017-06-17 07:43:01 +00:00
|
|
|
if (parent)
|
|
|
|
// If this was a child, update the parent's buffer
|
|
|
|
// to avoid crashes due to dangling pointers (bug 9979)
|
|
|
|
parent->updateBuffer();
|
2003-02-15 19:21:11 +00:00
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
|
2012-05-12 12:11:56 +00:00
|
|
|
Buffer * BufferList::newInternalBuffer(string const & s)
|
|
|
|
{
|
|
|
|
Buffer * const buf = createNewBuffer(s);
|
|
|
|
if (buf) {
|
|
|
|
buf->setInternal(true);
|
|
|
|
binternal.push_back(buf);
|
|
|
|
}
|
|
|
|
return buf;
|
|
|
|
}
|
|
|
|
|
|
|
|
|
2012-05-12 11:54:20 +00:00
|
|
|
Buffer * BufferList::newBuffer(string const & s)
|
2012-05-12 12:11:56 +00:00
|
|
|
{
|
|
|
|
Buffer * const buf = createNewBuffer(s);
|
|
|
|
if (buf) {
|
|
|
|
LYXERR(Debug::INFO, "Assigning to buffer " << bstore.size());
|
|
|
|
bstore.push_back(buf);
|
|
|
|
}
|
|
|
|
return buf;
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
Buffer * BufferList::createNewBuffer(string const & s)
|
2003-02-15 19:21:11 +00:00
|
|
|
{
|
2016-06-02 20:58:52 +00:00
|
|
|
unique_ptr<Buffer> tmpbuf;
|
2008-03-15 00:22:54 +00:00
|
|
|
try {
|
2016-06-02 20:58:52 +00:00
|
|
|
tmpbuf = make_unique<Buffer>(s);
|
2007-12-17 18:37:13 +00:00
|
|
|
} catch (ExceptionMessage const & message) {
|
|
|
|
if (message.type_ == ErrorException) {
|
|
|
|
Alert::error(message.title_, message.details_);
|
|
|
|
exit(1);
|
|
|
|
} else if (message.type_ == WarningException) {
|
|
|
|
Alert::warning(message.title_, message.details_);
|
2020-02-28 06:16:21 +00:00
|
|
|
return nullptr;
|
2007-12-17 18:37:13 +00:00
|
|
|
}
|
|
|
|
}
|
2003-09-09 09:47:59 +00:00
|
|
|
tmpbuf->params().useClassDefaults();
|
2003-11-03 17:47:28 +00:00
|
|
|
return tmpbuf.release();
|
2003-02-15 19:21:11 +00:00
|
|
|
}
|
2003-03-04 09:27:27 +00:00
|
|
|
|
2003-02-15 19:21:11 +00:00
|
|
|
|
1999-09-27 18:44:28 +00:00
|
|
|
void BufferList::closeAll()
|
|
|
|
{
|
2007-12-04 22:21:25 +00:00
|
|
|
while (!bstore.empty())
|
|
|
|
release(bstore.front());
|
1999-09-27 18:44:28 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
|
2014-07-05 10:51:40 +00:00
|
|
|
FileNameList BufferList::fileNames() const
|
1999-09-27 18:44:28 +00:00
|
|
|
{
|
2014-07-05 10:51:40 +00:00
|
|
|
FileNameList nvec;
|
2019-02-25 14:14:58 +00:00
|
|
|
for (Buffer const * buf : bstore)
|
2010-10-29 19:10:54 +00:00
|
|
|
nvec.push_back(buf->fileName());
|
2000-01-20 01:41:55 +00:00
|
|
|
return nvec;
|
1999-09-27 18:44:28 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
|
1999-11-05 06:02:34 +00:00
|
|
|
Buffer * BufferList::first()
|
1999-09-27 18:44:28 +00:00
|
|
|
{
|
2002-03-12 17:15:44 +00:00
|
|
|
if (bstore.empty())
|
2020-02-28 06:16:21 +00:00
|
|
|
return nullptr;
|
1999-11-05 06:02:34 +00:00
|
|
|
return bstore.front();
|
1999-09-27 18:44:28 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
|
2006-11-26 15:47:45 +00:00
|
|
|
Buffer * BufferList::last()
|
|
|
|
{
|
|
|
|
if (bstore.empty())
|
2020-02-28 06:16:21 +00:00
|
|
|
return nullptr;
|
2006-11-26 15:47:45 +00:00
|
|
|
return bstore.back();
|
|
|
|
}
|
|
|
|
|
|
|
|
|
2007-10-02 22:10:33 +00:00
|
|
|
Buffer * BufferList::getBuffer(unsigned int choice)
|
1999-09-27 18:44:28 +00:00
|
|
|
{
|
2002-03-12 17:15:44 +00:00
|
|
|
if (choice >= bstore.size())
|
2020-02-28 06:16:21 +00:00
|
|
|
return nullptr;
|
1999-11-05 06:02:34 +00:00
|
|
|
return bstore[choice];
|
1999-09-27 18:44:28 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
|
2004-10-26 21:16:44 +00:00
|
|
|
Buffer * BufferList::next(Buffer const * buf) const
|
2004-10-22 10:24:55 +00:00
|
|
|
{
|
2013-04-25 21:27:10 +00:00
|
|
|
// Something is wrong, but we can probably survive it.
|
2020-02-28 06:16:21 +00:00
|
|
|
LASSERT(buf, return nullptr);
|
2005-01-05 20:21:27 +00:00
|
|
|
|
2004-10-22 10:24:55 +00:00
|
|
|
if (bstore.empty())
|
2020-02-28 06:16:21 +00:00
|
|
|
return nullptr;
|
2017-07-03 17:53:14 +00:00
|
|
|
BufferStorage::const_iterator it =
|
2011-11-15 18:24:42 +00:00
|
|
|
find(bstore.begin(), bstore.end(), buf);
|
2020-02-28 06:16:21 +00:00
|
|
|
LASSERT(it != bstore.end(), return nullptr);
|
2004-10-22 10:24:55 +00:00
|
|
|
++it;
|
2008-09-22 09:59:46 +00:00
|
|
|
Buffer * nextbuf = (it == bstore.end()) ? bstore.front() : *it;
|
|
|
|
return nextbuf;
|
2004-10-22 10:24:55 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
|
2004-10-26 21:16:44 +00:00
|
|
|
Buffer * BufferList::previous(Buffer const * buf) const
|
2004-10-22 10:24:55 +00:00
|
|
|
{
|
2013-04-25 21:27:10 +00:00
|
|
|
// Something is wrong, but we can probably survive it.
|
2020-02-28 06:16:21 +00:00
|
|
|
LASSERT(buf, return nullptr);
|
2005-01-05 20:21:27 +00:00
|
|
|
|
2004-10-22 10:24:55 +00:00
|
|
|
if (bstore.empty())
|
2020-02-28 06:16:21 +00:00
|
|
|
return nullptr;
|
2017-07-03 17:53:14 +00:00
|
|
|
BufferStorage::const_iterator it =
|
2011-11-15 18:24:42 +00:00
|
|
|
find(bstore.begin(), bstore.end(), buf);
|
2020-02-28 06:16:21 +00:00
|
|
|
LASSERT(it != bstore.end(), return nullptr);
|
2008-09-22 09:59:46 +00:00
|
|
|
|
|
|
|
Buffer * previousbuf = (it == bstore.begin()) ? bstore.back() : *(it - 1);
|
|
|
|
return previousbuf;
|
2004-10-22 10:24:55 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
|
2007-10-20 10:03:45 +00:00
|
|
|
void BufferList::updateIncludedTeXfiles(string const & masterTmpDir,
|
2012-10-03 08:41:07 +00:00
|
|
|
OutputParams const & runparams_in)
|
1999-09-27 18:44:28 +00:00
|
|
|
{
|
2012-10-03 08:41:07 +00:00
|
|
|
OutputParams runparams = runparams_in;
|
|
|
|
runparams.is_child = true;
|
2019-02-25 14:14:58 +00:00
|
|
|
for (Buffer * buf : bstore) {
|
|
|
|
if (!buf->isDepClean(masterTmpDir)) {
|
|
|
|
string writefile = addName(masterTmpDir, buf->latexName());
|
|
|
|
buf->makeLaTeXFile(FileName(writefile), masterTmpDir,
|
2011-10-29 20:14:48 +00:00
|
|
|
runparams, Buffer::OnlyBody);
|
2019-02-25 14:14:58 +00:00
|
|
|
buf->markDepClean(masterTmpDir);
|
1999-11-05 06:02:34 +00:00
|
|
|
}
|
|
|
|
}
|
1999-09-27 18:44:28 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
void BufferList::emergencyWriteAll()
|
|
|
|
{
|
2019-02-25 14:14:58 +00:00
|
|
|
for (Buffer * buf : bstore)
|
|
|
|
buf->emergencyWrite();
|
1999-09-27 18:44:28 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
|
2016-10-19 21:22:58 +00:00
|
|
|
void BufferList::invalidateConverterCache() const
|
|
|
|
{
|
2019-02-25 14:14:58 +00:00
|
|
|
for (Buffer const * buf : bstore)
|
|
|
|
buf->params().invalidateConverterCache();
|
2016-10-19 21:22:58 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
|
2008-07-29 07:53:08 +00:00
|
|
|
bool BufferList::exists(FileName const & fname) const
|
1999-09-27 18:44:28 +00:00
|
|
|
{
|
2020-02-28 06:16:21 +00:00
|
|
|
return getBuffer(fname) != nullptr;
|
1999-09-27 18:44:28 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
|
2017-12-13 09:38:47 +00:00
|
|
|
bool BufferList::isLoaded(Buffer const * b) const
|
2000-02-03 17:09:33 +00:00
|
|
|
{
|
2010-03-08 14:55:33 +00:00
|
|
|
if (!b)
|
|
|
|
return false;
|
2000-02-03 17:09:33 +00:00
|
|
|
BufferStorage::const_iterator cit =
|
|
|
|
find(bstore.begin(), bstore.end(), b);
|
|
|
|
return cit != bstore.end();
|
|
|
|
}
|
|
|
|
|
|
|
|
|
2017-12-13 09:38:47 +00:00
|
|
|
bool BufferList::isInternal(Buffer const * b) const
|
|
|
|
{
|
|
|
|
if (!b)
|
|
|
|
return false;
|
|
|
|
BufferStorage::const_iterator cit =
|
|
|
|
find(binternal.begin(), binternal.end(), b);
|
|
|
|
return cit != binternal.end();
|
|
|
|
}
|
|
|
|
|
|
|
|
|
2019-02-25 14:14:58 +00:00
|
|
|
bool BufferList::isOthersChild(Buffer * parent, Buffer * child) const
|
2016-01-05 14:52:18 +00:00
|
|
|
{
|
|
|
|
LASSERT(parent, return false);
|
|
|
|
LASSERT(child, return false);
|
|
|
|
LASSERT(parent->isChild(child), return false);
|
2017-07-03 17:53:14 +00:00
|
|
|
|
2016-01-05 14:52:18 +00:00
|
|
|
// Does child document have a different parent?
|
|
|
|
Buffer const * parent_ = child->parent();
|
|
|
|
if (parent_ && parent_ != parent)
|
|
|
|
return true;
|
2016-06-29 09:22:13 +00:00
|
|
|
|
2019-02-25 14:14:58 +00:00
|
|
|
for(Buffer const * buf : bstore)
|
2016-01-05 14:52:18 +00:00
|
|
|
if (buf != parent && buf->isChild(child))
|
|
|
|
return true;
|
|
|
|
return false;
|
|
|
|
}
|
|
|
|
|
|
|
|
|
2011-02-07 20:31:09 +00:00
|
|
|
Buffer * BufferList::getBuffer(support::FileName const & fname, bool internal) const
|
1999-09-27 18:44:28 +00:00
|
|
|
{
|
2009-05-02 17:12:31 +00:00
|
|
|
// 1) cheap test, using string comparison of file names
|
2016-06-29 09:22:13 +00:00
|
|
|
for (Buffer * b : bstore)
|
|
|
|
if (b->fileName() == fname)
|
|
|
|
return b;
|
2009-07-25 16:43:28 +00:00
|
|
|
// 2) possibly expensive test, using equivalence test of file names
|
2016-06-29 09:22:13 +00:00
|
|
|
for (Buffer * b : bstore)
|
|
|
|
if (equivalent(b->fileName(), fname))
|
|
|
|
return b;
|
2011-02-07 20:31:09 +00:00
|
|
|
if (internal) {
|
|
|
|
// 1) cheap test, using string comparison of file names
|
2016-06-29 09:22:13 +00:00
|
|
|
for (Buffer * b : binternal)
|
|
|
|
if (b->fileName() == fname)
|
|
|
|
return b;
|
2011-02-07 20:31:09 +00:00
|
|
|
// 2) possibly expensive test, using equivalence test of file names
|
2016-06-29 09:22:13 +00:00
|
|
|
for (Buffer * b : binternal)
|
|
|
|
if (equivalent(b->fileName(), fname))
|
|
|
|
return b;
|
2011-02-07 20:31:09 +00:00
|
|
|
}
|
2020-02-28 06:16:21 +00:00
|
|
|
return nullptr;
|
1999-09-27 18:44:28 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
|
2020-02-22 11:11:42 +00:00
|
|
|
Buffer * BufferList::getBufferFromTmp(string const & s, bool realpath)
|
2003-10-14 11:35:50 +00:00
|
|
|
{
|
2019-02-25 14:14:58 +00:00
|
|
|
for (Buffer * buf : bstore) {
|
2020-02-22 11:11:42 +00:00
|
|
|
string const temppath = realpath ? FileName(buf->temppath()).realPath() : buf->temppath();
|
|
|
|
if (prefixIs(s, temppath)) {
|
2009-06-22 05:09:01 +00:00
|
|
|
// check whether the filename matches the master
|
2019-02-25 14:14:58 +00:00
|
|
|
string const master_name = buf->latexName();
|
2009-06-22 05:09:01 +00:00
|
|
|
if (suffixIs(s, master_name))
|
2019-02-25 14:14:58 +00:00
|
|
|
return buf;
|
2009-06-22 05:09:01 +00:00
|
|
|
// if not, try with the children
|
2019-12-16 04:36:17 +00:00
|
|
|
for (Buffer * child : buf->getDescendants()) {
|
2009-06-22 05:09:01 +00:00
|
|
|
string const mangled_child_name = DocFileName(
|
2019-02-25 14:14:58 +00:00
|
|
|
changeExtension(child->absFileName(),
|
2010-04-21 01:19:23 +00:00
|
|
|
".tex")).mangledFileName();
|
2009-06-22 05:09:01 +00:00
|
|
|
if (suffixIs(s, mangled_child_name))
|
2019-02-25 14:14:58 +00:00
|
|
|
return child;
|
2009-06-22 05:09:01 +00:00
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
2020-02-28 06:16:21 +00:00
|
|
|
return nullptr;
|
2003-10-14 11:35:50 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
|
2010-10-29 19:27:55 +00:00
|
|
|
void BufferList::recordCurrentAuthor(Author const & author)
|
2003-02-08 19:18:01 +00:00
|
|
|
{
|
2019-02-25 14:14:58 +00:00
|
|
|
for (Buffer * buf : bstore)
|
|
|
|
buf->params().authors().recordCurrentAuthor(author);
|
2007-10-20 10:03:45 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
|
2015-11-22 16:39:15 +00:00
|
|
|
void BufferList::updatePreviews()
|
|
|
|
{
|
2019-02-25 14:14:58 +00:00
|
|
|
for (Buffer * buf : bstore)
|
|
|
|
buf->updatePreviews();
|
2015-11-22 16:39:15 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
|
2008-07-29 08:52:25 +00:00
|
|
|
int BufferList::bufferNum(FileName const & fname) const
|
2007-10-20 10:03:45 +00:00
|
|
|
{
|
2014-07-05 10:51:40 +00:00
|
|
|
FileNameList const buffers(fileNames());
|
2008-07-29 08:52:25 +00:00
|
|
|
FileNameList::const_iterator cit =
|
|
|
|
find(buffers.begin(), buffers.end(), fname);
|
2007-10-20 10:03:45 +00:00
|
|
|
if (cit == buffers.end())
|
|
|
|
return 0;
|
|
|
|
return int(cit - buffers.begin());
|
2003-02-08 19:18:01 +00:00
|
|
|
}
|
2006-10-21 00:16:43 +00:00
|
|
|
|
|
|
|
|
2010-01-08 02:03:54 +00:00
|
|
|
void BufferList::changed(bool update_metrics) const
|
2010-01-06 18:36:13 +00:00
|
|
|
{
|
2019-02-25 14:14:58 +00:00
|
|
|
for (Buffer const * buf : bstore)
|
|
|
|
buf->changed(update_metrics);
|
|
|
|
for (Buffer const * buf : binternal)
|
|
|
|
buf->changed(update_metrics);
|
2010-01-06 18:36:13 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
|
2006-10-21 00:16:43 +00:00
|
|
|
} // namespace lyx
|