Home
last modified time | relevance | path

Searched refs:first (Results 1 – 25 of 3528) sorted by relevance

12345678910>>...142

/openbsd-src/gnu/lib/libiberty/src/
H A Dconcat.c70 vconcat_length (const char *first, va_list args) in vconcat_length() argument
75 for (arg = first; arg ; arg = va_arg (args, const char *)) in vconcat_length()
82 vconcat_copy (char *dst, const char *first, va_list args) in vconcat_copy() argument
87 for (arg = first; arg ; arg = va_arg (args, const char *)) in vconcat_copy()
101 concat_length (const char *first, ...) in concat_length() argument
105 VA_OPEN (args, first); in concat_length()
106 VA_FIXEDARG (args, const char *, first); in concat_length()
107 length = vconcat_length (first, args); in concat_length()
116 concat_copy (char *dst, const char *first, ...) in concat_copy() argument
120 VA_OPEN (args, first); in concat_copy()
[all …]
/openbsd-src/sys/dev/pci/drm/include/linux/
H A Dllist.h13 struct llist_node *first; member
21 return atomic_swap_ptr(&head->first, NULL); in llist_del_all()
27 struct llist_node *first, *next; in llist_del_first() local
30 first = head->first; in llist_del_first()
31 if (first == NULL) in llist_del_first()
33 next = first->next; in llist_del_first()
34 } while (atomic_cas_ptr(&head->first, first, next) != first); in llist_del_first()
36 return first; in llist_del_first()
42 struct llist_node *first; in llist_add() local
45 new->next = first = head->first; in llist_add()
[all …]
/openbsd-src/gnu/usr.bin/perl/cpan/Scalar-List-Utils/t/
H A Dfirst.t6 use List::Util qw(first);
11 ok(defined &first, 'defined');
13 $v = first { 8 == ($_ - 1) } 9,4,5,6;
16 $v = first { 0 } 1,2,3,4;
19 $v = first { 0 };
22 $v = first { $_->[1] le "e" and "e" le $_->[2] }
28 $v = first { eval { die }; ($i == 5, $i = $_)[0] } 0,1,2,3,4,5,5;
31 $v = eval { first { die if $_ } 0,0,1 };
34 sub foobar { first { !defined(wantarray) || wantarray } "not ","not ","not " }
40 $v = first {return ($_>6)} 2,4,6,12;
[all …]
/openbsd-src/gnu/usr.bin/perl/lib/Getopt/
H A DStd.pm103 my ($first, $rest);
108 ($first, $rest) = ($1, $2);
113 if (index($argumentative, $first) >= 0) {
122 $$hash{$first} = $rest;
126 ${"opt_$first"} = $rest;
127 push( @EXPORT, "\$opt_$first" );
132 $$hash{$first} = 1;
136 ${"opt_$first"} = 1;
137 push( @EXPORT, "\$opt_$first" );
236 my (@args, $first,
[all...]
/openbsd-src/games/hack/
H A Dhack.o_init.c86 int i, j, first, last, sum, end; in init_objects() local
92 first = 0; in init_objects()
93 while( first < end ) { in init_objects()
94 let = objects[first].oc_olet; in init_objects()
95 last = first+1; in init_objects()
102 bases[i] = first; in init_objects()
108 for(j = first; j < last; j++) sum += objects[j].oc_prob; in init_objects()
110 for(j = first; j < last; j++) in init_objects()
111 objects[j].oc_prob = (100+j-first)/(last-first); in init_objects()
117 if(objects[first].oc_descr != NULL && let != TOOL_SYM){ in init_objects()
[all …]
/openbsd-src/usr.bin/lex/
H A Dnfa.c303 * new = link_machines( first, last );
305 * new - a machine constructed by connecting first to last
306 * first - the machine whose successor is to be last
307 * last - the machine whose predecessor is to be first
309 * note: this routine concatenates the machine first with the machine
310 * last to produce a machine new which will pattern-match first first
316 link_machines(int first, int last)
318 if (first == NIL)
322 return first; in link_machines() argument
393 mkbranch(first,second) mkbranch() argument
482 mkor(first,second) mkor() argument
[all...]
/openbsd-src/gnu/llvm/compiler-rt/lib/orc/
H A Dinterval_map.h39 return LHS.first < RHS; in operator()
42 return LHS < RHS.first; in operator()
65 if (empty() || K < begin()->first.first || in find()
66 K >= std::prev(end())->first.second) in find()
72 if (K < I->first.second) in find()
99 if (KS >= I->first.second) in erase()
103 assert(KE <= I->first.second); in erase()
109 if (KE < Tmp.first.second) { in erase()
111 J, std::make_pair(std::make_pair(KE, Tmp.first.second), Tmp.second)); in erase()
116 if (KS > Tmp.first.first) in erase()
[all …]
/openbsd-src/gnu/lib/libstdc++/libstdc++/testsuite/25_algorithms/
H A Dbinary_search.cc49 const int first = A[0]; in test01() local
55 const int* q = lower_bound(A, A + N, first); in test01()
67 const int* u = lower_bound(C, C + N, first, gt()); in test01()
83 const int first = A[0]; in test02() local
89 const int* q = upper_bound(A, A + N, first); in test02()
101 const int* u = upper_bound(C, C + N, first, gt()); in test02()
118 const int first = A[0]; in test03() local
122 VERIFY(p.first == A + 2); in test03()
125 Ipair q = equal_range(A, A + N, first); in test03()
126 VERIFY(q.first == A + 0); in test03()
[all …]
/openbsd-src/gnu/usr.bin/perl/lib/B/
H A DDeparse.pm309 # pad ops, or for (2), set it to sibling->first, which is
337 ->first # qr
344 $self-> _pessimise_walk($op->first);
443 # declaration to sync with the first COP of the sub
573 my $lineseq = $root->first;
576 my $req_op = $lineseq->first->sibling;
580 return if ($req_op->first->name ne 'const');
583 if ($req_op->first->private & OPpCONST_BARE) {
585 $module = $self->const_sv($req_op->first)->PV;
590 $module = $self->const($self->const_sv($req_op->first),
[all...]
/openbsd-src/usr.bin/netstat/
H A Dinet6.c330 int first, i; in ip6_stats() local
374 for (first = 1, i = 0; i < 256; i++) in ip6_stats()
376 if (first) { in ip6_stats()
378 first = 0; in ip6_stats()
394 for (first = 1, i = 0; i < 32; i++) { in ip6_stats()
397 if (first) { in ip6_stats()
399 first = 0; in ip6_stats()
435 for (first = 1, i = 0; i < 16; i++) { in ip6_stats()
437 if (first) { in ip6_stats()
439 first = 0; in ip6_stats()
[all …]
/openbsd-src/gnu/llvm/clang/lib/Tooling/
H A DNodeIntrospection.cpp64 if (LHS.first.getBegin() < RHS.first.getBegin()) in operator ()()
66 else if (LHS.first.getBegin() != RHS.first.getBegin()) in operator ()()
69 if (LHS.first.getEnd() < RHS.first.getEnd()) in operator ()()
71 else if (LHS.first.getEnd() != RHS.first.getEnd()) in operator ()()
79 if (LHS.first == RHS.first) in operator ()()
81 return LHS.first < RHS.first; in operator ()()
/openbsd-src/gnu/llvm/llvm/lib/TableGen/
H A DStringMatcher.cpp32 for (unsigned i = 0, e = Matches[0]->first.size(); i != e; ++i) { in FindFirstNonCommonLetter()
34 char Letter = Matches[0]->first[i]; in FindFirstNonCommonLetter()
37 if (Match->first[i] != Letter) in FindFirstNonCommonLetter()
41 return Matches[0]->first.size(); in FindFirstNonCommonLetter()
57 if (CharNo == Matches[0]->first.size()) { in EmitStringMatcherForChar()
65 OS << Indent << Split.first << "\t // \"" << Matches[0]->first << "\"\n"; in EmitStringMatcherForChar()
70 OS << Indent << Split.first << "\n"; in EmitStringMatcherForChar()
80 MatchesByLetter[Match->first[CharNo]].push_back(Match); in EmitStringMatcherForChar()
93 << Matches[0]->first[CharNo] << "')\n"; in EmitStringMatcherForChar()
99 << ", \"" << Matches[0]->first.substr(CharNo, NumChars) << "\", " in EmitStringMatcherForChar()
[all …]
/openbsd-src/gnu/gcc/libstdc++-v3/include/ext/pb_ds/
H A Dassoc_container.hpp218 cc_hash_table(It first, It last) in cc_hash_table() argument
219 { base_type::copy_from_range(first, last); } in cc_hash_table()
225 cc_hash_table(It first, It last, const hash_fn& h) in cc_hash_table() argument
227 { copy_from_range(first, last); } in cc_hash_table()
236 cc_hash_table(It first, It last, const hash_fn& h, const eq_fn& e) in cc_hash_table() argument
238 { copy_from_range(first, last); } in cc_hash_table()
248 cc_hash_table(It first, It last, const hash_fn& h, const eq_fn& e, in cc_hash_table() argument
251 { copy_from_range(first, last); } in cc_hash_table()
262 cc_hash_table(It first, It last, const hash_fn& h, const eq_fn& e, in cc_hash_table() argument
265 { copy_from_range(first, last); } in cc_hash_table()
[all …]
/openbsd-src/gnu/usr.bin/cvs/src/
H A Dlog.c25 char *first; member
45 char *first; member
351 if (rp->first != NULL)
352 send_to_server (rp->first, 0);
357 if (rp->first != NULL)
358 send_to_server (rp->first, 0);
366 if (rp->first)
367 free (rp->first);
422 if (log_data.revlist->first)
423 free (log_data.revlist->first);
[all …]
/openbsd-src/gnu/lib/libstdc++/libstdc++/include/bits/
H A Dstl_pair.h73 _T1 first; ///< @c first is a copy of the first object member
79 pair() : first(), second() {} in pair()
81 pair() : first(_T1()), second(_T2()) {} in pair()
84 pair(const _T1& __a, const _T2& __b) : first(__a), second(__b) {} in pair()
88 pair(const pair<_U1, _U2>& __p) : first(__p.first), second(__p.second) {} in pair()
95 return __x.first == __y.first && __x.second == __y.second;
102 return __x.first < __y.first ||
103 (!(__y.first < __x.first) && __x.second < __y.second);
/openbsd-src/gnu/usr.bin/perl/dist/ExtUtils-ParseXS/t/
H A D513-t-merge.t29 my $first = ExtUtils::Typemaps->new(file => $first_typemap_file);
30 isa_ok($first, 'ExtUtils::Typemaps');
34 $first->merge(typemap => $second);
36 is($first->as_string(), slurp($combined_typemap_file), "merging produces expected output");
41 my $first = ExtUtils::Typemaps->new(file => $first_typemap_file);
42 isa_ok($first, 'ExtUtils::Typemaps');
44 $first->merge(file => $second_typemap_file);
46 is($first->as_string(), slurp($combined_typemap_file), "merging produces expected output");
52 my $first = ExtUtils::Typemaps->new(file => $first_typemap_file);
53 isa_ok($first, 'ExtUtils::Typemaps');
[all …]
/openbsd-src/usr.bin/seq/
H A Dseq.c89 double first = 1.0; in main() local
150 first = e_atof(argv[0]); in main()
156 errx(1, "zero %screment", (first < last) ? "in" : "de"); in main()
161 incr = (first < last) ? 1.0 : -1.0; in main()
163 if (incr <= 0.0 && first < last) in main()
166 if (incr >= 0.0 && first > last) in main()
177 fmt = generate_format(first, incr, last, equalize, pad); in main()
179 for (step = 1, cur = first; incr > 0 ? cur <= last : cur >= last; in main()
180 cur = first + incr * step++) { in main()
181 if (cur != first) in main()
[all …]
/openbsd-src/gnu/usr.bin/binutils-2.17/binutils/
H A Dresbin.c172 int first; in get_resid() local
177 first = get_16 (big_endian, data); in get_resid()
178 if (first == 0xffff) in get_resid()
292 struct menuitem *first, **pp; in bin_to_res_menuitems() local
294 first = NULL; in bin_to_res_menuitems()
295 pp = &first; in bin_to_res_menuitems()
358 return first; in bin_to_res_menuitems()
361 return first; in bin_to_res_menuitems()
370 struct menuitem *first, **pp; in bin_to_res_menuexitems() local
372 first = NULL; in bin_to_res_menuexitems()
[all …]
/openbsd-src/gnu/usr.bin/perl/cpan/Pod-Perldoc/lib/Pod/Perldoc/
H A DGetOptsOO.pm33 my($first,$rest) = ($1,$2);
38 if ($first eq '-' and $rest) { # GNU style long param names
39 ($first, $rest) = split '=', $rest, 2;
41 my $method = "opt_${first}_with";
45 $target->warn( "Option $first needs a following argument!\n" ) unless @$args;
57 if( $target->can( $method = "opt_$first" ) ) {
65 and print " calling handle_unknown_option('$first')\n";
68 $target->handle_unknown_option( $first ) || 0
73 $target->warn( "Unknown option: $first\n" );
/openbsd-src/gnu/llvm/libcxx/include/__utility/
H A Dpair.h71 _T1 first; member
79 pair() : first(), second() {} in pair()
82 pair(_T1 const& __t1, _T2 const& __t2) : first(__t1), second(__t2) {} in pair()
86 pair(const pair<_U1, _U2>& __p) : first(__p.first), second(__p.second) {} in pair()
90 first = __p.first;
168 : first(), second() {} in pair()
176 : first(), second() {} in pair()
185 : first(__t1), second(__t2) {} in pair()
194 : first(__t1), second(__t2) {} in pair()
208 : first(_VSTD::forward<_U1>(__u1)), second(_VSTD::forward<_U2>(__u2)) {} in pair()
[all …]
/openbsd-src/gnu/usr.bin/gcc/gcc/
H A Det-forest.c69 et_forest_occurrence_t first, last; member
340 et_forest_occurrence_t first = forest_node->first; local
344 splay (first);
346 if (first->left)
347 first->left->parent = 0;
348 if (first->right)
349 first->right->parent = 0;
351 if (last != first)
361 if (last->right && first->left) /* actually, first->left would suffice. */
366 prev_node = splay (find_rightmost_node (first->left));
[all …]
/openbsd-src/gnu/gcc/libstdc++-v3/include/bits/
H A Dstl_pair.h73 _T1 first; ///< @c first is a copy of the first object member
81 : first(), second() { } in pair()
85 : first(__a), second(__b) { } in pair()
90 : first(__p.first), second(__p.second) { } in pair()
97 { return __x.first == __y.first && __x.second == __y.second; }
103 { return __x.first < __y.first
104 || (!(__y.first < __x.first) && __x.second < __y.second); }
/openbsd-src/gnu/usr.bin/binutils/binutils/
H A Dresbin.c172 int first; in get_resid() local
177 first = get_16 (big_endian, data); in get_resid()
178 if (first == 0xffff) in get_resid()
292 struct menuitem *first, **pp; in bin_to_res_menuitems() local
294 first = NULL; in bin_to_res_menuitems()
295 pp = &first; in bin_to_res_menuitems()
358 return first; in bin_to_res_menuitems()
361 return first; in bin_to_res_menuitems()
370 struct menuitem *first, **pp; in bin_to_res_menuexitems() local
372 first = NULL; in bin_to_res_menuexitems()
[all …]
/openbsd-src/regress/usr.bin/mandoc/roff/de/
H A Descname.out_ascii11 define first\second = val3
13 define first = val1
15 define first\.second = val_dot
17 define first\Gsecond = val_inval
20 first val1
22 first\second val3
23 first.second val_dot
24 first\.second val_dot
26 first\Gsecond val_inval
/openbsd-src/gnu/usr.bin/perl/t/op/
H A Drange.t231 my ($first, $last);
235 if (! defined($first)) {
236 $first = $_;
244 is($first, $MAX_INT-10, 'Lower bound okay');
252 my ($first, $last);
256 if (! defined($first)) {
257 $first = $_;
265 is($first, $MAX_INT+$ii, 'Lower bound okay');
273 my $first;
277 if (! defined($first)) {
[all …]

12345678910>>...142