/haiku/src/system/kernel/vm/ |
H A D | VMUtils.cpp | 24 int nameLength = 0; local 27 nameLength = strlen(volumeName); 28 if (nameLength == 0) { 31 nameLength = strlen(volumeName); 32 if (nameLength == 0) { 34 nameLength = strlen(volumeName); 38 BStackOrHeapArray<char, 128> basePath(nameLength + 2); 41 int32 len = snprintf(basePath, nameLength + 2, "/%s", volumeName);
|
/haiku/src/apps/cortex/support/ |
H A D | ProfileTarget.cpp | 65 uint32 nameLength; member in class:fnDumpEntry 67 fnDumpEntry(uint32 _n) : nameLength(_n) { 68 maxPad.SetTo(' ', nameLength); 76 namePad.SetTo(' ', nameLength-strlen(entry.name)); 92 uint32 nameLength = 0; local 97 if((*it).first.Length() > nameLength) 98 nameLength = (*it).first.Length(); 105 for_each(sorted.begin(), sorted.end(), fnDumpEntry(nameLength));
|
/haiku/headers/private/kernel/ |
H A D | real_time_clock.h | 41 size_t nameLength); 43 size_t nameLength);
|
/haiku/src/add-ons/kernel/file_systems/xfs/ |
H A D | Attribute.h | 34 virtual status_t GetNext(char* name, size_t* nameLength) = 0; 36 virtual status_t Lookup(const char* name, size_t* nameLength) = 0;
|
H A D | NodeAttribute.h | 27 status_t GetNext(char* name, size_t* nameLength); 29 status_t Lookup(const char* name, size_t* nameLength);
|
H A D | ShortAttribute.h | 38 status_t GetNext(char* name, size_t* nameLength); 40 status_t Lookup(const char* name, size_t* nameLength);
|
H A D | ShortAttribute.cpp | 125 ShortAttribute::GetNext(char* name, size_t* nameLength) argument 140 *nameLength = entry->namelen + 1; 141 TRACE("Entry found name : %s, namelength : %ld", name, *nameLength); 153 ShortAttribute::Lookup(const char* name, size_t* nameLength) argument 163 status = strncmp(name, PtrToOffset, *nameLength);
|
H A D | NodeAttribute.cpp | 260 NodeAttribute::GetNext(char* name, size_t* nameLength) argument 310 *nameLength = local->namelen + 1; 311 TRACE("Entry found name : %s, namelength : %ld", name, *nameLength); 317 *nameLength = remote->namelen + 1; 318 TRACE("Entry found name : %s, namelength : %ld", name, *nameLength); 332 NodeAttribute::Lookup(const char* name, size_t* nameLength) argument 335 uint32 hashValueOfRequest = hashfunction(name, *nameLength); 379 status = strncmp(name, PtrToOffset, *nameLength); 388 status = strncmp(name, PtrToOffset, *nameLength);
|
H A D | LeafAttribute.cpp | 235 LeafAttribute::GetNext(char* name, size_t* nameLength) argument 260 *nameLength = local->namelen + 1; 261 TRACE("Entry found name : %s, namelength : %ld", name, *nameLength); 267 *nameLength = remote->namelen + 1; 268 TRACE("Entry found name : %s, namelength : %ld", name, *nameLength); 279 LeafAttribute::Lookup(const char* name, size_t* nameLength) argument 282 uint32 hashValueOfRequest = hashfunction(name, *nameLength); 306 status = strncmp(name, ptrToOffset, *nameLength); 315 status = strncmp(name, ptrToOffset, *nameLength);
|
/haiku/src/system/boot/loader/file_systems/packagefs/ |
H A D | PackageSettingsItem.h | 40 bool SetName(const char* name, size_t nameLength) argument 42 fName = (char*)malloc(nameLength + 1); 46 memcpy(fName, name, nameLength); 47 fName[nameLength] = '\0'; 85 EntryKey(Entry* parent, const char* name, size_t nameLength) argument 89 fNameLength(nameLength) 142 size_t nameLength) const;
|
H A D | PackageSettingsItem.cpp | 125 size_t nameLength = componentEnd - path; local 127 Entry* entry = FindEntry(parent, name, nameLength); 130 if (entry == NULL || !entry->SetName(name, nameLength)) { 158 size_t nameLength) const 160 return fEntries.Lookup(EntryKey(parent, name, nameLength));
|
/haiku/src/tests/system/kernel/file_corruption/fs/ |
H A D | Directory.cpp | 40 size_t nameLength, bool& _exactMatch) const; 46 size_t nameLength, uint64 blockIndex); 48 size_t nameLength); 98 size_t nameLength, uint64 blockIndex, 221 DirEntryBlock::FindInsertionIndex(const char* name, size_t nameLength, argument 241 cmp = compare_names(entryName, entryNameLength, name, nameLength); 276 DirEntryBlock::InsertEntry(int32 index, const char* name, size_t nameLength, argument 294 memmove(entryNames + nameOffset + nameLength + 2, 303 fBlock->nameEnds[i] = fBlock->nameEnds[i - 1] + nameLength; 311 memcpy(entryNames + nameOffset, name, nameLength); 320 ReplaceEntryName(int32 index, const char* name, size_t nameLength) argument 376 uint32 nameLength = nameEnd - nameOffset; local 489 uint16 nameLength = nameEnd - previousEnd; local 557 size_t nameLength = strlen(name); local 627 size_t nameLength = strlen(name); local 761 size_t nameLength = strlen(name); local 852 size_t nameLength = strlen(name); local 1104 _UpdateOrInsertKey(LevelInfo* infos, int32 level, const char* name, size_t nameLength, uint64 blockIndex, bool insertKey, Transaction& transaction) argument [all...] |
/haiku/src/add-ons/kernel/file_systems/btrfs/ |
H A D | Attribute.cpp | 90 size_t nameLength = strlen(fName); local 93 status_t status = _Lookup(fName, nameLength, &entries, &length); 98 status = _FindEntry(entries, length, fName, nameLength, &entry); 118 size_t nameLength = strlen(fName); 121 status_t status = _Lookup(fName, nameLength, &entries, &length); 126 status = _FindEntry(entries, length, fName, nameLength, &entry); 147 Attribute::_Lookup(const char* name, size_t nameLength, argument 150 uint32 hash = calculate_crc((uint32)~1, (uint8*)name, nameLength); 181 const char* name, size_t nameLength, btrfs_dir_entry** _entry) 180 _FindEntry(btrfs_dir_entry* entries, size_t length, const char* name, size_t nameLength, btrfs_dir_entry** _entry) argument
|
H A D | Attribute.h | 55 status_t _Lookup(const char* name, size_t nameLength, 61 size_t nameLength,
|
H A D | DirectoryIterator.h | 30 * \param nameLength Length of name being searched 33 status_t Lookup(const char* name, size_t nameLength, ino_t* _id);
|
/haiku/headers/private/file_systems/ |
H A D | fs_ops_support.h | 37 next_dirent(struct dirent* dirent, size_t nameLength, size_t& bufferRemaining) argument 39 const size_t reclen = offsetof(struct dirent, d_name) + nameLength + 1;
|
/haiku/src/tests/system/kernel/unit/ |
H A D | TestSuite.cpp | 48 TestSuite::FindTest(const char* name, int32 nameLength) const 50 if (nameLength < 0) 51 nameLength = strlen(name); 54 if (strlen(test->Name()) == (size_t)nameLength 55 && strncmp(test->Name(), name, nameLength) == 0) {
|
/haiku/src/add-ons/kernel/file_systems/ext2/ |
H A D | DirectoryIterator.h | 36 size_t nameLength, ino_t id, uint8 type); 50 status_t _AllocateBestEntryInBlock(uint8 nameLength, uint16& pos, 53 uint8 nameLength, ino_t id, uint8 fileType, 57 const char* name, uint8 nameLength, ino_t id,
|
H A D | DirectoryIterator.cpp | 263 uint8 nameLength = _nameLength > EXT2_NAME_LENGTH ? EXT2_NAME_LENGTH local 271 status = _AllocateBestEntryInBlock(nameLength, pos, newLength); 273 return _AddEntry(transaction, name, nameLength, id, type, newLength, 307 return _SplitIndexedBlock(transaction, name, nameLength, id, type, 316 return _AddEntry(transaction, name, nameLength, id, type, fBlockSize, 0, 331 size_t nameLength = EXT2_NAME_LENGTH; local 332 status = Get(buffer, &nameLength, &id); 334 if (length == nameLength 335 && strncmp(name, buffer, nameLength) == 0) { 447 DirectoryIterator::_AllocateBestEntryInBlock(uint8 nameLength, uint1 argument 505 _AddEntry(Transaction& transaction, const char* name, uint8 nameLength, ino_t id, uint8 type, uint16 newLength, uint16 pos, bool hasPrevious) argument 545 _SplitIndexedBlock(Transaction& transaction, const char* name, uint8 nameLength, ino_t id, uint8 type, uint32 newBlocksPos, bool firstSplit) argument [all...] |
/haiku/src/kits/app/ |
H A D | MessageUtils.cpp | 52 size_t nameLength = 0; local 54 nameLength = strlen(ref->name) + 1; 55 if (*size < nameLength) 58 memcpy((void *)buffer, (const void *)ref->name, nameLength); 61 *size = sizeof(ref->device) + sizeof(ref->directory) + nameLength;
|
/haiku/src/kits/media/ |
H A D | MediaAddOn.cpp | 305 int32 nameLength = name ? (int32)strlen(name) : -1; local 343 *(int32*)buf = nameLength; buf += sizeof(int32); 344 if (nameLength > 0) { 345 memcpy(buf, name, nameLength); 346 buf += nameLength; 385 int32 nameLength; local 410 nameLength = *(int32*)buf; buf += sizeof(int32); 411 if (nameLength >= 0) { // if nameLength is -1, we leave name = 0 412 char* nameStorage = new(std::nothrow) char [nameLength [all...] |
/haiku/headers/private/package/ |
H A D | packagefs.h | 93 uint32 nameLength; member in struct:PackageFSActivationChangeItem
|
/haiku/src/libs/gnu/ |
H A D | xattr.cpp | 249 size_t nameLength = strlen(attributeName.name); local 250 totalSize += nameLength + 1; 252 if (remainingSize > nameLength) { 254 buffer += nameLength + 1; 255 remainingSize -= nameLength + 1;
|
/haiku/src/tools/elfsymbolpatcher/ |
H A D | ElfImage.cpp | 72 int32 nameLength = strlen(name); local 74 char foundName[nameLength + 1]; 78 if (debug_next_image_symbol(iterator, foundName, nameLength + 1,
|
/haiku/src/bin/rc/ |
H A D | rc.cpp | 133 size_t nameLength = strlen(name); local 136 if (nameLength > extLength) 137 return strcmp(name + nameLength - extLength, ext) == 0;
|