Home
last modified time | relevance | path

Searched full:query (Results 1 – 25 of 1987) sorted by relevance

12345678910>>...80

/freebsd/contrib/wpa/wpa_supplicant/
H A Dgas_query.c2 * Generic advertisement service (GAS) query
26 /** GAS query timeout in seconds */
29 /* GAS query wait-time / duration in ms */
36 * struct gas_query_pending - Pending GAS query
64 * struct gas_query - Internal GAS query data
81 struct gas_query_pending *query);
96 * gas_query_init - Initialize GAS query component
98 * Returns: Pointer to GAS query data or %NULL on failure
138 static void gas_query_free(struct gas_query_pending *query, int del_list) in gas_query_free() argument
140 struct gas_query *gas = query->gas; in gas_query_free()
[all …]
/freebsd/contrib/wpa/src/ap/
H A Dgas_query_ap.c2 * Generic advertisement service (GAS) query (hostapd)
25 /** GAS query timeout in seconds */
28 /* GAS query wait-time / duration in ms */
35 * struct gas_query_pending - Pending GAS query
61 * struct gas_query_ap - Internal GAS query data
75 struct gas_query_pending *query);
90 * gas_query_ap_init - Initialize GAS query component
92 * Returns: Pointer to GAS query data or %NULL on failure
132 static void gas_query_free(struct gas_query_pending *query, int del_list) in gas_query_free() argument
135 dl_list_del(&query->list); in gas_query_free()
[all …]
H A Dieee802_11_auth.c103 static void hostapd_acl_query_free(struct hostapd_acl_query_data *query) in hostapd_acl_query_free() argument
105 if (!query) in hostapd_acl_query_free()
107 os_free(query->auth_msg); in hostapd_acl_query_free()
108 os_free(query->anonce); in hostapd_acl_query_free()
109 os_free(query->eapol); in hostapd_acl_query_free()
110 os_free(query); in hostapd_acl_query_free()
116 struct hostapd_acl_query_data *query) in hostapd_radius_acl_query() argument
121 query->radius_id = radius_client_get_id(hapd->radius); in hostapd_radius_acl_query()
122 msg = radius_msg_new(RADIUS_CODE_ACCESS_REQUEST, query->radius_id); in hostapd_radius_acl_query()
168 if (query->akm && in hostapd_radius_acl_query()
[all …]
/freebsd/sys/ofed/drivers/infiniband/core/
H A Dib_sa_query.c487 static inline void ib_sa_disable_local_svc(struct ib_sa_query *query) in ib_sa_disable_local_svc() argument
489 query->flags &= ~IB_SA_ENABLE_LOCAL_SERVICE; in ib_sa_disable_local_svc()
509 pr_warn("Couldn't query port\n"); in update_sm_ah()
601 * ib_sa_cancel_query - try to cancel an SA query
602 * @id:ID of query to cancel
603 * @query:query pointer to cancel
605 * Try to cancel an SA query. If the id and query don't match up or
606 * the query has already completed, nothing is done. Otherwise the
607 * query is canceled and will complete with a status of -EINTR.
609 void ib_sa_cancel_query(int id, struct ib_sa_query *query) in ib_sa_cancel_query() argument
[all …]
/freebsd/contrib/llvm-project/llvm/lib/CodeGen/GlobalISel/
H A DLegalityPredicates.cpp30 [=](const LegalityQuery &Query) { return Query.Types[TypeIdx] == Type; }; in typeIs() argument
37 return [=](const LegalityQuery &Query) { in typeInSet() argument
38 return llvm::is_contained(Types, Query.Types[TypeIdx]); in typeInSet()
46 return [=](const LegalityQuery &Query) { in typePairInSet() argument
47 std::pair<LLT, LLT> Match = {Query.Types[TypeIdx0], Query.Types[TypeIdx1]}; in typePairInSet()
56 return [=](const LegalityQuery &Query) { in typePairAndMemDescInSet() argument
57 TypePairAndMemDesc Match = {Query.Types[TypeIdx0], Query.Types[TypeIdx1], in typePairAndMemDescInSet()
58 Query.MMODescrs[MMOIdx].MemoryTy, in typePairAndMemDescInSet()
59 Query.MMODescrs[MMOIdx].AlignInBits}; in typePairAndMemDescInSet()
68 return [=](const LegalityQuery &Query) { in isScalar() argument
[all …]
H A DLegalizeMutations.cpp19 [=](const LegalityQuery &Query) { return std::make_pair(TypeIdx, Ty); }; in changeTo() argument
24 return [=](const LegalityQuery &Query) { in changeTo() argument
25 return std::make_pair(TypeIdx, Query.Types[FromTypeIdx]); in changeTo()
31 return [=](const LegalityQuery &Query) { in changeElementTo() argument
32 const LLT OldTy = Query.Types[TypeIdx]; in changeElementTo()
33 const LLT NewTy = Query.Types[FromTypeIdx]; in changeElementTo()
40 return [=](const LegalityQuery &Query) { in changeElementTo() argument
41 const LLT OldTy = Query.Types[TypeIdx]; in changeElementTo()
48 return [=](const LegalityQuery &Query) { in changeElementCountTo() argument
49 const LLT OldTy = Query.Types[TypeIdx]; in changeElementCountTo()
[all …]
/freebsd/contrib/llvm-project/llvm/lib/Target/X86/
H A DX86LegalizerInfo.cpp
/freebsd/contrib/llvm-project/llvm/lib/Target/X86/GISel/
H A DX86LegalizerInfo.cpp86 .legalIf([=](const LegalityQuery &Query) -> bool { in X86LegalizerInfo() argument
90 return typeInSet(0, {p0, s1, s8, s16, s32, s64})(Query) || in X86LegalizerInfo()
91 (Is64Bit && typeInSet(0, {s128})(Query)); in X86LegalizerInfo()
95 .legalIf([=](const LegalityQuery &Query) -> bool { in X86LegalizerInfo() argument
96 return typeInSet(0, {p0, s8, s16, s32})(Query) || in X86LegalizerInfo()
97 (Is64Bit && typeInSet(0, {s64})(Query)); in X86LegalizerInfo()
139 .legalIf([=](const LegalityQuery &Query) -> bool { in X86LegalizerInfo() argument
140 if (typeInSet(0, {s8, s16, s32})(Query)) in X86LegalizerInfo()
142 if (Is64Bit && typeInSet(0, {s64})(Query)) in X86LegalizerInfo()
144 if (HasSSE2 && typeInSet(0, {v16s8, v8s16, v4s32, v2s64})(Query)) in X86LegalizerInfo()
[all …]
/freebsd/contrib/unbound/services/
H A Dmesh.h2 * services/mesh.h - deal with mesh of query states and handle events for that.
40 * query states. This mesh is supposed to be thread-specific.
41 * It consists of query states (per qname, qtype, qclass) and connections
42 * between query states and the super and subquery states, and replies to
80 * Mesh of query states
93 /** number of queries for unbound's auth_zones, upstream query */
147 /** backup of query if other operations recurse and need the
151 /** double linked list of the run-to-completion query states.
152 * These are query states with a reply */
157 /** double linked list of the query state
[all...]
H A Doutside_network.h131 /** last pending udp query in list */
185 * a new query that can use the existing connection. */
191 /** last of waiting query list */
268 * service a query so the close for another query does not help
295 * numbers are unused and can be used for a new query.
300 * if NULL no queries are waiting to be written and the pending->query
301 * is the query currently serviced. The first is the next in line.
310 * A query that has an answer pending for it.
315 /** the ID for the query
358 struct waiting_tcp* query; global() member
[all...]
/freebsd/contrib/bmake/unit-tests/
H A Dopt-query.exp3 commands: query status 1
5 Making opt-query-file.out-of-date in compat mode:
6 opt-query-file.out-of-date in compat mode: query status 1
8 Making opt-query-file.up-to-date in compat mode:
9 `opt-query-file.up-to-date' is up to date.
10 opt-query-file.up-to-date in compat mode: query status 0
13 phony in compat mode: query status 1
15 Making opt-query-file.out-of-date in jobs mode:
16 opt-query-file.out-of-date in jobs mode: query status 1
18 Making opt-query-file.up-to-date in jobs mode:
[all …]
H A Dopt-query.mk1 # $NetBSD: opt-query.mk,v 1.7 2022/08/18 05:37:05 rillig Exp $
24 _!= touch -f opt-query-file.up-to-date
31 && echo "${target}: query status $$?" \
32 || echo "${target}: query status $$?"
37 . for target in opt-query-file.out-of-date opt-query-file.up-to-date phony
40 && echo "${target} in ${mode} mode: query status $$?" \
41 || echo "${target} in ${mode} mode: query status $$?"
49 # expect: opt-query-file.out-of-date in compat mode: query status 1
50 # expect: opt-query-file.up-to-date in compat mode: query status 0
51 # expect: phony in compat mode: query status 1
[all …]
/freebsd/contrib/unbound/util/
H A Dmodule.h49 * module as a whole, for entire-module state (such as a cache). And per-query
51 * the per-query state.
53 * Most per-query state should simply be allocated in the query region.
54 * This is destroyed at the end of the query.
60 * *** Example module calls for a normal query
62 * In this example, the query does not need recursion, all the other data
69 * A query comes in, and a mesh entry is created for it. The mesh
71 * in the list of modules, and it is started on this new query. The
76 * The next module is the iterator. It is started on the passed query an
[all...]
/freebsd/crypto/heimdal/lib/hx509/
H A Dtest_query.in62 ${hxtool} query \
68 ${hxtool} query \
74 ${hxtool} query \
79 ${hxtool} query \
84 ${hxtool} query \
89 ${hxtool} query \
95 ${hxtool} query \
101 ${hxtool} query \
108 ${hxtool} query \
115 ${hxtool} query \
[all …]
/freebsd/contrib/unbound/contrib/
H A Dunbound_munin_45 # unbound_munin_histogram - histogram of query resolving times
86 unbound_munin_histogram - histogram of query resolving times
112 ABBREV="-e s/total/t/ -e s/thread/t/ -e s/num/n/ -e s/query/q/ -e s/answer/a/ -e s/unwanted/u/ -e s…
122 # Update list of seen query types etc to seentags file. This is run while
126 num.query.type.A
127 num.query.class.IN
128 num.query.opcode.QUERY
254 p_config "num.query.tcp" "TCP queries" "ABSOLUTE"
255 p_config "num.query.tcpout" "TCP out queries" "ABSOLUTE"
256 p_config "num.query.udpout" "UDP out queries" "ABSOLUTE"
[all …]
/freebsd/contrib/ofed/opensm/include/vendor/
H A Dosm_vendor_sa_api.h116 * Query the SA based on user-defined input. Queries of this type
118 * query.
121 * Query for service records based on the service name. Queries of
123 * to the query.
126 * Query for service records based on the service ID. Queries of
131 * Query for node information based on the node's GUID. Queries of
136 * Query for port information based on the port's base LID. Queries
141 * Query for port information based on the port's LID and port num.
143 * structure as input to the query. The port num and lid should
147 * Query for path records between the specified pair of port GUIDs.
[all …]
/freebsd/contrib/ldns/
H A Dupdate.c94 ldns_pkt *query, *resp; in ldns_update_soa_mname() local
97 query = ldns_pkt_query_new(ldns_rdf_clone(zone), LDNS_RR_TYPE_SOA, in ldns_update_soa_mname()
99 if (!query) { in ldns_update_soa_mname()
103 ldns_pkt_set_random_id(query); in ldns_update_soa_mname()
104 if (ldns_resolver_send_pkt(&resp, r, query) != LDNS_STATUS_OK) { in ldns_update_soa_mname()
105 ldns_pkt_free(query); in ldns_update_soa_mname()
108 ldns_pkt_free(query); in ldns_update_soa_mname()
137 ldns_pkt *query, *resp; in ldns_update_soa_zone_mname() local
148 query = ldns_pkt_query_new(fqdn_rdf, LDNS_RR_TYPE_SOA, c, LDNS_RD); in ldns_update_soa_zone_mname()
149 if (!query) { in ldns_update_soa_zone_mname()
[all …]
/freebsd/contrib/unbound/iterator/
H A Diterator.h2 * iterator/iterator.h - iterative resolver DNS query response module
39 * This file contains a module that performs recursive iterative DNS query
54 /** max number of targets spawned for a query and its subqueries */
56 /** max number of upstream queries for a query and its subqueries, it is
61 /** max number of nxdomains allowed for target lookups for a query and
64 /** max number of nxdomains allowed for target lookups for a query and
77 /* max number of time-outs for minimised query. Prevents resolving failures
86 /** at what query-sent-count to stop target fetch policy */
171 /** max number of query restarts to limit length of CNAME chain */
181 * State entered on new query o
[all...]
/freebsd/contrib/llvm-project/llvm/lib/Target/AArch64/GISel/
H A DAArch64LegalizerInfo.cpp138 [=](const LegalityQuery &Query) { in AArch64LegalizerInfo() argument
139 return Query.Types[0].getNumElements() <= 2; in AArch64LegalizerInfo()
143 [=](const LegalityQuery &Query) { in AArch64LegalizerInfo() argument
144 return Query.Types[0].getNumElements() <= 4; in AArch64LegalizerInfo()
148 [=](const LegalityQuery &Query) { in AArch64LegalizerInfo() argument
149 return Query.Types[0].getNumElements() <= 16; in AArch64LegalizerInfo()
155 .customIf([=](const LegalityQuery &Query) { in AArch64LegalizerInfo() argument
156 const auto &SrcTy = Query.Types[0]; in AArch64LegalizerInfo()
157 const auto &AmtTy = Query.Types[1]; in AArch64LegalizerInfo()
249 .legalIf([=](const LegalityQuery &Query) { in AArch64LegalizerInfo() argument
[all …]
/freebsd/contrib/ldns-host/
H A Dldns-host.145 should query instead of the server or servers listed in
54 Make a verbose query of type
59 Query for
66 query for
69 Perform DNS query of class
114 Perform non-recursive query to the name server by clearing RD
116 bit of the query.
118 Retry this many times when a query does not receive an answer
125 Query name server over TCP. By default UDP is used, except for
134 Perform DNS query of type
[all …]
/freebsd/contrib/unbound/libunbound/
H A Dcontext.h67 /** mutex on query write pipe */
69 /** the query write pipe */
134 /** next query number (to try) to use */
157 /** query id number, key for node */
159 /** was this an async query? */
161 /** was this query cancelled (for bg worker) */
164 /** for async query, the callback function of type ub_callback_type */
168 /** for async query, the callback user arg */
177 /** store libworker that is handling this query */
180 /** result structure, also contains original query, type, class.
[all …]
/freebsd/contrib/unbound/doc/
H A Dunbound-control.8.in120 tcp-auth-query-timeout,
135 dnstap-log-resolver-query-messages,
137 dnstap-log-client-query-messages,
139 dnstap-log-forwarder-query-messages and
186 max-sent-count, max-query-restarts, do-not-query-address,
187 do-not-query-localhost, private-address, private-domain, caps-exempt,
196 query processing see only old, or only new config options.
207 are stored with a query when it comes in based on its source IP address.
208 The old information is kept with the query unti
[all...]
H A Dunbound-control.8193 do\-not\-query\-localhost, harden\-short\-bufsize, harden\-large\-queries,
385 cachehits, as the original query had the unprefetched answer from cache,
397 … internal recursive processing request list on insert of a new incoming recursive processing query.
515 Memory in bytes used by the HTTP/2 query buffers. Containing (partial) DNS
528 .I num.query.type.A
529 The total number of queries over all threads with query type A.
530 Printed for the other query types as well, but only for the types for which
533 .I num.query.type.other
534 Number of queries with query types 256\-65535.
536 .I num.query.class.IN
[all …]
/freebsd/contrib/unbound/dns64/
H A Ddns64.c39 * This file contains a module that performs DNS64 query processing.
68 * Maximum length of a domain name in a PTR query in the .in-addr.arpa tree.
73 * State of DNS64 processing for a query.
76 DNS64_INTERNAL_QUERY, /**< Internally-generated query, no DNS64
78 DNS64_NEW_QUERY, /**< Query for which we're the first module in
80 DNS64_SUBQUERY_FINISHED /**< Query for which we generated a sub-query, and
81 for which this sub-query is finished. */
85 * Per-query module-specific state. For the DNS64 module.
216 * Builds the PTR query nam
[all...]
/freebsd/crypto/openssl/doc/man7/
H A Dproperty.pod63 A I<property query clause> is a single conditional test.
71 A I<property query> is a sequence of comma separated property query clauses.
72 It is an error if a property name appears in more than one query clause.
93 B<-> is a prefix operator that means any global query clause involving the
110 When an algorithm is looked up, a property query is used to determine
112 All mandatory query clauses B<must> be present and the implementation
113 that additionally has the largest number of matching optional query
127 Two levels of property query are supported.
128 A context based property query that applies to all fetch operations and a local
129 property query.
[all …]

12345678910>>...80