| /external/skia/src/pathops/ |
| SkDCubicToQuads.cpp | 140 int next = start + 1; local
141 if (next >= inflections) {
144 if (!approximately_equal(inflectT[start], inflectT[next])) {
148 memmove(&inflectT[start], &inflectT[next], sizeof(inflectT[0]) * (--inflections - start));
|
| /external/skia/src/sfnt/ |
| SkOTUtils.cpp | 182 bool SkOTUtils::LocalizedStrings_NameTable::next(SkTypeface::LocalizedString* localizedString) { function in class:SkOTUtils::LocalizedStrings_NameTable
185 if (fFamilyNameIter.next(record)) {
|
| /external/skia/tests/ |
| LListTest.cpp | 77 for (int i = 0; NULL != cur; ++i, cur = iter.next()) {
118 for (int i = 0; NULL != cur; ++i, cur = iter.next()) {
225 iter.next();
228 Iter next(iter);
229 next.next();
241 if (NULL != next.get()) {
242 REPORTER_ASSERT(reporter, next.prev()->fID == iter.get()->fID);
245 REPORTER_ASSERT(reporter, prev.next()->fID == id);
250 newItem.next();
287 Iter next = iter; local
[all...] |
| skia_test.cpp | 41 Test* next() { function in class:Iter
44 fReg = fReg->next();
216 while ((test = iter.next()) != NULL) {
234 SkAutoTDelete<Test> test(iter.next());
|
| /external/smack/src/org/jivesoftware/smackx/ |
| ReportedData.java | 73 FormField field = (FormField)fields.next();
79 DataForm.Item item = (DataForm.Item)items.next();
83 field = (FormField) fields.next();
87 values.add(it.next());
236 Field field = it.next();
|
| /external/smack/src/org/jivesoftware/smackx/commands/ |
| RemoteCommand.java | 35 * {@link AdHocCommand.Action#execute execute}, {@link AdHocCommand.Action#next next},
116 public void next(Form form) throws XMPPException { method in class:RemoteCommand
117 executeAction(Action.next, form, packetReplyTimeout);
|
| /external/smack/src/org/jivesoftware/smackx/workgroup/agent/ |
| OfferConfirmation.java | 68 parser.next();
|
| /external/smack/src/org/jivesoftware/smackx/workgroup/ext/macros/ |
| Macros.java | 108 int eventType = parser.next();
130 int eventType = parser.next();
133 parser.next();
160 int eventType = parser.next();
188 eventType = parser.next();
|
| /external/smack/src/org/jivesoftware/smackx/workgroup/packet/ |
| RoomInvitation.java | 151 parser.next();
|
| RoomTransfer.java | 151 parser.next();
|
| /external/smali/dexlib/src/main/java/org/jf/dexlib/Code/Format/ |
| ArrayDataPseudoInstruction.java | 132 public ArrayElement next() { method
|
| /external/stlport/src/ |
| cxa.c | 60 struct exit_function_list *next; member in struct:exit_function_list
120 for (l = __exit_funcs; l != NULL; l = l->next) {
136 l->next = __exit_funcs;
171 for (funcs = __exit_funcs; funcs; funcs = funcs->next) {
|
| /external/v8/src/ |
| liveobjectlist.h | 167 LiveObjectList* next() { return next_; } function in class:v8::internal::LiveObjectList
|
| zone.cc | 45 void Initialize(Segment* next, int size) {
46 next_ = next;
50 Segment* next() const { return next_; } function in class:v8::internal::Segment
116 keep = keep->next();
123 Segment* next = current->next(); local
135 current = next;
|
| /external/valgrind/main/callgrind/ |
| bb.c | 70 BB **new_table, *curr, *next; local
87 next = curr->next;
91 curr->next = new_table[new_idx];
93 if (curr->next) {
95 if (curr->next->next)
99 curr = next;
155 bb->next = bbs.table[idx];
189 bb = bb->next;
[all...] |
| context.c | 94 Context **new_table, *curr, *next; local
111 next = curr->next;
115 curr->next = new_table[new_idx];
117 if (curr->next) {
119 if (curr->next->next)
123 curr = next;
221 cxt->next = cxts.table[idx];
263 cxt = cxt->next;
[all...] |
| /external/valgrind/main/coregrind/m_gdbserver/ |
| inferiors.c | 44 new_inferior->next = NULL;
46 list->tail->next = new_inferior;
55 struct inferior_list_entry *cur = list->head, *next; local
58 next = cur->next;
60 cur = next;
79 list->head = entry->next;
86 while (*cur && (*cur)->next != entry)
87 cur = &(*cur)->next;
92 (*cur)->next = entry->next
[all...] |
| server.h | 191 struct inferior_list_entry *next; member in struct:inferior_list_entry
|
| /external/valgrind/main/coregrind/ |
| m_hashtable.c | 47 UInt iterChain; // next chain to be traversed by the iterator
128 VgHashNode* next = node->next; local
130 node->next = chains[chain];
132 node = next;
146 node->next = table->chains[chain];
166 curr = curr->next;
183 *prev_next_ptr = curr->next;
187 prev_next_ptr = &(curr->next);
188 curr = curr->next;
[all...] |
| m_stacks.c | 89 struct _Stack *next; member in struct:_Stack
93 static UWord next_id; /* Next id we hand out to a newly registered stack */
118 st0 = st0->next;
126 vg_assert(st2->next == st1);
127 vg_assert(st1->next == st0);
128 tmp = st0->next;
129 st2->next = st0;
130 st0->next = st1;
131 st1->next = tmp;
137 vg_assert(st1->next == st0)
[all...] |
| /external/valgrind/main/drd/ |
| drd_malloc_wrappers.c | 48 struct _DRD_Chunk* next; member in struct:_DRD_Chunk
|
| /external/wpa_supplicant_8/src/crypto/ |
| crypto_gnutls.c | 36 u8 pkey[8], next, tmp; local
40 next = 0;
43 pkey[i] = (tmp >> i) | next | 1;
44 next = tmp << (7 - i);
46 pkey[i] = next | 1;
|
| crypto_nss.c | 54 u8 pkey[8], next, tmp; local
58 next = 0;
61 pkey[i] = (tmp >> i) | next | 1;
62 next = tmp << (7 - i);
64 pkey[i] = next | 1;
|
| /external/wpa_supplicant_8/src/p2p/ |
| p2p_sd.c | 63 for (q = p2p->sd_queries; q; q = q->next) {
88 prev->next = q->next;
90 p2p->sd_queries = q->next;
96 q = q->next;
118 q = q->next;
276 const u8 *next; local
309 next = pos + slen;
310 if (next > end || slen < 2) {
322 pos = next;
426 const u8 *next; local
[all...] |
| /external/wpa_supplicant_8/src/rsn_supp/ |
| peerkey.h | 14 struct wpa_peerkey *next; member in struct:wpa_peerkey
|
