| /freebsd-src/contrib/arm-optimized-routines/string/arm/ |
| H A D | asmdefs.h | 68 * - 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-src/contrib/libdivsufsort/lib/ |
| H A D | trsort.c | 79 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 D | sssort.c | 168 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-src/contrib/llvm-project/compiler-rt/lib/scudo/standalone/ |
| H A D | list.h | 40 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-src/contrib/one-true-awk/testdir/ |
| H A D | chem.awk | 19 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-src/sys/contrib/zstd/lib/dictBuilder/ |
| H A D | divsufsort.c | 258 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-src/bin/ed/ |
| H A D | ed.1 | 174 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-src/contrib/mandoc/ |
| H A D | man_macro.c | 102 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) ?
171 n = man->last; in rew_scope()
197 n = man->last;
220 for (nn = man->last in blk_close()
[all...] |
| H A D | mdoc_validate.c | 300 /* 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 in mdoc_validate()
[all...] |
| H A D | man.c | 47 if (man->last->type != ROFFT_EQN || ln > man->last->line) in man_parseln()
82 while (man->last->parent->type != ROFFT_ROOT && in man_descope()
83 man_macro(man->last->parent->tok)->flags & MAN_ESCOPED) in man_descope()
84 man_unscope(man, man->last->parent); in man_descope()
97 man_unscope(man, man->last->parent); in man_descope()
98 roff_body_alloc(man, line, offs, man->last->tok); in man_descope()
130 if (man->last->tok == MAN_SH || man->last->tok == MAN_SS) in man_ptext()
132 if (man->last in man_ptext()
[all...] |
| /freebsd-src/contrib/llvm-project/llvm/include/llvm/ADT/ |
| H A D | ilist_base.h | 41 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 in transferBeforeImpl()
81 removeRange(T & First,T & Last) removeRange() argument
85 transferBefore(T & Next,T & First,T & Last) transferBefore() argument
[all...] |
| /freebsd-src/share/doc/usd/13.viref/ |
| H A D | vi.cmd.roff | 66 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-src/usr.bin/mkuzip/ |
| H A D | mkuz_fqueue.c | 71 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-src/contrib/libxo/tests/core/saved/ |
| H A D | test_07.X.out | 1 …last-name>გთხოვთ ახ</last-name><department>431</department><percent-time>90</percent-time><columns…
|
| H A D | test_07.XP.out | 16 <last-name>გთხოვთ ახ</last-name>
25 <last-name>Οὐχὶ ταὐτὰ παρίσταταί μοι Jones</last-name>
34 <last-name>Patterson</last-name>
43 <last-name>Meter & Smith</last-name>
51 <last-name>012345678901234567890</last-name>
59 <last-name>საერთაშორისო</last-name>
|
| H A D | test_04.HIPx.out | 2 <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 D | test_05.X.out | 1 …last-name>გთხოვთ ახ</last-name><department>431</department><percent-time>90</percent-time><benefit…
|
| H A D | test_05.XP.out | 35 <last-name>გთხოვთ ახ</last-name>
43 <last-name>Οὐχὶ ταὐτὰ παρίσταταί μοι Jones</last-name>
51 <last-name>Patterson</last-name>
59 <last-name>Meter & Smith</last-name>
66 <last-name>012345678901234567890</last-name>
73 <last-name>საერთაშორისო</last-name>
81 <last-name>෴ණ්ණ෴෴ණ්ණ෴෴ණ්ණ෴෴෴</last-name>
|
| H A D | test_06.HIPx.out | 4 …<div class="data" data-tag="last-name" data-xpath="/employees/employee/last-name" data-type="strin…
11 …<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 D | test_07.HIPx.out | 24 <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-src/contrib/llvm-project/libcxx/include/ |
| H A D | numeric | 21 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_op);
75 exclusive_scan(InputIterator first, InputIterator last,
80 exclusive_scan(InputIterator first, InputIterator last,
[all...] |
| H A D | algorithm | 50 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 = {}); // since C++20
80 constexpr I find(I first, S last, const T& value, Proj proj = {}); // since C++20
89 constexpr I find_if(I first, S last, Pred pred, Proj proj = {}); // since C++20
98 constexpr I find_if_not(I first, S last, Pred pred, Proj proj = {}); // since C++20
107 constexpr subrange<I> find_last(I first, S last, const T& value, Proj proj = {}); // since C++23
116 constexpr subrange<I> find_last_if(I first, S last, Pred pred, Proj proj = {}); // since C++23
124 constexpr subrange<I> find_last_if_not(I first, S last, Pred pred, Proj proj = {}); // since C++23
196 count(I first, S last, const T& value, Proj proj = {}); // since C++20
206 count_if(I first, S last, Pre
[all...] |
| H A D | charconv | 34 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, doubl
[all...] |
| /freebsd-src/crypto/heimdal/lib/wind/ |
| H A D | stringprep.py | 80 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-src/contrib/llvm-project/llvm/lib/CodeGen/ |
| H A D | SwitchLoweringUtils.cpp | 24 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 in findJumpTables()
173 for (unsigned First = 0, Last; First < N; First = Last + 1) { findJumpTables() local
192 buildJumpTable(const CaseClusterVector & Clusters,unsigned First,unsigned Last,const SwitchInst * SI,const std::optional<SDLoc> & SL,MachineBasicBlock * DefaultMBB,CaseCluster & JTCluster) buildJumpTable() argument
348 for (unsigned First = 0, Last; First < N; First = Last + 1) { findBitTestClusters() local
367 buildBitTests(CaseClusterVector & Clusters,unsigned First,unsigned Last,const SwitchInst * SI,CaseCluster & BTCluster) buildBitTests() argument
500 caseClusterRank(const CaseCluster & CC,CaseClusterIt First,CaseClusterIt Last) caseClusterRank() argument
[all...] |