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 377 378 379 380 381 382 383 384 385 386 387 388 389 390 391 392 393 394 395 396 397 398 399 400 401 402 403 404 405 406 407 408 409 410 411 412 413 414
|
/* -*- mode: C++; c-basic-offset: 2; indent-tabs-mode: nil -*- */
/*
* Main authors:
* Maxim Shishmarev <maxim.shishmarev@monash.edu>
*
* Contributing authors:
* Guido Tack <tack@gecode.org>
* Kevin Leo <kevin.leo@monash.edu>
*
* Copyright:
* Maxim Shishmarev, 2017
* Guido Tack, 2017
* Kevin Leo, 2017
*
* This file is part of Gecode, the generic constraint
* development environment:
* http://www.gecode.org
*
* Permission is hereby granted, free of charge, to any person obtaining
* a copy of this software and associated documentation files (the
* "Software"), to deal in the Software without restriction, including
* without limitation the rights to use, copy, modify, merge, publish,
* distribute, sublicense, and/or sell copies of the Software, and to
* permit persons to whom the Software is furnished to do so, subject to
* the following conditions:
*
* The above copyright notice and this permission notice shall be
* included in all copies or substantial portions of the Software.
*
* THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND,
* EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
* MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND
* NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE
* LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION
* OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION
* WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
*
*/
#include <vector>
#include <string>
#include <cassert>
#include <cstdint>
namespace Gecode { namespace CPProfiler {
/// Version of CPProfiler protocol
static const int32_t PROFILER_PROTOCOL_VERSION = 3;
/// Types of nodes for CP Profiler
enum NodeStatus {
SOLVED = 0, ///< Node representing a solution
FAILED = 1, ///< Node representing failure
BRANCH = 2, ///< Node representing a branch
SKIPPED = 3 ///< Node skipped by backjumping
};
/// Types of messages for CP Profiler
enum class MsgType {
NODE = 0,
DONE = 1,
START = 2,
RESTART = 3
};
/// Optional value class
template <class T>
class Option {
protected:
/// A value, potentially not initialized
T value_;
/// Whether value is present
bool present{false};
public:
/// Check whether value is present
bool valid(void) const;
/// Set value to \a t
void set(const T& t);
/// Disregard value
void unset(void);
/// Access value
const T& value(void) const;
/// Access value
T& value(void);
};
template <class T>
forceinline bool
Option<T>::valid(void) const {
return present;
}
template <class T>
forceinline void
Option<T>::set(const T& t) {
present = true; value_ = t;
}
template <class T>
forceinline void
Option<T>::unset(void) {
present = false;
}
template <class T>
forceinline const T&
Option<T>::value(void) const {
assert(present); return value_;
}
template <class T>
forceinline T&
Option<T>::value(void) {
assert(present); return value_;
}
/// Unique identifier for a node
struct NodeUID {
/// Node number
int32_t nid;
/// Restart id
int32_t rid;
/// Thread id
int32_t tid;
};
/// Message for the CP Profiler
class Message {
protected:
MsgType _type;
NodeUID _node;
NodeUID _parent;
int32_t _alt;
int32_t _kids;
NodeStatus _status;
bool _have_label{false};
std::string _label;
bool _have_nogood{false};
std::string _nogood;
bool _have_info{false};
std::string _info;
bool _have_version{false};
int32_t _version; // PROFILER_PROTOCOL_VERSION;
public:
bool isNode(void) const { return _type == MsgType::NODE; }
bool isDone(void) const { return _type == MsgType::DONE; }
bool isStart(void) const { return _type == MsgType::START; }
bool isRestart(void) const { return _type == MsgType::RESTART; }
NodeUID nodeUID(void) const { return _node; }
void set_nodeUID(const NodeUID& n) { _node = n; }
NodeUID parentUID(void) const { return _parent; }
void set_parentUID(const NodeUID& p) { _parent = p; }
int32_t alt(void) const { return _alt; }
void set_alt(int32_t alt) { _alt = alt; }
int32_t kids(void) const { return _kids; }
void set_kids(int32_t kids) { _kids = kids; }
NodeStatus status(void) const { return _status; }
void set_status(NodeStatus status) { _status = status; }
void set_label(const std::string& label) {
_have_label = true;
_label = label;
}
void set_info(const std::string& info) {
_have_info = true;
_info = info;
}
void set_nogood(const std::string& nogood) {
_have_nogood = true;
_nogood = nogood;
}
void set_version(int32_t v) {
_have_version = true;
_version = v;
}
bool has_version(void) const { return _have_version; }
int32_t version(void) const { return _version; }
bool has_label(void) const { return _have_label; }
const std::string& label() const { return _label; }
bool has_nogood(void) const { return _have_nogood; }
const std::string& nogood(void) const { return _nogood; }
// generic optional fields
bool has_info(void) const { return _have_info; }
const std::string& info(void) const { return _info; }
void set_type(MsgType type) { _type = type; }
MsgType type(void) const { return _type; }
void reset(void) {
_have_label = false;
_have_nogood = false;
_have_info = false;
_have_version = false;
}
};
class MessageMarshalling {
private:
/// Only optional fields are listed here, if node (no need for field id)
enum Field {
LABEL = 0,
NOGOOD = 1,
INFO = 2,
VERSION = 3
};
Message msg;
typedef char* iter;
static void serializeType(std::vector<char>& data, MsgType f) {
data.push_back(static_cast<char>(f));
}
static void serializeField(std::vector<char>& data, Field f) {
data.push_back(static_cast<char>(f));
}
static void serialize(std::vector<char>& data, int32_t i) {
data.push_back(static_cast<char>((i & 0xFF000000) >> 24));
data.push_back(static_cast<char>((i & 0xFF0000) >> 16));
data.push_back(static_cast<char>((i & 0xFF00) >> 8));
data.push_back(static_cast<char>((i & 0xFF)));
}
static void serialize(std::vector<char>& data, NodeStatus s) {
data.push_back(static_cast<char>(s));
}
static void serialize(std::vector<char>& data, const std::string& s) {
serialize(data, static_cast<int32_t>(s.size()));
for (char c : s) {
data.push_back(c);
}
}
static MsgType deserializeMsgType(iter& it) {
auto m = static_cast<MsgType>(*it);
++it;
return m;
}
static Field deserializeField(iter& it) {
auto f = static_cast<Field>(*it);
++it;
return f;
}
static int32_t deserializeInt(iter& it) {
auto b1 = static_cast<uint32_t>(reinterpret_cast<uint8_t&>(*it++));
auto b2 = static_cast<uint32_t>(reinterpret_cast<uint8_t&>(*it++));
auto b3 = static_cast<uint32_t>(reinterpret_cast<uint8_t&>(*it++));
auto b4 = static_cast<uint32_t>(reinterpret_cast<uint8_t&>(*it++));
return static_cast<int32_t>(b1 << 24 | b2 << 16 | b3 << 8 | b4);
}
static NodeStatus deserializeStatus(iter& it) {
auto f = static_cast<NodeStatus>(*it);
++it;
return f;
}
static std::string deserializeString(iter& it) {
std::string result;
int32_t size = deserializeInt(it);
result.reserve(static_cast<size_t>(size));
for (int32_t i = 0; i < size; i++) {
result += *it;
++it;
}
return result;
}
public:
Message& makeNode(NodeUID node, NodeUID parent,
int32_t alt, int32_t kids, NodeStatus status) {
msg.reset();
msg.set_type(MsgType::NODE);
msg.set_nodeUID(node);
msg.set_parentUID(parent);
msg.set_alt(alt);
msg.set_kids(kids);
msg.set_status(status);
return msg;
}
void makeStart(const std::string& info) {
msg.reset();
msg.set_type(MsgType::START);
msg.set_version(PROFILER_PROTOCOL_VERSION);
msg.set_info(info); /// info contains name, has_restarts, execution id
}
void makeRestart(const std::string& info) {
msg.reset();
msg.set_type(MsgType::RESTART);
msg.set_info(info); /// info contains restart_id (-1 default)
}
void makeDone(void) {
msg.reset();
msg.set_type(MsgType::DONE);
}
const Message& get_msg(void) { return msg; }
std::vector<char> serialize(void) const {
std::vector<char> data;
size_t dataSize = 1 + (msg.isNode() ? 4 * 8 + 1 : 0) +
(msg.has_label() ? 1 + 4 + msg.label().size() : 0) +
(msg.has_nogood() ? 1 + 4 + msg.nogood().size() : 0) +
(msg.has_info() ? 1 + 4 + msg.info().size() : 0);
data.reserve(dataSize);
serializeType(data, msg.type());
if (msg.isNode()) {
// serialize NodeId node
auto n_uid = msg.nodeUID();
serialize(data, n_uid.nid);
serialize(data, n_uid.rid);
serialize(data, n_uid.tid);
// serialize NodeId parent
auto p_uid = msg.parentUID();
serialize(data, p_uid.nid);
serialize(data, p_uid.rid);
serialize(data, p_uid.tid);
// Other Data
serialize(data, msg.alt());
serialize(data, msg.kids());
serialize(data, msg.status());
}
if(msg.has_version()) {
serializeField(data, VERSION);
serialize(data, msg.version());
}
if (msg.has_label()) {
serializeField(data, LABEL);
serialize(data, msg.label());
}
if (msg.has_nogood()) {
serializeField(data, NOGOOD);
serialize(data, msg.nogood());
}
if (msg.has_info()) {
serializeField(data, INFO);
serialize(data, msg.info());
}
return data;
}
void deserialize(char* data, size_t size) {
char *end = data + size;
msg.set_type(deserializeMsgType(data));
if (msg.isNode()) {
int32_t nid = deserializeInt(data);
int32_t rid = deserializeInt(data);
int32_t tid = deserializeInt(data);
msg.set_nodeUID({nid, rid, tid});
nid = deserializeInt(data);
rid = deserializeInt(data);
tid = deserializeInt(data);
msg.set_parentUID({nid, rid, tid});
msg.set_alt(deserializeInt(data));
msg.set_kids(deserializeInt(data));
msg.set_status(deserializeStatus(data));
}
msg.reset();
while (data != end) {
MessageMarshalling::Field f = deserializeField(data);
switch (f) {
case VERSION:
msg.set_version(deserializeInt(data)); break;
case LABEL:
msg.set_label(deserializeString(data)); break;
case NOGOOD:
msg.set_nogood(deserializeString(data)); break;
case INFO:
msg.set_info(deserializeString(data)); break;
default:
break;
}
}
}
};
}}
// STATISTICS: search-trace
|