Lines Matching refs:value
80 0 or 1, representing that constant value, or a letter, representing
94 The third field describes the value of the function. If a bitmask
96 1s), then the third field is the value of the function only in the
100 arrange to return the value corresponding to the pattern that
117 For string-valued functions, the third field is the string value.
119 generating the value. In both cases there may be several special
122 - A $ followed by a single letter is replaced by the value of the
123 argument or bitfield with that name. The value of a bitfield is
125 position. Thus, a single-bit field always has value 0 or 1.
128 parentheses () is replaced by the value returned by the function
129 with those arguments. An integer value cannot be inserted into a
131 value be used in an integer expression.
134 value of that bitstring. The bitstring has the same syntax as in
137 value of the argument or bitfield-argument with that name,
142 replaced by the string in the list whose number matches the value
144 If there is no string corresponding to the value of the
176 integer, and that this line specifies the value of the function
177 when this integer has the binary value 01110110 (hex 0x76). This
178 value will be the string "halt".
186 specifies the value of inst when its argument looks like
191 00111111. The value of $a for these four values will be
201 on the value of the argument, which is assumed to be a three-bit
202 value. This could just as easily have been written:
217 reg8(3) is "e", the value of inst with this argument will be the
233 The value of this function is a string containing the number n
249 i.e., 0x18. So the value of inst with this argument will be the
277 string-value. In a void function, instead of returning a string (or
336 int parsecontrol(char *name, char *value);
371 int functionswitch(struct function *fp, bits mask, bits value);
574 /* Links to the value(s) supplied. */
628 /* A value supplied for a function (the third field in a description line).
630 bitpattern supplied. The mask and value fields describe the constant
631 bits in the bitpattern: mask indicates which bits they are and value
633 ((x & mask) == value). */
636 bits mask, value;
644 if necessary, and a template entry that will describe the value given here.
689 bits there are; it can legitimately be 0. Return value is 0 on success. */
705 $[...] bitsplice. Put the result in ep. Return value is 0 on success. */
709 bits mask, value, entrymask;
712 mask = value = 0;
717 value |= 1 << i;
750 ep->value = value;
758 value "unsigned int". */
759 int parsecontrol(char *name, char *value) {
761 bitstype = xstrdup(value);
786 with what went before. Return value is 0 on success. */
891 /* Parse the string describing the value of this entry for our
908 /* A parsed representation of the whole string describing a value of a
916 union value { /* The fields here correspond to the enum values. */
923 } value;
927 function value. */
934 of a function value. tempno is used when constructing a C variable name
953 of parsing of a function value. When parsing arrays or function calls,
958 /* Parse a function return-value string or substring and make a struct string
962 at *stringlink. `fp' is the function whose return value is being parsed.
964 The return value is the actual type. */
1001 sp->value.text = q = xmalloc(n + 1);
1018 newt = sp->value.parameter->type;
1021 newt = sp->value.functioncall->function->type;
1030 newt = sp->value.array->type;
1070 `fp' is the function whose return value is being parsed. The parsed
1118 the associated value; if it is negative the value is shifted right.
1121 the bitsplicebits for y will have shift = 2 and value.arg pointing to y,
1122 and those for x will have shift = -2 and value.mask = binary 1100.
1146 } value;
1169 nfrombits = bitcount(sp->value.bits->mask);
1180 shift -= sp->value.bits->shift;
1186 lastbsp->value.mask |= sp->value.bits->mask;
1191 if (sp->value.parameter->type != T_INTEGER) {
1194 progname, filename, lineno, sp->value.parameter->name);
1202 bsp->value.arg = sp->value.parameter;
1204 bsp->value.mask = sp->value.bits->mask;
1215 for (b = bsp->value.mask; b != 0 && !(b & 1); b >>= 1) ;
1217 bsp->value.mask = 0;
1221 sp->value.bitsplice = splicep;
1233 sp->value.bits = bp;
1240 sp->value.parameter = ap;
1264 sp->value.functioncall = fcp = xmalloc(sizeof *fcp);
1301 sp->value.array = ap = xmalloc(sizeof *ap);
1403 bits i, value;
1411 value = highlight;
1415 value = ep->value;
1421 putc((value & i) ? one : zero, f);
1469 fputs(sp->value.text, f);
1472 fprintf(f, "$%c", sp->value.bits->name);
1476 bsp = sp->value.bitsplice;
1481 fprintf(f, "$%c", sp->value.parameter->name);
1484 showfunctioncall(f, sp->value.functioncall);
1487 showarray(f, sp->value.array);
1717 indexstr = estr->value.array->index;
1726 if (indexstr->type != S_BITSTRING || indexstr->value.bits != bp)
1730 || indexstr->value.parameter != fp->args)
1733 if (!simplearray(estr->value.array))
1737 (fp->type == T_INTEGER) ? 0 : checkfixedlength(estr->value.array);
1751 len = strlen(lp->string->value.text);
1758 wasted += maxlen - strlen(lp->string->value.text);
1787 ap = fp->first->string->value.array;
1847 the constraint (b & mask) == value. Return 1 if generated switch
1851 constant value (are not variable). One `default' entry is allowed
1852 all of whose bits are variable. For each value of the constant bits,
1854 that value included in the constraint parameters. The recursion
1862 int functionswitch(struct function *fp, bits mask, bits value) {
1874 fp->name, mask, value, constbits);
1882 || (ep->mask & mask) != mask || (ep->value & mask) != value)
1921 if ((ep->mask & mask) != mask || (ep->value & mask) != value)
1927 printf("case 0x%lx:\n", ep->value & constbits);
1929 value | (ep->value & constbits))) {
1967 check that they have the required value. */
1975 alwaysreturns = functionswitch(fp, mask, value);
2067 compilearrayref(sp1->value.array);
2094 printf("%s", sp->value.text);
2096 compiletext(sp->value.text);
2099 compilebitstring(sp->value.bits);
2102 compilebitsplice(sp->value.bitsplice);
2105 putchar(sp->value.parameter->name);
2110 if (compilearrayref(sp->value.array) != 0)
2142 fp = sp->value.functioncall->function;
2147 actualp = sp->value.functioncall->args;
2188 ap = sp->value.array;
2212 for (lp = sp->value.functioncall->args; lp != NULL; lp = lp->next)
2305 putchar(bsp->value.arg->name);
2308 if (bsp->value.mask == 0)
2311 printf("(code & 0x%lx)", bsp->value.mask);
2318 if (splicep->entry.value != 0)
2319 printf("%s0x%lx", last, splicep->entry.value);