Home
last modified time | relevance | path

Searched refs:links (Results 1 – 25 of 87) sorted by relevance

1234

/illumos-gate/usr/src/cmd/sendmail/db/db/
H A Ddb_salloc.c38 SH_LIST_ENTRY links; member
60 SH_LIST_INSERT_HEAD(hp, elp, links, __data);
91 elp = SH_LIST_NEXT(elp, links, __data)) {
107 if ((u_int8_t *)rp < (u_int8_t *)&elp->links)
118 (u_int8_t *)&elp->links + SHALLOC_FRAGMENT) {
121 ((u_int8_t *)rp - (u_int8_t *)&elp->links);
135 SH_LIST_REMOVE(elp, links, __data);
136 for (sp = rp; (u_int8_t *)--sp >= (u_int8_t *)&elp->links;)
188 lastp = elp, elp = SH_LIST_NEXT(elp, links, __data))
202 SH_LIST_REMOVE(elp, links, __data);
[all …]
H A Ddb_dispatch.c217 LIST_INSERT_HEAD(&hp->head, elp, links);
243 for (p = hp->head.lh_first; p != NULL; p = p->links.le_next)
265 LIST_REMOVE(p, links);
313 for (p = hp->head.lh_first; p != NULL; p = p->links.le_next)
H A Ddb_am.c82 TAILQ_REMOVE(&dbp->free_queue, dbc, links);
141 TAILQ_INSERT_TAIL(&dbp->active_queue, dbc, links);
195 TAILQ_REMOVE(&dbp->active_queue, dbc, links);
231 TAILQ_INSERT_TAIL(&dbp->free_queue, dbc, links);
257 dbc != NULL; dbc = TAILQ_NEXT(dbc, links)) {
288 TAILQ_REMOVE(&dbp->free_queue, dbc, links);
/illumos-gate/usr/src/tools/smatch/src/
H A Dsmatch_links.c26 static struct smatch_state *alloc_link(struct var_sym_list *links) in alloc_link() argument
36 FOR_EACH_PTR(links, tmp) { in alloc_link()
46 state->data = links; in alloc_link()
72 struct var_sym_list *links; in store_link() local
79 links = clone_var_sym_list(old_state->data); in store_link()
81 links = NULL; in store_link()
83 add_var_sym(&links, link_name, link_sym); in store_link()
84 set_state(link_id, var, sym, alloc_link(links)); in store_link()
89 struct var_sym_list *links; in match_link_modify() local
92 links = sm->state->data; in match_link_modify()
[all …]
H A Dsmatch_param_compare_limit.c38 static struct smatch_state *alloc_link_state(struct string_list *links) in alloc_link_state() argument
48 FOR_EACH_PTR(links, tmp) { in alloc_link_state()
58 state->data = links; in alloc_link_state()
65 struct string_list *links; in merge_links() local
67 links = combine_string_lists(s1->data, s2->data); in merge_links()
68 ret = alloc_link_state(links); in merge_links()
75 struct string_list *links; in save_link_var_sym() local
80 links = clone_str_list(old_state->data); in save_link_var_sym()
82 links = NULL; in save_link_var_sym()
85 insert_string(&links, new); in save_link_var_sym()
[all …]
H A Dsmatch_comparison.c582 static struct smatch_state *alloc_link_state(struct string_list *links) in alloc_link_state() argument
592 FOR_EACH_PTR(links, tmp) { in alloc_link_state()
602 state->data = links; in alloc_link_state()
612 struct string_list *links; in save_start_states() local
632 links = NULL; in save_start_states()
633 insert_string(&links, link); in save_start_states()
634 state = alloc_link_state(links); in save_start_states()
642 struct string_list *links; in merge_links() local
644 links = combine_string_lists(s1->data, s2->data); in merge_links()
645 ret = alloc_link_state(links); in merge_links()
[all …]
/illumos-gate/usr/src/lib/gss_mechs/mech_krb5/krb5/krb/
H A Dwalk_rtree.c129 register int i, links = 0; in krb5_walk_realm_tree() local
185 links = 0; in krb5_walk_realm_tree()
187 while(cap_nodes[links]) { in krb5_walk_realm_tree()
188 links++; in krb5_walk_realm_tree()
191 if (cap_nodes[links] != NULL) in krb5_walk_realm_tree()
192 krb5_xfree(cap_nodes[links]); in krb5_walk_realm_tree()
194 cap_nodes[links] = cap_server; /* put server on end of list */ in krb5_walk_realm_tree()
197 links++; /* count the null entry at end */ in krb5_walk_realm_tree()
248 links = 1; in krb5_walk_realm_tree()
250 links = 2; in krb5_walk_realm_tree()
[all …]
/illumos-gate/usr/src/cmd/sendmail/db/xa/
H A Dxa_map.c57 for (; env != NULL; env = TAILQ_NEXT(env, links))
59 TAILQ_REMOVE(&DB_GLOBAL(db_envq), env, links);
60 TAILQ_INSERT_HEAD(&DB_GLOBAL(db_envq), env, links);
123 td = SH_TAILQ_NEXT(td, links, __txn_detail))
150 TAILQ_INSERT_HEAD(&DB_GLOBAL(db_envq), env, links);
168 e = TAILQ_NEXT(e, links));
173 TAILQ_REMOVE(&DB_GLOBAL(db_envq), e, links);
255 TAILQ_INSERT_HEAD(&DB_GLOBAL(db_nameq), entry, links);
274 np = TAILQ_NEXT(np, links)) {
296 next = TAILQ_NEXT(np, links);
[all …]
/illumos-gate/usr/src/cmd/sendmail/db/lock/
H A Dlock.c182 HASHLOOKUP(lt->hashtab, __db_lockobj, links,
210 SH_TAILQ_REMOVE(&sh_obj->holders, lp, links,
214 lp, links, __db_lock);
403 SH_TAILQ_REMOVE(&sh_obj->holders, lockp, links, __db_lock);
410 links, sh_obj, lt->region->table_size, __lock_lhash);
414 SH_TAILQ_INSERT_HEAD(&lt->region->free_objs, sh_obj, links,
421 SH_TAILQ_INSERT_HEAD(&lt->region->free_locks, lockp, links, __db_lock);
470 SH_TAILQ_REMOVE(&lrp->free_locks, newl, links, __db_lock);
510 lp = SH_TAILQ_NEXT(lp, links, __db_lock)) {
525 newl, links, __db_lock);
[all …]
H A Dlock_region.c242 SH_TAILQ_INSERT_HEAD(tq_head, lp, links, __db_lock);
251 SH_TAILQ_INSERT_HEAD(obj_head, op, links, __db_lockobj);
444 SH_TAILQ_INSERT_HEAD(lock_head, newl, links, __db_lock);
451 SH_TAILQ_INSERT_HEAD(obj_head, op, links, __db_lockobj);
525 newl = SH_TAILQ_NEXT(newl, links, __db_lock))
541 obj = SH_TAILQ_NEXT(obj, links, __db_lockobj))
624 op = SH_TAILQ_NEXT(op, links, __db_lockobj)) {
651 lp = SH_TAILQ_NEXT(lp, links, __db_lock))
659 op = SH_TAILQ_NEXT(op, links, __db_lockobj))
712 lp = SH_TAILQ_NEXT(lp, links, __db_lock))
[all …]
H A Dlock_deadlock.c270 op != NULL; op = SH_TAILQ_NEXT(op, links, __db_lockobj))
280 op != NULL; op = SH_TAILQ_NEXT(op, links, __db_lockobj)) {
291 lp = SH_TAILQ_NEXT(lp, links, __db_lock)) {
317 lp = SH_TAILQ_NEXT(lp, links, __db_lock)) {
442 links, lockerp, lt->region->table_size, __lock_lhash);
444 lockerp, links, __db_lockobj);
456 SH_TAILQ_REMOVE(&sh_obj->waiters, lockp, links, __db_lock);
/illumos-gate/usr/src/psm/stand/boot/sparc/common/
H A Dsun4u_memlist.c80 size_t links; in fill_memlists() local
110 if ((links = prom_getproplen(node, prop)) == -1) in fill_memlists()
112 if (links > sizeof (scratch_memlist)) { in fill_memlists()
117 links = links / sizeof (struct sun4u_prom_memlist); in fill_memlists()
121 sort_reglist(pm, links); in fill_memlists()
122 al = reg_to_list(pm, links, old); in fill_memlists()
/illumos-gate/usr/src/tools/smatch/src/smatch_scripts/
H A Dcall_tree.pl54 foreach my $l (@{%{$param_map{$link}}->{links}}){
72 foreach my $link (@{%{$param_map{$start_func}}->{links}}){
74 foreach my $l (@{%{$param_map{$start_func}}->{links}}){
89 $param_map{$one} = {found => $UNKNOWN, links => []};
91 push @{$param_map{$one}->{links}}, $two;
H A Dfollow_params.pl37 foreach my $l (@{$param_map{$link}{links}}){
57 $param_map{$one} = {used => $UNUSED, links => []};
59 push @{$param_map{$one}{links}}, $two;
H A Dtrace_params.pl40 foreach my $l (@{$param_map{$link}->{links}}){
68 $param_map{$one} = {found => $UNKNOWN, links => []};
70 push @{$param_map{$one}->{links}}, $two;
/illumos-gate/usr/src/cmd/sendmail/db/btree/
H A Dbt_curadj.c40 dbc != NULL; dbc = TAILQ_NEXT(dbc, links)) {
91 dbc != NULL; dbc = TAILQ_NEXT(dbc, links)) {
133 dbc != NULL; dbc = TAILQ_NEXT(dbc, links)) {
169 dbc != NULL; dbc = TAILQ_NEXT(dbc, links)) {
209 dbc != NULL; dbc = TAILQ_NEXT(dbc, links)) {
250 dbc != NULL; dbc = TAILQ_NEXT(dbc, links)) {
/illumos-gate/usr/src/cmd/abi/appcert/scripts/
H A Dabi_index.pl375 my $links;
377 $links = "${path}$symlink{$inode}";
379 $links = "$path";
383 my (@n) = split(/:/, $links);
399 print STDOUT "$abi|$path|$defn|$n|$links\n";
/illumos-gate/usr/src/data/ucode/
H A Dupdate.intel29 LINKSF=intel/Makefile.links
91 typeset -A links
98 links[$bf]=${inodes[$inode]}
/illumos-gate/usr/src/data/zoneinfo/
H A Dupdate_manifest48 typeset -A links
76 links[$osrc]="$r$tgt"
H A Dbackward1 # tzdb links for backward compatibility
6 # This file provides links from old or merged timezone names to current ones.
20 # .zi parsers (including tzcode through 2022e) mishandle links to links.
22 # so that data could contain links to links. For example, the line
25 # refrain from linking to links like Australia/Canberra, which means
26 # the Australia/ACT line links instead to Australia/Sydney,
/illumos-gate/usr/src/cmd/sendmail/db/txn/
H A Dtxn.c337 SH_TAILQ_INSERT_HEAD(&mgr->region->active_txn, td, links, __txn_detail);
361 TAILQ_INSERT_TAIL(&mgr->txn_chain, txn, links);
644 tp, links, __txn_detail);
668 TAILQ_REMOVE(&mgr->txn_chain, txnp, links);
806 txnp = SH_TAILQ_NEXT(txnp, links, __txn_detail)) {
964 txnp = SH_TAILQ_NEXT(txnp, links, __txn_detail)) {
1003 tp, links, __txn_detail);
1012 TAILQ_REMOVE(&mgr->txn_chain, kids, links);
/illumos-gate/usr/src/cmd/sendmail/db/include/
H A Dlock.h83 SH_TAILQ_ENTRY links; /* Links for free list. */ member
139 SH_TAILQ_ENTRY links; /* Free or holder/waiter list. */ member
H A Ddb_dispatch.h59 LIST_ENTRY(__db_txnlist) links;
/illumos-gate/usr/src/cmd/cmd-inet/lib/nwamd/
H A DREADME139 o dlpi threads: used to monitor for DL_NOTE_LINK messages on links
261 from activating (as less-prioritized links).
277 WiFi links present a problem however. On the one hand, we want them
283 WiFi links of the same or lower (more preferred) priority group will always
314 So such links - if they are higher in the priority grouping than the
318 Wired links that do not support DL_NOTE_LINK_UP/DOWN are problematic,
391 IP interface NCUs interit their activation from the links below them,
407 Starting from the lowest priority grouping value, assess all links
419 wired links that do not do DL_NOTE_LINK_UP/DOWN will never
420 fail. If such links wish to be skipped, their priority group value
[all …]
/illumos-gate/usr/src/data/ucode/intel/
H A DMakefile22 include Makefile.links

1234