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

1 2

  /src/external/gpl3/gdb/dist/sim/example-synacor/
sim-main.c 95 uint16_t iw2, iw3, num2, num3;
98 num2 = register_num (cpu, iw2);
102 TRACE_INSN (cpu, "SET R%i %#x", num2, num3);
104 TRACE_REGISTER (cpu, "R%i = %#x", num2, num3);
105 example_cpu->regs[num2] = num3;
112 uint16_t iw2, num2;
115 num2 = interp_num (cpu, iw2);
117 TRACE_INSN (cpu, "PUSH %#x", num2);
119 sim_core_write_aligned_2 (cpu, pc, write_map, example_cpu->sp, num2);
129 uint16_t iw2, num2, result
93 uint16_t iw2, iw3, num2, num3; local
110 uint16_t iw2, num2; local
127 uint16_t iw2, num2, result; local
146 uint16_t iw2, iw3, iw4, num2, num3, num4, result; local
168 uint16_t iw2, iw3, iw4, num2, num3, num4, result; local
189 uint16_t iw2, num2; local
204 uint16_t iw2, iw3, num2, num3; local
227 uint16_t iw2, iw3, num2, num3; local
250 uint16_t iw2, iw3, iw4, num2, num3, num4, result; local
273 uint16_t iw2, iw3, iw4, num2, num3, num4, result; local
295 uint16_t iw2, iw3, iw4, num2, num3, num4, result; local
316 uint16_t iw2, iw3, iw4, num2, num3, num4, result; local
337 uint16_t iw2, iw3, iw4, num2, num3, num4, result; local
358 uint16_t iw2, iw3, num2, num3, result; local
377 uint16_t iw2, iw3, num2, num3, result; local
399 uint16_t iw2, iw3, num2, num3; local
419 uint16_t iw2, num2; local
454 uint16_t iw2, num2; local
472 uint16_t iw2, num2; local
    [all...]
  /src/external/gpl3/gdb.old/dist/sim/example-synacor/
sim-main.c 95 uint16_t iw2, iw3, num2, num3;
98 num2 = register_num (cpu, iw2);
102 TRACE_INSN (cpu, "SET R%i %#x", num2, num3);
104 TRACE_REGISTER (cpu, "R%i = %#x", num2, num3);
105 example_cpu->regs[num2] = num3;
112 uint16_t iw2, num2;
115 num2 = interp_num (cpu, iw2);
117 TRACE_INSN (cpu, "PUSH %#x", num2);
119 sim_core_write_aligned_2 (cpu, pc, write_map, example_cpu->sp, num2);
129 uint16_t iw2, num2, result
93 uint16_t iw2, iw3, num2, num3; local
110 uint16_t iw2, num2; local
127 uint16_t iw2, num2, result; local
146 uint16_t iw2, iw3, iw4, num2, num3, num4, result; local
168 uint16_t iw2, iw3, iw4, num2, num3, num4, result; local
189 uint16_t iw2, num2; local
204 uint16_t iw2, iw3, num2, num3; local
227 uint16_t iw2, iw3, num2, num3; local
250 uint16_t iw2, iw3, iw4, num2, num3, num4, result; local
273 uint16_t iw2, iw3, iw4, num2, num3, num4, result; local
295 uint16_t iw2, iw3, iw4, num2, num3, num4, result; local
316 uint16_t iw2, iw3, iw4, num2, num3, num4, result; local
337 uint16_t iw2, iw3, iw4, num2, num3, num4, result; local
358 uint16_t iw2, iw3, num2, num3, result; local
377 uint16_t iw2, iw3, num2, num3, result; local
399 uint16_t iw2, iw3, num2, num3; local
419 uint16_t iw2, num2; local
454 uint16_t iw2, num2; local
472 uint16_t iw2, num2; local
    [all...]
  /src/external/lgpl3/gmp/dist/mpq/
cmp_ui.c 37 _mpq_cmp_ui (mpq_srcptr op1, unsigned long int num2, unsigned long int den2)
48 if ((num2 | den2) > GMP_NUMB_MAX)
52 mpz_set_ui (mpq_numref (op2), num2); local
66 if (num2 == 0)
72 Same for NUM2 x DEN1 with respect to TMP2_SIZE. */
73 /* If frac2 <= 1 (i.e. num2 <= den2), shortcut with a simpler
75 if (num1_size > den1_size + (num2 > den2))
76 /* NUM1 x DEN2 is surely larger in magnitude than NUM2 x DEN1. */
78 if (den1_size > num1_size + (den2 > num2))
79 /* NUM1 x DEN2 is surely smaller in magnitude than NUM2 x DEN1. *
    [all...]
  /src/external/gpl3/gdb/dist/gdb/testsuite/gdb.fortran/
mixed-lang-stack.cpp 22 int num2 = 2; member in class:base_one
  /src/external/gpl3/gdb.old/dist/gdb/testsuite/gdb.fortran/
mixed-lang-stack.cpp 22 int num2 = 2; member in class:base_one
  /src/external/gpl3/gdb/dist/gdb/testsuite/gdb.cp/
anon-union.cc 27 } num2; member in struct:Foo
  /src/external/gpl3/gdb.old/dist/gdb/testsuite/gdb.cp/
anon-union.cc 27 } num2; member in struct:Foo
  /src/external/bsd/jemalloc/dist/test/unit/
bit_util.c 86 size_t num2 = ((size_t)1 << i) local
89 expect_zu_ne(num2, 0, "Invalid lg argument");
92 expect_lg_ceil_range(num2, lg_ceil(num2));
93 expect_lg_ceil_range(num2, LG_CEIL(num2));
97 expect_lg_floor_range(num2, lg_floor(num2));
98 expect_lg_floor_range(num2, LG_FLOOR(num2));
    [all...]
  /src/tests/usr.bin/xlint/lint1/
init_braces.c 25 int num2[] = {{ 1 }}; local
  /src/external/gpl3/binutils/dist/gprofng/src/
IndexObject.cc 270 int64_t num2; local
331 num2 = num1 / 4;
332 if (num2)
334 sb.sprintf (GTXT ("%3lluTB < n <= %3lluTB"), (unsigned long long) num2, (unsigned long long) num1);
344 num2 = num1 / 4;
345 if (num2)
347 sb.sprintf (GTXT ("%3lluGB < n <= %3lluGB"), (unsigned long long) num2, (unsigned long long) num1);
357 num2 = num1 / 4;
358 if (num2)
360 sb.sprintf (GTXT ("%3lluMB < n <= %3lluMB"), (unsigned long long) num2, (unsigned long long) num1)
    [all...]
  /src/external/gpl3/binutils.old/dist/gprofng/src/
IndexObject.cc 270 int64_t num2; local
331 num2 = num1 / 4;
332 if (num2)
334 sb.sprintf (GTXT ("%3lluTB < n <= %3lluTB"), (unsigned long long) num2, (unsigned long long) num1);
344 num2 = num1 / 4;
345 if (num2)
347 sb.sprintf (GTXT ("%3lluGB < n <= %3lluGB"), (unsigned long long) num2, (unsigned long long) num1);
357 num2 = num1 / 4;
358 if (num2)
360 sb.sprintf (GTXT ("%3lluMB < n <= %3lluMB"), (unsigned long long) num2, (unsigned long long) num1)
    [all...]
  /src/games/larn/
io.c 290 int num2; local
308 num2 = lpbuf + BUFBIG - lpnt; /* # bytes left in
310 if (num2 > len)
311 num2 = len;
313 len -= num2;
314 while (num2--)
380 int num2; local
393 num2 = iepoint - ipoint; /* # of bytes left in
395 if (num2 > num)
396 num2 = num
    [all...]
  /src/external/bsd/bc/dist/
number.h 126 int bc_modulo (bc_num num1, bc_num num2, bc_num *result, int scale);
128 int bc_divmod (bc_num num1, bc_num num2, bc_num *quot,
134 void bc_raise (bc_num num1, bc_num num2, bc_num *result,
number.c 908 unsigned char *num1, *num2; local
936 Remember, zeros on the end of num2 are wasted effort for dividing. */
953 num2 = (unsigned char *) malloc (len2+1);
954 if (num2 == NULL) bc_out_of_memory();
955 memcpy (num2, n2->n_value, len2);
956 *(num2+len2) = 0;
957 n2ptr = num2;
1087 free (num2);
1093 /* Division *and* modulo for numbers. This computes both NUM1 / NUM2 and
1094 NUM1 % NUM2 and puts the results in QUOT and REM, except that if QUO
    [all...]
  /src/common/lib/libprop/
prop_number.c 239 prop_number_t num2 = v2; local
246 if (num1 == num2)
253 if (num1->pn_value.pnv_is_unsigned == num2->pn_value.pnv_is_unsigned)
266 * num1 is unsigned and num2 is signed.
270 if (num2->pn_value.pnv_signed < 0)
274 * num1 is signed and num2 is unsigned.
278 if (num2->pn_value.pnv_unsigned > INTMAX_MAX)
282 if (num1->pn_value.pnv_signed == num2->pn_value.pnv_signed)
564 prop_number_equals(prop_number_t num1, prop_number_t num2)
566 if (!prop_object_is_number(num1) || !prop_object_is_number(num2))
    [all...]
  /src/external/gpl2/rcs/dist/src/
rcsrev.c 166 int cmpnum(num1, num2)
167 char const *num1, *num2;
168 /* compares the two dotted numbers num1 and num2 lexicographically
170 * returns <0, 0, >0 if num1<num2, num1==num2, and num1>num2, resp.
179 s2 = num2 ? num2 : "";
210 int cmpnumfld(num1, num2, fld)
211 char const *num1, *num2;
    [all...]
rlog.c 1184 checkrevpair(num1,num2)
1185 char const *num1, *num2;
1186 /* function: check whether num1, num2 are legal pair,i.e.
1194 countnumflds(num2) != length
1195 || (2 < length && compartial(num1, num2, length-1) != 0)
1197 rcserror("invalid branch or revision pair %s : %s", num1, num2);
  /src/external/gpl2/groff/dist/src/preproc/eqn/
pbox.h 38 extern int num2;
over.cpp 92 uid, (reduce_size ? num2 : num1));
box.cpp 57 int num2 = 40; variable
101 { "num2", &num2 },
  /src/external/bsd/cron/dist/
entry.c 492 int i, num1, num2, num3; local
503 num2 = high;
545 ch = get_number(&num2, low, names, ch, file, "/, \t\n");
546 if (ch == EOF || num1 > num2)
553 if (num1 > num2)
555 num1 = random_with_range(num1, num2);
590 /* range. set all elements from num1 to num2, stepping
595 for (i = num1; i <= num2; i += num3)
  /src/external/gpl3/gcc.old/dist/libphobos/libdruntime/core/
int128.d 511 U num2 = c1.hi;
512 num2 <<= shift;
513 num2 |= (c1.lo >> (-shift & 63)) & (-cast(I)shift >> 63);
520 // Compute q1 = [num2 num1] / c2
521 const q1 = udiv96_64(num2, num1, c2);
523 const rem = num2 * base + num1 - q1 * c2;
  /src/usr.sbin/acpitools/aml/
aml_parse.c 403 int num2; local
407 num2 = aml_objtonum(env, aml_eval_name(env,
421 obj->buffer.data[1] = num2 & 0xff;
1276 int num1, num2; local
1678 num2 = aml_objtonum(env, aml_eval_name(env, \
1681 anum.num.number = ope2(num1 oparation num2); \
1732 num2 = aml_objtonum(env, aml_eval_name(env,
1735 anum.num.number = num1 % num2;
1739 anum.num.number = num1 / num2;
1881 num2 = aml_objtonum(env, aml_eval_name(env
    [all...]
  /src/external/bsd/tradcpp/dist/
macro.c 215 unsigned num1, num2, i; local
228 num2 = expansionitemarray_num(&m2->expansion);
229 if (num1 != num2) {
242 num2 = stringarray_num(&m2->params);
243 if (num1 != num2) {
  /src/sys/arch/hp300/stand/inst/
inst.c 261 #define GETNUM2(out, num1, num2) \
262 printf((out), (num1), (num2)); \
266 (num2) = atoi(line);

Completed in 54 milliseconds

1 2