| /external/libvpx/libvpx/vp8/encoder/ |
| encodemb.c | 206 signed char next; member in struct:vp8_token_state
240 int next; local
285 tokens[eob][0].next = 16;
289 next = eob;
302 error0 = tokens[next][0].error;
303 error1 = tokens[next][1].error;
305 rate0 = tokens[next][0].rate;
306 rate1 = tokens[next][1].rate;
309 if (next < 16)
314 mb->token_costs[type][band][pt][tokens[next][0].token]
[all...] |
| /external/chromium_org/third_party/npapi/npspy/common/ |
| epmanager.cpp | 46 next(NULL),
56 next(NULL),
80 InstanceList * next = instances->next; local
82 instances = next;
85 PluginEntryPointList * next = eps->next; local
87 eps = next;
123 eps->next = mEntryPoints;
133 for(PluginEntryPointList * eps = mEntryPoints; eps != NULL; eps = eps->next)
[all...] |
| /external/chromium_org/third_party/tcmalloc/chromium/src/base/ |
| low_level_alloc.cc | 75 // Next two fields: in unallocated blocks: freelist skiplist data
78 AllocList *next[kMaxLevel]; // actually has levels elements. member in struct:low_level_alloc_internal::AllocList
121 // level<kMaxLevel and next[level-1] will fit in the node.
127 int max_fit = (size-OFFSETOF_MEMBER(AllocList, next)) / sizeof (AllocList *);
143 for (AllocList *n; (n = p->next[level]) != 0 && n < e; p = n) {
147 return (head->levels == 0) ? 0 : prev[0]->next[0];
160 e->next[i] = prev[i]->next[i];
161 prev[i]->next[i] = e;
172 for (int i = 0; i != e->levels && prev[i]->next[i] == e; i++)
363 AllocList *next = prev->next[i]; local
[all...] |
| /external/chromium_org/third_party/tcmalloc/vendor/src/base/ |
| low_level_alloc.cc | 75 // Next two fields: in unallocated blocks: freelist skiplist data
78 AllocList *next[kMaxLevel]; // actually has levels elements. member in struct:low_level_alloc_internal::AllocList
121 // level<kMaxLevel and next[level-1] will fit in the node.
127 int max_fit = (size-OFFSETOF_MEMBER(AllocList, next)) / sizeof (AllocList *);
143 for (AllocList *n; (n = p->next[level]) != 0 && n < e; p = n) {
147 return (head->levels == 0) ? 0 : prev[0]->next[0];
160 e->next[i] = prev[i]->next[i];
161 prev[i]->next[i] = e;
172 for (int i = 0; i != e->levels && prev[i]->next[i] == e; i++)
363 AllocList *next = prev->next[i]; local
[all...] |
| /external/chromium_org/third_party/freetype/src/base/ |
| ftutil.c | 254 cur = cur->next;
270 node->next = 0;
274 before->next = node;
291 node->next = after;
313 after = node->next;
316 before->next = after;
337 after = node->next;
343 before->next = after;
351 node->next = list->head;
370 FT_ListNode next = cur->next local
398 FT_ListNode next = cur->next; local
[all...] |
| /external/freetype/src/base/ |
| ftutil.c | 254 cur = cur->next;
270 node->next = 0;
274 before->next = node;
291 node->next = after;
313 after = node->next;
316 before->next = after;
337 after = node->next;
343 before->next = after;
351 node->next = list->head;
370 FT_ListNode next = cur->next local
398 FT_ListNode next = cur->next; local
[all...] |
| /external/chromium_org/third_party/mesa/src/src/gallium/drivers/nv50/codegen/ |
| nv50_ir_util.h | 91 virtual void next() = 0;
106 // WARNING: do not use a->prev/next for __item or __list
110 (__item)->prev->next = (__item)->next; \
111 (__item)->next->prev = (__item)->prev; \
112 (__item)->next = (__item); \
118 (__item)->next = (__list); \
120 (__list)->prev->next = (__item); \
127 (__item)->next = (__list)->next; \
155 Item *next; member in class:nv50_ir::DLList::Item
194 virtual void next() { if (!end()) pos = rev ? pos->prev : pos->next; } function in class:nv50_ir::DLList::Iterator
391 void next() { if (pos < size) { ++pos; nextValid(); } } function in class:nv50_ir::ArrayList
[all...] |
| /external/mesa3d/src/gallium/drivers/nv50/codegen/ |
| nv50_ir_util.h | 91 virtual void next() = 0;
106 // WARNING: do not use a->prev/next for __item or __list
110 (__item)->prev->next = (__item)->next; \
111 (__item)->next->prev = (__item)->prev; \
112 (__item)->next = (__item); \
118 (__item)->next = (__list); \
120 (__list)->prev->next = (__item); \
127 (__item)->next = (__list)->next; \
155 Item *next; member in class:nv50_ir::DLList::Item
194 virtual void next() { if (!end()) pos = rev ? pos->prev : pos->next; } function in class:nv50_ir::DLList::Iterator
391 void next() { if (pos < size) { ++pos; nextValid(); } } function in class:nv50_ir::ArrayList
[all...] |
| /build/tools/droiddoc/templates-pdk/ |
| docpage.cs | 26 <?cs if:next.link ?>
28 <div class="training-nav-button-next">
29 <a href="<?cs var:next.link ?>">
32 <span class="training-nav-button-title"><?cs var:next.title ?></span>
38 <div class="training-nav-button-next">
39 <a href="<?cs var:next.link ?>">
40 Next lesson
42 <span class="training-nav-button-title"><?cs var:next.title ?></span>
47 <?cs /if ?><?cs # end if next.link ?>
68 <?cs if:!startpage && (previous.link || next.link) ?
[all...] |
| /external/libsepol/src/ |
| ebitmap.c | 37 n1 = n1->next;
38 n2 = n2->next;
42 n1 = n1->next;
46 n2 = n2->next;
49 new->next = 0;
51 prev->next = new;
161 n1 = n1->next;
162 n2 = n2->next;
187 new->next = 0;
189 prev->next = new
[all...] |
| /external/okhttp/okhttp-tests/src/test/java/com/squareup/okhttp/internal/http/ |
| RouteSelectorTest.java | 94 assertConnection(routeSelector.next("GET"), address, NO_PROXY, dns.inetAddresses[0], uriPort,
100 routeSelector.next("GET");
114 Connection connection = routeSelector.next("GET");
118 assertConnection(routeSelector.next("GET"), address, NO_PROXY, dns.inetAddresses[0], uriPort,
122 routeSelector.next("GET");
136 assertConnection(routeSelector.next("GET"), address, proxyA, dns.inetAddresses[0], proxyAPort,
138 assertConnection(routeSelector.next("GET"), address, proxyA, dns.inetAddresses[1], proxyAPort,
154 assertConnection(routeSelector.next("GET"), address, NO_PROXY, dns.inetAddresses[0], uriPort,
156 assertConnection(routeSelector.next("GET"), address, NO_PROXY, dns.inetAddresses[1], uriPort,
175 assertConnection(routeSelector.next("GET"), address, NO_PROXY, dns.inetAddresses[0], uriPort
[all...] |
| /external/chromium_org/third_party/WebKit/Source/core/rendering/ |
| BidiRunForLine.cpp | 39 RenderObject* next = current; local
46 current = next;
56 next = 0;
63 next = current->slowFirstChild();
65 if (!next) {
67 next = current->nextSibling();
68 if (next)
74 if (!next)
77 current = next;
190 // We stop at the next end of line; we may re-enter this isolate in th
[all...] |
| /external/chromium_org/third_party/WebKit/Source/wtf/ |
| DoublyLinkedList.h | 40 T* next() const;
54 template<typename T> inline void DoublyLinkedListNode<T>::setNext(T* next)
56 static_cast<T*>(this)->m_next = next;
64 template<typename T> inline T* DoublyLinkedListNode<T>::next() const function in class:WTF::DoublyLinkedListNode
105 for (T* node = m_head; node; node = node->next())
166 node->prev()->setNext(node->next());
169 m_head = node->next();
172 if (node->next()) {
174 node->next()->setPrev(node->prev());
|
| /external/chromium_org/third_party/mesa/src/src/gallium/auxiliary/draw/ |
| draw_pipe_twoside.c | 15 * next paragraph) shall be included in all copies or substantial portions
93 stage->next->tri( stage->next, &tmp );
96 stage->next->tri( stage->next, header );
145 stage->next->flush( stage->next, flags );
151 stage->next->reset_stipple_counter( stage->next );
173 twoside->stage.next = NULL
[all...] |
| /external/e2fsprogs/lib/ext2fs/ |
| link.c | 40 struct ext2_dir_entry *next; local
57 next = (struct ext2_dir_entry *) (buf + offset + curr_rec_len);
59 (next->inode == 0) &&
60 (offset + (int) curr_rec_len + (int) next->rec_len <= blocksize)) {
61 curr_rec_len += next->rec_len;
81 next = (struct ext2_dir_entry *) (buf + offset +
83 next->inode = 0;
84 next->name_len = 0;
85 ls->err = ext2fs_set_rec_len(ls->fs, rec_len, next);
|
| /external/mesa3d/src/gallium/auxiliary/draw/ |
| draw_pipe_twoside.c | 15 * next paragraph) shall be included in all copies or substantial portions
93 stage->next->tri( stage->next, &tmp );
96 stage->next->tri( stage->next, header );
145 stage->next->flush( stage->next, flags );
151 stage->next->reset_stipple_counter( stage->next );
173 twoside->stage.next = NULL
[all...] |
| /external/chromium_org/third_party/mesa/src/src/gallium/drivers/nouveau/ |
| nouveau_fence.c | 96 screen->fence.tail->next = fence;
117 screen->fence.head = fence->next;
121 for (it = screen->fence.head; it && it->next != fence; it = it->next);
122 it->next = fence->next;
140 struct nouveau_fence *next = NULL; local
147 for (fence = screen->fence.head; fence; fence = next) {
148 next = fence->next;
[all...] |
| /external/chromium_org/third_party/skia/third_party/lua/src/ |
| lfunc.c | 61 pp = &p->next;
67 uv->u.l.next = g->uvhead.u.l.next;
68 uv->u.l.next->u.l.prev = uv;
69 g->uvhead.u.l.next = uv;
70 lua_assert(uv->u.l.next->u.l.prev == uv && uv->u.l.prev->u.l.next == uv);
76 lua_assert(uv->u.l.next->u.l.prev == uv && uv->u.l.prev->u.l.next == uv);
77 uv->u.l.next->u.l.prev = uv->u.l.prev; /* remove from `uvhead' list *
[all...] |
| /external/libcxx/test/containers/associative/multimap/multimap.modifiers/ |
| emplace.pass.cpp | 40 assert(r == next(m.begin()));
42 assert(next(m.begin())->first == 1);
43 assert(next(m.begin())->second == DefaultOnly());
47 assert(r == next(m.begin(), 2));
49 assert(next(m.begin(), 2)->first == 1);
50 assert(next(m.begin(), 2)->second == DefaultOnly());
72 assert(r == next(m.begin()));
101 assert(r == next(m.begin()));
103 assert(next(m.begin())->first == 1);
104 assert(next(m.begin())->second == DefaultOnly())
[all...] |
| /external/mesa3d/src/gallium/drivers/nouveau/ |
| nouveau_fence.c | 96 screen->fence.tail->next = fence;
117 screen->fence.head = fence->next;
121 for (it = screen->fence.head; it && it->next != fence; it = it->next);
122 it->next = fence->next;
140 struct nouveau_fence *next = NULL; local
147 for (fence = screen->fence.head; fence; fence = next) {
148 next = fence->next;
[all...] |
| /external/openfst/src/include/fst/ |
| partition.h | 46 Element() : value(0), next(0), prev(0) {}
47 Element(T v) : value(v), next(0), prev(0) {}
50 Element* next; member in struct:fst::Partition::Element
70 // it current class and placing it at the head of the next class.
112 element->next = classes_[class_id];
126 if (element->next) element->next->prev = element->prev;
127 if (element->prev) element->prev->next = element->next;
128 else classes_[old_class_id] = element->next;
[all...] |
| /external/guava/guava/src/com/google/common/collect/ |
| Iterators.java | 70 public Object next() {
93 @Override public Object next() {
127 public T next() { method in class:Iterators
128 return iterator.next();
152 iterator.next();
165 if (iterator.next() == null) {
171 if (element.equals(iterator.next())) {
193 if (elementsToRemove.contains(removeFrom.next())) {
217 if (predicate.apply(removeFrom.next())) {
239 if (!elementsToRetain.contains(removeFrom.next())) {
[all...] |
| /external/guava/guava-gwt/src-super/com/google/common/collect/super/com/google/common/collect/ |
| Iterators.java | 68 public Object next() {
91 @Override public Object next() {
125 public T next() { method in class:Iterators
126 return iterator.next();
150 iterator.next();
163 if (iterator.next() == null) {
169 if (element.equals(iterator.next())) {
191 if (elementsToRemove.contains(removeFrom.next())) {
215 if (predicate.apply(removeFrom.next())) {
237 if (!elementsToRetain.contains(removeFrom.next())) {
[all...] |
| /art/compiler/dex/ |
| vreg_analysis.cc | 130 * does not generate this pattern (at least recently). Further, in the next revision of
160 int next = 0; local
163 changed |= SetCore(uses[next]);
166 changed |= SetRef(uses[next]);
169 reg_location_[uses[next]].wide = true;
170 reg_location_[uses[next + 1]].wide = true;
171 reg_location_[uses[next + 1]].high_word = true;
172 DCHECK_EQ(SRegToVReg(uses[next])+1,
173 SRegToVReg(uses[next + 1]));
174 next += 2
[all...] |
| /external/opencv/cv/src/ |
| cvcontours.cpp | 83 /* retrieves next point of the chain curve and updates reader */
131 struct _CvContourInfo *next; /* next contour with the same mark value */ member in struct:_CvContourInfo
247 scanner->frame_info.next = 0;
637 writer.seq->first->next == writer.seq->first) );
826 writer.seq->first->next == writer.seq->first) );
932 cur = cur->next;
997 l_cinfo->next = scanner->cinfo_table[nbd - 2];
1128 struct CvLinkedRunPoint* next; member in struct:CvLinkedRunPoint
[all...] |
