1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282 283 284 285 286 287 288 289 290 291 292 293 294 295 296 297 298 299 300 301 302 303 304 305 306 307 308 309 310 311 312 313 314 315 316 317 318 319 320 321 322 323 324 325 326 327 328 329 330 331 332 333 334 335 336 337 338 339 340 341 342 343 344 345 346 347 348 349 350 351 352 353 354 355 356 357 358 359 360 361 362 363 364 365 366 367 368 369 370 371 372 373 374 375 376
|
/* -*- mode: c++ -*-
*/
/*
GIFT, a flexible content based image retrieval system.
Copyright (C) 1998, 1999, 2000, 2001, 2002, CUI University of Geneva
Copyright (C) 2003, 2004 Bayreuth University
2005 Bamberg University
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., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA
*/
//configuration files for sessions and algorithms/collections
#ifndef _CCOMMUNICATIONHANDLER
#define _CCOMMUNICATIONHANDLER
#include "libMRML/include/uses-declarations.h"
//the expat xml parser by J.Clark
#include <expat.h>
//a class for using xpat attributes in a nice way
#include "libMRML/include/CAttributeList.h"
//This is mrml+gift specific
#include "libMRML/include/CSessionManager.h"
#include "libMRML/include/CXMLElement.h"
#include <functional>
#include <iostream>
#include <fstream>
#include "libMRML/include/CMutex.h"
//----------------------------------------
/** prototypes for use with expat */
extern void startMRMLElement(void *userData,
const char *inElementName,
const char **inAttributes);
extern void endMRMLElement(void *userData, const char *name);
/** a helper class for use with expat, which also handles the socket stuff.
*@author: Wolfgang Mller
*/
class CCommunicationHandler{
/**
the root of the Document tree which we are making.
It is destroyed automatically when overwritten.
*/
CSelfDestroyPointer<CXMLElement> mDocumentRoot;
/** the xml parser which is used for all this
*/
XML_Parser mParser;
/** <SEQUENCE MATTERS HERE> */
/** session manager */
CSessionManager& mSessionManager;
/** </SEQUENCE MATTERS HERE>
An xml subtree, containing
all configured algorithms
*/
CAlgorithm* mAlgorithmTree;
/**
A DOM-alike tree built from this text
*/
CSelfDestroyPointer<CXMLElement> mCurrentTree;
/**
The string containing and describing
the peer socket. This can be an IP socket,
or unix socket peer credentials
*/
string mPeerAddressString;
public:
/**
A DOM-alike tree which will be built from all the answers
given to the requests
at the moment this is public, because I need it to
slowly hack the negotiation code.
*/
CSelfDestroyPointer<CXMLElement> mMultiResponse;
protected:
/** We have said, that the user can tell, if he wants a query
in the normal sense or rather a collection of random images,
in which case the inner parts of the query are ignored.
The flag used to perform this is this variable.
*/
int mQueryAtRandomCount;
protected:
/** The socket, which is used for this communication */
int mSocket;
/** The logfile which logs all communication. *this
will APPEND NEW DATA to the logfile, as you would expect
*/
ofstream& mLog;
public:
//----------------------------------------
/** communications: */
//----------------------------------------
/** setting the communication socket for this session */
void setSocket(int inSocket);
//----------------------------------------
/** helpers for creating mrml messages */
//----------------------------------------
/** the preamble for a session */
string preamble();
/** Frame: this is for all messages the same */
string frame(const string& inSession,
const string& inString);
//----------------------------------------
/** making attributes out of name/value pairs */
string toAttribute(string inName,
string inString);
string toAttribute(string inName,
int inInt);
string toAttribute(string inName,
double inFloat);
// //----------------------------------------
// /** turning a relevance level element into a string */
// /** (obsolete) */
// string stringOfRelevanceLevelElement(const CRelevanceLevel& inRE,
// double inUserRelevance=0.5);
// string stringOfRelevanceLevelList(const CRelevanceLevelList& inRLL);
//----------------------------------------
/** Error message */
int sendError(const string& inSession,
const string& inMessage);
//----------------------------------------
/** Opening a session */
void openSession(const string& inUserName,
const string& inSessionName);
/** renaming the current session */
void renameSession(const string& inSessionID,
const string& inNewName);
/** renaming the current session */
void deleteSession(const string& inName);
/** Gets the property sheet contained in the algorithm
with inAlgorithmID*/
void getPropertySheet(const string& inSessionID,
const string& inAlgorithmID);
//----------------------------------------
/** the handshake message (old MRML)*/
int sendHandshake(const string& inUser);
/** getting the sessions for one user (new MRML)*/
void getSessions(const string& inUser);
/** getting collections available on a system*/
void getCollections();
/** getting algorithms available on a system*/
void getAlgorithms();
//----------------------------------------
/** the result of a query */
int sendResult(const string& inSession,
const CXMLElement& inRLL);
//----------------------------------------
/** random images */
int sendRandomImages(const string& inSession,
const string& inAlgorithm,
const string& inCollection,
const string& inNumberOfImages) ;
;
//----------------------------------------
/** processing a query */
//----------------------------------------
CXMLElement* gQueryImages;
string mSessionID;
int mResultSize;
double mCutoff;
string mCollection;
string mAlgorithm;
//----------------------------------------
/** setting properties of the query */
void setResultSize(int inResultSize);
void setResultCutoff(const string& inCutoff);
void setResultCutoff(double inCutoff);
void setCollectionID(const string& inID);
void setAlgorithmID(const string& inID);
//----------------------------------------
/** Start building a tree by successive adding
of XML elements */
void startTreeBuilding(const char* inElementName,
const char*const*const inAttributes);
/** Start building a tree by successive adding
of XML elements */
void addToCurrentTree(const char* inElementName,
const char*const*const inAttributes);
/**
move up in the tree
*/
void moveUpCurrentTree();
/**
is this building a tree at present?
*/
bool isBuildingTree()const;
//----------------------------------------
/** parse XML using expat */
//----------------------------------------
void parseString(const string& inMessage);
//----------------------------------------
/**
Clear the algorithm tree element.
We do not assume destruction responsability here
This responsability is transferred to the
containing session.
FIXME do something cleaner for the case of failure
*/
void clearAlgorithmElement();
//----------------------------------------
/** start of
an element in the tree of configured
algorithms.
If mAlgorithm=0 then generate a new
XML element with the content given
by inName and inAttributes
@param inName The name like given by expat
@param inAttributes an attributes list like given by
expat
*/
//----------------------------------------
void startAlgorithmElement(const char* inName,
const char* const* const inAttributes);
//----------------------------------------
/** end of
an element in the tree of configured
algorithms */
//----------------------------------------
void endAlgorithmElement();
//----------------------------------------
/**
clear the pointer to the algorithm tree
*/
//----------------------------------------
void initAlgorithmElement();
//----------------------------------------
/** read the pointer to the algorithm tree
*/
//----------------------------------------
CAlgorithm* readAlgorithmElement();
//----------------------------------------
/**
End the configuration i.e. make out
of the algorithm structure a query
processing structure.
*/
void endConfiguration();
//----------------------------------------
/** parsing from a stream:
* read each character
* parse it */
bool mParsingFinished;
void clearParsingFinished();
void setParsingFinished();
bool isParsingFinished()const;
bool readAndParse();
void makeParser();
/**
If we process multiple queries which are part of one message,
we have to first collect the answers from the requests, and then
send the whole message.
startMultiRequest and endMultiRequest
are the functions which administer this process.
startMultiRequest clears the message which is going to be built and
sets the language code
*/
void startMultiRequest(const string& inSessionID, const string& inLanguageCode="en");
/** sends the message which has been built*/
void endMultiRequest();
/**
adds an XMLElement to the multi-response which is built
*/
void addToMultiResponse(CXMLElement* inElement);
/** returns the currently valid SessionID */
const string getCurrentSessionID();
//----------------------------------------
/** Using the session manager which is a member */
/** of this for other purposes */
//----------------------------------------
CSessionManager& getSessionManager();
/** incrementing the QueryAtRandomCount flag */
void incrementQueryAtRandomCount();
/** reading this flag */
int getQueryAtRandomCount()const;
/**
set the name of the peer,
this is just an informative string,
destined for the log.
The string can contain either the IP of the
connecting computer, or else the peer credentials
of the connecting tasks.
*/
void setPeerAddressString(string);
/** get the Peer adress string */
const string& getPeerAddressString()const;
//----------------------------------------
/** constructor/destructor */
//----------------------------------------
CCommunicationHandler(CSessionManager& inSessionManager,
ofstream& inLogFile);
~CCommunicationHandler();
};
#endif
|