Searched refs:an (Results 1 - 25 of 29) sorted by relevance

12

/haiku/src/add-ons/kernel/drivers/network/wlan/atheroswifi/dev/ath/ath_rate/onoe/
H A Donoe.h66 #define ATH_NODE_ONOE(an) ((struct onoe_node *)&an[1])
H A Donoe.c103 ath_rate_node_init(struct ath_softc *sc, struct ath_node *an) argument
109 ath_rate_node_cleanup(struct ath_softc *sc, struct ath_node *an) argument
114 ath_rate_findrate(struct ath_softc *sc, struct ath_node *an, argument
119 struct onoe_node *on = ATH_NODE_ONOE(an);
138 ath_rate_getxtxrates(struct ath_softc *sc, struct ath_node *an, argument
141 struct onoe_node *on = ATH_NODE_ONOE(an);
157 ath_rate_setupxtxdesc(struct ath_softc *sc, struct ath_node *an, argument
160 struct onoe_node *on = ATH_NODE_ONOE(an);
170 ath_rate_tx_complete(struct ath_softc *sc, struct ath_node *an, argument
174 struct onoe_node *on = ATH_NODE_ONOE(an);
189 ath_rate_newassoc(struct ath_softc *sc, struct ath_node *an, int isnew) argument
196 ath_rate_update_rx_rssi(struct ath_softc *sc, struct ath_node *an, int rssi) argument
203 struct ath_node *an = ATH_NODE(ni); local
421 ath_rate_fetch_node_stats(struct ath_softc *sc, struct ath_node *an, struct ath_rateioctl *re) argument
[all...]
/haiku/src/add-ons/kernel/drivers/network/wlan/aironetwifi/
H A Dglue.c19 #include <dev/an/if_aironet_ieee.h>
20 #include <dev/an/if_anreg.h>
28 HAIKU_FBSD_WLAN_DRIVER_GLUE(aironetwifi, an, pci)
/haiku/src/add-ons/kernel/drivers/network/wlan/atheroswifi/dev/ath/ath_rate/amrr/
H A Damrr.h80 #define ATH_NODE_AMRR(an) ((struct amrr_node *)&an[1])
H A Damrr.c95 ath_rate_node_init(struct ath_softc *sc, struct ath_node *an) argument
101 ath_rate_node_cleanup(struct ath_softc *sc, struct ath_node *an) argument
106 ath_rate_findrate(struct ath_softc *sc, struct ath_node *an, argument
111 struct amrr_node *amn = ATH_NODE_AMRR(an);
130 ath_rate_getxtxrates(struct ath_softc *sc, struct ath_node *an, argument
133 struct amrr_node *amn = ATH_NODE_AMRR(an);
149 ath_rate_setupxtxdesc(struct ath_softc *sc, struct ath_node *an, argument
152 struct amrr_node *amn = ATH_NODE_AMRR(an);
162 ath_rate_tx_complete(struct ath_softc *sc, struct ath_node *an, argument
166 struct amrr_node *amn = ATH_NODE_AMRR(an);
195 ath_rate_newassoc(struct ath_softc *sc, struct ath_node *an, int isnew) argument
202 ath_rate_update_rx_rssi(struct ath_softc *sc, struct ath_node *an, int rssi) argument
228 struct ath_node *an = ATH_NODE(ni); local
432 ath_rate_fetch_node_stats(struct ath_softc *sc, struct ath_node *an, struct ath_rateioctl *re) argument
[all...]
/haiku/src/add-ons/kernel/drivers/network/wlan/atheroswifi/dev/ath/
H A Dif_ath_tx.h89 extern void ath_tx_node_flush(struct ath_softc *sc, struct ath_node *an);
103 extern void ath_tx_tid_init(struct ath_softc *sc, struct ath_node *an);
104 extern void ath_tx_tid_hw_queue_aggr(struct ath_softc *sc, struct ath_node *an,
106 extern void ath_tx_tid_hw_queue_norm(struct ath_softc *sc, struct ath_node *an,
113 extern void ath_tx_addto_baw(struct ath_softc *sc, struct ath_node *an,
115 extern struct ieee80211_tx_ampdu * ath_tx_get_tx_tid(struct ath_node *an,
136 extern void ath_tx_node_sleep(struct ath_softc *sc, struct ath_node *an);
137 extern void ath_tx_node_wakeup(struct ath_softc *sc, struct ath_node *an);
138 extern int ath_tx_node_is_asleep(struct ath_softc *sc, struct ath_node *an);
139 extern void ath_tx_node_reassoc(struct ath_softc *sc, struct ath_node *an);
[all...]
H A Dif_ath_tx_ht.h62 ath_tx_form_aggr(struct ath_softc *sc, struct ath_node *an,
H A Dif_ath_tx.c123 static int ath_tx_node_is_asleep(struct ath_softc *sc, struct ath_node *an);
125 static int ath_tx_ampdu_pending(struct ath_softc *sc, struct ath_node *an,
127 static int ath_tx_ampdu_running(struct ath_softc *sc, struct ath_node *an,
134 ath_tx_retry_clone(struct ath_softc *sc, struct ath_node *an,
454 * If 11n is enabled, set it up as if it's an aggregate
466 * descriptor in the first frame in an
546 * Setup segments+descriptors for an 11n aggregate.
664 * info. But if the last frame in an aggregate has one
674 * is called on the final descriptor in an MPDU or A-MPDU -
995 * Construct the 802.11 header+trailer for an encrypte
1421 struct ath_node *an = ATH_NODE(bf->bf_node); local
1444 ath_tx_should_swq_frame(struct ath_softc *sc, struct ath_node *an, struct mbuf *m0, int *queue_to_head) argument
1508 struct ath_node *an = ATH_NODE(bf->bf_node); local
1569 struct ath_node *an; local
2158 struct ath_node *an = ATH_NODE(ni); local
2657 ath_tx_addto_baw(struct ath_softc *sc, struct ath_node *an, struct ath_tid *tid, struct ath_buf *bf) argument
2748 ath_tx_switch_baw_buf(struct ath_softc *sc, struct ath_node *an, struct ath_tid *tid, struct ath_buf *old_bf, struct ath_buf *new_bf) argument
2795 ath_tx_update_baw(struct ath_softc *sc, struct ath_node *an, struct ath_tid *tid, const struct ath_buf *bf) argument
3048 ath_tx_xmit_aggr(struct ath_softc *sc, struct ath_node *an, struct ath_txq *txq, struct ath_buf *bf) argument
3140 struct ath_node *an = ATH_NODE(ni); local
3296 ath_tx_set_clrdmask(struct ath_softc *sc, struct ath_node *an) argument
3318 ath_tx_tid_init(struct ath_softc *sc, struct ath_node *an) argument
3808 ath_tx_tid_drain_pkt(struct ath_softc *sc, struct ath_node *an, struct ath_tid *tid, ath_bufhead *bf_cq, struct ath_buf *bf) argument
3848 ath_tx_tid_drain_print(struct ath_softc *sc, struct ath_node *an, const char *pfx, struct ath_tid *tid, struct ath_buf *bf) argument
3930 ath_tx_tid_drain(struct ath_softc *sc, struct ath_node *an, struct ath_tid *tid, ath_bufhead *bf_cq) argument
4089 ath_tx_node_flush(struct ath_softc *sc, struct ath_node *an) argument
4191 struct ath_node *an = ATH_NODE(ni); local
4278 struct ath_node *an = ATH_NODE(ni); local
4315 ath_tx_tid_cleanup_frame(struct ath_softc *sc, struct ath_node *an, int tid, struct ath_buf *bf_head, ath_bufhead *bf_cq) argument
4380 ath_tx_tid_cleanup(struct ath_softc *sc, struct ath_node *an, int tid, ath_bufhead *bf_cq) argument
4451 ath_tx_retry_clone(struct ath_softc *sc, struct ath_node *an, struct ath_tid *tid, struct ath_buf *bf) argument
4520 struct ath_node *an = ATH_NODE(ni); local
4611 struct ath_node *an = ATH_NODE(ni); local
4677 struct ath_node *an = ATH_NODE(ni); local
4763 struct ath_node *an = ATH_NODE(ni); local
4827 struct ath_node *an = ATH_NODE(ni); local
5168 struct ath_node *an = ATH_NODE(ni); local
5371 ath_tx_tid_swq_depth_bytes(struct ath_softc *sc, struct ath_node *an, struct ath_tid *tid) argument
5427 ath_tx_tid_hw_queue_aggr(struct ath_softc *sc, struct ath_node *an, struct ath_tid *tid) argument
5658 ath_tx_tid_hw_queue_norm(struct ath_softc *sc, struct ath_node *an, struct ath_tid *tid) argument
5857 ath_tx_get_tx_tid(struct ath_node *an, int tid) argument
5873 ath_tx_ampdu_running(struct ath_softc *sc, struct ath_node *an, int tid) argument
5891 ath_tx_ampdu_pending(struct ath_softc *sc, struct ath_node *an, int tid) argument
5923 struct ath_node *an = ATH_NODE(ni); local
6001 struct ath_node *an = ATH_NODE(ni); local
6047 struct ath_node *an = ATH_NODE(ni); local
6121 ath_tx_node_reassoc(struct ath_softc *sc, struct ath_node *an) argument
6182 struct ath_node *an = ATH_NODE(ni); local
6255 struct ath_node *an = ATH_NODE(ni); local
6282 ath_tx_node_is_asleep(struct ath_softc *sc, struct ath_node *an) argument
6309 ath_tx_node_sleep(struct ath_softc *sc, struct ath_node *an) argument
6346 ath_tx_node_wakeup(struct ath_softc *sc, struct ath_node *an) argument
[all...]
H A Dif_athrate.h65 * number is != ATH_TXMAXTRY then an additional callback is made to setup
115 * (when operating as an ap or for nodes discovered when operating
127 void ath_rate_getxtxrates(struct ath_softc *sc, struct ath_node *an,
136 * maxdur is an optional return value (or -1 if not set) that defines
179 int ath_rate_fetch_node_stats(struct ath_softc *sc, struct ath_node *an,
H A Dif_ath_ioctl.c130 struct ath_node *an; local
143 an = ATH_NODE(ni);
144 ATH_NODE_LOCK(an);
147 error = ath_rate_fetch_node_stats(sc, an, rs);
152 ATH_NODE_UNLOCK(an);
H A Dif_ath.c1460 * address and use the next six bits as an index.
1586 * vap to an existing configuration is of dubious
1825 * here (after the ath_tx_swq() call; and after an ath_stop()
2239 * Disable RXEOL/RXORN - prevent an interrupt
2267 * Enqueue an RX proc to handle whatever
2669 * If we're an EDMA NIC, we don't care about RXEOL.
2876 * of whether we succeeded to get it in an exclusive
3010 * We may be doing a reset in response to an ioctl
3026 * If an interrupt was being processed in ath_intr(),
3325 * XXX it would be nicer if we kept an mbu
3868 struct ath_node *an; local
4309 struct ath_node *an; local
6252 struct ath_node *an = ATH_NODE(ni); local
6664 struct ath_node *an = ATH_NODE(ni); local
6734 struct ath_node *an = ATH_NODE(ni); local
6866 struct ath_node *an; local
6935 struct ath_node *an; local
[all...]
H A Dif_ath_tx_ht.c632 * If this is the first frame in an aggregate series,
788 * Form an aggregate packet list.
796 * + Maximum number of sub-frames for an aggregate
816 * So if you want to call this from an upper layer context (eg, to direct-
820 ath_tx_form_aggr(struct ath_softc *sc, struct ath_node *an, argument
823 //struct ieee80211_node *ni = &an->an_node;
834 tap = ath_tx_get_tx_tid(an, tid->tid);
864 aggr_limit = ath_get_aggr_limit(sc, &an->an_node,
928 * If the current frame has an RTS/CTS configuration
951 * this packet is part of an aggregat
[all...]
H A Dif_athvar.h129 struct ath_node *an; /* pointer to parent */ member in struct:ath_tid
286 /* Make this an 8 bit value? */
306 /* Make this an 8 bit value? */
444 (_tq)->an->an_swq_depth++; \
449 (_tq)->an->an_swq_depth++; \
454 (_tq)->an->an_swq_depth--; \
465 (_tq)->an->an_swq_depth++; \
470 (_tq)->an->an_swq_depth++; \
475 (_tq)->an->an_swq_depth--; \
869 void *sc_dfs; /* Used by an optiona
[all...]
/haiku/src/add-ons/kernel/drivers/network/wlan/aironetwifi/dev/an/
H A Dif_an_isa.c43 __FBSDID("$FreeBSD: releng/12.0/sys/dev/an/if_an_isa.c 327102 2017-12-23 06:49:27Z imp $");
74 #include <dev/an/if_aironet_ieee.h>
75 #include <dev/an/if_anreg.h>
143 "an",
150 DRIVER_MODULE(an, isa, an_isa_driver, an_isa_devclass, 0, 0);
151 MODULE_DEPEND(an, isa, 1, 1, 1);
152 MODULE_DEPEND(an, wlan, 1, 1, 1);
H A Dif_an_pccard.c43 __FBSDID("$FreeBSD: releng/12.0/sys/dev/an/if_an_pccard.c 325966 2017-11-18 14:26:50Z pfg $");
71 #include <dev/an/if_aironet_ieee.h>
72 #include <dev/an/if_anreg.h>
96 "an",
103 DRIVER_MODULE(an, pccard, an_pccard_driver, an_pccard_devclass, 0, 0);
104 MODULE_DEPEND(an, wlan, 1, 1, 1);
H A Dif_an_pci.c36 __FBSDID("$FreeBSD: releng/12.0/sys/dev/an/if_an_pci.c 338948 2018-09-26 17:12:14Z imp $");
45 * All we do here is handle the PCI probe and attach and set up an
88 #include <dev/an/if_aironet_ieee.h>
89 #include <dev/an/if_anreg.h>
268 "an",
275 DRIVER_MODULE(an, pci, an_pci_driver, an_devclass, 0, 0);
276 MODULE_PNP_INFO("U16:vendor;U16:device;D:#", pci, an,
278 MODULE_DEPEND(an, pci, 1, 1, 1);
279 MODULE_DEPEND(an, wlan, 1, 1, 1);
/haiku/src/add-ons/kernel/drivers/network/wlan/atheroswifi/dev/ath/ath_rate/sample/
H A Dsample.c87 * This file is an implementation of the SampleRate algorithm
176 struct ath_node *an, uint8_t rix0, int is_aggr)
180 struct sample_node *sn = ATH_NODE_SAMPLE(an);
184 int is_ht40 = (an->an_node.ni_chw == 40);
284 ath_rate_node_init(struct ath_softc *sc, struct ath_node *an) argument
290 ath_rate_node_cleanup(struct ath_softc *sc, struct ath_node *an) argument
316 pick_best_rate(struct ath_node *an, const HAL_RATE_TABLE *rt, argument
319 struct sample_node *sn = ATH_NODE_SAMPLE(an);
332 if ((an->an_node.ni_flags & IEEE80211_NODE_HT) &&
361 if (an
175 ath_rate_sample_find_min_pktlength(struct ath_softc *sc, struct ath_node *an, uint8_t rix0, int is_aggr) argument
416 pick_sample_rate(struct sample_softc *ssc , struct ath_node *an, const HAL_RATE_TABLE *rt, int size_bin) argument
551 struct ath_node *an = ATH_NODE(ni); local
573 ath_rate_pick_seed_rate_legacy(struct ath_softc *sc, struct ath_node *an, int frameLen) argument
614 ath_rate_pick_seed_rate_ht(struct ath_softc *sc, struct ath_node *an, int frameLen) argument
661 ath_rate_findrate(struct ath_softc *sc, struct ath_node *an, int shortPreamble, size_t frameLen, int tid, int is_aggr, u_int8_t *rix0, int *try0, u_int8_t *txrate, int *maxdur, int *maxpktlen) argument
899 ath_rate_getxtxrates(struct ath_softc *sc, struct ath_node *an, uint8_t rix0, int is_aggr, struct ath_rc_series *rc) argument
927 ath_rate_setupxtxdesc(struct ath_softc *sc, struct ath_node *an, struct ath_desc *ds, int shortPreamble, u_int8_t rix) argument
964 update_stats(struct ath_softc *sc, struct ath_node *an, int frame_size, int rix0, int tries0, int short_tries, int tries, int status, int nframes, int nbad) argument
1093 ath_rate_tx_complete(struct ath_softc *sc, struct ath_node *an, const struct ath_rc_series *rc, const struct ath_tx_status *ts, int frame_size, int rc_framesize, int nframes, int nbad) argument
1266 ath_rate_newassoc(struct ath_softc *sc, struct ath_node *an, int isnew) argument
1273 ath_rate_update_rx_rssi(struct ath_softc *sc, struct ath_node *an, int rssi) argument
1301 struct ath_node *an = ATH_NODE(ni); local
1431 ath_rate_fetch_node_stats(struct ath_softc *sc, struct ath_node *an, struct ath_rateioctl *rs) argument
[all...]
H A Dsample.h116 #define ATH_NODE_SAMPLE(an) ((struct sample_node *)&(an)[1])
/haiku/src/system/libroot/posix/stdlib/
H A Dradixsort.c135 const u_char **an, *t, **aj, **top[256]; local
146 an = a + n;
151 for (ak = a; ak < an;) {
189 top[255] = an;
218 for (aj = a; aj < an; *aj = r, aj += count[c], count[c] = 0)
/haiku/src/kits/interface/layouter/
H A DLayoutOptimizer.cpp32 (non-)solution this class finds an optimal solution. The optimization
36 It does so by implementing an active set method algorithm. The basic idea
591 If \a equality is \c true, the constraint is an equality constraint.
758 const int an = fVariableCount; local
760 zero_matrix(fActiveMatrix, am, an);
773 independentRows, am, an);
792 // Which is an system we can solve:
797 bool independentColumns[an];
799 transpose_matrix(fActiveMatrix, aa, am, an);
801 independentColumns, an, a
905 const int an = fVariableCount; local
[all...]
/haiku/src/libs/linprog/
H A DLayoutOptimizer.cpp46 (non-)solution this class finds an optimal solution. The optimization
50 It does so by implementing an active set method algorithm. The basic idea
725 const int an = fVariableCount; local
727 zero_matrix(fActiveMatrix, am, an);
747 independentRows, am, an);
766 // Which is an system we can solve:
771 bool independentColumns[an];
773 transpose_matrix(fActiveMatrix, aa, am, an);
775 independentColumns, an, am);
787 for (int i = 0; i < an;
877 const int an = fVariableCount; local
[all...]
/haiku/src/bin/
H A Dleak_analyser.sh20 there is an implementation defined maximum.
/haiku/docs/develop/kits/storage/resources/
H A DResourcesFormat.tex127 In an ELF file, resources are appended to rather than contained in the
128 regular data of the file. That is adding resources to an existing ELF file
171 resource files big endian data. The endianess of an ELF file is encoded in
409 \code{index} the index of an unused field in \code{resources}, then it holds:
421 Such an entry (resource info) specifies the ID and name of a
426 Nonterminals start with an upper case, terminals with a lower case letter.
574 \item{The resource info table may contain multiple entries for an index.
576 \item{The resource info table may not contain an entry for an index.
/haiku/3rdparty/korli/
H A Dgenerate_ids_from_drivers.sh119 pciBsdWlanDriver aironetwifi an an devs reg _pci
/haiku/src/system/libnetwork/netresolv/nameser/
H A Dns_name.c90 * Convert an encoded domain name to printable ascii as per RFC1035.
193 * Convert a ascii string into an encoded domain name as per RFC1035.
211 * Convert a ascii string into an encoded domain name as per RFC1035.
511 *\li 'dnptrs' is an array of pointers to previous compressed names.
647 *\li 'dnptrs' is an array of pointers to previous compressed names.
727 /* Find the number of octets an nname takes up, including the root label.
779 ns_name_owned(ns_namemap_ct a, int an, ns_namemap_ct b, int bn) { argument
781 if (an < bn)
790 a++, an--;
798 /* Build an arra
[all...]

Completed in 326 milliseconds

12