/freebsd-9.3-release/contrib/bind9/lib/dns/ |
H A D | rriterator.c | 43 dns_rriterator_init(dns_rriterator_t *it, dns_db_t *db, dns_dbversion_t *ver, argument 47 it->magic = RRITERATOR_MAGIC; 48 it->db = db; 49 it->dbit = NULL; 50 it->ver = ver; 51 it->now = now; 52 it->node = NULL; 53 result = dns_db_createiterator(it->db, 0, &it->dbit); 56 it 66 dns_rriterator_first(dns_rriterator_t *it) argument 111 dns_rriterator_nextrrset(dns_rriterator_t *it) argument 149 dns_rriterator_next(dns_rriterator_t *it) argument 165 dns_rriterator_pause(dns_rriterator_t *it) argument 171 dns_rriterator_destroy(dns_rriterator_t *it) argument 183 dns_rriterator_current(dns_rriterator_t *it, dns_name_t **name, isc_uint32_t *ttl, dns_rdataset_t **rdataset, dns_rdata_t **rdata) argument [all...] |
/freebsd-9.3-release/contrib/libstdc++/include/ext/pb_ds/detail/list_update_map_/ |
H A D | debug_fn_imps.hpp | 6 // software; you can redistribute it and/or modify it under the terms 11 // This library is distributed in the hope that it will be useful, but 24 // file, or you compile this file and link it with other files to 55 for (const_iterator it = begin(); it != end(); ++it) 57 map_debug_base::check_key_exists(PB_DS_V2F(*it));
|
/freebsd-9.3-release/contrib/libstdc++/include/ext/pb_ds/detail/pat_trie_/ |
H A D | debug_fn_imps.hpp | 6 // software; you can redistribute it and/or modify it under the terms 11 // This library is distributed in the hope that it will be useful, but 24 // file, or you compile this file and link it with other files to 77 for (const_iterator it = begin(); it != end(); ++it) 80 map_debug_base::check_key_exists(PB_DS_V2F(*it)); 81 _GLIBCXX_DEBUG_ASSERT(lower_bound(PB_DS_V2F(*it)) == it); [all...] |
H A D | erase_fn_imps.hpp | 6 // software; you can redistribute it and/or modify it under the terms 11 // This library is distributed in the hope that it will be useful, but 24 // file, or you compile this file and link it with other files to 156 for (typename internal_node::iterator it = 158 it != static_cast<internal_node_pointer>(p_nd)->end(); 159 ++it) 161 node_pointer p_child =* it; 176 erase(const_iterator it) argument 180 if (it 195 erase(iterator it) argument 213 erase(const_reverse_iterator it) argument 232 erase(reverse_iterator it) argument 257 iterator it = begin(); local [all...] |
/freebsd-9.3-release/crypto/openssl/crypto/asn1/ |
H A D | tasn_new.c | 67 static int asn1_item_ex_combine_new(ASN1_VALUE **pval, const ASN1_ITEM *it, 69 static void asn1_item_clear(ASN1_VALUE **pval, const ASN1_ITEM *it); 71 void asn1_primitive_clear(ASN1_VALUE **pval, const ASN1_ITEM *it); 73 ASN1_VALUE *ASN1_item_new(const ASN1_ITEM *it) argument 76 if (ASN1_item_ex_new(&ret, it) > 0) 83 int ASN1_item_ex_new(ASN1_VALUE **pval, const ASN1_ITEM *it) argument 85 return asn1_item_ex_combine_new(pval, it, 0); 88 static int asn1_item_ex_combine_new(ASN1_VALUE **pval, const ASN1_ITEM *it, argument 94 const ASN1_AUX *aux = it->funcs; 104 if (it 220 asn1_item_clear(ASN1_VALUE **pval, const ASN1_ITEM *it) argument 256 const ASN1_ITEM *it = ASN1_ITEM_ptr(tt->item); local 309 ASN1_primitive_new(ASN1_VALUE **pval, const ASN1_ITEM *it) argument 358 asn1_primitive_clear(ASN1_VALUE **pval, const ASN1_ITEM *it) argument [all...] |
H A D | tasn_fre.c | 65 static void asn1_item_combine_free(ASN1_VALUE **pval, const ASN1_ITEM *it, 70 void ASN1_item_free(ASN1_VALUE *val, const ASN1_ITEM *it) argument 72 asn1_item_combine_free(&val, it, 0); 75 void ASN1_item_ex_free(ASN1_VALUE **pval, const ASN1_ITEM *it) argument 77 asn1_item_combine_free(pval, it, 0); 80 static void asn1_item_combine_free(ASN1_VALUE **pval, const ASN1_ITEM *it, argument 86 const ASN1_AUX *aux = it->funcs; 91 if ((it->itype != ASN1_ITYPE_PRIMITIVE) && !*pval) 98 switch (it->itype) { 101 if (it 195 ASN1_primitive_free(ASN1_VALUE **pval, const ASN1_ITEM *it) argument [all...] |
H A D | x_bignum.c | 67 * as a BIGNUM directly. Currently it ignores the sign which isn't a problem 74 static int bn_new(ASN1_VALUE **pval, const ASN1_ITEM *it); 75 static void bn_free(ASN1_VALUE **pval, const ASN1_ITEM *it); 78 const ASN1_ITEM *it); 80 int utype, char *free_cont, const ASN1_ITEM *it); 99 static int bn_new(ASN1_VALUE **pval, const ASN1_ITEM *it) argument 108 static void bn_free(ASN1_VALUE **pval, const ASN1_ITEM *it) argument 112 if (it->size & BN_SENSITIVE) 120 const ASN1_ITEM *it) 141 int utype, char *free_cont, const ASN1_ITEM *it) 119 bn_i2c(ASN1_VALUE **pval, unsigned char *cont, int *putype, const ASN1_ITEM *it) argument 140 bn_c2i(ASN1_VALUE **pval, const unsigned char *cont, int len, int utype, char *free_cont, const ASN1_ITEM *it) argument [all...] |
H A D | tasn_utl.c | 76 int asn1_get_choice_selector(ASN1_VALUE **pval, const ASN1_ITEM *it) argument 78 int *sel = offset2ptr(*pval, it->utype); 87 const ASN1_ITEM *it) 90 sel = offset2ptr(*pval, it->utype); 97 * Do reference counting. The value 'op' decides what to do. if it is +1 103 int asn1_do_lock(ASN1_VALUE **pval, int op, const ASN1_ITEM *it) argument 107 if ((it->itype != ASN1_ITYPE_SEQUENCE) 108 && (it->itype != ASN1_ITYPE_NDEF_SEQUENCE)) 110 aux = it->funcs; 120 fprintf(stderr, "%s: Reference Count: %d\n", it 86 asn1_set_choice_selector(ASN1_VALUE **pval, int value, const ASN1_ITEM *it) argument 129 asn1_get_enc_ptr(ASN1_VALUE **pval, const ASN1_ITEM *it) argument 140 asn1_enc_init(ASN1_VALUE **pval, const ASN1_ITEM *it) argument 151 asn1_enc_free(ASN1_VALUE **pval, const ASN1_ITEM *it) argument 164 asn1_enc_save(ASN1_VALUE **pval, const unsigned char *in, int inlen, const ASN1_ITEM *it) argument 184 asn1_enc_restore(int *len, unsigned char **out, ASN1_VALUE **pval, const ASN1_ITEM *it) argument [all...] |
H A D | x_long.c | 70 static int long_new(ASN1_VALUE **pval, const ASN1_ITEM *it); 71 static void long_free(ASN1_VALUE **pval, const ASN1_ITEM *it); 74 const ASN1_ITEM *it); 76 int utype, char *free_cont, const ASN1_ITEM *it); 95 static int long_new(ASN1_VALUE **pval, const ASN1_ITEM *it) argument 97 *(long *)pval = it->size; 101 static void long_free(ASN1_VALUE **pval, const ASN1_ITEM *it) argument 103 *(long *)pval = it->size; 107 const ASN1_ITEM *it) 118 if (ltmp == it 106 long_i2c(ASN1_VALUE **pval, unsigned char *cont, int *putype, const ASN1_ITEM *it) argument 152 long_c2i(ASN1_VALUE **pval, const unsigned char *cont, int len, int utype, char *free_cont, const ASN1_ITEM *it) argument [all...] |
H A D | tasn_prn.c | 72 const ASN1_ITEM *it, const char *name); 74 int ASN1_item_print(BIO *out, void *fld, int indent, const ASN1_ITEM *it) argument 76 return asn1_item_print_nm(out, fld, indent, it, it->sname); 80 const ASN1_ITEM *it, const char *name) 90 switch (it->itype) { 93 if (it->templates) 94 return ASN1_template_print(out, fld, indent, it->templates); 95 return asn1_primitive_print(out, fld, it->utype, indent, name); 104 it 79 asn1_item_print_nm(BIO *out, void *fld, int indent, const ASN1_ITEM *it, const char *name) argument [all...] |
/freebsd-9.3-release/contrib/libstdc++/include/ext/pb_ds/detail/ov_tree_map_/ |
H A D | cond_dtor.hpp | 6 // software; you can redistribute it and/or modify it under the terms 11 // This library is distributed in the hope that it will be useful, but 24 // file, or you compile this file and link it with other files to 60 iterator it = m_a_vec; 61 while (it != m_r_last_it) 63 it->~value_type(); 64 ++it;
|
H A D | debug_fn_imps.hpp | 6 // software; you can redistribute it and/or modify it under the terms 11 // This library is distributed in the hope that it will be useful, but 24 // file, or you compile this file and link it with other files to 73 for (const_iterator it = begin(); it != end(); ++it) 76 _GLIBCXX_DEBUG_ONLY(map_debug_base::check_key_exists(PB_DS_V2F(*it));) 77 _GLIBCXX_DEBUG_ASSERT(lower_bound(PB_DS_V2F(*it)) == it); [all...] |
/freebsd-9.3-release/contrib/libstdc++/include/ext/pb_ds/detail/tree_policy/ |
H A D | order_statistics_imp.hpp | 6 // software; you can redistribute it and/or modify it under the terms 11 // This library is distributed in the hope that it will be useful, but 24 // file, or you compile this file and link it with other files to 52 node_iterator it = node_begin(); local 56 while (it != end_it) 58 node_iterator l_it = it.get_l_child(); 65 return (*it); 67 it = l_it; 72 it 92 const_node_iterator it = node_begin(); local [all...] |
/freebsd-9.3-release/contrib/libstdc++/include/ext/pb_ds/detail/cc_hash_table_map_/ |
H A D | cmp_fn_imps.hpp | 6 // software; you can redistribute it and/or modify it under the terms 11 // This library is distributed in the hope that it will be useful, but 24 // file, or you compile this file and link it with other files to 64 for (typename Other_Map_Type::const_iterator it = other.begin(); 65 it != other.end(); ++it) 67 const_key_reference r_key = const_key_reference(PB_DS_V2F(*it)); 77 if (p_mapped_value->second != it->second)
|
H A D | info_fn_imps.hpp | 6 // software; you can redistribute it and/or modify it under the terms 11 // This library is distributed in the hope that it will be useful, but 24 // file, or you compile this file and link it with other files to 82 for (typename Other_Map_Type::const_iterator it = other.begin(); 83 it != other.end(); ++it) 85 const_key_reference r_key =(const_key_reference)PB_DS_V2F(*it); 94 if (p_mapped_value->second != it->second)
|
/freebsd-9.3-release/contrib/llvm/lib/Option/ |
H A D | ArgList.cpp | 48 for (iterator it = begin(), ie = end(); it != ie; ) { 49 if ((*it)->getOption().matches(Id)) { 50 it = Args.erase(it); 53 ++it; 60 for (const_reverse_iterator it = rbegin(), ie = rend(); it != ie; ++it) 61 if ((*it) [all...] |
/freebsd-9.3-release/contrib/openbsm/bin/auditdistd/ |
H A D | sigtimedwait.h | 51 struct itimerval it; local 61 timerclear(&it.it_interval); 62 it.it_value.tv_sec = timeout->tv_sec; 63 it.it_value.tv_usec = timeout->tv_nsec / 1000; 64 if (it.it_value.tv_sec == 0 && it.it_value.tv_usec == 0) 65 it.it_value.tv_usec = 1; 66 PJDLOG_VERIFY(setitimer(ITIMER_REAL, &it, NULL) == 0); 74 timerclear(&it.it_interval); 75 timerclear(&it [all...] |
/freebsd-9.3-release/contrib/llvm/lib/Support/ |
H A D | DAGDeltaAlgorithm.cpp | 27 // well formed predicates, this doesn't happen, but it commonly occurs in 129 for (changeset_ty::const_iterator it = S.begin(), 130 ie = S.end(); it != ie; ++it) 131 for (succ_iterator_ty it2 = succ_begin(*it), 132 ie2 = succ_end(*it); it2 != ie2; ++it2) 190 for (changeset_ty::const_iterator it = Changes.begin(), 191 ie = Changes.end(); it != ie; ++it) { 192 Predecessors.insert(std::make_pair(*it, st [all...] |
H A D | DeltaAlgorithm.cpp | 34 for (changeset_ty::const_iterator it = S.begin(), 35 ie = S.end(); it != ie; ++it, ++idx) 36 ((idx < N) ? LHS : RHS).insert(*it); 60 for (changesetlist_ty::const_iterator it = Sets.begin(), 61 ie = Sets.end(); it != ie; ++it) 62 Split(*it, SplitSets); 73 for (changesetlist_ty::const_iterator it = Sets.begin(), 74 ie = Sets.end(); it ! [all...] |
/freebsd-9.3-release/contrib/llvm/tools/clang/lib/Analysis/ |
H A D | CocoaConventions.cpp | 98 StringRef::iterator it = functionName.begin(); local 99 StringRef::iterator start = it; 104 for ( ; it != endI ; ++it) { 106 char ch = *it; 109 if (ch == 'c' && it != start && isLetter(*(it - 1))) 112 ++it; 118 if (it == endI) 123 StringRef suffix = functionName.substr(it [all...] |
/freebsd-9.3-release/contrib/libstdc++/include/ext/pb_ds/detail/splay_tree_/ |
H A D | erase_fn_imps.hpp | 6 // software; you can redistribute it and/or modify it under the terms 11 // This library is distributed in the hope that it will be useful, but 24 // file, or you compile this file and link it with other files to 52 point_iterator it = find(r_key); local 53 if (it == base_type::end()) 55 erase(it); 62 erase(iterator it) argument 65 if (it == base_type::end()) 66 return it; 77 erase(reverse_iterator it) argument 97 iterator it = base_type::begin(); local [all...] |
/freebsd-9.3-release/contrib/llvm/tools/clang/lib/Frontend/ |
H A D | TextDiagnosticBuffer.cpp | 67 for (const_iterator it = err_begin(), ie = err_end(); it != ie; ++it) 69 escapeDiag(it->second, Buf))); 70 for (const_iterator it = warn_begin(), ie = warn_end(); it != ie; ++it) 72 escapeDiag(it->second, Buf))); 73 for (const_iterator it = note_begin(), ie = note_end(); it ! [all...] |
/freebsd-9.3-release/sys/kern/ |
H A D | kern_time.c | 102 void itimer_fire(struct itimer *it); 635 * as a delta, so that it is easy to keep periodic real-time signals from 641 * real time due to interrupt processing in the system, it is possible for 643 * in real time past when it is supposed to occur. It does not suffice, 816 * fix it to have at least minimal value (i.e. if it is less 817 * than the resolution of the clock, round it up.) 834 * it. In this case, carry over (usec - old value) to 837 * that it is called in a context where the timers 838 * on which it i 1009 struct itimer *it; local 1019 struct itimer *it; local 1026 itimer_enter(struct itimer *it) argument 1034 itimer_leave(struct itimer *it) argument 1080 struct itimer *it; local 1199 struct itimer *it; local 1219 struct itimer *it; local 1276 struct itimer *it; local 1317 struct itimer *it; local 1344 struct itimer *it; local 1362 realtimer_create(struct itimer *it) argument 1369 realtimer_delete(struct itimer *it) argument 1386 realtimer_gettime(struct itimer *it, struct itimerspec *ovalue) argument 1407 realtimer_settime(struct itimer *it, int flags, struct itimerspec *value, struct itimerspec *ovalue) argument 1466 struct itimer *it; local 1497 struct itimer *it; local 1541 itimer_fire(struct itimer *it) argument 1604 struct itimer *it; local [all...] |
/freebsd-9.3-release/contrib/bind9/lib/dns/include/dns/ |
H A D | rriterator.h | 78 dns_rriterator_init(dns_rriterator_t *it, dns_db_t *db, 95 dns_rriterator_first(dns_rriterator_t *it); 100 *\li 'it' is a valid, initialized rriterator 108 dns_rriterator_nextrrset(dns_rriterator_t *it); 115 *\li 'it' is a valid, initialized rriterator 123 dns_rriterator_next(dns_rriterator_t *it); 130 *\li 'it' is a valid, initialized rriterator 138 dns_rriterator_current(dns_rriterator_t *it, dns_name_t **name, 157 dns_rriterator_pause(dns_rriterator_t *it); 164 *\li 'it' i [all...] |
/freebsd-9.3-release/contrib/libstdc++/include/ext/pb_ds/detail/ |
H A D | map_debug_base.hpp | 6 // software; you can redistribute it and/or modify it under the terms 11 // This library is distributed in the hope that it will be useful, but 24 // file, or you compile this file and link it with other files to 182 key_set_iterator it = find(r_key); local 183 if (it == m_key_set.end()) 188 m_key_set.erase(it); 262 for (iterator_type it = m_key_set.begin(); it != m_key_set.end(); ++it) 274 key_set_iterator it = m_key_set.begin(); local 317 key_set_iterator it = m_key_set.begin(); local 337 key_set_iterator it = other.m_key_set.begin(); local [all...] |