Lines Matching refs:node
672 struct msg_chain *node, *prev_node;
677 * The starting search position is either the first node
679 * The current_elem is the pointer to the node which
700 * Search starts from the node pointed by p1.
711 /* move to the next node */
715 /* insert a new msg node */
716 node = (struct msg_chain *)
718 node->next = p1;
719 node->msgid = Xstrdup(msgid);
720 node->msgstr = Xstrdup(msgstr);
723 prev_node->next = node;
725 dom->first_elem = node;
727 dom->current_elem = node;
737 node = (struct msg_chain *)
739 node->next = NULL;
740 node->msgid = Xstrdup(msgid);
741 node->msgstr = Xstrdup(msgstr);
744 prev_node->next = node;
746 dom->first_elem = node;
748 dom->current_elem = node;
759 * If not found, then create a new node.
765 struct domain_struct *node;
788 /* node found */
792 /* move to the next node */
796 /* insert a new domain node */
797 node = (struct domain_struct *)
799 node->next = p1;
800 node->domain = Xstrdup(domain_name);
801 node->first_elem = NULL;
802 node->current_elem = NULL;
804 /* insert the node in the middle */
805 prev_node->next = node;
807 /* node inserted is the smallest */
808 first_domain = node;
810 last_used_domain = node;
811 return (node);
819 node = (struct domain_struct *)
821 node->next = NULL;
822 node->domain = Xstrdup(domain_name);
823 node->first_elem = NULL;
824 node->current_elem = NULL;
827 prev_node->next = node;
830 first_domain = node;
832 last_used_domain = node;
834 return (node);