Searched refs:nextOffset (Results 1 - 13 of 13) sorted by relevance

/haiku/src/servers/input/
H A DBottomlineWindow.cpp93 int32 nextOffset = 0; local
97 for (++nextOffset; (string[nextOffset] & 0xC0) == 0x80; ++nextOffset)
104 BString bytes(string + offset, nextOffset - offset);
110 offset = nextOffset;
/haiku/src/add-ons/translators/jpeg/
H A Dexif_parser.cpp255 off_t nextOffset; local
257 parse_tiff_tag(read, tag, nextOffset);
282 if (visited.find(nextOffset) != visited.end())
285 read.Seek(nextOffset, SEEK_SET);
286 visited.insert(nextOffset);
/haiku/src/add-ons/kernel/file_systems/bfs/
H A DBPlusTree.cpp978 BPlusTree::_UpdateIterators(off_t offset, off_t nextOffset, uint16 keyIndex, argument
989 iterator.Next()->Update(offset, nextOffset, keyIndex, splitAt, change);
1128 off_t nextOffset; local
1130 &nextOffset);
1132 if (status == B_ENTRY_NOT_FOUND && nextOffset == nodeAndKey.nodeOffset)
1143 nodeAndKey.nodeOffset = nextOffset;
2240 off_t nextOffset; local
2242 &nextOffset);
2255 } else if (nextOffset == nodeOffset)
2258 nodeOffset = nextOffset;
2302 off_t nextOffset; local
2472 off_t nextOffset = parent->OverflowLink(); local
2521 _ValidateChild(TreeCheck& check, CachedNode& cached, uint32 level, off_t offset, off_t lastOffset, off_t nextOffset, const uint8* key, uint16 keyLength) argument
2606 off_t nextOffset; local
2828 off_t nextOffset = 0; local
2855 Update(off_t offset, off_t nextOffset, uint16 keyIndex, uint16 splitAt, int8 change) argument
[all...]
H A DBPlusTree.h356 void _UpdateIterators(off_t offset, off_t nextOffset,
369 off_t nextOffset, const uint8* key,
425 void Update(off_t offset, off_t nextOffset,
/haiku/src/add-ons/kernel/partitioning_systems/intel/
H A Dwrite_support.cpp207 off_t* nextOffset, off_t* nextSize)
232 *nextOffset = nextSibling->offset;
248 off_t* nextOffset, off_t* nextSize)
273 *nextOffset = nextSibling->offset;
305 off_t previousOffset = 0, previousSize = 0, nextOffset = 0, nextSize = 0; local
308 &nextSibling, &previousOffset, &previousSize, &nextOffset, &nextSize);
310 if (nextSibling && (nextOffset < childOffset + *size))
311 *size = nextOffset - childOffset;
363 off_t previousOffset = 0, previousSize = 0, nextOffset = 0, nextSize = 0; local
366 &nextSibling, &previousOffset, &previousSize, &nextOffset,
204 get_sibling_partitions_pm(partition_data* partition, partition_data* child, off_t childOffset, partition_data** previous, partition_data** next, off_t* previousOffset, off_t* previousSize, off_t* nextOffset, off_t* nextSize) argument
245 get_sibling_partitions_ep(partition_data* partition, partition_data* child, off_t childOffset, partition_data** previous, partition_data** next, off_t* previousOffset, off_t* previousSize, off_t* nextOffset, off_t* nextSize) argument
498 off_t previousOffset = 0, previousSize = 0, nextOffset = 0, nextSize = 0; local
[all...]
/haiku/src/apps/terminal/
H A DHistoryBuffer.cpp278 int32 nextOffset = (fBufferAllocationOffset + bytesNeeded + 1) & ~1; local
283 || offset >= nextOffset) {
300 // nextOffset.
/haiku/src/add-ons/kernel/network/dns_resolver/kernel_add_on/
H A Ddns_resolver.cpp105 uint64 nextOffset = reinterpret_cast<uint64>(current->ai_next); local
117 = reinterpret_cast<addrinfo*>(generalOffset + nextOffset);
/haiku/src/add-ons/kernel/partitioning_systems/common/
H A DPartitionMap.cpp892 off_t nextOffset = 0; local
895 if (partition->Offset() < nextOffset && i > 0) {
898 - (nextOffset - partition->Offset());
910 nextOffset = partition->Offset() + partition->Size();
/haiku/src/bin/bfs_tools/lib/
H A DBPlusTree.cpp636 off_t nextOffset; local
637 status_t status = FindKey(node,key,keyLength,&nodeAndKey.keyIndex,&nextOffset);
639 if (status == B_ENTRY_NOT_FOUND && nextOffset == nodeAndKey.nodeOffset)
645 nodeAndKey.nodeOffset = nextOffset;
/haiku/src/add-ons/translators/raw/
H A DRAW.cpp342 off_t nextOffset; local
344 _ParseTIFFTag(baseOffset, tag, nextOffset);
351 fRead.Seek(nextOffset, SEEK_SET);
480 off_t nextOffset; local
482 _ParseTIFFTag(baseOffset, tag, nextOffset);
701 fRead.Seek(nextOffset, SEEK_SET);
718 off_t nextOffset;
720 _ParseTIFFTag(baseOffset, tag, nextOffset);
778 fRead.Seek(nextOffset, SEEK_SET);
2862 off_t nextOffset;
[all...]
/haiku/src/kits/interface/textview_support/
H A DStyleBuffer.cpp476 int32 nextOffset = (run + 1)->offset - fromOffset; local
477 result = min_c(result, nextOffset);
/haiku/src/kits/interface/
H A DSplitLayout.cpp1133 int32 nextOffset = splitterOffset + (int32)fSplitterSize + (int32)fSpacing; local
1147 left = splitterFrame.left + nextOffset;
1168 top = splitterFrame.top + nextOffset;
H A DTextView.cpp3882 int32 nextOffset = _NextInitialByte(fromOffset); local
3883 if (toOffset < nextOffset && fromOffset < textLength)
3884 toOffset = nextOffset;

Completed in 127 milliseconds