Home
last modified time | relevance | path

Searched full:pairs (Results 1 – 25 of 1304) sorted by relevance

12345678910>>...53

/freebsd/contrib/llvm-project/llvm/lib/ExecutionEngine/Orc/
H A DLookupAndRecordAddrs.cpp19 std::vector<std::pair<SymbolStringPtr, ExecutorAddr *>> Pairs, in lookupAndRecordAddrs() argument
23 for (auto &KV : Pairs) in lookupAndRecordAddrs()
28 [Pairs = std::move(Pairs), in lookupAndRecordAddrs()
32 for (auto &KV : Pairs) { in lookupAndRecordAddrs()
44 std::vector<std::pair<SymbolStringPtr, ExecutorAddr *>> Pairs, in lookupAndRecordAddrs() argument
50 ES, K, SearchOrder, std::move(Pairs), LookupFlags); in lookupAndRecordAddrs()
56 std::vector<std::pair<SymbolStringPtr, ExecutorAddr *>> Pairs, in lookupAndRecordAddrs() argument
60 for (auto &KV : Pairs) in lookupAndRecordAddrs()
71 if (Result->front().size() != Pairs in lookupAndRecordAddrs()
[all...]
/freebsd/contrib/ncurses/man/
H A Dnew_pair.3x53 dynamically allocate \fIcurses\fR color pairs
69 pairs for a given terminal, or it may not:
77 Color pairs are the \fIcurses\fP library's way of managing a color palette
85 as the limit on color pairs:
103 An application might use up to a few dozen color pairs to
110 Also beyond those few dozen pairs, the required size for a table
114 manage color pairs.
129 All of the color pairs are allocated from a table of possible color pairs.
130 The size of the table is determined by the terminfo \fBpairs\fP capability.
134 to the colors versus color pairs.
H A Dcurs_color.3x112 Colors are always used in pairs.
159 pairs in an internal function called from \fB\%waddch\fP:
209 pairs the terminal can support.
220 of color pairs that a
233 and color pairs the terminal can support).
237 No other color pairs are initialized.
269 These limits apply to color values and color pairs.
315 the upper limit is adjusted to allow for extra pairs which use
331 that limits color pairs and color-values
411 Attributes can hold color pairs in the range 0 to 255.
[all …]
/freebsd/lib/libc/db/hash/
H A DREADME5 All test programs which need key/data pairs expect them entered
14 keys/data pairs entered from standard in.
22 Creates a table from the key/data pairs on standard in and
32 Reads the key/data pairs in the file hashtest and writes them
37 Reads key/data pairs from standard in and looks them up
40 Reads key/data pairs from standard in, looks them up
/freebsd/contrib/libyaml/tests/
H A Drun-dumper.c61 for (pair = node->data.mapping.pairs.start; in copy_document()
62 pair < node->data.mapping.pairs.top; pair ++) { in copy_document()
114 if ((node1->data.mapping.pairs.top - node1->data.mapping.pairs.start) != in compare_nodes()
115 (node2->data.mapping.pairs.top - node2->data.mapping.pairs.start)) in compare_nodes()
117 … for (k = 0; k < (node1->data.mapping.pairs.top - node1->data.mapping.pairs.start); k ++) { in compare_nodes()
118 if (!compare_nodes(document1, node1->data.mapping.pairs.start[k].key, in compare_nodes()
119 document2, node2->data.mapping.pairs.start[k].key, level)) return 0; in compare_nodes()
120 if (!compare_nodes(document1, node1->data.mapping.pairs.start[k].value, in compare_nodes()
121 document2, node2->data.mapping.pairs.start[k].value, level)) return 0; in compare_nodes()
/freebsd/crypto/krb5/src/plugins/kdb/db2/libdb2/test/hash2.tests/
H A DREADME6 All test programs which need key/data pairs expect them entered
15 keys/data pairs entered from standard in.
23 Creates a table from the key/data pairs on standard in and
33 Reads the key/data pairs in the file hashtest and writes them
38 Reads key/data pairs from standard in and looks them up
41 Reads key/data pairs from standard in, looks them up
/freebsd/libexec/nuageinit/
H A Dnuageinit63 for _, iface in pairs(ifaces["statistics"]["interface"]) do
84 for n, g in pairs(obj.groups) do
91 for k, v in pairs(g) do
110 for n, u in pairs(obj.users) do
145 for key, val in pairs(obj.ssh_keys) do
180 for n, p in pairs(packages) do
195 for n, file in pairs(files) do
218 for _, v in pairs(obj.network.ethernets) do
233 for _, a in pairs(v.addresses) do
326 for _, v in pairs(obj["links"]) do
[all …]
/freebsd/sys/cddl/contrib/opensolaris/uts/common/sys/sysevent/
H A Deventdefs.h66 * EC_DR subclass definitions - supporting attributes (name/value pairs)
76 * EC_ENV subclass definitions - supporting attributes (name/value pairs)
85 * EC_DOMAIN subclass definitions - supporting attributes (name/value pairs)
95 * EC_AP_DRIVER subclass definitions - supporting attributes (name/value pairs)
108 * EC_IPMP subclass definitions - supporting attributes (name/value pairs)
129 * (name/value pairs) are found in sys/sysevent/dev.h
137 * EC_DEV_BRANCH subclass definitions - supporting attributes (name/value pairs)
/freebsd/tools/build/options/
H A Dmakeman.lua339 for name, _ in pairs(options) do
367 for opt, value in pairs(all_opts) do
380 for name, value in pairs(options) do
395 for k, v in pairs(options) do
502 for tgt, dflt in pairs(target_archs) do
505 for opt, val in pairs(native_default_opts) do
518 for opt, val in pairs(target_opts) do
528 for opt in pairs(native_default_opts) do
530 for _, opts in pairs(target_defaults) do
536 for tgt, opts in pairs(target_defaults) do
[all …]
/freebsd/contrib/llvm-project/llvm/utils/TableGen/Common/
H A DInfoByHwMode.cpp89 std::vector<const PairType *> Pairs; in writeToStream() local
91 Pairs.push_back(&P); in writeToStream()
92 llvm::sort(Pairs, deref<std::less<PairType>>()); in writeToStream()
96 for (const PairType *P : Pairs) in writeToStream()
174 std::vector<const PairType *> Pairs; in writeToStream() local
176 Pairs.push_back(&P); in writeToStream()
177 llvm::sort(Pairs, deref<std::less<PairType>>()); in writeToStream()
181 for (const PairType *P : Pairs) in writeToStream()
/freebsd/sys/contrib/openzfs/module/zfs/
H A Dfm.c843 nvlist_t *pairs[HC_MAXPAIRS]; in fm_fmri_hc_set() local
860 pairs[i] = fm_nvlist_create(nva); in fm_fmri_hc_set()
861 if (nvlist_add_string(pairs[i], FM_FMRI_HC_NAME, name) != 0 || in fm_fmri_hc_set()
862 nvlist_add_string(pairs[i], FM_FMRI_HC_ID, idstr) != 0) { in fm_fmri_hc_set()
870 (const nvlist_t **)pairs, npairs) != 0) { in fm_fmri_hc_set()
875 fm_nvlist_destroy(pairs[i], FM_NVA_RETAIN); in fm_fmri_hc_set()
890 nvlist_t *pairs[HC_MAXPAIRS]; in fm_fmri_hc_create() local
901 * copy the bboard nvpairs to the pairs array in fm_fmri_hc_create()
922 pairs[i] = fm_nvlist_create(nva); in fm_fmri_hc_create()
923 if (nvlist_add_string(pairs[i], FM_FMRI_HC_NAME, hcname) != 0 || in fm_fmri_hc_create()
[all …]
/freebsd/share/man/man4/
H A Dhv_kvp.442 key value pairs for
46 of key value pairs inside the
50 modify and delete such key value pairs.
56 pairs and does the actual metadata management.
H A Dnvme.469 Per-CPU IO queue pairs
94 and NVMe queue pairs can be allocated.
96 pairs are available, nvme(4) will use a smaller number of queue pairs and
121 Note that use of INTx implies disabling of per-CPU I/O queue pairs.
/freebsd/crypto/krb5/src/lib/krb5/unicode/ucdata/
H A Dformat.txt70 Sy 41 Symmetric (characters which are part of open/close pairs)
91 Ranges[] array. The Ranges[] array contains pairs of 4-byte values
92 representing a range of Unicode characters. The pairs are arranged in
166 pairs that have a single Unicode value representing the combination of the two
208 The DecompNodes[] array consists of pairs of unsigned longs, the first of
262 The NumberNodes array contains pairs of values, the first of which is the
264 ValueNodes array contains pairs of integers which represent the numerator
/freebsd/sys/dev/iavf/
H A Diavf_vc_iflib.c62 int len, pairs; in iavf_configure_queues() local
69 pairs = max(vsi->num_tx_queues, vsi->num_rx_queues); in iavf_configure_queues()
71 (sizeof(struct virtchnl_queue_pair_info) * pairs); in iavf_configure_queues()
78 vqci->num_queue_pairs = pairs; in iavf_configure_queues()
80 /* Size check is not needed here - HW max is 16 queue pairs, and we in iavf_configure_queues()
84 for (int i = 0; i < pairs; i++, tx_que++, rx_que++, vqpi++) { in iavf_configure_queues()
/freebsd/contrib/llvm-project/llvm/include/llvm/Support/
H A DAutomaton.h89 /// Pairs defines a sequence of possible NFA transitions for a single DFA in makePathSegment()
91 void transition(ArrayRef<NfaStatePair> Pairs) {
97 // The sequence of pairs is sorted. Select the set of pairs that in transition()
99 auto PI = lower_bound(Pairs, NfaStatePair{Head->State, 0ULL}); in transition()
100 auto PE = upper_bound(Pairs, NfaStatePair{Head->State, INT64_MAX}); in transition()
134 ArrayRef<NfaStatePair> Pairs(&TransitionInfo[TransitionInfoIdx], in transition()
136 transition(Pairs); in transition()
93 transition(ArrayRef<NfaStatePair> Pairs) transition() argument
/freebsd/lib/libc/gen/
H A Dsetjmp.386 Pairs of calls may be intermixed, i.e., both
121 pairs save and restore the signal mask while
123 pairs save and restore only the register set and the stack.
130 pairs save and restore the signal mask if the argument
/freebsd/lib/libc/db/man/
H A Ddbopen.3172 Since key/data pairs may be cached in memory, failing to sync the file
183 A pointer to a routine to remove key/data pairs from the database.
236 A pointer to a routine to store key/data pairs in the database.
393 0 on success and 1 if there are no key/data pairs less than or greater
398 is a character special file and no complete key/data pairs are currently
432 .Sh "KEY/DATA PAIRS"
433 Access to all file types is based on key/data pairs.
/freebsd/sys/contrib/device-tree/Bindings/usb/
H A Dhisilicon,histb-xhci.txt9 - clocks: a list of phandle + clock-specifier pairs, one for each
16 - resets: a list of phandle and reset specifier pairs as listed in
20 - phys: a list of phandle + phy specifier pairs
/freebsd/contrib/libcbor/src/cbor/
H A Dmaps.h24 /** Get the number of pairs
27 * @return The number of pairs
108 /** Get the pairs storage
111 * @return Array of #cbor_map_size pairs. Manipulation is possible as long as
/freebsd/contrib/llvm-project/clang/lib/Headers/
H A Davxvnniint16intrin.h26 /// Multiply groups of 2 adjacent pairs of signed 16-bit integers in \a __A with
63 /// Multiply groups of 2 adjacent pairs of signed 16-bit integers in \a __A with
99 /// Multiply groups of 2 adjacent pairs of signed 16-bit integers in \a __A with
137 /// Multiply groups of 2 adjacent pairs of signed 16-bit integers in \a __A with
174 /// Multiply groups of 2 adjacent pairs of unsigned 16-bit integers in \a __A with
211 /// Multiply groups of 2 adjacent pairs of unsigned 16-bit integers in \a __A with
247 /// Multiply groups of 2 adjacent pairs of unsigned 16-bit integers in \a __A with
285 /// Multiply groups of 2 adjacent pairs of unsigned 16-bit integers in \a __A with
322 /// Multiply groups of 2 adjacent pairs of unsigned 16-bit integers in \a __A with
359 /// Multiply groups of 2 adjacent pairs of unsigned 16-bit integers in \a __A with
[all …]
H A Davxvnniintrin.h46 /// Multiply groups of 4 adjacent pairs of unsigned 8-bit integers in \a __A with
69 /// Multiply groups of 4 adjacent pairs of unsigned 8-bit integers in \a __A with
92 /// Multiply groups of 2 adjacent pairs of signed 16-bit integers in \a __A with
113 /// Multiply groups of 2 adjacent pairs of signed 16-bit integers in \a __A with
134 /// Multiply groups of 4 adjacent pairs of unsigned 8-bit integers in \a __A with
157 /// Multiply groups of 4 adjacent pairs of unsigned 8-bit integers in \a __A with
180 /// Multiply groups of 2 adjacent pairs of signed 16-bit integers in \a __A with
201 /// Multiply groups of 2 adjacent pairs of signed 16-bit integers in \a __A with
H A Dtmmintrin.h182 /// Horizontally adds the adjacent pairs of values contained in 2 packed
205 /// Horizontally adds the adjacent pairs of values contained in 2 packed
228 /// Horizontally adds the adjacent pairs of values contained in 2 packed
251 /// Horizontally adds the adjacent pairs of values contained in 2 packed
274 /// Horizontally adds, with saturation, the adjacent pairs of values contained
300 /// Horizontally adds, with saturation, the adjacent pairs of values contained
326 /// Horizontally subtracts the adjacent pairs of values contained in 2
349 /// Horizontally subtracts the adjacent pairs of values contained in 2
372 /// Horizontally subtracts the adjacent pairs of values contained in 2
395 /// Horizontally subtracts the adjacent pairs of values contained in 2
[all …]
/freebsd/contrib/libyaml/src/
H A Dloader.c322 if (!STACK_EMPTY(parser, parent->data.mapping.pairs)) { in yaml_parser_load_node_add()
323 yaml_node_pair_t *p = parent->data.mapping.pairs.top - 1; in yaml_parser_load_node_add()
332 if (!STACK_LIMIT(parser, parent->data.mapping.pairs, INT_MAX-1)) in yaml_parser_load_node_add()
334 if (!PUSH(parser, parent->data.mapping.pairs, pair)) in yaml_parser_load_node_add()
491 } pairs = { NULL, NULL, NULL }; in yaml_parser_load_mapping() local
503 if (!STACK_INIT(parser, pairs, yaml_node_pair_t*)) goto error; in yaml_parser_load_mapping()
505 MAPPING_NODE_INIT(node, tag, pairs.start, pairs.end, in yaml_parser_load_mapping()
/freebsd/contrib/llvm-project/llvm/lib/Transforms/Scalar/
H A DDivRemPairs.cpp31 #define DEBUG_TYPE "div-rem-pairs"
32 STATISTIC(NumPairs, "Number of div/rem pairs");
36 DEBUG_COUNTER(DRPCounter, "div-rem-pairs-transform",
37 "Controls transformations in div-rem-pairs pass");
117 /// Find matching pairs of integer div/rem ops (they have the same numerator,
118 /// denominator, and signedness). Place those pairs into a worklist for further
144 // We'll accumulate the matching pairs of div-rem instructions here. in getWorklist()
148 // pairs. Choose remainders for efficiency because they are usually even more in getWorklist()
167 /// Find matching pairs of integer div/rem ops (they have the same numerator,
185 // Get the matching pairs of div-rem instructions. We want this extra in optimizeDivRem()

12345678910>>...53