Searched refs:last (Results 226 - 250 of 999) sorted by relevance

1234567891011>>

/openbsd-current/lib/libcrypto/ocsp/
H A Docsp_cl.c305 OCSP_resp_find(OCSP_BASICRESP *bs, OCSP_CERTID *id, int last) argument
313 if (last < 0)
314 last = 0;
316 last++;
318 for (i = last; i < sk_OCSP_SINGLERESP_num(sresp); i++) {
/openbsd-current/gnu/usr.bin/gcc/gcc/
H A Dgenrecog.c51 to the last recognized insn in the old sequence. */
74 struct decision *last; member in struct:decision_head
319 new_decision (position, last)
321 struct decision_head *last;
327 new->success = *last;
331 last->first = last->last = new;
770 add_to_sequence (pattern, last, position, insn_type, top)
772 struct decision_head *last;
2458 struct decision *last; local
[all...]
H A Dra.c651 rtx last = get_last_insn (); local
653 if (! INSN_P (last))
654 last = prev_real_insn (last);
659 one of the last insns. Add it if it's not there anymore. */
660 if (last)
666 last = bb->end;
667 if (!INSN_P (last) || GET_CODE (PATTERN (last)) != USE)
674 emit_insn_after (insns, last);
[all...]
/openbsd-current/gnu/usr.bin/gcc/gcc/java/
H A Dlex.c237 lex->last = -1;
349 if (lex->first == 0 || lex->first >= lex->last)
353 if (lex->first >= lex->last)
356 lex->last = 0;
360 r = fread (&lex->buffer[lex->last], 1,
361 sizeof (lex->buffer) - lex->last,
363 lex->last += r;
366 inbytesleft = lex->last - lex->first;
428 lex->last - lex->first);
429 lex->last
1969 int last = ARRAY_SIZE (cxx_keywords); local
[all...]
/openbsd-current/usr.sbin/nsd/
H A Dnamedb.c84 /** make the domain last in the numlist, changes numbers of domains */
89 domain_type* last = table->numlist_last; local
90 if(domain == last)
92 /* swap numbers with the last element */
94 domain->number = last->number;
95 last->number = sw;
96 /* swap list position with the last element */
98 assert(last->numlist_prev);
99 if(domain->numlist_next != last) {
100 /* case 1: there are nodes between domain .. last */
[all...]
H A Ddifffile.c479 /* fixup the last in the zone */
756 /* last moved to rrnum, others at same index*/
1458 task_create_new_elem(struct udb_base* udb, udb_ptr* last, udb_ptr* e, argument
1464 if(udb_ptr_is_null(last)) {
1467 udb_rptr_set_ptr(&TASKLIST(last)->next, udb, e);
1469 udb_ptr_set_ptr(last, udb, e);
1484 void task_new_soainfo(struct udb_base* udb, udb_ptr* last, struct zone* z, argument
1511 if(!task_create_new_elem(udb, last, &e, sz, apex)) {
1581 void task_new_expire(struct udb_base* udb, udb_ptr* last, argument
1588 if(!task_create_new_elem(udb, last,
1598 task_new_check_zonefiles(udb_base* udb, udb_ptr* last, const dname_type* zone) argument
1614 task_new_write_zonefiles(udb_base* udb, udb_ptr* last, const dname_type* zone) argument
1629 task_new_set_verbosity(udb_base* udb, udb_ptr* last, int v) argument
1644 task_new_add_zone(udb_base* udb, udb_ptr* last, const char* zone, const char* pattern, unsigned zonestatid) argument
1666 task_new_del_zone(udb_base* udb, udb_ptr* last, const dname_type* dname) argument
1679 task_new_add_key(udb_base* udb, udb_ptr* last, struct key_options* key) argument
1701 task_new_del_key(udb_base* udb, udb_ptr* last, const char* name) argument
1717 task_new_add_cookie_secret(udb_base* udb, udb_ptr* last, const char* secret) argument
1736 task_new_drop_cookie_secret(udb_base* udb, udb_ptr* last) argument
1747 task_new_activate_cookie_secret(udb_base* udb, udb_ptr* last) argument
1758 task_new_add_pattern(udb_base* udb, udb_ptr* last, struct pattern_options* p) argument
1783 task_new_del_pattern(udb_base* udb, udb_ptr* last, const char* name) argument
1799 task_new_opt_change(udb_base* udb, udb_ptr* last, struct nsd_options* opt) argument
1819 task_new_zonestat_inc(udb_base* udb, udb_ptr* last, unsigned sz) argument
1836 task_new_apply_xfr(udb_base* udb, udb_ptr* last, const dname_type* dname, uint32_t old_serial, uint32_t new_serial, uint64_t filenumber) argument
[all...]
/openbsd-current/usr.sbin/smtpd/
H A Dsmtpctl.c527 struct stat_digest last, digest; local
530 memset(&last, 0, sizeof(last));
556 digest.clt_connect - last.clt_connect,
557 digest.clt_disconnect - last.clt_disconnect,
560 digest.evp_enqueued - last.evp_enqueued,
561 digest.evp_dequeued - last.evp_dequeued,
563 digest.dlv_ok - last.dlv_ok,
564 digest.dlv_tempfail - last.dlv_tempfail,
565 digest.dlv_permfail - last
[all...]
/openbsd-current/gnu/llvm/clang/lib/Frontend/
H A DVerifyDiagnosticConsumer.cpp703 // Detach comment handler once last active source file completed.
712 // Check diagnostics once last file completed.
787 for (size_t last = 0;; loc = C.find('\\', last)) {
789 C2 += C.substr(last);
792 C2 += C.substr(last, loc-last);
793 last = loc + 1;
795 if (C[last] == '\n' || C[last]
[all...]
/openbsd-current/sys/kern/
H A Dsubr_extent.c404 struct extent_region *rp, *last; local
453 * Keep a pointer to the last region we looked at so
455 * we insert ourselves. If "last" is NULL when we
459 last = NULL;
547 last = rp;
551 * We don't conflict with any regions. "last" points
555 extent_insert_and_optimize(ex, start, size, last, myrp);
613 struct extent_region *rp, *last, *bestlast; local
650 * Keep a pointer to the last region we looked at so
652 * we insert ourselves. If "last" i
[all...]
/openbsd-current/sys/dev/pci/drm/amd/amdkfd/
H A Dkfd_migrate.c115 * the last sdma finish fence which is returned to check copy memory is done.
184 * operations, this is the last sdma operation fence.
304 prange->last, ttm_res_offset);
434 __func__, r, prange->start, prange->last);
441 prange->start, prange->last);
503 prange->svms, prange->start, prange->last, best_loc);
514 prange->start, prange->last, best_loc);
517 end = (prange->last + 1) << PAGE_SHIFT;
593 prange->last);
606 prange->svms, prange->start, prange->last);
[all...]
/openbsd-current/lib/libpcap/
H A Doptimize.c638 struct slist *next, *last; local
645 last = s;
653 last = next;
710 * by the last stmt of this sequence.
742 if (last->s.code == (BPF_ALU|BPF_SUB|BPF_X) &&
756 last->s.code = NOP;
763 last->s.code = NOP;
772 else if (last->s.code == (BPF_ALU|BPF_SUB|BPF_K) &&
776 b->s.k += last->s.k;
777 last
1027 deadstmt(struct stmt *s, struct stmt *last[]) argument
1055 struct stmt *last[N_ATOMS]; local
[all...]
/openbsd-current/gnu/gcc/gcc/
H A Dgenrecog.c51 to the last recognized insn in the old sequence. */
71 struct decision *last; member in struct:decision_head
497 new_decision (const char *position, struct decision_head *last)
501 new->success = *last;
505 last->first = last->last = new;
898 add_to_sequence (rtx pattern, struct decision_head *last, const char *position,
919 sub = this = new_decision (position, last);
941 last
494 new_decision(const char *position, struct decision_head *last) argument
895 add_to_sequence(rtx pattern, struct decision_head *last, const char *position, enum routine_type insn_type, int top) argument
2545 struct decision *last; local
[all...]
H A Dtree-cfg.c266 Examine the last statement in each basic block to see if the block
272 tree last; local
276 last = bsi_stmt (bsi);
280 if (last == factored_computed_goto)
283 /* If the last statement is a computed goto, factor it. */
284 if (computed_goto_p (last))
318 var, GOTO_DESTINATION (last));
322 GOTO_DESTINATION (last) = factored_label_decl;
469 tree last = last_stmt (bb); local
472 if (last)
881 block_stmt_iterator last = bsi_last (bb); local
1311 tree_stmt_iterator last; local
2416 tree last = last_stmt (bb); local
2604 block_stmt_iterator last; local
2712 block_stmt_iterator last = bsi_last (bb); local
2725 tree last, prev; local
2924 block_stmt_iterator last = bsi_last (bb); local
4138 tree last, first; local
5743 tree last; local
5787 tree last = last_stmt (e->src); local
[all...]
/openbsd-current/gnu/usr.bin/binutils/gas/
H A Ddw2gencfi.c93 struct cfi_insn_data **last; member in struct:fde_entry
102 struct cfi_insn_data *first, *last; member in struct:cie_entry
139 fde->last = &fde->data;
156 *cur_fde_data->last = insn;
157 cur_fde_data->last = &insn->next;
237 /* Add a CFI insn to advance the PC from the last address to LABEL. */
457 /* If the last address was not at the current PC, advance to current. */
558 /* If the last address was not at the current PC, advance to current. */
860 for (i = cie->first; i != cie->last; i = i->next)
928 i != cie->last
[all...]
/openbsd-current/gnu/usr.bin/gcc/gcc/f/
H A Dstt.c720 ffestt_implist_append (ffesttImpList list, ffelexToken first, ffelexToken last)
731 new->last = last;
751 new->last = NULL;
758 void fn(ffelexToken first,ffelexToken last);
773 (*fn) (next->first, next->last);
792 if (next->last != NULL)
793 ffelex_token_kill (next->last);
814 ti->previous = tl->last;
835 tl->first = tl->last
719 ffestt_implist_append(ffesttImpList list, ffelexToken first, ffelexToken last) argument
[all...]
/openbsd-current/sys/lib/libz/
H A Dcrc32.c579 z_size_t last, last2, i; local
624 /* Do one last smaller batch with the remaining words, if there are enough
626 last = num / 3;
627 if (last >= Z_BATCH_MIN) {
628 last2 = last << 1;
631 for (i = 0; i < last; i++) {
633 val1 = word[i + last];
639 word += 3 * last;
640 num -= 3 * last;
641 val = x2nmodp(last,
[all...]
H A Dinflate.c46 * - Unroll last copy for window match in inflate_fast()
116 state->last = 0;
355 Update the window with the last wsize (normally 32K) bytes written before
363 advantage, since only the last 32K of output is copied to the sliding window
574 When there is a window, goto inf_leave will update the window with the last
601 code last; /* parent table entry */ local
852 if (state->last) {
858 state->last = BITS(1);
863 state->last ? " (last)"
[all...]
/openbsd-current/lib/libz/
H A Dcrc32.c579 z_size_t last, last2, i; local
624 /* Do one last smaller batch with the remaining words, if there are enough
626 last = num / 3;
627 if (last >= Z_BATCH_MIN) {
628 last2 = last << 1;
631 for (i = 0; i < last; i++) {
633 val1 = word[i + last];
639 word += 3 * last;
640 num -= 3 * last;
641 val = x2nmodp(last,
[all...]
H A Dinflate.c46 * - Unroll last copy for window match in inflate_fast()
116 state->last = 0;
355 Update the window with the last wsize (normally 32K) bytes written before
363 advantage, since only the last 32K of output is copied to the sliding window
574 When there is a window, goto inf_leave will update the window with the last
601 code last; /* parent table entry */ local
853 if (state->last) {
859 state->last = BITS(1);
864 state->last ? " (last)"
[all...]
/openbsd-current/gnu/llvm/llvm/include/llvm/ADT/
H A DHashing.h410 hash_code hash_combine_range_impl(InputIteratorT first, InputIteratorT last) { argument
414 while (first != last && store_and_advance(buffer_ptr, buffer_end,
417 if (first == last)
423 while (first != last) {
424 // Fill up the buffer. We don't clear it, which re-mixes the last round
427 while (first != last && store_and_advance(buffer_ptr, buffer_end,
432 // a mix of the last 64-bytes. That is how the algorithm works when we
454 hash_combine_range_impl(ValueT *first, ValueT *last) { argument
457 const char *s_end = reinterpret_cast<const char *>(last);
486 hash_code hash_combine_range(InputIteratorT first, InputIteratorT last) { argument
[all...]
/openbsd-current/sys/dev/pci/drm/amd/amdgpu/
H A Damdgpu_trace.h252 __field(long, last)
260 __entry->last = mapping->last;
264 TP_printk("bo=%p, start=%lx, last=%lx, offset=%010llx, flags=%llx",
265 __entry->bo, __entry->start, __entry->last,
276 __field(long, last)
284 __entry->last = mapping->last;
288 TP_printk("bo=%p, start=%lx, last=%lx, offset=%010llx, flags=%llx",
289 __entry->bo, __entry->start, __entry->last,
[all...]
/openbsd-current/usr.bin/vi/ex/
H A Dex_subst.c65 * repeat the last substitution.
129 * If the pattern string is empty, use the last RE (not just the
130 * last substitution RE).
173 * special case nonexistent last patterns or whether or not
182 * If the entire replacement pattern is "%", then use the last
246 * Substitute using the last substitute RE and replacement pattern.
268 * Substitute using the last RE and last substitute replacement pattern.
344 size_t blen, cnt, last, lbclen, lblen, len, llen; local
370 * it only displayed the last chang
[all...]
/openbsd-current/lib/libcurses/tinfo/
H A Dparse_entry.c76 unsigned first, last, n; local
82 last = tp->ext_Booleans;
88 last = tp->ext_Numbers + first;
94 last = tp->ext_Strings + first;
121 for (n = first, found = FALSE; n < last; n++) {
144 for (last = (unsigned) (max - 1); last > tindex; last--)
158 tp->Booleans[last] = tp->Booleans[last
[all...]
/openbsd-current/sys/uvm/
H A Duvm_map.c559 * Fills in *start_ptr and *end_ptr to be the first and last entry describing
588 * Fill in first, last, so they point at the entries containing the
589 * first and last address of the range.
654 struct vm_map_entry**last, vaddr_t *addr, vsize_t sz,
667 if (uvm_addr_invoke(map, uaddr, first, last,
674 if (uvm_addr_invoke(map, uaddr, first, last,
735 struct vm_map_entry *first, *last, *entry, *new; local
787 first = last = NULL;
793 * Fill in first, last and *addr.
812 if (!uvm_map_isavail(map, NULL, &first, &last, *add
938 struct vm_map_entry *first, *last, *entry, *new; local
1394 uvm_map_mkentry(struct vm_map *map, struct vm_map_entry *first, struct vm_map_entry *last, vaddr_t addr, vsize_t sz, int flags, struct uvm_map_deadq *dead, struct vm_map_entry *new) argument
2199 struct vm_map_entry *first, *last, *tmp; local
3448 struct vm_map_entry *first = NULL, *last = NULL; local
3541 struct vm_map_entry *new_entry, *first, *last; local
5094 struct vm_map_entry *entry, *last; local
[all...]
/openbsd-current/usr.bin/mandoc/
H A Deqn.c513 * Allocate a box as the last child of the parent node.
527 parent->last->next = bp;
528 bp->prev = parent->last;
532 parent->last = bp;
537 * Reparent the current last node (of the current parent) under a new
547 assert(NULL != parent->last);
548 b = parent->last;
549 if (parent->last == parent->first)
552 parent->last = b->prev;
558 newb->first = newb->last
[all...]

Completed in 407 milliseconds

1234567891011>>