Searched refs:explained (Results 1 - 8 of 8) sorted by relevance

/netbsd-6-1-5-RELEASE/external/gpl3/gcc/dist/gcc/cp/
H A Dfriend.c570 static int explained; local
575 if (! explained && warned)
580 explained = 1;
H A Ddecl2.c775 static int explained = 0;
778 if (!explained)
781 explained = 1;
774 static int explained = 0; local
H A Dclass.c6286 static int explained;
6292 if (!explained)
6295 explained = 1;
6279 static int explained; local
/netbsd-6-1-5-RELEASE/gnu/dist/gcc4/gcc/cp/
H A Dfriend.c558 static int explained; local
561 if (! explained)
567 explained = 1;
H A Ddecl2.c782 static int explained = 0;
785 if (!explained)
788 explained = 1;
781 static int explained = 0; local
H A Dclass.c5914 static int explained;
5920 if (!explained)
5923 explained = 1;
5907 static int explained; local
/netbsd-6-1-5-RELEASE/games/hunt/hunt/
H A Dhunt.c709 int explained; local
718 explained = FALSE;
736 if (!explained) {
739 explained = TRUE;
/netbsd-6-1-5-RELEASE/crypto/external/bsd/heimdal/dist/lib/hcrypto/libtommath/
H A Dtommath.tex259 In most cases how an algorithm is explained and how it is actually implemented are two very different concepts. For
467 reasons that will be explained in the following sub-sections.
5286 their reason of existing are never explained. For this example let $y = 5471$ represent the dividend and $x = 23$ represent the divisor.

Completed in 226 milliseconds