| /haiku/headers/build/private/storage/ |
| H A D | MergedDirectory.h | 53 int32 index1, const entry_ref& entry2,
|
| /haiku/headers/private/storage/ |
| H A D | MergedDirectory.h | 53 int32 index1, const entry_ref& entry2,
|
| /haiku/headers/private/storage/mime/ |
| H A D | DatabaseDirectory.h | 33 int32 index1, const entry_ref& entry2,
|
| /haiku/src/kits/storage/mime/ |
| H A D | DatabaseDirectory.cpp | 61 const entry_ref& entry2, int32 index2)
63 return _IsValidMimeTypeEntry(entry1) || !_IsValidMimeTypeEntry(entry2);
60 ShallPreferFirstEntry(const entry_ref& entry1, int32 index1, const entry_ref& entry2, int32 index2) argument
|
| /haiku/src/servers/package/ |
| H A D | FSUtils.cpp | 76 FSUtils::CompareFileContent(const Entry& entry1, const Entry& entry2, argument
85 error = _OpenFile(entry2, file2);
156 FSUtils::CompareSymLinks(const Entry& entry1, const Entry& entry2, bool& _equal) argument
164 error = _OpenSymLink(entry2, symLink2);
|
| H A D | FSUtils.h | 206 const Entry& entry2, bool& _equal);
211 const Entry& entry2, bool& _equal);
|
| /haiku/headers/posix/ |
| H A D | dirent.h | 51 const struct dirent** entry2);
55 const struct dirent** entry2));
|
| /haiku/src/build/libbe/storage/ |
| H A D | MergedDirectory.cpp | 214 const entry_ref& entry2, int32 index2)
213 ShallPreferFirstEntry(const entry_ref& entry1, int32 index1, const entry_ref& entry2, int32 index2) argument
|
| /haiku/src/kits/storage/ |
| H A D | MergedDirectory.cpp | 207 const entry_ref& entry2, int32 index2)
206 ShallPreferFirstEntry(const entry_ref& entry1, int32 index1, const entry_ref& entry2, int32 index2) argument
|
| /haiku/src/kits/tracker/ |
| H A D | FindPanel.cpp | 1959 SortByDatePredicate(const EntryWithDate* entry1, const EntryWithDate* entry2) argument
1961 return entry1->second > entry2->second ?
1962 -1 : (entry1->second == entry2->second ? 0 : 1);
|
| H A D | OpenWithWindow.cpp | 1721 BEntry entry2(&trackerInfo.ref);
1722 entry2.GetPath(&path2);
|
| /haiku/src/servers/registrar/ |
| H A D | TRoster.cpp | 102 /*! \brief Returns true if entry1's index is larger than entry2's index.
110 larger_index(const recent_entry* entry1, const recent_entry* entry2) argument
112 if (entry1 && entry2)
113 return entry1->index > entry2->index;
|
| /haiku/src/tests/kits/storage/ |
| H A D | DirectoryTest.cpp | 1357 BEntry entry2(existingFile);
1358 CPPUNIT_ASSERT( entry2.InitCheck() == B_OK );
1359 CPPUNIT_ASSERT( entry == entry2 );
|
| H A D | EntryTest.cpp | 1962 compareEntries(const BEntry &entry, const BEntry &entry2, argument
1970 //printf("InitCheck(): %x, %x\n", entry.InitCheck(), entry2.InitCheck());
1971 CPPUNIT_ASSERT( (entry == entry2) == (testEntry == testEntry2) );
1972 CPPUNIT_ASSERT( (entry == entry2) == (testEntry2 == testEntry) );
1973 CPPUNIT_ASSERT( (entry != entry2) == (testEntry != testEntry2) );
1974 CPPUNIT_ASSERT( (entry != entry2) == (testEntry2 != testEntry) );
1986 BEntry entry2; local
1987 CPPUNIT_ASSERT( entry == entry2 );
1988 CPPUNIT_ASSERT( entry2 == entry );
1989 CPPUNIT_ASSERT( !(entry != entry2) );
1996 BEntry entry2; local
2091 BEntry entry2; local
2112 BEntry entry2; local
[all...] |
| H A D | MimeTypeTest.cpp | 625 BEntry entry2(testApp2);
627 CHK(entry2.InitCheck() == B_OK);
628 CHK(entry2.GetRef(&appRef2) == B_OK);
|
| /haiku/src/tests/system/kernel/util/ |
| H A D | BOpenHashTableTest.cpp | 265 Entry entry2(456);
273 table.Insert(&entry2);
282 CPPUNIT_ASSERT_EQUAL(table.Lookup(456), &entry2);
317 Entry entry2(456);
323 CPPUNIT_ASSERT_EQUAL(table.Insert(&entry2), B_OK);
|