/freebsd-10.0-release/contrib/binutils/libiberty/ |
H A D | ternary.c | 40 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-10.0-release/contrib/gcclibs/libiberty/ |
H A D | ternary.c | 40 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-10.0-release/crypto/heimdal/appl/ftp/common/ |
H A D | sockbuf.c | 52 int curr=0; local 55 optlen = sizeof(curr); 56 if(getsockopt(fd, SOL_SOCKET, optname, (void *)&curr, &optlen) == 0) { 57 if(curr >= size) {
|
/freebsd-10.0-release/bin/cp/ |
H A D | cp.c | 264 FTSENT *curr; local 279 for (badcp = rval = 0; (curr = fts_read(ftsp)) != NULL; badcp = 0) { 280 switch (curr->fts_info) { 285 curr->fts_path, strerror(curr->fts_errno)); 289 warnx("%s: directory causes a cycle", curr->fts_path); 320 if (curr->fts_level == FTS_ROOTLEVEL) { 322 p = strrchr(curr->fts_path, '/'); 324 (int)(p - curr->fts_path + 1); 326 if (!strcmp(&curr [all...] |
/freebsd-10.0-release/crypto/openssl/crypto/x509v3/ |
H A D | pcy_tree.c | 97 X509_POLICY_LEVEL *curr) 104 if (!curr) 105 curr = tree->levels + tree->nlevel; 107 curr++; 109 BIO_printf(err, "Printing Up to Level %ld\n", curr - tree->levels); 110 for (plev = tree->levels; plev != curr; plev++) 310 static int tree_link_matching_nodes(X509_POLICY_LEVEL *curr, argument 313 X509_POLICY_LEVEL *last = curr - 1; 322 if (!level_add_node(curr, data, node, NULL)) 329 if (!level_add_node(curr, dat 96 tree_print(char *str, X509_POLICY_TREE *tree, X509_POLICY_LEVEL *curr) argument 340 tree_link_nodes(X509_POLICY_LEVEL *curr, const X509_POLICY_CACHE *cache) argument 374 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 402 tree_link_unmatched(X509_POLICY_LEVEL *curr, const X509_POLICY_CACHE *cache, X509_POLICY_NODE *node, X509_POLICY_TREE *tree) argument 442 tree_link_any(X509_POLICY_LEVEL *curr, const X509_POLICY_CACHE *cache, X509_POLICY_TREE *tree) argument 504 tree_prune(X509_POLICY_TREE *tree, X509_POLICY_LEVEL *curr) argument 589 X509_POLICY_LEVEL *curr; local 699 X509_POLICY_LEVEL *curr = tree->levels + 1; local 730 X509_POLICY_LEVEL *curr; local [all...] |
/freebsd-10.0-release/contrib/less/ |
H A D | line.c | 31 static int curr; /* Index into linebuf */ variable 152 curr = 0; 193 linebuf[curr] = ' '; 196 attr[curr] = AT_NORMAL|AT_HILITE; 198 attr[curr] = AT_NORMAL; 199 curr++; 215 sprintf(linebuf+curr, "%*s ", n, buf); 218 attr[curr+i] = AT_NORMAL; 219 curr += n; 229 linebuf[curr] [all...] |
/freebsd-10.0-release/lib/libstand/ |
H A D | environment.c | 70 struct env_var *ev, *curr, *last; local 95 for (last = NULL, curr = environ; 96 curr != NULL; 97 last = curr, curr = curr->ev_next) { 99 if (strcmp(ev->ev_name, curr->ev_name) < 0) { 100 if (curr->ev_prev) { 101 curr->ev_prev->ev_next = ev; 105 ev->ev_next = curr; [all...] |
/freebsd-10.0-release/crypto/openssl/ssl/ |
H A D | ssl_ciph.c | 665 static void ll_append_tail(CIPHER_ORDER **head, CIPHER_ORDER *curr, argument 668 if (curr == *tail) return; 669 if (curr == *head) 670 *head=curr->next; 671 if (curr->prev != NULL) 672 curr->prev->next=curr->next; 673 if (curr->next != NULL) 674 curr->next->prev=curr 681 ll_append_head(CIPHER_ORDER **head, CIPHER_ORDER *curr, CIPHER_ORDER **tail) argument 929 CIPHER_ORDER *head, *tail, *curr, *next, *last; local 1061 CIPHER_ORDER *curr; local 1367 CIPHER_ORDER *co_list = NULL, *head = NULL, *tail = NULL, *curr; local [all...] |
/freebsd-10.0-release/crypto/openssh/openbsd-compat/ |
H A D | getrrsetbyname.c | 450 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-10.0-release/sys/tools/ |
H A D | fw_stub.awk | 102 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-10.0-release/lib/libz/ |
H A D | inftrees.c | 44 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 204 curr = root; /* current table index bits */ 234 fill = 1U << curr; 266 next += min; /* here min is 1 << curr */ 269 curr = len - drop; 270 left = (int)(1 << curr); 271 while (curr [all...] |
/freebsd-10.0-release/usr.sbin/pkg_install/updating/ |
H A D | main.c | 85 INSTALLEDPORT *curr = (INSTALLEDPORT *) NULL; local 123 if ((curr = (INSTALLEDPORT *) 126 strlcpy(curr->name, *argv, strlen(*argv) + 1); 127 curr->next = head; 128 head = curr; 180 if ((curr = (INSTALLEDPORT *) 185 strlcpy (curr->name, pname, sizeof(curr->name)); 186 curr->next = head; 187 head = curr; [all...] |
/freebsd-10.0-release/contrib/ntp/libntp/ |
H A D | prettydate.c | 33 time_t t, curr; local 38 curr = time(NULL); 39 tm = local ? localtime(&curr) : gmtime(&curr);
|
/freebsd-10.0-release/sys/cddl/contrib/opensolaris/uts/common/zmod/ |
H A D | inftrees.c | 46 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-10.0-release/crypto/openssl/crypto/pqueue/ |
H A D | pqueue.c | 113 pitem *curr, *next; local 121 for(curr = NULL, next = pq->items; 123 curr = next, next = next->next) 132 if (curr == NULL) 135 curr->next = item; 145 curr->next = item;
|
/freebsd-10.0-release/contrib/llvm/lib/Transforms/Scalar/ |
H A D | ADCE.cpp | 68 Instruction* curr = worklist.pop_back_val(); local 69 for (Instruction::op_iterator OI = curr->op_begin(), OE = curr->op_end();
|
/freebsd-10.0-release/lib/libc/sys/ |
H A D | __vdso_gettimeofday.c | 49 uint32_t curr, gen; local 61 curr = tk->tk_current; 63 th = &tk->tk_th[curr]; 76 } while (curr != tk->tk_current || gen == 0 || gen != th->th_gen);
|
/freebsd-10.0-release/sys/cddl/contrib/opensolaris/common/nvpair/ |
H A D | nvpair.c | 342 i_nvp_t *curr = NVPAIR2I_NVP(nvp); local 346 priv->nvp_list = priv->nvp_last = curr; 348 curr->nvi_prev = priv->nvp_last; 349 priv->nvp_last->nvi_next = curr; 350 priv->nvp_last = curr; 361 i_nvp_t *curr = NVPAIR2I_NVP(nvp); local 366 if (priv->nvp_curr == curr) 367 priv->nvp_curr = curr->nvi_next; 369 if (curr == priv->nvp_list) 370 priv->nvp_list = curr 506 i_nvp_t *curr; local 555 i_nvp_t *curr; local 585 i_nvp_t *curr; local 639 i_nvp_t *curr; local 671 i_nvp_t *curr; local 1151 i_nvp_t *curr; local 1180 i_nvp_t *curr; local 1325 i_nvp_t *curr; local 1791 i_nvp_t *curr; local 2051 i_nvp_t *curr; local 2105 i_nvp_t *curr; local [all...] |
/freebsd-10.0-release/gnu/usr.bin/grep/ |
H A D | kwset.c | 381 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-10.0-release/contrib/gcc/config/ia64/ |
H A D | unwind-ia64.c | 165 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 (®s[kind - 1], sr->curr [all...] |
/freebsd-10.0-release/contrib/gperf/src/ |
H A D | positions.cc | 113 int curr = *p; local 115 prev = curr;
|
/freebsd-10.0-release/contrib/apr-util/buckets/ |
H A D | apr_buckets_alloc.c | 176 node_header_t *curr = list->freelist; local 178 while (curr) { 179 if (node == curr) { 182 curr = curr->next;
|
/freebsd-10.0-release/sys/dev/netmap/ |
H A D | if_igb_netmap.h | 153 /* curr is the current slot in the nic ring */ 154 union e1000_adv_tx_desc *curr = local 176 curr->read.buffer_addr = htole64(paddr); 178 curr->read.olinfo_status = 181 curr->read.cmd_type_len = 268 union e1000_adv_rx_desc *curr = &rxr->rx_base[l]; local 269 uint32_t staterr = le32toh(curr->wb.upper.status_error); 273 ring->slot[j].len = le16toh(curr->wb.upper.length); 300 union e1000_adv_rx_desc *curr = &rxr->rx_base[l]; local 315 curr [all...] |
H A D | if_lem_netmap.h | 155 /* curr is the current slot in the nic ring */ 156 struct e1000_tx_desc *curr = &adapter->tx_desc_base[l]; local 175 curr->buffer_addr = htole64(paddr); 178 curr->upper.data = 0; 179 curr->lower.data = 258 struct e1000_rx_desc *curr = &adapter->rx_desc_base[l]; local 259 uint32_t staterr = le32toh(curr->status); 264 len = le16toh(curr->length) - 4; // CRC 297 struct e1000_rx_desc *curr = &adapter->rx_desc_base[l]; local 311 curr [all...] |
/freebsd-10.0-release/sys/cddl/dev/sdt/ |
H A D | sdt.c | 103 struct sdt_provider *curr, *newprov; local 105 TAILQ_FOREACH(curr, &sdt_prov_list, prov_entry) 106 if (strcmp(prov->name, curr->name) == 0) { 108 curr->sdt_refs++; 269 struct sdt_provider *prov, **curr, **begin, **end, *tmp; local 282 for (curr = begin; curr < end; curr++) { 284 if (strcmp(prov->name, (*curr)->name) == 0) {
|