Home
last modified time | relevance | path

Searched full:last (Results 1 – 25 of 4239) sorted by relevance

12345678910>>...170

/freebsd/contrib/arm-optimized-routines/string/arm/
H A Dasmdefs.h68 * - first - If `last' specified, this serves as start of general-purpose
72 * - last - If given, specifies inclusive upper-bound of GPR range.
101 .macro cfirestorelist first, last
102 .cfi_restore \last
103 .if \last-\first
104 cfirestorelist \first, \last-1
109 .macro cfisavelist first, last, index=1
110 .cfi_offset \last, -4*(\index)
111 .if \last-\first
112 cfisavelist \first, \last-1, \index+1
[all …]
/freebsd/contrib/libdivsufsort/lib/
H A 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 …]
H A 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 …]
/freebsd/contrib/llvm-project/compiler-rt/lib/scudo/standalone/
H A Dlist.h40 T *back() { return Last; } in back()
41 const T *back() const { return Last; } in back()
44 First = Last = nullptr; in clear()
62 T *Last = nullptr; member
68 CHECK_EQ(Last, nullptr); in checkConsistency()
73 if (I == Last) in checkConsistency()
77 CHECK_EQ(Last->Next, nullptr); in checkConsistency()
83 using IntrusiveList<T>::Last;
92 Last->Next = X; in push_back()
93 Last = X; in push_back()
[all …]
/freebsd/contrib/one-true-awk/testdir/
H A Dchem.awk19 printf "Last: 0,0\n"
21 last = OTHER
66 $1 ~ /^\"/ { print "Last: ", $0; last = OTHER; next }
79 $1 == "left" { left[++stack] = fields(2, NF); printf("Last: [\n"); next }
85 /./ { print "Last: ", $0; last = OTHER }
125 from = "from Last." leave(last, dir) " " fields(cf, NF)
126 printf "Last: %s(%g, %g, %s)\n", type, leng, dir, from
127 last = BOND
129 labsave(lastname, last, dir)
141 if (n ~ /^\.[A-Z]/) # "from .V" => "from Last.V.s"
[all …]
/freebsd/sys/contrib/zstd/lib/dictBuilder/
H A Ddivsufsort.c258 int *first, int *last, int depth) { in ss_insertionsort() argument
263 for(i = last - 2; first <= i; --i) { in ss_insertionsort()
265 do { *(j - 1) = *j; } while((++j < last) && (*j < 0)); in ss_insertionsort()
266 if(last <= j) { break; } in ss_insertionsort()
353 ss_pivot(const unsigned char *Td, const int *PA, int *first, int *last) { in ss_pivot() argument
357 t = last - first; in ss_pivot()
362 return ss_median3(Td, PA, first, middle, last - 1); in ss_pivot()
365 return ss_median5(Td, PA, first, first + t, middle, last - 1 - t, last - 1); in ss_pivot()
371 last = ss_median3(Td, PA, last - 1 - (t << 1), last - 1 - t, last - 1); in ss_pivot()
372 return ss_median3(Td, PA, first, middle, last); in ss_pivot()
[all …]
/freebsd/bin/ed/
H A Ded.1174 When a file is first read, the current address is set to the last line
176 In general, the current address is set to the last line
209 then the corresponding range is determined by the last two addresses in
212 If only one address is expected, then the last address is used.
225 The last line in the buffer.
257 The first through last lines in the buffer.
262 The current through last lines in the buffer.
271 // repeats the last search.
278 ?? repeats the last search.
367 appears as the first or last
[all …]
/freebsd/contrib/mandoc/
H A Dman_macro.c102 n = man->last; in man_unscope()
124 man->last = n; in man_unscope()
126 roff_node_delete(man, man->last); in man_unscope()
137 * We might delete the man->last node in man_unscope()
143 man->last = n; in man_unscope()
145 man->last->flags |= NODE_VALID; in man_unscope()
155 man->next = (man->last == to) ? in man_unscope()
171 n = man->last; in rew_scope()
197 n = man->last; in rew_scope()
220 for (nn = man->last->parent; nn; nn = nn->parent) in blk_close()
[all …]
H A Dmdoc_validate.c300 /* Validate the subtree rooted at mdoc->last. */
313 n = mdoc->last; in mdoc_validate()
331 mdoc->last = mdoc->last->child; in mdoc_validate()
332 while (mdoc->last != NULL) { in mdoc_validate()
334 if (mdoc->last == n) in mdoc_validate()
335 mdoc->last = mdoc->last->child; in mdoc_validate()
337 mdoc->last = mdoc->last->next; in mdoc_validate()
342 mdoc->last = n; in mdoc_validate()
366 check_args(mdoc, mdoc->last); in mdoc_validate()
376 if (n->last != NULL) in mdoc_validate()
[all …]
/freebsd/share/doc/usd/13.viref/
H A Dvi.cmd.roff66 command mode, the cursor is always positioned on the last column of
136 would select, the cursor is positioned on the last character in the line.
159 .QQ "the last character in the line" .
169 last absolute movement was executed.
420 Set to the last line of text displayed on the screen.
435 is not specified, scroll forward the number of lines specified by the last
660 last
703 in which case it is set to the last line of text displayed
714 If the file has been modified since it was last completely written,
779 If the current file has been modified since it was last completely
[all …]
/freebsd/contrib/llvm-project/llvm/include/llvm/ADT/
H A Dilist_base.h41 static void removeRangeImpl(node_base_type &First, node_base_type &Last) { in removeRangeImpl() argument
43 node_base_type *Final = Last.getPrev(); in removeRangeImpl()
44 Last.setPrev(Prev); in removeRangeImpl()
45 Prev->setNext(&Last); in removeRangeImpl()
53 node_base_type &Last) { in transferBeforeImpl() argument
54 if (&Next == &Last || &First == &Last) in transferBeforeImpl()
62 node_base_type &Final = *Last.getPrev(); in transferBeforeImpl()
65 First.getPrev()->setNext(&Last); in transferBeforeImpl()
66 Last.setPrev(First.getPrev()); in transferBeforeImpl()
81 template <class T> static void removeRange(T &First, T &Last) { in removeRange() argument
[all …]
/freebsd/contrib/llvm-project/libcxx/include/
H A Dalgorithm50 constexpr I min_element(I first, S last, Comp comp = {}, Proj proj = {});
58 …constexpr I ranges::max_element(I first, S last, Comp comp = {}, Proj proj = {}); …
80 …constexpr I find(I first, S last, const T& value, Proj proj = {}); …
89 …constexpr I find_if(I first, S last, Pred pred, Proj proj = {}); …
98 …constexpr I find_if_not(I first, S last, Pred pred, Proj proj = {}); …
107 …constexpr subrange<I> find_last(I first, S last, const T& value, Proj proj = {}); …
116 …constexpr subrange<I> find_last_if(I first, S last, Pred pred, Proj proj = {}); …
124 …constexpr subrange<I> find_last_if_not(I first, S last, Pred pred, Proj proj = {}); …
196 …count(I first, S last, const T& value, Proj proj = {}); …
206 …count_if(I first, S last, Pred pred, Proj proj = {}); …
[all …]
H A Dnumeric21 accumulate(InputIterator first, InputIterator last, T init);
25 accumulate(InputIterator first, InputIterator last, T init, BinaryOperation binary_op);
29 reduce(InputIterator first, InputIterator last); // C++17
33 reduce(InputIterator first, InputIterator last, T init); // C++17
37 reduce(InputIterator first, InputIterator last, T init, BinaryOperation binary_op); // C++17
62 transform_reduce(InputIterator first, InputIterator last, T init,
67 partial_sum(InputIterator first, InputIterator last, OutputIterator result);
71 …partial_sum(InputIterator first, InputIterator last, OutputIterator result, BinaryOperation binary…
75 exclusive_scan(InputIterator first, InputIterator last,
80 exclusive_scan(InputIterator first, InputIterator last,
[all …]
H A Dcharconv34 constexpr to_chars_result to_chars(char* first, char* last, see below value,
36 to_chars_result to_chars(char* first, char* last, bool value,
39 to_chars_result to_chars(char* first, char* last, float value);
40 to_chars_result to_chars(char* first, char* last, double value);
41 to_chars_result to_chars(char* first, char* last, long double value);
43 to_chars_result to_chars(char* first, char* last, float value,
45 to_chars_result to_chars(char* first, char* last, double value,
47 to_chars_result to_chars(char* first, char* last, long double value,
50 to_chars_result to_chars(char* first, char* last, float value,
52 to_chars_result to_chars(char* first, char* last, double value,
[all …]
/freebsd/usr.bin/mkuzip/
H A Dmkuz_fqueue.c71 fqp->last = ip; in mkuz_fqueue_enq()
92 fqp->last = cip_l; in mkuz_fqueue_enq_all()
110 for (ip = fqp->last; ip != NULL; ip = ip->prev) { in mkuz_fqueue_check()
125 while (fqp->last == NULL || !mkuz_fqueue_check(fqp, cmp_cb, cap)) { in mkuz_fqueue_deq_when()
128 if (cmp_cb(fqp->last->this, cap)) { in mkuz_fqueue_deq_when()
129 mip = fqp->last; in mkuz_fqueue_deq_when()
130 fqp->last = mip->prev; in mkuz_fqueue_deq_when()
131 if (fqp->last == NULL) { in mkuz_fqueue_deq_when()
141 newfirst = newlast = fqp->last; in mkuz_fqueue_deq_when()
143 for (ip = fqp->last->prev; ip != NULL; ip = ip->prev) { in mkuz_fqueue_deq_when()
[all …]
/freebsd/contrib/libxo/tests/core/saved/
H A Dtest_07.X.out1 …last-name>გთხოვთ ახ</last-name><department>431</department><percent-time>90</percent-time><columns…
H A Dtest_07.XP.out16 <last-name>გთხოვთ ახ</last-name>
25 <last-name>Οὐχὶ ταὐτὰ παρίσταταί μοι Jones</last-name>
34 <last-name>Patterson</last-name>
43 <last-name>Meter &amp; Smith</last-name>
51 <last-name>012345678901234567890</last-name>
59 <last-name>საერთაშორისო</last-name>
H A Dtest_04.HIPx.out2 <div class="title">Last Name </div>
8 …<div class="data" data-tag="last-name" data-xpath="/employees/employee/last-name" data-type="strin…
13 …<div class="data" data-tag="last-name" data-xpath="/employees/employee/last-name" data-type="strin…
18 …<div class="data" data-tag="last-name" data-xpath="/employees/employee/last-name" data-type="strin…
H A Dtest_05.XP.out35 <last-name>გთხოვთ ახ</last-name>
43 <last-name>Οὐχὶ ταὐτὰ παρίσταταί μοι Jones</last-name>
51 <last-name>Patterson</last-name>
59 <last-name>Meter &amp; Smith</last-name>
66 <last-name>012345678901234567890</last-name>
73 <last-name>საერთაშორისო</last-name>
81 <last-name>෴ණ්ණ෴෴ණ්ණ෴෴ණ්ණ෴෴෴</last-name>
H A Dtest_05.X.out1 …last-name>გთხოვთ ახ</last-name><department>431</department><percent-time>90</percent-time><benefit…
H A Dtest_07.HIPx.out24 <div class="title">Last Name </div>
37 …<div class="data" data-tag="last-name" data-xpath="/employees/employee/last-name" data-type="strin…
50 …<div class="data" data-tag="last-name" data-xpath="/employees/employee/last-name" data-type="strin…
63 …<div class="data" data-tag="last-name" data-xpath="/employees/employee/last-name" data-type="strin…
76 …<div class="data" data-tag="last-name" data-xpath="/employees/employee/last-name" data-type="strin…
88 …<div class="data" data-tag="last-name" data-xpath="/employees/employee/last-name" data-type="strin…
101 …<div class="data" data-tag="last-name" data-xpath="/employees/employee/last-name" data-type="strin…
/freebsd/crypto/heimdal/lib/wind/
H A Dstringprep.py80 last = 0
82 if last:
83 if last[0] == x[0]:
84 last = (last[0], last[1], last[2], last[3] + x[3])
86 ret.append(last)
87 last = x
89 last = x
90 if last:
91 ret.append(last)
/freebsd/contrib/llvm-project/llvm/lib/CodeGen/
H A DSwitchLoweringUtils.cpp24 unsigned First, unsigned Last) { in getJumpTableRange() argument
25 assert(Last >= First); in getJumpTableRange()
27 const APInt &HighCase = Clusters[Last].High->getValue(); in getJumpTableRange()
38 unsigned First, unsigned Last) { in getJumpTableNumCases() argument
39 assert(Last >= First); in getJumpTableNumCases()
40 assert(TotalCases[Last] >= TotalCases[First]); in getJumpTableNumCases()
42 TotalCases[Last] - (First == 0 ? 0 : TotalCases[First - 1]); in getJumpTableNumCases()
112 // LastElement[i] is the last element of the partition starting at i. in findJumpTables()
174 for (unsigned First = 0, Last; First < N; First = Last + 1) { in findJumpTables() local
175 Last = LastElement[First]; in findJumpTables()
[all …]
/freebsd/crypto/openssl/providers/implementations/ciphers/
H A Dcipher_cts.c23 * It does this by altering processing of the last two blocks of the message.
24 * The processing of all but the last two blocks is unchanged, but a portion of
25 * the second-last block's ciphertext is "stolen" to pad the last plaintext
27 * The final ciphertext for the last two blocks, consists of the partial block
45 * with the last 2 blocks swapped.
147 /* Process blocks at the start - but leave the last 2 blocks */ in cts128_cs1_decrypt()
155 /* Save the iv that will be used by the second last block */ in cts128_cs1_decrypt()
160 /* Decrypt the last block first using an iv of zero */ in cts128_cs1_decrypt()
166 * Rebuild the ciphertext of the second last block as a combination of in cts128_cs1_decrypt()
167 * the decrypted last block + replace the start with the ciphertext bytes in cts128_cs1_decrypt()
[all …]
/freebsd/sys/compat/linuxkpi/common/include/linux/
H A Dinterval_tree_generic.h31 #define INTERVAL_TREE_DEFINE(type, field, valtype, dummy, START, LAST, \ argument
33 __IT_DEFINE_ITER_FROM(type, field, valtype, START, LAST, name) \
39 #define __IT_DEFINE_ITER_FROM(type, field, valtype, START, LAST, name) \ argument
41 name##_iter_from(struct rb_node *rb, valtype start, valtype last) \
47 if (LAST(node) >= start && START(node) <= last) \
49 else if (START(node) > last) \
58 name##_iter_first(struct rb_root_cached *root, valtype start, valtype last) \
60 return (name##_iter_from(rb_first_cached(root), start, last)); \
65 name##_iter_next(type *node, valtype start, valtype last) \
67 return (name##_iter_from(rb_next(&node->field), start, last)); \

12345678910>>...170