| /haiku/headers/private/file_systems/ |
| H A D | QueryParser.h | 145 const uint8* newKey, size_t newLength);
1451 int32 type, const uint8* oldKey, size_t oldLength, const uint8* newKey,
1465 LiveUpdate(entry, node, attribute, type, oldKey, oldLength, newKey,
1475 type, newKey, newLength);
|
| /haiku/src/add-ons/kernel/file_systems/bfs/ |
| H A D | BPlusTree.cpp | 1526 uint8* newKey = NULL; local
1533 // the parent node, so we will set the "newKey" already here.
1536 newKey = key;
1551 newKey = (uint8*)malloc(newLength);
1552 if (newKey == NULL)
1556 memcpy(newKey, droppedKey, newLength);
1602 free(newKey);
1657 // If it's the dropped key, "newKey" was already set earlier.
1659 if (newKey == NULL)
1660 newKey
[all...] |
| H A D | Query.cpp | 1361 const uint8* oldKey, size_t oldLength, const uint8* newKey,
1372 newKey, newLength);
1403 name = (const char*)newKey;
|
| H A D | Volume.cpp | 411 const uint8* oldKey, size_t oldLength, const uint8* newKey,
419 query->LiveUpdate(inode, attribute, type, oldKey, oldLength, newKey,
410 UpdateLiveQueries(Inode* inode, const char* attribute, int32 type, const uint8* oldKey, size_t oldLength, const uint8* newKey, size_t newLength) argument
|
| H A D | Volume.h | 133 const uint8* newKey, size_t newLength);
|
| H A D | Index.cpp | 213 /*! Updates the specified index, the oldKey will be removed from, the newKey
221 const uint8* oldKey, uint16 oldLength, const uint8* newKey,
225 || (oldKey == NULL && newKey == NULL)
227 || (newKey != NULL && newLength == 0))
241 oldKey, oldLength, newKey, newLength)) {
247 newKey, newLength);
275 if (newKey != NULL) {
276 status = tree->Insert(transaction, (const uint8*)newKey, newLength,
220 Update(Transaction& transaction, const char* name, int32 type, const uint8* oldKey, uint16 oldLength, const uint8* newKey, uint16 newLength, Inode* inode) argument
|
| H A D | Index.h | 34 uint16 oldLength, const uint8* newKey,
|
| H A D | Query.h | 57 size_t oldLength, const uint8* newKey,
|
| /haiku/src/add-ons/kernel/file_systems/packagefs/volume/ |
| H A D | Volume.cpp | 620 const void* oldKey, size_t oldLength, const void* newKey,
625 query->LiveUpdate(node, attribute, type, oldKey, oldLength, newKey,
619 UpdateLiveQueries(Node* node, const char* attribute, int32 type, const void* oldKey, size_t oldLength, const void* newKey, size_t newLength) argument
|
| H A D | Volume.h | 87 const void* newKey, size_t newLength);
|
| /haiku/src/add-ons/kernel/file_systems/ramfs/ |
| H A D | Query.h | 46 const void* newKey, size_t newLength);
|
| H A D | Query.cpp | 335 const void* oldKey, size_t oldLength, const void* newKey, size_t newLength)
338 oldLength, (const uint8*)newKey, newLength);
334 LiveUpdate(Entry* entry, Node* node, const char* attribute, int32 type, const void* oldKey, size_t oldLength, const void* newKey, size_t newLength) argument
|
| H A D | Volume.cpp | 708 int32 type, const uint8 *oldKey, size_t oldLength, const uint8 *newKey,
717 newKey, newLength);
707 UpdateLiveQueries(Entry *entry, Node* node, const char *attribute, int32 type, const uint8 *oldKey, size_t oldLength, const uint8 *newKey, size_t newLength) argument
|
| H A D | Attribute.cpp | 87 uint8 newKey[kMaxIndexKeyLength]; local
89 GetKey(newKey, &newLength);
91 oldLength, newKey, newLength);
|
| H A D | Volume.h | 153 const uint8 *newKey, size_t newLength);
|
| /haiku/src/system/kernel/scheduler/ |
| H A D | scheduler_cpu.cpp | 548 int32 newKey; local
552 newKey = intervalSkipped ? fCurrentLoad : GetLoad();
561 newKey = GetLoad();
566 ASSERT(newKey >= 0);
568 if (oldKey == newKey)
571 if (newKey > kHighLoad) {
577 gCoreHighLoadHeap.Insert(this, newKey);
581 gCoreHighLoadHeap.ModifyKey(this, newKey);
582 } else if (newKey < kMediumLoad) {
588 gCoreLoadHeap.Insert(this, newKey);
[all...] |
| /haiku/src/add-ons/kernel/file_systems/packagefs/indices/ |
| H A D | Query.cpp | 280 const void* oldKey, size_t oldLength, const void* newKey, size_t newLength)
283 oldLength, (const uint8*)newKey, newLength);
279 LiveUpdate(Node* node, const char* attribute, int32 type, const void* oldKey, size_t oldLength, const void* newKey, size_t newLength) argument
|
| H A D | Query.h | 38 const void* newKey, size_t newLength);
|
| /haiku/headers/private/kernel/util/ |
| H A D | Heap.h | 85 inline void ModifyKey(Element* element, Key newKey);
209 HEAP_CLASS_NAME::ModifyKey(Element* element, Key newKey) argument
215 link->fKey = newKey;
217 if (sCompare(newKey, oldKey))
219 else if (sCompare(oldKey, newKey))
|
| H A D | MinMaxHeap.h | 81 inline void ModifyKey(Element* element, Key newKey);
231 MIN_MAX_HEAP_CLASS_NAME::ModifyKey(Element* element, Key newKey) argument
236 link->fKey = newKey;
238 if (!sCompare(newKey, oldKey) && !sCompare(oldKey, newKey))
241 if (sCompare(newKey, oldKey) ^ !link->fMinTree)
|