HomeSort by: relevance | last modified time | path
    Searched defs:an (Results 1 - 18 of 18) sorted by relevancy

  /src/games/primes/
spsp.c 54 uint64_t an = a % n; local in function:mulmod
58 x += an;
59 if ((x < an) || (x >= n))
62 if (an + an < an)
63 an = an + an - n;
64 else if (an + an >= n
    [all...]
  /src/dist/pf/libexec/tftp-proxy/
filter.c 15 * WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR PROFITS, WHETHER IN AN
195 char an[PF_ANCHOR_NAME_SIZE]; local in function:prepare_commit
203 snprintf(an, PF_ANCHOR_NAME_SIZE, "%s/%d.%d", FTP_PROXY_ANCHOR,
207 strlcpy(pfte[i].anchor, an, PF_ANCHOR_NAME_SIZE);
234 char an[PF_ANCHOR_NAME_SIZE]; local in function:prepare_rule
244 snprintf(an, PF_ANCHOR_NAME_SIZE, "%s/%d.%d", FTP_PROXY_ANCHOR,
246 strlcpy(pfp.anchor, an, PF_ANCHOR_NAME_SIZE);
247 strlcpy(pfr.anchor, an, PF_ANCHOR_NAME_SIZE);
  /src/lib/libc/stdlib/
radixsort.c 156 const u_char **an, *t, **aj, **top[256]; local in function:r_sort_a
170 an = a + n;
175 for (ak = a; ak < an;) {
202 top[255] = an;
231 for (aj = a; aj < an; *aj = r, aj += count[c], count[c] = 0)
  /src/dist/pf/usr.sbin/ftp-proxy/
filter.c 15 * WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR PROFITS, WHETHER IN AN
217 char an[PF_ANCHOR_NAME_SIZE]; local in function:prepare_commit
225 snprintf(an, PF_ANCHOR_NAME_SIZE, "%s/%d.%d", FTP_PROXY_ANCHOR,
229 strlcpy(pfte[i].anchor, an, PF_ANCHOR_NAME_SIZE);
256 char an[PF_ANCHOR_NAME_SIZE]; local in function:prepare_rule
266 snprintf(an, PF_ANCHOR_NAME_SIZE, "%s/%d.%d", FTP_PROXY_ANCHOR,
268 strlcpy(pfp.anchor, an, PF_ANCHOR_NAME_SIZE);
269 strlcpy(pfr.anchor, an, PF_ANCHOR_NAME_SIZE);
  /src/games/hack/
hack.objnam.c 107 const char *an = ocl->oc_name; local in function:typename
126 Strcpy(buf, an);
140 strlcpy(buf, dn ? dn : an, sizeof(buf));
155 Snprintf(buf+bufpos, sizeof(buf)-bufpos, " of %s", an);
176 const char *an = objects[obj->otyp].oc_name; local in function:xname
194 strlcpy(buf, an, bufmax);
219 strlcpy(buf, an, bufmax);
239 strlcat(buf, an, bufmax);
256 strlcat(buf, an, bufmax);
269 Snprintf(buf, bufmax, "wand of %s", an);
455 char *un, *dn, *an; local in function:readobjnam
    [all...]
  /src/sys/dev/ic/
athrate-amrr.c 104 ath_rate_node_init(struct ath_softc *sc, struct ath_node *an)
107 ath_rate_update(sc, &an->an_node, 0);
111 ath_rate_node_cleanup(struct ath_softc *sc, struct ath_node *an)
116 ath_rate_findrate(struct ath_softc *sc, struct ath_node *an,
120 struct amrr_node *amn = ATH_NODE_AMRR(an);
131 ath_rate_setupxtxdesc(struct ath_softc *sc, struct ath_node *an,
134 struct amrr_node *amn = ATH_NODE_AMRR(an);
144 ath_rate_tx_complete(struct ath_softc *sc, struct ath_node *an,
147 struct amrr_node *amn = ATH_NODE_AMRR(an);
171 ath_rate_newassoc(struct ath_softc *sc, struct ath_node *an, int isnew
200 struct ath_node *an = ATH_NODE(ni); local in function:ath_rate_update
    [all...]
athrate-onoe.c 127 ath_rate_node_init(struct ath_softc *sc, struct ath_node *an)
130 ath_rate_update(sc, &an->an_node, 0);
134 ath_rate_node_cleanup(struct ath_softc *sc, struct ath_node *an)
139 ath_rate_findrate(struct ath_softc *sc, struct ath_node *an,
143 struct onoe_node *on = ATH_NODE_ONOE(an);
154 ath_rate_setupxtxdesc(struct ath_softc *sc, struct ath_node *an,
157 struct onoe_node *on = ATH_NODE_ONOE(an);
167 ath_rate_tx_complete(struct ath_softc *sc, struct ath_node *an,
170 struct onoe_node *on = ATH_NODE_ONOE(an);
181 ath_rate_newassoc(struct ath_softc *sc, struct ath_node *an, int isnew
190 struct ath_node *an = ATH_NODE(ni); local in function:ath_rate_update
    [all...]
athrate-sample.c 97 * This file is an implementation of the SampleRate algorithm
152 ath_rate_node_init(struct ath_softc *sc, struct ath_node *an)
159 ath_rate_node_cleanup(struct ath_softc *sc, struct ath_node *an)
254 ath_rate_findrate(struct ath_softc *sc, struct ath_node *an,
258 struct sample_node *sn = ATH_NODE_SAMPLE(an);
327 ether_sprintf(an->an_node.ni_macaddr),
349 an->an_node.ni_txrate = ndx;
366 ath_rate_setupxtxdesc(struct ath_softc *sc, struct ath_node *an,
369 struct sample_node *sn = ATH_NODE_SAMPLE(an);
395 update_stats(struct ath_softc *sc, struct ath_node *an,
652 struct ath_node *an = ATH_NODE(ni); local in function:ath_rate_ctl_reset
    [all...]
athn.c 16 * WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR PROFITS, WHETHER IN AN
225 if (sc->sc_max_aid != 0) /* we have an override */
674 /* Make sure no DMA is active by doing an AHB reset. */
1288 struct athn_node *an = (struct athn_node *)ni; local in function:athn_iter_func
1290 ieee80211_amrr_choose(&sc->sc_amrr, ni, &an->amn);
1765 * NB: The AR9285 and all single-stream parts have an issue that
2415 struct athn_node *an = (void *)ni; local in function:athn_newassoc
2420 ieee80211_amrr_node_init(&sc->sc_amrr, &an->amn);
2431 an->ridx[i] = ridx;
2435 an->fallback[i] = i
    [all...]
arn5008.c 16 * WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR PROFITS, WHETHER IN AN
972 struct athn_node *an; local in function:ar5008_tx_process
997 an = (struct athn_node *)bf->bf_ni;
1008 an->amn.amn_txcnt++;
1010 an->amn.amn_retrycnt++;
1315 struct athn_node *an = (void *)ni; local in function:ar5008_tx
1403 ridx[i] = an->ridx[txrate];
1404 txrate = an->fallback[txrate];
arn9003.c 16 * WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR PROFITS, WHETHER IN AN
274 * Read an arbitrary number of bytes at a specified address in EEPROM.
334 * Read an arbitrary number of bytes at a specified address in OTPROM.
355 * Determine if the chip has an external EEPROM or an OTPROM and its size.
1102 struct athn_node *an; local in function:ar9003_tx_process
1143 an = (struct athn_node *)bf->bf_ni;
1154 an->amn.amn_txcnt++;
1156 an->amn.amn_retrycnt++;
1467 struct athn_node *an = (void *)ni local in function:ar9003_tx
    [all...]
ath.c 712 * (and system). This varies by chip and is mostly an
1238 * We may be doing a reset in response to an ioctl
1624 * so that rx frames have an entry to match.
1856 * Delete an entry in the key cache allocated by ath_key_alloc.
2155 * Allocate and setup an initial beacon frame.
2355 * an 11g network. The 802.11 layer notifies us via callback,
2457 * When operating as an AP this resets the TSF and sets
2815 struct ath_node *an; local in function:ath_node_alloc
2817 an = malloc(space, M_80211_NODE, M_NOWAIT | M_ZERO);
2818 if (an == NULL)
3048 struct ath_node *an; local in function:ath_rx_proc
3628 struct ath_node *an; local in function:ath_tx_start
4119 struct ath_node *an; local in function:ath_tx_processq
    [all...]
  /src/sys/fs/adosfs/
advfsops.c 115 * Not an update, or updating the name: look up the name
364 * lookup an anode, if not found, create
368 adosfs_vget(struct mount *mp, ino_t an, int lktype, struct vnode **vpp)
373 block = an;
374 KASSERT(block == an);
398 u_long an; local in function:adosfs_loadvnode
402 KASSERT(key_len == sizeof(an));
403 memcpy(&an, key, key_len);
406 if ((error = bread(amp->devvp, an * amp->bsize / DEV_BSIZE,
414 ap->block = an;
    [all...]
  /src/usr.bin/spell/spellprog/
spellprog.c 119 static int an(char *, const char *, const char *, size_t);
224 { .suf = "naino", .p1 = an, .n1 = 3,
226 { .suf = "na", .p1 = an, .n1 = 1,
496 an(char *ep, const char *d, const char *a, size_t lev) function in typeref:typename:int
  /src/sys/uvm/
uvm_amap.c 54 * avoid an endless loop, the amap cache's allocator cannot allocate
55 * memory from an amap (it currently goes through the kernel uobj, so
75 * what is ppref? ppref is an _optional_ amap feature which is used
79 * when enabled, an array of ints is allocated for the pprefs. this
82 * to only a part of an amap). if the allocation of the array fails
85 * give up (after all, this is an optional feature!).
92 * of the chunk. here is an example:
145 * amap_alloc1: allocate an amap, but do not initialise the overlay.
226 * amap_alloc: allocate an amap to manage "sz" bytes of anonymous VM
314 * amap_free: free an ama
1448 struct vm_anon *an; local in function:amap_lookup
1494 struct vm_anon * const an = anons[i]; local in function:amap_lookups
    [all...]
  /src/sys/external/bsd/drm2/dist/drm/i915/display/
intel_hdcp.c 210 * out of reset. So if Key is not already loaded, its an error state.
614 } an; local in function:intel_hdcp_auth
632 * whether the display supports HDCP before we write An. For HDMI
645 /* Initialize An with 2 random values and acquire it */
652 /* Wait for An to be acquired */
656 DRM_ERROR("Timed out waiting for An\n");
660 an.reg[0] = I915_READ(HDCP_ANLO(dev_priv, cpu_transcoder, port));
661 an.reg[1] = I915_READ(HDCP_ANHI(dev_priv, cpu_transcoder, port));
662 ret = shim->write_an_aksv(intel_dig_port, an.shim);
709 * On DP, there's an R0_READY bit available but no such bi
    [all...]
  /src/sys/dev/usb/
if_athn_usb.c 15 * WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR PROFITS, WHETHER IN AN
1563 struct athn_node *an = ATHN_NODE(ni); local in function:athn_usb_ampdu_tx_start
1569 cmd.sta_index = an->sta_index;
1597 struct athn_node *an = ATHN_NODE(ni); local in function:athn_usb_ampdu_tx_stop
1603 cmd.sta_index = an->sta_index;
1660 struct athn_node *an = ATHN_NODE(ni); local in function:athn_usb_create_node
1678 an->sta_index = IEEE80211_NODE_AID(ni);
1680 an->sta_index = 1;
1689 sta.sta_index = an->sta_index;
2365 /* Allocate an mbuf to store the next pktlen bytes. *
2458 struct athn_node *an = ATHN_NODE(ni); local in function:athn_usb_tx
    [all...]
  /src/sys/external/bsd/drm2/dist/drm/amd/display/modules/hdcp/
hdcp.h 20 * OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE,
122 uint8_t an[8]; member in struct:mod_hdcp_message_hdcp1
209 /* per state in an authentication */

Completed in 244 milliseconds