Add a small missed optimization: turn X == C ? X : Y into X == C ? C : Y. This
[llvm/stm8.git] / lib / CodeGen / MachinePassRegistry.cpp
blob9f4ef1287803c43d13971f3762736b1c018a57cd
1 //===-- CodeGen/MachineInstr.cpp ------------------------------------------===//
2 //
3 // The LLVM Compiler Infrastructure
4 //
5 // This file is distributed under the University of Illinois Open Source
6 // License. See LICENSE.TXT for details.
7 //
8 //===----------------------------------------------------------------------===//
9 //
10 // This file contains the machine function pass registry for register allocators
11 // and instruction schedulers.
13 //===----------------------------------------------------------------------===//
15 #include "llvm/CodeGen/MachinePassRegistry.h"
17 using namespace llvm;
20 /// Add - Adds a function pass to the registration list.
21 ///
22 void MachinePassRegistry::Add(MachinePassRegistryNode *Node) {
23 Node->setNext(List);
24 List = Node;
25 if (Listener) Listener->NotifyAdd(Node->getName(),
26 Node->getCtor(),
27 Node->getDescription());
31 /// Remove - Removes a function pass from the registration list.
32 ///
33 void MachinePassRegistry::Remove(MachinePassRegistryNode *Node) {
34 for (MachinePassRegistryNode **I = &List; *I; I = (*I)->getNextAddress()) {
35 if (*I == Node) {
36 if (Listener) Listener->NotifyRemove(Node->getName());
37 *I = (*I)->getNext();
38 break;