/netbsd-6-1-5-RELEASE/external/gpl3/gcc/dist/gcc/testsuite/g++.dg/opt/ |
H A D | pr26179.C | 16 struct a fl; local 17 h(fl); 18 if (fl.i) 20 fl.i+=2; 21 return fl;
|
/netbsd-6-1-5-RELEASE/external/gpl3/gcc/dist/libstdc++-v3/testsuite/23_containers/forward_list/modifiers/ |
H A D | 5.cc | 32 std::forward_list<int> fl({0, 1, 2, 3, 4, 5, 6, 7, 8, 9}); 34 VERIFY(fl.empty() == false); 36 fl.clear(); 38 VERIFY(fl.empty() == true);
|
H A D | 3.cc | 34 std::forward_list<int> fl({0, 1, 2, 3, 4, 5, 6, 7, 8, 9}); 36 std::forward_list<int>::const_iterator pos = fl.cbegin(); 40 fl.erase_after(pos); 54 std::forward_list<int> fl({0, 1, 2, 3, 4, 5, 6, 7, 8, 9}); 56 std::forward_list<int>::const_iterator pos = fl.cbegin(); 60 std::forward_list<int>::iterator stop = fl.begin(); 67 fl.erase_after(pos, stop); 72 VERIFY(std::distance(fl.begin(), fl.end()) == 8); 74 fl [all...] |
H A D | 6.cc | 40 std::forward_list<NoCopyConstructor> fl; local 41 VERIFY( std::distance(fl.begin(), fl.end()) == 0 ); 43 fl.resize(10); 44 VERIFY( std::distance(fl.begin(), fl.end()) == 10 ); 45 for(auto it = fl.begin(); it != fl.end(); ++it)
|
H A D | 2.cc | 35 std::forward_list<int> fl({0, 1, 2, 3, 4, 5, 6, 7, 8, 9}); 37 std::forward_list<int>::iterator ret = fl.insert_after(fl.before_begin(), 39 VERIFY( ret == fl.begin() ); 40 VERIFY( fl.front() == 42 ); 47 std::forward_list<int> fl({0, 1, 2, 3, 4, 5, 6, 7, 8, 9}); 49 std::forward_list<int>::const_iterator pos = fl.cbegin(); 53 std::forward_list<int>::iterator ret = fl.insert_after(pos, 0, 42); 56 ret = fl.insert_after(pos, 5, 42); 75 std::forward_list<int> fl({ [all...] |
/netbsd-6-1-5-RELEASE/lib/libc/gen/ |
H A D | lockf.c | 53 struct flock fl; variable in typeref:struct:flock 56 fl.l_start = 0; 57 fl.l_len = size; 58 fl.l_whence = SEEK_CUR; 63 fl.l_type = F_UNLCK; 67 fl.l_type = F_WRLCK; 71 fl.l_type = F_WRLCK; 74 fl.l_type = F_WRLCK; 75 if (fcntl(filedes, F_GETLK, &fl) == -1) 77 if (fl [all...] |
/netbsd-6-1-5-RELEASE/external/lgpl3/gmp/dist/mpf/ |
H A D | fits_s.h | 32 mp_limb_t fl; local 47 fl = fp[fn-1]; 52 fl = fp[fn-1]; 53 if ((fl >> GMP_NAIL_BITS) != 0) 55 fl = (fl << GMP_NUMB_BITS); 57 fl |= fp[fn-2]; 63 return fl <= (fs >= 0 ? (mp_limb_t) MAXIMUM : - (mp_limb_t) MINIMUM);
|
H A D | fits_u.h | 32 mp_limb_t fl; local 46 fl = fp[fn-1]; 51 fl = fp[fn-1]; 52 if ((fl >> GMP_NAIL_BITS) != 0) 54 fl = (fl << GMP_NUMB_BITS); 56 fl |= fp[fn-2]; 62 return fl <= MAXIMUM;
|
H A D | get_si.c | 34 fl is established in basically the same way as for mpf_get_ui, see that 38 f is a negative fraction (ie. size<0 and exp<=0) we can't let fl==0 go 39 through to the zany final "~ ((fl - 1) & LONG_MAX)", that would give 48 mp_limb_t fl; local 61 fl = 0; 64 fl = fp[abs_size-exp]; 68 fl |= fp[abs_size - exp + 1] << GMP_NUMB_BITS; 72 return fl & LONG_MAX; 75 return ~ ((fl - 1) & LONG_MAX);
|
H A D | get_ui.c | 69 mp_limb_t fl; local 75 fl = 0; 82 fl = fp[size-exp]; 86 fl += (fp[size-exp+1] << GMP_NUMB_BITS); 90 return (unsigned long) fl;
|
/netbsd-6-1-5-RELEASE/external/gpl3/gcc/dist/libstdc++-v3/testsuite/23_containers/forward_list/cons/ |
H A D | 10.cc | 40 std::forward_list<NoCopyConstructor> fl(5); 41 VERIFY( std::distance(fl.begin(), fl.end()) == 5 ); 42 for(auto it = fl.begin(); it != fl.end(); ++it)
|
/netbsd-6-1-5-RELEASE/external/bsd/libbind/dist/bsd/ |
H A D | ftruncate.c | 52 struct flock fl; local 54 fl.l_whence = 0; 55 fl.l_len = 0; 56 fl.l_start = wantsize; 57 fl.l_type = F_WRLCK; 58 return (fcntl(fd, F_FREESP, &fl));
|
/netbsd-6-1-5-RELEASE/external/gpl3/gcc/dist/libstdc++-v3/testsuite/23_containers/forward_list/operations/ |
H A D | 4.cc | 32 std::forward_list<int> fl = {99, 5, 99, 6, -5, 666, 777, 888, local 35 fl.unique(); 38 VERIFY(fl == fl2); 63 std::forward_list<int> fl = {99, 5, 99, 6, -5, 666, 777, 888, 42, 7, 0, 9}; local 65 fl.unique(Mod<int>(111)); 68 VERIFY(fl == fl2);
|
H A D | 2.cc | 32 std::forward_list<int> fl ={0, 1, 2, 3, 4, 5, 6, 7, 8, 9}; local 34 fl.remove(7); 36 std::forward_list<int>::const_iterator pos = fl.cbefore_begin();
|
H A D | 3.cc | 34 std::forward_list<int> fl ={0, 1, 2, 3, 4, 5, 6, 7, 8, 9}; local 36 fl.remove_if(std::bind2nd(std::less<int>(),5)); 38 std::forward_list<int>::const_iterator pos = fl.cbegin();
|
H A D | 7.cc | 37 std::forward_list<int> fl(order, order + n); 43 fl.reverse(); 45 VERIFY(std::lexicographical_compare(fl.begin(), fl.end(),
|
/netbsd-6-1-5-RELEASE/tools/compat/ |
H A D | flock.c | 47 struct flock fl = {0}; local 51 fl.l_type = F_WRLCK; 55 fl.l_type = F_RDLCK; 59 fl.l_type = F_UNLCK; 67 fl.l_whence = SEEK_SET; 68 rc = fcntl(fd, op & LOCK_NB ? F_SETLK : F_SETLKW, &fl);
|
/netbsd-6-1-5-RELEASE/external/gpl3/gcc/dist/gcc/testsuite/gcc.dg/cpp/ |
H A D | sysmac2.c | 14 #define fl 1.0f macro 22 float f1 = fl; /* { dg-warning "traditional C rejects" } */
|
/netbsd-6-1-5-RELEASE/gnu/dist/gcc4/gcc/testsuite/gcc.dg/cpp/ |
H A D | sysmac2.c | 14 #define fl 1.0f macro 22 float f1 = fl; /* { dg-warning "traditional C rejects" } */
|
/netbsd-6-1-5-RELEASE/tests/util/xlint/lint1/ |
H A D | d_typename_as_var.c | 13 } fl; member in struct:foo
|
/netbsd-6-1-5-RELEASE/external/gpl2/xcvs/dist/lib/ |
H A D | ftruncate.c | 33 struct flock fl; local 54 fl.l_whence = 0; 55 fl.l_len = 0; 56 fl.l_start = length; 57 fl.l_type = F_WRLCK; /* write lock on file space */ 61 indicated by fl.l_start. Will minor miracles never cease? */ 63 if (fcntl (fd, F_FREESP, &fl) < 0)
|
/netbsd-6-1-5-RELEASE/external/gpl3/binutils/dist/gas/testsuite/gas/all/ |
H A D | cofftag.d | 7 \[ 0\]\(sec -2\)\(fl 0x00\)\(ty 0\)\(scl 103\) \(nx 1\) 0x0+0000 foo.c 9 \[ 2\]\(sec 1\)\(fl 0x00\)\(ty 0\)\(scl 6\) \(nx 0\) 0x0+0000 gcc2_compiled. 10 \[ 3\]\(sec 1\)\(fl 0x00\)\(ty 0\)\(scl 6\) \(nx 0\) 0x0+0000 ___gnu_compiled_c 11 \[ 4\]\(sec -2\)\(fl 0x00\)\(ty a\)\(scl 15\) \(nx 1\) 0x0+0000 _token 13 \[ 6\]\(sec -(1|2)\)\(fl 0x00\)\(ty b\)\(scl 16\) \(nx 0\) 0x0+0000 _operator 14 \[ 7\]\(sec -(1|2)\)\(fl 0x00\)\(ty b\)\(scl 16\) \(nx 0\) 0x0+0001 _flags 15 \[ 8\]\(sec -(1|2)\)\(fl 0x00\)\(ty 0\)\(scl 102\) \(nx 1\) 0x0+0004 .eos 17 \[ 10\]\(sec 1\)\(fl 0x00\)\(ty 0\)\(scl 3\) \(nx 1\) 0x[0-9a-f]+ .text 19 \[ 12\]\(sec 2\)\(fl 0x00\)\(ty 0\)\(scl 3\) \(nx 1\) 0x[0-9a-f]+ .data 21 \[ 14\]\(sec 3\)\(fl [all...] |
/netbsd-6-1-5-RELEASE/external/gpl3/binutils/dist/gold/ |
H A D | ftruncate.c | 33 struct flock fl; local 54 fl.l_whence = 0; 55 fl.l_len = 0; 56 fl.l_start = length; 57 fl.l_type = F_WRLCK; /* write lock on file space */ 61 indicated by fl.l_start. Will minor miracles never cease? */ 63 if (fcntl (fd, F_FREESP, &fl) < 0)
|
/netbsd-6-1-5-RELEASE/external/gpl3/gcc/dist/libmudflap/testsuite/libmudflap.c/ |
H A D | pass45-frag.c | 17 size_t fl = strlen (f) + 1; local 18 char a[pl + 1 + fl]; 20 char b[pl + 5 + fl * 2]; 27 memcpy (cp, f, fl);
|
/netbsd-6-1-5-RELEASE/usr.sbin/rpc.lockd/ |
H A D | lockd_lock.c | 147 struct file_lock *fl; local 149 LIST_FOREACH(fl, &lcklst_head, lcklst) { 151 newfl->client.svid != fl->client.svid) 154 strcmp(newfl->client_name, fl->client_name) != 0) 157 fhcmp(&newfl->filehandle, &fl->filehandle) != 0) 163 return fl; 176 struct file_lock *fl; local 187 LIST_FOREACH(fl, &lcklst_head, lcklst) { 188 if (fl->status != LKST_LOCKED) 190 if (fhcmp(&fl 216 struct file_lock *fl, *newfl; local 360 struct file_lock *fl; local 422 lfree(struct file_lock *fl) argument 437 struct file_lock *fl; local 506 do_lock(struct file_lock *fl, int block) argument 610 send_granted(struct file_lock *fl, int opcode) argument 689 struct file_lock *fl; local 813 struct file_lock *fl, *next_fl; local [all...] |