| /dragonfly/crypto/libressl/crypto/asn1/ |
| H A D | x_bignum.c | 71 static int bn_new(ASN1_VALUE **pval, const ASN1_ITEM *it);
72 static void bn_free(ASN1_VALUE **pval, const ASN1_ITEM *it);
73 static void bn_clear(ASN1_VALUE **pval, const ASN1_ITEM *it);
76 const ASN1_ITEM *it);
78 int utype, char *free_cont, const ASN1_ITEM *it);
114 bn_new(ASN1_VALUE **pval, const ASN1_ITEM *it) in bn_new() argument
123 bn_clear(ASN1_VALUE **pval, const ASN1_ITEM *it) in bn_clear() argument
130 bn_free(ASN1_VALUE **pval, const ASN1_ITEM *it) in bn_free() argument
135 bn_clear(pval, it); in bn_free()
166 char *free_content, const ASN1_ITEM *it) in bn_c2i() argument
[all …]
|
| H A D | asn1_item.c | 135 i = ASN1_item_i2d(asn, &str, it); in ASN1_item_digest()
149 ASN1_item_dup(const ASN1_ITEM *it, void *x) in ASN1_item_dup() argument
159 i = ASN1_item_i2d(x, &b, it); in ASN1_item_dup()
165 ret = ASN1_item_d2i(NULL, &p, i, it); in ASN1_item_dup()
335 ASN1_item_verify(const ASN1_ITEM *it, X509_ALGOR *a, in ASN1_item_verify() argument
367 ret = pkey->ameth->item_verify(&ctx, it, asn, a, in ASN1_item_verify()
398 inl = ASN1_item_i2d(asn, &buf_in, it); in ASN1_item_verify()
587 ret = ASN1_item_d2i(x, &p, len, it); in ASN1_item_d2i_bio()
606 ret = ASN1_item_d2i_bio(it, b, x); in ASN1_item_d2i_fp()
617 n = ASN1_item_i2d(x, &b, it); in ASN1_item_i2d_bio()
[all …]
|
| H A D | x_pubkey.c | 248 long len, const ASN1_ITEM *it) in pubkey_ex_d2i() argument
250 const ASN1_EXTERN_FUNCS *ef = it->funcs; in pubkey_ex_d2i()
287 ef->asn1_ex_free(pval, it); in pubkey_ex_d2i()
305 const ASN1_ITEM *it) in pubkey_ex_i2d() argument
377 return pubkey_ex_i2d(EVP_PKEY_NONE, pval, out, it); in pkey_pubkey_ex_i2d()
464 return pubkey_ex_d2i(EVP_PKEY_RSA, pval, in, len, it); in rsa_pubkey_ex_d2i()
471 return pubkey_ex_i2d(EVP_PKEY_RSA, pval, out, it); in rsa_pubkey_ex_i2d()
554 return pubkey_ex_d2i(EVP_PKEY_DSA, pval, in, len, it); in dsa_pubkey_ex_d2i()
561 return pubkey_ex_i2d(EVP_PKEY_DSA, pval, out, it); in dsa_pubkey_ex_i2d()
645 return pubkey_ex_d2i(EVP_PKEY_EC, pval, in, len, it); in ec_pubkey_ex_d2i()
[all …]
|
| H A D | bio_ndef.c | 84 const ASN1_ITEM *it; member
101 BIO_new_NDEF(BIO *out, ASN1_VALUE *val, const ASN1_ITEM *it) in BIO_new_NDEF() argument
105 const ASN1_AUX *aux = it->funcs; in BIO_new_NDEF()
133 if (aux->asn1_cb(ASN1_OP_STREAM_PRE, &val, it, &sarg) <= 0) in BIO_new_NDEF()
137 ndef_aux->it = it; in BIO_new_NDEF()
164 derlen = ASN1_item_ndef_i2d(ndef_aux->val, NULL, ndef_aux->it); in ndef_prefix()
168 derlen = ASN1_item_ndef_i2d(ndef_aux->val, &p, ndef_aux->it); in ndef_prefix()
221 aux = ndef_aux->it->funcs; in ndef_suffix()
228 &ndef_aux->val, ndef_aux->it, &sarg) <= 0) in ndef_suffix()
231 derlen = ASN1_item_ndef_i2d(ndef_aux->val, NULL, ndef_aux->it); in ndef_suffix()
[all …]
|
| /dragonfly/contrib/gcc-4.7/libstdc++-v3/include/ext/pb_ds/detail/ov_tree_map_/ |
| H A D | debug_fn_imps.hpp | 63 for (const_iterator it = begin(); it != end(); ++it) in assert_iterators() local
66 debug_base::check_key_exists(PB_DS_V2F(*it), __file, __line); in assert_iterators()
67 PB_DS_DEBUG_VERIFY(lower_bound(PB_DS_V2F(*it)) == it); in assert_iterators()
68 const_iterator upper_bound_it = upper_bound(PB_DS_V2F(*it)); in assert_iterators()
70 PB_DS_DEBUG_VERIFY(upper_bound_it == it); in assert_iterators()
73 PB_DS_V2F(*it))); in assert_iterators()
74 prev_it = it; in assert_iterators()
|
| H A D | ov_tree_map_.hpp | 198 it->~value_type(); in ~cond_dtor()
199 ++it; in ~cond_dtor()
260 if (it != end() && !Cmp_Fn::operator()(r_key, PB_DS_V2F(*it))) in operator []()
264 return it->second; in operator []()
280 if (it != end()&& !Cmp_Fn::operator()(r_key, PB_DS_V2F(*it))) in insert()
295 while (it != e_it) in lower_bound()
297 pointer mid_it = it + ((e_it - it) >> 1); in lower_bound()
299 it = ++mid_it; in lower_bound()
303 return it; in lower_bound()
355 erase(iterator it) in erase() argument
[all …]
|
| H A D | erase_fn_imps.hpp | 126 erase_imp(It it) in erase_imp() argument
129 if (it == end()) in erase_imp()
132 PB_DS_CHECK_KEY_EXISTS(PB_DS_V2F(*it)) in erase_imp()
151 if (source_it != it) in erase_imp()
168 _GLIBCXX_DEBUG_ONLY(debug_base::erase_existing(PB_DS_V2F(*it));) in erase_imp()
186 point_iterator it = find(r_key); in erase() local
187 if (it == end()) in erase()
189 erase(it); in erase()
|
| /dragonfly/contrib/gcc-8.0/libstdc++-v3/include/ext/pb_ds/detail/ov_tree_map_/ |
| H A D | debug_fn_imps.hpp | 63 for (const_iterator it = begin(); it != end(); ++it) in assert_iterators() local
66 debug_base::check_key_exists(PB_DS_V2F(*it), __file, __line); in assert_iterators()
67 PB_DS_DEBUG_VERIFY(lower_bound(PB_DS_V2F(*it)) == it); in assert_iterators()
68 const_iterator upper_bound_it = upper_bound(PB_DS_V2F(*it)); in assert_iterators()
70 PB_DS_DEBUG_VERIFY(upper_bound_it == it); in assert_iterators()
73 PB_DS_V2F(*it))); in assert_iterators()
74 prev_it = it; in assert_iterators()
|
| H A D | ov_tree_map_.hpp | 198 it->~value_type(); in ~cond_dtor()
199 ++it; in ~cond_dtor()
260 if (it != end() && !Cmp_Fn::operator()(r_key, PB_DS_V2F(*it))) in operator []()
264 return it->second; in operator []()
280 if (it != end()&& !Cmp_Fn::operator()(r_key, PB_DS_V2F(*it))) in insert()
295 while (it != e_it) in lower_bound()
297 pointer mid_it = it + ((e_it - it) >> 1); in lower_bound()
299 it = ++mid_it; in lower_bound()
303 return it; in lower_bound()
355 erase(iterator it) in erase() argument
[all …]
|
| H A D | erase_fn_imps.hpp | 126 erase_imp(It it) in erase_imp() argument
129 if (it == end()) in erase_imp()
132 PB_DS_CHECK_KEY_EXISTS(PB_DS_V2F(*it)) in erase_imp()
151 if (source_it != it) in erase_imp()
168 _GLIBCXX_DEBUG_ONLY(debug_base::erase_existing(PB_DS_V2F(*it));) in erase_imp()
186 point_iterator it = find(r_key); in erase() local
187 if (it == end()) in erase()
189 erase(it); in erase()
|
| /dragonfly/contrib/gcc-8.0/gcc/ |
| H A D | gcov.c | 358 it != functions.end (); it++) in get_functions_at_location()
665 it != to_unblock.end (); it++) in unblock()
1150 it != functions.end (); it++) in process_all_functions()
1172 it != functions.end (); it++) in process_all_functions()
1269 it != functions.end (); it++) in generate_results()
1311 it != sources.end (); it++) in generate_results()
1361 it != functions.end (); it++) in release_structures()
2576 it != line->branches.end (); it++) in accumulate_line_info()
2591 it != line->blocks.end (); it++) in accumulate_line_info()
2644 it != src->functions.end (); it++) in accumulate_line_counts()
[all …]
|
| /dragonfly/contrib/file/magic/Magdir/ |
| H A D | freebsd | 30 # If it's neither pure nor demand-paged:
32 # if it has the "has run-time loader information" bit set, it's
35 # if it doesn't have that bit set, then:
37 # if it has the "is position-independent" bit set, it's
41 # it's an object file.
43 # If it's pure:
45 # if it has the "has run-time loader information" bit set, it's
46 # a dynamically-linked executable, otherwise it's just an
49 # If it's demand-paged:
57 # it's a dynamically-linked executable);
[all …]
|
| /dragonfly/contrib/binutils-2.34/gold/ |
| H A D | dwarf_reader.cc | 157 ++it) in clear_abbrev_codes()
2066 std::sort(it->second.begin(), it->second.end()); in read_line_mappings()
2166 if ((it == offsets->begin() && offset < it->offset) in offset_to_iterator()
2187 --it; in offset_to_iterator()
2190 --it; in offset_to_iterator()
2197 for (; it != range_end; ++it) in offset_to_iterator()
2242 for (++it; it != offsets->end(); ++it) in do_addr2line()
2244 if (it->offset == offset && it->line_num == -1) in do_addr2line()
2337 for (it = addr2line_cache.begin(); it != addr2line_cache.end(); ++it) in one_addr2line()
2339 if (it->object == object && it->shndx == shndx) in one_addr2line()
[all …]
|
| /dragonfly/contrib/binutils-2.27/gold/ |
| H A D | dwarf_reader.cc | 157 ++it) in clear_abbrev_codes()
2051 std::sort(it->second.begin(), it->second.end()); in read_line_mappings()
2151 if ((it == offsets->begin() && offset < it->offset) in offset_to_iterator()
2172 --it; in offset_to_iterator()
2175 --it; in offset_to_iterator()
2182 for (; it != range_end; ++it) in offset_to_iterator()
2227 for (++it; it != offsets->end(); ++it) in do_addr2line()
2229 if (it->offset == offset && it->line_num == -1) in do_addr2line()
2322 for (it = addr2line_cache.begin(); it != addr2line_cache.end(); ++it) in one_addr2line()
2324 if (it->object == object && it->shndx == shndx) in one_addr2line()
[all …]
|
| /dragonfly/games/fortune/datfiles/ |
| H A D | murphy | 20 (1) If it's green or it wiggles, it's biology.
21 (2) If it stinks, it's chemistry.
22 (3) If it doesn't work, it's physics.
32 (2) If you like it and it's in your size, it doesn't
34 (4) If you like it and it fits, you can't afford it.
35 (5) If you like it, it fits and you can afford it, it
688 If it jams --- force it. If it breaks,
703 If it's clean, it isn't laundry.
868 If it was bad, it'll be back.
1097 nowadays it insists on it.
[all …]
|
| /dragonfly/sys/dev/drm/radeon/ |
| H A D | radeon_vm.c | 332 bo_va->it.last = 0; in radeon_vm_bo_add()
483 if (it && it != &bo_va->it) { in radeon_vm_bo_set_addr()
485 tmp = container_of(it, struct radeon_bo_va, it); in radeon_vm_bo_set_addr()
489 soffset, tmp->bo, tmp->it.start, tmp->it.last); in radeon_vm_bo_set_addr()
496 if (bo_va->it.start || bo_va->it.last) { in radeon_vm_bo_set_addr()
505 tmp->it.start = bo_va->it.start; in radeon_vm_bo_set_addr()
506 tmp->it.last = bo_va->it.last; in radeon_vm_bo_set_addr()
967 nptes = bo_va->it.last - bo_va->it.start + 1; in radeon_vm_bo_update()
1127 if (bo_va->it.start || bo_va->it.last) in radeon_vm_bo_rmv()
1132 if (bo_va->it.start || bo_va->it.last) { in radeon_vm_bo_rmv()
[all …]
|
| /dragonfly/test/testcases/posixipc/common/ |
| H A D | common.c | 138 struct itimerval it; in schedule_post() local
152 bzero(&it, sizeof(it)); in schedule_post()
153 it.it_value.tv_sec = msec / 1000; in schedule_post()
154 it.it_value.tv_usec = (msec % 1000) * 1000; in schedule_post()
155 if (setitimer(ITIMER_REAL, &it, NULL) < 0) { in schedule_post()
165 struct itimerval it; in check_alarm() local
167 bzero(&it, sizeof(it)); in check_alarm()
169 setitimer(ITIMER_REAL, &it, NULL); in check_alarm()
174 if (setitimer(ITIMER_REAL, &it, NULL) < 0) { in check_alarm()
|
| /dragonfly/usr.bin/units/ |
| H A D | README | 5 command. I threw it together in a couple days, but it seems to work,
6 with some restrictions. I have tested it under DOS with Borland C and
11 it can gracefully handle exponents larger than 9 in output
12 it uses 'e' to denote exponentiation in numbers
14 it tries both -s and -es plurals
15 it allows use of * for multiply and ^ for exponentiation in the input
|
| /dragonfly/contrib/tcp_wrappers/ |
| H A D | README.IRIX | 11 to inetd and that's it. With IRIX evil things happen: inetd is too
12 stupid to remember that it is already listening on a port.
14 In order to modify an entry in inetd.conf, first comment it out
22 I find it hard to believe, it but the best thing to do with IRIX is
25 (2) When tcpd is built according to the irix4 Makefile rules, it
31 have spent several hours looking for ways to work around it. No
34 services cannot be wrapped until SGI fixes their system so that it
39 (5) When an IRIX 5.2 system is a NIS client, it can have problems with
45 (6) IRIX 5.2 is not System V.4, and it shows. Do not link with the
49 that it works the way it is supposed to.
|
| /dragonfly/usr.sbin/cron/doc/ |
| H A D | MAIL | 100 I'm not sure if it is in cron (either SysV or BSD ... if it is, I haven't
103 for a period of time; it might also make it a lot more legible.
119 it.
137 to do it that way, you could do it yourself (since users can
197 But it's really
268 use it.
295 people ask for it... >>
369 many people request it, I won't be needing -q as you've defined it.
407 I can see the usefulness; it just doesn't quite seem worth it. >>
417 daemon wakes up, it sees it, and re-reads the crontab files.
[all …]
|
| /dragonfly/contrib/gcc-8.0/libstdc++-v3/include/ext/pb_ds/detail/bin_search_tree_/ |
| H A D | r_erase_fn_imps.hpp | 66 iterator it(p_z); in update_min_max_for_erased_node() local
67 ++it; in update_min_max_for_erased_node()
68 m_p_head->m_p_left = it.m_p_nd; in update_min_max_for_erased_node()
72 iterator it(p_z); in update_min_max_for_erased_node() local
73 --it; in update_min_max_for_erased_node()
74 m_p_head->m_p_right = it.m_p_nd; in update_min_max_for_erased_node()
|
| H A D | erase_fn_imps.hpp | 66 iterator it(p_z); in update_min_max_for_erased_node() local
67 ++it; in update_min_max_for_erased_node()
68 m_p_head->m_p_left = it.m_p_nd; in update_min_max_for_erased_node()
72 iterator it(p_z); in update_min_max_for_erased_node() local
73 --it; in update_min_max_for_erased_node()
74 m_p_head->m_p_right = it.m_p_nd; in update_min_max_for_erased_node()
|
| /dragonfly/contrib/gcc-4.7/libstdc++-v3/include/ext/pb_ds/detail/bin_search_tree_/ |
| H A D | r_erase_fn_imps.hpp | 66 iterator it(p_z); in update_min_max_for_erased_node() local
67 ++it; in update_min_max_for_erased_node()
68 m_p_head->m_p_left = it.m_p_nd; in update_min_max_for_erased_node()
72 iterator it(p_z); in update_min_max_for_erased_node() local
73 --it; in update_min_max_for_erased_node()
74 m_p_head->m_p_right = it.m_p_nd; in update_min_max_for_erased_node()
|
| H A D | erase_fn_imps.hpp | 66 iterator it(p_z); in update_min_max_for_erased_node() local
67 ++it; in update_min_max_for_erased_node()
68 m_p_head->m_p_left = it.m_p_nd; in update_min_max_for_erased_node()
72 iterator it(p_z); in update_min_max_for_erased_node() local
73 --it; in update_min_max_for_erased_node()
74 m_p_head->m_p_right = it.m_p_nd; in update_min_max_for_erased_node()
|
| /dragonfly/contrib/gcc-4.7/libstdc++-v3/include/ext/pb_ds/detail/pat_trie_/ |
| H A D | r_erase_fn_imps.hpp | 66 iterator it(p_z); in update_min_max_for_erased_node() local
67 ++it; in update_min_max_for_erased_node()
68 m_p_head->m_p_left = it.m_p_nd; in update_min_max_for_erased_node()
72 iterator it(p_z); in update_min_max_for_erased_node() local
73 --it; in update_min_max_for_erased_node()
74 m_p_head->m_p_right = it.m_p_nd; in update_min_max_for_erased_node()
|