102 lines
3.8 KiB
C++
102 lines
3.8 KiB
C++
|
/*
|
||
|
|
* Copyright 2011 Aaron Seigo <aseigo@kde.org>
|
||
|
|
*
|
||
|
|
* Redistribution and use in source and binary forms, with or without
|
||
|
|
* modification, are permitted provided that the following conditions
|
||
|
|
* are met:
|
||
|
|
*
|
||
|
|
* 1. Redistributions of source code must retain the above copyright
|
||
|
|
* notice, this list of conditions and the following disclaimer.
|
||
|
|
* 2. Redistributions in binary form must reproduce the above copyright
|
||
|
|
* notice, this list of conditions and the following disclaimer in the
|
||
|
|
* documentation and/or other materials provided with the distribution.
|
||
|
|
*
|
||
|
|
* THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR
|
||
|
|
* IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES
|
||
|
|
* OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED.
|
||
|
|
* IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT,
|
||
|
|
* INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT
|
||
|
|
* NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
|
||
|
|
* DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
|
||
|
|
* THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
|
||
|
|
* (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF
|
||
|
|
* THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
|
||
|
|
*/
|
||
|
|
|
||
|
|
#include "httpContainer.h"
|
||
|
|
|
||
|
|
#include <KIO/Job>
|
||
|
|
#include <KIO/TransferJob>
|
||
|
|
|
||
|
|
HttpContainer::HttpContainer(const KUrl &url, QObject *parent)
|
||
|
|
: Plasma::DataContainer(parent),
|
||
|
|
m_url(url)
|
||
|
|
{
|
||
|
|
// Since we are grabbing data over the network, we request a
|
||
|
|
// backing store. This way, if the network is down or on first start
|
||
|
|
// before we get our first reply back, if this source was previously
|
||
|
|
// available, we'll still have our data. This is a very nice "freebie"
|
||
|
|
// DataContainer gives us.
|
||
|
|
setStorageEnabled(true);
|
||
|
|
|
||
|
|
// Now, start an initial fetch.
|
||
|
|
fetchUrl(false);
|
||
|
|
}
|
||
|
|
|
||
|
|
void HttpContainer::fetchUrl(bool reload)
|
||
|
|
{
|
||
|
|
// Now we go about the business of fetching the URL with KIO
|
||
|
|
m_data.clear();
|
||
|
|
|
||
|
|
KIO::TransferJob *job = KIO::get(m_url, reload ? KIO::Reload : KIO::NoReload, KIO::HideProgressInfo);
|
||
|
|
connect(job, SIGNAL(data(KIO::Job*,QByteArray)),
|
||
|
|
this, SLOT(data(KIO::Job*,QByteArray)));
|
||
|
|
connect(job, SIGNAL(finished(KJob*)), this, SLOT(fetchFinished(KJob*)));
|
||
|
|
|
||
|
|
if (m_job) {
|
||
|
|
m_job.data()->kill();
|
||
|
|
}
|
||
|
|
|
||
|
|
m_job = job;
|
||
|
|
}
|
||
|
|
|
||
|
|
void HttpContainer::data(KIO::Job *job, const QByteArray &data)
|
||
|
|
{
|
||
|
|
if (job == m_job.data()) {
|
||
|
|
// we store the data as it arrives
|
||
|
|
m_data.append(data);
|
||
|
|
}
|
||
|
|
}
|
||
|
|
|
||
|
|
void HttpContainer::fetchFinished(KJob *job)
|
||
|
|
{
|
||
|
|
if (!job->error()) {
|
||
|
|
// We now set the data on the source with the retrieved data and some
|
||
|
|
// additional stats. Note that we don't include the source name, as that
|
||
|
|
// is implied as this object *is* the DataContainer. setData is called
|
||
|
|
// with just key/value pairs.
|
||
|
|
setData("Contents", m_data);
|
||
|
|
setData("Size", job->processedAmount(KJob::Bytes));
|
||
|
|
|
||
|
|
// Since we only create TransferJobs, it's safe to just static_cast here.
|
||
|
|
// In many real-world situations, this isn't the safest thing to do and a
|
||
|
|
// qobject_cast with a test on the result is often safer and cleaner.
|
||
|
|
KIO::TransferJob *tjob = static_cast<KIO::TransferJob *>(job);
|
||
|
|
setData("Error Page", tjob->isErrorPage());
|
||
|
|
setData("Mimetype", tjob->mimetype());
|
||
|
|
|
||
|
|
// Let DataContainer know we have data that needs storing
|
||
|
|
setNeedsToBeStored(true);
|
||
|
|
|
||
|
|
// Notify DataContainer that now is a good time to check to see that
|
||
|
|
// data has been updated. This will cause visualizations to be updated.
|
||
|
|
checkForUpdate();
|
||
|
|
|
||
|
|
// Clean up behind ourselves so there isn't unecessary memory usage
|
||
|
|
m_data.clear();
|
||
|
|
}
|
||
|
|
}
|
||
|
|
|
||
|
|
#include "httpContainer.moc"
|
||
|
|
|