Home
last modified time | relevance | path

Searched refs:m_next (Results 1 – 25 of 41) sorted by relevance

12

/external/apache-xml/src/main/java/org/apache/xpath/axes/
DNodeSequence.java50 protected int m_next = 0; field in NodeSequence
271 m_next=0; in setRoot()
283 m_next = 0; in reset()
318 if(m_next < vec.size()) in nextNode()
321 int next = vec.elementAt(m_next); in nextNode()
322 m_next++; in nextNode()
327 m_next++; in nextNode()
343 m_next++; in nextNode()
349 m_next++; in nextNode()
353 m_next++; in nextNode()
[all …]
/external/usrsctp/usrsctplib/
Duser_mbuf.c87 m->m_next = NULL; in mbuf_constructor_dup()
192 struct mbuf *n = m->m_next; in m_free()
348 mtail->m_next = mb; in m_getm2()
360 for (mtail = m; mtail->m_next != NULL; mtail = mtail->m_next); in m_getm2()
361 mtail->m_next = nm; in m_getm2()
405 for (mb = m; mb != NULL; mb = mb->m_next) { in m_uiotombuf()
430 for (m = m0; m != NULL; m = m->m_next) { in m_length()
432 if (m->m_next == NULL) in m_length()
443 while (m->m_next) { in m_last()
444 m = m->m_next; in m_last()
[all …]
Duser_recv_thread.c363 recvmbuf[i]->m_next = recvmbuf[i+1]; in recv_function_raw()
364 SCTP_BUF_LEN(recvmbuf[i]->m_next) = min(ncounter, iovlen); in recv_function_raw()
555 recvmbuf6[i]->m_next = recvmbuf6[i+1]; in recv_function_raw6()
556 SCTP_BUF_LEN(recvmbuf6[i]->m_next) = min(ncounter, iovlen); in recv_function_raw6()
747 udprecvmbuf[i]->m_next = udprecvmbuf[i+1]; in recv_function_udp()
748 SCTP_BUF_LEN(udprecvmbuf[i]->m_next) = min(ncounter, iovlen); in recv_function_udp()
953 udprecvmbuf6[i]->m_next = udprecvmbuf6[i+1]; in recv_function_udp6()
954 SCTP_BUF_LEN(udprecvmbuf6[i]->m_next) = min(ncounter, iovlen); in recv_function_udp6()
Duser_mbuf.h248 #define m_next m_hdr.mh_next macro
/external/apache-xml/src/main/java/org/apache/xpath/
DNodeSetDTM.java285 m_next = 0; in reset()
388 if ((m_next) < this.size()) in nextNode()
390 int next = this.elementAt(m_next); in nextNode()
392 m_next++; in nextNode()
418 if ((m_next - 1) > 0) in previousNode()
420 m_next--; in previousNode()
422 return this.elementAt(m_next); in previousNode()
463 return (m_next == 0); in isFresh()
485 if ((index >= 0) && (m_next < m_firstFree)) in runTo()
486 m_next = index; in runTo()
[all …]
DNodeSet.java172 m_next = 0; in reset()
244 if ((m_next) < this.size()) in nextNode()
246 Node next = this.elementAt(m_next); in nextNode()
248 m_next++; in nextNode()
274 if ((m_next - 1) > 0) in previousNode()
276 m_next--; in previousNode()
278 return this.elementAt(m_next); in previousNode()
307 return (m_next == 0); in isFresh()
329 if ((index >= 0) && (m_next < m_firstFree)) in runTo()
330 m_next = index; in runTo()
[all …]
/external/emma/core/java12/com/vladium/util/
DSoftValueMap.java169 for (SoftEntry entry = buckets [bucketIndex]; entry != null; entry = entry.m_next) in get()
238 for (SoftEntry entry = buckets [bucketIndex]; entry != null; entry = entry.m_next) in put()
307 …ntry entry = buckets [bucketIndex], prev = null; entry != null; prev = entry, entry = entry.m_next) in remove()
315 buckets [bucketIndex] = entry.m_next; in remove()
319 prev.m_next = entry.m_next; in remove()
331 entry.m_next = null; in remove()
351 …final SoftEntry next = entry.m_next; // remember next pointer because we are going to reuse this e… in clear()
358 entry.m_next = null; in clear()
454 m_next = next; in SoftEntry()
460 SoftEntry m_next; // singly-linked list link field in SoftValueMap.SoftEntry
[all …]
DIntIntMap.java91 for (Entry entry = buckets [bucketIndex]; entry != null; entry = entry.m_next) in contains()
115 for (Entry entry = buckets [bucketIndex]; entry != null; entry = entry.m_next) in get()
134 for (Entry entry = buckets [bucketIndex]; entry != null; entry = entry.m_next) in get()
153 for (Entry entry = m_buckets [b]; entry != null; entry = entry.m_next) in keys()
179 for (Entry entry = buckets [bucketIndex]; entry != null; entry = entry.m_next) in put()
224 final Entry next = entry.m_next; in remove()
231 prev.m_next = next; in remove()
270 m_next = next; in Entry()
276 Entry m_next; // singly-linked list link field in IntIntMap.Entry
300 … final Entry next = entry.m_next; // remember next pointer because we are going to reuse this entry in rehash()
[all …]
DObjectIntMap.java96 for (Entry entry = buckets [bucketIndex]; entry != null; entry = entry.m_next) in contains()
124 for (Entry entry = buckets [bucketIndex]; entry != null; entry = entry.m_next) in get()
143 for (Entry entry = m_buckets [b]; entry != null; entry = entry.m_next) in keys()
172 for (Entry entry = buckets [bucketIndex]; entry != null; entry = entry.m_next) in put()
220 final Entry next = entry.m_next; in remove()
227 prev.m_next = next; in remove()
266 m_next = next; in Entry()
272 Entry m_next; // singly-linked list link field in ObjectIntMap.Entry
296 … final Entry next = entry.m_next; // remember next pointer because we are going to reuse this entry in rehash()
303 entry.m_next = bucketListHead; in rehash()
DIntSet.java89 for (Entry entry = buckets [bucketIndex]; entry != null; entry = entry.m_next) in contains()
109 for (Entry entry = m_buckets [b]; entry != null; entry = entry.m_next) in values()
127 for (Entry entry = m_buckets [b]; entry != null; entry = entry.m_next) in values()
146 for (Entry entry = buckets [bucketIndex]; entry != null; entry = entry.m_next) in add()
201 m_next = next; in Entry()
206 Entry m_next; // singly-linked list link field in IntSet.Entry
230 … final Entry next = entry.m_next; // remember next pointer because we are going to reuse this entry in rehash()
237 entry.m_next = bucketListHead; in rehash()
DIntObjectMap.java91 for (Entry entry = buckets [bucketIndex]; entry != null; entry = entry.m_next) in contains()
116 for (Entry entry = buckets [bucketIndex]; entry != null; entry = entry.m_next) in get()
136 for (Entry entry = m_buckets [b]; entry != null; entry = entry.m_next) in keys()
165 for (Entry entry = buckets [bucketIndex]; entry != null; entry = entry.m_next) in put()
228 m_next = next; in Entry()
234 Entry m_next; // singly-linked list link field in IntObjectMap.Entry
258 … final Entry next = entry.m_next; // remember next pointer because we are going to reuse this entry in rehash()
265 entry.m_next = bucketListHead; in rehash()
/external/apache-xml/src/main/java/org/apache/xml/serializer/
DElemContext.java106 private ElemContext m_next; field in ElemContext
167 ElemContext frame = this.m_next; in push()
174 this.m_next = frame; in push()
201 ElemContext frame = this.m_next; in push()
208 this.m_next = frame; in push()
/external/apache-xml/src/main/java/org/apache/xalan/templates/
DRedundentExprEliminator.java173 next = next.m_next; in eleminateSharedPartialPaths()
218 matchedPathsTail.m_next = null; in matchAndEliminatePartialPaths()
223 matchedPathsTail.m_next = (MultistepExprHolder)meh.clone(); in matchAndEliminatePartialPaths()
227 matchedPathsTail = matchedPathsTail.m_next; in matchAndEliminatePartialPaths()
228 matchedPathsTail.m_next = null; in matchAndEliminatePartialPaths()
231 meh = meh.m_next; in matchAndEliminatePartialPaths()
255 matchedPaths = matchedPaths.m_next; in matchAndEliminatePartialPaths()
317 next = next.m_next; in findCommonAncestor()
390 next = next.m_next; in isNotSameAsOwner()
629 tail.m_next = new MultistepExprHolder(owner2, stepCount, null); in findAndEliminateRedundant()
[all …]
DTemplateSubPatternAssociation.java50 private TemplateSubPatternAssociation m_next = null; field in TemplateSubPatternAssociation
87 tspa.m_next = null; in clone()
233 return m_next; in getNext()
247 m_next = mp; in setNext()
/external/tensorflow/tensorflow/compiler/tests/
Dlstm.py79 m_next = Clip(out_gate * c_next)
83 m_next = m_prev * pad + m_next * (1.0 - pad)
85 return m_next, c_next
/external/deqp/external/vulkancts/framework/vulkan/
DvkQueryUtil.hpp146 initVulkanStructure (void* pNext = DE_NULL) : m_next(pNext) {}; in initVulkanStructure()
156 result.pNext = m_next; in operator StructType()
162 void* m_next; member
177 initVulkanStructureConst (const void* pNext = DE_NULL) : m_next(pNext) {}; in initVulkanStructureConst()
187 result.pNext = const_cast<void*>(m_next); in operator const StructType()
193 const void* m_next; member
/external/llvm-project/lldb/source/Utility/
DTimer.cpp49 m_next = expected; in Category()
123 for (Category *i = g_categories; i; i = i->m_next) { in ResetCategoryTimes()
132 for (Category *i = g_categories; i; i = i->m_next) { in DumpCategoryTimes()
/external/usrsctp/usrsctplib/netinet/
Dsctp_crc32.c784 m = m->m_next; in sctp_calculate_cksum()
790 m = m->m_next; in sctp_calculate_cksum()
796 m = m->m_next; in sctp_calculate_cksum()
/external/apache-xml/src/main/java/org/apache/xml/utils/
DNameSpace.java37 public NameSpace m_next = null; field in NameSpace
DQName.java285 ns = ns.m_next; in QName()
/external/llvm-project/lldb/include/lldb/Utility/
DTimer.h35 std::atomic<Category *> m_next; variable
/external/antlr/runtime/Cpp/include/
Dantlr3collections.hpp48 TrieEntry* m_next; /* Allows duplicate entries for same key in insertion order */ member in TrieEntry
/external/ipsec-tools/src/libipsec/
Dkey_debug.c734 m, m->m_next, m->m_nextpkt, m->m_data,
761 for (j = 0; m; m = m->m_next) {
/external/mdnsresponder/mDNSWindows/mdnsNSP/
DmdnsNSP.c93 struct HostsFileInfo * m_next; member
1858 node->m_next = gHostsFileInfo; in InHostsTable()
1870 for ( node = gHostsFileInfo; node; node = node->m_next ) in InHostsTable()
2020 HostsFileInfo * next = info->m_next; in HostsFileInfoFree()
/external/deqp/external/vulkancts/modules/vulkan/transform_feedback/
DvktTransformFeedbackFuzzLayoutCase.cpp1146 m_next = m_elements.begin(); in Traverser()
1151 if (m_next != m_elements.end()) in next()
1152 return *m_next++; in next()
1159 typename std::vector<T*>::const_iterator m_next; member in vkt::TransformFeedback::__anon5ba59b340111::Traverser

12