Searched refs:field (Results 1 - 25 of 200) sorted by relevance

12345678

/illumos-gate/usr/src/cmd/sendmail/db/include/
H A Dqueue.h92 #define LIST_NEXT(elm, field) ((elm)->field.le_next)
102 #define LIST_INSERT_AFTER(listelm, elm, field) do { \
103 if (((elm)->field.le_next = (listelm)->field.le_next) != NULL) \
104 (listelm)->field.le_next->field.le_prev = \
105 &(elm)->field.le_next; \
106 (listelm)->field.le_next = (elm); \
107 (elm)->field
[all...]
H A Dshqueue.h62 #define SH_LIST_NEXTP(elm, field, type) \
63 ((struct type *)(((u_int8_t *)(elm)) + (elm)->field.sle_next))
65 #define SH_LIST_NEXT(elm, field, type) \
66 ((elm)->field.sle_next == -1 ? NULL : \
67 ((struct type *)(((u_int8_t *)(elm)) + (elm)->field.sle_next)))
69 #define SH_LIST_PREV(elm, field) \
70 ((ssize_t *)(((u_int8_t *)(elm)) + (elm)->field.sle_prev))
80 * of the next field in the structure.
82 #define SH_LIST_NEXT_TO_PREV(elm, field) \
83 (-(elm)->field
[all...]
H A Ddb_shash.h22 * field: the name of the field by which the "type" structures are linked.
33 #define HASHLOOKUP(begin, type, field, elt, r, n, hash, cmp) do { \
40 r != NULL; r = SH_TAILQ_NEXT(r, field, type)) \
52 * field: the name of the field by which the "type" structures are linked.
57 #define HASHINSERT(begin, type, field, elt, n, hash) do { \
63 SH_TAILQ_INSERT_HEAD(__bucket, elt, field, type); \
71 * field: the name of the field b
[all...]
/illumos-gate/usr/src/lib/krb5/plugins/kdb/db2/libdb2/include/
H A Ddb-queue.h103 #define LIST_INSERT_AFTER(listelm, elm, field) { \
104 if (((elm)->field.le_next = (listelm)->field.le_next) != NULL) \
105 (listelm)->field.le_next->field.le_prev = \
106 &(elm)->field.le_next; \
107 (listelm)->field.le_next = (elm); \
108 (elm)->field.le_prev = &(listelm)->field.le_next; \
111 #define LIST_INSERT_HEAD(head, elm, field) { \
[all...]
/illumos-gate/usr/src/cmd/sendmail/include/sm/
H A Dtailq.h79 #define SM_TAILQ_NEXT(elm, field) ((elm)->field.tqe_next)
83 #define SM_TAILQ_PREV(elm, headname, field) \
84 (*(((struct headname *)((elm)->field.tqe_prev))->tqh_last))
88 #define SM_TAILQ_FOREACH(var, head, field) \
91 (var) = SM_TAILQ_NEXT(var, field))
93 #define SM_TAILQ_FOREACH_REVERSE(var, head, headname, field) \
96 (var) = SM_TAILQ_PREV(var, headname, field))
106 #define SM_TAILQ_INSERT_HEAD(head, elm, field) do { \
107 if (((elm)->field
[all...]
/illumos-gate/usr/src/lib/libsmbfs/smb/
H A Dqueue.h72 #define SLIST_FOREACH(var, head, field) \
75 (var) = SLIST_NEXT((var), field))
81 #define SLIST_INSERT_AFTER(slistelm, elm, field) do { \
82 SLIST_NEXT((elm), field) = SLIST_NEXT((slistelm), field); \
83 SLIST_NEXT((slistelm), field) = (elm); \
86 #define SLIST_INSERT_HEAD(head, elm, field) do { \
87 SLIST_NEXT((elm), field) = SLIST_FIRST((head)); \
91 #define SLIST_NEXT(elm, field) ((elm)->field
[all...]
/illumos-gate/usr/src/cmd/sgs/dump/common/
H A Dfcns.c89 int field; local
94 field = 16;
96 field = 12;
101 field, "Type", field, "Offset",
102 field, "Vaddr", "Paddr");
104 field, "Filesz", field, "Memsz",
105 field, "Flags", "Align");
124 field, EC_WOR
[all...]
/illumos-gate/usr/src/uts/common/io/drm/
H A Dqueue.h160 #define SLIST_FOREACH(var, head, field) \
163 (var) = SLIST_NEXT((var), field))
165 #define SLIST_FOREACH_SAFE(var, head, field, tvar) \
167 (var) && ((tvar) = SLIST_NEXT((var), field), 1); \
170 #define SLIST_FOREACH_PREVPTR(var, varp, head, field) \
173 (varp) = &SLIST_NEXT((var), field))
179 #define SLIST_INSERT_AFTER(slistelm, elm, field) do { \
180 SLIST_NEXT((elm), field) = SLIST_NEXT((slistelm), field); \
181 SLIST_NEXT((slistelm), field)
[all...]
/illumos-gate/usr/src/uts/common/sys/
H A Dqueue.h114 #define QUEUEDEBUG_LIST_INSERT_HEAD(head, elm, field) \
116 (head)->lh_first->field.le_prev != &(head)->lh_first) \
118 #define QUEUEDEBUG_LIST_OP(elm, field) \
119 if ((elm)->field.le_next && \
120 (elm)->field.le_next->field.le_prev != \
121 &(elm)->field.le_next) \
123 if (*(elm)->field.le_prev != (elm)) \
125 #define QUEUEDEBUG_LIST_POSTREMOVE(elm, field) \
126 (elm)->field
[all...]
H A Dmodel.h119 #define STRUCT_FADDR(handle, field) \
121 (void *)&(handle).ptr.m32->field : \
122 &(handle).ptr.m64->field)
124 #define STRUCT_FGET(handle, field) \
126 (handle).ptr.m32->field : \
127 (handle).ptr.m64->field)
129 #define STRUCT_FGETP(handle, field) \
131 (void *)(uintptr_t)(handle).ptr.m32->field : \
132 (handle).ptr.m64->field)
134 #define STRUCT_FSET(handle, field, va
[all...]
/illumos-gate/usr/src/boot/sys/sys/
H A Dqueue.h190 #define SLIST_FOREACH(var, head, field) \
193 (var) = SLIST_NEXT((var), field))
195 #define SLIST_FOREACH_FROM(var, head, field) \
198 (var) = SLIST_NEXT((var), field))
200 #define SLIST_FOREACH_SAFE(var, head, field, tvar) \
202 (var) && ((tvar) = SLIST_NEXT((var), field), 1); \
205 #define SLIST_FOREACH_FROM_SAFE(var, head, field, tvar) \
207 (var) && ((tvar) = SLIST_NEXT((var), field), 1); \
210 #define SLIST_FOREACH_PREVPTR(var, varp, head, field) \
213 (varp) = &SLIST_NEXT((var), field))
[all...]
H A Dstddef.h41 #define offsetof(type, field) __offsetof(type, field)
/illumos-gate/usr/src/lib/scsi/plugins/ses/SUN-Storage-J4500/common/
H A Dloki.c84 char *field; local
135 * fields, where each field can be either a key ("Fan PartNUM") or a
136 * value. If the field length is less than our shortest expected
144 for (field = (char *)stringin + 4;
145 field + fieldlen <= (char *)stringin + len; field += fieldlen) {
146 if (strncmp(field, "Storage J4500", 13) == 0) {
153 field += fieldlen;
154 if (field + fieldlen > (char *)stringin + len)
159 LIBSES_PROP_PART, field, fieldle
[all...]
/illumos-gate/usr/src/uts/common/avs/ns/
H A Dmodel.h128 #define STRUCT_FADDR(handle, field) \
130 (void *)&(handle).ptr.m32->field : \
131 &(handle).ptr.m64->field)
133 #define STRUCT_FGET(handle, field) \
135 (handle).ptr.m32->field : \
136 (handle).ptr.m64->field)
138 #define STRUCT_FGETP(handle, field) \
140 (void *)(handle).ptr.m32->field : \
141 (handle).ptr.m64->field)
143 #define STRUCT_FSET(handle, field, va
[all...]
/illumos-gate/usr/src/lib/libeti/form/common/
H A Dfield.c40 * default field
113 f->type = fsrc->type; /* copy field type */
189 dup_field(FIELD *field, int frow, int fcol) argument
191 /* FIELD * field; field to duplicate */
198 if (field && frow >= 0 && fcol >= 0 && Alloc(f, FIELD)) {
205 f->rows = field->rows;
206 f->cols = field->cols;
207 f->drows = field->drows;
208 f->dcols = field
238 link_field(FIELD *field, int frow, int fcol) argument
[all...]
/illumos-gate/usr/src/uts/common/sys/scsi/impl/
H A Dinquiry.h39 * Minimum inquiry data length (includes up through RDF field)
53 * example the INQUIRY_REVISION_ID field in 'struct scsi_inquiry' is
71 int scsi_ascii_inquiry_len(char *field, size_t length);
/illumos-gate/usr/src/uts/sun4u/starcat/sys/
H A Diosramvar.h118 * Values for the status field
139 #define IOSRAM_GET_HDRFIELD32(softp, field) \
140 (ddi_get32((softp)->handle, &((iosram_hdr_t *)(softp)->iosramp)->field))
141 #define IOSRAM_SET_HDRFIELD32(softp, field, val) \
142 (ddi_put32((softp)->handle, &((iosram_hdr_t *)(softp)->iosramp)->field,\
152 * NOTE - Although the unused field may be renamed for some use in the future,
274 #define IOSRAM_STAT(field) iosram_stats.field++
275 #define IOSRAM_STAT_ADD(field, amount) iosram_stats.field
[all...]
H A Dsc_cvcio.h120 * These macros can be used to determine the offset or size of any field in the
123 #define CVC_CTL_OFFSET(field) offsetof(cvc_ctl_t, field)
124 #define CVC_CTL_SIZE(field) (sizeof (((cvc_ctl_t *)0)->field))
/illumos-gate/usr/src/common/net/wanboot/crypt/
H A Dcmn_test.c67 getxdata(unsigned char *cp, char *field, int len) argument
73 t = xstrtoi(field, 2);
75 field += 2;
/illumos-gate/usr/src/cmd/dtrace/test/tst/common/funcs/
H A Dtst.strtok.d37 /(this->field = strtok(this->str, ",")) == NULL/
44 printf("%s\n", this->field);
48 /(this->field = strtok(NULL, ",")) == NULL/
55 printf("%s\n", this->field);
59 /(this->field = strtok(NULL, ",")) == NULL/
66 printf("%s\n", this->field);
70 /(this->field = strtok(NULL, ",")) == NULL/
77 printf("%s\n", this->field);
83 printf("unexpected field: %s\n", this->field);
[all...]
/illumos-gate/usr/src/cmd/dtrace/test/tst/common/privs/
H A Dtst.getf.ksh30 #define CANREAD(field) \
31 BEGIN { this->fp = getf(0); errmsg = "can't read field"; \
32 printf("field: "); trace(this->fp->field); printf("\n"); }
34 #define CANTREAD(field) \
35 BEGIN { errmsg = ""; this->fp = getf(0); trace(this->fp->field); \
36 printf("\nable to successfully read field!"); exit(1); }
/illumos-gate/usr/src/cmd/filesync/
H A Dbase.c330 char *field = "???"; local
363 field = "keyword";
368 field = gettext(TXT_noargs);
373 field = gettext(TXT_badver);
389 field = "source directory";
399 field = "destination directory";
405 field = "no source directory";
418 field = "missing base";
423 field = "level";
430 field
[all...]
/illumos-gate/usr/src/cmd/mailx/
H A Dcmd2.c611 char field[BUFSIZ]; local
619 istrcpy(field, sizeof (field), *ap);
621 if (member(field, retain))
624 h = hash(field);
630 calloc(strlen(field) + 1, sizeof (char))) == NULL) {
633 strcpy(igp->i_field, field);
677 char **ap, field[BUFSIZ]; local
700 istrcpy(field, sizeof (field), *a
724 char field[BUFSIZ]; local
797 char **ap, field[BUFSIZ]; local
[all...]
/illumos-gate/usr/src/lib/gss_mechs/mech_krb5/krb5/asn.1/
H A Dasn1_encode.c374 const struct field_info *field,
393 assert(a->field != NULL);
394 return encode_a_field(buf, val, a->field, retlen);
433 const struct field_info *field,
441 switch (field->ftype) {
446 retval = asn1_encode_integer(buf, (asn1_intmax) field->dataoff,
459 /* The field holds a pointer to the array of objects. So the
461 field->atype must help us dereference. */
462 dataptr = (const char *)val + field->dataoff;
463 lenptr = (const char *)val + field
432 encode_a_field(asn1buf *buf, const void *val, const struct field_info *field, unsigned int *retlen) argument
[all...]
/illumos-gate/usr/src/uts/common/inet/
H A Dipsec_impl.h142 #define HASH_ITERATE(var, field, table, hash) \
143 var = table[hash].hash_head; var != NULL; var = var->field.hash_next
145 #define HASH_NEXT(var, field) \
146 (var)->field.hash_next
148 #define HASH_INSERT(var, field, table, hash) \
151 (var)->field.hash_next = (table)[hash].hash_head; \
152 (var)->field.hash_pp = &(table)[hash].hash_head; \
154 if ((var)->field.hash_next != NULL) \
155 (var)->field.hash_next->field
[all...]

Completed in 151 milliseconds

12345678