Home
last modified time | relevance | path

Searched full:pair (Results 1 – 25 of 3144) sorted by relevance

12345678910>>...126

/freebsd/contrib/ncurses/ncurses/base/
H A Dnew_pair.c36 * New color-pair functions, alloc_pair and free_pair
71 prev_len(SCREEN *sp, int pair) in prev_len() argument
74 int base = pair; in prev_len()
76 while (list[pair].prev != base) { in prev_len()
78 pair = list[pair].prev; in prev_len()
84 next_len(SCREEN *sp, int pair) in next_len() argument
87 int base = pair; in next_len()
89 while (list[pair].next != base) { in next_len()
91 pair = list[pair].next; in next_len()
100 dumpit(SCREEN *sp, int pair, const char *tag) in dumpit() argument
[all …]
H A Dlib_color.c304 * Reset the color pair, e.g., to whatever color pair 0 is.
394 * allow for default-color as a component of a color-pair. in NCURSES_SP_NAME()
486 * Change all cells which use(d) a given color pair to force a repaint.
489 _nc_change_pair(SCREEN *sp, int pair) in _nc_change_pair() argument
504 if (GetPair(ptr->text[x]) == pair) { in _nc_change_pair()
559 _nc_init_pair(SCREEN *sp, int pair, int f, int b) in _nc_init_pair() argument
566 T((T_CALLED("init_pair(%p,%d,%d,%d)"), (void *) sp, pair, f, b)); in _nc_init_pair()
568 if (!ValidPair(sp, pair)) in _nc_init_pair()
573 ReservePairs(sp, pair); in _nc_init_pair()
574 previous = sp->_color_pairs[pair]; in _nc_init_pair()
[all …]
/freebsd/contrib/llvm-project/libcxx/include/
H A Dutility74 struct pair
82 pair(const pair&) = default;
83 pair(pair&&) = default;
84 explicit(see-below) constexpr pair();
85 … explicit(see-below) pair(const T1& x, const T2& y); // constexpr in C++14
86 … template <class U = T1, class V = T2> explicit(see-below) pair(U&&, V&&); // constexpr in C++14
87 template <class U, class V> constexpr explicit(see-below) pair(pair<U, V>&); // since C++23
88 … template <class U, class V> explicit(see-below) pair(const pair<U, V>& p); // constexpr in C++14
89 … template <class U, class V> explicit(see-below) pair(pair<U, V>&& p); // constexpr in C++14
91 constexpr explicit(see-below) pair(const pair<U, V>&&); // since C++23
[all …]
/freebsd/contrib/llvm-project/libcxx/include/__utility/
H A Dpair.h17 #include <__fwd/pair.h>
65 struct _LIBCPP_TEMPLATE_VIS pair struct
78 pair, argument
81 _LIBCPP_HIDE_FROM_ABI pair(pair const&) = default;
82 _LIBCPP_HIDE_FROM_ABI pair(pair&&) = default;
84 …// When we are requested for pair to be trivially copyable by the ABI macro, we use defaulted memb…
89 // when printing a pair
94 _LIBCPP_HIDE_FROM_ABI constexpr pair& operator=(const pair&) argument
98 _LIBCPP_HIDE_FROM_ABI constexpr pair& operator=(pair&&) argument
102 _LIBCPP_HIDE_FROM_ABI pair& operator=(const pair&) argument
[all …]
/freebsd/sys/contrib/openzfs/module/zfs/
H A Ddsl_userhold.c99 for (nvpair_t *pair = nvlist_next_nvpair(dduha->dduha_holds, NULL); in dsl_dataset_user_hold_check() local
100 pair != NULL; pair = nvlist_next_nvpair(dduha->dduha_holds, pair)) { in dsl_dataset_user_hold_check()
101 size_t len = strlen(nvpair_name(pair)) + in dsl_dataset_user_hold_check()
102 strlen(fnvpair_value_string(pair)); in dsl_dataset_user_hold_check()
104 (void) strlcpy(nameval, nvpair_name(pair), len + 2); in dsl_dataset_user_hold_check()
106 (void) strlcat(nameval, fnvpair_value_string(pair), len + 2); in dsl_dataset_user_hold_check()
114 for (nvpair_t *pair = nvlist_next_nvpair(dduha->dduha_holds, NULL); in dsl_dataset_user_hold_check() local
115 pair != NULL; pair = nvlist_next_nvpair(dduha->dduha_holds, pair)) { in dsl_dataset_user_hold_check()
121 name = nvpair_name(pair); in dsl_dataset_user_hold_check()
126 error = nvpair_value_string(pair, &htag); in dsl_dataset_user_hold_check()
[all …]
/freebsd/contrib/ncurses/man/
H A Dcurs_color.3x87 \fBint init_pair(short \fIpair\fP, short \fIf\fP, short \fIb\fP);
90 \fBint init_extended_pair(int \fIpair\fP, int \fIf\fP, int \fIb\fP);
94 \fBint pair_content(short \fIpair\fP, short *\fIf\fP, short *\fIb\fP);
97 \fBint extended_pair_content(int \fIpair\fP, int *\fIf\fP, int *\fIb\fP);
114 .I "color pair"
117 \fB\%init_pair\fP initializes a color pair.
118 The macro \fB\%COLOR_PAIR\fP(\fIn\fP) can then convert the pair to a
131 \fB\%pair_content\fP permits discovery of a color pair's current
149 parameter containing attributes including a color pair value.
152 use a separate color pair number parameter.
[all …]
H A Dnew_pair.3x60 \fBint free_pair(int \fIpair\fP);
64 They permit an application to dynamically allocate a color pair using
65 the foreground/background colors rather than assign a fixed color pair number,
66 and return an unused pair to the pool.
75 That is, the foreground and background colors are applied as a pair.
118 checks if that color combination is already associated with a color pair.
121 \fBalloc_pair\fP returns the existing pair.
124 \fBalloc_pair\fP allocates a new color pair and returns that.
127 allocated entry using \fBfree_pair\fP and allocates a new color pair.
138 checks if that color combination is already associated with a color pair,
[all …]
H A Dcurs_attr.3x80 \fBint attr_get(attr_t *\fIattrs\fP, short *\fIpair\fP, void *\fIopts\fP);
81 \fBint wattr_get(WINDOW *\fIwin\fP, attr_t *\fIattrs\fP, short *\fIpair\fP,\fR \fPvoid *\fIopts\fP);
82 \fBint attr_set(attr_t \fIattrs\fP, short \fIpair\fP, void *\fIopts\fP);
83 \fBint wattr_set(WINDOW *\fIwin\fP, attr_t \fIattrs\fP, short \fIpair\fP, void *\fIopts\fP);
97 \fBint chgat(int \fIn\fP, attr_t \fIattr\fP, short \fIpair\fP,\fR \fPconst void *\fIopts\fP);
99 \fBint \fIn\fB, attr_t \fIattr\fB,\fR \fBshort \fIpair\fB, const void *\fIopts\fB);\fR
101 \fBint \fIn\fB, attr_t \fIattr\fB, short \fIpair\fB, const void *\fIopts\fB);\fR
103 \fBint \fIn\fB, attr_t \fIattr\fB, short \fIpair\fB, const void *\fIopts\fB);\fR
105 \fBint color_set(short \fIpair\fB, void* \fIopts\fB);\fR
106 \fBint wcolor_set(WINDOW *\fIwin\fB, short \fIpair\fB,\fR \fBvoid* \fIopts\fP);\fR
[all …]
/freebsd/contrib/lib9p/pytest/
H A Dnumalloc.py176 pair = self.avail[mid]
177 if val < pair[0]:
180 elif val > pair[1]:
185 return mid, pair
209 i, pair = self._find_block(val)
210 if pair is None:
224 pair = self.avail[i]
225 val = pair[0]
230 # 1. pair[0] < val < pair[1]: split the pair.
231 # 2. pair[0] == val < pair[1]: increase pair[0].
[all …]
/freebsd/contrib/llvm-project/llvm/include/llvm/ADT/
H A DMapVector.h35 typename VectorType = SmallVector<std::pair<KeyT, ValueT>, 0>>
83 std::pair<KeyT, ValueT> &front() { return Vector.front(); } in front()
84 const std::pair<KeyT, ValueT> &front() const { return Vector.front(); } in front()
85 std::pair<KeyT, ValueT> &back() { return Vector.back(); } in back()
86 const std::pair<KeyT, ValueT> &back() const { return Vector.back(); } in back()
99 std::pair<KeyT, typename MapType::mapped_type> Pair = std::make_pair(Key, 0); variable
100 std::pair<typename MapType::iterator, bool> Result = Map.insert(Pair);
118 std::pair<iterato in insert() local
131 std::pair<KeyT, typename MapType::mapped_type> Pair = std::make_pair(KV.first, 0); insert() local
[all...]
/freebsd/contrib/llvm-project/lldb/source/Utility/
H A DSelectHelper.cpp107 for (auto &pair : m_fd_map) { in Select() local
108 pair.second.PrepareForSelect(); in Select()
109 const lldb::socket_t fd = pair.first; in Select()
117 if (pair.second.read_set) in Select()
119 if (pair.second.write_set) in Select()
121 if (pair.second.error_set) in Select()
178 for (auto &pair : m_fd_map) { in Select() local
179 const lldb::socket_t fd = pair.first; in Select()
181 if (pair.second.read_set) in Select()
184 if (pair.second.write_set) in Select()
[all …]
H A DStructuredData.cpp109 std::pair<llvm::StringRef, llvm::StringRef> match = path.split('.'); in GetObjectForDotSeparatedPath()
124 std::pair<llvm::StringRef, llvm::StringRef> match = path.split('['); in GetObjectForDotSeparatedPath()
168 using Entry = std::pair<llvm::StringRef, ObjectSP>; in Serialize()
170 for (const auto &pair : m_dict) in Serialize()
171 sorted_entries.push_back({pair.first(), pair.second}); in Serialize()
175 for (const auto &pair : sorted_entries) { in Serialize()
176 s.attributeBegin(pair.first);
177 pair.second->Serialize(s); in Serialize()
228 // Print value and new line if now last pair in GetDescription()
165 for (const auto &pair : m_dict) { Serialize() local
231 for (const auto &pair : m_dict) { GetDescription() local
[all...]
/freebsd/contrib/llvm-project/llvm/lib/Transforms/ObjCARC/
H A DBlotMapVector.h28 using VectorTy = std::vector<std::pair<KeyT, ValueT>>;
56 std::pair<typename MapTy::iterator, bool> Pair = variable
58 if (Pair.second) {
60 Pair.first->second = Num;
64 return Vector[Pair.first->second].second;
67 std::pair<iterator, bool> insert(const std::pair<KeyT, ValueT> &InsertPair) { in insert()
68 std::pair<typename MapTy::iterator, bool> Pair = in insert() local
70 if (Pair.second) { in insert()
72 Pair.first->second = Num; in insert()
76 return std::make_pair(Vector.begin() + Pair.first->second, false); in insert()
/freebsd/crypto/openssl/doc/man3/
H A DBIO_s_bio.pod8 BIO_ctrl_get_read_request, BIO_ctrl_reset_read_request - BIO pair BIO
33 BIO_s_bio() returns the method for a BIO pair. A BIO pair is a pair of source/sink
34 BIOs where data written to either half of the pair is buffered and can be read from
39 one half of a BIO pair and have all the data processed by the chain under application
57 BIO_make_bio_pair() joins two separate BIOs into a connected pair.
60 up any half of the pair will automatically destroy the association.
64 half of the pair will return any pending data or EOF when all pending data has
74 BIO_set_write_buf_size() to create a connected pair of BIOs B<bio1>, B<bio2>
88 last read attempt at the other half of the BIO pair failed due to an
103 Both halves of a BIO pair should be freed. That is even if one half is implicit
[all …]
/freebsd/sys/contrib/openzfs/tests/zfs-tests/tests/functional/rsend/
H A Drsend_008_pos.ksh97 # Define all the POOL/POOL2 datasets pair
99 set -A pair "$POOL" "$dstds" \
107 typeset -i n=${#pair[@]}
108 pair[((n))]="$POOL/vol"; pair[((n+1))]="$dstds/vol"
109 pair[((n+2))]="$POOL/$FS/vol" pair[((n+3))]="$dstds/$FS/vol"
117 while ((i < ${#pair[@]})); do
118 log_must cmp_ds_cont ${pair[$i]} ${pair[((i+1))]}
119 log_must cmp_ds_prop ${pair[$i]} ${pair[((i+1))]}
H A Drsend_011_pos.ksh89 # Define all the POOL/POOL2 datasets pair
91 set -A pair "$POOL" "$dstds" \
99 typeset -i n=${#pair[@]}
100 pair[((n))]="$POOL/vol"; pair[((n+1))]="$dstds/vol"
101 pair[((n+2))]="$POOL/$FS/vol" pair[((n+3))]="$dstds/$FS/vol"
109 while ((i < ${#pair[@]})); do
110 log_must cmp_ds_prop ${pair[$i]} ${pair[((i+1))]}
/freebsd/contrib/llvm-project/libcxx/include/__fwd/
H A Dpair.h23 struct _LIBCPP_TEMPLATE_VIS pair; variable
26 _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX14 typename tuple_element<_Ip, pair<_T1, _T2> >::t…
27 get(pair<_T1, _T2>&) _NOEXCEPT;
30 _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX14 const typename tuple_element<_Ip, pair<_T1, _T2…
31 get(const pair<_T1, _T2>&) _NOEXCEPT;
35 _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX14 typename tuple_element<_Ip, pair<_T1, _T2> >::t…
36 get(pair<_T1, _T2>&&) _NOEXCEPT;
39 _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX14 const typename tuple_element<_Ip, pair<_T1, _T2…
40 get(const pair<_T1, _T2>&&) _NOEXCEPT;
/freebsd/tests/sys/cddl/zfs/tests/rsend/
H A Drsend_011_pos.ksh105 # Define all the POOL/POOL2 datasets pair
107 set -A pair "$POOL" "$dstds" \
115 typeset -i n=${#pair[@]}
116 pair[((n))]="$POOL/vol"; pair[((n+1))]="$dstds/vol"
117 pair[((n+2))]="$POOL/$FS/vol" pair[((n+3))]="$dstds/$FS/vol"
125 while ((i < ${#pair[@]})); do
126 log_must cmp_ds_cont ${pair[$i]} ${pair[((i+1))]}
127 log_must cmp_ds_prop ${pair[$i]} ${pair[((i+1))]}
H A Drsend_008_pos.ksh103 # Define all the POOL/POOL2 datasets pair
105 set -A pair "$POOL" "$dstds" \
113 typeset -i n=${#pair[@]}
114 pair[((n))]="$POOL/vol"; pair[((n+1))]="$dstds/vol"
115 pair[((n+2))]="$POOL/$FS/vol" pair[((n+3))]="$dstds/$FS/vol"
123 while ((i < ${#pair[@]})); do
124 log_must cmp_ds_cont ${pair[$i]} ${pair[((i+1))]}
125 log_must cmp_ds_prop ${pair[$i]} ${pair[((i+1))]}
/freebsd/contrib/ntp/sntp/libevent/test/
H A Dregress_et.c83 evutil_socket_t *pair = data->pair; in test_edgetriggered() local
97 tt_int_op(send(pair[0], test, (int)strlen(test)+1, 0), >, 0); in test_edgetriggered()
98 tt_int_op(shutdown(pair[0], EVUTIL_SHUT_WR), ==, 0); in test_edgetriggered()
106 ev = event_new(base, pair[1], EV_READ|EV_ET|EV_PERSIST, read_cb, &ev); in test_edgetriggered()
111 * will read a single byte from pair[1] in either case. If we're edge in test_edgetriggered()
153 ev_et = event_new(base, data->pair[0], EV_READ|EV_ET, read_cb, ev_et); in test_edgetriggered_mix_error()
155 ev_lt = event_new(base, data->pair[0], EV_READ, read_cb, ev_lt); in test_edgetriggered_mix_error()
212 evutil_socket_t *pair = data->pair; in test_edge_triggered_multiple_events() local
224 /* Make pair[1] readable */ in test_edge_triggered_multiple_events()
225 tt_int_op(send(pair[0], &c, 1, 0), >, 0); in test_edge_triggered_multiple_events()
[all …]
/freebsd/contrib/libevent/test/
H A Dregress_et.c83 evutil_socket_t *pair = data->pair; in test_edgetriggered() local
97 tt_int_op(send(pair[0], test, (int)strlen(test)+1, 0), >, 0); in test_edgetriggered()
98 tt_int_op(shutdown(pair[0], EVUTIL_SHUT_WR), ==, 0); in test_edgetriggered()
106 ev = event_new(base, pair[1], EV_READ|EV_ET|EV_PERSIST, read_cb, &ev); in test_edgetriggered()
111 * will read a single byte from pair[1] in either case. If we're edge in test_edgetriggered()
153 ev_et = event_new(base, data->pair[0], EV_READ|EV_ET, read_cb, ev_et); in test_edgetriggered_mix_error()
155 ev_lt = event_new(base, data->pair[0], EV_READ, read_cb, ev_lt); in test_edgetriggered_mix_error()
212 evutil_socket_t *pair = data->pair; in test_edge_triggered_multiple_events() local
224 /* Make pair[1] readable */ in test_edge_triggered_multiple_events()
225 tt_int_op(send(pair[0], &c, 1, 0), >, 0); in test_edge_triggered_multiple_events()
[all …]
/freebsd/secure/lib/libcrypto/man/man3/
H A DBIO_s_bio.3143 BIO_ctrl_get_read_request, BIO_ctrl_reset_read_request \- BIO pair BIO
168 \&\fBBIO_s_bio()\fR returns the method for a \s-1BIO\s0 pair. A \s-1BIO\s0 pair is a pair of source…
169 BIOs where data written to either half of the pair is buffered and can be read from
174 one half of a \s-1BIO\s0 pair and have all the data processed by the chain under application
192 \&\fBBIO_make_bio_pair()\fR joins two separate BIOs into a connected pair.
195 up any half of the pair will automatically destroy the association.
199 half of the pair will return any pending data or \s-1EOF\s0 when all pending data has
209 \&\fBBIO_set_write_buf_size()\fR to create a connected pair of BIOs \fBbio1\fR, \fBbio2\fR
223 last read attempt at the other half of the \s-1BIO\s0 pair failed due to an
237 Both halves of a \s-1BIO\s0 pair should be freed. That is even if one half is implicit
[all …]
/freebsd/contrib/libfido2/src/
H A Dcbor.c230 struct cbor_pair pair; in cbor_add_bytestring() local
233 memset(&pair, 0, sizeof(pair)); in cbor_add_bytestring()
235 if ((pair.key = cbor_build_string(key)) == NULL || in cbor_add_bytestring()
236 (pair.value = cbor_build_bytestring(value, value_len)) == NULL) { in cbor_add_bytestring()
241 if (!cbor_map_add(item, pair)) { in cbor_add_bytestring()
248 if (pair.key) in cbor_add_bytestring()
249 cbor_decref(&pair.key); in cbor_add_bytestring()
250 if (pair.value) in cbor_add_bytestring()
251 cbor_decref(&pair.value); in cbor_add_bytestring()
259 struct cbor_pair pair; in cbor_add_string() local
[all …]
/freebsd/contrib/llvm-project/libcxx/include/__algorithm/
H A Dminmax.h17 #include <__utility/pair.h>
27 _LIBCPP_NODISCARD inline _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX14 pair<const _Tp&, const…
29 …return __comp(__b, __a) ? pair<const _Tp&, const _Tp&>(__b, __a) : pair<const _Tp&, const _Tp&>(__… in minmax()
33 _LIBCPP_NODISCARD inline _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX14 pair<const _Tp&, const…
41 _LIBCPP_NODISCARD inline _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX14 pair<_Tp, _Tp>
46 return pair<_Tp, _Tp>(*__ret.first, *__ret.second); in minmax()
50 _LIBCPP_NODISCARD inline _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX14 pair<_Tp, _Tp>
/freebsd/contrib/llvm-project/llvm/lib/Target/AMDGPU/
H A DAMDGPUGlobalISelUtils.cpp19 std::pair<Register, unsigned>
31 return std::pair(Register(), Offset); in getBaseWithConstantOffset()
40 return std::pair(Reg, 0); in getBaseWithConstantOffset()
44 return std::pair(Def->getOperand(1).getReg(), Offset); in getBaseWithConstantOffset()
48 return std::pair(Def->getOperand(1).getReg(), Offset); in getBaseWithConstantOffset()
54 return std::pair(Base, Offset); in getBaseWithConstantOffset()
63 return std::pair(Base->getOperand(1).getReg(), Offset); in getBaseWithConstantOffset()
66 return std::pair(Base->getOperand(0).getReg(), Offset); in getBaseWithConstantOffset()
70 return std::pair(Reg, 0); in getBaseWithConstantOffset()

12345678910>>...126