HomeSort by: relevance | last modified time | path
    Searched refs:nth (Results 1 - 13 of 13) sorted by relevancy

  /src/sys/sys/
fault.h 52 unsigned long nth; member in union:fault_ioc_enable::__anon7587
  /src/sys/kern/
subr_fault.c 54 volatile unsigned long nth; member in struct:__anon6864
62 .nth = FAULT_NTH_MIN,
97 if (__predict_false(cnt % atomic_load_relaxed(&f->nth) == 0)) {
126 if (args->nth < FAULT_NTH_MIN)
137 atomic_store_relaxed(&fault_global.nth, args->nth);
153 atomic_store_relaxed(&f->nth, args->nth);
  /src/sys/dev/pci/cxgb/
cxgb_lro.c 250 struct tcphdr *th, *nth = (struct tcphdr *)(nih + 1); local
251 uint32_t seq = ntohl(nth->th_seq);
252 int plen, tcpiphlen, olen = (nth->th_off << 2) - sizeof (*nth);
269 uint32_t *nptr = (uint32_t *)(nth + 1);
278 th->th_ack = nth->th_ack;
279 th->th_win = nth->th_win;
281 tcpiphlen = (nth->th_off << 2) + sizeof (*nih);
  /src/external/gpl2/texinfo/dist/util/
texi-docstring-magic.el 175 (let ((regexp (nth 0 test))
176 (predicate (nth 1 test))
177 (replace (nth 2 test))
260 (nth 1 def))))
  /src/external/gpl3/gcc.old/dist/gcc/config/nds32/
nds32-utils.cc 64 /* Extract an rtx from a parallel rtx with index NTH. If NTH is a negative
65 value, the function returns the last NTH rtx. */
67 parallel_element (rtx parallel_rtx, int nth)
74 if (nth >= 0)
76 if (nth >= len)
79 return XVECEXP (parallel_rtx, 0, nth);
83 if (len + nth < 0)
86 return XVECEXP (parallel_rtx, 0, len + nth);
  /src/external/gpl2/gettext/dist/gettext-tools/misc/
po-compat.el 170 (setq short-read (< (nth 1 pair) 4096)))))
po-mode.el 2007 (if (buffer-name (nth 1 slot))
2009 (let ((overlay (nth 2 slot)))
2018 (goto-char (nth 0 slot))
2019 (pop-to-buffer (nth 1 slot))
2020 (let ((overlay (nth 2 slot)))
2034 (pop-to-buffer (nth 1 slot))
2035 (let ((overlay (nth 2 slot)))
2095 (entry-marker (nth 0 back-pointer))
2139 (entry-marker (nth 0 back-pointer))
2140 (overlay-info (nth 2 back-pointer)
    [all...]
  /src/external/bsd/libc++/dist/libcxxrt/src/
libelftc_dem_gnu3.c 2489 long nth; local
2595 if ((nth = strtol(ddata->cur, (char **) NULL, 36)) == 0 &&
2600 ++nth;
2605 assert(nth > 0);
2607 return (cpp_demangle_get_subst(ddata, nth));
2807 long nth; local
2819 if ((nth = strtol(ddata->cur, (char **) NULL, 36)) == 0 &&
2824 ++nth;
2829 assert(nth > 0);
2831 return (cpp_demangle_get_tmpl_param(ddata, nth));
    [all...]
  /src/external/bsd/unbound/dist/iterator/
iter_utils.c 401 /** get RTT for the Nth fastest server */
444 int got_num = 0, low_rtt = 0, swap_to_front, rtt_band = RTT_BAND, nth; local
470 nth = nth_rtt(dp->result_list, num_results,
472 if(nth > 0) {
473 rtt_band = nth - low_rtt;
  /src/external/gpl3/gcc.old/dist/gcc/d/dmd/
mtype.h 577 static Parameter *getNth(Parameters *parameters, d_size_t nth);
mtype.d 6877 * Get nth `Parameter`, folding in tuples.
6880 * length, this function allows to get the `nth` parameter as if
6885 * nth = Index of the desired parameter.
6888 * The parameter at index `nth` (taking tuples into account),
6891 static Parameter getNth(Parameters* parameters, size_t nth)
6897 if (n == nth)
  /src/sys/dev/scsipi/
ses.c 708 * status for the Nth element of the Kth type.
1095 * and nth+1 instances of type M.
1210 ses_getthdr(uint8_t *buffer, int amt, int nth, SesThdr *thp)
1225 off += buffer[off+3] + 4 + (nth * 4);
  /src/external/gpl3/gcc.old/dist/libphobos/src/std/algorithm/
sorting.d 39 Computes the nth permutation of a range
3391 such that `r[nth]` refers to the element that would fall there if the range
3396 `e1` from `r[0]` to `r[nth]` satisfy `!less(r[nth], e1)`,
3397 and all elements `e2` from `r[nth]` to `r[r.length]` satisfy
3398 `!less(e2, r[nth])`. Effectively, it finds the `nth + 1` smallest
3410 nth = The index of the element that should be in sorted position after the
3413 Returns: a slice from `r[0]` to `r[nth]`, excluding `r[nth]` itself
    [all...]

Completed in 51 milliseconds