Searched refs:curr (Results 1 - 25 of 120) sorted by relevance

12345

/freebsd-11-stable/contrib/gcclibs/libiberty/
H A Dternary.c40 ternary_tree curr, *pcurr; local
45 while ((curr = *pcurr))
48 diff = *s - curr->splitchar;
56 curr->eqkid = (ternary_tree) data;
57 return (PTR) curr->eqkid;
59 pcurr = &(curr->eqkid);
64 pcurr = &(curr->lokid);
69 pcurr = &(curr->hikid);
73 the string, into the tree rooted at curr */
78 curr
113 const ternary_node *curr; local
[all...]
/freebsd-11-stable/contrib/binutils/libiberty/
H A Dternary.c40 ternary_tree curr, *pcurr; local
45 while ((curr = *pcurr))
48 diff = *s - curr->splitchar;
56 curr->eqkid = (ternary_tree) data;
57 return (PTR) curr->eqkid;
59 pcurr = &(curr->eqkid);
64 pcurr = &(curr->lokid);
69 pcurr = &(curr->hikid);
73 the string, into the tree rooted at curr */
78 curr
113 const ternary_node *curr; local
[all...]
/freebsd-11-stable/crypto/heimdal/appl/ftp/common/
H A Dsockbuf.c52 int curr=0; local
55 optlen = sizeof(curr);
56 if(getsockopt(fd, SOL_SOCKET, optname, (void *)&curr, &optlen) == 0) {
57 if(curr >= size) {
/freebsd-11-stable/bin/cp/
H A Dcp.c268 FTSENT *curr; local
283 for (badcp = rval = 0; (curr = fts_read(ftsp)) != NULL; badcp = 0) {
284 switch (curr->fts_info) {
289 curr->fts_path, strerror(curr->fts_errno));
293 warnx("%s: directory causes a cycle", curr->fts_path);
324 if (curr->fts_level == FTS_ROOTLEVEL) {
326 p = strrchr(curr->fts_path, '/');
328 (int)(p - curr->fts_path + 1);
330 if (!strcmp(&curr
[all...]
/freebsd-11-stable/cddl/contrib/opensolaris/lib/libnvpair/
H A Dnvpair_json.c120 nvpair_t *curr; local
125 for (curr = nvlist_next_nvpair(nvl, NULL); curr;
126 curr = nvlist_next_nvpair(nvl, curr)) {
127 data_type_t type = nvpair_type(curr);
134 if (nvlist_print_json_string(fp, nvpair_name(curr)) == -1)
140 char *string = fnvpair_value_string(curr);
152 FPRINTF(fp, "%s", fnvpair_value_boolean_value(curr) ==
158 FPRINTF(fp, "%hhu", fnvpair_value_byte(curr));
[all...]
/freebsd-11-stable/crypto/openssl/crypto/x509v3/
H A Dpcy_tree.c99 X509_POLICY_LEVEL *curr)
106 if (!curr)
107 curr = tree->levels + tree->nlevel;
109 curr++;
111 BIO_printf(err, "Printing Up to Level %ld\n", curr - tree->levels);
112 for (plev = tree->levels; plev != curr; plev++) {
306 static int tree_link_matching_nodes(X509_POLICY_LEVEL *curr, argument
309 X509_POLICY_LEVEL *last = curr - 1;
316 if (!level_add_node(curr, data, node, NULL))
322 if (!level_add_node(curr, dat
98 tree_print(char *str, X509_POLICY_TREE *tree, X509_POLICY_LEVEL *curr) argument
333 tree_link_nodes(X509_POLICY_LEVEL *curr, const X509_POLICY_CACHE *cache) argument
366 tree_add_unmatched(X509_POLICY_LEVEL *curr, const X509_POLICY_CACHE *cache, const ASN1_OBJECT *id, X509_POLICY_NODE *node, X509_POLICY_TREE *tree) argument
393 tree_link_unmatched(X509_POLICY_LEVEL *curr, const X509_POLICY_CACHE *cache, X509_POLICY_NODE *node, X509_POLICY_TREE *tree) argument
428 tree_link_any(X509_POLICY_LEVEL *curr, const X509_POLICY_CACHE *cache, X509_POLICY_TREE *tree) argument
488 tree_prune(X509_POLICY_TREE *tree, X509_POLICY_LEVEL *curr) argument
564 X509_POLICY_LEVEL *curr; local
666 X509_POLICY_LEVEL *curr = tree->levels + 1; local
695 X509_POLICY_LEVEL *curr; local
[all...]
/freebsd-11-stable/stand/libsa/
H A Denvironment.c70 struct env_var *ev, *curr, *last; local
103 for (last = NULL, curr = environ;
104 curr != NULL;
105 last = curr, curr = curr->ev_next) {
107 if (strcmp(ev->ev_name, curr->ev_name) < 0) {
108 if (curr->ev_prev) {
109 curr->ev_prev->ev_next = ev;
113 ev->ev_next = curr;
[all...]
/freebsd-11-stable/crypto/openssl/ssl/
H A Dssl_ciph.c692 static void ll_append_tail(CIPHER_ORDER **head, CIPHER_ORDER *curr, argument
695 if (curr == *tail)
697 if (curr == *head)
698 *head = curr->next;
699 if (curr->prev != NULL)
700 curr->prev->next = curr->next;
701 if (curr->next != NULL)
702 curr->next->prev = curr
709 ll_append_head(CIPHER_ORDER **head, CIPHER_ORDER *curr, CIPHER_ORDER **tail) argument
973 CIPHER_ORDER *head, *tail, *curr, *next, *last; local
1108 CIPHER_ORDER *curr; local
1483 CIPHER_ORDER *co_list = NULL, *head = NULL, *tail = NULL, *curr; local
[all...]
/freebsd-11-stable/crypto/openssh/openbsd-compat/
H A Dgetrrsetbyname.c450 struct dns_query *head, *curr, *prev; local
454 for (i = 1, head = NULL, prev = NULL; i <= count; i++, prev = curr) {
457 curr = calloc(1, sizeof(struct dns_query));
458 if (curr == NULL) {
463 head = curr;
465 prev->next = curr;
474 curr->name = strdup(name);
475 if (curr->name == NULL) {
482 curr->type = _getshort(*cp);
486 curr
497 struct dns_rr *head, *curr, *prev; local
[all...]
/freebsd-11-stable/sys/tools/
H A Dfw_stub.awk102 split(ARGV[i], curr, ":");
103 filenames[num_files] = curr[1];
104 if (length(curr[2]) > 0)
105 shortnames[num_files] = curr[2];
107 shortnames[num_files] = curr[1];
108 if (length(curr[3]) > 0)
109 versions[num_files] = int(curr[3]);
/freebsd-11-stable/sys/contrib/zlib/
H A Dinftrees.c44 unsigned curr; /* number of index bits for current table */ local
151 filled is at next and has curr index bits. The code being used is huff
153 bits off of the bottom. For codes where len is less than drop + curr,
154 those top drop + curr - len bits are incremented through all values to
202 curr = root; /* current table index bits */
232 fill = 1U << curr;
264 next += min; /* here min is 1 << curr */
267 curr = len - drop;
268 left = (int)(1 << curr);
269 while (curr
[all...]
/freebsd-11-stable/contrib/llvm-project/compiler-rt/lib/profile/
H A DGCDAProfiling.c144 struct fn_node* curr = list->head; local
148 while (curr) {
149 next = curr->next;
151 if (curr->id == CURRENT_ID) {
152 if (curr == list->head) {
156 if (curr == list->tail) {
164 free(curr);
166 prev = curr;
169 curr = next;
609 struct fn_node *curr local
630 struct fn_node* curr = flush_fn_list.head; local
653 struct fn_node *curr = reset_fn_list.head; local
[all...]
/freebsd-11-stable/sys/cddl/contrib/opensolaris/uts/common/zmod/
H A Dinftrees.c46 unsigned curr; /* number of index bits for current table */ local
153 filled is at next and has curr index bits. The code being used is huff
155 bits off of the bottom. For codes where len is less than drop + curr,
156 those top drop + curr - len bits are incremented through all values to
207 curr = root; /* current table index bits */
236 fill = 1U << curr;
268 next += min; /* here min is 1 << curr */
271 curr = len - drop;
272 left = (int)(1 << curr);
273 while (curr
[all...]
/freebsd-11-stable/crypto/openssl/crypto/pqueue/
H A Dpqueue.c111 pitem *curr, *next; local
118 for (curr = NULL, next = pq->items;
119 next != NULL; curr = next, next = next->next) {
127 if (curr == NULL)
130 curr->next = item;
140 curr->next = item;
/freebsd-11-stable/lib/libc/sys/
H A D__vdso_gettimeofday.c62 uint32_t curr, gen; local
70 curr = atomic_load_acq_32(&tk->tk_current);
71 th = &tk->tk_th[curr];
88 } while (curr != tk->tk_current || gen == 0 || gen != th->th_gen);
/freebsd-11-stable/sys/compat/linuxkpi/common/include/linux/
H A Dnet_dim.h257 net_dim_stats_compare(struct net_dim_stats *curr, argument
261 return curr->bpms ? NET_DIM_STATS_BETTER :
264 if (IS_SIGNIFICANT_DIFF(curr->bpms, prev->bpms))
265 return (curr->bpms > prev->bpms) ? NET_DIM_STATS_BETTER :
269 return curr->ppms ? NET_DIM_STATS_BETTER :
272 if (IS_SIGNIFICANT_DIFF(curr->ppms, prev->ppms))
273 return (curr->ppms > prev->ppms) ? NET_DIM_STATS_BETTER :
279 if (IS_SIGNIFICANT_DIFF(curr->epms, prev->epms))
280 return (curr->epms < prev->epms) ? NET_DIM_STATS_BETTER :
/freebsd-11-stable/gnu/usr.bin/grep/
H A Dkwset.c381 register struct trie *curr, *fail; local
404 for (i = kwset->mind - 1, curr = kwset->trie; i >= 0; --i)
406 kwset->target[i] = curr->links->label;
407 curr = curr->links->trie;
423 for (curr = last = kwset->trie; curr; curr = curr->next)
426 enqueue(curr
[all...]
/freebsd-11-stable/contrib/gcc/config/ia64/
H A Dunwind-ia64.c165 struct unw_reg_state curr; /* current state */ member in struct:unw_state_record
373 memcpy (rs, &sr->curr, sizeof (*rs));
374 sr->curr.next = rs;
380 struct unw_reg_state *rs = sr->curr.next;
384 memcpy (&sr->curr, rs, sizeof(*rs));
526 reg = sr->curr.reg + save_order[i];
547 regs[0] = sr->curr.reg + UNW_REG_F2;
548 regs[1] = sr->curr.reg + UNW_REG_R4;
549 regs[2] = sr->curr.reg + UNW_REG_B1;
557 spill_next_when (&regs[kind - 1], sr->curr
[all...]
/freebsd-11-stable/contrib/gperf/src/
H A Dpositions.cc113 int curr = *p; local
115 prev = curr;
/freebsd-11-stable/sys/dev/ixgbe/
H A Dixgbe_netmap.c259 union ixgbe_adv_tx_desc *curr = &txr->tx_base[nic_i]; local
279 curr->read.buffer_addr = htole64(paddr);
280 curr->read.olinfo_status = 0;
281 curr->read.cmd_type_len = htole32(len | flags |
417 union ixgbe_adv_rx_desc *curr = &rxr->rx_base[nic_i]; local
418 uint32_t staterr = le32toh(curr->wb.upper.status_error);
422 ring->slot[nm_i].len = le16toh(curr->wb.upper.length) - crclen;
457 union ixgbe_adv_rx_desc *curr = &rxr->rx_base[nic_i]; local
468 curr->wb.upper.status_error = 0;
469 curr
[all...]
/freebsd-11-stable/sys/dev/netmap/
H A Dif_em_netmap.h150 struct e1000_tx_desc *curr = &txr->tx_base[nic_i]; local
159 curr->buffer_addr = htole64(paddr);
166 curr->upper.data = 0;
167 curr->lower.data = htole32(adapter->txd_cmd | len |
240 union e1000_rx_desc_extended *curr = &rxr->rx_base[nic_i]; local
241 uint32_t staterr = le32toh(curr->wb.upper.status_error);
245 ring->slot[nm_i].len = le16toh(curr->wb.upper.length);
272 union e1000_rx_desc_extended *curr = &rxr->rx_base[nic_i]; local
278 curr->read.buffer_addr = htole64(paddr);
284 curr
[all...]
H A Dif_igb_netmap.h121 union e1000_adv_tx_desc *curr = local
137 curr->read.buffer_addr = htole64(paddr);
139 curr->read.olinfo_status =
142 curr->read.cmd_type_len =
222 union e1000_adv_rx_desc *curr = &rxr->rx_base[nic_i]; local
223 uint32_t staterr = le32toh(curr->wb.upper.status_error);
227 ring->slot[nm_i].len = le16toh(curr->wb.upper.length);
252 union e1000_adv_rx_desc *curr = &rxr->rx_base[nic_i]; local
263 curr->wb.upper.status_error = 0;
264 curr
[all...]
H A Dif_lem_netmap.h132 struct e1000_tx_desc *curr = &adapter->tx_desc_base[nic_i]; local
142 curr->buffer_addr = htole64(paddr);
148 curr->upper.data = 0;
149 curr->lower.data = htole32(adapter->txd_cmd | len |
221 struct e1000_rx_desc *curr = &adapter->rx_desc_base[nic_i]; local
222 uint32_t staterr = le32toh(curr->status);
227 len = le16toh(curr->length) - 4; // CRC
264 struct e1000_rx_desc *curr = &adapter->rx_desc_base[nic_i]; local
272 curr->buffer_addr = htole64(paddr);
276 curr
[all...]
/freebsd-11-stable/sys/cddl/contrib/opensolaris/common/nvpair/
H A Dopensolaris_nvpair.c643 i_nvp_t *curr = NVPAIR2I_NVP(nvp); local
647 priv->nvp_list = priv->nvp_last = curr;
649 curr->nvi_prev = priv->nvp_last;
650 priv->nvp_last->nvi_next = curr;
651 priv->nvp_last = curr;
662 i_nvp_t *curr = NVPAIR2I_NVP(nvp); local
667 if (priv->nvp_curr == curr)
668 priv->nvp_curr = curr->nvi_next;
670 if (curr == priv->nvp_list)
671 priv->nvp_list = curr
807 i_nvp_t *curr; local
855 i_nvp_t *curr; local
886 i_nvp_t *curr; local
1438 i_nvp_t *curr; local
1467 i_nvp_t *curr; local
2073 i_nvp_t *curr; local
2334 i_nvp_t *curr; local
2394 i_nvp_t *curr; local
[all...]
/freebsd-11-stable/sys/net/
H A Dnetmap_user.h402 struct win_netmap_fd_list *curr; local
404 for (curr = win_netmap_fd_list_head; curr; curr = curr->next) {
405 if (fd == curr->win_netmap_fd) {
409 curr = calloc(1, sizeof(*curr));
410 curr->next = win_netmap_fd_list_head;
411 curr
419 struct win_netmap_fd_list *curr = win_netmap_fd_list_head; local
439 struct win_netmap_fd_list *curr; local
[all...]

Completed in 147 milliseconds

12345