/illumos-gate/usr/src/uts/common/os/ |
H A D | memlist_new.c | 207 struct memlist *prev, *next; in memlist_add_span() local 235 for (prev = NULL, next = *curmemlistp; next != NULL; in memlist_add_span() 236 prev = next, next = next->ml_next) { in memlist_add_span() 237 if (address > (next->ml_address + next->ml_size)) in memlist_add_span() 247 if ((address + bytes) == next->ml_address) { in memlist_add_span() 250 next->ml_address = address; in memlist_add_span() 251 next->ml_size += bytes; in memlist_add_span() 259 if (address == (next->ml_address + next->ml_size)) { in memlist_add_span() 262 if (next->ml_next) { in memlist_add_span() 267 next->ml_next->ml_address) { in memlist_add_span() [all …]
|
/illumos-gate/usr/src/lib/libdwarf/common/ |
H A D | dwarfstring.c | 270 size_t next = 0; in dwarfstring_append_printf_s() local 281 while (format[next] && format[next] != '%') { in dwarfstring_append_printf_s() 282 ++next; in dwarfstring_append_printf_s() 288 if (!format[next]) { in dwarfstring_append_printf_s() 291 next++; in dwarfstring_append_printf_s() 292 if (format[next] == '-') { in dwarfstring_append_printf_s() 294 next++; in dwarfstring_append_printf_s() 296 numptr = format+next; in dwarfstring_append_printf_s() 301 next = (endptr - format); in dwarfstring_append_printf_s() 302 if (format[next] != 's') { in dwarfstring_append_printf_s() [all …]
|
H A D | pro_alloc.c | 102 lp->next = lp->prev = lp; in _dwarf_p_get_alloc() 107 nextblock = dbglp->next; in _dwarf_p_get_alloc() 110 dbglp->next = lp; in _dwarf_p_get_alloc() 112 lp->next = nextblock; in _dwarf_p_get_alloc() 159 if (lp == lp->next) { in _dwarf_p_dealloc() 162 lp->next = 0; in _dwarf_p_dealloc() 163 } else if (lp->next == lp->prev) { in _dwarf_p_dealloc() 166 memory_list_t * remaining = lp->next; in _dwarf_p_dealloc() 167 remaining->next = remaining; in _dwarf_p_dealloc() 171 lp->prev->next = lp->next; in _dwarf_p_dealloc() [all …]
|
/illumos-gate/usr/src/uts/common/ipp/ipgpc/ |
H A D | table.c | 78 } else if (table[x].next == NULL) { in ht_insert() 79 table[x].next = kmem_cache_alloc(ht_node_cache, KM_SLEEP); in ht_insert() 80 table[x].next->elements = NULL; in ht_insert() 81 table[x].next->next = NULL; in ht_insert() 82 table[x].next->key = key; in ht_insert() 83 table[x].next->info = 1; in ht_insert() 84 (void) ipgpc_list_insert(&table[x].next->elements, id); in ht_insert() 86 p = table[x].next; in ht_insert() 98 p = p->next; in ht_insert() 102 p->next = NULL; in ht_insert() [all …]
|
/illumos-gate/usr/src/uts/common/io/mega_sas/ |
H A D | list.h | 59 struct mlist_head *next, *prev; member 70 (ptr)->next = (ptr); (ptr)->prev = (ptr); \ 82 struct mlist_head *next) in __list_add() argument 84 next->prev = new; in __list_add() 85 new->next = next; in __list_add() 87 prev->next = new; in __list_add() 101 __list_add(new, head, head->next); in mlist_add() 128 struct mlist_head *next) in __list_del() argument 130 next->prev = prev; in __list_del() 131 prev->next = next; in __list_del() [all …]
|
/illumos-gate/usr/src/uts/intel/io/pci/ |
H A D | pci_memlist.c | 74 struct memlist *next, *buf; in pci_memlist_free_all() local 76 next = *list; in pci_memlist_free_all() 77 while (next) { in pci_memlist_free_all() 78 buf = next; in pci_memlist_free_all() 79 next = buf->ml_next; in pci_memlist_free_all() 91 struct memlist *prev = 0, *next; in pci_memlist_insert() local 94 next = *listp; in pci_memlist_insert() 95 while (next && next->ml_address <= addr) { in pci_memlist_insert() 100 if (next->ml_address <= addr && in pci_memlist_insert() 101 next->ml_address + next->ml_size >= addr + size) { in pci_memlist_insert() [all …]
|
/illumos-gate/usr/src/tools/smatch/src/ |
H A D | pre-process.c | 250 token = token->next; in scan_next() 258 struct token *next; in expand_list() local 259 while (!eof_token(next = scan_next(list))) { in expand_list() 260 if (token_type(next) != TOKEN_IDENT || expand_one_symbol(list)) in expand_list() 261 list = &next->next; in expand_list() 270 struct token **p = &prev->next; in collect_arg() 271 struct token *next; in collect_arg() local 274 while (!eof_token(next = scan_next(p))) { in collect_arg() 275 if (next->pos.newline && match_op(next, '#')) { in collect_arg() 276 if (!next->pos.noexpand) { in collect_arg() [all …]
|
H A D | lib.c | 78 token = token->next; in skip_to() 87 bad_token.next = token; in expect() 95 return token->next; in expect() 348 pre_buffer_end->next = begin; in add_pre_buffer() 352 static char **handle_switch_D(char *arg, char **next) in handle_switch_D() argument 358 arg = *++next; in handle_switch_D() 376 return next; in handle_switch_D() 379 static char **handle_switch_E(char *arg, char **next) in handle_switch_E() argument 383 return next; in handle_switch_E() 386 static char **handle_switch_I(char *arg, char **next) in handle_switch_I() argument [all …]
|
H A D | check_zero_to_err_ptr.c | 36 struct expression *next; in next_line_is_if() local 41 next = strip_expr(__next_stmt->if_conditional); in next_line_is_if() 42 while (next->type == EXPR_PREOP && next->op == '!') in next_line_is_if() 43 next = strip_expr(next->unop); in next_line_is_if() 44 if (expr_equiv(expr, next)) in next_line_is_if() 51 struct expression *next; in next_line_checks_IS_ERR() local 63 next = strip_expr(__next_stmt->if_conditional); in next_line_checks_IS_ERR() 64 while (next->type == EXPR_PREOP && next->op == '!') in next_line_checks_IS_ERR() 65 next = strip_expr(next->unop); in next_line_checks_IS_ERR() 66 if (!next || next->type != EXPR_CALL) in next_line_checks_IS_ERR() [all …]
|
H A D | ptrlist.c | 35 } while ((list = list->next) != head); in ptr_list_size() 54 } while ((list = list->next) != head); in ptr_list_empty() 75 } while ((list = list->next) != head); in ptr_list_multiple() 92 list = list->next; in first_ptr_list() 136 } while ((list = list->next) != head); in ptr_list_nth_entry() 170 } while ((list = list->next) != head); in linearize_ptr_list() 191 struct ptr_list *next; in pack_ptr_list() local 193 next = entry->next; in pack_ptr_list() 196 if (next == entry) { in pack_ptr_list() 202 prev->next = next; in pack_ptr_list() [all …]
|
H A D | tokenize.c | 107 static char *charstr(char *ptr, unsigned char c, unsigned char escape, unsigned char next) in charstr() argument 124 if (!isdigit(next)) in charstr() 460 eof_token_entry.next = &eof_token_entry; in mark_eof() 463 end->next = &eof_token_entry; in mark_eof() 474 token->next = NULL; in add_token() 476 stream->tokenlist = &token->next; in add_token() 536 static int get_one_number(int c, int next, stream_t *stream) in get_one_number() argument 544 long class = cclass[next + 1]; in get_one_number() 548 *p++ = next; in get_one_number() 549 next = nextchar(stream); in get_one_number() [all …]
|
H A D | parse.c | 648 struct ident * next; in match_idents() local 655 next = va_arg(args, struct ident *); in match_idents() 656 } while (next && token->ident != next); in match_idents() 659 return next && token->ident == next; in match_idents() 729 (match_op(token->next,';') || match_op(token->next,'{')))) { in struct_union_enum_specifier() 739 token = token->next; in struct_union_enum_specifier() 749 token = parse(token->next, sym); in struct_union_enum_specifier() 770 token = parse(token->next, sym); in struct_union_enum_specifier() 927 struct token *next = token->next; in parse_enum_declaration() local 930 if (match_op(next, '=')) { in parse_enum_declaration() [all …]
|
/illumos-gate/usr/src/uts/common/io/xge/hal/include/ |
H A D | xge-list.h | 40 struct xge_list_t* next; member 52 header->next = header; in xge_list_init() 68 return header->next == header; in xge_list_is_empty() 82 xge_assert(header->next != NULL); in xge_list_first_get() 85 if(header->next == header) in xge_list_first_get() 88 return header->next; in xge_list_first_get() 101 xge_assert(item->next != NULL); in xge_list_remove() 104 item->next->prev = item->prev; in xge_list_remove() 105 item->prev->next = item->next; in xge_list_remove() 107 item->next = item->prev = NULL; in xge_list_remove() [all …]
|
/illumos-gate/usr/src/uts/sun4u/os/ |
H A D | memscrub.c | 248 struct memscrub_page_retire_span *next; member 768 struct memlist *prev, *next; in memscrub_add_span_gen() local 800 for (prev = NULL, next = *list; in memscrub_add_span_gen() 801 next != NULL; in memscrub_add_span_gen() 802 prev = next, next = next->ml_next) { in memscrub_add_span_gen() 803 if (address > (next->ml_address + next->ml_size)) in memscrub_add_span_gen() 813 if ((address + bytes) == next->ml_address) { in memscrub_add_span_gen() 816 next->ml_address = address; in memscrub_add_span_gen() 817 next->ml_size += bytes; in memscrub_add_span_gen() 825 if (address == (next->ml_address + next->ml_size)) { in memscrub_add_span_gen() [all …]
|
/illumos-gate/usr/src/uts/common/io/qede/ |
H A D | qede_list.h | 40 struct qede_list_s *next; member 87 list->next = list; in QEDE_INIT_LIST_HEAD() 96 qede_list_t *next) in qede_list_add() argument 98 next->prev = new; in qede_list_add() 99 new->next = next; in qede_list_add() 101 prev->next = new; in qede_list_add() 107 return (entry->next == entry); in qede_list_empty() 111 qede_list_del(qede_list_t *prev, qede_list_t *next) in qede_list_del() argument 113 next->prev = prev; in qede_list_del() 114 prev->next = next; in qede_list_del() [all …]
|
/illumos-gate/usr/src/uts/common/io/mr_sas/ |
H A D | mr_sas_list.c | 27 struct mlist_head *next) in __list_add() argument 29 next->prev = new; in __list_add() 30 new->next = next; in __list_add() 32 prev->next = new; in __list_add() 46 __list_add(new, head, head->next); in mlist_add() 71 __list_del(struct mlist_head *prev, struct mlist_head *next) in __list_del() argument 73 next->prev = prev; in __list_del() 74 prev->next = next; in __list_del() 84 __list_del(entry->prev, entry->next); in mlist_del_init() 95 return (head->next == head); in mlist_empty() [all …]
|
/illumos-gate/usr/src/cmd/csh/ |
H A D | sh.parse.c | 57 asyntax(lex->next, lex); in alias() 73 p1 = p1->next; in asyntax() 89 for (p = p1; p != p2; p = p->next) in asyn0() 103 if (p->next != p2 && eq(p->next->word, S_AND /* "&"*/)) in asyn0() 104 p = p->next; in asyn0() 114 asyntax(p->next, p2); in asyn0() 137 if (p2 == p1->next) in asyn3() 139 asyn0(p1->next, p2); in asyn3() 155 if (p1->word[0] && eq(p1->word, alout.next->word)) { in asyn3() 156 tchar *cp = alout.next->word; in asyn3() [all …]
|
/illumos-gate/usr/src/uts/common/fs/zfs/ |
H A D | zfs_rlock.c | 291 locked_range_t *next; in rangelock_add_reader() local 317 next = prev; in rangelock_add_reader() 319 next = avl_nearest(tree, where, AVL_AFTER); in rangelock_add_reader() 321 if (next == NULL || off + len <= next->lr_offset) { in rangelock_add_reader() 327 if (off < next->lr_offset) { in rangelock_add_reader() 329 rangelock_new_proxy(tree, off, next->lr_offset - off); in rangelock_add_reader() 339 for (prev = NULL; next; prev = next, next = AVL_NEXT(tree, next)) { in rangelock_add_reader() 340 if (off + len <= next->lr_offset) in rangelock_add_reader() 343 next->lr_offset) { in rangelock_add_reader() 345 ASSERT3U(next->lr_offset, >, in rangelock_add_reader() [all …]
|
/illumos-gate/usr/src/lib/libmapmalloc/common/ |
H A D | textmem.c | 64 struct block *next; member 70 struct page *next; member 118 for (page = memstart; page; page = page->next) { in malloc_unlocked() 119 for (block = page->block; block; block = block->next) { in malloc_unlocked() 138 page->next = memstart; in malloc_unlocked() 142 block->next = 0; in malloc_unlocked() 174 if (block->next && block->next->status == FREE) { in realloc() 175 block->size += block->next->size + HDR_BLOCK; in realloc() 176 block->next = block->next->next; in realloc() 228 newblock->next = block->next; in split() [all …]
|
/illumos-gate/usr/src/lib/gss_mechs/mech_krb5/krb5/asn.1/ |
H A D | asn1buf.c | 72 (*buf)->next = NULL; in asn1buf_create() 79 buf->next = buf->base = code->data; in asn1buf_wrap_data() 86 if (buf->next > buf->bound + 1) return ASN1_OVERRUN; in asn1buf_imbed() 87 subbuf->base = subbuf->next = buf->next; in asn1buf_imbed() 89 if (length > (size_t)(buf->bound + 1 - buf->next)) return ASN1_OVERRUN; in asn1buf_imbed() 104 buf->next = subbuf->bound + 1; in asn1buf_sync() 111 buf->next = subbuf->next; in asn1buf_sync() 124 if (length <= buf->bound - buf->next + 1) in asn1buf_skiptail() 125 buf->next += length; in asn1buf_skiptail() 130 if (buf->bound - buf->next + 1 <= 0) in asn1buf_skiptail() [all …]
|
/illumos-gate/usr/src/cmd/lp/cmd/lpsched/ |
H A D | flt.c | 38 FLT * next; member 85 f->next = Fault_List->next; in add_flt_act() 86 Fault_List->next = f; in add_flt_act() 102 for (f = Fault_List; f->next; f = f->next) in del_flt_act() 103 if (f->next->type == type && f->next->ident == md) in del_flt_act() 105 fp = f->next; in del_flt_act() 106 f->next = f->next->next; in del_flt_act() 126 for (f = Fault_List; f && f->next; f = f->next) in do_flt_acts() 127 if (f->next->ident == md) in do_flt_acts() 129 fp = f->next; in do_flt_acts() [all …]
|
/illumos-gate/usr/src/lib/libresolv2/common/isc/ |
H A D | ev_waits.c | 58 new->next = NULL; in evWaitFor() 60 wl->last->next = new; in evWaitFor() 89 ctx->waitDone.last->next = first; in evDo() 114 prev = this, this = this->next) in evUnwait() 118 prev->next = this->next; in evUnwait() 120 wl->first = this->next; in evUnwait() 133 prev = this, this = this->next) in evUnwait() 137 prev->next = this->next; in evUnwait() 139 ctx->waitDone.first = this->next; in evUnwait() 168 new->next = NULL; in evDefer() [all …]
|
/illumos-gate/usr/src/cmd/powertop/common/ |
H A D | suggestions.c | 96 new->next = NULL; in pt_sugg_add() 98 for (n = sugg; n != NULL; n = n->next) { in pt_sugg_add() 125 for (n = sugg; n->next != NULL; n = n->next) in pt_sugg_add() 128 n->next = new; in pt_sugg_add() 130 new->next = NULL; in pt_sugg_add() 136 new->next = sugg; in pt_sugg_add() 145 new->next = pos; in pt_sugg_add() 147 pos->prev->next = new; in pt_sugg_add() 163 for (n = sugg; n != NULL; n = n->next) { in pt_sugg_remove() 167 if (sugg->next == NULL) { in pt_sugg_remove() [all …]
|
/illumos-gate/usr/src/cmd/gencat/ |
H A D | gencat.c | 78 struct cat_set *next; member 86 struct cat_msg *next; member 176 p->next = NULL; 187 struct cat_set *prev, *next; local 210 current_set->next = first_set; 221 while (current_set->next && current_set->next->set_no < no) 222 current_set = current_set->next; 224 if (current_set->next && current_set->next->set_no == no) { 226 current_set = current_set->next; 232 next = current_set->next; [all …]
|
/illumos-gate/usr/src/lib/libresolv2/include/isc/ |
H A D | list.h | 26 #define LINK(type) struct { type *prev, *next; } 30 (elt)->link.next = (type *)(-1); \ 35 (void *)((elt)->link.next) != (void *)(-1)) 49 (elt)->link.next = (list).head; \ 57 (list).tail->link.next = (elt); \ 61 (elt)->link.next = NULL; \ 68 if ((elt)->link.next != NULL) \ 69 (elt)->link.next->link.prev = (elt)->link.prev; \ 75 (elt)->link.prev->link.next = (elt)->link.next; \ 78 (list).head = (elt)->link.next; \ [all …]
|