root               37 daemons/based/based_common.c cib_prepare_common(xmlNode * root, const char *section)
root               42 daemons/based/based_common.c     if (root == NULL) {
root               45 daemons/based/based_common.c     } else if (pcmk__strcase_any_of(crm_element_name(root), XML_TAG_FRAGMENT,
root               47 daemons/based/based_common.c         data = first_named_child(root, XML_TAG_CIB);
root               50 daemons/based/based_common.c         data = root;
root               67 daemons/based/based_io.c     xmlNode *root = NULL;
root               71 daemons/based/based_io.c     switch (cib_file_read_and_verify(filename, sigfile, &root)) {
root               83 daemons/based/based_io.c     return root;
root              194 daemons/based/based_io.c     xmlNode *root = NULL;
root              209 daemons/based/based_io.c     root = retrieveCib(filename, sigfilepath);
root              213 daemons/based/based_io.c     if (root == NULL) {
root              221 daemons/based/based_io.c     while (root == NULL && lpc > 1) {
root              231 daemons/based/based_io.c         if (cib_file_read_and_verify(filename, sigfile, &root) < 0) {
root              243 daemons/based/based_io.c     if (root == NULL) {
root              244 daemons/based/based_io.c         root = createEmptyCib(0);
root              255 daemons/based/based_io.c     status = find_xml_node(root, XML_CIB_TAG_STATUS, FALSE);
root              262 daemons/based/based_io.c         create_xml_node(root, XML_CIB_TAG_STATUS);
root              269 daemons/based/based_io.c     value = crm_element_value(root, name);
root              277 daemons/based/based_io.c         crm_xml_add_int(root, name, 0);
root              281 daemons/based/based_io.c     value = crm_element_value(root, name);
root              283 daemons/based/based_io.c         crm_xml_add_int(root, name, 0);
root              287 daemons/based/based_io.c     value = crm_element_value(root, name);
root              289 daemons/based/based_io.c         crm_xml_add_int(root, name, 0);
root              293 daemons/based/based_io.c     xml_remove_prop(root, XML_ATTR_DC_UUID);
root              296 daemons/based/based_io.c         crm_log_xml_trace(root, "[on-disk]");
root              299 daemons/based/based_io.c     validation = crm_element_value(root, XML_ATTR_VALIDATION);
root              300 daemons/based/based_io.c     if (validate_xml(root, NULL, TRUE) == FALSE) {
root              307 daemons/based/based_io.c         update_validation(&root, &version, 0, FALSE, FALSE);
root              317 daemons/based/based_io.c     return root;
root              220 include/crm/cib/internal.h                              xmlNode **root);
root              160 include/crm/common/xml.h int find_xml_children(xmlNode ** children, xmlNode * root,
root              185 include/crm/common/xml.h gboolean xml_has_children(const xmlNode * root);
root              194 include/crm/services.h     GList *get_directory_list(const char *root, gboolean files, gboolean executable);
root               99 lib/cib/cib_file.c cib_file_verify_digest(xmlNode *root, const char *sigfile)
root              120 lib/cib/cib_file.c     passed = pcmk__verify_digest(root, expected);
root              141 lib/cib/cib_file.c cib_file_read_and_verify(const char *filename, const char *sigfile, xmlNode **root)
root              149 lib/cib/cib_file.c     if (root) {
root              150 lib/cib/cib_file.c         *root = NULL;
root              183 lib/cib/cib_file.c     if (root) {
root              184 lib/cib/cib_file.c         *root = local_root;
root              331 lib/cib/cib_file.c cib_file_prepare_xml(xmlNode *root)
root              336 lib/cib/cib_file.c     crm_xml_add(root, XML_ATTR_NUMUPDATES, "0");
root              337 lib/cib/cib_file.c     pcmk__xe_add_last_written(root);
root              341 lib/cib/cib_file.c     cib_status_root = find_xml_node(root, XML_CIB_TAG_STATUS, TRUE);
root              557 lib/cib/cib_file.c     xmlNode *root = NULL;
root              565 lib/cib/cib_file.c     root = filename2xml(filename);
root              566 lib/cib/cib_file.c     if (root == NULL) {
root              571 lib/cib/cib_file.c     if (find_xml_node(root, XML_CIB_TAG_STATUS, FALSE) == NULL) {
root              572 lib/cib/cib_file.c         create_xml_node(root, XML_CIB_TAG_STATUS);
root              576 lib/cib/cib_file.c     if (validate_xml(root, NULL, TRUE) == FALSE) {
root              577 lib/cib/cib_file.c         const char *schema = crm_element_value(root, XML_ATTR_VALIDATION);
root              580 lib/cib/cib_file.c         free_xml(root);
root              585 lib/cib/cib_file.c     in_mem_cib = root;
root               88 lib/common/crmcommon_private.h xmlNode *pcmk__xc_match(xmlNode *root, xmlNode *search_comment, bool exact);
root               67 lib/common/output_html.c     xmlNode *root;
root               81 lib/common/output_html.c     xmlFreeNode(priv->root);
root              106 lib/common/output_html.c     priv->root = create_xml_node(NULL, "html");
root              107 lib/common/output_html.c     xmlCreateIntSubset(priv->root->doc, (pcmkXmlStr) "html", NULL, NULL);
root              109 lib/common/output_html.c     crm_xml_add(priv->root, "lang", "en");
root              110 lib/common/output_html.c     g_queue_push_tail(priv->parent_q, priv->root);
root              134 lib/common/output_html.c     if (priv == NULL || priv->root == NULL) {
root              177 lib/common/output_html.c     xmlAddPrevSibling(priv->root->children, head_node);
root              186 lib/common/output_html.c         htmlDocDump(out->dest, priv->root->doc);
root              190 lib/common/output_html.c         *copy_dest = copy_xml(priv->root);
root               75 lib/common/output_xml.c     xmlNode *root;
root               90 lib/common/output_xml.c     free_xml(priv->root);
root              114 lib/common/output_xml.c         priv->root = create_xml_node(NULL, "crm_mon");
root              115 lib/common/output_xml.c         crm_xml_add(priv->root, "version", PACEMAKER_VERSION);
root              117 lib/common/output_xml.c         priv->root = create_xml_node(NULL, "pacemaker-result");
root              118 lib/common/output_xml.c         crm_xml_add(priv->root, "api-version", PCMK__API_VERSION);
root              121 lib/common/output_xml.c             crm_xml_add(priv->root, "request", out->request);
root              127 lib/common/output_xml.c     g_queue_push_tail(priv->parent_q, priv->root);
root              156 lib/common/output_xml.c     if (priv == NULL || priv->root == NULL) {
root              174 lib/common/output_xml.c         node = create_xml_node(priv->root, "status");
root              188 lib/common/output_xml.c         char *buf = dump_xml_formatted_with_text(priv->root);
root              195 lib/common/output_xml.c         *copy_dest = copy_xml(priv->root);
root              445 lib/common/xml.c find_xml_node(xmlNode * root, const char *search_path, gboolean must_find)
root              450 lib/common/xml.c     if (root != NULL) {
root              451 lib/common/xml.c         name = crm_element_name(root);
root              459 lib/common/xml.c     for (a_child = pcmk__xml_first_child(root); a_child != NULL;
root              469 lib/common/xml.c     } else if (root != NULL) {
root             2435 lib/common/xml.c pcmk__xc_match(xmlNode *root, xmlNode *search_comment, bool exact)
root             2442 lib/common/xml.c     for (a_child = pcmk__xml_first_child(root); a_child != NULL;
root             2647 lib/common/xml.c find_xml_children(xmlNode ** children, xmlNode * root,
root             2652 lib/common/xml.c     CRM_CHECK(root != NULL, return FALSE);
root             2655 lib/common/xml.c     if (tag != NULL && !pcmk__str_eq(tag, crm_element_name(root), pcmk__str_casei)) {
root             2657 lib/common/xml.c     } else if (value != NULL && !pcmk__str_eq(value, crm_element_value(root, field), pcmk__str_casei)) {
root             2663 lib/common/xml.c         add_node_copy(*children, root);
root             2670 lib/common/xml.c         for (child = pcmk__xml_first_child(root); child != NULL;
root             1055 lib/services/services.c get_directory_list(const char *root, gboolean files, gboolean executable)
root             1057 lib/services/services.c     return services_os_get_directory_list(root, files, executable);
root             1361 lib/services/services_linux.c services_os_get_single_directory_list(const char *root, gboolean files, gboolean executable)
root             1368 lib/services/services_linux.c     entries = scandir(root, &namelist, NULL, alphasort);
root             1381 lib/services/services_linux.c         snprintf(buffer, sizeof(buffer), "%s/%s", root, namelist[lpc]->d_name);
root             1416 lib/services/services_linux.c services_os_get_directory_list(const char *root, gboolean files, gboolean executable)
root             1419 lib/services/services_linux.c     char *dirs = strdup(root);
root               30 lib/services/services_ocf.c services_os_get_directory_list_provider(const char *root, const char *provider,
root               34 lib/services/services_ocf.c     char *dirs = strdup(root);
root               51 lib/services/services_private.h GList *services_os_get_single_directory_list(const char *root, gboolean files,
root               55 lib/services/services_private.h GList *services_os_get_directory_list(const char *root, gboolean files, gboolean executable);
root              364 maint/gnulib/lib/fts.c         register FTSENT *p, *root;
root              465 maint/gnulib/lib/fts.c         for (root = NULL, nitems = 0; *argv != NULL; ++argv, ++nitems) {
root              487 maint/gnulib/lib/fts.c                 if (defer_stat && root != NULL) {
root              499 maint/gnulib/lib/fts.c                         p->fts_link = root;
root              500 maint/gnulib/lib/fts.c                         root = p;
root              503 maint/gnulib/lib/fts.c                         if (root == NULL)
root              504 maint/gnulib/lib/fts.c                                 tmp = root = p;
root              512 maint/gnulib/lib/fts.c                 root = fts_sort(sp, root, nitems);
root              521 maint/gnulib/lib/fts.c         sp->fts_cur->fts_link = root;
root              541 maint/gnulib/lib/fts.c mem3:   fts_lfree(root);
root               62 maint/gnulib/lib/gl_anyavltree_list1.h   struct gl_list_node_impl *root;   /* root node or NULL */
root              111 maint/gnulib/lib/gl_anyavltree_list2.h       list->root = create_subtree_with_contents (count, contents);
root              112 maint/gnulib/lib/gl_anyavltree_list2.h       if (list->root == NULL)
root              114 maint/gnulib/lib/gl_anyavltree_list2.h       list->root->parent = NULL;
root              124 maint/gnulib/lib/gl_anyavltree_list2.h     list->root = NULL;
root              130 maint/gnulib/lib/gl_anyavltree_list2.h   free_subtree (list->root);
root              182 maint/gnulib/lib/gl_anyavltree_list2.h             nodep = &list->root;
root              423 maint/gnulib/lib/gl_anyavltree_list2.h         list->root = child;
root              451 maint/gnulib/lib/gl_anyavltree_list2.h         list->root = child;
root              524 maint/gnulib/lib/gl_anyavltree_list2.h         list->root = subst;
root              560 maint/gnulib/lib/gl_anyavltree_list2.h   if (list->root == NULL)
root              562 maint/gnulib/lib/gl_anyavltree_list2.h       list->root = new_node;
root              569 maint/gnulib/lib/gl_anyavltree_list2.h       for (node = list->root; node->left != NULL; )
root              628 maint/gnulib/lib/gl_anyavltree_list2.h   if (list->root == NULL)
root              630 maint/gnulib/lib/gl_anyavltree_list2.h       list->root = new_node;
root              637 maint/gnulib/lib/gl_anyavltree_list2.h       for (node = list->root; node->right != NULL; )
root               45 maint/gnulib/lib/gl_anylinked_list1.h   struct gl_list_node_impl root;
root               64 maint/gnulib/lib/gl_anylinked_list2.h   list->root.next = &list->root;
root               65 maint/gnulib/lib/gl_anylinked_list2.h   list->root.prev = &list->root;
root              112 maint/gnulib/lib/gl_anylinked_list2.h   tail = &list->root;
root              141 maint/gnulib/lib/gl_anylinked_list2.h   tail->next = &list->root;
root              142 maint/gnulib/lib/gl_anylinked_list2.h   list->root.prev = tail;
root              150 maint/gnulib/lib/gl_anylinked_list2.h     for (node = tail; node != &list->root; )
root              223 maint/gnulib/lib/gl_anylinked_list2.h   return (node->next != &list->root ? node->next : NULL);
root              229 maint/gnulib/lib/gl_anylinked_list2.h   return (node->prev != &list->root ? node->prev : NULL);
root              236 maint/gnulib/lib/gl_anylinked_list2.h     return list->root.next;
root              245 maint/gnulib/lib/gl_anylinked_list2.h     return list->root.prev;
root              262 maint/gnulib/lib/gl_anylinked_list2.h       node = list->root.next;
root              269 maint/gnulib/lib/gl_anylinked_list2.h       node = list->root.prev;
root              288 maint/gnulib/lib/gl_anylinked_list2.h       node = list->root.next;
root              295 maint/gnulib/lib/gl_anylinked_list2.h       node = list->root.prev;
root              372 maint/gnulib/lib/gl_anylinked_list2.h           for (node = list->root.next; ; node = node->next)
root              383 maint/gnulib/lib/gl_anylinked_list2.h             for (node = list->root.prev; ; node = node->prev)
root              421 maint/gnulib/lib/gl_anylinked_list2.h             node = list->root.next;
root              441 maint/gnulib/lib/gl_anylinked_list2.h               for (node = list->root.next; node != &list->root; node = node->next)
root              452 maint/gnulib/lib/gl_anylinked_list2.h                 for (node = list->root.prev; ; node = node->prev)
root              465 maint/gnulib/lib/gl_anylinked_list2.h     gl_list_node_t node = list->root.next;
root              552 maint/gnulib/lib/gl_anylinked_list2.h             node = list->root.next;
root              578 maint/gnulib/lib/gl_anylinked_list2.h         for (; node->prev != &list->root; node = node->prev)
root              589 maint/gnulib/lib/gl_anylinked_list2.h     gl_list_node_t node = list->root.next;
root              640 maint/gnulib/lib/gl_anylinked_list2.h   node->prev = &list->root;
root              641 maint/gnulib/lib/gl_anylinked_list2.h   ASYNCSAFE(gl_list_node_t) node->next = list->root.next;
root              643 maint/gnulib/lib/gl_anylinked_list2.h   ASYNCSAFE(gl_list_node_t) list->root.next = node;
root              678 maint/gnulib/lib/gl_anylinked_list2.h   ASYNCSAFE(gl_list_node_t) node->next = &list->root;
root              679 maint/gnulib/lib/gl_anylinked_list2.h   node->prev = list->root.prev;
root              681 maint/gnulib/lib/gl_anylinked_list2.h   list->root.prev = node;
root              801 maint/gnulib/lib/gl_anylinked_list2.h       node = &list->root;
root              814 maint/gnulib/lib/gl_anylinked_list2.h       node = &list->root;
root              871 maint/gnulib/lib/gl_anylinked_list2.h       node = &list->root;
root              885 maint/gnulib/lib/gl_anylinked_list2.h       node = &list->root;
root              921 maint/gnulib/lib/gl_anylinked_list2.h   for (node = list->root.next; node != &list->root; )
root              944 maint/gnulib/lib/gl_anylinked_list2.h   result.p = list->root.next;
root              945 maint/gnulib/lib/gl_anylinked_list2.h   result.q = &list->root;
root              978 maint/gnulib/lib/gl_anylinked_list2.h       node = &list->root;
root              992 maint/gnulib/lib/gl_anylinked_list2.h       node = list->root.next;
root              997 maint/gnulib/lib/gl_anylinked_list2.h       node = &list->root;
root             1008 maint/gnulib/lib/gl_anylinked_list2.h       node = list->root.next;
root             1056 maint/gnulib/lib/gl_anylinked_list2.h   for (node = list->root.next; node != &list->root; node = node->next)
root             1089 maint/gnulib/lib/gl_anylinked_list2.h           node = list->root.next;
root             1096 maint/gnulib/lib/gl_anylinked_list2.h           node = list->root.prev;
root             1123 maint/gnulib/lib/gl_anylinked_list2.h   for (node = list->root.next, index = 0;
root             1124 maint/gnulib/lib/gl_anylinked_list2.h        node != &list->root;
root             1159 maint/gnulib/lib/gl_anylinked_list2.h           node = list->root.next;
root             1166 maint/gnulib/lib/gl_anylinked_list2.h           node = list->root.prev;
root             1193 maint/gnulib/lib/gl_anylinked_list2.h   for (node = list->root.next; node != &list->root; node = node->next)
root             1205 maint/gnulib/lib/gl_anylinked_list2.h   for (node = list->root.next; node != &list->root; node = node->next)
root               67 maint/gnulib/lib/gl_anyrbtree_list1.h   struct gl_list_node_impl *root;   /* root node or NULL */
root              126 maint/gnulib/lib/gl_anyrbtree_list2.h       list->root = create_subtree_with_contents (bh, count, contents);
root              127 maint/gnulib/lib/gl_anyrbtree_list2.h       if (list->root == NULL)
root              129 maint/gnulib/lib/gl_anyrbtree_list2.h       list->root->parent = NULL;
root              139 maint/gnulib/lib/gl_anyrbtree_list2.h     list->root = NULL;
root              145 maint/gnulib/lib/gl_anyrbtree_list2.h   free_subtree (list->root);
root              274 maint/gnulib/lib/gl_anyrbtree_list2.h             grandparentp = &list->root;
root              364 maint/gnulib/lib/gl_anyrbtree_list2.h         parentp = &list->root;
root              653 maint/gnulib/lib/gl_anyrbtree_list2.h         list->root = child;
root              685 maint/gnulib/lib/gl_anyrbtree_list2.h         list->root = child;
root              759 maint/gnulib/lib/gl_anyrbtree_list2.h         list->root = subst;
root              802 maint/gnulib/lib/gl_anyrbtree_list2.h   if (list->root == NULL)
root              805 maint/gnulib/lib/gl_anyrbtree_list2.h       list->root = new_node;
root              812 maint/gnulib/lib/gl_anyrbtree_list2.h       for (node = list->root; node->left != NULL; )
root              868 maint/gnulib/lib/gl_anyrbtree_list2.h   if (list->root == NULL)
root              871 maint/gnulib/lib/gl_anyrbtree_list2.h       list->root = new_node;
root              878 maint/gnulib/lib/gl_anyrbtree_list2.h       for (node = list->root; node->right != NULL; )
root               45 maint/gnulib/lib/gl_anytree_list2.h   list->root = NULL;
root               59 maint/gnulib/lib/gl_anytree_list2.h   return (list->root != NULL ? list->root->branch_size : 0);
root              146 maint/gnulib/lib/gl_anytree_list2.h   gl_list_node_t node = list->root;
root              159 maint/gnulib/lib/gl_anytree_list2.h   gl_list_node_t node = list->root;
root              171 maint/gnulib/lib/gl_anytree_list2.h node_at (gl_list_node_t root, size_t position)
root              174 maint/gnulib/lib/gl_anytree_list2.h   gl_list_node_t node = root;
root              198 maint/gnulib/lib/gl_anytree_list2.h   gl_list_node_t node = list->root;
root              210 maint/gnulib/lib/gl_anytree_list2.h   gl_list_node_t node = list->root;
root              255 maint/gnulib/lib/gl_anytree_list2.h         && end_index <= (list->root != NULL ? list->root->branch_size : 0)))
root              261 maint/gnulib/lib/gl_anytree_list2.h     gl_list_node_t node = list->root;
root              366 maint/gnulib/lib/gl_anytree_list2.h         && end_index <= (list->root != NULL ? list->root->branch_size : 0)))
root              372 maint/gnulib/lib/gl_anytree_list2.h     gl_list_node_t node = list->root;
root              477 maint/gnulib/lib/gl_anytree_list2.h   size_t count = (list->root != NULL ? list->root->branch_size : 0);
root              485 maint/gnulib/lib/gl_anytree_list2.h     return gl_tree_nx_add_before (list, node_at (list->root, position), elt);
root              509 maint/gnulib/lib/gl_anytree_list2.h   gl_list_node_t node = list->root;
root              521 maint/gnulib/lib/gl_anytree_list2.h   if (list->root != NULL)
root              524 maint/gnulib/lib/gl_anytree_list2.h         gl_tree_search_from_to (list, 0, list->root->branch_size, elt);
root              538 maint/gnulib/lib/gl_anytree_list2.h   gl_list_node_t node = list->root;
root              590 maint/gnulib/lib/gl_anytree_list2.h   node = list->root;
root              609 maint/gnulib/lib/gl_anytree_list2.h   size_t count = (list->root != NULL ? list->root->branch_size : 0);
root              618 maint/gnulib/lib/gl_anytree_list2.h   result.p = (start_index < count ? node_at (list->root, start_index) : NULL);
root              620 maint/gnulib/lib/gl_anytree_list2.h   result.q = (end_index < count ? node_at (list->root, end_index) : NULL);
root              673 maint/gnulib/lib/gl_anytree_list2.h   for (node = list->root; node != NULL; )
root              717 maint/gnulib/lib/gl_anytree_list2.h         && high <= (list->root != NULL ? list->root->branch_size : 0)))
root              721 maint/gnulib/lib/gl_anytree_list2.h   for (node = list->root; node != NULL; )
root              797 maint/gnulib/lib/gl_anytree_list2.h   for (node = list->root, position = 0; node != NULL; )
root              855 maint/gnulib/lib/gl_anytree_list2.h         && high <= (list->root != NULL ? list->root->branch_size : 0)))
root              859 maint/gnulib/lib/gl_anytree_list2.h   for (node = list->root, position = 0; node != NULL; )
root              935 maint/gnulib/lib/gl_anytree_list2.h   gl_list_node_t node = list->root;
root               46 maint/gnulib/lib/gl_anytree_omap.h   map->root = NULL;
root               64 maint/gnulib/lib/gl_anytree_omap.h   for (node = map->root; node != NULL; )
root               93 maint/gnulib/lib/gl_anytree_omap.h   for (node = map->root; node != NULL; )
root              126 maint/gnulib/lib/gl_anytree_omap.h   gl_omap_node_t node = map->root;
root              179 maint/gnulib/lib/gl_anytree_omap.h   for (node = map->root; node != NULL; )
root              205 maint/gnulib/lib/gl_anytree_omap.h   gl_omap_node_t node = map->root;
root              257 maint/gnulib/lib/gl_anytree_omap.h   node = map->root;
root               44 maint/gnulib/lib/gl_anytree_oset.h   set->root = NULL;
root              100 maint/gnulib/lib/gl_anytree_oset.h   for (node = set->root; node != NULL; )
root              126 maint/gnulib/lib/gl_anytree_oset.h   for (node = set->root; node != NULL; )
root              159 maint/gnulib/lib/gl_anytree_oset.h   for (node = set->root; node != NULL; )
root              181 maint/gnulib/lib/gl_anytree_oset.h   gl_oset_node_t node = set->root;
root              267 maint/gnulib/lib/gl_anytree_oset.h               node = set->root;
root              312 maint/gnulib/lib/gl_anytree_oset.h   gl_oset_node_t node = set->root;
root              362 maint/gnulib/lib/gl_anytree_oset.h   node = set->root;
root              396 maint/gnulib/lib/gl_anytree_oset.h   for (node = set->root; node != NULL; )
root              267 maint/gnulib/lib/gl_anytreehash_list1.h   gl_list_node_t node = list->root;
root               25 maint/gnulib/lib/gl_anytreehash_list2.h         && end_index <= (list->root != NULL ? list->root->branch_size : 0)))
root               56 maint/gnulib/lib/gl_anytreehash_list2.h                           if (end_index == list->root->branch_size
root               71 maint/gnulib/lib/gl_anytreehash_list2.h                               if (end_index == list->root->branch_size
root               86 maint/gnulib/lib/gl_anytreehash_list2.h                       if (start_index == 0 && end_index == list->root->branch_size)
root              111 maint/gnulib/lib/gl_anytreehash_list2.h                   if (start_index == 0 && end_index == list->root->branch_size)
root              174 maint/gnulib/lib/gl_anytreehash_list2.h     gl_list_node_t node = list->root;
root               67 maint/gnulib/lib/gl_avltree_list.c   if (list->root != NULL)
root               68 maint/gnulib/lib/gl_avltree_list.c     (void) check_invariants (list->root, NULL);
root               55 maint/gnulib/lib/gl_avltree_omap.c   if (map->root != NULL)
root               56 maint/gnulib/lib/gl_avltree_omap.c     check_invariants (map->root, NULL, &counter);
root               49 maint/gnulib/lib/gl_avltree_ordered.h   struct NODE_IMPL *root;           /* root node or NULL */
root              101 maint/gnulib/lib/gl_avltree_ordered.h             nodep = &container->root;
root              313 maint/gnulib/lib/gl_avltree_ordered.h   if (container->root == NULL)
root              315 maint/gnulib/lib/gl_avltree_ordered.h       container->root = new_node;
root              322 maint/gnulib/lib/gl_avltree_ordered.h       for (node = container->root; node->left != NULL; )
root              451 maint/gnulib/lib/gl_avltree_ordered.h         container->root = child;
root              471 maint/gnulib/lib/gl_avltree_ordered.h         container->root = child;
root              527 maint/gnulib/lib/gl_avltree_ordered.h         container->root = subst;
root               53 maint/gnulib/lib/gl_avltree_oset.c   if (set->root != NULL)
root               54 maint/gnulib/lib/gl_avltree_oset.c     check_invariants (set->root, NULL, &counter);
root               45 maint/gnulib/lib/gl_avltreehash_list.c   ((list)->root != NULL ? (list)->root->branch_size : 0)
root               89 maint/gnulib/lib/gl_avltreehash_list.c   if (list->root != NULL)
root               90 maint/gnulib/lib/gl_avltreehash_list.c     check_invariants (list->root, NULL);
root               54 maint/gnulib/lib/gl_linkedhash_map.c   struct gl_list_node_impl root;
root              105 maint/gnulib/lib/gl_linkedhash_map.c   map->root.next = &map->root;
root              106 maint/gnulib/lib/gl_linkedhash_map.c   map->root.prev = &map->root;
root              194 maint/gnulib/lib/gl_linkedhash_map.c   ASYNCSAFE(gl_list_node_t) node->next = &map->root;
root              195 maint/gnulib/lib/gl_linkedhash_map.c   node->prev = map->root.prev;
root              197 maint/gnulib/lib/gl_linkedhash_map.c   map->root.prev = node;
root              260 maint/gnulib/lib/gl_linkedhash_map.c   for (node = map->root.next; node != &map->root; )
root              286 maint/gnulib/lib/gl_linkedhash_map.c   result.p = map->root.next;
root              287 maint/gnulib/lib/gl_linkedhash_map.c   result.q = &map->root;
root               53 maint/gnulib/lib/gl_linkedhash_set.c   struct gl_list_node_impl root;
root              102 maint/gnulib/lib/gl_linkedhash_set.c   set->root.next = &set->root;
root              103 maint/gnulib/lib/gl_linkedhash_set.c   set->root.prev = &set->root;
root              182 maint/gnulib/lib/gl_linkedhash_set.c   ASYNCSAFE(gl_list_node_t) node->next = &set->root;
root              183 maint/gnulib/lib/gl_linkedhash_set.c   node->prev = set->root.prev;
root              185 maint/gnulib/lib/gl_linkedhash_set.c   set->root.prev = node;
root              245 maint/gnulib/lib/gl_linkedhash_set.c   for (node = set->root.next; node != &set->root; )
root              269 maint/gnulib/lib/gl_linkedhash_set.c   result.p = set->root.next;
root              270 maint/gnulib/lib/gl_linkedhash_set.c   result.q = &set->root;
root               68 maint/gnulib/lib/gl_rbtree_list.c   if (list->root != NULL)
root               69 maint/gnulib/lib/gl_rbtree_list.c     (void) check_invariants (list->root, NULL);
root               55 maint/gnulib/lib/gl_rbtree_omap.c   if (map->root != NULL)
root               56 maint/gnulib/lib/gl_rbtree_omap.c     check_invariants (map->root, NULL, &counter);
root               54 maint/gnulib/lib/gl_rbtree_ordered.h   struct NODE_IMPL *root;           /* root node or NULL */
root              168 maint/gnulib/lib/gl_rbtree_ordered.h             grandparentp = &container->root;
root              258 maint/gnulib/lib/gl_rbtree_ordered.h         parentp = &container->root;
root              544 maint/gnulib/lib/gl_rbtree_ordered.h   if (container->root == NULL)
root              547 maint/gnulib/lib/gl_rbtree_ordered.h       container->root = new_node;
root              554 maint/gnulib/lib/gl_rbtree_ordered.h       for (node = container->root; node->left != NULL; )
root              666 maint/gnulib/lib/gl_rbtree_ordered.h         container->root = child;
root              690 maint/gnulib/lib/gl_rbtree_ordered.h         container->root = child;
root              747 maint/gnulib/lib/gl_rbtree_ordered.h         container->root = subst;
root               53 maint/gnulib/lib/gl_rbtree_oset.c   if (set->root != NULL)
root               54 maint/gnulib/lib/gl_rbtree_oset.c     check_invariants (set->root, NULL, &counter);
root               45 maint/gnulib/lib/gl_rbtreehash_list.c   ((list)->root != NULL ? (list)->root->branch_size : 0)
root               90 maint/gnulib/lib/gl_rbtreehash_list.c   if (list->root != NULL)
root               91 maint/gnulib/lib/gl_rbtreehash_list.c     check_invariants (list->root, NULL);
root              133 maint/gnulib/lib/hamt.c   Hamt_entry *root;
root              375 maint/gnulib/lib/hamt.c   hamt->root = NULL;
root              385 maint/gnulib/lib/hamt.c   new_hamt->root = hamt->root == NULL ? NULL : copy_entry (hamt->root);
root              443 maint/gnulib/lib/hamt.c   if (hamt->root != NULL)
root              444 maint/gnulib/lib/hamt.c     free_entry (hamt->functions, hamt->root);
root              514 maint/gnulib/lib/hamt.c   if (hamt->root == NULL)
root              517 maint/gnulib/lib/hamt.c   return entry_lookup (hamt->functions, hamt->root, elt,
root              701 maint/gnulib/lib/hamt.c root_insert (const struct function_table *functions, Hamt_entry *root,
root              704 maint/gnulib/lib/hamt.c   if (root == NULL)
root              707 maint/gnulib/lib/hamt.c  return entry_insert (functions, root, elt_ptr,
root              718 maint/gnulib/lib/hamt.c   Hamt_entry *new_entry = root_insert (hamt->functions, hamt->root,
root              723 maint/gnulib/lib/hamt.c   if (new_entry == hamt->root)
root              728 maint/gnulib/lib/hamt.c   new_hamt->root = new_entry;
root              740 maint/gnulib/lib/hamt.c   new_hamt->root = root_insert (hamt->functions, hamt->root, elt_ptr, true,
root              830 maint/gnulib/lib/hamt.c root_remove (const struct function_table *functions, Hamt_entry *root,
root              833 maint/gnulib/lib/hamt.c   if (root == NULL)
root              836 maint/gnulib/lib/hamt.c   return entry_remove (functions, root, elt_ptr,
root              847 maint/gnulib/lib/hamt.c   Hamt_entry *new_entry = root_remove (hamt->functions, hamt->root, elt_ptr,
root              852 maint/gnulib/lib/hamt.c   if (new_entry == hamt->root)
root              857 maint/gnulib/lib/hamt.c   new_hamt->root = new_entry;
root              929 maint/gnulib/lib/hamt.c   if (hamt->root == NULL)
root              933 maint/gnulib/lib/hamt.c   return entry_do_while (hamt->root, proc, data, &success);
root              948 maint/gnulib/lib/hamt.c   Hamt_entry *entry = hamt->root;
root             1048 maint/gnulib/lib/hamt.c   Hamt_entry *old_root = hamt->root;
root             1049 maint/gnulib/lib/hamt.c   hamt->root = root_insert (hamt->functions, old_root, elt_ptr, false, false);
root             1050 maint/gnulib/lib/hamt.c   if (old_root != hamt->root && old_root != NULL)
root             1065 maint/gnulib/lib/hamt.c   Hamt_entry *old_root = hamt->root;
root             1066 maint/gnulib/lib/hamt.c   hamt->root = root_insert (hamt->functions, old_root, &elt, true, false);
root             1067 maint/gnulib/lib/hamt.c   if (old_root != hamt->root && old_root != NULL)
root             1078 maint/gnulib/lib/hamt.c   Hamt_entry *old_root = hamt->root;
root             1079 maint/gnulib/lib/hamt.c   hamt->root = root_remove (hamt->functions, old_root, &elt, false);
root             1080 maint/gnulib/lib/hamt.c   if (old_root != hamt->root)
root              729 maint/gnulib/lib/mountlist.c             if (re->dev == fi.dev && re->ino == fi.root)
root               35 maint/gnulib/lib/regcomp.c static reg_errcode_t preorder (bin_tree_t *root,
root               38 maint/gnulib/lib/regcomp.c static reg_errcode_t postorder (bin_tree_t *root,
root               53 maint/gnulib/lib/regcomp.c 					 Idx node, bool root);
root             1188 maint/gnulib/lib/regcomp.c postorder (bin_tree_t *root, reg_errcode_t (fn (void *, bin_tree_t *)),
root             1193 maint/gnulib/lib/regcomp.c   for (node = root; ; )
root             1220 maint/gnulib/lib/regcomp.c preorder (bin_tree_t *root, reg_errcode_t (fn (void *, bin_tree_t *)),
root             1225 maint/gnulib/lib/regcomp.c   for (node = root; ; )
root             1655 maint/gnulib/lib/regcomp.c calc_eclosure_iter (re_node_set *new_set, re_dfa_t *dfa, Idx node, bool root)
root             1720 maint/gnulib/lib/regcomp.c   if (incomplete && !root)
root             2075 maint/gnulib/lib/regcomp.c   bin_tree_t *tree, *eor, *root;
root             2084 maint/gnulib/lib/regcomp.c     root = create_tree (dfa, tree, eor, CONCAT);
root             2086 maint/gnulib/lib/regcomp.c     root = eor;
root             2087 maint/gnulib/lib/regcomp.c   if (__glibc_unlikely (eor == NULL || root == NULL))
root             2092 maint/gnulib/lib/regcomp.c   return root;
root             3741 maint/gnulib/lib/regcomp.c duplicate_tree (const bin_tree_t *root, re_dfa_t *dfa)
root             3745 maint/gnulib/lib/regcomp.c   bin_tree_t **p_new = &dup_root, *dup_node = root->parent;
root             3747 maint/gnulib/lib/regcomp.c   for (node = root; ; )
root              154 maint/gnulib/lib/tsearch.c check_tree (node root)
root              158 maint/gnulib/lib/tsearch.c   if (root == NULL)
root              160 maint/gnulib/lib/tsearch.c   root->red = 0;
root              161 maint/gnulib/lib/tsearch.c   for (p = root->left; p; p = p->left)
root              163 maint/gnulib/lib/tsearch.c   check_tree_recurse (root, 0, cnt);
root              185 maint/gnulib/lib/tsearch.c   node root = *rootp;
root              195 maint/gnulib/lib/tsearch.c       root->red = 1;
root              218 maint/gnulib/lib/tsearch.c               root->red = 0;
root              235 maint/gnulib/lib/tsearch.c               *gparentp = root;
root              285 maint/gnulib/lib/tsearch.c       node root = *rootp;
root              286 maint/gnulib/lib/tsearch.c       r = (*compar) (key, root->key);
root              288 maint/gnulib/lib/tsearch.c         return root;
root              295 maint/gnulib/lib/tsearch.c       nextp = r < 0 ? &root->left : &root->right;
root              343 maint/gnulib/lib/tsearch.c       node root = *rootp;
root              346 maint/gnulib/lib/tsearch.c       r = (*compar) (key, root->key);
root              348 maint/gnulib/lib/tsearch.c         return root;
root              350 maint/gnulib/lib/tsearch.c       rootp = r < 0 ? &root->left : &root->right;
root              368 maint/gnulib/lib/tsearch.c   node root, unchained;
root              407 maint/gnulib/lib/tsearch.c   root = *rootp;
root              409 maint/gnulib/lib/tsearch.c   r = root->right;
root              410 maint/gnulib/lib/tsearch.c   q = root->left;
root              413 maint/gnulib/lib/tsearch.c     unchained = root;
root              416 maint/gnulib/lib/tsearch.c       node *parent = rootp, *up = &root->right;
root              446 maint/gnulib/lib/tsearch.c   if (unchained != root)
root              447 maint/gnulib/lib/tsearch.c     root->key = unchained->key;
root              622 maint/gnulib/lib/tsearch.c   const_node root = (const_node) vroot;
root              624 maint/gnulib/lib/tsearch.c   if (root->left == NULL && root->right == NULL)
root              625 maint/gnulib/lib/tsearch.c     (*action) (root, leaf, level);
root              628 maint/gnulib/lib/tsearch.c       (*action) (root, preorder, level);
root              629 maint/gnulib/lib/tsearch.c       if (root->left != NULL)
root              630 maint/gnulib/lib/tsearch.c         trecurse (root->left, action, level + 1);
root              631 maint/gnulib/lib/tsearch.c       (*action) (root, postorder, level);
root              632 maint/gnulib/lib/tsearch.c       if (root->right != NULL)
root              633 maint/gnulib/lib/tsearch.c         trecurse (root->right, action, level + 1);
root              634 maint/gnulib/lib/tsearch.c       (*action) (root, endorder, level);
root              645 maint/gnulib/lib/tsearch.c   const_node root = (const_node) vroot;
root              647 maint/gnulib/lib/tsearch.c   CHECK_TREE (root);
root              649 maint/gnulib/lib/tsearch.c   if (root != NULL && action != NULL)
root              650 maint/gnulib/lib/tsearch.c     trecurse (root, action, 0);
root              665 maint/gnulib/lib/tsearch.c tdestroy_recurse (node root, __free_fn_t freefct)
root              667 maint/gnulib/lib/tsearch.c   if (root->left != NULL)
root              668 maint/gnulib/lib/tsearch.c     tdestroy_recurse (root->left, freefct);
root              669 maint/gnulib/lib/tsearch.c   if (root->right != NULL)
root              670 maint/gnulib/lib/tsearch.c     tdestroy_recurse (root->right, freefct);
root              671 maint/gnulib/lib/tsearch.c   (*freefct) ((void *) root->key);
root              673 maint/gnulib/lib/tsearch.c   free (root);
root              679 maint/gnulib/lib/tsearch.c   node root = (node) vroot;
root              681 maint/gnulib/lib/tsearch.c   CHECK_TREE (root);
root              683 maint/gnulib/lib/tsearch.c   if (root != NULL)
root              684 maint/gnulib/lib/tsearch.c     tdestroy_recurse (root, freefct);
root              143 maint/gnulib/tests/test-tsearch.c walk_tree (void *root, int expected_count)
root              150 maint/gnulib/tests/test-tsearch.c   twalk (root, walk_action);
root              171 maint/gnulib/tests/test-tsearch.c mangle_tree (enum order how, enum action what, void **root, int lag)
root              220 maint/gnulib/tests/test-tsearch.c               if (tfind (x + j, (void *const *) root, cmp_fn) != NULL)
root              225 maint/gnulib/tests/test-tsearch.c               elem = tsearch (x + j, root, cmp_fn);
root              227 maint/gnulib/tests/test-tsearch.c                   || tfind (x + j, (void *const *) root, cmp_fn) == NULL)
root              242 maint/gnulib/tests/test-tsearch.c           elem = tfind (x + j, (void *const *) root, cmp_fn);
root              243 maint/gnulib/tests/test-tsearch.c           if (elem == NULL || tdelete (x + j, root, cmp_fn) == NULL)
root              251 maint/gnulib/tests/test-tsearch.c           if (tfind (x + j, (void *const *) root, cmp_fn) == NULL)
root              267 maint/gnulib/tests/test-tsearch.c   void *root = NULL;
root              288 maint/gnulib/tests/test-tsearch.c       mangle_tree (ascending, build, &root, 0);
root              289 maint/gnulib/tests/test-tsearch.c       mangle_tree (ascending, find, &root, 0);
root              290 maint/gnulib/tests/test-tsearch.c       mangle_tree (descending, find, &root, 0);
root              291 maint/gnulib/tests/test-tsearch.c       mangle_tree (randomorder, find, &root, 0);
root              292 maint/gnulib/tests/test-tsearch.c       walk_tree (root, SIZE);
root              293 maint/gnulib/tests/test-tsearch.c       mangle_tree (ascending, delete, &root, 0);
root              295 maint/gnulib/tests/test-tsearch.c       mangle_tree (ascending, build, &root, 0);
root              296 maint/gnulib/tests/test-tsearch.c       walk_tree (root, SIZE);
root              297 maint/gnulib/tests/test-tsearch.c       mangle_tree (descending, delete, &root, 0);
root              299 maint/gnulib/tests/test-tsearch.c       mangle_tree (ascending, build, &root, 0);
root              300 maint/gnulib/tests/test-tsearch.c       walk_tree (root, SIZE);
root              301 maint/gnulib/tests/test-tsearch.c       mangle_tree (randomorder, delete, &root, 0);
root              303 maint/gnulib/tests/test-tsearch.c       mangle_tree (descending, build, &root, 0);
root              304 maint/gnulib/tests/test-tsearch.c       mangle_tree (ascending, find, &root, 0);
root              305 maint/gnulib/tests/test-tsearch.c       mangle_tree (descending, find, &root, 0);
root              306 maint/gnulib/tests/test-tsearch.c       mangle_tree (randomorder, find, &root, 0);
root              307 maint/gnulib/tests/test-tsearch.c       walk_tree (root, SIZE);
root              308 maint/gnulib/tests/test-tsearch.c       mangle_tree (descending, delete, &root, 0);
root              310 maint/gnulib/tests/test-tsearch.c       mangle_tree (descending, build, &root, 0);
root              311 maint/gnulib/tests/test-tsearch.c       walk_tree (root, SIZE);
root              312 maint/gnulib/tests/test-tsearch.c       mangle_tree (descending, delete, &root, 0);
root              314 maint/gnulib/tests/test-tsearch.c       mangle_tree (descending, build, &root, 0);
root              315 maint/gnulib/tests/test-tsearch.c       walk_tree (root, SIZE);
root              316 maint/gnulib/tests/test-tsearch.c       mangle_tree (randomorder, delete, &root, 0);
root              318 maint/gnulib/tests/test-tsearch.c       mangle_tree (randomorder, build, &root, 0);
root              319 maint/gnulib/tests/test-tsearch.c       mangle_tree (ascending, find, &root, 0);
root              320 maint/gnulib/tests/test-tsearch.c       mangle_tree (descending, find, &root, 0);
root              321 maint/gnulib/tests/test-tsearch.c       mangle_tree (randomorder, find, &root, 0);
root              322 maint/gnulib/tests/test-tsearch.c       walk_tree (root, SIZE);
root              323 maint/gnulib/tests/test-tsearch.c       mangle_tree (randomorder, delete, &root, 0);
root              327 maint/gnulib/tests/test-tsearch.c           mangle_tree (randomorder, build_and_del, &root, j);
root              341 maint/gnulib/tests/test-tsearch.c       mangle_tree (ascending, build_and_del, &root, i);
root              342 maint/gnulib/tests/test-tsearch.c       mangle_tree (descending, build_and_del, &root, i);
root              343 maint/gnulib/tests/test-tsearch.c       mangle_tree (ascending, build_and_del, &root, i);
root              344 maint/gnulib/tests/test-tsearch.c       mangle_tree (descending, build_and_del, &root, i);
root              345 maint/gnulib/tests/test-tsearch.c       mangle_tree (ascending, build_and_del, &root, i);
root              346 maint/gnulib/tests/test-tsearch.c       mangle_tree (descending, build_and_del, &root, i);
root              347 maint/gnulib/tests/test-tsearch.c       mangle_tree (ascending, build_and_del, &root, i);
root              348 maint/gnulib/tests/test-tsearch.c       mangle_tree (descending, build_and_del, &root, i);
root              318 tools/crm_resource.c build_constraint_list(xmlNode *root)
root              325 tools/crm_resource.c     cib_constraints = pcmk_find_cib_element(root, XML_CIB_TAG_CONSTRAINTS);
root               54 tools/crm_resource.h int cli_resource_clear_all_expired(xmlNode *root, cib_t *cib_conn, int cib_options,
root              418 tools/crm_resource_ban.c cli_resource_clear_all_expired(xmlNode *root, cib_t *cib_conn, int cib_options,
root              427 tools/crm_resource_ban.c     cib_constraints = pcmk_find_cib_element(root, XML_CIB_TAG_CONSTRAINTS);