| /packages/inputmethods/LatinIME/native/jni/src/suggest/core/dictionary/ |
| multi_bigram_map.h | 75 bigramsIt.next();
119 bigramsIt.next();
|
| /prebuilts/gcc/darwin-x86/arm/arm-eabi-4.6/lib/gcc/arm-eabi/4.6.x-google/plugin/include/ |
| cfgloop.h | 51 struct GTY ((chain_next ("%h.next"))) nb_iter_bound {
69 /* The next bound in the list. */
70 struct nb_iter_bound *next; variable in typeref:struct:nb_iter_bound
79 /* Previous and next exit in the list of the exits of the loop. */
81 struct loop_exit *next; variable in typeref:struct:loop_exit
83 /* Next element in the list of loops from that E exits. */
103 struct GTY ((chain_next ("%h.next"))) loop {
131 /* Link to the next (sibling) loop. */
132 struct loop *next; variable in typeref:struct:loop
452 return loop->exits->next->e != NULL
[all...] |
| /prebuilts/gcc/darwin-x86/arm/arm-linux-androideabi-4.6/lib/gcc/arm-linux-androideabi/4.6.x-google/plugin/include/ |
| cfgloop.h | 51 struct GTY ((chain_next ("%h.next"))) nb_iter_bound {
69 /* The next bound in the list. */
70 struct nb_iter_bound *next; variable in typeref:struct:nb_iter_bound
79 /* Previous and next exit in the list of the exits of the loop. */
81 struct loop_exit *next; variable in typeref:struct:loop_exit
83 /* Next element in the list of loops from that E exits. */
103 struct GTY ((chain_next ("%h.next"))) loop {
131 /* Link to the next (sibling) loop. */
132 struct loop *next; variable in typeref:struct:loop
452 return loop->exits->next->e != NULL
[all...] |
| /prebuilts/gcc/linux-x86/arm/arm-eabi-4.6/lib/gcc/arm-eabi/4.6.x-google/plugin/include/ |
| cfgloop.h | 51 struct GTY ((chain_next ("%h.next"))) nb_iter_bound {
69 /* The next bound in the list. */
70 struct nb_iter_bound *next; variable in typeref:struct:nb_iter_bound
79 /* Previous and next exit in the list of the exits of the loop. */
81 struct loop_exit *next; variable in typeref:struct:loop_exit
83 /* Next element in the list of loops from that E exits. */
103 struct GTY ((chain_next ("%h.next"))) loop {
131 /* Link to the next (sibling) loop. */
132 struct loop *next; variable in typeref:struct:loop
452 return loop->exits->next->e != NULL
[all...] |
| /prebuilts/gcc/linux-x86/arm/arm-linux-androideabi-4.6/lib/gcc/arm-linux-androideabi/4.6.x-google/plugin/include/ |
| cfgloop.h | 51 struct GTY ((chain_next ("%h.next"))) nb_iter_bound {
69 /* The next bound in the list. */
70 struct nb_iter_bound *next; variable in typeref:struct:nb_iter_bound
79 /* Previous and next exit in the list of the exits of the loop. */
81 struct loop_exit *next; variable in typeref:struct:loop_exit
83 /* Next element in the list of loops from that E exits. */
103 struct GTY ((chain_next ("%h.next"))) loop {
131 /* Link to the next (sibling) loop. */
132 struct loop *next; variable in typeref:struct:loop
452 return loop->exits->next->e != NULL
[all...] |
| /prebuilts/gcc/linux-x86/host/i686-linux-glibc2.7-4.4.3/sysroot/usr/include/alsa/ |
| global.h | 67 struct snd_dlsym_link *next; member in struct:snd_dlsym_link
84 __SND_DLSYM_VERSION(snd_dlsym_, name, version).next = snd_dlsym_start; \
|
| /prebuilts/gcc/linux-x86/host/i686-linux-glibc2.7-4.6/sysroot/usr/include/alsa/ |
| global.h | 67 struct snd_dlsym_link *next; member in struct:snd_dlsym_link
84 __SND_DLSYM_VERSION(snd_dlsym_, name, version).next = snd_dlsym_start; \
|
| /prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.7-4.6/sysroot/usr/include/alsa/ |
| global.h | 67 struct snd_dlsym_link *next; member in struct:snd_dlsym_link
84 __SND_DLSYM_VERSION(snd_dlsym_, name, version).next = snd_dlsym_start; \
|
| /system/core/init/ |
| init.h | 52 struct socketinfo *next; member in struct:socketinfo
61 struct svcenvinfo *next; member in struct:svcenvinfo
|
| /system/extras/showmap/ |
| showmap.c | 15 mapinfo *next; member in struct:mapinfo
148 prev->next = map;
152 map->next = current;
157 current = current->next;
187 mapinfo *next; local
188 if (!parse_header(line, current, &next)) {
190 current = next;
293 mi = mi->next;
|
| /external/chromium_org/third_party/WebKit/Source/core/editing/ |
| ReplaceSelectionCommand.cpp | 274 for (Node* node = holder->firstChild(); node; node = NodeTraversal::next(*node, holder))
315 RefPtr<Node> next = NodeTraversal::next(*node); local
317 next = NodeTraversal::nextSkippingChildren(*node);
320 node = next.get();
335 m_firstNodeInserted = NodeTraversal::next(node);
410 VisiblePosition next = endOfInsertedContent.next(CannotCrossEditingBoundary); local
411 if (next.isNull())
417 && shouldMerge(endOfInsertedContent, next);
467 RefPtr<Node> next; local
616 RefPtr<Node> next; local
700 Node* next = 0; local
948 VisiblePosition next = visibleStart.next(CannotCrossEditingBoundary); local
1092 RefPtr<Node> next = node->nextSibling(); local
1189 VisiblePosition next = endOfInsertedContent.next(CannotCrossEditingBoundary); local
1394 RefPtr<Text> next = toText(text->nextSibling()); local
[all...] |
| ModifySelectionListLevel.cpp | 95 Node* next = node->nextSibling(); local
102 node = next;
110 Node* next = node->nextSibling(); local
118 node = next;
126 Node* next = node->nextSibling(); local
133 node = next;
|
| /bionic/libc/upstream-netbsd/libc/isc/ |
| eventlib_p.h | 88 struct evConn * next; member in struct:evConn
121 struct evFile * next; member in struct:evFile
142 struct evStream *prev, *next; member in struct:evStream
158 struct evWait * next; member in struct:evWait
165 struct evWaitList * next; member in struct:evWaitList
176 struct { struct evEvent_p *next; } free; member in struct:evEvent_p::__anon729::__anon735
|
| /cts/apps/CtsVerifier/src/com/android/cts/verifier/security/ |
| CAInstallNotificationVerifierActivity.java | 107 next(); method
193 private void next() { method in class:CAInstallNotificationVerifierActivity
269 next(); method
278 next(); method
287 next(); method
296 next(); method
|
| /development/tools/elftree/ |
| elftree.c | 53 struct seen *next; member in struct:seen
65 for (s = t->seen; s; s = s->next) {
78 s->next = t->seen;
94 struct search_dir *next; member in struct:search_dir
102 dir->next = dirs;
156 for (dir = dirs; dir; dir = dir->next) {
|
| /external/apache-xml/src/main/java/org/apache/xml/dtm/ref/dom2dtm/ |
| DOM2DTM.java | 320 * This method iterates to the next node that will be added to the table.
324 * @return The true if a next node is found or false if
340 Node next=null; local
349 next = pos.getFirstChild();
353 if(next!=null && DOCUMENT_TYPE_NODE==next.getNodeType())
354 next=next.getNextSibling();
390 next = pos.getNextSibling();
391 if(next!=null && DOCUMENT_TYPE_NODE==next.getNodeType()
[all...] |
| /external/bouncycastle/bcprov/src/main/java/org/bouncycastle/x509/ |
| ExtendedPKIXParameters.java | 209 addCertStore((CertStore)it.next());
235 if (!(i.next() instanceof Store))
507 if (!(it.next() instanceof TrustAnchor))
553 if (!(it.next() instanceof String))
598 if (!(it.next() instanceof String))
641 if (!(it.next() instanceof PKIXAttrCertChecker))
|
| /external/chromium_org/chrome/browser/ui/app_list/ |
| extension_app_item.cc | 142 const ExtensionAppItem* next) {
143 if (!prev && !next)
153 next_id = next->extension_id();
155 } else if (!next) {
162 if (page.Equals(sorting->GetPageOrdinal(next->extension_id())))
163 next_id = next->extension_id();
|
| /external/chromium_org/jingle/glue/ |
| thread_wrapper.cc | 96 MessagesQueue::iterator next = it; local
97 ++next;
108 it = next;
113 std::list<PendingSend*>::iterator next = it; local
114 ++next;
126 it = next;
|
| /external/chromium_org/native_client_sdk/src/libraries/error_handling/ |
| error_handling.c | 119 uintptr_t next; local
125 next = frame->next_ptr;
128 if (next <= frame_ptr || next == 0) return 0;
131 if (next - frame_ptr > MAX_FRAME_SIZE) return 0;
134 frame->frame_ptr = next;
|
| /external/chromium_org/net/disk_cache/ |
| mem_backend_impl.cc | 308 MemEntryImpl* next = rankings_.GetPrev(NULL); local
309 if (!next)
313 while (current_size_ > target_size && next) {
314 MemEntryImpl* node = next;
315 next = rankings_.GetPrev(next);
|
| /external/chromium_org/sync/internal_api/ |
| change_reorder_buffer.cc | 188 int64 next = to_visit.front(); local
192 i = operations_.find(next);
195 record.id = next;
204 // Now add the children of |next| to |to_visit|.
205 Traversal::LinkSet::const_iterator j = traversal.begin_children(next);
206 Traversal::LinkSet::const_iterator end = traversal.end_children(next);
208 CHECK(j->first == next);
|
| /external/chromium_org/third_party/WebKit/Source/core/xml/ |
| XPathParser.cpp | 163 // Returns next char if it's there and interesting, 0 otherwise
168 UChar next = m_data[m_nextPos + 1];
169 if (next >= 0xff)
171 return next;
178 UChar next = m_data[m_nextPos];
179 if (next >= 0xff)
181 return next;
250 // If the next character is :, what we just got it the prefix, if not,
284 char next = peekAheadHelper(); local
285 if (next == '.'
[all...] |
| /external/chromium_org/third_party/harfbuzz-ng/src/ |
| hb-common.cc | 216 struct hb_language_item_t *next; member in struct:hb_language_item_t
243 hb_language_item_t *next = langs->next; local
246 langs = next;
256 for (hb_language_item_t *lang = first_lang; lang; lang = lang->next)
264 lang->next = first_lang;
|
| /external/chromium_org/third_party/skia/src/core/ |
| SkWriter32.cpp | 34 Block* next = block->fNext; local
36 block = next;
133 Block* next = block->fNext; local
136 block = next;
138 Block* next = block->fNext; local
140 block = next;
|
