Lines Matching defs:GenericNode
19 GenericNode<B, S>::GenericNode(GenericGraphBase* graph, int input_count)
30 inline void GenericNode<B, S>::AssignUniqueID(GenericGraphBase* graph) {
35 inline typename GenericNode<B, S>::Inputs::iterator
36 GenericNode<B, S>::Inputs::begin() {
37 return typename GenericNode<B, S>::Inputs::iterator(this->node_, 0);
41 inline typename GenericNode<B, S>::Inputs::iterator
42 GenericNode<B, S>::Inputs::end() {
43 return typename GenericNode<B, S>::Inputs::iterator(
48 inline typename GenericNode<B, S>::Uses::iterator
49 GenericNode<B, S>::Uses::begin() {
50 return typename GenericNode<B, S>::Uses::iterator(this->node_);
54 inline typename GenericNode<B, S>::Uses::iterator
55 GenericNode<B, S>::Uses::end() {
56 return typename GenericNode<B, S>::Uses::iterator();
60 void GenericNode<B, S>::ReplaceUses(GenericNode* replace_to) {
82 void GenericNode<B, S>::ReplaceUsesIf(UnaryPredicate pred,
83 GenericNode* replace_to) {
96 void GenericNode<B, S>::RemoveAllInputs() {
104 void GenericNode<B, S>::TrimInputCount(int new_input_count) {
111 typename GenericNode<B, S>::Input* input = GetInputRecordPtr(i);
118 void GenericNode<B, S>::ReplaceInput(int index, GenericNode<B, S>* new_to) {
124 void GenericNode<B, S>::Input::Update(GenericNode<B, S>* new_to) {
125 GenericNode* old_to = this->to;
142 void GenericNode<B, S>::EnsureAppendableInputs(Zone* zone) {
155 void GenericNode<B, S>::AppendInput(Zone* zone, GenericNode<B, S>* to_append) {
169 void GenericNode<B, S>::InsertInput(Zone* zone, int index,
170 GenericNode<B, S>* to_insert) {
181 void GenericNode<B, S>::RemoveInput(int index) {
191 void GenericNode<B, S>::AppendUse(Use* use) {
204 void GenericNode<B, S>::RemoveUse(Use* use) {
220 inline bool GenericNode<B, S>::OwnedBy(GenericNode* owner) const {
226 S* GenericNode<B, S>::New(GenericGraphBase* graph, int input_count,
228 size_t node_size = sizeof(GenericNode);
241 GenericNode* to = *inputs++;
