| /external/opencv/cv/src/ |
| _cvlist.h | 89 struct prefix##element_##type* m_next;\
121 if(element->m_next != NULL)\
123 element->m_next->m_prev = NULL;\
124 l->m_head_free.m_pos = element->m_next;\
152 element->m_next = ((element_type*)l->m_head_free.m_pos);\
197 pos->m_pos = element->m_next;\
234 element->m_next = (ELEMENT_##type*)(l->m_head.m_pos);\
236 if(element->m_next)\
238 element->m_next->m_prev = element;\
251 element->m_next = NULL;
[all...] |
| /external/apache-xml/src/main/java/org/apache/xpath/axes/ |
| NodeSequence.java | 50 protected int m_next = 0; field in class:NodeSequence
271 m_next=0;
283 m_next = 0;
318 if(m_next < vec.size())
321 int next = vec.elementAt(m_next);
322 m_next++;
327 m_next++;
343 m_next++;
349 m_next++;
353 m_next++
[all...] |
| ContextNodeList.java | 71 * m_next to the index. If the index argument is -1, this
|
| LocPathIterator.java | 790 * m_next to the index. If the index argument is -1, this
|
| /hardware/qcom/data/ipacfg-mgr/msm8998/ipacm/inc/ |
| IPACM_CmdQueue.h | 66 Message *m_next; member in class:Message
73 m_next = NULL;
77 void setnext(Message *item) { m_next = item; }
78 Message* getnext() { return m_next; }
|
| /external/emma/core/java12/com/vladium/util/ |
| IntIntMap.java | 91 for (Entry entry = buckets [bucketIndex]; entry != null; entry = entry.m_next)
115 for (Entry entry = buckets [bucketIndex]; entry != null; entry = entry.m_next)
134 for (Entry entry = buckets [bucketIndex]; entry != null; entry = entry.m_next)
153 for (Entry entry = m_buckets [b]; entry != null; entry = entry.m_next)
179 for (Entry entry = buckets [bucketIndex]; entry != null; entry = entry.m_next)
224 final Entry next = entry.m_next;
231 prev.m_next = next;
270 m_next = next;
276 Entry m_next; // singly-linked list link field in class:IntIntMap.Entry
300 final Entry next = entry.m_next; // remember next pointer because we are going to reuse this entr
[all...] |
| ObjectIntMap.java | 96 for (Entry entry = buckets [bucketIndex]; entry != null; entry = entry.m_next)
124 for (Entry entry = buckets [bucketIndex]; entry != null; entry = entry.m_next)
143 for (Entry entry = m_buckets [b]; entry != null; entry = entry.m_next)
172 for (Entry entry = buckets [bucketIndex]; entry != null; entry = entry.m_next)
220 final Entry next = entry.m_next;
227 prev.m_next = next;
266 m_next = next;
272 Entry m_next; // singly-linked list link field in class:ObjectIntMap.Entry
296 final Entry next = entry.m_next; // remember next pointer because we are going to reuse this entry
303 entry.m_next = bucketListHead
[all...] |
| IntObjectMap.java | 91 for (Entry entry = buckets [bucketIndex]; entry != null; entry = entry.m_next)
116 for (Entry entry = buckets [bucketIndex]; entry != null; entry = entry.m_next)
136 for (Entry entry = m_buckets [b]; entry != null; entry = entry.m_next)
165 for (Entry entry = buckets [bucketIndex]; entry != null; entry = entry.m_next)
228 m_next = next;
234 Entry m_next; // singly-linked list link field in class:IntObjectMap.Entry
258 final Entry next = entry.m_next; // remember next pointer because we are going to reuse this entry
265 entry.m_next = bucketListHead;
|
| IntSet.java | 89 for (Entry entry = buckets [bucketIndex]; entry != null; entry = entry.m_next)
109 for (Entry entry = m_buckets [b]; entry != null; entry = entry.m_next)
127 for (Entry entry = m_buckets [b]; entry != null; entry = entry.m_next)
146 for (Entry entry = buckets [bucketIndex]; entry != null; entry = entry.m_next)
201 m_next = next;
206 Entry m_next; // singly-linked list link field in class:IntSet.Entry
230 final Entry next = entry.m_next; // remember next pointer because we are going to reuse this entry
237 entry.m_next = bucketListHead;
|
| SoftValueMap.java | 169 for (SoftEntry entry = buckets [bucketIndex]; entry != null; entry = entry.m_next)
238 for (SoftEntry entry = buckets [bucketIndex]; entry != null; entry = entry.m_next)
307 for (SoftEntry entry = buckets [bucketIndex], prev = null; entry != null; prev = entry, entry = entry.m_next)
315 buckets [bucketIndex] = entry.m_next;
319 prev.m_next = entry.m_next;
331 entry.m_next = null;
351 final SoftEntry next = entry.m_next; // remember next pointer because we are going to reuse this entry
358 entry.m_next = null;
454 m_next = next
460 SoftEntry m_next; \/\/ singly-linked list link field in class:SoftValueMap.SoftEntry
[all...] |
| /external/apache-xml/src/main/java/org/apache/xml/serializer/ |
| ElemContext.java | 101 * that connections between the frames via m_next and m_prev
106 private ElemContext m_next; field in class:ElemContext
167 ElemContext frame = this.m_next;
174 this.m_next = frame;
201 ElemContext frame = this.m_next;
208 this.m_next = frame;
|
| /external/apache-xml/src/main/java/org/apache/xalan/templates/ |
| TemplateSubPatternAssociation.java | 50 private TemplateSubPatternAssociation m_next = null; field in class:TemplateSubPatternAssociation
87 tspa.m_next = null;
233 return m_next;
247 m_next = mp;
|
| RedundentExprEliminator.java | 173 next = next.m_next;
218 matchedPathsTail.m_next = null;
223 matchedPathsTail.m_next = (MultistepExprHolder)meh.clone();
227 matchedPathsTail = matchedPathsTail.m_next;
228 matchedPathsTail.m_next = null;
231 meh = meh.m_next;
255 matchedPaths = matchedPaths.m_next;
317 next = next.m_next;
390 next = next.m_next;
629 tail.m_next = new MultistepExprHolder(owner2, stepCount, null)
1303 MultistepExprHolder m_next; field in class:RedundentExprEliminator.MultistepExprHolder
[all...] |
| /external/apache-xml/src/main/java/org/apache/xpath/ |
| NodeSetDTM.java | 285 m_next = 0;
388 if ((m_next) < this.size())
390 int next = this.elementAt(m_next);
392 m_next++;
418 if ((m_next - 1) > 0)
420 m_next--;
422 return this.elementAt(m_next);
463 return (m_next == 0);
469 * m_next to the index. If the index argument is -1, this
485 if ((index >= 0) && (m_next < m_firstFree)
1103 transient protected int m_next = 0; field in class:NodeSetDTM
[all...] |
| NodeSet.java | 172 m_next = 0;
244 if ((m_next) < this.size())
246 Node next = this.elementAt(m_next);
248 m_next++;
274 if ((m_next - 1) > 0)
276 m_next--;
278 return this.elementAt(m_next);
307 return (m_next == 0);
313 * m_next to the index. If the index argument is -1, this
329 if ((index >= 0) && (m_next < m_firstFree)
718 transient protected int m_next = 0; field in class:NodeSet
[all...] |
| /external/apache-xml/src/main/java/org/apache/xml/utils/ |
| NameSpace.java | 37 public NameSpace m_next = null; field in class:NameSpace
|
| QName.java | 285 ns = ns.m_next;
|
| /external/libpcap/bpf/net/ |
| bpf_filter.c | 69 # define m_next b_cont macro
129 (_m) = (_m)->m_next; \
151 m0 = m->m_next;
187 m0 = m->m_next;
|
| /external/ipsec-tools/src/libipsec/ |
| key_debug.c | 732 printf("mbuf(%p){ m_next:%p m_nextpkt:%p m_data:%p "
734 m, m->m_next, m->m_nextpkt, m->m_data,
761 for (j = 0; m; m = m->m_next) {
|
| /external/apache-xml/src/main/java/org/apache/xml/dtm/ |
| DTMIterator.java | 254 * m_next to the index. If the index argument is -1, this
|
| /external/deqp/external/vulkancts/modules/vulkan/ubo/ |
| vktUniformBlockCase.cpp | 926 m_next = m_elements.begin();
931 if (m_next != m_elements.end())
932 return *m_next++;
939 typename std::vector<T*>::const_iterator m_next; member in class:vkt::ubo::__anon16821::Traverser
[all...] |
| /external/libvpx/libvpx/third_party/libwebm/mkvparser/ |
| mkvparser.h | 180 const long long m_next; member in class:mkvparser::BlockGroup
|
| /external/libvpx/libwebm/mkvparser/ |
| mkvparser.h | 180 const long long m_next; member in class:mkvparser::BlockGroup
|
| /external/mdnsresponder/mDNSWindows/mdnsNSP/ |
| mdnsNSP.c | 93 struct HostsFileInfo * m_next; member in struct:HostsFileInfo
[all...] |
| /prebuilts/devtools/tools/lib/ |
| emma_device.jar | |
