HomeSort by: relevance | last modified time | path
    Searched refs:fields (Results 1 - 25 of 52) sorted by relevancy

1 2 3

  /src/sys/arch/mips/sibyte/include/
ui_bitfields.h 53 char *showfields(bitfield_t *fields,uint64_t val);
  /src/lib/libform/
form.c 59 0, /* number of fields attached */
63 NULL, /* dynamic array of fields that start
66 NULL /* array of fields attached to this form. */
143 if ((form->fields == NULL) || (form->fields[0] == NULL))
150 temp = form->fields[i]->form_row + form->fields[i]->rows;
152 temp = form->fields[i]->form_col + form->fields[i]->cols;
299 * Attach the given fields to the form
    [all...]
driver.c 59 if (form->fields[idx]->left == NULL)
61 idx = form->fields[idx]->left->index;
65 if (form->fields[idx]->right == NULL)
67 idx = form->fields[idx]->right->index;
71 if (form->fields[idx]->up == NULL)
73 idx = form->fields[idx]->up->index;
77 if (form->fields[idx]->down == NULL)
79 idx = form->fields[idx]->down->index;
86 if ((form->fields[idx]->opts & (O_ACTIVE | O_VISIBLE))
107 if ((form->fields == NULL) || (*(form->fields) == NULL)
    [all...]
post.c 52 if ((form->fields == NULL) || (form->fields[0] == NULL))
internals.c 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
    [all...]
  /src/tests/lib/libc/regex/
test_regex.h 41 int split(char *string, char *fields[], int nfields, const char *sep);
split.c 36 * split - divide a string into fields, like awk split()
38 * returns number of fields, including overflow
40 * fields[] list is not NULL-terminated
41 * nfields number of entries available in fields[]
45 split(char *string, char *fields[], int nfields, const char *sep)
52 char **fp = fields;
85 /* we have overflowed the fields vector -- just count them */
115 /* we have overflowed the fields vector -- just count them */
188 char *fields[MNF]; local in function:main
197 (void) split(buf, fields, MNF, argv[2])
216 char *fields[NF]; local in function:dosplit
309 char *fields[RNF+1]; local in function:regress
    [all...]
  /src/usr.bin/sort/
Makefile 5 SRCS= append.c fields.c files.c fsort.c init.c msort.c sort.c tmp.c
  /src/usr.sbin/quotarestore/
quotarestore.c 370 char *fields[8]; local in function:readdumpfile
422 fields[num++] = s;
424 errx(EXIT_FAILURE, "%s:%u: Too many fields",
429 errx(EXIT_FAILURE, "%s:%u: Not enough fields",
433 if (getidtype(fields[0], &key.qk_idtype)) {
435 path, lineno, fields[0]);
437 if (getid(fields[1], key.qk_idtype, &key.qk_id)) {
439 path, lineno, fields[1]);
441 if (getobjtype(fields[2], &key.qk_objtype)) {
444 path, lineno, fields[2])
    [all...]
  /src/tests/usr.bin/cut/
t_cut.sh 33 for fields in 1 2 3 1-2 2,3 4 1-3,4-7 1,2-7
35 opts="-f ${fields} $@"
  /src/sys/fs/cd9660/
cd9660_rrip.c 96 ana->fields &= ~ISO_SUSP_ATTR;
200 ana->fields = 0;
215 ana->fields &= ~ISO_SUSP_SLINK;
270 ana->fields &= ~ISO_SUSP_ALTNAME;
280 ana->fields &= ~ISO_SUSP_ALTNAME;
318 ana->fields &= ~(ISO_SUSP_CLINK | ISO_SUSP_PLINK);
331 ana->fields = 0;
388 ana->fields &= ~ISO_SUSP_TSTAMP;
416 ana->fields &= ~ISO_SUSP_DEVICE;
428 ana->fields &= isonum_711(p->flags) | ~0xff; /* don't touch high bits *
    [all...]
iso_rrip.h 62 int fields; /* interesting fields in this analysis */ member in struct:__anon02f4174b0108
  /src/usr.bin/mixerctl/
mixerctl.c 57 } *fields, *rfields; variable in typeref:struct:field *
79 for (i = 0; fields[i].name; i++)
80 if (strcmp(fields[i].name, name) == 0)
81 return &fields[i];
398 fields = calloc(ndev, sizeof *fields);
431 fields[j++] = rfields[i];
434 fields[j] = rfields[pos];
435 fields[j].name = catstr(rfields[i].name,
444 int cls = fields[i].infp->mixer_class
    [all...]
  /src/usr.bin/audio/ctl/
ctl.c 89 } fields[] = { variable in typeref:struct:field[]
158 for (i = 0; fields[i].name; i++)
159 if (strcmp(fields[i].name, name) == 0)
160 return &fields[i];
384 for (i = 0; fields[i].name; i++) {
385 if (!(fields[i].flags & ALIAS)) {
386 prfield(&fields[i], sep);
395 for (i = 0; fields[i].name; i++) {
396 if (fields[i].flags & SET) {
398 fields[i].name)
    [all...]
  /src/lib/libc/time/
zic.c 194 static void inleap(char ** fields, int nfields);
195 static void inlink(char ** fields, int nfields);
196 static void inrule(char ** fields, int nfields);
197 static bool inzcont(char ** fields, int nfields);
198 static bool inzone(char ** fields, int nfields);
254 ** Which fields are which on a Zone line.
271 ** Which fields are which on a Zone continuation line.
304 ** Which fields are which on a Link line.
314 ** Which fields are which on a Leap line.
326 /* Expires lines are like Leap lines, except without CORR and ROLL fields. *
1759 char *fields[MAX_FIELDS]; local in function:infile
    [all...]
  /src/usr.sbin/ypserv/revnetgroup/
parse_netgroup.c 182 int fields; local in function:parse_netgrp
223 fields = 0;
228 fields++;
247 * fields. It's up to user programs
260 if (fields < 3)
  /src/usr.sbin/sunlabel/
sunlabel.c 109 /* BEGIN fields taken directly from struct dk_label */
123 /* END fields taken directly from struct dk_label */
145 * Note that while the fields in the label vary in size (8, 16, or 32
179 * _ascii functions are for 128-byte string fields (the ASCII label);
180 * the _int functions are for int-valued fields (everything else).
190 /* The fields themselves. */
191 static struct field fields[] = variable in typeref:struct:field[]
884 if (fields[0].taglen < 1) {
885 for (i = 0; fields[i].tag; i++)
886 fields[i].taglen = strlen(fields[i].tag)
    [all...]
  /src/usr.bin/join/
join.c 72 char **fields; /* line field(s) */ member in struct:__anon1dd7fe7d0108
104 static int joinout = 1; /* show lines with matched join fields (-v) */
373 /* Split the line into fields, allocate space as necessary. */
383 if (reallocarr(&lp->fields,
388 lp->fields[lp->fieldcnt++] = fieldp;
407 return (strcmp(lp1->fields[fieldno1], lp2->fields[fieldno2]));
438 * lines. Output empty fields in the right places.
470 * Output the join field, then the remaining fields from F1
497 if (*lp->fields[fieldno] == '\0'
    [all...]
  /src/lib/libradius/
radlib.c 420 const char *fields[5]; local in function:rad_config
452 /* Extract the fields from the line. */
454 nfields = split(buf, fields, sizeof(fields) / sizeof(fields[0]),
469 if (strcmp(fields[0], "auth") != 0 &&
470 strcmp(fields[0], "acct") != 0) {
479 fields[i] = fields[i - 1];
480 fields[0] = "auth"
    [all...]
  /src/sys/dev/microcode/aic7xxx/
aicasm_symbol.h 80 symlist_t fields; member in struct:reg_info
aicasm_symbol.c 543 symlist_t *fields; local in function:symtable_dump
548 fields = &curnode->symbol->info.rinfo->fields;
549 SLIST_FOREACH(fieldnode, fields, links) {
  /src/sys/external/bsd/compiler_rt/dist/lib/sanitizer_common/
sanitizer_malloc_mac.inc 37 // IMPORTANT: Do not change the order, alignment, or types of these fields to
38 // maintain binary compatibility. You should only add fields to this struct.
  /src/bin/sh/
mknodes.sh 89 echo >&2 "Conflicting type fields: node" \
  /src/sys/external/bsd/ena-com/
ena_com.c 2377 u16 *fields)
2390 if (fields)
2391 *fields = rss->hash_ctrl->selected_fields[proto].fields;
2455 hash_ctrl->selected_fields[ENA_ADMIN_RSS_TCP4].fields =
2459 hash_ctrl->selected_fields[ENA_ADMIN_RSS_UDP4].fields =
2463 hash_ctrl->selected_fields[ENA_ADMIN_RSS_TCP6].fields =
2467 hash_ctrl->selected_fields[ENA_ADMIN_RSS_UDP6].fields =
2471 hash_ctrl->selected_fields[ENA_ADMIN_RSS_IP4].fields =
2474 hash_ctrl->selected_fields[ENA_ADMIN_RSS_IP6].fields
    [all...]
  /src/sys/external/bsd/drm2/dist/drm/amd/display/dc/
dc_dp_types.h 305 } fields; member in union:dp_downstream_port_present
679 } fields; member in union:dpcd_dsc_basic_capabilities
688 } fields; member in union:dpcd_dsc_ext_capabilities

Completed in 28 milliseconds

1 2 3