Searched refs:Entry (Results 1 - 25 of 416) sorted by relevance

1234567891011>>

/macosx-10.10.1/emacs-93/emacs/oldXMenu/
H A DXDelAssoc.c27 register XAssoc *Entry; local
34 Entry = bucket->next;
37 for (; Entry != bucket; Entry = Entry->next) {
38 if (Entry->x_id == x_id) {
40 if (Entry->display == dpy) {
45 emacs_remque((struct qelem *)Entry);
46 free((char *)Entry);
52 if (Entry
[all...]
H A DXLookAssoc.c28 register XAssoc *Entry; local
35 Entry = bucket->next;
38 for (; Entry != bucket; Entry = Entry->next) {
39 if (Entry->x_id == x_id) {
41 if (Entry->display == dpy) {
44 return(Entry->data);
49 if (Entry->x_id > x_id) {
H A DXDestAssoc.c18 register XAssoc *Entry, *entry_next; local
24 Entry = bucket->next;
25 Entry != bucket;
26 Entry = entry_next
28 entry_next = Entry->next;
29 free((char *)Entry);
H A DXMakeAssoc.c38 register XAssoc *Entry; local
46 Entry = bucket->next;
48 /* If (Entry != bucket), the bucket is empty so make */
50 /* if (Entry == bucket), the we have to search the */
52 if (Entry != bucket) {
57 /* before the current value of "Entry". */
58 for (; Entry != bucket; Entry = Entry->next) {
59 if (Entry
[all...]
/macosx-10.10.1/ruby-106/ruby/lib/rss/dublincore/
H A Datom.rb9 class Entry; include DublinCoreModel; end class in class:RSS.Atom.Feed
12 class Entry class in class:RSS.Atom
/macosx-10.10.1/llvmCore-3425.0.34/include/llvm/Support/
H A DPredIteratorCache.h43 BasicBlock **&Entry = BlockToPredsMap[BB]; local
44 if (Entry) return Entry;
51 Entry = Memory.Allocate<BasicBlock*>(PredCache.size());
52 std::copy(PredCache.begin(), PredCache.end(), Entry);
53 return Entry;
/macosx-10.10.1/ruby-106/ruby/ext/tk/lib/tkextlib/bwidget/
H A Dentry.rb12 class Entry < Tk::Entry class in class:Tk.BWidget
17 class Tk::BWidget::Entry
20 TkCommandNames = ['Entry'.freeze].freeze
21 WidgetClassName = 'Entry'.freeze
/macosx-10.10.1/llvmCore-3425.0.34/include/llvm/ADT/
H A DUniqueVector.h36 unsigned insert(const T &Entry) { argument
38 unsigned &Val = Map[Entry];
47 Vector.push_back(Entry);
53 unsigned idFor(const T &Entry) const {
55 typename std::map<T, unsigned>::const_iterator MI = Map.find(Entry);
/macosx-10.10.1/BerkeleyDB-21/db/java/src/com/sleepycat/collections/
H A DMapEntryParameter.java14 * A simple <code>Map.Entry</code> implementation that can be used as in
21 * interface contract since these state that <code>Map.Entry</code> objects
29 public class MapEntryParameter implements Map.Entry {
49 * java.util.Map.Entry#hashCode}.
61 * java.util.Map.Entry#equals}.
67 if (!(other instanceof Map.Entry)) {
71 Map.Entry e = (Map.Entry) other;
H A DStoredEntrySet.java24 * <p>The {@link java.util.Map.Entry#setValue} method of the Map.Entry objects
42 * @param mapEntry must be a {@link java.util.Map.Entry} instance.
50 * java.util.Map.Entry} instance.
56 Map.Entry entry = (Map.Entry) mapEntry; // allow ClassCastException
65 * @param mapEntry is a {@link java.util.Map.Entry} instance to be removed.
68 * the mapEntry is not a {@link java.util.Map.Entry} instance or is not
77 if (!(mapEntry instanceof Map.Entry)) {
80 Map.Entry entr
[all...]
/macosx-10.10.1/libstdcxx-104.1/include/c++/4.2.1/ext/pb_ds/detail/
H A Dcond_dealtor.hpp57 template<typename Entry, class Allocator>
61 Entry, \
64 template<typename Entry, class Allocator>
69 typename Allocator::template rebind<Entry>::other
/macosx-10.10.1/ruby-106/ruby/ext/tk/lib/tkextlib/tile/
H A Dtentry.rb10 class TEntry < Tk::Entry
12 Entry = TEntry
16 class Tk::Tile::TEntry < Tk::Entry
47 #Tk.__set_toplevel_aliases__(:Ttk, Tk::Tile::Entry, :TkEntry)
49 :Ttk, Tk::Tile::Entry, :TkEntry)
/macosx-10.10.1/tcl-105/tk/tk/library/
H A Dentry.tcl35 bind Entry <<Cut>> {
43 bind Entry <<Copy>> {
50 bind Entry <<Paste>> {
62 bind Entry <<Clear>> {
66 bind Entry <<PasteSelection>> {
73 bind Entry <<TraverseIn>> {
80 bind Entry <1> {
84 bind Entry <B1-Motion> {
88 bind Entry <Double-1> {
93 bind Entry <Tripl
[all...]
/macosx-10.10.1/tcl-105/tk84/tk/library/
H A Dentry.tcl35 bind Entry <<Cut>> {
43 bind Entry <<Copy>> {
50 bind Entry <<Paste>> {
62 bind Entry <<Clear>> {
66 bind Entry <<PasteSelection>> {
75 bind Entry <1> {
79 bind Entry <B1-Motion> {
83 bind Entry <Double-1> {
88 bind Entry <Triple-1> {
93 bind Entry <Shif
[all...]
/macosx-10.10.1/llvmCore-3425.0.34/lib/VMCore/
H A DValue.cpp508 ValueHandleBase *&Entry = pImpl->ValueHandles[VP.getPointer()]; local
509 assert(Entry != 0 && "Value doesn't have any handles?");
510 AddToExistingUseList(&Entry);
522 ValueHandleBase *&Entry = Handles[VP.getPointer()]; local
523 assert(Entry == 0 && "Value really did already have handles?");
524 AddToExistingUseList(&Entry);
577 ValueHandleBase *Entry = pImpl->ValueHandles[V]; local
578 assert(Entry && "Value bit set but no entries exist");
589 for (ValueHandleBase Iterator(Assert, *Entry); Entry; Entr
635 ValueHandleBase *Entry = pImpl->ValueHandles[Old]; local
[all...]
H A DDebugLoc.cpp236 std::pair<DebugRecVH, DebugRecVH> &Entry = Ctx->ScopeInlinedAtRecords[-Idx-1]; local
237 assert((this == &Entry.first || this == &Entry.second) &&
240 MDNode *OldScope = Entry.first.get();
241 MDNode *OldInlinedAt = Entry.second.get();
243 "Entry should be non-canonical if either val dropped to null");
253 Entry.first.Idx = Entry.second.Idx = 0;
290 std::pair<DebugRecVH, DebugRecVH> &Entry = Ctx->ScopeInlinedAtRecords[-Idx-1]; local
291 assert((this == &Entry
312 std::pair<DebugRecVH, DebugRecVH> &Entry=Ctx->ScopeInlinedAtRecords[-Idx-1]; local
[all...]
/macosx-10.10.1/vim-55/src/VisVim/
H A DVisVim.h25 int GetRegistryInt (HKEY hSectionKey, LPCTSTR Entry, int Default);
26 bool WriteRegistryInt (HKEY hSectionKey, char* Entry, int nValue);
H A DReg.cpp40 int GetRegistryInt (HKEY hSectionKey, LPCTSTR Entry, int Default) argument
45 if (RegQueryValueEx (hSectionKey, (LPTSTR) Entry, NULL, &Type,
51 bool WriteRegistryInt (HKEY hSectionKey, char* Entry, int nValue) argument
53 return RegSetValueEx (hSectionKey, Entry, NULL, REG_DWORD,
/macosx-10.10.1/OpenLDAP-499.27/OpenLDAP/servers/slapd/overlays/
H A Doverlayutils.h17 void dump_slap_entry(Entry *ent);
/macosx-10.10.1/llvmCore-3425.0.34/utils/TableGen/
H A DStringToOffsetTable.h31 StringMapEntry<unsigned> &Entry = StringOffset.GetOrCreateValue(Str, -1U); local
32 if (Entry.getValue() == -1U) {
34 Entry.setValue(AggregateString.size());
40 return Entry.getValue();
/macosx-10.10.1/OpenLDAP-499.27/OpenLDAP/servers/slapd/
H A Dapplehelpers.h15 Entry *odusers_copy_entry(Operation *op);
17 int odusers_get_authguid(Entry *e, char *guidstr);
18 Entry *odusers_copy_authdata(struct berval *dn);
44 CFDictionaryRef odusers_copy_accountpolicy_fromentry(Entry *authe);
47 int odusers_accountpolicy_set(struct berval *dn, Entry *authe, CFDictionaryRef accountpolicydict);
/macosx-10.10.1/OpenLDAP-499.27/OpenLDAP/servers/slapd/back-monitor/
H A Dproto-back-monitor.h50 Entry *e ));
55 Entry **ep ));
60 Entry **ep ));
66 Entry **ep,
67 Entry **matched ));
70 Entry *e ));
74 Entry *e ));
83 Entry *e,
109 Entry *e ));
115 Entry *e_paren
[all...]
/macosx-10.10.1/JavaScriptCore-7600.1.17/runtime/
H A DMapData.cpp55 MapData::Entry* MapData::find(CallFrame* callFrame, KeyType key)
81 template <typename Map, typename Key> MapData::Entry* MapData::add(CallFrame* callFrame, Map& map, Key key, KeyType keyValue)
92 Entry* entry = &m_entries[m_size++];
93 new (entry) Entry();
100 Entry* location = add(callFrame, key);
106 MapData::Entry* MapData::add(CallFrame* callFrame, KeyType key)
117 if (Entry* entry = find(callFrame, key))
150 void MapData::replaceAndPackBackingStore(Entry* destination, int32_t newCapacity)
156 Entry& entry = m_entries[i];
184 void MapData::replaceBackingStore(Entry* destinatio
[all...]
/macosx-10.10.1/llvmCore-3425.0.34/lib/Object/
H A DMachOObjectFile.cpp124 InMemoryStruct<macho::Symbol64TableEntry> Entry; local
125 getSymbol64TableEntry(DRI, Entry);
126 Result = MachOObj->getStringAtIndex(Entry->StringIndex);
128 InMemoryStruct<macho::SymbolTableEntry> Entry; local
129 getSymbolTableEntry(DRI, Entry);
130 Result = MachOObj->getStringAtIndex(Entry->StringIndex);
138 InMemoryStruct<macho::Symbol64TableEntry> Entry; local
139 getSymbol64TableEntry(DRI, Entry);
140 Result = Entry->Value;
141 if (Entry
147 InMemoryStruct<macho::SymbolTableEntry> Entry; local
163 InMemoryStruct<macho::Symbol64TableEntry> Entry; local
167 InMemoryStruct<macho::SymbolTableEntry> Entry; local
181 InMemoryStruct<macho::Symbol64TableEntry> Entry; local
209 InMemoryStruct<macho::SymbolTableEntry> Entry; local
251 InMemoryStruct<macho::Symbol64TableEntry> Entry; local
256 InMemoryStruct<macho::SymbolTableEntry> Entry; local
287 InMemoryStruct<macho::Symbol64TableEntry> Entry; local
292 InMemoryStruct<macho::SymbolTableEntry> Entry; local
326 InMemoryStruct<macho::Symbol64TableEntry> Entry; local
330 InMemoryStruct<macho::SymbolTableEntry> Entry; local
347 InMemoryStruct<macho::Symbol64TableEntry> Entry; local
351 InMemoryStruct<macho::SymbolTableEntry> Entry; local
639 InMemoryStruct<macho::Symbol64TableEntry> Entry; local
644 InMemoryStruct<macho::SymbolTableEntry> Entry; local
[all...]
/macosx-10.10.1/llvmCore-3425.0.34/lib/Target/ARM/
H A DThumb2SizeReduction.cpp153 bool VerifyPredAndCC(MachineInstr *MI, const ReduceEntry &Entry,
158 const ReduceEntry &Entry);
161 const ReduceEntry &Entry, bool LiveCPSR,
167 const ReduceEntry &Entry,
174 const ReduceEntry &Entry,
253 Thumb2SizeReduce::VerifyPredAndCC(MachineInstr *MI, const ReduceEntry &Entry, argument
256 if ((is2Addr && Entry.PredCC2 == 0) ||
257 (!is2Addr && Entry.PredCC1 == 0)) {
276 } else if ((is2Addr && Entry.PredCC2 == 2) ||
277 (!is2Addr && Entry
327 ReduceLoadStore(MachineBasicBlock &MBB, MachineInstr *MI, const ReduceEntry &Entry) argument
488 ReduceSpecial(MachineBasicBlock &MBB, MachineInstr *MI, const ReduceEntry &Entry, bool LiveCPSR, MachineInstr *CPSRDef, bool IsSelfLoop) argument
591 ReduceTo2Addr(MachineBasicBlock &MBB, MachineInstr *MI, const ReduceEntry &Entry, bool LiveCPSR, MachineInstr *CPSRDef, bool IsSelfLoop) argument
704 ReduceToNarrow(MachineBasicBlock &MBB, MachineInstr *MI, const ReduceEntry &Entry, bool LiveCPSR, MachineInstr *CPSRDef, bool IsSelfLoop) argument
871 const ReduceEntry &Entry = ReduceTable[OPI->second]; local
[all...]

Completed in 177 milliseconds

1234567891011>>