/freebsd-current/sys/dev/rtwn/pci/ |
H A D | rtwn_pci_rx.c | 253 RTWN_DPRINTF(sc, RTWN_DEBUG_INTR, "%s: qid %d, last %d, cur %d\n", 254 __func__, qid, ring->last, ring->cur); 259 while(ring->last != ring->cur) { 260 data = &ring->tx_data[ring->last]; 262 ((uint8_t *)ring->desc + sc->txdesc_len * ring->last); 285 ring->last = (ring->last + 1) % RTWN_PCI_TX_LIST_COUNT;
|
/freebsd-current/lib/libc/amd64/string/ |
H A D | strrchr.S | 68 bswap %rcx # in reverse order, to find last match 98 bswap %rcx # in reverse order, to find last match 136 bsr %r11, %rcx # last location of c in (R10) 173 test %ecx, %ecx # was there a match in the last iter.? 185 test %ecx, %ecx # was there a match in the last iter.? 205 bsr %esi, %esi # last location of c in (R8)
|
/freebsd-current/contrib/libarchive/libarchive/test/ |
H A D | test_write_format_zip_large.c | 56 struct fileblock *last; member in struct:fileblocks 95 private->last->gap_size += (int64_t)size; 104 if (private->last == NULL) { 105 private->first = private->last = block; 107 private->last->next = block; 108 private->last = block;
|
/freebsd-current/contrib/tcpdump/ |
H A D | print-rx.c | 157 { RX_LAST_PACKET, 0, "last-pckt" }, 727 /* Start the search where we last left off */ 2663 int i, start, last; local 2719 for (i = 0, start = last = -2; i < nAcks; i++) 2729 if (last == -2) { 2739 * separated from the last number by 2743 else if (last != i - 1) { 2749 * We always set last to the value of 2750 * the last ack we saw. Conversely, start 2755 last [all...] |
/freebsd-current/contrib/mandoc/ |
H A D | eqn.c | 513 * 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...] |
/freebsd-current/sys/kern/ |
H A D | subr_asan.c | 211 int8_t last = (addr & KASAN_SHADOW_MASK) + 1; local 213 *byte = last; 317 int8_t last = (addr & KASAN_SHADOW_MASK) + 1; local 319 if (__predict_true(*byte == 0 || last <= *byte)) { 329 int8_t *byte, last; local 337 last = ((addr + 1) & KASAN_SHADOW_MASK) + 1; 339 if (__predict_true(*byte == 0 || last <= *byte)) { 349 int8_t *byte, last; local 357 last = ((addr + 3) & KASAN_SHADOW_MASK) + 1; 359 if (__predict_true(*byte == 0 || last < 369 int8_t *byte, last; local [all...] |
/freebsd-current/cddl/contrib/opensolaris/cmd/dtrace/test/tst/common/ustack/ |
H A D | tst.spin.ksh | 106 last if /^$/;
|
/freebsd-current/contrib/bmake/unit-tests/ |
H A D | sh-errctl.mk | 8 # control, only the last command from each line is checked. A shell command
|
/freebsd-current/cddl/contrib/opensolaris/lib/libdtrace/common/ |
H A D | dt_program.c | 91 dtrace_ecbdesc_t *last = NULL; local 109 if (edp == last) 111 last = edp; 320 dtrace_actdesc_t *last = sdp->dtsd_action_last; local 323 assert(last != NULL); 336 edp->dted_action = last->dtad_next; 338 ap->dtad_next = last->dtad_next; 344 last->dtad_next = NULL;
|
/freebsd-current/contrib/ntp/scripts/deprecated/ |
H A D | freq_adj.in | 26 last;
|
/freebsd-current/sys/dev/mthca/ |
H A D | mthca_provider.h | 237 void *last; member in struct:mthca_srq 255 void *last; member in struct:mthca_wq
|
H A D | mthca_allocator.c | 47 obj = find_next_zero_bit(alloc->table, alloc->max, alloc->last); 73 alloc->last = min(alloc->last, obj); 88 alloc->last = 0;
|
/freebsd-current/sys/contrib/libfdt/ |
H A D | fdt.c | 222 * the same as the last. 236 const char *last = strtab + tabsize - len; local 239 for (p = strtab; p <= last; p++)
|
/freebsd-current/contrib/unbound/edns-subnet/ |
H A D | addrtree.c | 138 tree->last = NULL; 168 if (!node->next) { /* it is the last as well */ 170 tree->last = NULL; 175 } else if (node == tree->last) { /* but not the first */ 176 tree->last = node->prev; 177 tree->last->next = NULL; 192 tree->last->next = node; 193 node->prev = tree->last; 195 tree->last = node;
|
H A D | addrtree.h | 87 /** last node in LRU list, last candidate to go */ 88 struct addrnode *last; member in struct:addrtree
|
/freebsd-current/sys/dev/qat/qat_common/ |
H A D | adf_heartbeat.c | 158 u16 last = prev[thr].resp_heartbeat_cnt; local 161 resp == last) {
|
/freebsd-current/usr.bin/bc/ |
H A D | scan.l | 134 "last" return DOT;
|
/freebsd-current/bin/sh/ |
H A D | histedit.c | 257 int first, last, direction; local 345 * determine [first] and [last] 362 last = str_to_event(laststr, 1); 365 i = last; 366 last = first; 374 direction = first < last ? H_PREV : H_NEXT; 436 * At end? (if we were to lose last, we'd sure be 439 if (he.num == last) 494 str_to_event(const char *str, int last) argument 521 * the notion of first and last i [all...] |
/freebsd-current/contrib/llvm-project/llvm/lib/Demangle/ |
H A D | ItaniumDemangle.cpp | 36 const char *last) { 38 if (first != last) { 41 if (t1 != last) { 45 for (++t1; t1 != last && std::isdigit(*t1); ++t1) 47 if (t1 != last && *t1 == '_') 53 for (; t1 != last && std::isdigit(*t1); ++t1) 55 if (t1 == last) 56 first = last; 35 parse_discriminator(const char *first, const char *last) argument
|
/freebsd-current/contrib/libedit/ |
H A D | hist.h | 48 wchar_t *last; /* The last character */ member in struct:el_history_t
|
/freebsd-current/contrib/unbound/dnstap/ |
H A D | dtstream.h | 76 struct dt_msg_entry* first, *last; member in struct:dt_msg_queue
|
/freebsd-current/contrib/unbound/validator/ |
H A D | val_neg.h | 75 /** last in lru (least recently used element) */ 76 struct val_neg_data* last; member in struct:val_neg_cache
|
/freebsd-current/contrib/ncurses/ncurses/tinfo/ |
H A D | db_iterator.c | 64 char *last = my_blob + strlen(my_blob); local 65 if (last != my_blob) 66 *last++ = NCURSES_PATHSEP; 67 _nc_STRCPY(last, text, limit);
|
/freebsd-current/contrib/ncurses/ncurses/trace/ |
H A D | visbuf.c | 303 int last = len - 1; local 308 last = j - 1; 315 for (j = first; j <= last; ++j) { 367 first = last + 1;
|
/freebsd-current/crypto/openssl/crypto/evp/ |
H A D | e_aes_cbc_hmac_sha1.c | 174 unsigned int frag, last, packlen, i, x4 = 4 * n4x, minblocks, processed = local 189 last = (unsigned int)inp_len + frag - (frag << (1 + n4x)); 190 if (last > frag && ((last + 13 + 9) % 64) < (x4 - 1)) { 192 last -= x4 - 1; 219 unsigned int len = (i == (x4 - 1) ? last : frag); 265 minblocks = ((frag <= last ? frag : last) - (64 - 13)) / 64; 295 unsigned int len = (i == (x4 - 1) ? last : frag), 362 unsigned int len = (i == (x4 - 1) ? last 847 unsigned int frag, last, packlen, inp_len; local [all...] |