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 415 416 417 418 419 420 421 422 423 424 425 426 427 428 429 430 431 432
|
// **************************************************************************
// begin : Tue Aug 17 1999
// copyright : (C) 1999 by John Birch
// email : jbb@kdevelop.org
// **************************************************************************
// **************************************************************************
// *
// 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. *
// *
// **************************************************************************
#include "gdbparser.h"
#include <kdebug.h>
#include <QRegExp>
#include <QByteArray>
#include <ctype.h>
#include <stdlib.h>
namespace GDBDebugger
{
// **************************************************************************
// **************************************************************************
// **************************************************************************
GDBParser *GDBParser::GDBParser_ = 0;
GDBParser *GDBParser::getGDBParser()
{
if (!GDBParser_)
GDBParser_ = new GDBParser();
return GDBParser_;
}
// **************************************************************************
void GDBParser::destroy()
{
delete GDBParser_;
GDBParser_ = 0;
}
// **************************************************************************
GDBParser::GDBParser()
{
}
// **************************************************************************
GDBParser::~GDBParser()
{
}
// **************************************************************************
QString GDBParser::getName(const char **buf)
{
const char *start = skipNextTokenStart(*buf);
if (*start) {
*buf = skipTokenValue(start);
return QByteArray(start, *buf - start + 1);
} else
*buf = start;
return QString();
}
// **************************************************************************
QString GDBParser::getValue(const char **buf)
{
const char *start = skipNextTokenStart(*buf);
*buf = skipTokenValue(start);
QString value(QByteArray(start, *buf - start + 1).data());
return value;
}
QString GDBParser::undecorateValue(DataType type, const QString& s)
{
QByteArray l8 = s.toLocal8Bit();
const char* start = l8;
const char* end = start + s.length();
if (*start == '{')
{
// Gdb uses '{' in two cases:
// - composites (arrays and structures)
// - pointers to functions. In this case type is
// enclosed in "{}". Not sure why it's so, as
// when printing pointer, type is in parenthesis.
if (type == typePointer)
{
// Looks like type in braces at the beginning. Strip it.
start = skipDelim(start, '{', '}');
}
else
{
// Looks like composite, strip the braces and return.
return QByteArray(start+1, end - start - 2);
}
}
else if (*start == '(')
{
// Strip the type of the pointer from the value.
//
// When printing values of pointers, gdb prints the pointer
// type as well. This is not necessary for kdevelop -- after
// all, there's separate column with value type. But that behaviour
// is not configurable. The only way to change it is to explicitly
// pass the 'x' format specifier to the 'print' command.
//
// We probably can achieve that by sending an 'print in hex' request
// as soon as we know the type of variable, but that would be complex
// and probably conflict with 'toggle hex/decimal' command.
// So, address this problem as close to debugger as possible.
// We can't find the first ')', because type can contain '(' and ')'
// characters if its function pointer. So count opening and closing
// parentheses.
start = skipDelim(start, '(', ')');
}
QString value(QByteArray(start, end - start + 1).data());
value = value.trimmed();
if (value[0] == '@')
{
// It's a reference, we need to show just the value.
if (int i = value.indexOf(":"))
{
value = value.mid(i+2);
}
else
{
// Just reference, no value at all, remove all
value = "";
}
}
if (value.indexOf("Cannot access memory") == 0)
value = "(inaccessible)";
return value.trimmed();
}
QString GDBParser::undecorateValue(const QString& s)
{
DataType dataType = determineType(s.toLocal8Bit());
QString r = undecorateValue(dataType, s.toLocal8Bit());
return r;
}
// Given a value that starts with 0xNNNNNN determines if
// it looks more like pointer, or a string value.
DataType pointerOrValue(const char *buf)
{
while (*buf) {
if (!isspace(*buf))
buf++;
else if (*(buf+1) == '\"')
return typeValue;
else
break;
}
return typePointer;
}
DataType GDBParser::determineType(const char *buf) const
{
if (!buf || !*(buf= skipNextTokenStart(buf)))
return typeUnknown;
// A reference, probably from a parameter value.
if (*buf == '@')
return typeReference;
// Structures and arrays - (but which one is which?)
// {void (void)} 0x804a944 <__builtin_new+41> - this is a fn pointer
// (void (*)(void)) 0x804a944 <f(E *, char)> - so is this - ugly!!!
if (*buf == '{') {
if (strncmp(buf, "{{", 2) == 0)
return typeArray;
if (strncmp(buf, "{<No data fields>}", 18) == 0)
return typeValue;
buf++;
while (*buf) {
switch (*buf) {
case '=':
return typeStruct;
case '"':
buf = skipString(buf);
break;
case '\'':
buf = skipQuotes(buf, '\'');
break;
case ',':
if (*(buf-1) == '}')
Q_ASSERT(false);
return typeArray;
case '}':
if (*(buf+1) == ',' || *(buf+1) == '\n' || !*(buf+1))
return typeArray; // Hmm a single element array??
if (strncmp(buf+1, " 0x", 3) == 0)
return typePointer; // What about references?
return typeUnknown; // very odd?
case '(':
buf = skipDelim(buf, '(', ')');
break;
case '<':
buf = skipDelim(buf, '<', '>');
// gdb may produce this output:
// $1 = 0x804ddf3 ' ' <repeats 20 times>, "TESTSTRING"
// after having finished with the "repeats"-block we need
// to check if the string continues
if ( buf[0] == ',' && (buf[2] == '\"' || buf[2] == '\'') ) {
buf++; //set the buffer behind the comma to indicate that the string continues
}
break;
default:
buf++;
break;
}
}
return typeUnknown;
}
// some sort of address. We need to sort out if we have
// a 0x888888 "this is a char*" type which we'll term a value
// or whether we just have an address
if (strncmp(buf, "0x", 2) == 0) {
return pointerOrValue(buf);
}
// Pointers and references - references are a bit odd
// and cause GDB to fail to produce all the local data
// if they haven't been initialised. but that's not our problem!!
// (void (*)(void)) 0x804a944 <f(E *, char)> - this is a fn pointer
if (*buf == '(') {
buf = skipDelim(buf, '(', ')');
// This 'if' handles values like this:
// (int (&)[3]) @0xbffff684: {5, 6, 7}
// which is a reference to array.
if (buf[1] == '@')
return typeReference;
// This 'if' handles values like this:
// (int (*)[3]) 0xbffff810
if (strncmp(buf, " 0x", 3) == 0)
{
++buf;
return pointerOrValue(buf);
}
switch (*(buf-2)) {
case '*':
return typePointer;
case '&':
return typeReference;
default:
switch (*(buf-8)) {
case '*':
return typePointer;
case '&':
return typeReference;
}
return typeUnknown;
}
}
buf = skipTokenValue(buf);
if ((strncmp(buf, " = ", 3) == 0) || (*buf == '='))
return typeName;
return typeValue;
}
// **************************************************************************
const char *GDBParser::skipString(const char *buf) const
{
if (buf && *buf == '\"') {
buf = skipQuotes(buf, *buf);
while (*buf) {
if ((strncmp(buf, ", \"", 3) == 0) ||
(strncmp(buf, ", '", 3) == 0))
buf = skipQuotes(buf+2, *(buf+2));
else if (strncmp(buf, " <", 2) == 0) // take care of <repeats
buf = skipDelim(buf+1, '<', '>');
else
break;
}
// If the string is long then it's chopped and has ... after it.
while (*buf && *buf == '.')
buf++;
}
return buf;
}
// ***************************************************************************
const char *GDBParser::skipQuotes(const char *buf, char quotes) const
{
if (buf && *buf == quotes) {
buf++;
while (*buf) {
if (*buf == '\\')
buf++; // skips \" or \' problems
else if (*buf == quotes)
return buf+1;
buf++;
}
}
return buf;
}
// **************************************************************************
const char *GDBParser::skipDelim(const char *buf, char open, char close) const
{
if (buf && *buf == open) {
buf++;
while (*buf) {
if (*buf == open)
buf = skipDelim(buf, open, close);
else if (*buf == close)
return buf+1;
else if (*buf == '\"')
buf = skipString(buf);
else if (*buf == '\'')
buf = skipQuotes(buf, *buf);
else if (*buf)
buf++;
}
}
return buf;
}
// **************************************************************************
const char *GDBParser::skipTokenValue(const char *buf) const
{
if (buf) {
while (true) {
buf = skipTokenEnd(buf);
const char *end = buf;
while (*end && isspace(*end) && *end != '\n')
end++;
if (*end == 0 || *end == ',' || *end == '\n' || *end == '=' || *end == '}')
break;
if (buf == end)
break;
buf = end;
}
}
return buf;
}
// **************************************************************************
const char *GDBParser::skipTokenEnd(const char *buf) const
{
if (buf) {
switch (*buf) {
case '"':
return skipString(buf);
case '\'':
return skipQuotes(buf, *buf);
case '{':
return skipDelim(buf, '{', '}');
case '<':
buf = skipDelim(buf, '<', '>');
// gdb may produce this output:
// $1 = 0x804ddf3 ' ' <repeats 20 times>, "TESTSTRING"
// after having finished with the "repeats"-block we need
// to check if the string continues
if ( buf[0] == ',' && (buf[2] == '\"' || buf[2] == '\'') ) {
buf++; //set the buffer behind the comma to indicate that the string continues
}
return buf;
case '(':
return skipDelim(buf, '(', ')');
}
while (*buf && !isspace(*buf) && *buf != ',' && *buf != '}' && *buf != '=')
buf++;
}
return buf;
}
// **************************************************************************
const char *GDBParser::skipNextTokenStart(const char *buf) const
{
if (buf)
while (*buf && (isspace(*buf) || *buf == ',' || *buf == '}' || *buf == '='))
buf++;
return buf;
}
// **************************************************************************
// **************************************************************************
// **************************************************************************
}
|