duration 542 ompi/mca/topo/treematch/treematch/tm_bucket.c double duration,val = 0; duration 558 ompi/mca/topo/treematch/treematch/tm_bucket.c duration = TOC; duration 560 ompi/mca/topo/treematch/treematch/tm_bucket.c printf("Partial sorting=%fs\n",duration); duration 671 ompi/mca/topo/treematch/treematch/tm_bucket.c duration = TOC; duration 673 ompi/mca/topo/treematch/treematch/tm_bucket.c printf("Grouping =%fs\n",duration); duration 687 ompi/mca/topo/treematch/treematch/tm_tree.c double val, duration; duration 710 ompi/mca/topo/treematch/treematch/tm_tree.c duration = CLOCK_DIFF(time1, time0); duration 711 ompi/mca/topo/treematch/treematch/tm_tree.c if(duration>max_duration){ duration 1024 ompi/mca/topo/treematch/treematch/tm_tree.c double duration = TOC; duration 1027 ompi/mca/topo/treematch/treematch/tm_tree.c printf("Thread %d done in %.3f!\n" , thread_id, duration); duration 1136 ompi/mca/topo/treematch/treematch/tm_tree.c double duration; duration 1222 ompi/mca/topo/treematch/treematch/tm_tree.c duration = TOC; duration 1223 ompi/mca/topo/treematch/treematch/tm_tree.c printf("Thread exhaustive search = %g\n",duration); duration 1337 ompi/mca/topo/treematch/treematch/tm_tree.c double duration; duration 1379 ompi/mca/topo/treematch/treematch/tm_tree.c duration = TOC; duration 1380 ompi/mca/topo/treematch/treematch/tm_tree.c printf("Seq exhaustive search = %g\n",duration); duration 1392 ompi/mca/topo/treematch/treematch/tm_tree.c double val, duration; duration 1412 ompi/mca/topo/treematch/treematch/tm_tree.c duration=CLOCK_DIFF(time1, time0); duration 1413 ompi/mca/topo/treematch/treematch/tm_tree.c if(duration>max_duration){ duration 1649 ompi/mca/topo/treematch/treematch/tm_tree.c double val = 0, duration; duration 1668 ompi/mca/topo/treematch/treematch/tm_tree.c duration = TOC; duration 1670 ompi/mca/topo/treematch/treematch/tm_tree.c printf("linearization=%fs\n", duration); duration 1676 ompi/mca/topo/treematch/treematch/tm_tree.c duration = TOC; duration 1678 ompi/mca/topo/treematch/treematch/tm_tree.c printf("sorting=%fs\n", duration); duration 1694 ompi/mca/topo/treematch/treematch/tm_tree.c duration = TOC; duration 1696 ompi/mca/topo/treematch/treematch/tm_tree.c printf("Grouping=%fs\n", duration); duration 1778 ompi/mca/topo/treematch/treematch/tm_tree.c double duration; duration 1797 ompi/mca/topo/treematch/treematch/tm_tree.c double duration; duration 1815 ompi/mca/topo/treematch/treematch/tm_tree.c duration = TOC; duration 1817 ompi/mca/topo/treematch/treematch/tm_tree.c printf("Fast grouping duration=%f\n", duration); duration 1950 ompi/mca/topo/treematch/treematch/tm_tree.c duration = TOC; duration 1954 ompi/mca/topo/treematch/treematch/tm_tree.c printf("Grouping done in %.4fs!\n", duration); duration 2089 ompi/mca/topo/treematch/treematch/tm_tree.c double duration; duration 2118 ompi/mca/topo/treematch/treematch/tm_tree.c duration = TOC; duration 2120 ompi/mca/topo/treematch/treematch/tm_tree.c printf("Completing matrix duration= %fs\n ", duration); duration 2136 ompi/mca/topo/treematch/treematch/tm_tree.c duration = TOC; duration 2138 ompi/mca/topo/treematch/treematch/tm_tree.c printf("New nodes creation= %fs\n ", duration); duration 2150 ompi/mca/topo/treematch/treematch/tm_tree.c duration = TOC; duration 2152 ompi/mca/topo/treematch/treematch/tm_tree.c printf("Aggregate_com_mat= %fs\n", duration); duration 2158 ompi/mca/topo/treematch/treematch/tm_tree.c duration = TOC; duration 2160 ompi/mca/topo/treematch/treematch/tm_tree.c printf("Aggregate obj_weight= %fs\n ", duration); duration 141 opal/mca/event/libevent2022/libevent/event-internal.h struct timeval duration; duration 1138 opal/mca/event/libevent2022/libevent/event.c &get_common_timeout_list(base, tv)->duration; duration 1185 opal/mca/event/libevent2022/libevent/event.c const struct timeval *duration) duration 1193 opal/mca/event/libevent2022/libevent/event.c if (duration->tv_usec > 1000000) { duration 1194 opal/mca/event/libevent2022/libevent/event.c memcpy(&tv, duration, sizeof(struct timeval)); duration 1195 opal/mca/event/libevent2022/libevent/event.c if (is_common_timeout(duration, base)) duration 1199 opal/mca/event/libevent2022/libevent/event.c duration = &tv; duration 1204 opal/mca/event/libevent2022/libevent/event.c if (duration->tv_sec == ctl->duration.tv_sec && duration 1205 opal/mca/event/libevent2022/libevent/event.c duration->tv_usec == duration 1206 opal/mca/event/libevent2022/libevent/event.c (ctl->duration.tv_usec & MICROSECONDS_MASK)) { duration 1207 opal/mca/event/libevent2022/libevent/event.c EVUTIL_ASSERT(is_common_timeout(&ctl->duration, base)); duration 1208 opal/mca/event/libevent2022/libevent/event.c result = &ctl->duration; duration 1237 opal/mca/event/libevent2022/libevent/event.c new_ctl->duration.tv_sec = duration->tv_sec; duration 1238 opal/mca/event/libevent2022/libevent/event.c new_ctl->duration.tv_usec = duration 1239 opal/mca/event/libevent2022/libevent/event.c duration->tv_usec | COMMON_TIMEOUT_MAGIC | duration 1247 opal/mca/event/libevent2022/libevent/event.c result = &new_ctl->duration; duration 1158 opal/mca/event/libevent2022/libevent/include/event2/event.h const struct timeval *duration);