| /external/javassist/src/main/javassist/bytecode/stackmap/ |
| BasicBlock.java | 314 BasicBlock prev;
316 prev = getBBlock(marks[i++]);
318 prev = makeBlock(0);
320 blocks.add(prev);
326 if (prev.length > 0) {
328 prev = makeBlock(prev.position + prev.length);
329 blocks.add(prev);
332 prev.length = m.position + m.size - prev.position
[all...] |
| /external/libcxx/test/algorithms/alg.sorting/alg.permutation.generators/ |
| next_permutation.pass.cpp | 39 int prev[sa]; local
46 std::copy(ia, ia+e, prev);
51 assert(std::lexicographical_compare(prev, prev+e, ia, ia+e));
53 assert(std::lexicographical_compare(ia, ia+e, prev, prev+e));
|
| next_permutation_comp.pass.cpp | 41 int prev[sa]; local
48 std::copy(ia, ia+e, prev);
53 assert(std::lexicographical_compare(prev, prev+e, ia, ia+e, C()));
55 assert(std::lexicographical_compare(ia, ia+e, prev, prev+e, C()));
|
| prev_permutation.pass.cpp | 39 int prev[sa]; local
46 std::copy(ia, ia+e, prev);
51 assert(std::lexicographical_compare(ia, ia+e, prev, prev+e));
53 assert(std::lexicographical_compare(prev, prev+e, ia, ia+e));
|
| prev_permutation_comp.pass.cpp | 41 int prev[sa]; local
48 std::copy(ia, ia+e, prev);
53 assert(std::lexicographical_compare(ia, ia+e, prev, prev+e, C()));
55 assert(std::lexicographical_compare(prev, prev+e, ia, ia+e, C()));
|
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/algorithms/alg.sorting/alg.permutation.generators/ |
| next_permutation.pass.cpp | 39 int prev[sa]; local
46 std::copy(ia, ia+e, prev);
51 assert(std::lexicographical_compare(prev, prev+e, ia, ia+e));
53 assert(std::lexicographical_compare(ia, ia+e, prev, prev+e));
|
| next_permutation_comp.pass.cpp | 41 int prev[sa]; local
48 std::copy(ia, ia+e, prev);
53 assert(std::lexicographical_compare(prev, prev+e, ia, ia+e, C()));
55 assert(std::lexicographical_compare(ia, ia+e, prev, prev+e, C()));
|
| prev_permutation.pass.cpp | 39 int prev[sa]; local
46 std::copy(ia, ia+e, prev);
51 assert(std::lexicographical_compare(ia, ia+e, prev, prev+e));
53 assert(std::lexicographical_compare(prev, prev+e, ia, ia+e));
|
| prev_permutation_comp.pass.cpp | 41 int prev[sa]; local
48 std::copy(ia, ia+e, prev);
53 assert(std::lexicographical_compare(ia, ia+e, prev, prev+e, C()));
55 assert(std::lexicographical_compare(prev, prev+e, ia, ia+e, C()));
|
| /ndk/tests/device/issue42891-boost-1_52/jni/boost/boost/test/utils/ |
| lazy_ostream.hpp | 66 lazy_ostream_impl( lazy_ostream const& prev, T value )
68 , m_prev( prev )
86 operator<<( lazy_ostream const& prev, T const& v )
88 return lazy_ostream_impl<T const&>( prev, v );
97 operator<<( lazy_ostream const& prev, R& (BOOST_TEST_CALL_DECL *man)(S&) )
99 return lazy_ostream_impl<R& (BOOST_TEST_CALL_DECL *)(S&)>( prev, man );
|
| /external/wpa_supplicant_8/src/ap/ |
| ap_list.c | 25 /* AP list is a double linked list with head->prev pointing to the end of the
67 ap->prev = iface->ap_list->prev;
68 iface->ap_list->prev = ap;
70 ap->prev = ap;
81 ap->prev->next = ap->next;
84 ap->next->prev = ap->prev;
86 iface->ap_list->prev = ap->prev;
131 struct ap_info *ap, *prev; local
[all...] |
| /external/chromium_org/third_party/mesa/src/src/gallium/auxiliary/util/ |
| u_simple_list.h | 47 (elem)->next->prev = (elem)->prev; \
48 (elem)->prev->next = (elem)->next; \
50 (elem)->prev = elem; \
61 (elem)->prev = list; \
63 (list)->next->prev = elem; \
76 (elem)->prev = (list)->prev; \
77 (list)->prev->next = elem; \
78 (list)->prev = elem;
[all...] |
| /external/chromium_org/third_party/mesa/src/src/mesa/main/ |
| simple_list.h | 46 struct simple_node *prev; member in struct:simple_node
56 (elem)->next->prev = (elem)->prev; \
57 (elem)->prev->next = (elem)->next; \
68 (elem)->prev = list; \
70 (list)->next->prev = elem; \
83 (elem)->prev = (list)->prev; \
84 (list)->prev->next = elem; \
85 (list)->prev = elem;
[all...] |
| /external/mesa3d/src/gallium/auxiliary/util/ |
| u_simple_list.h | 47 (elem)->next->prev = (elem)->prev; \
48 (elem)->prev->next = (elem)->next; \
50 (elem)->prev = elem; \
61 (elem)->prev = list; \
63 (list)->next->prev = elem; \
76 (elem)->prev = (list)->prev; \
77 (list)->prev->next = elem; \
78 (list)->prev = elem;
[all...] |
| /external/mesa3d/src/mesa/main/ |
| simple_list.h | 46 struct simple_node *prev; member in struct:simple_node
56 (elem)->next->prev = (elem)->prev; \
57 (elem)->prev->next = (elem)->next; \
68 (elem)->prev = list; \
70 (list)->next->prev = elem; \
83 (elem)->prev = (list)->prev; \
84 (list)->prev->next = elem; \
85 (list)->prev = elem;
[all...] |
| /external/chromium_org/third_party/skia/tests/ |
| LListTest.cpp | 81 for (int i = 0; NULL != cur; ++i, cur = iter.prev()) {
226 Iter prev(iter);
229 prev.prev();
237 newItem.prev();
241 REPORTER_ASSERT(reporter, next.prev()->fID == iter.get()->fID);
243 if (NULL != prev.get()) {
244 REPORTER_ASSERT(reporter, prev.next()->fID == id);
253 REPORTER_ASSERT(reporter, next.prev()->fID == id);
255 if (NULL != prev.get())
285 Iter prev = iter; local
[all...] |
| /external/skia/tests/ |
| LListTest.cpp | 81 for (int i = 0; NULL != cur; ++i, cur = iter.prev()) {
226 Iter prev(iter);
229 prev.prev();
237 newItem.prev();
241 REPORTER_ASSERT(reporter, next.prev()->fID == iter.get()->fID);
243 if (NULL != prev.get()) {
244 REPORTER_ASSERT(reporter, prev.next()->fID == id);
253 REPORTER_ASSERT(reporter, next.prev()->fID == id);
255 if (NULL != prev.get())
285 Iter prev = iter; local
[all...] |
| /external/chromium_org/third_party/mesa/src/src/gallium/drivers/r300/compiler/ |
| radeon_program_alu.c | 235 emit1(c, inst->Prev, RC_OPCODE_MOV, &inst->U.I, inst->U.I.DstReg, src);
253 emit1(c, inst->Prev, RC_OPCODE_FRC, 0, dst, negate(inst->U.I.SrcReg[0]));
254 emit2(c, inst->Prev, RC_OPCODE_ADD, &inst->U.I, inst->U.I.DstReg,
268 emit2(c, inst->Prev, RC_OPCODE_MIN, 0, dst,
270 emit2(c, inst->Prev, RC_OPCODE_MAX, &inst->U.I, inst->U.I.DstReg,
286 emit2(c, inst->Prev, RC_OPCODE_DP3, &inst->U.I, inst->U.I.DstReg, src0, src1);
297 emit2(c, inst->Prev, RC_OPCODE_DP4, &inst->U.I, inst->U.I.DstReg, src0, inst->U.I.SrcReg[1]);
308 emit2(c, inst->Prev, RC_OPCODE_MUL, &inst->U.I, inst->U.I.DstReg,
318 emit1(c, inst->Prev, RC_OPCODE_FRC, 0, dst, inst->U.I.SrcReg[0]);
319 emit2(c, inst->Prev, RC_OPCODE_ADD, &inst->U.I, inst->U.I.DstReg
[all...] |
| /external/mesa3d/src/gallium/drivers/r300/compiler/ |
| radeon_program_alu.c | 235 emit1(c, inst->Prev, RC_OPCODE_MOV, &inst->U.I, inst->U.I.DstReg, src);
253 emit1(c, inst->Prev, RC_OPCODE_FRC, 0, dst, negate(inst->U.I.SrcReg[0]));
254 emit2(c, inst->Prev, RC_OPCODE_ADD, &inst->U.I, inst->U.I.DstReg,
268 emit2(c, inst->Prev, RC_OPCODE_MIN, 0, dst,
270 emit2(c, inst->Prev, RC_OPCODE_MAX, &inst->U.I, inst->U.I.DstReg,
286 emit2(c, inst->Prev, RC_OPCODE_DP3, &inst->U.I, inst->U.I.DstReg, src0, src1);
297 emit2(c, inst->Prev, RC_OPCODE_DP4, &inst->U.I, inst->U.I.DstReg, src0, inst->U.I.SrcReg[1]);
308 emit2(c, inst->Prev, RC_OPCODE_MUL, &inst->U.I, inst->U.I.DstReg,
318 emit1(c, inst->Prev, RC_OPCODE_FRC, 0, dst, inst->U.I.SrcReg[0]);
319 emit2(c, inst->Prev, RC_OPCODE_ADD, &inst->U.I, inst->U.I.DstReg
[all...] |
| /external/chromium_org/third_party/mesa/src/src/mesa/drivers/dri/intel/ |
| intel_resolve_map.c | 42 struct intel_resolve_map *prev = head; local
49 prev = *tail;
54 (*tail)->prev = prev;
88 if (elem->prev)
89 elem->prev->next = elem->next;
91 elem->next->prev = elem->prev;
|
| /external/chromium_org/third_party/tcmalloc/chromium/src/ |
| span.cc | 74 list->prev = list;
78 span->prev->next = span->next;
79 span->next->prev = span->prev;
80 span->prev = NULL;
94 ASSERT(span->prev == NULL);
96 span->prev = list;
97 list->next->prev = span;
|
| /external/chromium_org/third_party/tcmalloc/vendor/src/ |
| span.cc | 74 list->prev = list;
78 span->prev->next = span->next;
79 span->next->prev = span->prev;
80 span->prev = NULL;
94 ASSERT(span->prev == NULL);
96 span->prev = list;
97 list->next->prev = span;
|
| /external/fio/lib/ |
| flist_sort.c | 11 * sentinel head node, "prev" links not maintained.
39 * prev-link restoration pass, or maintaining the prev links
54 a->prev = tail;
58 b->prev = tail;
74 tail->next->prev = tail;
79 head->prev = tail;
111 head->prev->next = NULL;
|
| /external/mesa3d/src/mesa/drivers/dri/intel/ |
| intel_resolve_map.c | 42 struct intel_resolve_map *prev = head; local
49 prev = *tail;
54 (*tail)->prev = prev;
88 if (elem->prev)
89 elem->prev->next = elem->next;
91 elem->next->prev = elem->prev;
|
| /external/pdfium/core/src/fxge/agg/agg23/ |
| agg_shorten_path.h | 42 vertex_type& prev = vs[n - 1]; local
44 d = (prev.dist - s) / prev.dist;
45 FX_FLOAT x = prev.x + (last.x - prev.x) * d;
46 FX_FLOAT y = prev.y + (last.y - prev.y) * d;
49 if(!prev(last)) {
|
