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

1234567891011>>

/freebsd-10-stable/contrib/ncurses/form/
H A Dfld_pad.c39 | Function : int set_field_pad(FIELD *field, int ch)
41 | Description : Set the pad character used to fill the field. This must
45 | E_BAD_ARGUMENT - invalid field pointer or pad character
49 set_field_pad(FIELD *field, int ch) argument
53 T((T_CALLED("set_field_pad(%p,%d)"), field, ch));
55 Normalize_Field(field);
58 if (field->pad != ch)
60 field->pad = ch;
61 res = _nc_Synchronize_Attributes(field);
71 | Function : int field_pad(const FIELD *field)
78 field_pad(const FIELD *field) argument
[all...]
H A Dfld_page.c39 | Function : int set_new_page(FIELD *field, bool new_page_flag)
41 | Description : Marks the field as the beginning of a new page of
45 | E_CONNECTED - field is connected
48 set_new_page(FIELD *field, bool new_page_flag) argument
50 T((T_CALLED("set_new_page(%p,%d)"), field, new_page_flag));
52 Normalize_Field(field);
53 if (field->form)
57 field->status |= _NEWPAGE;
59 field->status &= ~_NEWPAGE;
66 | Function : bool new_page(const FIELD *field)
[all...]
H A Dfld_max.c39 | Function : int set_max_field(FIELD *field, int maxgrow)
41 | Description : Set the maximum growth for a dynamic field. If maxgrow=0
42 | the field may grow to any possible size.
48 set_max_field(FIELD *field, int maxgrow) argument
50 T((T_CALLED("set_max_field(%p,%d)"), field, maxgrow));
52 if (!field || (maxgrow < 0))
56 bool single_line_field = Single_Line_Field(field);
60 if ((single_line_field && (maxgrow < field->dcols)) ||
61 (!single_line_field && (maxgrow < field->drows)))
64 field
[all...]
H A Dfld_type.c39 | Function : int set_field_type(FIELD *field, FIELDTYPE *type,...)
41 | Description : Associate the specified fieldtype with the field.
42 | Certain field types take additional arguments. Look
43 | at the spec of the field types !
49 set_field_type(FIELD *field, FIELDTYPE *type,...) argument
55 T((T_CALLED("set_field_type(%p,%p)"), field, type));
59 Normalize_Field(field);
60 _nc_Free_Type(field);
62 field->type = type;
63 field
91 field_type(const FIELD *field) argument
[all...]
H A Dfld_stat.c39 | Function : int set_field_status(FIELD *field, bool status)
47 set_field_status(FIELD *field, bool status) argument
49 T((T_CALLED("set_field_status(%p,%d)"), field, status));
51 Normalize_Field(field);
54 field->status |= _CHANGED;
56 field->status &= ~_CHANGED;
63 | Function : bool field_status(const FIELD *field)
72 field_status(const FIELD *field)
74 T((T_CALLED("field_status(%p)"), field));
76 returnBool((Normalize_Field(field)
[all...]
H A Dfld_move.c39 | Function : int move_field(FIELD *field,int frow, int fcol)
41 | Description : Moves the disconnected field to the new location in
46 | E_CONNECTED - field is connected
49 move_field(FIELD *field, int frow, int fcol) argument
51 T((T_CALLED("move_field(%p,%d,%d)"), field, frow, fcol));
53 if (!field || (frow < 0) || (fcol < 0))
56 if (field->form)
59 field->frow = frow;
60 field->fcol = fcol;
H A Dfld_user.c39 | Function : int set_field_userptr(FIELD *field, void *usrptr)
41 | Description : Set the pointer that is reserved in any field to store
47 set_field_userptr(FIELD *field, void *usrptr) argument
49 T((T_CALLED("set_field_userptr(%p,%p)"), field, usrptr));
51 Normalize_Field(field)->usrptr = usrptr;
57 | Function : void *field_userptr(const FIELD *field)
59 | Description : Return the pointer that is reserved in any field to
66 field_userptr(const FIELD *field) argument
68 T((T_CALLED("field_userptr(%p)"), field));
69 returnVoidPtr(Normalize_Field(field)
[all...]
H A Dfld_info.c39 | Function : int field_info(const FIELD *field,
47 | E_BAD_ARGUMENT - invalid field pointer
50 field_info(const FIELD *field, argument
56 field,
61 if (!field)
65 *rows = field->rows;
67 *cols = field->cols;
69 *frow = field->frow;
71 *fcol = field->fcol;
73 *nrow = field
92 dynamic_field_info(const FIELD *field, int *drows, int *dcols, int *maxgrow) argument
[all...]
H A Dfld_just.c39 | Function : int set_field_just(FIELD *field, int just)
48 set_field_just(FIELD *field, int just) argument
52 T((T_CALLED("set_field_just(%p,%d)"), field, just));
59 Normalize_Field(field);
60 if (field->just != just)
62 field->just = just;
63 res = _nc_Synchronize_Attributes(field);
73 | Function : int field_just( const FIELD *field )
80 field_just(const FIELD *field) argument
82 T((T_CALLED("field_just(%p)"), field));
[all...]
H A Dfld_link.c39 | Function : FIELD *link_field(FIELD *field, int frow, int fcol)
41 | Description : Duplicates the field at the specified position. The
42 | new field shares its buffers with the original one,
49 | Return Values : Pointer to the new field or NULL if failure
52 link_field(FIELD *field, int frow, int fcol) argument
57 T((T_CALLED("link_field(%p,%d,%d)"), field, frow, fcol));
58 if (field && (frow >= 0) && (fcol >= 0) &&
62 T((T_CREATE("field %p"), New_Field));
67 New_Field->link = field->link;
68 field
[all...]
H A Dfld_dup.c39 | Function : FIELD *dup_field(FIELD *field, int frow, int fcol)
41 | Description : Duplicates the field at the specified position. All
42 | field attributes and the buffers are copied.
48 | Return Values : Pointer to the new field or NULL if failure
51 dup_field(FIELD *field, int frow, int fcol) argument
56 T((T_CALLED("dup_field(%p,%d,%d)"), field, frow, fcol));
57 if (field && (frow >= 0) && (fcol >= 0) &&
61 T((T_CREATE("field %p"), New_Field));
66 New_Field->rows = field->rows;
67 New_Field->cols = field
[all...]
H A Dfld_current.c39 | Function : int set_current_field(FORM * form,FIELD * field)
41 | Description : Set the current field of the form to the specified one.
44 | E_BAD_ARGUMENT - invalid form or field pointer
45 | E_REQUEST_DENIED - field not selectable
47 | E_INVALID_FIELD - current field can't be left
51 set_current_field(FORM *form, FIELD *field) argument
55 T((T_CALLED("set_current_field(%p,%p)"), form, field));
56 if (form == 0 || field == 0)
60 else if ((form != field->form) || Field_Is_Not_Selectable(field))
131 field_index(const FIELD *field) argument
[all...]
/freebsd-10-stable/contrib/groff/tmac/
H A Dhyphenex.pl49 @field = split(' ');
50 if ($field[0] eq "\\1" || $field[0] eq "\\4") {
51 print " $field[2]\n";
53 elsif ($field[0] eq "\\2" || $field[0] eq "\\5") {
54 print " $field[2]\n";
56 @suffix_list = split(/,/, "$field[3]");
58 print " $field[2]$suffix\n";
61 elsif ($field[
[all...]
/freebsd-10-stable/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-10-stable/contrib/libucl/src/
H A Dtree.h63 #define TREE_DELTA(self, field) \
64 (( (((self)->field.avl_left) ? (self)->field.avl_left->field.avl_height : 0)) \
65 - (((self)->field.avl_right) ? (self)->field.avl_right->field.avl_height : 0))
69 #define TREE_DEFINE(node, field) \
71 struct node *TREE_BALANCE_##node##_##field(struct node *); \
73 struct node *TREE_ROTL_##node##_##field(struc
[all...]
/freebsd-10-stable/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-10-stable/contrib/ofed/libcxgb4/src/
H A Dqueue.h191 #define SLIST_FOREACH(var, head, field) \
194 (var) = SLIST_NEXT((var), field))
196 #define SLIST_FOREACH_SAFE(var, head, field, tvar) \
198 (var) && ((tvar) = SLIST_NEXT((var), field), 1); \
201 #define SLIST_FOREACH_PREVPTR(var, varp, head, field) \
204 (varp) = &SLIST_NEXT((var), field))
210 #define SLIST_INSERT_AFTER(slistelm, elm, field) do { \
211 SLIST_NEXT((elm), field) = SLIST_NEXT((slistelm), field); \
212 SLIST_NEXT((slistelm), field)
[all...]
/freebsd-10-stable/contrib/ipfilter/sys/
H A Dtree.h78 #define SPLAY_LEFT(elm, field) (elm)->field.spe_left
79 #define SPLAY_RIGHT(elm, field) (elm)->field.spe_right
84 #define SPLAY_ROTATE_RIGHT(head, tmp, field) do { \
85 SPLAY_LEFT((head)->sph_root, field) = SPLAY_RIGHT(tmp, field); \
86 SPLAY_RIGHT(tmp, field) = (head)->sph_root; \
90 #define SPLAY_ROTATE_LEFT(head, tmp, field) do { \
91 SPLAY_RIGHT((head)->sph_root, field)
[all...]
/freebsd-10-stable/crypto/openssh/openbsd-compat/
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-10-stable/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-10-stable/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-10-stable/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-10-stable/usr.bin/csup/
H A Dqueue.h39 #define __offsetof(type, field) ((size_t)(&((type *)0)->field))
68 #define STAILQ_FOREACH(var, head, field) \
71 (var) = STAILQ_NEXT((var), field))
74 #define STAILQ_FOREACH_SAFE(var, head, field, tvar) \
76 (var) && ((tvar) = STAILQ_NEXT((var), field), 1); \
86 #define STAILQ_INSERT_AFTER(head, tqelm, elm, field) do { \
87 if ((STAILQ_NEXT((elm), field) = STAILQ_NEXT((tqelm), field)) == NULL)\
88 (head)->stqh_last = &STAILQ_NEXT((elm), field); \
[all...]
/freebsd-10-stable/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-10-stable/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 505 milliseconds

1234567891011>>