Aren/haiku
1
0
Fork 0
Code Issues Pull Requests Packages Projects Releases Wiki Activity
a8e846d0f4
haiku/src/apps/debugger/value/value_nodes/BListValueNode.h

69 lines
1.6 KiB
C
Raw Normal View History

Add type handler and corresponding value node for BList. - When a debugging libbe is present, and a BList is encountered, we now read its internal structure and expose it as if it were an array of pointers. Combined with typecasting, this means one can now easily inspect the content of such a list.
2012-12-03 00:19:08 +04:00
/*
Implement ranged container hooks for B{Object}List handler.
2013-04-27 22:21:13 +04:00
* Copyright 2012-2013, Rene Gollent, rene@gollent.com.
Add type handler and corresponding value node for BList. - When a debugging libbe is present, and a BList is encountered, we now read its internal structure and expose it as if it were an array of pointers. Combined with typecasting, this means one can now easily inspect the content of such a list.
2012-12-03 00:19:08 +04:00
* Distributed under the terms of the MIT License.
*/
#ifndef BLIST_VALUE_NODE_H
#define BLIST_VALUE_NODE_H
#include <List.h>
#include <Variant.h>
#include <ObjectList.h>
#include "ValueLocation.h"
#include "ValueNode.h"
class CompoundType;
class BListValueNode : public ValueNode {
public:
BListValueNode(ValueNodeChild* nodeChild,
Type* type);
virtual ~BListValueNode();
virtual Type* GetType() const;
virtual status_t ResolvedLocationAndValue(
ValueLoader* valueLoader,
ValueLocation*& _location,
Value*& _value);
virtual bool ChildCreationNeedsValue() const
{ return true; }
virtual status_t CreateChildren();
virtual int32 CountChildren() const;
virtual ValueNodeChild* ChildAt(int32 index) const;
Implement ranged container hooks for B{Object}List handler.
2013-04-27 22:21:13 +04:00
virtual bool IsRangedContainer() const;
virtual void ClearChildren();
virtual status_t CreateChildrenInRange(int32 lowIndex,
int32 highIndex);
virtual status_t SupportedChildRange(int32& lowIndex,
int32& highIndex) const;
Add type handler and corresponding value node for BList. - When a debugging libbe is present, and a BList is encountered, we now read its internal structure and expose it as if it were an array of pointers. Combined with typecasting, this means one can now easily inspect the content of such a list.
2012-12-03 00:19:08 +04:00
private:
class BListElementNodeChild;
Show total capacity on BList/BObjectList nodes. - Since we currently limit the maximum number of child elements we'll show, it's helpful information to know the actual capacity of the list in case it contains more, especially when we later support requesting additional elements to be retrieved.
2012-12-05 06:11:39 +04:00
class BListItemCountNodeChild;
GCC2 build fix.
2012-12-03 00:32:46 +04:00
// for GCC2
friend class BListElementNodeChild;
Show total capacity on BList/BObjectList nodes. - Since we currently limit the maximum number of child elements we'll show, it's helpful information to know the actual capacity of the list in case it contains more, especially when we later support requesting additional elements to be retrieved.
2012-12-05 06:11:39 +04:00
friend class BListItemCountNodeChild;
GCC2 build fix.
2012-12-03 00:32:46 +04:00
Add type handler and corresponding value node for BList. - When a debugging libbe is present, and a BList is encountered, we now read its internal structure and expose it as if it were an array of pointers. Combined with typecasting, this means one can now easily inspect the content of such a list.
2012-12-03 00:19:08 +04:00
typedef BObjectList<ValueNodeChild> ChildNodeList;
private:
Type* fType;
ChildNodeList fChildren;
ValueLoader* fLoader;
BVariant fDataLocation;
Show total capacity on BList/BObjectList nodes. - Since we currently limit the maximum number of child elements we'll show, it's helpful information to know the actual capacity of the list in case it contains more, especially when we later support requesting additional elements to be retrieved.
2012-12-05 06:11:39 +04:00
BVariant fItemCountLocation;
Type* fItemCountType;
Add type handler and corresponding value node for BList. - When a debugging libbe is present, and a BList is encountered, we now read its internal structure and expose it as if it were an array of pointers. Combined with typecasting, this means one can now easily inspect the content of such a list.
2012-12-03 00:19:08 +04:00
int32 fItemCount;
Implement ranged container hooks for B{Object}List handler.
2013-04-27 22:21:13 +04:00
bool fCountChildCreated;
Add type handler and corresponding value node for BList. - When a debugging libbe is present, and a BList is encountered, we now read its internal structure and expose it as if it were an array of pointers. Combined with typecasting, this means one can now easily inspect the content of such a list.
2012-12-03 00:19:08 +04:00
};
#endif // BLIST_VALUE_NODE_H
Reference in New Issue Copy Permalink