Searched refs:newLength (Results 1 - 25 of 39) sorted by relevance

12

/haiku/src/kits/shared/
H A DHashString.cpp70 HashString::Truncate(int32 newLength) argument
72 if (newLength < 0)
73 newLength = 0;
74 if (newLength < fLength) {
77 if (!_SetTo(string, newLength)) {
79 fLength = newLength;
/haiku/src/add-ons/kernel/file_systems/userlandfs/shared/
H A DString.cpp68 String::Truncate(int32 newLength) argument
70 if (newLength < 0)
71 newLength = 0;
72 if (newLength < fLength) {
75 if (!_SetTo(string, newLength)) {
77 fLength = newLength;
/haiku/src/add-ons/kernel/file_systems/ramfs/
H A DString.h45 inline void Truncate(int32 newLength);
124 String::Truncate(int32 newLength) argument
126 if (newLength < 0)
127 newLength = 0;
128 if (newLength < fLength) {
131 if (!_SetTo(string, newLength)) {
133 fLength = newLength;
H A DAttribute.cpp88 size_t newLength = kMaxIndexKeyLength; local
89 GetKey(newKey, &newLength);
91 oldLength, newKey, newLength);
H A DQuery.h46 const void* newKey, size_t newLength);
H A DQuery.cpp335 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
/haiku/src/add-ons/kernel/file_systems/iso9660/
H A Diso9660_identify.h43 void _SetString(char **string, const char *newString, uint32 newLength);
H A Diso9660_identify.cpp199 uint32 newLength)
205 *string, newString, (unsigned)newLength));
211 oldString = (char*)malloc(newLength + 1);
213 memcpy(oldString, newString, newLength);
214 oldString[newLength] = '\0';
198 _SetString(char **string, const char *newString, uint32 newLength) argument
/haiku/src/add-ons/kernel/file_systems/ext2/
H A DBitmapBlock.cpp401 uint32 newLength = endPos - startPos; local
403 if (newLength > length) {
405 length = newLength;
413 if (newLength >= 32)
433 uint32 newLength = (index - startIndex - 1) << 5; local
443 ++newLength;
451 ++newLength;
454 if (newLength > length) {
456 length = newLength;
473 uint32 newLength local
[all...]
H A DDirectoryIterator.h51 uint16& newLength);
54 uint16 newLength, uint16 pos,
H A DDirectoryIterator.cpp269 uint16 newLength; local
271 status = _AllocateBestEntryInBlock(nameLength, pos, newLength);
273 return _AddEntry(transaction, name, nameLength, id, type, newLength,
448 uint16& newLength)
480 newLength = realLength;
498 newLength = bestRealLength;
506 uint8 nameLength, ino_t id, uint8 type, uint16 newLength, uint16 pos,
510 "%c)\n", name, nameLength, id, type, newLength, pos,
522 dirEntry->SetLength(newLength);
524 dirEntry = (ext2_dir_entry*)&block[pos + newLength];
447 _AllocateBestEntryInBlock(uint8 nameLength, uint16& pos, uint16& newLength) argument
505 _AddEntry(Transaction& transaction, const char* name, uint8 nameLength, ino_t id, uint8 type, uint16 newLength, uint16 pos, bool hasPrevious) argument
662 uint16 newLength = EXT2_DIR_REC_LEN(nameLength); local
[all...]
/haiku/src/add-ons/kernel/file_systems/bfs/
H A DQuery.h58 size_t newLength);
62 const char* newName, size_t newLength);
H A DIndex.cpp222 uint16 newLength, Inode* inode)
227 || (newKey != NULL && newLength == 0))
238 if (newLength == 0)
240 } else if (newLength != 0 && !QueryParser::compareKeys(type,
241 oldKey, oldLength, newKey, newLength)) {
247 newKey, newLength);
276 status = tree->Insert(transaction, (const uint8*)newKey, newLength,
305 uint16 newLength = newName != NULL ? strlen(newName) : 0; local
307 oldLength, (uint8*)newName, newLength, inode);
220 Update(Transaction& transaction, const char* name, int32 type, const uint8* oldKey, uint16 oldLength, const uint8* newKey, uint16 newLength, Inode* inode) argument
H A DIndex.h35 uint16 newLength, Inode* inode);
H A DVolume.cpp412 size_t newLength)
420 newLength);
432 size_t newLength = strlen(newName); local
438 newDirectoryID, newName, newLength);
410 UpdateLiveQueries(Inode* inode, const char* attribute, int32 type, const uint8* oldKey, size_t oldLength, const uint8* newKey, size_t newLength) argument
/haiku/src/bin/
H A Dlogger.cpp178 int32 newLength = length + strlen(argv[i]) + 1; local
180 buffer = (char *)realloc(buffer, newLength + 1);
187 length = newLength;
/haiku/headers/private/shared/
H A DHashString.h44 void Truncate(int32 newLength);
/haiku/headers/private/userlandfs/shared/
H A DString.h45 void Truncate(int32 newLength);
/haiku/src/add-ons/kernel/file_systems/packagefs/indices/
H A DQuery.h38 const void* newKey, size_t newLength);
H A DQuery.cpp280 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
/haiku/src/kits/locale/
H A DHashMapCatalog.cpp157 int newLength = 0; local
196 newLength++;
202 newLength++;
208 stringToParse.UnlockBuffer(newLength);
/haiku/src/kits/interface/textview_support/
H A DUndoBuffer.cpp386 int32 newLength = fTextLength + charLen; local
387 char* buffer = (char*)malloc(newLength);
392 if (fTextLength < newLength) {
398 fTextLength = newLength;
/haiku/headers/private/file_systems/
H A DQueryParser.h145 const uint8* newKey, size_t newLength);
149 const char* newName, size_t newLength);
1449 size_t newLength)
1463 newLength);
1472 type, newKey, newLength);
1518 ino_t newDirectoryID, const char* newName, size_t newLength)
1528 B_STRING_TYPE, (const uint8*)newName, newLength);
/haiku/src/kits/support/
H A DString.cpp833 BString::Truncate(int32 newLength, bool lazy) argument
835 if (newLength < 0)
836 newLength = 0;
838 if (newLength < Length()) {
840 _MakeWritable(newLength, true);
2594 int32 newLength = length + count; local
2595 if (!newLength) {
2600 char* newData = _Allocate(newLength);
2681 int32 newLength = length + count * (withLength - searchLength); local
2682 if (!newLength) {
[all...]
/haiku/src/add-ons/kernel/file_systems/packagefs/volume/
H A DVolume.h87 const void* newKey, size_t newLength);

Completed in 196 milliseconds

12