Searched refs:m_entry (Results 1 - 15 of 15) sorted by relevance

/netbsd-current/external/bsd/openldap/dist/contrib/ldapc++/src/
H A DLDAPAddRequest.cpp23 m_entry=new LDAPEntry(*(req.m_entry));
35 m_entry = new LDAPEntry(*entry);
40 delete m_entry;
46 const LDAPAttributeList* list=m_entry->getAttributes();
51 m_entry->getDN().c_str(),attrs,tmpSrvCtrls,tmpClCtrls,&msgID);
75 return new LDAPAddRequest(m_entry, con, m_cons,true,this);
H A DLDAPAddRequest.h28 LDAPEntry* m_entry; member in class:LDAPAddRequest
/netbsd-current/external/bsd/atf/dist/atf-c/detail/
H A Dmap.c82 const struct map_entry *me = citer.m_entry;
90 const struct map_entry *me = citer.m_entry;
102 newciter.m_entry = ((const struct map_entry *)
112 return i1.m_map == i2.m_map && i1.m_entry == i2.m_entry;
126 const struct map_entry *me = iter.m_entry;
134 const struct map_entry *me = iter.m_entry;
146 newiter.m_entry = ((struct map_entry *)
156 return i1.m_map == i2.m_map && i1.m_entry == i2.m_entry;
[all...]
H A Dlist.c56 iter.m_entry = le;
66 iter.m_entry = le;
127 const struct list_entry *le = citer.m_entry;
135 const struct list_entry *le = citer.m_entry;
141 newciter.m_entry = le->m_next;
150 return i1.m_list == i2.m_list && i1.m_entry == i2.m_entry;
164 const struct list_entry *le = iter.m_entry;
172 const struct list_entry *le = iter.m_entry;
178 newiter.m_entry
[all...]
H A Dlist.h45 const void *m_entry; member in struct:atf_list_citer
63 void *m_entry; member in struct:atf_list_iter
H A Dmap.h46 const void *m_entry; member in struct:atf_map_citer
66 void *m_entry; member in struct:atf_map_iter
H A Dlist_test.c252 /* XXX Shouldn't query m_entry here. */
253 ATF_CHECK(end1.m_entry != end2.m_entry);
256 ATF_CHECK(atf_list_end_c(&l1).m_entry == end2.m_entry);
/netbsd-current/external/gpl3/gdb.old/dist/gdb/
H A Dprologue-value.c310 m_entry (nullptr)
319 struct area_entry *e = m_entry;
333 while (e != m_entry);
335 m_entry = 0;
367 struct area_entry *e = m_entry;
393 m_entry = e;
437 m_entry = e;
440 /* Now, there are no entries overlapping us, and m_entry is
457 if (m_entry)
459 e->prev = m_entry
[all...]
H A Dprologue-value.h327 struct area_entry *m_entry; member in class:pv_area
/netbsd-current/external/gpl3/gdb/dist/gdb/
H A Dprologue-value.c310 m_entry (nullptr)
319 struct area_entry *e = m_entry;
333 while (e != m_entry);
335 m_entry = 0;
367 struct area_entry *e = m_entry;
393 m_entry = e;
437 m_entry = e;
440 /* Now, there are no entries overlapping us, and m_entry is
457 if (m_entry)
459 e->prev = m_entry
[all...]
H A Dprologue-value.h327 struct area_entry *m_entry; member in class:pv_area
/netbsd-current/external/bsd/elftosb/dist/common/
H A DStExecutableImage.h198 inline void setEntryPoint(uint32_t inEntryAddress) { m_entry = inEntryAddress; m_hasEntry = true; }
204 inline uint32_t getEntryPoint() const { return hasEntryPoint() ? m_entry : 0; }
237 uint32_t m_entry; //!< Entry point address. member in class:StExecutableImage
H A DStExecutableImage.cpp17 m_entry(0)
26 m_entry(inOther.m_entry),
/netbsd-current/external/bsd/libarchive/dist/libarchive/
H A Darchive_write_set_format_mtree.c53 struct mtree_entry *m_entry; member in struct:attr_counter
458 mtree->set.uid == acs->uid_list->m_entry->uid)
465 mtree->set.gid == acs->gid_list->m_entry->gid)
472 mtree->set.mode == acs->mode_list->m_entry->mode)
479 (acs->flags_list->m_entry->fflags_set ==
481 acs->flags_list->m_entry->fflags_clear ==
505 if (archive_strlen(&(acs->uid_list->m_entry->uname)) > 0) {
507 mtree_quote(&setstr, acs->uid_list->m_entry->uname.s);
515 mtree->set.uid = acs->uid_list->m_entry->uid;
520 if (archive_strlen(&(acs->gid_list->m_entry
774 mtree_entry_new(struct archive_write *a, struct archive_entry *entry, struct mtree_entry **m_entry) argument
1876 mtree_entry_create_virtual_dir(struct archive_write *a, const char *pathname, struct mtree_entry **m_entry) argument
[all...]
/netbsd-current/external/gpl3/gcc/dist/gcc/
H A Dgimple-range-path.cc702 basic_block m_entry; member in class:jt_fur_source
713 m_entry = path[path.length () - 1];
727 m_oracle->register_relation (m_entry, k, op1, op2);
736 m_oracle->register_relation (m_entry, k, op1, op2);
748 return m_oracle->query_relation (m_entry, op1, op2);

Completed in 163 milliseconds