kioslave/nntp
15 #include <kio/global.h>
16 #include <kio/tcpslavebase.h>
18 #define MAX_PACKET_LEN 8192
41 NNTPProtocol (
const QByteArray & pool,
const QByteArray & app,
bool isSSL );
44 virtual void get(
const KUrl& url );
45 virtual void put(
const KUrl& url,
int permissions, KIO::JobFlags flags );
46 virtual void stat(
const KUrl& url );
47 virtual void listDir(
const KUrl& url );
48 virtual void setHost(
const QString& host, quint16 port,
49 const QString& user,
const QString& pass);
59 virtual void special(
const QByteArray& data);
89 QString mHost, mUser, mPass;
90 quint16 m_port, m_defaultPort;
91 bool postingAllowed, isAuthenticated;
92 char readBuffer[MAX_PACKET_LEN];
93 ssize_t readBufferLen;
95 QString mCurrentGroup;
103 void fetchGroups(
const QString &since,
bool desc );
113 bool fetchGroup ( QString &group,
unsigned long first = 0,
unsigned long max = 0 );
120 bool fetchGroupRFC977(
unsigned long first );
131 bool fetchGroupXOVER(
unsigned long first,
bool ¬Supported );
133 void fillUDSEntry ( KIO::UDSEntry & entry,
const QString & name,
long size,
134 bool is_article,
long access = 0 );
136 void unexpected_response (
int res_code,
const QString & command );
142 int evalResponse (
char *data, ssize_t &len );
bool nntp_open()
Attempt to initiate a NNTP connection via a TCP socket, if no existing connection could be reused...
virtual void special(const QByteArray &data)
Special command: 1 = post article it takes no other args, the article data are requested by dataReq()...
bool post_article()
Post article.
int sendCommand(const QString &cmd)
Send a command to the server.
NNTPProtocol(const QByteArray &pool, const QByteArray &app, bool isSSL)
Default Constructor.
void nntp_close()
Attempt to properly shut down the NNTP connection by sending "QUIT\r\n" before closing the socket...
This file is part of the KDE documentation.
Documentation copyright © 1996-2013 The KDE developers.
Generated on Tue Nov 26 2013 09:02:21 by
doxygen 1.8.5 written
by
Dimitri van Heesch, © 1997-2006
KDE's Doxygen guidelines are available online.