* EnumerationValue -> EnumeratorValue
* Since some types don't have names (e.g. pointer types or anonymous structs or
unions), each type does now also have a unique ID. The global type cache
registers types by ID and by name (if they have one). This fixes clashes of
types with empty names.
* Completely refactored the code dealing with variable values. Formerly we had
Variable and TypeComponentPath to navigate to a component, mapped to a
BVariant representing the value. Now we have:
* Interface Value with various subclasses (BoolValue, IntegerValue, etc.) to
represent a value, with the flexibility for more esoteric values.
* A tree of ValueNode+ValueNodeChild objects to represent the components of a
variable. On top of each ValueNodeChild sits a ValueNode representing the
value of the component, potentially having ValueNodeChild children. This
should allow casting a component value, simply by replacing its ValueNode.
* Interface ValueHandler and various implementations for the different value
types. It is basically a factory for classes allowing to format/display a
value.
* ValueHandlerRoster -- a registry for ValueHandlers, finding the best one
for a given value.
* Interface TypeHandler and various implementions for the different type
kinds (primitive, compound, address, etc.). It is basically a factory for
ValueNodes for that type.
* TypeHandlerRoster -- a registry for TypeHandlers, finding the best one
for a given type.
That's still a bit work in progress. It introduces at least one regression:
The VariablesView doesn't save/restore its state anymore. Will take a while
until that is added back.
git-svn-id: file:///srv/svn/repos/haiku/haiku/trunk@33907 a95241bf-73f2-0310-859d-f6bbb57e9c96
2009-11-05 18:15:21 +00:00
|
|
|
/*
|
2015-06-07 13:27:13 -04:00
|
|
|
* Copyright 2015, Rene Gollent, rene@gollent.com.
|
* EnumerationValue -> EnumeratorValue
* Since some types don't have names (e.g. pointer types or anonymous structs or
unions), each type does now also have a unique ID. The global type cache
registers types by ID and by name (if they have one). This fixes clashes of
types with empty names.
* Completely refactored the code dealing with variable values. Formerly we had
Variable and TypeComponentPath to navigate to a component, mapped to a
BVariant representing the value. Now we have:
* Interface Value with various subclasses (BoolValue, IntegerValue, etc.) to
represent a value, with the flexibility for more esoteric values.
* A tree of ValueNode+ValueNodeChild objects to represent the components of a
variable. On top of each ValueNodeChild sits a ValueNode representing the
value of the component, potentially having ValueNodeChild children. This
should allow casting a component value, simply by replacing its ValueNode.
* Interface ValueHandler and various implementations for the different value
types. It is basically a factory for classes allowing to format/display a
value.
* ValueHandlerRoster -- a registry for ValueHandlers, finding the best one
for a given value.
* Interface TypeHandler and various implementions for the different type
kinds (primitive, compound, address, etc.). It is basically a factory for
ValueNodes for that type.
* TypeHandlerRoster -- a registry for TypeHandlers, finding the best one
for a given type.
That's still a bit work in progress. It introduces at least one regression:
The VariablesView doesn't save/restore its state anymore. Will take a while
until that is added back.
git-svn-id: file:///srv/svn/repos/haiku/haiku/trunk@33907 a95241bf-73f2-0310-859d-f6bbb57e9c96
2009-11-05 18:15:21 +00:00
|
|
|
* Copyright 2009, Ingo Weinhold, ingo_weinhold@gmx.de.
|
|
|
|
|
* Distributed under the terms of the MIT License.
|
|
|
|
|
*/
|
|
|
|
|
#ifndef ADDRESS_VALUE_NODE_H
|
|
|
|
|
#define ADDRESS_VALUE_NODE_H
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
#include "ValueNode.h"
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
class AddressValueNodeChild;
|
|
|
|
|
class AddressType;
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
class AddressValueNode : public ValueNode {
|
|
|
|
|
public:
|
|
|
|
|
AddressValueNode(ValueNodeChild* nodeChild,
|
|
|
|
|
AddressType* type);
|
|
|
|
|
virtual ~AddressValueNode();
|
|
|
|
|
|
|
|
|
|
virtual Type* GetType() const;
|
|
|
|
|
|
|
|
|
|
virtual status_t ResolvedLocationAndValue(
|
|
|
|
|
ValueLoader* valueLoader,
|
|
|
|
|
ValueLocation*& _location,
|
|
|
|
|
Value*& _value);
|
|
|
|
|
|
|
|
|
|
// locking required
|
|
|
|
|
|
2015-06-07 13:27:13 -04:00
|
|
|
virtual status_t CreateChildren(TeamTypeInformation* info);
|
* EnumerationValue -> EnumeratorValue
* Since some types don't have names (e.g. pointer types or anonymous structs or
unions), each type does now also have a unique ID. The global type cache
registers types by ID and by name (if they have one). This fixes clashes of
types with empty names.
* Completely refactored the code dealing with variable values. Formerly we had
Variable and TypeComponentPath to navigate to a component, mapped to a
BVariant representing the value. Now we have:
* Interface Value with various subclasses (BoolValue, IntegerValue, etc.) to
represent a value, with the flexibility for more esoteric values.
* A tree of ValueNode+ValueNodeChild objects to represent the components of a
variable. On top of each ValueNodeChild sits a ValueNode representing the
value of the component, potentially having ValueNodeChild children. This
should allow casting a component value, simply by replacing its ValueNode.
* Interface ValueHandler and various implementations for the different value
types. It is basically a factory for classes allowing to format/display a
value.
* ValueHandlerRoster -- a registry for ValueHandlers, finding the best one
for a given value.
* Interface TypeHandler and various implementions for the different type
kinds (primitive, compound, address, etc.). It is basically a factory for
ValueNodes for that type.
* TypeHandlerRoster -- a registry for TypeHandlers, finding the best one
for a given type.
That's still a bit work in progress. It introduces at least one regression:
The VariablesView doesn't save/restore its state anymore. Will take a while
until that is added back.
git-svn-id: file:///srv/svn/repos/haiku/haiku/trunk@33907 a95241bf-73f2-0310-859d-f6bbb57e9c96
2009-11-05 18:15:21 +00:00
|
|
|
virtual int32 CountChildren() const;
|
|
|
|
|
virtual ValueNodeChild* ChildAt(int32 index) const;
|
|
|
|
|
|
|
|
|
|
private:
|
|
|
|
|
AddressType* fType;
|
|
|
|
|
AddressValueNodeChild* fChild;
|
|
|
|
|
};
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
class AddressValueNodeChild : public ValueNodeChild {
|
|
|
|
|
public:
|
|
|
|
|
AddressValueNodeChild(AddressValueNode* parent,
|
|
|
|
|
const BString& name, Type* type);
|
|
|
|
|
virtual ~AddressValueNodeChild();
|
|
|
|
|
|
|
|
|
|
virtual const BString& Name() const;
|
|
|
|
|
virtual Type* GetType() const;
|
|
|
|
|
virtual ValueNode* Parent() const;
|
|
|
|
|
|
|
|
|
|
virtual status_t ResolveLocation(ValueLoader* valueLoader,
|
|
|
|
|
ValueLocation*& _location);
|
|
|
|
|
|
|
|
|
|
private:
|
|
|
|
|
AddressValueNode* fParent;
|
|
|
|
|
BString fName;
|
|
|
|
|
Type* fType;
|
|
|
|
|
};
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
#endif // ADDRESS_VALUE_NODE_H
|
