/haiku-buildtools/gcc/gcc/testsuite/gcc.dg/ |
H A D | pr34027-1.c | 4 unsigned long foobar(unsigned long ns) argument 6 while(ns >= 10000L) 7 ns -= 10000L; 8 return ns; 12 to ns % 10000. See the discussion of PR 32044 why we do not do
|
/haiku-buildtools/gcc/gcc/testsuite/obj-c++.dg/property/ |
H A D | cxx-property-1.mm | 6 int ns; 8 @property (getter=namespace) int ns;
|
/haiku-buildtools/gcc/gcc/testsuite/g++.old-deja/g++.other/ |
H A D | ptrmem7.C | 12 static int ns (short); 13 static int ns (float); 14 int ns (int); 15 int ns (double); 22 int (A::*ptr1) (int) = &A::ns; 23 int (A::*ptr2) (int) = A::ns; // { dg-error "pointer to member" "err" } 25 int (A::*ptr3) (int) = &ns; // { dg-error "pointer to member" "err" } 26 int (A::*ptr4) (int) = ns; // { dg-error "pointer to member" "err" } 28 int (*ptr5) (short) = &A::ns; 29 int (*ptr6) (short) = A::ns; [all...] |
/haiku-buildtools/gcc/gcc/testsuite/g++.dg/debug/dwarf2/ |
H A D | pubnames-1.C | 11 // { dg-final { scan-assembler-times "\"ns::ns_x\[^\n\]*external name" 1 } } 14 namespace ns { int ns_x; } namespace 17 int main() { return ns::ns_x; }
|
/haiku-buildtools/legacy/gcc/gcc/f/ |
H A D | name.c | 61 static ffename ffename_lookup_ (ffenameSpace ns, ffelexToken t, bool *found); 71 ffename_lookup_ (ffenameSpace ns, ffelexToken t, bool *found) 75 for (n = ns->first; n != (ffename) &ns->first; n = n->next) 85 return n; /* (n == (ffename) &ns->first) */ 95 ffename_find (ffenameSpace ns, ffelexToken t) 101 assert (ns != NULL); 105 n = ffename_lookup_ (ns, t, &found); 109 newn = (ffename) malloc_new_ks (ns->pool, "FFENAME name", sizeof (*n)); 122 ffenameSpace ns; 70 ffename_lookup_(ffenameSpace ns, ffelexToken t, bool *found) argument 94 ffename_find(ffenameSpace ns, ffelexToken t) argument 128 ffename_kill(ffenameSpace ns, ffename n) argument 149 ffename_lookup(ffenameSpace ns, ffelexToken t) argument 170 ffename_space_drive_global(ffenameSpace ns, ffeglobal (*fn) (ffeglobal)) argument 191 ffename_space_drive_symbol(ffenameSpace ns, ffesymbol (*fn) (ffesymbol)) argument 213 ffename_space_kill(ffenameSpace ns) argument 233 ffenameSpace ns; local [all...] |
H A D | name.h | 75 ffename ffename_find (ffenameSpace ns, ffelexToken t); 76 void ffename_kill (ffenameSpace ns, ffename n); 77 ffename ffename_lookup (ffenameSpace ns, ffelexToken t); 78 void ffename_space_drive_global (ffenameSpace ns, ffeglobal (*fn) (ffeglobal)); 79 void ffename_space_drive_symbol (ffenameSpace ns, ffesymbol (*fn) (ffesymbol)); 80 void ffename_space_kill (ffenameSpace ns);
|
/haiku-buildtools/gcc/gcc/testsuite/g++.dg/lookup/ |
H A D | exception1.C | 4 namespace ns { namespace 10 namespace ns namespace 23 ns::Test::Test() throw( Exception ) : i( 1 ) 27 ns::Test::Test( int n ) throw( Exception ) : i( n ) 32 ns::Test test;
|
/haiku-buildtools/gcc/gcc/testsuite/g++.dg/cpp0x/ |
H A D | constexpr-using3.C | 4 namespace ns { typedef int T; } namespace 6 constexpr int Test1(int x) { using ns::T; typedef T U; return U(x); } 7 constexpr int Test2(int x) { using namespace ns; typedef T U; return U(x); } 8 constexpr int Test3(int x) { { using ns::T; typedef T U; return U(x); } } // { dg-warning "compound-statement" "" { target { c++11_only } } } 9 constexpr int Test4(int x) { { using namespace ns; typedef T U; return T(x); } } // { dg-warning "compound-statement" "" { target { c++11_only } } } 13 constexpr S1() { using ns::T; typedef T U; } 18 constexpr S2() { using namespace ns; typedef T U; } 23 constexpr S3() { { using ns::T; typedef T U; } } // { dg-warning "compound-statement" "" { target { c++11_only } } } 28 constexpr S4() { { using namespace ns; typedef T U; } } // { dg-warning "compound-statement" "" { target { c++11_only } } }
|
/haiku-buildtools/gcc/gcc/testsuite/g++.dg/lto/ |
H A D | 20080924_0.C | 4 namespace ns namespace 14 void func(ns::hash_set<int>) {
|
/haiku-buildtools/gcc/gcc/testsuite/g++.dg/template/ |
H A D | koenig4.C | 3 namespace ns { namespace 10 func1( new ns::A() );
|
H A D | ctor7.C | 11 sfsserver_cache_alloc (int *ns) argument 13 new refcounted < nfsserv > (*ns);
|
/haiku-buildtools/gcc/gcc/testsuite/g++.dg/warn/ |
H A D | Wmissing-declarations-1.C | 4 namespace ns { namespace 13 namespace ns { namespace 18 namespace ns { namespace
|
/haiku-buildtools/gcc/gcc/testsuite/gfortran.dg/ |
H A D | proc_ptr_comp_39.f90 | 13 subroutine ns() 21 procedure(ns), nopass, pointer :: ns => NULL() ! non-pure subroutine 30 call a%ns() ! { dg-error "is not PURE" }
|
/haiku-buildtools/gcc/gmp/mpz/ |
H A D | cdiv_q_ui.c | 29 mp_size_t ns, nn, qn; local 36 ns = SIZ(dividend); 37 if (ns == 0) 43 nn = ABS(ns); 68 if (rl != 0 && ns >= 0) 81 if (rl != 0 && ns >= 0) 90 SIZ(quot) = ns >= 0 ? qn : -qn;
|
H A D | fdiv_q_ui.c | 28 mp_size_t ns, nn, qn; local 35 ns = SIZ(dividend); 36 if (ns == 0) 42 nn = ABS(ns); 67 if (rl != 0 && ns < 0) 80 if (rl != 0 && ns < 0) 89 SIZ(quot) = ns >= 0 ? qn : -qn;
|
H A D | tdiv_r_ui.c | 28 mp_size_t ns, nn; local 35 ns = SIZ(dividend); 36 if (ns == 0) 42 nn = ABS(ns); 55 SIZ(rem) = ns >= 0 ? 1 : -1; 71 SIZ(rem) = ns >= 0 ? rn : -rn; 83 SIZ(rem) = ns >= 0 ? 1 : -1;
|
H A D | tdiv_ui.c | 28 mp_size_t ns, nn; local 35 ns = SIZ(dividend); 36 if (ns == 0) 41 nn = ABS(ns);
|
H A D | tdiv_qr_ui.c | 29 mp_size_t ns, nn, qn; local 36 ns = SIZ(dividend); 37 if (ns == 0) 44 nn = ABS(ns); 60 SIZ(rem) = ns >= 0 ? 1 : -1; 74 SIZ(rem) = ns >= 0 ? rn : -rn; 86 SIZ(rem) = ns >= 0 ? 1 : -1; 92 SIZ(quot) = ns >= 0 ? qn : -qn;
|
H A D | cdiv_r_ui.c | 30 mp_size_t ns, nn; local 37 ns = SIZ(dividend); 38 if (ns == 0) 44 nn = ABS(ns); 73 if (rl != 0 && ns >= 0) 91 if (ns >= 0)
|
H A D | cdiv_ui.c | 30 mp_size_t ns, nn; local 37 ns = SIZ(dividend); 38 if (ns == 0) 43 nn = ABS(ns); 69 if (rl != 0 && ns >= 0) 86 if (ns >= 0)
|
H A D | fdiv_r_ui.c | 28 mp_size_t ns, nn; local 35 ns = SIZ(dividend); 36 if (ns == 0) 42 nn = ABS(ns); 71 if (rl != 0 && ns < 0) 89 if (ns < 0)
|
H A D | fdiv_ui.c | 28 mp_size_t ns, nn; local 35 ns = SIZ(dividend); 36 if (ns == 0) 41 nn = ABS(ns); 67 if (rl != 0 && ns < 0) 84 if (ns < 0)
|
H A D | cdiv_qr_ui.c | 30 mp_size_t ns, nn, qn; local 37 ns = SIZ(dividend); 38 if (ns == 0) 45 nn = ABS(ns); 76 if (rl != 0 && ns >= 0) 96 if (ns >= 0) 108 SIZ(quot) = ns >= 0 ? qn : -qn;
|
/haiku-buildtools/gcc/libstdc++-v3/testsuite/performance/23_containers/insert/ |
H A D | unordered_set.cc | 25 const char* ns = "std::tr1::"; variable 29 const char* ns = "std::"; variable 49 ostr << ns << "unordered_set " << sz << " insertions";
|
/haiku-buildtools/gcc/gcc/testsuite/go.test/test/fixedbugs/ |
H A D | issue4909b.go | 55 func writeDot(ns ...int) { 58 for _, n := range ns { 62 nlast := ns[len(ns)-1] 64 if len(ns) > 1 { 65 nprev = ns[len(ns)-2]
|