/haiku-fatelf/src/libs/ncurses/form/ |
H A D | fld_pad.c | 39 | 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 D | fld_page.c | 39 | 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 D | fld_max.c | 39 | 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 D | fld_type.c | 39 | 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 D | fld_stat.c | 39 | 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 D | fld_move.c | 39 | 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 D | fld_user.c | 39 | 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 D | fld_info.c | 39 | 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 D | fld_just.c | 39 | 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 D | fld_link.c | 39 | 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) && 66 New_Field->link = field->link; 67 field->link = New_Field; 69 New_Field->buf = field [all...] |
H A D | fld_dup.c | 39 | 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) && 65 New_Field->rows = field->rows; 66 New_Field->cols = field->cols; 67 New_Field->nrow = field [all...] |
H A D | fld_current.c | 39 | 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...] |
H A D | fld_opts.c | 43 | Function : int set_field_opts(FIELD *field, Field_Options opts) 45 | Description : Turns on the named options for this field and turns 49 | E_CURRENT - the field is the current field 54 set_field_opts(FIELD *field, Field_Options opts) argument 58 T((T_CALLED("set_field_opts(%p,%d)"), field, opts)); 62 res = _nc_Synchronize_Options(Normalize_Field(field), opts); 68 | Function : Field_Options field_opts(const FIELD *field) 75 field_opts(const FIELD *field) 77 T((T_CALLED("field_opts(%p)"), field)); 95 field_opts_on(FIELD *field, Field_Options opts) argument 123 field_opts_off(FIELD *field, Field_Options opts) argument [all...] |
H A D | fld_attr.c | 42 NCURSES_IMPEXP int NCURSES_API set_field_ ## name (FIELD * field, chtype attr)\ 45 T((T_CALLED("set_field_" #name "(%p,%s)"), field, _traceattr(attr)));\ 48 Normalize_Field( field );\ 49 if (field != 0) \ 51 if ((field -> name) != attr)\ 53 field -> name = attr;\ 54 res = _nc_Synchronize_Attributes( field );\ 67 NCURSES_IMPEXP chtype NCURSES_API field_ ## name (const FIELD * field)\ 69 T((T_CALLED("field_" #name "(%p)"), field));\ 70 returnAttr( A_ATTRIBUTES & (Normalize_Field( field ) [all...] |
H A D | frm_driver.c | 53 The current field of the form is left and some new field is 56 The current position in the current field is changed. 59 It has to check for a multi-line field. 62 It has to check for a single-line field. 64 The content of the current field is changed 68 Perform verifications of the field. 70 Requests to enumerate possible field values 98 /* Allow dynamic field growth also when navigating past the end */ 130 /* Calculate the position of a single row in a field buffe 445 FIELD *field; local 474 Buffer_To_Window(const FIELD *field, WINDOW *win) argument 515 Window_To_Buffer(WINDOW *win, FIELD *field) argument 590 Field_Grown(FIELD *field, int amount) argument 743 FIELD *field; local 785 FIELD *field; local 910 Perform_Justification(FIELD *field, WINDOW *win) argument 954 Undo_Justification(FIELD *field, WINDOW *win) argument 1018 Display_Or_Erase_Field(FIELD *field, bool bEraseFlag) argument 1073 Synchronize_Field(FIELD *field) argument 1117 Synchronize_Linked_Fields(FIELD *field) argument 1153 _nc_Synchronize_Attributes(FIELD *field) argument 1218 _nc_Synchronize_Options(FIELD *field, Field_Options newopts) argument 1322 FIELD *field; local 1429 FIELD *field = form->current; local 1500 FIELD *field = form->current; local 1550 FIELD *field = form->current; local 1592 FIELD *field = form->current; local 1646 FIELD *field = form->current; local 1669 FIELD *field = form->current; local 1693 FIELD *field = form->current; local 1717 FIELD *field = form->current; local 1776 FIELD *field = form->current; local 1822 FIELD *field = form->current; local 1857 FIELD *field = form->current; local 2037 FIELD *field = form->current; local 2212 FIELD *field = form->current; local 2269 FIELD *field = form->current; local 2344 FIELD *field = form->current; local 2479 FIELD *field = form->current; local 2563 FIELD *field = form->current; local 2598 FIELD *field = form->current; local 2655 FIELD *field = form->current; local 2743 FIELD *field = form->current; local 2884 Next_Choice(FIELDTYPE *typ, FIELD *field, TypeArgument *argp) argument 2917 Previous_Choice(FIELDTYPE *typ, FIELD *field, TypeArgument *argp) argument 2955 FIELD *field = form->current; local 2976 FIELD *field = form->current; local 3007 Check_Field(FIELDTYPE *typ, FIELD *field, TypeArgument *argp) argument 3052 FIELD *field; local 3114 Next_Field_On_Page(FIELD *field) argument 3157 FIELD **field = &form->field[proposed->index]; local 3196 Previous_Field_On_Page(FIELD *field) argument 3226 Sorted_Next_Field(FIELD *field) argument 3252 Sorted_Previous_Field(FIELD *field) argument 3277 Left_Neighbor_Field(FIELD *field) argument 3305 Right_Neighbor_Field(FIELD *field) argument 3333 Upper_Neighbor_Field(FIELD *field) argument 3383 Down_Neighbor_Field(FIELD *field) argument 3695 _nc_Set_Form_Page(FORM *form, int page, FIELD *field) argument 3883 FIELD *field = form->current; local 4195 set_field_buffer(FIELD *field, int buffer, const char *value) argument 4314 field_buffer(const FIELD *field, int buffer) argument [all...] |
H A D | frm_data.c | 42 | because the beginning of a field is fixed. 56 FIELD *field; local 58 field = form->current; 59 if (!Single_Line_Field(field)) 129 | because a dynamic field has a variable end. 143 FIELD *field; local 147 field = form->current; 150 if (Single_Line_Field(field)) 154 pos = form->begincol + field->cols; 155 while (pos < field [all...] |
/haiku-fatelf/src/add-ons/kernel/drivers/audio/ac97/auich/ |
H A D | queue.h | 108 #define QUEUEDEBUG_LIST_INSERT_HEAD(head, elm, field) \ 110 (head)->lh_first->field.le_prev != &(head)->lh_first) \ 112 #define QUEUEDEBUG_LIST_OP(elm, field) \ 113 if ((elm)->field.le_next && \ 114 (elm)->field.le_next->field.le_prev != \ 115 &(elm)->field.le_next) \ 117 if (*(elm)->field.le_prev != (elm)) \ 119 #define QUEUEDEBUG_LIST_POSTREMOVE(elm, field) \ 120 (elm)->field [all...] |
/haiku-fatelf/src/add-ons/kernel/drivers/audio/ac97/auvia/ |
H A D | queue.h | 108 #define QUEUEDEBUG_LIST_INSERT_HEAD(head, elm, field) \ 110 (head)->lh_first->field.le_prev != &(head)->lh_first) \ 112 #define QUEUEDEBUG_LIST_OP(elm, field) \ 113 if ((elm)->field.le_next && \ 114 (elm)->field.le_next->field.le_prev != \ 115 &(elm)->field.le_next) \ 117 if (*(elm)->field.le_prev != (elm)) \ 119 #define QUEUEDEBUG_LIST_POSTREMOVE(elm, field) \ 120 (elm)->field [all...] |
/haiku-fatelf/src/add-ons/kernel/drivers/audio/ac97/es1370/ |
H A D | queue.h | 108 #define QUEUEDEBUG_LIST_INSERT_HEAD(head, elm, field) \ 110 (head)->lh_first->field.le_prev != &(head)->lh_first) \ 112 #define QUEUEDEBUG_LIST_OP(elm, field) \ 113 if ((elm)->field.le_next && \ 114 (elm)->field.le_next->field.le_prev != \ 115 &(elm)->field.le_next) \ 117 if (*(elm)->field.le_prev != (elm)) \ 119 #define QUEUEDEBUG_LIST_POSTREMOVE(elm, field) \ 120 (elm)->field [all...] |
/haiku-fatelf/src/add-ons/kernel/drivers/audio/echo/ |
H A D | queue.h | 108 #define QUEUEDEBUG_LIST_INSERT_HEAD(head, elm, field) \ 110 (head)->lh_first->field.le_prev != &(head)->lh_first) \ 112 #define QUEUEDEBUG_LIST_OP(elm, field) \ 113 if ((elm)->field.le_next && \ 114 (elm)->field.le_next->field.le_prev != \ 115 &(elm)->field.le_next) \ 117 if (*(elm)->field.le_prev != (elm)) \ 119 #define QUEUEDEBUG_LIST_POSTREMOVE(elm, field) \ 120 (elm)->field [all...] |
/haiku-fatelf/src/add-ons/kernel/drivers/audio/emuxki/ |
H A D | queue.h | 108 #define QUEUEDEBUG_LIST_INSERT_HEAD(head, elm, field) \ 110 (head)->lh_first->field.le_prev != &(head)->lh_first) \ 112 #define QUEUEDEBUG_LIST_OP(elm, field) \ 113 if ((elm)->field.le_next && \ 114 (elm)->field.le_next->field.le_prev != \ 115 &(elm)->field.le_next) \ 117 if (*(elm)->field.le_prev != (elm)) \ 119 #define QUEUEDEBUG_LIST_POSTREMOVE(elm, field) \ 120 (elm)->field [all...] |
/haiku-fatelf/headers/private/firewire/ |
H A D | queue.h | 159 #define SLIST_FOREACH(var, head, field) \ 162 (var) = SLIST_NEXT((var), field)) 164 #define SLIST_FOREACH_SAFE(var, head, field, tvar) \ 166 (var) && ((tvar) = SLIST_NEXT((var), field), 1); \ 169 #define SLIST_FOREACH_PREVPTR(var, varp, head, field) \ 172 (varp) = &SLIST_NEXT((var), field)) 178 #define SLIST_INSERT_AFTER(slistelm, elm, field) do { \ 179 SLIST_NEXT((elm), field) = SLIST_NEXT((slistelm), field); \ 180 SLIST_NEXT((slistelm), field) [all...] |
/haiku-fatelf/src/libs/compat/freebsd_network/compat/sys/ |
H A D | queue.h | 159 #define SLIST_FOREACH(var, head, field) \ 162 (var) = SLIST_NEXT((var), field)) 164 #define SLIST_FOREACH_SAFE(var, head, field, tvar) \ 166 (var) && ((tvar) = SLIST_NEXT((var), field), 1); \ 169 #define SLIST_FOREACH_PREVPTR(var, varp, head, field) \ 172 (varp) = &SLIST_NEXT((var), field)) 178 #define SLIST_INSERT_AFTER(slistelm, elm, field) do { \ 179 SLIST_NEXT((elm), field) = SLIST_NEXT((slistelm), field); \ 180 SLIST_NEXT((slistelm), field) [all...] |
/haiku-fatelf/src/apps/sudoku/ |
H A D | SudokuGenerator.cpp | 35 SudokuGenerator::_HasOnlyOneSolution(SudokuField& field) argument 37 SudokuSolver solver(&field); 60 // first step: generate a solved field - random brute force style 62 SudokuField field(target->BlockSize()); 63 uint32 inputCount = field.Size() * field.Size() / 3; 64 _Progress(progress, B_TRANSLATE("Creating solvable field"), 5.f); 67 field.Reset(); 69 // generate input field 77 x = rand() % field [all...] |
/haiku-fatelf/src/apps/resedit/ |
H A D | PreviewColumn.cpp | 20 PreviewColumn::DrawField(BField* field, BRect rect, BView* parent) argument 22 PreviewField *pField = (PreviewField*)field; 27 PreviewColumn::AcceptsField(const BField* field) const 29 return dynamic_cast<const PreviewField*>(field);
|