itor 100 ompi/mca/coll/libnbc/libdict/dict.c dict_itor_destroy(dict_itor *itor) itor 102 ompi/mca/coll/libnbc/libdict/dict.c ASSERT(itor != NULL); itor 104 ompi/mca/coll/libnbc/libdict/dict.c itor->_destroy(itor->_itor); itor 105 ompi/mca/coll/libnbc/libdict/dict.c FREE(itor); itor 86 ompi/mca/coll/libnbc/libdict/dict.h int (*_valid) __P((const void *itor)); itor 87 ompi/mca/coll/libnbc/libdict/dict.h void (*_invalid) __P((void *itor)); itor 88 ompi/mca/coll/libnbc/libdict/dict.h int (*_next) __P((void *itor)); itor 89 ompi/mca/coll/libnbc/libdict/dict.h int (*_prev) __P((void *itor)); itor 90 ompi/mca/coll/libnbc/libdict/dict.h int (*_nextn) __P((void *itor, unsigned count)); itor 91 ompi/mca/coll/libnbc/libdict/dict.h int (*_prevn) __P((void *itor, unsigned count)); itor 92 ompi/mca/coll/libnbc/libdict/dict.h int (*_first) __P((void *itor)); itor 93 ompi/mca/coll/libnbc/libdict/dict.h int (*_last) __P((void *itor)); itor 94 ompi/mca/coll/libnbc/libdict/dict.h int (*_search) __P((void *itor, const void *key)); itor 95 ompi/mca/coll/libnbc/libdict/dict.h const void *(*_key) __P((void *itor)); itor 96 ompi/mca/coll/libnbc/libdict/dict.h void *(*_data) __P((void *itor)); itor 97 ompi/mca/coll/libnbc/libdict/dict.h const void *(*_cdata) __P((const void *itor)); itor 98 ompi/mca/coll/libnbc/libdict/dict.h int (*_setdata) __P((void *itor, void *dat, int del)); itor 99 ompi/mca/coll/libnbc/libdict/dict.h int (*_remove) __P((void *itor, int del)); itor 101 ompi/mca/coll/libnbc/libdict/dict.h void (*_destroy) __P((void *itor)); itor 119 ompi/mca/coll/libnbc/libdict/dict.h void dict_itor_destroy __P((dict_itor *itor)); itor 688 ompi/mca/coll/libnbc/libdict/hb_tree.c hb_itor *itor; itor 692 ompi/mca/coll/libnbc/libdict/hb_tree.c if ((itor = (hb_itor*)MALLOC(sizeof(*itor))) == NULL) itor 695 ompi/mca/coll/libnbc/libdict/hb_tree.c itor->tree = tree; itor 696 ompi/mca/coll/libnbc/libdict/hb_tree.c hb_itor_first(itor); itor 697 ompi/mca/coll/libnbc/libdict/hb_tree.c return itor; itor 703 ompi/mca/coll/libnbc/libdict/hb_tree.c dict_itor *itor; itor 707 ompi/mca/coll/libnbc/libdict/hb_tree.c if ((itor = (dict_itor*)MALLOC(sizeof(*itor))) == NULL) itor 710 ompi/mca/coll/libnbc/libdict/hb_tree.c if ((itor->_itor = hb_itor_new(tree)) == NULL) { itor 711 ompi/mca/coll/libnbc/libdict/hb_tree.c FREE(itor); itor 715 ompi/mca/coll/libnbc/libdict/hb_tree.c itor->_destroy = (idestroy_func)hb_itor_destroy; itor 716 ompi/mca/coll/libnbc/libdict/hb_tree.c itor->_valid = (valid_func)hb_itor_valid; itor 717 ompi/mca/coll/libnbc/libdict/hb_tree.c itor->_invalid = (invalidate_func)hb_itor_invalidate; itor 718 ompi/mca/coll/libnbc/libdict/hb_tree.c itor->_next = (next_func)hb_itor_next; itor 719 ompi/mca/coll/libnbc/libdict/hb_tree.c itor->_prev = (prev_func)hb_itor_prev; itor 720 ompi/mca/coll/libnbc/libdict/hb_tree.c itor->_nextn = (nextn_func)hb_itor_nextn; itor 721 ompi/mca/coll/libnbc/libdict/hb_tree.c itor->_prevn = (prevn_func)hb_itor_prevn; itor 722 ompi/mca/coll/libnbc/libdict/hb_tree.c itor->_first = (first_func)hb_itor_first; itor 723 ompi/mca/coll/libnbc/libdict/hb_tree.c itor->_last = (last_func)hb_itor_last; itor 724 ompi/mca/coll/libnbc/libdict/hb_tree.c itor->_search = (isearch_func)hb_itor_search; itor 725 ompi/mca/coll/libnbc/libdict/hb_tree.c itor->_key = (key_func)hb_itor_key; itor 726 ompi/mca/coll/libnbc/libdict/hb_tree.c itor->_data = (data_func)hb_itor_data; itor 727 ompi/mca/coll/libnbc/libdict/hb_tree.c itor->_cdata = (cdata_func)hb_itor_cdata; itor 728 ompi/mca/coll/libnbc/libdict/hb_tree.c itor->_setdata = (dataset_func)hb_itor_set_data; itor 730 ompi/mca/coll/libnbc/libdict/hb_tree.c return itor; itor 734 ompi/mca/coll/libnbc/libdict/hb_tree.c hb_itor_destroy(hb_itor *itor) itor 736 ompi/mca/coll/libnbc/libdict/hb_tree.c ASSERT(itor != NULL); itor 738 ompi/mca/coll/libnbc/libdict/hb_tree.c FREE(itor); itor 741 ompi/mca/coll/libnbc/libdict/hb_tree.c #define RETVALID(itor) return itor->node != NULL itor 744 ompi/mca/coll/libnbc/libdict/hb_tree.c hb_itor_valid(const hb_itor *itor) itor 746 ompi/mca/coll/libnbc/libdict/hb_tree.c ASSERT(itor != NULL); itor 748 ompi/mca/coll/libnbc/libdict/hb_tree.c RETVALID(itor); itor 752 ompi/mca/coll/libnbc/libdict/hb_tree.c hb_itor_invalidate(hb_itor *itor) itor 754 ompi/mca/coll/libnbc/libdict/hb_tree.c ASSERT(itor != NULL); itor 756 ompi/mca/coll/libnbc/libdict/hb_tree.c itor->node = NULL; itor 760 ompi/mca/coll/libnbc/libdict/hb_tree.c hb_itor_next(hb_itor *itor) itor 762 ompi/mca/coll/libnbc/libdict/hb_tree.c ASSERT(itor != NULL); itor 764 ompi/mca/coll/libnbc/libdict/hb_tree.c if (itor->node == NULL) itor 765 ompi/mca/coll/libnbc/libdict/hb_tree.c hb_itor_first(itor); itor 767 ompi/mca/coll/libnbc/libdict/hb_tree.c itor->node = node_next(itor->node); itor 768 ompi/mca/coll/libnbc/libdict/hb_tree.c RETVALID(itor); itor 772 ompi/mca/coll/libnbc/libdict/hb_tree.c hb_itor_prev(hb_itor *itor) itor 774 ompi/mca/coll/libnbc/libdict/hb_tree.c ASSERT(itor != NULL); itor 776 ompi/mca/coll/libnbc/libdict/hb_tree.c if (itor->node == NULL) itor 777 ompi/mca/coll/libnbc/libdict/hb_tree.c hb_itor_last(itor); itor 779 ompi/mca/coll/libnbc/libdict/hb_tree.c itor->node = node_prev(itor->node); itor 780 ompi/mca/coll/libnbc/libdict/hb_tree.c RETVALID(itor); itor 784 ompi/mca/coll/libnbc/libdict/hb_tree.c hb_itor_nextn(hb_itor *itor, unsigned count) itor 786 ompi/mca/coll/libnbc/libdict/hb_tree.c ASSERT(itor != NULL); itor 789 ompi/mca/coll/libnbc/libdict/hb_tree.c if (itor->node == NULL) { itor 790 ompi/mca/coll/libnbc/libdict/hb_tree.c hb_itor_first(itor); itor 794 ompi/mca/coll/libnbc/libdict/hb_tree.c while (count-- && itor->node) itor 795 ompi/mca/coll/libnbc/libdict/hb_tree.c itor->node = node_next(itor->node); itor 798 ompi/mca/coll/libnbc/libdict/hb_tree.c RETVALID(itor); itor 802 ompi/mca/coll/libnbc/libdict/hb_tree.c hb_itor_prevn(hb_itor *itor, unsigned count) itor 804 ompi/mca/coll/libnbc/libdict/hb_tree.c ASSERT(itor != NULL); itor 807 ompi/mca/coll/libnbc/libdict/hb_tree.c if (itor->node == NULL) { itor 808 ompi/mca/coll/libnbc/libdict/hb_tree.c hb_itor_last(itor); itor 812 ompi/mca/coll/libnbc/libdict/hb_tree.c while (count-- && itor->node) itor 813 ompi/mca/coll/libnbc/libdict/hb_tree.c itor->node = node_prev(itor->node); itor 816 ompi/mca/coll/libnbc/libdict/hb_tree.c RETVALID(itor); itor 820 ompi/mca/coll/libnbc/libdict/hb_tree.c hb_itor_first(hb_itor *itor) itor 824 ompi/mca/coll/libnbc/libdict/hb_tree.c ASSERT(itor != NULL); itor 826 ompi/mca/coll/libnbc/libdict/hb_tree.c t = itor->tree; itor 827 ompi/mca/coll/libnbc/libdict/hb_tree.c itor->node = t->root ? node_min(t->root) : NULL; itor 828 ompi/mca/coll/libnbc/libdict/hb_tree.c RETVALID(itor); itor 832 ompi/mca/coll/libnbc/libdict/hb_tree.c hb_itor_last(hb_itor *itor) itor 836 ompi/mca/coll/libnbc/libdict/hb_tree.c ASSERT(itor != NULL); itor 838 ompi/mca/coll/libnbc/libdict/hb_tree.c t = itor->tree; itor 839 ompi/mca/coll/libnbc/libdict/hb_tree.c itor->node = t->root ? node_max(t->root) : NULL; itor 840 ompi/mca/coll/libnbc/libdict/hb_tree.c RETVALID(itor); itor 844 ompi/mca/coll/libnbc/libdict/hb_tree.c hb_itor_search(hb_itor *itor, const void *key) itor 850 ompi/mca/coll/libnbc/libdict/hb_tree.c ASSERT(itor != NULL); itor 852 ompi/mca/coll/libnbc/libdict/hb_tree.c cmp = itor->tree->key_cmp; itor 853 ompi/mca/coll/libnbc/libdict/hb_tree.c for (node = itor->tree->root; node;) { itor 859 ompi/mca/coll/libnbc/libdict/hb_tree.c itor->node = node; itor 860 ompi/mca/coll/libnbc/libdict/hb_tree.c RETVALID(itor); itor 864 ompi/mca/coll/libnbc/libdict/hb_tree.c hb_itor_key(const hb_itor *itor) itor 866 ompi/mca/coll/libnbc/libdict/hb_tree.c ASSERT(itor != NULL); itor 868 ompi/mca/coll/libnbc/libdict/hb_tree.c return itor->node ? itor->node->key : NULL; itor 872 ompi/mca/coll/libnbc/libdict/hb_tree.c hb_itor_data(hb_itor *itor) itor 874 ompi/mca/coll/libnbc/libdict/hb_tree.c ASSERT(itor != NULL); itor 876 ompi/mca/coll/libnbc/libdict/hb_tree.c return itor->node ? itor->node->dat : NULL; itor 880 ompi/mca/coll/libnbc/libdict/hb_tree.c hb_itor_cdata(const hb_itor *itor) itor 882 ompi/mca/coll/libnbc/libdict/hb_tree.c ASSERT(itor != NULL); itor 884 ompi/mca/coll/libnbc/libdict/hb_tree.c return itor->node ? itor->node->dat : NULL; itor 888 ompi/mca/coll/libnbc/libdict/hb_tree.c hb_itor_set_data(hb_itor *itor, void *dat, int del) itor 890 ompi/mca/coll/libnbc/libdict/hb_tree.c ASSERT(itor != NULL); itor 892 ompi/mca/coll/libnbc/libdict/hb_tree.c if (itor->node == NULL) itor 895 ompi/mca/coll/libnbc/libdict/hb_tree.c if (del && itor->tree->dat_del) itor 896 ompi/mca/coll/libnbc/libdict/hb_tree.c itor->tree->dat_del(itor->node->dat); itor 897 ompi/mca/coll/libnbc/libdict/hb_tree.c itor->node->dat = dat; itor 46 ompi/mca/coll/libnbc/libdict/hb_tree.h int hb_itor_valid __P((const hb_itor *itor)); itor 47 ompi/mca/coll/libnbc/libdict/hb_tree.h void hb_itor_invalidate __P((hb_itor *itor)); itor 48 ompi/mca/coll/libnbc/libdict/hb_tree.h int hb_itor_next __P((hb_itor *itor)); itor 49 ompi/mca/coll/libnbc/libdict/hb_tree.h int hb_itor_prev __P((hb_itor *itor)); itor 50 ompi/mca/coll/libnbc/libdict/hb_tree.h int hb_itor_nextn __P((hb_itor *itor, unsigned count)); itor 51 ompi/mca/coll/libnbc/libdict/hb_tree.h int hb_itor_prevn __P((hb_itor *itor, unsigned count)); itor 52 ompi/mca/coll/libnbc/libdict/hb_tree.h int hb_itor_first __P((hb_itor *itor)); itor 53 ompi/mca/coll/libnbc/libdict/hb_tree.h int hb_itor_last __P((hb_itor *itor)); itor 54 ompi/mca/coll/libnbc/libdict/hb_tree.h int hb_itor_search __P((hb_itor *itor, const void *key)); itor 55 ompi/mca/coll/libnbc/libdict/hb_tree.h const void *hb_itor_key __P((const hb_itor *itor)); itor 56 ompi/mca/coll/libnbc/libdict/hb_tree.h void *hb_itor_data __P((hb_itor *itor)); itor 57 ompi/mca/coll/libnbc/libdict/hb_tree.h const void *hb_itor_cdata __P((const hb_itor *itor)); itor 58 ompi/mca/coll/libnbc/libdict/hb_tree.h int hb_itor_set_data __P((hb_itor *itor, void *dat, int del)); itor 59 ompi/mca/coll/libnbc/libdict/hb_tree.h int hb_itor_remove __P((hb_itor *itor, int del)); itor 554 ompi/mca/coll/libnbc/nbc_internal.h hb_itor *itor; itor 556 ompi/mca/coll/libnbc/nbc_internal.h itor = hb_itor_new(dict); itor 557 ompi/mca/coll/libnbc/nbc_internal.h for (; hb_itor_valid(itor) && (*size>NBC_SCHED_DICT_LOWER); hb_itor_next(itor)) { itor 558 ompi/mca/coll/libnbc/nbc_internal.h hb_tree_remove(dict, hb_itor_key(itor), 0); itor 561 ompi/mca/coll/libnbc/nbc_internal.h hb_itor_destroy(itor);