| /external/dhcpcd/ |
| eloop.c | 65 struct event *e, *last = NULL; local
74 last = e;
87 if (last)
88 last->next = e;
96 struct event *e, *last = NULL; local
100 if (last)
101 last->next = e->next;
108 last = e;
189 struct timeout *t, *tt, *last = NULL; local
203 if (last)
229 struct timeout *t, *tt, *last = NULL; local
[all...] |
| /external/glide/library/src/main/java/com/bumptech/glide/util/ |
| LruCache.java | 78 Map.Entry<T, Y> last; local
80 last = cache.entrySet().iterator().next();
81 final Y toRemove = last.getValue();
83 final T key = last.getKey();
|
| /external/libcxx/test/algorithms/alg.sorting/alg.binary.search/equal.range/ |
| equal_range_comp.pass.cpp | 16 // equal_range(Iter first, Iter last, const T& value, Compare comp);
27 test(Iter first, Iter last, const T& value)
29 std::pair<Iter, Iter> i = std::equal_range(first, last, value, std::greater<int>());
32 for (Iter j = i.first; j != last; ++j)
36 for (Iter j = i.second; j != last; ++j)
|
| /external/oprofile/libpp/ |
| symbol_sort.h | 30 last enumerator in enum:sort_options::sort_order
|
| /external/bison/src/ |
| Sbitset.c | 55 Sbitset last = self + Sbitset__nbytes (nbits) - 1; local
56 for (; self < last; ++self)
59 return ((*last) & Sbitset__last_byte_mask (nbits)) == 0;
|
| /external/chromium_org/ppapi/tests/ |
| test_trace_event.cc | 56 int64_t last = interface_->Now(); local
60 ASSERT_LE(last, next);
61 last = next;
|
| /external/chromium_org/third_party/WebKit/Source/core/css/parser/ |
| SizesCalcParser.cpp | 51 if (!stack.isEmpty() && stack.last().type() == DelimiterToken) {
52 if (!operatorPriority(stack.last().delimiter(), stackOperatorPriority))
55 appendOperator(stack.last());
121 while (!stack.isEmpty() && stack.last().type() != LeftParenthesisToken && stack.last().type() != FunctionToken) {
122 appendOperator(stack.last());
154 MediaQueryTokenType type = stack.last().type();
158 appendOperator(stack.last());
168 SizesCalcValue rightOperand = stack.last();
170 SizesCalcValue leftOperand = stack.last();
[all...] |
| /external/chromium_org/third_party/WebKit/Source/wtf/ |
| StreamBuffer.h | 62 if (!m_buffer.size() || m_buffer.last()->size() == BlockSize)
64 size_t appendSize = std::min(BlockSize - m_buffer.last()->size(), size);
65 m_buffer.last()->append(data, appendSize);
|
| /external/chromium_org/third_party/mesa/src/src/gallium/state_trackers/clover/core/ |
| queue.cpp | 52 auto last = std::find_if(queued_events.begin(), queued_events.end(), local
57 std::for_each(first, last, [&](event_ptr &ev) { ev->fence(fence); });
59 queued_events.erase(first, last);
|
| /external/chromium_org/third_party/mesa/src/src/mesa/drivers/dri/i965/ |
| brw_fs_channel_expressions.cpp | 277 ir_expression *last = NULL; local
287 if (last) {
288 last = new(mem_ctx) ir_expression(ir_binop_add,
291 last);
293 last = temp;
296 assign(ir, 0, last);
309 ir_expression *last = NULL; local
325 if (last) {
326 last = new(mem_ctx) ir_expression(join,
329 last);
[all...] |
| /external/libcxx/test/algorithms/alg.sorting/alg.binary.search/lower.bound/ |
| lower_bound.pass.cpp | 15 // lower_bound(Iter first, Iter last, const T& value);
25 test(Iter first, Iter last, const T& value)
27 Iter i = std::lower_bound(first, last, value);
30 for (Iter j = i; j != last; ++j)
|
| lower_bound_comp.pass.cpp | 15 // lower_bound(Iter first, Iter last, const T& value);
26 test(Iter first, Iter last, const T& value)
28 Iter i = std::lower_bound(first, last, value, std::greater<int>());
31 for (Iter j = i; j != last; ++j)
|
| /external/libcxx/test/algorithms/alg.sorting/alg.binary.search/upper.bound/ |
| upper_bound.pass.cpp | 15 // upper_bound(Iter first, Iter last, const T& value);
25 test(Iter first, Iter last, const T& value)
27 Iter i = std::upper_bound(first, last, value);
30 for (Iter j = i; j != last; ++j)
|
| upper_bound_comp.pass.cpp | 15 // upper_bound(Iter first, Iter last, const T& value, Compare comp);
26 test(Iter first, Iter last, const T& value)
28 Iter i = std::upper_bound(first, last, value, std::greater<int>());
31 for (Iter j = i; j != last; ++j)
|
| /external/libcxx/test/containers/sequences/vector.bool/ |
| construct_iter_iter.pass.cpp | 13 // template <class InputIter> vector(InputIter first, InputIter last);
23 test(Iterator first, Iterator last)
25 C c(first, last);
27 assert(c.size() == std::distance(first, last));
|
| /external/mesa3d/src/gallium/state_trackers/clover/core/ |
| queue.cpp | 52 auto last = std::find_if(queued_events.begin(), queued_events.end(), local
57 std::for_each(first, last, [&](event_ptr &ev) { ev->fence(fence); });
59 queued_events.erase(first, last);
|
| /external/mesa3d/src/mesa/drivers/dri/i965/ |
| brw_fs_channel_expressions.cpp | 277 ir_expression *last = NULL; local
287 if (last) {
288 last = new(mem_ctx) ir_expression(ir_binop_add,
291 last);
293 last = temp;
296 assign(ir, 0, last);
309 ir_expression *last = NULL; local
325 if (last) {
326 last = new(mem_ctx) ir_expression(join,
329 last);
[all...] |
| /external/mp4parser/isoparser/src/main/java/com/googlecode/mp4parser/authoring/builder/ |
| TwoSecondIntersectionFinder.java | 74 long last = samples + 1; local
78 fragments[i] = last ;
80 last = fragments[i];
|
| /external/oprofile/libutil++/ |
| sparse_array.h | 80 typename container_type::const_iterator last = container.end();
81 --last;
82 return last->first + 1;
|
| /external/llvm/bindings/python/llvm/ |
| object.py | 132 last = None
137 last = Section(sections)
139 last.cache()
141 yield last
144 last.expire()
146 if last is not None:
147 last.expire()
160 last = None
165 last = Symbol(symbols, self)
167 last.cache(
[all...] |
| /external/chromium_org/third_party/WebKit/Source/core/rendering/svg/ |
| SVGRootInlineBox.cpp | 219 SVGTextLayoutAttributes*& first, SVGTextLayoutAttributes*& last)
222 last = 0;
229 if (!last && lastContext == current->context())
230 last = current;
231 if (first && last)
236 ASSERT(last);
239 static inline void reverseInlineBoxRangeAndValueListsIfNeeded(void* userData, Vector<InlineBox*>::iterator first, Vector<InlineBox*>::iterator last)
244 // This is a copy of std::reverse(first, last). It additionally assures that the metrics map within the renderers belonging to the InlineBoxes are reordered as well.
246 if (first == last || first == --last)
[all...] |
| /external/chromium_org/third_party/webrtc/modules/rtp_rtcp/source/ |
| rtp_format_h264_unittest.cc | 97 bool last = false; local
100 ASSERT_TRUE(packetizer->NextPacket(packet.get(), &length, &last));
102 EXPECT_EQ(i == expected_sizes.size() - 1, last) << "FUA index: " << i;
106 EXPECT_FALSE(packetizer->NextPacket(packet.get(), &length, &last));
170 bool last = false;
171 ASSERT_TRUE(packetizer->NextPacket(packet, &length, &last));
173 EXPECT_TRUE(last);
176 EXPECT_FALSE(packetizer->NextPacket(packet, &length, &last));
200 bool last = false; local
201 ASSERT_TRUE(packetizer->NextPacket(packet, &length, &last));
237 bool last = false; local
272 bool last = false; local
324 bool last = false; local
[all...] |
| /build/tools/rgb2565/ |
| to565.c | 104 unsigned short last, color, count; local
111 if ((color == last) && (count != 65535)) {
116 write(1, &last, 2);
120 last = color;
125 write(1, &last, 2);
|
| /external/libcap-ng/libcap-ng-0.7/src/test/ |
| lib_test.c | 32 int rc, i, len, last = CAP_LAST_CAP; local
52 if (len < 80 && last > 30) // The kernel & headers are mismatched
53 last = 30;
60 printf("Doing advanced bit tests for %d capabilities...\n", last);
61 for (i=0; i<=last; i++) {
|
| /external/chromium_org/third_party/skia/src/pathops/ |
| SkPathOpsSimplify.cpp | 79 SkOpSpan* last = current->markAndChaseDoneUnary(index, endIndex); local
80 if (last && !last->fChased && !last->fLoop) {
81 last->fChased = true;
82 SkASSERT(!SkPathOpsDebug::ChaseContains(chase, last));
83 // assert that last isn't already in array
84 *chase.append() = last;
87 last->fOther->span(last->fOtherIndex).fOther->debugID(), last->fWindSum
[all...] |
