fValues
BList* fValues;
ValueTable* fValues;
StackFrameValues* fValues;
StackFrameValues* Values() const { return fValues; }
ValueTable* fValues;
ValueTable* fValues;
const BMessage& Message() const { return fValues; }
BMessage fValues;
{ return fValues.Size()
- fValues.CountItems(); }
CircularBuffer<int64> fValues;
DataHistory* values = fValues.ItemAt(i);
DataHistory* values = fValues.ItemAt(i);
DataHistory* values = fValues.ItemAt(i);
fValues(1),
int64* value = fValues.ItemAt(x - Start());
if ((int32)fValues.Size() != width
fValues.SetSize(width);
if (updateWidth > (int32)fValues.Size()) {
updateWidth = fValues.Size();
fValues.AddItem(value);
ListAddDeleter<DataHistory> valuesDeleter(fValues, values, insert);
DataHistory* values = fValues.RemoveItemAt(index);
fValues.MakeEmpty();
BObjectList<DataHistory> fValues;
fValues(NULL),
if (fValues == values)
if (fValues != NULL)
fValues->ReleaseReference();
fValues = values;
if (fValues != NULL)
fValues->AcquireReference();
{ return fValues; }
StackFrameValues* fValues;
fValues.RemoveName(settingID);
return fValues.AddMessage(settingID, &data) == B_OK;
return fValues.FindMessage(settingID, &data);
return fValues;
fValues = other.fValues;
fValues.MakeEmpty();
error = archive.FindMessage("values", &fValues);
error = archive.AddMessage("values", &fValues);
BMessage fValues;
for (int32 i = 0; DwarfEnumeratorValue* value = fValues.ItemAt(i); i++)
return fValues.CountItems();
return fValues.ItemAt(index);
if (!fValues.AddItem(value))
ValueList fValues;
fValues(NULL)
for (ValueTable::Iterator it = other.fValues->GetIterator();
fValues = new(std::nothrow) ValueTable;
if (fValues == NULL)
return fValues->Init();
ValueEntry* entry = fValues->Lookup(Key(function, thread, *expression));
return fValues->Lookup(Key(function, thread, *expression)) != NULL;
ValueEntry* entry = fValues->Lookup(Key(function, thread, expression));
fValues->Insert(entry);
if (fValues != NULL) {
ValueEntry* entry = fValues->Clear(true);
delete fValues;
fValues = NULL;
fValues(NULL)
fValues(NULL),
if (fValues != NULL)
fValues->ReleaseReference();
fValues = new(std::nothrow) StackFrameValues;
if (fValues == NULL)
status_t error = fValues->Init();
fValues(NULL)
fValues = new(std::nothrow) ValueTable;
if (fValues == NULL)
return fValues->Init();
InfoEntry* entry = fValues->Lookup(
return fValues->Lookup(Key(variable, (TypeComponentPath*)path)) != NULL;
InfoEntry* entry = fValues->Lookup(Key(variable, path));
fValues->Insert(entry);
if (fValues != NULL) {
InfoEntry* entry = fValues->Clear(true);
delete fValues;
fValues = NULL;
for (ValueTable::Iterator it = other.fValues->GetIterator();
fValues = new(std::nothrow) ValueTable;
if (fValues == NULL)
return fValues->Init();
ValueEntry* entry = fValues->Lookup(
return fValues->Lookup(Key(variable, (TypeComponentPath*)path)) != NULL;
ValueEntry* entry = fValues->Lookup(Key(variable, path));
fValues->Insert(entry);
if (fValues != NULL) {
ValueEntry* entry = fValues->Clear(true);
delete fValues;
fValues = NULL;
fValues(NULL)
fValues(NULL)
status_t error = fValues.FindMessage("source:mapping", index, &mapping);
if (settings->SetTo(fValues) != B_OK) {
fValues = other.fValues;
fValues = archive;
archive = fValues;
if (fValues.GetInfo("source:mapping", &type, &count) == B_OK)
|| fValues.AddMessage("source:mapping", &mapping) != B_OK) {
fValues()
return fValues.RemoveData("source:mapping", index);
BMessage fValues;
|| fValues.AddMessage(skSignalSettingName, &setting) != B_OK) {
return fValues.RemoveData(skSignalSettingName, index);
status_t error = fValues.FindMessage(skSignalSettingName, index, &setting);
if (settings->SetTo(fValues) != B_OK) {
fValues()
fValues = other.fValues;
fValues = archive;
archive = fValues;
fValues.MakeEmpty();
fValues.SetInt32(skDefaultSignalFieldName, disposition);
return fValues.GetInt32(skDefaultSignalFieldName,
if (fValues.GetInfo(skSignalSettingName, &type, &count) == B_OK)
BMessage fValues;
return value.SetFromMessage(fValues, setting->ID()) == B_OK
if (value.SetFromMessage(fValues, settingID) == B_OK)
fValues.RemoveName(fieldName);
bool success = value.AddToMessage(fValues, fieldName) == B_OK;
return fValues->CountItems();
int32* item = static_cast<int32*>(fValues->ItemAt(index));
if (!fValues->AddItem(valueCopy))
fValues->RemoveItem(valueCopy);
for (int32 i = fValues->CountItems(); i-- > 0;) {
delete static_cast<int32*>(fValues->ItemAt(i));
fValues->MakeEmpty();
int32 count = fValues->CountItems();
int32 count = fValues->CountItems();
const int32* value = static_cast<int32*>(fValues->ItemAt(i));
fValues = new BList();
delete fValues;
if (fValues[index] == NULL)
if (strcmp(fValues[index], newValue) != 0)
if (fValues[index] == NULL)
if (strcmp(fValues[index], *argv) != 0)
const char* const* fValues;
fValues[index] = value;
addr_t* fValues;
fValues(NULL),
fValues = (addr_t*)malloc(sizeof(addr_t) * fTableSize);
if (fValues == NULL || fDSOs == NULL || fValuesResolved == NULL) {
free(fValues);
fValues = NULL;
free(fValues);
return fValues[index];
return fValues[index];
Link fValues[fValueCount];
fValues[i].data = i * 2;
fValues[i].next.next = NULL; // Leave some next pointers invalid just for fun
fList->Add(&fValues[i]);
fList->Add(&fValues[i]);
CPPUNIT_ASSERT(*element == fValues[preIndex]);