Lines Matching defs:attribute

69 	PrimaryKey(Attribute *attribute, const uint8 *theKey,
71 : attribute(attribute), length(length)
73 PrimaryKey(Attribute *attribute)
74 : attribute(attribute) { attribute->GetKey(key, &length); }
76 : attribute(NULL), length(length)
79 Attribute *attribute;
107 if (a.attribute != NULL && a.attribute == b.attribute)
121 if (Attribute **attribute = fIterator.GetCurrent()) {
122 fNode = (*attribute)->GetNode();
130 if (Attribute **attribute = fIterator.GetNext()) {
131 fNode = (*attribute)->GetNode();
222 for (Attribute **attribute = it.GetCurrent(); attribute; it.GetNext())
223 (*attribute)->SetIndex(NULL, false);
237 AttributeIndexImpl::Changed(Attribute *attribute, const uint8 *oldKey,
241 if (attribute && attribute->GetIndex() == this) {
242 // update the iterators and remove the attribute from the tree
244 if (attribute->IsInIndex()) {
247 PrimaryKey(attribute, oldKey, oldLength), attribute, &it);
248 if (foundAttribute && *foundAttribute == attribute) {
249 Node *node = attribute->GetNode();
257 // remove and re-insert the attribute
261 // re-insert the attribute
262 if (fKeyLength > 0 && attribute->GetSize() != (off_t)fKeyLength) {
263 attribute->SetIndex(this, false);
265 error = fAttributes->Insert(attribute);
267 attribute->SetIndex(this, true);
269 attribute->SetIndex(NULL, false);
277 AttributeIndexImpl::Added(Attribute *attribute)
279 PRINT("AttributeIndex::Add(%p)\n", attribute);
280 status_t error = (attribute ? B_OK : B_BAD_VALUE);
282 size_t size = attribute->GetSize();
284 attribute->SetIndex(this, false);
286 error = fAttributes->Insert(attribute);
288 attribute->SetIndex(this, true);
296 AttributeIndexImpl::Removed(Attribute *attribute)
298 PRINT("AttributeIndex::Removed(%p)\n", attribute);
299 bool result = (attribute && attribute->GetIndex() == this);
301 if (attribute->IsInIndex())
302 fAttributes->Remove(attribute, attribute);
303 attribute->SetIndex(NULL, false);
381 if (Attribute **attribute = fIterator.fIterator.GetCurrent()) {
382 if ((*attribute)->GetNode() == entry->GetNode()) {
383 (*attribute)->GetKey(buffer, keyLength);
385 FATAL("Node of current attribute and node of current entry "
387 (*attribute)->GetNode()->GetID(),
393 "attribute.\n", entry->GetName(),
453 // get the attribute node's first entry
470 if (Attribute **attribute = fIterator.fIterator.GetCurrent()) {
473 (*attribute)->GetKey(attrKey, &attrKeyLength);