| /onnv/onnv-gate/usr/src/uts/common/os/ |
| memlist_new.c | 51 memlist_freelist = mlp->next;
65 mlp->next = memlist_freelist;
82 for (mlendp = mlp; mlendp->next != NULL; mlendp = mlendp->next)
85 mlendp->next = memlist_freelist;
104 mlp->next = mlp + 1;
105 mlendp->next = NULL;
108 mlendp->next = memlist_freelist;
130 for (cur = *curmemlistp; cur; cur = cur->next) {
133 new->next = cur
205 struct memlist *prev, *next; local
337 struct memlist *dst, *next; local
[all...] |
| /onnv/onnv-gate/usr/src/lib/libast/common/stdio/ |
| fcloseall.c | 32 Sfpool_t* next; local
42 for(p = &_Sfpool; p; p = next)
43 { /* find the next legitimate pool */
44 for(next = p->next; next; next = next->next)
45 if(next->n_sf > 0
[all...] |
| /onnv/onnv-gate/usr/src/uts/common/io/drm/ |
| drm_linux_list.h | 17 * The above copyright notice and this permission notice (including the next
40 struct list_head *next, *prev; member in struct:list_head
47 (head)->next = head; \
53 (entry)->next = head; \
54 (head)->prev->next = entry; \
59 (entry)->next->prev = (entry)->prev; \
60 (entry)->prev->next = (entry)->next; \
64 for (entry = (head)->next; entry != head; entry = (entry)->next)
[all...] |
| /onnv/onnv-gate/usr/src/uts/intel/io/pci/ |
| pci_memlist.c | 30 * NOTE: We are only using the next-> link. The prev-> link is
51 listp = listp->next;
71 struct memlist *next, *buf; local
73 next = *list;
74 while (next) {
75 buf = next;
76 next = buf->next;
88 struct memlist *prev = 0, *next; local
91 next = *listp
225 struct memlist *prev = 0, *next; local
262 struct memlist *next; local
[all...] |
| /onnv/onnv-gate/usr/src/cmd/bnu/ |
| pkdefs.c | 36 char next[8] ={ 1,2,3,4,5,6,7,0}; /* packet sequence numbers */ variable
|
| /onnv/onnv-gate/usr/src/uts/common/io/mega_sas/ |
| list.h | 53 * sometimes we already know the next/prev entries and we can
59 struct mlist_head *next, *prev; member in struct:mlist_head
70 (ptr)->next = (ptr); (ptr)->prev = (ptr); \
78 * the prev/next entries already!
82 struct mlist_head *next)
84 next->prev = new;
85 new->next = next;
87 prev->next = new;
101 __list_add(new, head, head->next);
[all...] |
| /onnv/onnv-gate/usr/src/uts/common/io/xge/hal/include/ |
| xge-list.h | 34 * @next: Next list item.
40 struct xge_list_t* next; member in struct:xge_list_t
52 header->next = header;
68 return header->next == header;
75 * Returns the next item from the header.
76 * Returns NULL if the next item is header itself
82 xge_assert(header->next != NULL);
85 if(header->next == header)
88 return header->next;
[all...] |
| /onnv/onnv-gate/usr/src/uts/common/io/mr_sas/ |
| mr_sas_list.h | 53 * sometimes we already know the next/prev entries and we can
59 struct mlist_head *next, *prev; member in struct:mlist_head
70 (ptr)->next = (ptr); (ptr)->prev = (ptr); \
78 * the prev/next entries already!
82 struct mlist_head *next)
84 next->prev = new;
85 new->next = next;
87 prev->next = new;
101 __list_add(new, head, head->next);
[all...] |
| /onnv/onnv-gate/usr/src/common/openssl/crypto/pqueue/ |
| pqueue.c | 80 item->next = NULL;
115 pitem *curr, *next; local
123 for(curr = NULL, next = pq->items;
124 next != NULL;
125 curr = next, next = next->next)
127 if (pq_64bit_gt(&(next->priority), &(item->priority)))
129 item->next = next
169 pitem *next, *prev = NULL; local
[all...] |
| /onnv/onnv-gate/usr/src/lib/libntfs/common/include/ntfs/ |
| list.h | 33 * sometimes we already know the next/prev entries and we can
38 struct list_head *next, *prev; member in struct:list_head
47 (ptr)->next = (ptr); (ptr)->prev = (ptr); \
54 * @next:
56 * This is only for internal list manipulation where we know the prev/next
60 struct list_head * prev, struct list_head * next)
62 next->prev = new;
63 new->next = next;
65 prev->next = new
[all...] |
| /onnv/onnv-gate/usr/src/lib/libslp/javalib/com/sun/slp/ |
| ServiceLocationEnumeration.java | 48 Object next() throws ServiceLocationException; method in interface:ServiceLocationEnumeration
|
| /onnv/onnv-gate/usr/src/cmd/mail/ |
| del_recipl.c | 47 if (r->next != (struct recip *)NULL) {
48 for (r = r->next; r != (struct recip *)NULL; ) {
50 r = old->next;
|
| /onnv/onnv-gate/usr/src/uts/common/gssapi/mechs/krb5/mech/ |
| util_set.c | 40 struct _g_set_elt *next; member in struct:_g_set_elt
53 g_set next;
56 next = (*s)->next;
58 *s = next;
74 first->next = *s;
85 for (p=s; *p; p = &((*p)->next)) {
87 g_set_elt next = (*p)->next; local
89 *p = next;
[all...] |
| /onnv/onnv-gate/usr/src/cmd/oamuser/group/ |
| gid.c | 59 gid_t last, next; local
70 if (fscanf(fptr, "%u\n", &next) == EOF) {
76 * 'next' is now the highest allocated gid.
85 if (!isvalidgid(next))
88 if (next <= DEFRID) {
94 if ((gid = next + 1) != last) {
102 last = next;
104 } while (fscanf(fptr, "%u\n", &next) != EOF);
|
| /onnv/onnv-gate/usr/src/lib/libast/common/sfio/ |
| sfraise.c | 38 Sfpool_t *p, *next; local
42 for(p = &_Sfpool; p; p = next)
44 for(next = p->next; next; next = next->next)
45 if(next->n_sf > 0)
65 reg Sfdisc_t *disc, *next, *d local
[all...] |
| /onnv/onnv-gate/usr/src/uts/common/ipp/ipgpc/ |
| table.c | 80 } else if (table[x].next == NULL) {
81 table[x].next = kmem_cache_alloc(ht_node_cache, KM_SLEEP);
82 table[x].next->elements = NULL;
83 table[x].next->next = NULL;
84 table[x].next->key = key;
85 table[x].next->info = 1;
86 (void) ipgpc_list_insert(&table[x].next->elements, id);
88 p = table[x].next;
100 p = p->next;
[all...] |
| /onnv/onnv-gate/usr/src/cmd/isns/isnsd/ |
| isns_cfg.h | 37 struct ctrl_node *next; member in struct:ctrl_node
|
| /onnv/onnv-gate/usr/src/uts/intel/io/drm/ |
| radeon_mem.c | 21 * The above copyright notice and this permission notice (including the next
62 newblock->next = p->next;
64 p->next->prev = newblock;
65 p->next = newblock;
79 newblock->next = p->next;
81 p->next->prev = newblock;
82 p->next = newblock;
98 for (p = heap->next; p != heap; p = p->next)
[all...] |
| i915_mem.c | 18 * next paragraph) shall be included in all copies or substantial portions
85 list[(unsigned)list[i].next].prev = list[i].prev;
86 list[(unsigned)list[i].prev].next = list[i].next;
91 list[i].next = list[nr].next;
92 list[(unsigned)list[nr].next].prev = (unsigned char)i;
93 list[nr].next = (unsigned char)i;
112 newblock->next = p->next;
[all...] |
| /onnv/onnv-gate/usr/src/cmd/mailx/ |
| myfopen.c | 72 newnode->next = (NODE *)NULL;
81 for (tmp = fplist; tmp != (NODE *)NULL; tmp = tmp->next)
97 newnode->next = curptr->next;
98 curptr->next = newnode;
108 for (prev = cur = fplist; cur != (NODE *)NULL; cur = cur->next) {
111 cur = fplist = cur->next;
113 prev->next = cur->next;
114 cur = prev->next ? prev->next : prev
[all...] |
| /onnv/onnv-gate/usr/src/cmd/mdb/common/modules/genunix/ |
| log.c | 39 mblk_t next; local
76 if (mdb_vread(&next, sizeof (next), addr) == -1) {
81 if (mdb_vread(&lctl, sizeof (lctl), (uintptr_t)next.b_rptr) == -1) {
82 mdb_warn("failed to read log_ctl_t at %p", next.b_rptr);
86 if (mdb_vread(&cont, sizeof (cont), (uintptr_t)next.b_cont) == -1) {
87 mdb_warn("failed to read msgb structure at %p", next.b_cont);
97 mdb_printf("%Y %?p ", lctl.ttime, next.b_rptr);
|
| /onnv/onnv-gate/usr/src/cmd/stat/common/ |
| dsr.h | 43 struct list_of_disks *next; /* link to next one */ member in struct:list_of_disks
54 struct mnt_info *next; member in struct:mnt_info
|
| /onnv/onnv-gate/usr/src/lib/gss_mechs/mech_krb5/et/ |
| error_table.h | 17 /*@dependent@*//*@null@*/ struct et_list *next; member in struct:et_list
22 /*@only@*//*@null@*/ struct dynamic_et_list *next; member in struct:dynamic_et_list
|
| /onnv/onnv-gate/usr/src/lib/libbc/libc/gen/common/ |
| exit.c | 33 struct handlers *next; member in struct:handlers
51 _exit_handlers = h->next;
|
| lfind.c | 51 register POINTER next = base + *nelp * width; /* End of table */ local
53 for ( ; base < next; base += width)
|
