duplicate
size_t duplicate = 0;
&indexValue, &keyLength, (size_t)sizeof(indexValue), &duplicate);
if (fHasIndex && duplicate < 2 && !CompareTo((uint8*)&indexValue, keyLength)) {
if (duplicate > 0)
net_buffer* (*duplicate)(net_buffer* from);
bplustree_node* duplicate = cachedDuplicate.SetToWritable(
if (duplicate == NULL)
duplicate_array* array = duplicate->FragmentAt(
if (duplicate->FragmentsUsed(fNodeSize) < 2) {
memmove(duplicate->DuplicateArray(), array,
duplicate->left_link = duplicate->right_link
array = duplicate->DuplicateArray();
const bplustree_node* duplicate;
duplicate = cachedDuplicate.SetTo(duplicateOffset, false);
if (duplicate == NULL)
array = duplicate->DuplicateArray();
&& (oldValue = duplicate->RightLink()) != BPLUSTREE_NULL);
bplustree_node* duplicate = cachedDuplicate.SetToWritable(transaction,
if (duplicate == NULL)
duplicate_array* array = duplicate->FragmentAt(
if (duplicate->FragmentsUsed(fNodeSize) == 1) {
if (duplicate->LeftLink() != BPLUSTREE_NULL) {
", inode %" B_PRIdOFF "!\n", duplicate->LeftLink(), fStream->ID()));
while (duplicate != NULL) {
array = duplicate->DuplicateArray();
if ((duplicateOffset = duplicate->RightLink()) == BPLUSTREE_NULL)
duplicate = cachedDuplicate.SetToWritable(transaction, duplicateOffset,
if (duplicate == NULL)
off_t left = duplicate->LeftLink();
off_t right = duplicate->RightLink();
&& (duplicate = cachedDuplicate.SetToWritable(transaction, left,
duplicate->right_link = HOST_ENDIAN_TO_BFS_INT64(right);
array = duplicate->DuplicateArray();
&& duplicate->LeftLink() == BPLUSTREE_NULL
&& (duplicate = cachedDuplicate.SetToWritable(transaction,
duplicate->left_link = HOST_ENDIAN_TO_BFS_INT64(left);
array = duplicate->DuplicateArray();
&& duplicate->RightLink() == BPLUSTREE_NULL
memmove(duplicate, array,
memset((off_t*)duplicate + NUM_FRAGMENT_VALUES + 1, 0,
uint16 maxLength, off_t* value, uint16* duplicate)
if (duplicate)
*duplicate = 2;
if (duplicate)
*duplicate = 0;
if (duplicate)
*duplicate = 1;
off_t* value, uint16* duplicate = NULL);
uint16* duplicate = NULL);
uint16* duplicate = NULL);
off_t* value, uint16* duplicate)
duplicate);
off_t* value, uint16* duplicate)
duplicate);
uint16 duplicate;
bufferSize, &iterator->offset, &duplicate);
*_duplicate = duplicate;
void* value, size_t* _valueLength, size_t bufferSize, size_t* duplicate)
void* value, size_t* _valueLength, size_t bufferSize, size_t* duplicate)
buffer = gBufferModule->duplicate(original);
net_buffer *copy = gBufferModule->duplicate(packet);
net_buffer* reply = gBufferModule->duplicate(buffer);
net_buffer *reply = gBufferModule->duplicate(buffer);
net_buffer *loopbackBuffer = gBufferModule->duplicate(buffer);
net_buffer* duplicate = create_buffer(DATA_NODE_SIZE);
if (duplicate == NULL)
TRACE(("%d: duplicate: %p)\n", find_thread(NULL), duplicate));
if (append_data(duplicate, node->start, node->used) < B_OK) {
free_buffer(duplicate);
copy_metadata(duplicate, buffer);
ASSERT(duplicate->size == buffer->size);
CHECK_BUFFER(duplicate);
RUN_PARANOIA_CHECKS(duplicate);
T(Duplicate(buffer, duplicate));
return duplicate;
net_buffer* duplicate = create_buffer(0);
if (duplicate == NULL)
if (append_data(duplicate, buffer->data, buffer->size) != B_OK) {
free_buffer(duplicate);
copy_metadata(duplicate, buffer);
return duplicate;
bool duplicate = false;
duplicate = true;
if (duplicate)
BUF_PUSH_2 (duplicate, c1);
case duplicate:
case duplicate:
case duplicate:
case duplicate:
bool duplicate = false;
duplicate = true;
if (duplicate)
uint16 duplicate;
&value, &duplicate)) == B_OK) {
void* value, size_t* _valueLength, size_t bufferSize, size_t* duplicate)