Lines Matching refs:fields
284 * is only used on static single line fields, everything else will
370 * Assume the fields have been sorted and stitched.
390 cur = form->fields[form->page_starts[form->page].first];
405 * Set the field to the next active and visible field, the fields are
417 cur = form->fields[i];
452 if ((form->fields[i]->opts & (O_VISIBLE | O_ACTIVE))
1084 * Return the index of the top left most field of the two given fields.
1090 if (form->fields[a]->form_row < form->fields[b]->form_row)
1093 if (form->fields[a]->form_row > form->fields[b]->form_row)
1097 if (form->fields[a]->form_col < form->fields[b]->form_col)
1100 if (form->fields[a]->form_col > form->fields[b]->form_col)
1103 /* if we get here fields must be in exactly the same place, punt */
1109 * two given fields.
1115 if (form->fields[a]->form_row > form->fields[b]->form_row)
1117 if (form->fields[a]->form_row < form->fields[b]->form_row)
1121 if (form->fields[a]->form_col > form->fields[b]->form_col)
1123 if (form->fields[a]->form_col < form->fields[b]->form_col)
1126 /* fields in the same place, punt */
1460 * Find the different pages in the form fields and assign the form
1473 if (form->fields[i]->page_break == 1)
1512 cur = form->fields[field];
1577 /* dynamic fields are not justified */
1692 cur = form->fields[form->cur_field];
1723 * Display the fields attached to the form that are on the current page
1946 * to single row, static fields.
1962 * fields.
2064 cur = form->fields[form->cur_field];
2107 * Static fields cannot do this so deny request if
2555 * fields will do this when the field is wrapped.
2989 if ((form == NULL) || (form->fields == NULL) ||
2990 (form->fields[0] == NULL))
2993 cur = form->fields[form->cur_field];
3078 if ((form == NULL) || (form->fields == NULL) ||
3079 (form->fields[0] == NULL) ||
3080 (form->fields[form->cur_field]->type == NULL))
3083 field = form->fields[form->cur_field];
3107 * Update the fields if they have changed. The parameter old has the
3159 * First check the page, we want the fields sorted by page.
3168 * sort fields left to right, top to bottom so the top left is
3175 * Sort the fields in a form ready for driver traversal.
3189 memcpy(sort_area, form->fields, sizeof(*sort_area) * form->field_count);
3200 * Set the neighbours for all the fields in the given form.
3209 * check if the sorted fields circle queue is empty, just
3239 /* walk the sorted fields, setting the neighbour pointers */