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

1234567891011>>

/freebsd-current/contrib/ncurses/form/
H A Dfld_pad.c40 | Function : int set_field_pad(FIELD *field, int ch)
42 | Description : Set the pad character used to fill the field. This must
46 | E_BAD_ARGUMENT - invalid field pointer or pad character
50 set_field_pad(FIELD *field, int ch) argument
54 T((T_CALLED("set_field_pad(%p,%d)"), (void *)field, ch));
56 Normalize_Field(field);
59 if (field->pad != ch)
61 field->pad = ch;
62 res = _nc_Synchronize_Attributes(field);
72 | Function : int field_pad(const FIELD *field)
79 field_pad(const FIELD *field) argument
[all...]
H A Dfld_page.c40 | Function : int set_new_page(FIELD *field, bool new_page_flag)
42 | Description : Marks the field as the beginning of a new page of
46 | E_CONNECTED - field is connected
49 set_new_page(FIELD *field, bool new_page_flag) argument
51 T((T_CALLED("set_new_page(%p,%d)"), (void *)field, new_page_flag));
53 Normalize_Field(field);
54 if (field->form)
58 SetStatus(field, _NEWPAGE);
60 ClrStatus(field, _NEWPAGE);
67 | Function : bool new_page(const FIELD *field)
[all...]
H A Dfld_type.c40 | Function : int set_field_type(FIELD *field, FIELDTYPE *type,...)
42 | Description : Associate the specified fieldtype with the field.
43 | Certain field types take additional arguments. Look
44 | at the spec of the field types !
50 set_field_type(FIELD *field, FIELDTYPE *type, ...) argument
56 T((T_CALLED("set_field_type(%p,%p)"), (void *)field, (void *)type));
60 Normalize_Field(field);
61 _nc_Free_Type(field);
63 field->type = type;
64 field
92 field_type(const FIELD *field) argument
[all...]
H A Dfld_max.c40 | Function : int set_max_field(FIELD *field, int maxgrow)
42 | Description : Set the maximum growth for a dynamic field. If maxgrow=0
43 | the field may grow to any possible size.
49 set_max_field(FIELD *field, int maxgrow) argument
51 T((T_CALLED("set_max_field(%p,%d)"), (void *)field, maxgrow));
53 if (!field || (maxgrow < 0))
57 bool single_line_field = Single_Line_Field(field);
61 if (((single_line_field && (maxgrow < field->dcols)) ||
62 (!single_line_field && (maxgrow < field->drows))) &&
63 !Field_Has_Option(field, O_INPUT_LIMI
[all...]
H A Dfld_stat.c40 | Function : int set_field_status(FIELD *field, bool status)
43 | field's primary buffer.
48 set_field_status(FIELD *field, bool status) argument
50 T((T_CALLED("set_field_status(%p,%d)"), (void *)field, status));
52 Normalize_Field(field);
55 SetStatus(field, _CHANGED);
57 ClrStatus(field, _CHANGED);
64 | Function : bool field_status(const FIELD *field)
67 | for that field's primary buffer.
73 field_status(const FIELD *field)
[all...]
H A Dfld_user.c40 | Function : int set_field_userptr(FIELD *field, void *usrptr)
42 | Description : Set the pointer that is reserved in any field to store
48 set_field_userptr(FIELD *field, void *usrptr) argument
50 T((T_CALLED("set_field_userptr(%p,%p)"), (void *)field, (void *)usrptr));
52 Normalize_Field(field)->usrptr = usrptr;
58 | Function : void *field_userptr(const FIELD *field)
60 | Description : Return the pointer that is reserved in any field to
67 field_userptr(const FIELD *field) argument
69 T((T_CALLED("field_userptr(%p)"), (const void *)field));
70 returnVoidPtr(Normalize_Field(field)
[all...]
H A Dfld_move.c40 | Function : int move_field(FIELD *field,int frow, int fcol)
42 | Description : Moves the disconnected field to the new location in
47 | E_CONNECTED - field is connected
50 move_field(FIELD *field, int frow, int fcol) argument
52 T((T_CALLED("move_field(%p,%d,%d)"), (void *)field, frow, fcol));
54 if (!field || (frow < 0) || (fcol < 0))
57 if (field->form)
60 field->frow = (short)frow;
61 field->fcol = (short)fcol;
H A Dfld_info.c40 | Function : int field_info(const FIELD *field,
45 | Description : Retrieve information about the field's creation parameters.
48 | E_BAD_ARGUMENT - invalid field pointer
51 field_info(const FIELD *field, argument
57 (const void *)field,
62 if (!field)
66 *rows = field->rows;
68 *cols = field->cols;
70 *frow = field->frow;
72 *fcol = field
93 dynamic_field_info(const FIELD *field, int *drows, int *dcols, int *maxgrow) argument
[all...]
H A Dfld_just.c40 | Function : int set_field_just(FIELD *field, int just)
42 | Description : Set the field's type of justification.
49 set_field_just(FIELD *field, int just) argument
53 T((T_CALLED("set_field_just(%p,%d)"), (void *)field, just));
60 Normalize_Field(field);
61 if (field->just != just)
63 field->just = (short)just;
64 res = _nc_Synchronize_Attributes(field);
74 | Function : int field_just( const FIELD *field )
76 | Description : Retrieve the field'
81 field_just(const FIELD *field) argument
[all...]
H A Dfld_link.c40 | Function : FIELD *link_field(FIELD *field, int frow, int fcol)
42 | Description : Duplicates the field at the specified position. The
43 | new field shares its buffers with the original one,
50 | Return Values : Pointer to the new field or NULL if failure
53 link_field(FIELD *field, int frow, int fcol) argument
58 T((T_CALLED("link_field(%p,%d,%d)"), (void *)field, frow, fcol));
59 if (field && (frow >= 0) && (fcol >= 0) &&
63 T((T_CREATE("field %p"), (void *)New_Field));
68 New_Field->link = field->link;
69 field
[all...]
H A Dfld_dup.c40 | Function : FIELD *dup_field(FIELD *field, int frow, int fcol)
42 | Description : Duplicates the field at the specified position. All
43 | field attributes and the buffers are copied.
49 | Return Values : Pointer to the new field or NULL if failure
52 dup_field(FIELD *field, int frow, int fcol) argument
57 T((T_CALLED("dup_field(%p,%d,%d)"), (void *)field, frow, fcol));
58 if (field && (frow >= 0) && (fcol >= 0) &&
62 T((T_CREATE("field %p"), (void *)New_Field));
67 New_Field->rows = field->rows;
68 New_Field->cols = field
[all...]
H A Dfld_current.c40 | Function : int set_current_field(FORM * form,FIELD * field)
42 | Description : Set the current field of the form to the specified one.
45 | E_BAD_ARGUMENT - invalid form or field pointer
46 | E_REQUEST_DENIED - field not selectable
48 | E_INVALID_FIELD - current field can't be left
52 set_current_field(FORM *form, FIELD *field) argument
56 T((T_CALLED("set_current_field(%p,%p)"), (void *)form, (void *)field));
57 if (form == 0 || field == 0)
61 else if ((form != field->form) || Field_Is_Not_Selectable(field))
158 field_index(const FIELD *field) argument
[all...]
/freebsd-current/contrib/sendmail/include/sm/
H A Dtailq.h77 #define SM_TAILQ_NEXT(elm, field) ((elm)->field.tqe_next)
81 #define SM_TAILQ_PREV(elm, headname, field) \
82 (*(((struct headname *)((elm)->field.tqe_prev))->tqh_last))
86 #define SM_TAILQ_FOREACH(var, head, field) \
89 (var) = SM_TAILQ_NEXT(var, field))
91 #define SM_TAILQ_FOREACH_REVERSE(var, head, headname, field) \
94 (var) = SM_TAILQ_PREV(var, headname, field))
104 #define SM_TAILQ_INSERT_HEAD(head, elm, field) do { \
105 if (((elm)->field
[all...]
/freebsd-current/contrib/libucl/src/
H A Dtree.h70 #define TREE_DELTA(self, field) \
71 (( (((self)->field.avl_left) ? (self)->field.avl_left->field.avl_height : 0)) \
72 - (((self)->field.avl_right) ? (self)->field.avl_right->field.avl_height : 0))
76 #define TREE_DEFINE(node, field) \
78 static struct node *_HU_FUNCTION(TREE_BALANCE_##node##_##field)(struct node *); \
80 static struct node *_HU_FUNCTION(TREE_ROTL_##node##_##field)(struc
[all...]
/freebsd-current/crypto/heimdal/lib/gssapi/mech/
H A Dmechqueue.h60 #define HEIM_SLIST_INSERT_AFTER(slistelm, elm, field) do { \
61 (elm)->field.sle_next = (slistelm)->field.sle_next; \
62 (slistelm)->field.sle_next = (elm); \
65 #define HEIM_SLIST_INSERT_HEAD(head, elm, field) do { \
66 (elm)->field.sle_next = (head)->slh_first; \
70 #define HEIM_SLIST_REMOVE_HEAD(head, field) do { \
71 (head)->slh_first = (head)->slh_first->field.sle_next; \
74 #define HEIM_SLIST_REMOVE(head, elm, type, field) do { \
76 HEIM_SLIST_REMOVE_HEAD((head), field); \
[all...]
/freebsd-current/crypto/openssh/openbsd-compat/
H A Dsys-queue.h205 #define SLIST_NEXT(elm, field) ((elm)->field.sle_next)
207 #define SLIST_FOREACH(var, head, field) \
210 (var) = SLIST_NEXT(var, field))
212 #define SLIST_FOREACH_SAFE(var, head, field, tvar) \
214 (var) && ((tvar) = SLIST_NEXT(var, field), 1); \
224 #define SLIST_INSERT_AFTER(slistelm, elm, field) do { \
225 (elm)->field.sle_next = (slistelm)->field.sle_next; \
226 (slistelm)->field
[all...]
H A Dsys-tree.h82 #define SPLAY_LEFT(elm, field) (elm)->field.spe_left
83 #define SPLAY_RIGHT(elm, field) (elm)->field.spe_right
88 #define SPLAY_ROTATE_RIGHT(head, tmp, field) do { \
89 SPLAY_LEFT((head)->sph_root, field) = SPLAY_RIGHT(tmp, field); \
90 SPLAY_RIGHT(tmp, field) = (head)->sph_root; \
94 #define SPLAY_ROTATE_LEFT(head, tmp, field) do { \
95 SPLAY_RIGHT((head)->sph_root, field)
[all...]
/freebsd-current/crypto/heimdal/base/
H A Dheimqueue.h59 #define QUEUEDEBUG_HEIM_TAILQ_INSERT_HEAD(head, elm, field) \
61 (head)->tqh_first->field.tqe_prev != &(head)->tqh_first) \
63 #define QUEUEDEBUG_HEIM_TAILQ_INSERT_TAIL(head, elm, field) \
66 #define QUEUEDEBUG_HEIM_TAILQ_OP(elm, field) \
67 if ((elm)->field.tqe_next && \
68 (elm)->field.tqe_next->field.tqe_prev != \
69 &(elm)->field.tqe_next) \
71 if (*(elm)->field.tqe_prev != (elm)) \
73 #define QUEUEDEBUG_HEIM_TAILQ_PREREMOVE(head, elm, field) \
[all...]
/freebsd-current/crypto/heimdal/lib/asn1/
H A Dasn1_queue.h59 #define QUEUEDEBUG_ASN1_TAILQ_INSERT_HEAD(head, elm, field) \
61 (head)->tqh_first->field.tqe_prev != &(head)->tqh_first) \
63 #define QUEUEDEBUG_ASN1_TAILQ_INSERT_TAIL(head, elm, field) \
66 #define QUEUEDEBUG_ASN1_TAILQ_OP(elm, field) \
67 if ((elm)->field.tqe_next && \
68 (elm)->field.tqe_next->field.tqe_prev != \
69 &(elm)->field.tqe_next) \
71 if (*(elm)->field.tqe_prev != (elm)) \
73 #define QUEUEDEBUG_ASN1_TAILQ_PREREMOVE(head, elm, field) \
[all...]
/freebsd-current/sys/sys/
H A Dqueue.h214 #define SLIST_CONCAT(head1, head2, type, field) do { \
220 while (SLIST_NEXT(curelm, field) != NULL) \
221 curelm = SLIST_NEXT(curelm, field); \
222 SLIST_NEXT(curelm, field) = SLIST_FIRST(head2); \
231 #define SLIST_FOREACH(var, head, field) \
234 (var) = SLIST_NEXT((var), field))
236 #define SLIST_FOREACH_FROM(var, head, field) \
239 (var) = SLIST_NEXT((var), field))
241 #define SLIST_FOREACH_SAFE(var, head, field, tvar) \
243 (var) && ((tvar) = SLIST_NEXT((var), field),
[all...]
/freebsd-current/contrib/libevent/compat/sys/
H A Dqueue.h109 #define SLIST_NEXT(elm, field) ((elm)->field.sle_next)
111 #define SLIST_FOREACH(var, head, field) \
114 (var) = SLIST_NEXT(var, field))
123 #define SLIST_INSERT_AFTER(slistelm, elm, field) do { \
124 (elm)->field.sle_next = (slistelm)->field.sle_next; \
125 (slistelm)->field.sle_next = (elm); \
128 #define SLIST_INSERT_HEAD(head, elm, field) do { \
129 (elm)->field
[all...]
/freebsd-current/contrib/ntp/sntp/libevent/compat/sys/
H A Dqueue.h109 #define SLIST_NEXT(elm, field) ((elm)->field.sle_next)
111 #define SLIST_FOREACH(var, head, field) \
114 (var) = SLIST_NEXT(var, field))
123 #define SLIST_INSERT_AFTER(slistelm, elm, field) do { \
124 (elm)->field.sle_next = (slistelm)->field.sle_next; \
125 (slistelm)->field.sle_next = (elm); \
128 #define SLIST_INSERT_HEAD(head, elm, field) do { \
129 (elm)->field
[all...]
/freebsd-current/contrib/libevent/WIN32-Code/
H A Dtree.h75 #define SPLAY_LEFT(elm, field) (elm)->field.spe_left
76 #define SPLAY_RIGHT(elm, field) (elm)->field.spe_right
81 #define SPLAY_ROTATE_RIGHT(head, tmp, field) do { \
82 SPLAY_LEFT((head)->sph_root, field) = SPLAY_RIGHT(tmp, field); \
83 SPLAY_RIGHT(tmp, field) = (head)->sph_root; \
87 #define SPLAY_ROTATE_LEFT(head, tmp, field) do { \
88 SPLAY_RIGHT((head)->sph_root, field)
[all...]
/freebsd-current/contrib/ntp/sntp/libevent/WIN32-Code/
H A Dtree.h75 #define SPLAY_LEFT(elm, field) (elm)->field.spe_left
76 #define SPLAY_RIGHT(elm, field) (elm)->field.spe_right
81 #define SPLAY_ROTATE_RIGHT(head, tmp, field) do { \
82 SPLAY_LEFT((head)->sph_root, field) = SPLAY_RIGHT(tmp, field); \
83 SPLAY_RIGHT(tmp, field) = (head)->sph_root; \
87 #define SPLAY_ROTATE_LEFT(head, tmp, field) do { \
88 SPLAY_RIGHT((head)->sph_root, field)
[all...]
/freebsd-current/contrib/openbsm/compat/
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...]

Completed in 231 milliseconds

1234567891011>>