Home
last modified time | relevance | path

Searched refs:last (Results 1 – 25 of 3248) sorted by relevance

12345678910>>...130

/external/swiftshader/third_party/llvm-subzero/lib/Demangle/
DItaniumDemangle.cpp40 static const char *parse_type(const char *first, const char *last, C &db);
42 static const char *parse_encoding(const char *first, const char *last, C &db);
44 static const char *parse_name(const char *first, const char *last, C &db,
47 static const char *parse_expression(const char *first, const char *last, C &db);
49 static const char *parse_template_args(const char *first, const char *last,
52 static const char *parse_operator_name(const char *first, const char *last,
55 static const char *parse_unqualified_name(const char *first, const char *last,
58 static const char *parse_decltype(const char *first, const char *last, C &db);
62 static const char *parse_number(const char *first, const char *last) { in parse_number() argument
63 if (first != last) { in parse_number()
[all …]
/external/libdivsufsort/lib/
Dtrsort.c79 tr_insertionsort(const saidx_t *ISAd, saidx_t *first, saidx_t *last) { in tr_insertionsort() argument
83 for(a = first + 1; a < last; ++a) { in tr_insertionsort()
167 tr_pivot(const saidx_t *ISAd, saidx_t *first, saidx_t *last) { in tr_pivot() argument
171 t = last - first; in tr_pivot()
176 return tr_median3(ISAd, first, middle, last - 1); in tr_pivot()
179 return tr_median5(ISAd, first, first + t, middle, last - 1 - t, last - 1); in tr_pivot()
185 last = tr_median3(ISAd, last - 1 - (t << 1), last - 1 - t, last - 1); in tr_pivot()
186 return tr_median3(ISAd, first, middle, last); in tr_pivot()
223 saidx_t *first, saidx_t *middle, saidx_t *last, in tr_partition() argument
229 for(b = middle - 1; (++b < last) && ((x = ISAd[*b]) == v);) { } in tr_partition()
[all …]
Dsssort.c168 saidx_t *first, saidx_t *last, saidx_t depth) { in ss_insertionsort() argument
173 for(i = last - 2; first <= i; --i) { in ss_insertionsort()
175 do { *(j - 1) = *j; } while((++j < last) && (*j < 0)); in ss_insertionsort()
176 if(last <= j) { break; } in ss_insertionsort()
263 ss_pivot(const sauchar_t *Td, const saidx_t *PA, saidx_t *first, saidx_t *last) { in ss_pivot() argument
267 t = last - first; in ss_pivot()
272 return ss_median3(Td, PA, first, middle, last - 1); in ss_pivot()
275 return ss_median5(Td, PA, first, first + t, middle, last - 1 - t, last - 1); in ss_pivot()
281 last = ss_median3(Td, PA, last - 1 - (t << 1), last - 1 - t, last - 1); in ss_pivot()
282 return ss_median3(Td, PA, first, middle, last); in ss_pivot()
[all …]
/external/skqp/src/core/
DSkEdgeBuilder.cpp21 SkEdgeBuilder::Combine SkEdgeBuilder::CombineVertical(const SkEdge* edge, SkEdge* last) { in CombineVertical() argument
22 if (last->fCurveCount || last->fDX || edge->fX != last->fX) { in CombineVertical()
25 if (edge->fWinding == last->fWinding) { in CombineVertical()
26 if (edge->fLastY + 1 == last->fFirstY) { in CombineVertical()
27 last->fFirstY = edge->fFirstY; in CombineVertical()
30 if (edge->fFirstY == last->fLastY + 1) { in CombineVertical()
31 last->fLastY = edge->fLastY; in CombineVertical()
36 if (edge->fFirstY == last->fFirstY) { in CombineVertical()
37 if (edge->fLastY == last->fLastY) { in CombineVertical()
40 if (edge->fLastY < last->fLastY) { in CombineVertical()
[all …]
DSkDeque.cpp117 Block* last = fBackBlock; in push_back() local
120 if (nullptr == last->fBegin) { in push_back()
122 last->fBegin = last->start(); in push_back()
123 end = last->fBegin + fElemSize; in push_back()
125 end = last->fEnd + fElemSize; in push_back()
126 if (end > last->fStop) { // no more room in this chunk in push_back()
128 last = this->allocateBlock(fAllocCount); in push_back()
129 last->fPrev = fBackBlock; in push_back()
130 fBackBlock->fNext = last; in push_back()
131 fBackBlock = last; in push_back()
[all …]
/external/skia/src/core/
DSkEdgeBuilder.cpp21 SkEdgeBuilder::Combine SkEdgeBuilder::CombineVertical(const SkEdge* edge, SkEdge* last) { in CombineVertical() argument
22 if (last->fCurveCount || last->fDX || edge->fX != last->fX) { in CombineVertical()
25 if (edge->fWinding == last->fWinding) { in CombineVertical()
26 if (edge->fLastY + 1 == last->fFirstY) { in CombineVertical()
27 last->fFirstY = edge->fFirstY; in CombineVertical()
30 if (edge->fFirstY == last->fLastY + 1) { in CombineVertical()
31 last->fLastY = edge->fLastY; in CombineVertical()
36 if (edge->fFirstY == last->fFirstY) { in CombineVertical()
37 if (edge->fLastY == last->fLastY) { in CombineVertical()
40 if (edge->fLastY < last->fLastY) { in CombineVertical()
[all …]
DSkDeque.cpp117 Block* last = fBackBlock; in push_back() local
120 if (nullptr == last->fBegin) { in push_back()
122 last->fBegin = last->start(); in push_back()
123 end = last->fBegin + fElemSize; in push_back()
125 end = last->fEnd + fElemSize; in push_back()
126 if (end > last->fStop) { // no more room in this chunk in push_back()
128 last = this->allocateBlock(fAllocCount); in push_back()
129 last->fPrev = fBackBlock; in push_back()
130 fBackBlock->fNext = last; in push_back()
131 fBackBlock = last; in push_back()
[all …]
/external/webrtc/webrtc/system_wrappers/source/spreadsortlib/
Dspreadsort.hpp65 …find_extremes(RandomAccessIter current, RandomAccessIter last, RandomAccessIter & max, RandomAcces… in find_extremes() argument
69 while(++current < last) { in find_extremes()
80 …find_extremes(RandomAccessIter current, RandomAccessIter last, RandomAccessIter & max, RandomAcces… in find_extremes() argument
83 while(++current < last) { in find_extremes()
130 …spread_sort_rec(RandomAccessIter first, RandomAccessIter last, std::vector<RandomAccessIter> &bin_… in spread_sort_rec() argument
136 find_extremes(first, last, max, min); in spread_sort_rec()
141 …unsigned log_divisor = get_log_divisor(last - first, rough_log_2_size((size_t)(*max >> 0) - (*min … in spread_sort_rec()
149 for (RandomAccessIter current = first; current != last;) in spread_sort_rec()
185 bins[bin_count - 1] = last; in spread_sort_rec()
192 size_t max_count = get_max_count(log_divisor, last - first); in spread_sort_rec()
[all …]
/external/iptables/extensions/
Dlibxt_NFQUEUE.c167 unsigned int last = tinfo->queues_total; in NFQUEUE_print_v1() local
169 if (last > 1) { in NFQUEUE_print_v1()
170 last += tinfo->queuenum - 1; in NFQUEUE_print_v1()
171 printf(" NFQUEUE balance %u:%u", tinfo->queuenum, last); in NFQUEUE_print_v1()
181 unsigned int last = info->queues_total; in NFQUEUE_print_v2() local
183 if (last > 1) { in NFQUEUE_print_v2()
184 last += info->queuenum - 1; in NFQUEUE_print_v2()
185 printf(" NFQUEUE balance %u:%u", info->queuenum, last); in NFQUEUE_print_v2()
197 unsigned int last = info->queues_total; in NFQUEUE_print_v3() local
199 if (last > 1) { in NFQUEUE_print_v3()
[all …]
/external/python/cpython3/Lib/test/
Dtest_smtpd.py206 self.assertEqual(channel.socket.last, self.error_response)
215 self.assertEqual(channel.socket.last, b'250 OK\r\n')
248 self.assertEqual(channel.socket.last, self.error_response)
250 self.assertEqual(channel.socket.last, b'250 OK\r\n')
262 self.assertEqual(channel.socket.last, self.error_response)
267 channel.socket.last,
271 self.assertEqual(channel.socket.last, b'250 OK\r\n')
281 self.assertEqual(channel.socket.last, b'250 OK\r\n')
320 self.assertEqual(self.channel.socket.last,
325 self.assertEqual(self.channel.socket.last, b'250 HELP\r\n')
[all …]
/external/v8/src/interpreter/
Dbytecode-peephole-optimizer.cc121 Bytecode new_bytecode, BytecodeNode* const last, in TransformLdaSmiBinaryOpToBinaryOpWithSmi() argument
123 DCHECK_EQ(last->bytecode(), Bytecode::kLdaSmi); in TransformLdaSmiBinaryOpToBinaryOpWithSmi()
124 BytecodeNode node(new_bytecode, last->operand(0), current->operand(0), in TransformLdaSmiBinaryOpToBinaryOpWithSmi()
126 if (last->source_info().is_valid()) { in TransformLdaSmiBinaryOpToBinaryOpWithSmi()
127 node.set_source_info(last->source_info()); in TransformLdaSmiBinaryOpToBinaryOpWithSmi()
133 Bytecode new_bytecode, BytecodeNode* const last, in TransformLdaZeroBinaryOpToBinaryOpWithZero() argument
135 DCHECK_EQ(last->bytecode(), Bytecode::kLdaZero); in TransformLdaZeroBinaryOpToBinaryOpWithZero()
138 if (last->source_info().is_valid()) { in TransformLdaZeroBinaryOpToBinaryOpWithZero()
139 node.set_source_info(last->source_info()); in TransformLdaZeroBinaryOpToBinaryOpWithZero()
145 BytecodeNode* const last, in TransformEqualityWithNullOrUndefined() argument
[all …]
/external/google-breakpad/src/common/linux/
Dlinux_libc_support_unittest.cc171 const char* last; in TEST() local
173 last = my_read_hex_ptr(&result, ""); in TEST()
175 ASSERT_EQ(*last, 0); in TEST()
177 last = my_read_hex_ptr(&result, "0"); in TEST()
179 ASSERT_EQ(*last, 0); in TEST()
181 last = my_read_hex_ptr(&result, "0123"); in TEST()
183 ASSERT_EQ(*last, 0); in TEST()
185 last = my_read_hex_ptr(&result, "0123a"); in TEST()
187 ASSERT_EQ(*last, 0); in TEST()
189 last = my_read_hex_ptr(&result, "0123a-"); in TEST()
[all …]
/external/syslinux/com32/cmenu/libmenu/
Dtui.c34 char *last; // The current last char of string in getuserinput() local
53 last = str; in getuserinput()
54 while (*last) { in getuserinput()
55 last++; in getuserinput()
89 p = last; in getuserinput()
112 if (p < last) in getuserinput()
133 if (last > str) in getuserinput()
134 last--; in getuserinput()
146 while (q <= last) { in getuserinput()
150 if (last > str) in getuserinput()
[all …]
/external/python/cpython3/Doc/includes/
Dnoddy4.c7 PyObject *last; member
21 if (self->last) { in Noddy_traverse()
22 vret = visit(self->last, arg); in Noddy_traverse()
39 tmp = self->last; in Noddy_clear()
40 self->last = NULL; in Noddy_clear()
66 self->last = PyUnicode_FromString(""); in Noddy_new()
67 if (self->last == NULL) { in Noddy_new()
81 PyObject *first=NULL, *last=NULL, *tmp; in Noddy_init() local
86 &first, &last, in Noddy_init()
97 if (last) { in Noddy_init()
[all …]
Dnoddy3.c7 PyObject *last; member
15 Py_XDECREF(self->last); in Noddy_dealloc()
32 self->last = PyUnicode_FromString(""); in Noddy_new()
33 if (self->last == NULL) { in Noddy_new()
47 PyObject *first=NULL, *last=NULL, *tmp; in Noddy_init() local
52 &first, &last, in Noddy_init()
63 if (last) { in Noddy_init()
64 tmp = self->last; in Noddy_init()
65 Py_INCREF(last); in Noddy_init()
66 self->last = last; in Noddy_init()
[all …]
Dnoddy2.c7 PyObject *last; /* last name */ member
15 Py_XDECREF(self->last); in Noddy_dealloc()
32 self->last = PyUnicode_FromString(""); in Noddy_new()
33 if (self->last == NULL) { in Noddy_new()
47 PyObject *first=NULL, *last=NULL, *tmp; in Noddy_init() local
52 &first, &last, in Noddy_init()
63 if (last) { in Noddy_init()
64 tmp = self->last; in Noddy_init()
65 Py_INCREF(last); in Noddy_init()
66 self->last = last; in Noddy_init()
[all …]
/external/ltp/testcases/kdump/
Drunkdump.sh60 if [ "${last}" = "KLEXT" ]; then
68 elif [ "${last}" = "KLLBL" ]; then
76 elif [ "${last}" = "KLUID" ]; then
84 elif [ "${last}" = "KLRAW" ]; then
85 mkdir -p "${COREDIR}/${last}"
89 dd if="${RAW_PART}" of="${COREDIR}/${last}/vmcore" bs=1024
92 elif [ "${last}" = "KNSCP" ]; then
101 mkdir -p "${COREDIR}/${last}"
106 scp -i ~/.ssh/kdump_id_rsa "${SCP_PATH}:${file}" "${COREDIR}/${last}"
110 elif [ "${last}" = "KNNFS" ]; then
[all …]
/external/opencv/cv/src/
D_cvkdtree.hpp84 int dimension_of_highest_variance(__instype * first, __instype * last, in dimension_of_highest_variance() argument
86 assert(last - first > 0); in dimension_of_highest_variance()
92 for (__instype * k = first; k < last; ++k) in dimension_of_highest_variance()
94 mean /= last - first; in dimension_of_highest_variance()
96 for (__instype * k = first; k < last; ++k) { in dimension_of_highest_variance()
100 var /= last - first; in dimension_of_highest_variance()
117 __instype * median_partition(__instype * first, __instype * last, in median_partition() argument
119 assert(last - first > 0); in median_partition()
120 __instype *k = first + (last - first) / 2; in median_partition()
121 median_partition(first, last, k, dim, ctor); in median_partition()
[all …]
/external/libcxxabi/src/
Dcxa_demangle.cpp1687 const char *last = Contents.end() + 1; in printLeft() local
1690 if (static_cast<std::size_t>(last - first) > N) { in printLeft()
1691 last = first + N; in printLeft()
1698 for (; t != last; ++t, ++e) { in printLeft()
2008 const char *parse_expression(const char *first, const char *last, Db &db) { in parse_expression() argument
2010 db.Last = last; in parse_expression()
2018 const char *parse_expr_primary(const char *first, const char *last, Db &db) { in parse_expr_primary() argument
2020 db.Last = last; in parse_expr_primary()
2028 const char *parse_type(const char *first, const char *last, Db &db) { in parse_type() argument
2030 db.Last = last; in parse_type()
[all …]
/external/python/cpython2/Doc/includes/
Dnoddy4.c7 PyObject *last; member
21 if (self->last) { in Noddy_traverse()
22 vret = visit(self->last, arg); in Noddy_traverse()
39 tmp = self->last; in Noddy_clear()
40 self->last = NULL; in Noddy_clear()
67 self->last = PyString_FromString(""); in Noddy_new()
68 if (self->last == NULL) in Noddy_new()
83 PyObject *first=NULL, *last=NULL, *tmp; in Noddy_init() local
88 &first, &last, in Noddy_init()
99 if (last) { in Noddy_init()
[all …]
Dnoddy3.c7 PyObject *last; member
15 Py_XDECREF(self->last); in Noddy_dealloc()
33 self->last = PyString_FromString(""); in Noddy_new()
34 if (self->last == NULL) in Noddy_new()
49 PyObject *first=NULL, *last=NULL, *tmp; in Noddy_init() local
54 &first, &last, in Noddy_init()
65 if (last) { in Noddy_init()
66 tmp = self->last; in Noddy_init()
67 Py_INCREF(last); in Noddy_init()
68 self->last = last; in Noddy_init()
[all …]
Dnoddy2.c7 PyObject *last; /* last name */ member
15 Py_XDECREF(self->last); in Noddy_dealloc()
33 self->last = PyString_FromString(""); in Noddy_new()
34 if (self->last == NULL) in Noddy_new()
49 PyObject *first=NULL, *last=NULL, *tmp; in Noddy_init() local
54 &first, &last, in Noddy_init()
65 if (last) { in Noddy_init()
66 tmp = self->last; in Noddy_init()
67 Py_INCREF(last); in Noddy_init()
68 self->last = last; in Noddy_init()
[all …]
/external/deqp/framework/delibs/decpp/
DdeRandom.hpp58 void choose (InputIter first, InputIter last, OutputIter result, int numItems);
61 T choose (InputIter first, InputIter last);
65 T chooseWeighted (InputIter first, InputIter last, WeightIter weight);
68 void shuffle (Iterator first, Iterator last);
103 void Random::choose (InputIter first, InputIter last, OutputIter result, int numItems) in choose() argument
110 for (ndx = 0; first != last; ++first, ++ndx) in choose()
126 T Random::choose (InputIter first, InputIter last) in choose() argument
129 DE_ASSERT(first != last); in choose()
130 choose(first, last, &val, 1); in choose()
135 T Random::chooseWeighted (InputIter first, InputIter last, WeightIter weight) in chooseWeighted() argument
[all …]
/external/python/cpython2/Lib/idlelib/
DReplaceDialog.py33 last = text.index("sel.last")
35 last = None
37 last = last or first
38 self.show_hit(first, last)
96 first = last = None
111 last = "%d.%d" % (line, j)
113 text.mark_set("insert", last)
116 if first != last:
117 text.delete(first, last)
123 if first and last:
[all …]
/external/python/cpython3/Lib/idlelib/
Dreplace.py41 last = text.index("sel.last")
43 last = None
45 last = last or first
46 self.show_hit(first, last)
108 first = last = None
123 last = "%d.%d" % (line, j)
125 text.mark_set("insert", last)
128 if first != last:
129 text.delete(first, last)
135 if first and last:
[all …]

12345678910>>...130