Home
last modified time | relevance | path

Searched refs:replacable (Results 1 – 2 of 2) sorted by relevance

/external/libchrome/base/containers/
Dflat_tree.h37 Iterator replacable = std::adjacent_find(first, last, compare); in LastUnique() local
40 if (replacable == last) in LastUnique()
43 first = std::next(replacable); in LastUnique()
47 return replacable; in LastUnique()
53 *replacable++ = std::move(*first); in LastUnique()
57 *replacable++ = std::move(*first); in LastUnique()
58 return replacable; in LastUnique()
/external/llvm-project/llvm/test/Transforms/LICM/
Dsinking.ll399 ; a non-trivially replacable PHI node.
441 ; non-trivially replacable PHI in LCSSA is critical.
480 ; Sink through a non-trivially replacable PHI node which use the same sinkable
521 ; Sink a sinkable instruction through multiple non-trivially replacable PHIs in
574 ; Sink a sinkable instruction through both trivially and non-trivially replacable PHIs.
618 ; Do not sink an instruction through a non-trivially replacable PHI, to avoid
646 ; Do not sink through a non-trivially replacable PHI if splitting predecessors