Searched refs:entry (Results 226 - 250 of 1061) sorted by relevance

1234567891011>>

/haiku-fatelf/src/apps/text_search/
H A DGrepApp.cpp58 BEntry entry(argv[i]);
60 entry.GetRef(&ref);
62 if (entry.Exists()) {
/haiku-fatelf/src/bin/findutils/lib/
H A Dsavedirinfo.c191 char const *entry = dp->d_name; local
192 if (entry[entry[0] != '.' ? 0 : entry[1] != '.' ? 1 : 2] != '\0')
195 size_t entry_size = strlen (entry) + 1;
197 memcpy ((result->buffer) + namebuf_used, entry, entry_size);
335 char const *entry = dp->d_name;
336 if (entry[entry[0] != '.' ? 0 : entry[
[all...]
/haiku-fatelf/src/kits/package/
H A DPackageRoster.cpp107 status_t operator()(const BEntry& entry) argument
110 status_t result = entry.GetName(name);
231 dirent* entry = (dirent*)&buffer; local
232 while (directory.GetNextDirents(entry, sizeof(buffer), 1) == 1) {
233 if (strcmp(entry->d_name, ".") == 0 || strcmp(entry->d_name, "..") == 0)
238 error = packagePath.SetTo(packagesDirPath.Path(), entry->d_name);
293 BEntry entry(path->Path(), true);
294 if (!entry.Exists()) {
315 BEntry entry;
[all...]
/haiku-fatelf/src/servers/registrar/
H A DRecentEntries.cpp39 \brief A recent entry, the corresponding signature of the application
92 /*! \brief Places the given entry Places the app with the given signature at the front of
113 // Look for a previous instance of this entry
122 // Add this entry to the front of the list
123 recent_entry *entry = new (nothrow) recent_entry(ref, appSig, 0); local
124 if (entry == NULL)
128 fEntryList.push_front(entry);
147 same entry were added under different app sigs, and both instances
267 for each entry in one place, while at the same time updating
268 the index values for each entry/si
281 recent_entry *entry = *item; local
310 recent_entry *entry = *item; local
[all...]
/haiku-fatelf/src/tests/add-ons/kernel/file_systems/userlandfs/r5/src/test/netfs/server/
H A DNode.h31 void AddReferringEntry(Entry* entry);
32 void RemoveReferringEntry(Entry* entry);
36 Entry* GetNextReferringEntry(Entry* entry) const;
/haiku-fatelf/src/tests/servers/app/code_to_name/
H A Dcode_to_name.cpp97 BEntry entry; local
98 while ((status = query.GetNextEntry(&entry)) == B_OK) {
99 BPath path(&entry);
/haiku-fatelf/src/tests/system/kernel/
H A Dnode_monitor_test.cpp48 BEntry entry(args[i]);
49 if (!entry.Exists()) {
55 entry.GetNodeRef(&nodeRef);
/haiku-fatelf/src/tests/kits/net/preflet/
H A DNetworkSetupWindow.cpp184 BEntry entry; local
188 while (dir.GetNextEntry(&entry) >= 0) {
190 entry.GetPath(&name);
192 if (entry.IsSymLink() &&
194 BSymLink symlink(&entry);
204 if (!entry.IsDirectory())
240 BEntry entry; local
256 entry.SetTo(&ai.ref);
257 entry.GetPath(&path);
272 while (dir.GetNextEntry(&entry) >
[all...]
/haiku-fatelf/headers/private/libroot/
H A Dpthread_private.h67 void *(*entry)(void*); member in struct:_pthread_thread
81 pthread_thread *__allocate_pthread(void* (*entry)(void*), void *data);
82 void __init_pthread(pthread_thread* thread, void* (*entry)(void*), void* data);
/haiku-fatelf/src/apps/mediaplayer/playlist/
H A DFilePlaylistItem.cpp114 BEntry entry(&fRefs[0], false);
115 return entry.Rename(string.String(), false);
305 BEntry entry(&fRefs[0], true);
308 entry.GetName(originalName);
315 entry.GetPath(&path);
318 while (directory.GetNextEntry(&entry) == B_OK) {
320 if (entry.GetName(name) != B_OK)
328 BFile file(&entry, B_READ_ONLY);
393 BEntry entry(&fRefs[0], true);
394 BNode node(&entry);
[all...]
/haiku-fatelf/src/bin/gdb/bfd/
H A Dmerge.c32 /* An entry in the section merge hash table. */
37 /* Length of this entry. This includes the zero terminator. */
99 /* Routine to create an entry in a section merge hashtab. */
102 sec_merge_hash_newfunc (struct bfd_hash_entry *entry, argument
107 if (entry == NULL)
108 entry = bfd_hash_allocate (table, sizeof (struct sec_merge_hash_entry));
109 if (entry == NULL)
113 entry = bfd_hash_newfunc (entry, table, string);
115 if (entry !
266 register struct sec_merge_hash_entry *entry; local
287 sec_merge_emit(bfd *abfd, struct sec_merge_hash_entry *entry) argument
431 struct sec_merge_hash_entry *entry; local
784 struct sec_merge_hash_entry *entry; local
[all...]
/haiku-fatelf/src/tests/add-ons/kernel/file_systems/userlandfs/r5/src/test/ramfs/
H A DQuery.cpp71 // (1024 + 16 * entry count), so we don't need to adjust the code using it.
123 if (Entry *entry = fIterator.GetCurrent(buffer, &keyLength)) {
125 *_entry = entry;
129 // get next entry
264 virtual status_t Match(Entry *entry, Node* node,
304 virtual status_t Match(Entry *entry, Node* node,
352 virtual status_t Match(Entry *entry, Node* node,
955 Equation::Match(Entry *entry, Node* node, const char *attributeName, int32 type, argument
966 // special case: a NULL "name" means the entry has been removed
980 if (!entry)
[all...]
/haiku-fatelf/src/apps/debugger/dwarf/
H A DDebugInfoEntries.cpp2213 // the specification may point to a member entry rather than
2214 // a variable entry
2618 DebugInfoEntry* entry = NULL; local
2622 entry = new(std::nothrow) DIEArrayType;
2625 entry = new(std::nothrow) DIEClassType;
2628 entry = new(std::nothrow) DIEEntryPoint;
2631 entry = new(std::nothrow) DIEEnumerationType;
2634 entry = new(std::nothrow) DIEFormalParameter;
2637 entry = new(std::nothrow) DIEImportedDeclaration;
2640 entry
[all...]
/haiku-fatelf/src/system/boot/platform/openfirmware/arch/ppc/
H A Dmmu.cpp206 fill_page_table_entry(page_table_entry *entry, uint32 virtualSegmentID, argument
210 ((uint32 *)entry)[1]
212 /*entry->physical_page_number = (uint32)physicalAddress / B_PAGE_SIZE;
213 entry->_reserved0 = 0;
214 entry->referenced = false;
215 entry->changed = false;
216 entry->write_through = (mode >> 6) & 1;
217 entry->caching_inhibited = (mode >> 5) & 1;
218 entry->memory_coherent = (mode >> 4) & 1;
219 entry
633 page_table_entry *entry = NULL; local
[all...]
/haiku-fatelf/src/add-ons/media/plugins/avi_reader/libOpenDML/
H A DOpenDMLFile.cpp57 // index info (odml_superindex entry, or standard avi index)
217 odml_superindex_entry *entry = (odml_superindex_entry *) (fStreamData[stream].odml_superindex + i * fStreamData[stream].odml_superindex_entry_size);
218 TRACE("odml_superindex entry %d: start %10Ld, size %8ld, duration %lu\n", i, entry->start, entry->size, entry->duration);
259 odml_superindex_entry *entry = (odml_superindex_entry *) (data->odml_superindex + data->odml_superindex_entry_pos * data->odml_superindex_entry_size);
262 stream_index, data->odml_superindex_entry_pos, entry->start, entry->size, entry
[all...]
/haiku-fatelf/src/apps/diskusage/
H A DApp.cpp35 BEntry entry(path.Path());
36 helpFileWasFound = entry.Exists();
37 entry.GetRef(&helpFileRef);
54 BEntry entry(argv[i], true);
56 if (entry.GetRef(&ref) == B_OK)
/haiku-fatelf/src/apps/installer/
H A DCopyEngine.cpp233 BEntry entry;
234 while (source.GetNextEntry(&entry) == B_OK) {
242 entry.GetStat(&statInfo);
245 status_t ret = entry.GetName(name);
249 if (!_ShouldCopyEntry(entry, name, statInfo, level))
255 ret = entry.GetPath(&srcFolder);
304 BEntry entry;
305 while (source.GetNextEntry(&entry) == B_OK) {
313 status_t ret = entry.GetName(name);
318 entry
461 _RemoveFolder(BEntry& entry) argument
508 _ShouldCopyEntry(const BEntry& entry, const char* name, const struct stat& statInfo, int32 level) const argument
[all...]
/haiku-fatelf/src/bin/bash/
H A Darrayfunc.c121 bind_array_var_internal (entry, ind, key, value, flags)
122 SHELL_VAR *entry;
136 dentry->name = savestring (entry->name);
137 if (assoc_p (entry))
138 newval = assoc_reference (assoc_cell (entry), key);
140 newval = array_reference (array_cell (entry), ind);
149 dentry->attributes = entry->attributes & ~(att_array|att_assoc|att_exported);
156 newval = make_variable_value (entry, value, flags);
158 if (entry->assign_func)
159 (*entry
183 SHELL_VAR *entry; local
243 SHELL_VAR *entry; local
[all...]
/haiku-fatelf/src/kits/network/libbind/irs/
H A Dlcl_pr.c121 struct protoent *entry = &data->proto; local
129 entry->p_proto = kProtocols[i].number;
130 entry->p_name = (char *)kProtocols[i].name;
131 entry->p_aliases = data->proto_aliases;
133 return entry;
/haiku-fatelf/src/preferences/datatranslations/
H A DDataTranslations.cpp62 Installs the given entry in the target directory either by moving
63 or copying the entry.
66 DataTranslationsApplication::_Install(BDirectory& target, BEntry& entry) argument
69 status_t status = entry.MoveTo(&target, NULL, true);
126 BEntry entry(&ref, true);
127 status = entry.InitCheck();
152 status = _Install(target, entry);
/haiku-fatelf/src/add-ons/media/plugins/ffmpeg/
H A DAVFormatReader.cpp84 AVDictionaryEntry* entry = NULL;
85 while ((entry = av_dict_get(dictionary, "", entry,
87 // convert entry keys into something more meaningful using the names from
89 if (strcmp(entry->key, "TALB") == 0 || strcmp(entry->key, "TAL") == 0)
90 message->AddString("album", entry->value);
91 else if (strcmp(entry->key, "TCOM") == 0)
92 message->AddString("composer", entry->value);
93 else if (strcmp(entry
578 const AVIndexEntry& entry = fStream->index_entries[index]; local
[all...]
/haiku-fatelf/src/add-ons/kernel/file_systems/ramfs/
H A DNode.cpp112 Node::Link(Entry *entry) argument
115 fReferrers.Insert(entry);
119 fReferrers.Remove(entry);
126 Node::Unlink(Entry *entry) argument
130 fReferrers.Remove(entry);
235 // set the iterators' current entry
341 Node::GetPreviousReferrer(Entry *entry) const
343 return (entry ? fReferrers.GetPrevious(entry) : NULL );
348 Node::GetNextReferrer(Entry *entry) cons
[all...]
/haiku-fatelf/src/system/boot/loader/net/
H A DARP.cpp127 if (MapEntry *entry = _FindEntry(ip)) {
128 mac = entry->mac;
149 if (MapEntry *entry = _FindEntry(ip)) {
150 mac = entry->mac;
203 MapEntry *entry = fEntries; local
206 entry = fEntries + i;
210 if (fAge - fEntries[i].age > fAge - entry->age)
211 entry = fEntries + i;
214 entry->age = fAge++;
215 entry
[all...]
/haiku-fatelf/src/system/libroot/posix/
H A Ddirent.c67 struct dirent* entry = (struct dirent*) local
70 dir->next_entry += entry->d_reclen;
244 readdir_r(DIR* dir, struct dirent* entry, struct dirent** _result) argument
246 ssize_t count = _kern_read_dir(dir->fd, entry, sizeof(struct dirent)
255 *_result = entry;
313 struct dirent* entry = readdir(dir); local
314 if (entry == NULL)
317 // Check whether or not we should include this entry
318 if (selectFunc != NULL && !selectFunc(entry))
321 copiedEntry = malloc(entry
[all...]
/haiku-fatelf/src/tests/add-ons/kernel/file_systems/bfs/
H A Dbfs_attribute_iterator_test.cpp96 while (struct dirent* entry = fs_read_attr_dir(dir)) {
98 printf(" %ld. %s\n", index, entry->d_name);
107 if (is_marker(entry->d_name))
110 int32 attributeIndex = attribute_index(entry->d_name);
148 while (struct dirent* entry = fs_read_attr_dir(dir)) {
150 printf(" %ld. %s\n", index, entry->d_name);
159 if (is_marker(entry->d_name))
162 int32 attributeIndex = attribute_index(entry->d_name);
311 BEntry entry; local
312 if (entry
[all...]

Completed in 511 milliseconds

1234567891011>>