games/hack/hack.objnam.c

105

char *an = ocl->oc_name;

games/hack/hack.objnam.c

126

strlcpy(buf, an, sizeof buf);

games/hack/hack.objnam.c

140

strlcpy(buf, dn ? dn : an, sizeof buf);

games/hack/hack.objnam.c

154

snprintf(bp, buf + sizeof buf - bp, " of %s", an);

games/hack/hack.objnam.c

172

char *an = objects[obj->otyp].oc_name;

games/hack/hack.objnam.c

190

strlcpy(buf,an,len);

games/hack/hack.objnam.c

215

strlcpy(buf,an,len);

games/hack/hack.objnam.c

234

strlcat(buf, an, len);

games/hack/hack.objnam.c

250

strlcat(buf, an, len);

games/hack/hack.objnam.c

263

snprintf(buf, len, "wand of %s", an);

games/hack/hack.objnam.c

273

snprintf(buf, len, "ring of %s", an);

games/hack/hack.objnam.c

288

strlcpy(buf, an, len);

games/hack/hack.objnam.c

436

char *un, *dn, *an;

games/hack/hack.objnam.c

441

an = dn = un = 0;

games/hack/hack.objnam.c

554

an = cp;

games/hack/hack.objnam.c

562

if(!strncmp(cp, " of ", 4)) an = cp+4;

games/hack/hack.objnam.c

578

an = cp;

games/hack/hack.objnam.c

586

an = cp;

games/hack/hack.objnam.c

588

if(!an && !dn && !un)

games/hack/hack.objnam.c

596

if(an && strcmp(an, zn))

lib/libc/asr/asr_debug.c

174

int i, an, ns, ar, n;

lib/libc/asr/asr_debug.c

196

an = 0;

lib/libc/asr/asr_debug.c

197

ns = an + h.ancount;

lib/libc/asr/asr_debug.c

202

if (i == an)

lib/libc/stdlib/radixsort.c

129

const u_char **an, *t, **aj, **top[256];

lib/libc/stdlib/radixsort.c

140

an = a + n;

lib/libc/stdlib/radixsort.c

145

for (ak = a; ak < an;) {

lib/libc/stdlib/radixsort.c

172

top[255] = an;

lib/libc/stdlib/radixsort.c

201

for (aj = a; aj < an; *aj = r, aj += count[c], count[c] = 0)

lib/libcurses/base/lib_mouse.c

107

make an error

lib/libcurses/curses.priv.h

2263

make an error

lib/libpcap/savefile.c

487

return-an-error;

regress/lib/libc/asr/bin/res_mkquery.c

135

int i, an, ns, ar, n;

regress/lib/libc/asr/bin/res_mkquery.c

154

an = 0;

regress/lib/libc/asr/bin/res_mkquery.c

155

ns = an + h.ancount;

regress/lib/libc/asr/bin/res_mkquery.c

160

if (i == an)

regress/lib/libc/asr/bin/res_query.c

171

int i, an, ns, ar, n;

regress/lib/libc/asr/bin/res_query.c

190

an = 0;

regress/lib/libc/asr/bin/res_query.c

191

ns = an + h.ancount;

regress/lib/libc/asr/bin/res_query.c

196

if (i == an)

sbin/unwind/libunbound/util/data/msgreply.c

100

time_t ttl, time_t prettl, time_t expttl, time_t norecttl, size_t an,

sbin/unwind/libunbound/util/data/msgreply.c

121

rep->an_numrrsets = an;

sbin/unwind/libunbound/util/data/msgreply.h

271

time_t ttl, time_t prettl, time_t expttl, time_t norecttl, size_t an,

sys/arch/arm64/dev/aplpmu.c

135

struct aplpmu_nvmem *an;

sys/arch/arm64/dev/aplpmu.c

154

an = malloc(sizeof(*an), M_DEVBUF, M_WAITOK);

sys/arch/arm64/dev/aplpmu.c

155

an->an_sc = sc;

sys/arch/arm64/dev/aplpmu.c

156

an->an_base = reg[0];

sys/arch/arm64/dev/aplpmu.c

157

an->an_size = reg[1];

sys/arch/arm64/dev/aplpmu.c

158

an->an_nd.nd_node = node;

sys/arch/arm64/dev/aplpmu.c

159

an->an_nd.nd_cookie = an;

sys/arch/arm64/dev/aplpmu.c

160

an->an_nd.nd_read = aplpmu_nvmem_read;

sys/arch/arm64/dev/aplpmu.c

161

an->an_nd.nd_write = aplpmu_nvmem_write;

sys/arch/arm64/dev/aplpmu.c

162

nvmem_register(&an->an_nd);

sys/arch/arm64/dev/aplpmu.c

222

struct aplpmu_nvmem *an = cookie;

sys/arch/arm64/dev/aplpmu.c

223

struct aplpmu_softc *sc = an->an_sc;

sys/arch/arm64/dev/aplpmu.c

225

if (addr >= an->an_size || size > an->an_size - addr)

sys/arch/arm64/dev/aplpmu.c

229

an->an_base + addr, data, size);

sys/arch/arm64/dev/aplpmu.c

236

struct aplpmu_nvmem *an = cookie;

sys/arch/arm64/dev/aplpmu.c

237

struct aplpmu_softc *sc = an->an_sc;

sys/arch/arm64/dev/aplpmu.c

239

if (addr >= an->an_size || size > an->an_size - addr)

sys/arch/arm64/dev/aplpmu.c

243

an->an_base + addr, data, size);

sys/dev/ic/ar5008.c

1106

struct athn_node *an;

sys/dev/ic/ar5008.c

1135

an = (struct athn_node *)bf->bf_ni;

sys/dev/ic/ar5008.c

1164

ieee80211_ra_add_stats_ht(&an->rn,

sys/dev/ic/ar5008.c

1174

ieee80211_ra_add_stats_ht(&an->rn, ic, ni,

sys/dev/ic/ar5008.c

1177

ieee80211_ra_add_stats_ht(&an->rn, ic, ni,

sys/dev/ic/ar5008.c

1185

ieee80211_ra_choose(&an->rn, ic, ni);

sys/dev/ic/ar5008.c

1188

an->amn.amn_txcnt++;

sys/dev/ic/ar5008.c

1190

an->amn.amn_retrycnt++;

sys/dev/ic/ar5008.c

1483

struct athn_node *an = (void *)ni;

sys/dev/ic/ar5008.c

1568

ridx[i] = an->ridx[txrate];

sys/dev/ic/ar5008.c

1569

txrate = an->fallback[txrate];

sys/dev/ic/ar9003.c

1077

struct athn_node *an;

sys/dev/ic/ar9003.c

1117

an = (struct athn_node *)bf->bf_ni;

sys/dev/ic/ar9003.c

1128

an->amn.amn_txcnt++;

sys/dev/ic/ar9003.c

1130

an->amn.amn_retrycnt++;

sys/dev/ic/ar9003.c

1402

struct athn_node *an = (void *)ni;

sys/dev/ic/ar9003.c

1472

ridx[i] = an->ridx[txrate];

sys/dev/ic/ar9003.c

1473

txrate = an->fallback[txrate];

sys/dev/ic/ath.c

1618

struct ath_node *an;

sys/dev/ic/ath.c

1620

an = malloc(sizeof(*an), M_DEVBUF, M_NOWAIT | M_ZERO);

sys/dev/ic/ath.c

1621

if (an) {

sys/dev/ic/ath.c

1624

an->an_rx_hist[i].arh_ticks = ATH_RHIST_NOTIME;

sys/dev/ic/ath.c

1625

an->an_rx_hist_next = ATH_RHIST_SIZE-1;

sys/dev/ic/ath.c

1626

return &an->an_node;

sys/dev/ic/ath.c

1658

const struct ath_node *an = ATH_NODE(ni);

sys/dev/ic/ath.c

1667

i = an->an_rx_hist_next;

sys/dev/ic/ath.c

1669

const struct ath_recv_hist *rh = &an->an_rx_hist[i];

sys/dev/ic/ath.c

1681

} while (i != an->an_rx_hist_next);

sys/dev/ic/ath.c

1687

return (nsamples ? rssi / nsamples : an->an_rx_hist[i].arh_rssi);

sys/dev/ic/ath.c

1784

struct ath_node *an;

sys/dev/ic/ath.c

1943

an = ATH_NODE(ni);

sys/dev/ic/ath.c

1944

if (++(an->an_rx_hist_next) == ATH_RHIST_SIZE)

sys/dev/ic/ath.c

1945

an->an_rx_hist_next = 0;

sys/dev/ic/ath.c

1946

rh = &an->an_rx_hist[an->an_rx_hist_next];

sys/dev/ic/ath.c

1959

ieee80211_rssadapt_input(ic, ni, &an->an_rssadapt,

sys/dev/ic/ath.c

2005

struct ath_node *an;

sys/dev/ic/ath.c

2126

an = ATH_NODE(ni);

sys/dev/ic/ath.c

2165

ni->ni_txrate = ieee80211_rssadapt_choose(&an->an_rssadapt,

sys/dev/ic/ath.c

2263

if (an->an_tx_antenna) {

sys/dev/ic/ath.c

2264

antenna = an->an_tx_antenna;

sys/dev/ic/ath.c

2266

antenna = an->an_rx_hist[an->an_rx_hist_next].arh_antenna;

sys/dev/ic/ath.c

2367

struct ath_node *an;

sys/dev/ic/ath.c

2395

an = (struct ath_node *) ni;

sys/dev/ic/ath.c

2399

&an->an_rssadapt, &bf->bf_id);

sys/dev/ic/ath.c

2400

an->an_tx_antenna = ds->ds_txstat.ts_antenna;

sys/dev/ic/ath.c

2404

&an->an_rssadapt, &bf->bf_id);

sys/dev/ic/ath.c

2411

an->an_tx_antenna = 0; /* invalidate */

sys/dev/ic/ath.c

3032

struct ath_node *an = ATH_NODE(ni);

sys/dev/ic/ath.c

3034

ieee80211_rssadapt_updatestats(&an->an_rssadapt);

sys/dev/ic/athn.c

1244

struct athn_node *an = (struct athn_node *)ni;

sys/dev/ic/athn.c

1247

ieee80211_amrr_choose(&sc->amrr, ni, &an->amn);

sys/dev/ic/athn.c

2469

struct athn_node *an;

sys/dev/ic/athn.c

2471

an = malloc(sizeof(struct athn_node), M_DEVBUF, M_NOWAIT | M_ZERO);

sys/dev/ic/athn.c

2472

if (an && (ic->ic_flags & IEEE80211_F_HTON))

sys/dev/ic/athn.c

2473

ieee80211_ra_node_init(&an->rn);

sys/dev/ic/athn.c

2474

return (struct ieee80211_node *)an;

sys/dev/ic/athn.c

2481

struct athn_node *an = (void *)ni;

sys/dev/ic/athn.c

2487

ieee80211_amrr_node_init(&sc->amrr, &an->amn);

sys/dev/ic/athn.c

2489

ieee80211_ra_node_init(&an->rn);

sys/dev/ic/athn.c

2501

an->ridx[i] = ridx;

sys/dev/ic/athn.c

2505

an->fallback[i] = i;

sys/dev/ic/athn.c

2507

if (athn_rates[an->ridx[j]].phy ==

sys/dev/ic/athn.c

2508

athn_rates[an->ridx[i]].phy) {

sys/dev/ic/athn.c

2509

an->fallback[i] = j;

sys/dev/ic/athn.c

2513

DPRINTFN(2, ("%d fallbacks to %d\n", i, an->fallback[i]));

sys/dev/ic/athn.c

2522

an->ridx[ridx] = ATHN_RIDX_MCS0 + i;

sys/dev/ic/athn.c

2529

an->fallback[ridx] = ATHN_RIDX_OFDM6;

sys/dev/ic/athn.c

2531

an->fallback[ridx] = ATHN_RIDX_CCK1;

sys/dev/ic/athn.c

2534

an->fallback[ridx] = ATHN_NUM_LEGACY_RATES + i;

sys/dev/ic/athn.c

2538

an->fallback[ridx] = ATHN_NUM_LEGACY_RATES + j;

sys/dev/ic/athn.c

2542

DPRINTFN(2, (" fallback to %d\n", an->fallback[ridx]));

sys/dev/pci/drm/amd/display/modules/hdcp/hdcp.h

118

uint8_t an[8];

sys/dev/pci/drm/amd/display/modules/hdcp/hdcp_ddc.c

386

hdcp->auth.msg.hdcp1.an,

sys/dev/pci/drm/amd/display/modules/hdcp/hdcp_ddc.c

387

sizeof(hdcp->auth.msg.hdcp1.an));

sys/dev/pci/drm/amd/display/modules/hdcp/hdcp_log.c

64

HDCP_DDC_WRITE_TRACE(hdcp, "AN", hdcp->auth.msg.hdcp1.an,

sys/dev/pci/drm/amd/display/modules/hdcp/hdcp_log.c

65

sizeof(hdcp->auth.msg.hdcp1.an));

sys/dev/pci/drm/amd/display/modules/hdcp/hdcp_psp.c

284

memcpy(hdcp->auth.msg.hdcp1.an, hdcp_cmd->out_msg.hdcp1_create_session.an_primary,

sys/dev/pci/drm/amd/display/modules/hdcp/hdcp_psp.c

285

sizeof(hdcp->auth.msg.hdcp1.an));

sys/dev/pci/drm/i915/display/intel_dp_hdcp.c

59

u8 *an)

sys/dev/pci/drm/i915/display/intel_dp_hdcp.c

67

an, DRM_HDCP_AN_LEN);

sys/dev/pci/drm/i915/display/intel_hdcp.c

822

} an;

sys/dev/pci/drm/i915/display/intel_hdcp.c

866

an.reg[0] = intel_de_read(display,

sys/dev/pci/drm/i915/display/intel_hdcp.c

868

an.reg[1] = intel_de_read(display,

sys/dev/pci/drm/i915/display/intel_hdcp.c

870

ret = shim->write_an_aksv(dig_port, an.shim);

sys/dev/pci/drm/i915/display/intel_hdcp_shim.h

51

int (*write_an_aksv)(struct intel_digital_port *dig_port, u8 *an);

sys/dev/pci/drm/i915/display/intel_hdmi.c

1359

u8 *an)

sys/dev/pci/drm/i915/display/intel_hdmi.c

1366

ret = intel_hdmi_hdcp_write(dig_port, DRM_HDCP_DDC_AN, an,

sys/dev/usb/if_athn_usb.c

1157

struct athn_node *an = (struct athn_node *)ni;

sys/dev/usb/if_athn_usb.c

1165

if (an->sta_index != 0)

sys/dev/usb/if_athn_usb.c

1175

struct athn_node *an;

sys/dev/usb/if_athn_usb.c

1177

an = malloc(sizeof(struct athn_node), M_USBDEV, M_NOWAIT | M_ZERO);

sys/dev/usb/if_athn_usb.c

1178

return (struct ieee80211_node *)an;

sys/dev/usb/if_athn_usb.c

1187

struct athn_node *an = (struct athn_node *)ni;

sys/dev/usb/if_athn_usb.c

1189

if (an->sta_index == 0)

sys/dev/usb/if_athn_usb.c

1210

struct athn_node *an = (struct athn_node *)ni;

sys/dev/usb/if_athn_usb.c

1217

if (an->sta_index == 0) {

sys/dev/usb/if_athn_usb.c

1238

struct athn_node *an = (struct athn_node *)ni;

sys/dev/usb/if_athn_usb.c

1245

if (!isnew && an->sta_index != 0) /* already in firmware table */

sys/dev/usb/if_athn_usb.c

1277

struct athn_node *an = (struct athn_node *)ni;

sys/dev/usb/if_athn_usb.c

1283

if (an->sta_index != 0)

sys/dev/usb/if_athn_usb.c

1285

&an->sta_index, sizeof(an->sta_index));

sys/dev/usb/if_athn_usb.c

1316

struct athn_node *an = (struct athn_node *)ni;

sys/dev/usb/if_athn_usb.c

1320

cmd.sta_index = an->sta_index;

sys/dev/usb/if_athn_usb.c

1345

struct athn_node *an = (struct athn_node *)ni;

sys/dev/usb/if_athn_usb.c

1349

cmd.sta_index = an->sta_index;

sys/dev/usb/if_athn_usb.c

1375

struct athn_node *an = (struct athn_node *)ni;

sys/dev/usb/if_athn_usb.c

1381

if (an->sta_index == 0)

sys/dev/usb/if_athn_usb.c

1406

struct athn_node *an = (struct athn_node *)ni;

sys/dev/usb/if_athn_usb.c

1436

an->sta_index = sta_index;

sys/dev/usb/if_athn_usb.c

1437

usc->free_node_slots &= ~(1 << an->sta_index);

sys/dev/usb/if_athn_usb.c

1451

struct athn_node *an = (struct athn_node *)ni;

sys/dev/usb/if_athn_usb.c

1457

rate.sta_index = an->sta_index;

sys/dev/usb/if_athn_usb.c

1493

struct athn_node *an = (struct athn_node *)ni;

sys/dev/usb/if_athn_usb.c

1501

&an->sta_index, sizeof(an->sta_index), NULL);

sys/dev/usb/if_athn_usb.c

1504

"firmware table\n", usc->usb_dev.dv_xname, an->sta_index,

sys/dev/usb/if_athn_usb.c

1512

usc->usb_dev.dv_xname, an->sta_index,

sys/dev/usb/if_athn_usb.c

1516

usc->free_node_slots |= (1 << an->sta_index);

sys/dev/usb/if_athn_usb.c

1517

an->sta_index = 0;

sys/dev/usb/if_athn_usb.c

1797

struct athn_node *an = (struct athn_node *)ni;

sys/dev/usb/if_athn_usb.c

1800

if (an->sta_index != ts->cookie) /* Tx report for a different node */

sys/dev/usb/if_athn_usb.c

1845

struct athn_node *an = (struct athn_node *)ic->ic_bss;

sys/dev/usb/if_athn_usb.c

1862

if (ts->cookie == an->sta_index)

sys/dev/usb/if_athn_usb.c

2277

struct athn_node *an = (struct athn_node *)ni;

sys/dev/usb/if_athn_usb.c

2348

txf->node_idx = an->sta_index;

sys/dev/usb/if_athn_usb.c

2374

txf->cookie = an->sta_index;

sys/dev/usb/if_athn_usb.c

2381

txm->node_idx = an->sta_index;

sys/dev/usb/if_athn_usb.c

2384

txm->cookie = an->sta_index;

sys/net/art.c

1063

struct art_node *an;

sys/net/art.c

1065

an = pool_get(&an_pool, PR_NOWAIT | PR_ZERO);

sys/net/art.c

1066

if (an == NULL)

sys/net/art.c

1069

art_node_init(an, addr, plen);

sys/net/art.c

1071

return (an);

sys/net/art.c

1075

art_node_init(struct art_node *an, const uint8_t *addr, unsigned int plen)

sys/net/art.c

1080

KASSERT(len <= sizeof(an->an_addr));

sys/net/art.c

1081

memcpy(an->an_addr, addr, len);

sys/net/art.c

1082

an->an_plen = plen;

sys/net/art.c

1086

art_put(struct art_node *an)

sys/net/art.c

1089

an->an_gc = art_node_gc_list;

sys/net/art.c

1090

art_node_gc_list = an;

sys/net/art.c

1099

struct art_node *an;

sys/net/art.c

1102

an = art_node_gc_list;

sys/net/art.c

1108

while (an != NULL) {

sys/net/art.c

1109

struct art_node *next = an->an_gc;

sys/net/art.c

1111

pool_put(&an_pool, an);

sys/net/art.c

1113

an = next;

sys/net/art.c

274

struct art_node *an;

sys/net/art.c

313

an = art_heap_entry_to_node(ahe);

sys/net/art.c

314

if (an != NULL)

sys/net/art.c

315

return (an);

sys/net/art.c

321

art_node_check(const struct art_node *an,

sys/net/art.c

324

const uint32_t *wan = (const uint32_t *)an->an_addr;

sys/net/art.c

329

if (an->an_plen != plen)

sys/net/art.c

344

if (an->an_addr[i] != addr[i])

sys/net/art.c

355

return ((an->an_addr[i] >> shift) == (addr[i] >> shift));

sys/net/art.c

372

struct art_node *an;

sys/net/art.c

423

an = art_heap_entry_to_node(ahe);

sys/net/art.c

424

if (an != NULL && art_node_check(an, addr, plen))

sys/net/art.c

425

return (an);

sys/net/art.c

443

art_insert(struct art *art, struct art_node *an)

sys/net/art.c

452

KASSERT(an->an_plen <= art->art_alen);

sys/net/art.c

466

if (an->an_plen == 0) {

sys/net/art.c

474

SMR_PTR_SET_LOCKED(ahep, art_node_to_heap_entry(an));

sys/net/art.c

475

return (an);

sys/net/art.c

483

while ((p = at->at_offset + at->at_bits) < an->an_plen) {

sys/net/art.c

485

j = art_bindex(at->at_offset, at->at_bits, an->an_addr, p);

sys/net/art.c

512

i = art_bindex(at->at_offset, at->at_bits, an->an_addr, an->an_plen);

sys/net/art.c

523

if (oan != NULL && art_node_check(oan, an->an_addr, an->an_plen))

sys/net/art.c

532

ahe = art_node_to_heap_entry(an);

sys/net/art.c

538

return (an);

sys/net/art.c

551

struct art_node *an;

sys/net/art.c

567

an = art_heap_entry_to_node(ahe);

sys/net/art.c

568

if (an == NULL)

sys/net/art.c

574

return (an);

sys/net/art.c

604

an = art_heap_entry_to_node(ahe);

sys/net/art.c

605

if (an == NULL) {

sys/net/art.c

627

return (an);

sys/net/art.c

707

struct art_node *an;

sys/net/art.c

717

an = art_iter_descend(ai, heap, 0);

sys/net/art.c

718

if (an != NULL)

sys/net/art.c

719

return (an); /* default route */

sys/net/art.c

783

struct art_node *an;

sys/net/art.c

787

an = art_iter_descend(ai, heap, pahe);

sys/net/art.c

788

if (an != NULL) /* default route? */

sys/net/art.c

789

return (an);

sys/net/art.c

835

struct art_node *an;

sys/net/art.c

838

ART_FOREACH(an, art, &ai) {

sys/net/art.c

839

error = f(an, arg);

sys/net/art.h

122

art_node_to_heap_entry(struct art_node *an)

sys/net/art.h

124

return ((art_heap_entry)an);

sys/net/pf.c

2775

const struct pf_addr *an, sa_family_t af, u_int8_t proto)

sys/net/pf.c

2778

const u_int16_t *n = an->addr16;

sys/net/pf.c

3131

pf_translate_a(struct pf_pdesc *pd, struct pf_addr *a, struct pf_addr *an)

sys/net/pf.c

3136

if (!PF_ANEQ(a, an, pd->af))

sys/net/pf.c

3144

pf_cksum_fixup_a(pd->pcksum, a, an, pd->af, pd->proto);

sys/net/pf.c

3150

pf_addrcpy(a, an, pd->af);

sys/net/rtable.c

435

struct art_node *an;

sys/net/rtable.c

449

an = art_match(tbl->r_art, addr);

sys/net/rtable.c

455

an = art_lookup(tbl->r_art, addr, plen);

sys/net/rtable.c

457

if (an == NULL)

sys/net/rtable.c

460

for (rt = SMR_PTR_GET(&an->an_value); rt != NULL;

sys/net/rtable.c

486

struct art_node *an;

sys/net/rtable.c

499

an = art_match(tbl->r_art, addr);

sys/net/rtable.c

500

if (an == NULL)

sys/net/rtable.c

503

rt = SMR_PTR_GET(&an->an_value);

sys/net/rtable.c

553

struct art_node *an, *prev;

sys/net/rtable.c

568

an = art_get(addr, plen);

sys/net/rtable.c

569

if (an == NULL)

sys/net/rtable.c

580

an->an_value = rt;

sys/net/rtable.c

583

prev = art_insert(tbl->r_art, an);

sys/net/rtable.c

589

if (prev != an) {

sys/net/rtable.c

598

art_put(an);

sys/net/rtable.c

599

an = prev;

sys/net/rtable.c

602

for (mrt = SMR_PTR_GET_LOCKED(&an->an_value);

sys/net/rtable.c

623

for (mrt = SMR_PTR_GET_LOCKED(&an->an_value);

sys/net/rtable.c

635

rtable_mpath_insert(an, rt);

sys/net/rtable.c

641

art_put(an);

sys/net/rtable.c

653

struct art_node *an;

sys/net/rtable.c

669

an = art_lookup(tbl->r_art, addr, plen);

sys/net/rtable.c

671

if (an == NULL) {

sys/net/rtable.c

677

if (SMR_PTR_GET_LOCKED(&an->an_value) == rt &&

sys/net/rtable.c

681

if (oan != an)

sys/net/rtable.c

683

art_put(an);

sys/net/rtable.c

700

prt = (struct rtentry **)&an->an_value;

sys/net/rtable.c

731

struct art_node *an;

sys/net/rtable.c

739

ART_FOREACH(an, tbl->r_art, &ai) {

sys/net/rtable.c

746

struct rtentry *rt = SMR_PTR_GET_LOCKED(&an->an_value);

sys/net/rtable.c

792

struct art_node *an;

sys/net/rtable.c

800

ART_FOREACH(an, tbl->r_art, &ai) {

sys/net/rtable.c

802

for (rt = SMR_PTR_GET_LOCKED(&an->an_value); rt != NULL;

sys/net/rtable.c

842

struct art_node *an;

sys/net/rtable.c

854

an = art_lookup(tbl->r_art, addr, plen);

sys/net/rtable.c

856

if (an == NULL) {

sys/net/rtable.c

858

} else if (SMR_PTR_GET_LOCKED(&an->an_value) == rt &&

sys/net/rtable.c

871

prt = (struct rtentry **)&an->an_value;

sys/net/rtable.c

881

rtable_mpath_insert(an, rt);

sys/net/rtable.c

890

rtable_mpath_insert(struct art_node *an, struct rtentry *rt)

sys/net/rtable.c

897

prt = (struct rtentry **)&an->an_value;

usr.bin/netstat/route.c

259

p_artnode(struct art_node *an)

usr.bin/netstat/route.c

264

kread((u_long)an, &node, sizeof(node));

usr.bin/spell/spellprog.c

161

{"naino", an, 3, "", "+ian"},

usr.bin/spell/spellprog.c

162

{"na", an, 1, "", "+n"},

usr.bin/spell/spellprog.c

83

int an(char *, char *, char *, int);

usr.bin/systat/pftop.c

739

struct pf_addr *an = &kn->addr[idx];

usr.bin/systat/pftop.c

765

if (asf != anf || PF_ANEQ(as, an, asf) || ps != pn) {

usr.bin/systat/pftop.c

767

tb_print_addr(an, NULL, anf);

usr.sbin/authpf/authpf.c

687

recursive_ruleset_purge(char *an, char *rs)

usr.sbin/authpf/authpf.c

703

snprintf(t_e[0].anchor, sizeof(t_e[0].anchor), "%s/%s", an, rs);

usr.sbin/authpf/authpf.c

714

snprintf(prs->path, sizeof(prs->path), "%s/%s", an, rs);

usr.sbin/ftp-proxy/filter.c

165

char an[PF_ANCHOR_NAME_SIZE];

usr.sbin/ftp-proxy/filter.c

172

snprintf(an, PF_ANCHOR_NAME_SIZE, "%s/%d.%d", FTP_PROXY_ANCHOR,

usr.sbin/ftp-proxy/filter.c

175

strlcpy(pfte.anchor, an, PF_ANCHOR_NAME_SIZE);

usr.sbin/ftp-proxy/filter.c

188

char an[PF_ANCHOR_NAME_SIZE];

usr.sbin/ftp-proxy/filter.c

197

snprintf(an, PF_ANCHOR_NAME_SIZE, "%s/%d.%d", FTP_PROXY_ANCHOR,

usr.sbin/ftp-proxy/filter.c

199

strlcpy(pfr.anchor, an, PF_ANCHOR_NAME_SIZE);

usr.sbin/ldapd/attributes.c

53

struct name *an;

usr.sbin/ldapd/attributes.c

55

SLIST_FOREACH(an, at->names, next) {

usr.sbin/ldapd/attributes.c

56

if ((elm = ldap_get_attribute(entry, an->name)) != NULL)

usr.sbin/ldapd/attributes.c

59

if (an == NULL)

usr.sbin/ospfd/rde.c

1196

struct asext_node *an, *oan;

usr.sbin/ospfd/rde.c

1208

an = asext_find(kr->prefix.s_addr, kr->prefixlen);

usr.sbin/ospfd/rde.c

1209

if (an == NULL) {

usr.sbin/ospfd/rde.c

1210

if ((an = calloc(1, sizeof(*an))) == NULL)

usr.sbin/ospfd/rde.c

1212

bcopy(kr, &an->r, sizeof(*kr));

usr.sbin/ospfd/rde.c

1213

an->ls_id = kr->prefix.s_addr;

usr.sbin/ospfd/rde.c

1214

RB_INSERT(asext_tree, &ast, an);

usr.sbin/ospfd/rde.c

1217

bcopy(kr, &an->r, sizeof(*kr));

usr.sbin/ospfd/rde.c

1228

oan = an;

usr.sbin/ospfd/rde.c

1252

RB_REMOVE(asext_tree, &ast, an);

usr.sbin/ospfd/rde.c

1253

free(an);

usr.sbin/ospfd/rde.c

1262

v = lsa_find(NULL, LSA_TYPE_EXTERNAL, an->ls_id,

usr.sbin/ospfd/rde.c

1264

lsa = orig_asext_lsa(kr, an->ls_id, DEFAULT_AGE);

usr.sbin/ospfd/rde.c

1267

if (oan != an) {

usr.sbin/ospfd/rde.c

1278

struct asext_node *an;

usr.sbin/ospfd/rde.c

1286

an = asext_find(kr->prefix.s_addr, kr->prefixlen);

usr.sbin/ospfd/rde.c

1287

if (an == NULL) {

usr.sbin/ospfd/rde.c

1297

v = lsa_find(NULL, LSA_TYPE_EXTERNAL, an->ls_id,

usr.sbin/ospfd/rde.c

1305

lsa = orig_asext_lsa(kr, an->ls_id, MAX_AGE);

usr.sbin/ospfd/rde.c

1308

RB_REMOVE(asext_tree, &ast, an);

usr.sbin/ospfd/rde.c

1309

free(an);

usr.sbin/ospfd/rde.c

1315

struct asext_node *an, *nan;

usr.sbin/ospfd/rde.c

1317

for (an = RB_MIN(asext_tree, &ast); an != NULL; an = nan) {

usr.sbin/ospfd/rde.c

1318

nan = RB_NEXT(asext_tree, &ast, an);

usr.sbin/ospfd/rde.c

1319

RB_REMOVE(asext_tree, &ast, an);

usr.sbin/ospfd/rde.c

1320

free(an);

usr.sbin/unbound/daemon/cachedump.c

756

unsigned int flags, qdcount, security, an, ns, ar;

usr.sbin/unbound/daemon/cachedump.c

779

&security, &an, &ns, &ar, &ede, &consumed) != 8) {

usr.sbin/unbound/daemon/cachedump.c

793

if(an > RR_COUNT_MAX || ns > RR_COUNT_MAX || ar > RR_COUNT_MAX) {

usr.sbin/unbound/daemon/cachedump.c

797

rep.an_numrrsets = (size_t)an;

usr.sbin/unbound/daemon/cachedump.c

800

rep.rrset_count = (size_t)an+(size_t)ns+(size_t)ar;

usr.sbin/unbound/testcode/pktview.c

156

uint16_t i, f, qd, an, ns, ar;

usr.sbin/unbound/testcode/pktview.c

167

an = sldns_buffer_read_u16(pkt);

usr.sbin/unbound/testcode/pktview.c

168

printf("ancount: %d\n", (int)an);

usr.sbin/unbound/testcode/pktview.c

178

if(rrnum == (int)qd+(int)an)

usr.sbin/unbound/testcode/pktview.c

180

if(rrnum == (int)qd+(int)an+(int)ns)

usr.sbin/unbound/util/data/msgreply.c

100

time_t ttl, time_t prettl, time_t expttl, time_t norecttl, size_t an,

usr.sbin/unbound/util/data/msgreply.c

121

rep->an_numrrsets = an;

usr.sbin/unbound/util/data/msgreply.h

271

time_t ttl, time_t prettl, time_t expttl, time_t norecttl, size_t an,