OpenGrok
Home
Sort by:
relevance
|
last modified time
|
path
Full Search
in project(s):
src
xsrc
Definition
Symbol
File Path
History
|
|
Help
Searched
refs:champ
(Results
1 - 4
of
4
) sorted by relevancy
/src/external/gpl3/gcc/dist/gcc/cp/
call.cc
13504
struct z_candidate **
champ
= &candidates, **challenger;
local
13508
/* Walk through the list once, comparing each current
champ
to the next
13513
fate = joust (*
champ
, *challenger, 0, complain);
13518
previous_worse_champ = *
champ
;
13519
champ
= challenger;
13525
champ
= &(*challenger)->next;
13526
if (!*
champ
|| !(*
champ
)->viable
13527
|| (*
champ
)->viable < (*challenger)->viable)
13529
champ
= nullptr
[
all
...]
pt.cc
2086
tree
champ
= candidates;
local
2087
for (tree c = TREE_CHAIN (
champ
); c; c = TREE_CHAIN (c))
2089
int winner = more_constrained (get_template_for_ordering (
champ
),
2092
champ
= c; // The candidate is more constrained
2097
// Verify that the
champ
is better than previous candidates.
2098
for (tree c = candidates; c !=
champ
; c = TREE_CHAIN (c)) {
2099
if (!more_constrained (get_template_for_ordering (
champ
),
2104
return
champ
;
26212
tree fn,
champ
;
26216
champ
= templates
26210
tree fn,
champ
;
local
[
all
...]
/src/external/gpl3/gcc.old/dist/gcc/cp/
pt.cc
2104
tree
champ
= candidates;
local
2105
for (tree c = TREE_CHAIN (
champ
); c; c = TREE_CHAIN (c))
2107
int winner = more_constrained (get_template_for_ordering (
champ
),
2110
champ
= c; // The candidate is more constrained
2115
// Verify that the
champ
is better than previous candidates.
2116
for (tree c = candidates; c !=
champ
; c = TREE_CHAIN (c)) {
2117
if (!more_constrained (get_template_for_ordering (
champ
),
2122
return
champ
;
25633
tree fn,
champ
;
25637
champ
= templates
[
all
...]
call.cc
12559
struct z_candidate *
champ
= candidates, *challenger;
local
12563
/* Walk through the list once, comparing each current
champ
to the next
12566
for (challenger =
champ
->next; challenger; )
12568
fate = joust (
champ
, challenger, 0, complain);
12575
champ
= challenger->next;
12576
if (
champ
== 0)
12582
champ
= challenger;
12586
challenger =
champ
->next;
12590
/* Make sure the
champ
is better than all the candidates it hasn't yet
12594
challenger !=
champ
[
all
...]
Completed in 68 milliseconds
Indexes created Sat Aug 08 00:24:54 UTC 2026