Searched refs:sought (Results 1 - 7 of 7) sorted by relevance

/netbsd-6-1-5-RELEASE/external/lgpl3/gmp/dist/tests/mpz/
H A Dt-scan.c28 refmpz_scan (mpz_srcptr z, unsigned long i, int sought) argument
34 if (mpz_tstbit (z, i) == sought)
64 int test, neg, sought, oindex, o; local
90 for (sought = 0; sought <= 1; sought++)
92 if (sought == 0)
105 printf ("wrong at test=%d, size=%ld, neg=%d, start=%lu, sought=%d\n",
106 test, size, neg, start, sought);
/netbsd-6-1-5-RELEASE/external/gpl3/binutils/dist/binutils/testsuite/binutils-all/
H A Dreadelf.exp185 set sought {
197 foreach looked_for $sought {
281 set sought {
285 foreach looked_for $sought {
/netbsd-6-1-5-RELEASE/external/gpl3/binutils/dist/binutils/
H A Dobjdump.c2506 stab_section_names * sought = (stab_section_names *) names;
2510 len = strlen (sought->section_name);
2515 if (strncmp (sought->section_name, section->name, len) == 0
2520 strtab = read_section_stabs (abfd, sought->string_section_name,
2528 print_section_stabs (abfd, section->name, &sought->string_offset);
2499 stab_section_names * sought = (stab_section_names *) names; local
/netbsd-6-1-5-RELEASE/gnu/dist/gcc4/gcc/config/arm/
H A Darm.c937 unsigned int sought;
958 sought = 0;
962 sought |= (FL_THUMB | FL_MODE32);
971 if (sought != 0 && ((sought & insn_flags) != sought))
977 if ((sel->flags & sought) == (sought | insn_flags))
997 if ((sel->flags & sought) == sought)
934 unsigned int sought; local
[all...]
/netbsd-6-1-5-RELEASE/external/gpl3/gcc/dist/gcc/config/arm/
H A Darm.c1364 unsigned int sought;
1384 sought = 0;
1388 sought |= (FL_THUMB | FL_MODE32);
1397 if (sought != 0 && ((sought & insn_flags) != sought))
1403 if ((sel->flags & sought) == (sought | insn_flags))
1423 if ((sel->flags & sought) == sought)
1360 unsigned int sought; local
[all...]
/netbsd-6-1-5-RELEASE/external/gpl3/binutils/dist/ld/
H A Dldlang.c2806 /* Return TRUE iff target is the sought target. */
2811 const char *sought = (const char *) data;
2813 return strcmp (target->name, sought) == 0;
2809 const char *sought = (const char *) data; local
/netbsd-6-1-5-RELEASE/crypto/external/bsd/heimdal/dist/lib/hcrypto/libtommath/
H A Dtommath.tex3691 Let $a$ represent the number of which the residue is sought. Let $b$ represent the modulus used to find the residue. Let $m$ represent
3873 $n$ must be odd. The variable $x$ will represent the quantity of which the residue is sought. Similar to the Barrett algorithm the input
4708 such cryptosystem and many methods have been sought to speed it up.

Completed in 328 milliseconds