e 52 ompi/mca/io/romio321/romio/mpi-io/glue/mpich/mpio_err.c MPI_Errhandler e; e 66 ompi/mca/io/romio321/romio/mpi-io/glue/mpich/mpio_err.c e = ADIOI_DFLT_ERR_HANDLER; e 72 ompi/mca/io/romio321/romio/mpi-io/glue/mpich/mpio_err.c e = fh->err_handler; e 83 ompi/mca/io/romio321/romio/mpi-io/glue/mpich/mpio_err.c if (e == MPI_ERRORS_RETURN || e == MPIR_ERRORS_THROW_EXCEPTIONS || !e) { e 89 ompi/mca/io/romio321/romio/mpi-io/glue/mpich/mpio_err.c MPIR_Get_file_error_routine( e, &c_errhandler, &kind ); e 25 ompi/mca/io/romio321/romio/mpi-io/mpich_fileutil.c int MPIR_ROMIO_Set_file_errhand( MPI_File file_ptr, MPI_Errhandler e ) e 27 ompi/mca/io/romio321/romio/mpi-io/mpich_fileutil.c if (file_ptr == MPI_FILE_NULL) ADIOI_DFLT_ERR_HANDLER = e; e 34 ompi/mca/io/romio321/romio/mpi-io/mpich_fileutil.c file_ptr->err_handler = e; e 37 ompi/mca/io/romio321/romio/mpi-io/mpich_fileutil.c int MPIR_ROMIO_Get_file_errhand( MPI_File file_ptr, MPI_Errhandler *e ) e 41 ompi/mca/io/romio321/romio/mpi-io/mpich_fileutil.c *e = 0; e 43 ompi/mca/io/romio321/romio/mpi-io/mpich_fileutil.c *e = ADIOI_DFLT_ERR_HANDLER; e 53 ompi/mca/io/romio321/romio/mpi-io/mpich_fileutil.c *e = 0; e 55 ompi/mca/io/romio321/romio/mpi-io/mpich_fileutil.c *e = file_ptr->err_handler; e 60 ompi/mca/topo/treematch/treematch/PriorityQueue.c void PQ_insertElement(PriorityQueue * const q, QueueElement * const e) e 62 ompi/mca/topo/treematch/treematch/PriorityQueue.c if(e->value >= 0 && e->value < q->size) e 64 ompi/mca/topo/treematch/treematch/PriorityQueue.c fiboTreeAdd((FiboTree *)q, (FiboNode *)(e)); e 65 ompi/mca/topo/treematch/treematch/PriorityQueue.c q->elements[e->value] = e; e 66 ompi/mca/topo/treematch/treematch/PriorityQueue.c e->isInQueue = 1; e 69 ompi/mca/topo/treematch/treematch/PriorityQueue.c void PQ_deleteElement(PriorityQueue * const q, QueueElement * const e) e 71 ompi/mca/topo/treematch/treematch/PriorityQueue.c fiboTreeDel((FiboTree *)q, (FiboNode *)(e)); e 72 ompi/mca/topo/treematch/treematch/PriorityQueue.c q->elements[e->value] = NULL; e 73 ompi/mca/topo/treematch/treematch/PriorityQueue.c e->isInQueue = 0; e 80 ompi/mca/topo/treematch/treematch/PriorityQueue.c QueueElement * e = malloc(sizeof(QueueElement)); e 81 ompi/mca/topo/treematch/treematch/PriorityQueue.c e->value = val; e 82 ompi/mca/topo/treematch/treematch/PriorityQueue.c e->key = key; e 83 ompi/mca/topo/treematch/treematch/PriorityQueue.c PQ_insertElement(q, e); e 89 ompi/mca/topo/treematch/treematch/PriorityQueue.c QueueElement * e = q->elements[val]; e 90 ompi/mca/topo/treematch/treematch/PriorityQueue.c PQ_deleteElement(q, e); e 91 ompi/mca/topo/treematch/treematch/PriorityQueue.c free(e); e 96 ompi/mca/topo/treematch/treematch/PriorityQueue.c QueueElement * e = (QueueElement *)(fiboTreeMin((FiboTree *)q)); e 97 ompi/mca/topo/treematch/treematch/PriorityQueue.c return e; e 101 ompi/mca/topo/treematch/treematch/PriorityQueue.c QueueElement * e = (QueueElement *)(fiboTreeMin((FiboTree *)q)); e 102 ompi/mca/topo/treematch/treematch/PriorityQueue.c if(e != NULL) e 104 ompi/mca/topo/treematch/treematch/PriorityQueue.c PQ_deleteElement(q, e); e 106 ompi/mca/topo/treematch/treematch/PriorityQueue.c return e; e 111 ompi/mca/topo/treematch/treematch/PriorityQueue.c QueueElement * e = PQ_findMaxElement(q); e 112 ompi/mca/topo/treematch/treematch/PriorityQueue.c if(e!=NULL) e 113 ompi/mca/topo/treematch/treematch/PriorityQueue.c return e->key; e 119 ompi/mca/topo/treematch/treematch/PriorityQueue.c QueueElement * e = PQ_deleteMaxElement(q); e 121 ompi/mca/topo/treematch/treematch/PriorityQueue.c if(e != NULL) e 122 ompi/mca/topo/treematch/treematch/PriorityQueue.c res = e->value; e 123 ompi/mca/topo/treematch/treematch/PriorityQueue.c free(e); e 127 ompi/mca/topo/treematch/treematch/PriorityQueue.c void PQ_increaseElementKey(PriorityQueue * const q, QueueElement * const e, double i) e 129 ompi/mca/topo/treematch/treematch/PriorityQueue.c if(e->isInQueue) e 131 ompi/mca/topo/treematch/treematch/PriorityQueue.c PQ_deleteElement(q, e); e 132 ompi/mca/topo/treematch/treematch/PriorityQueue.c e->key += i; e 133 ompi/mca/topo/treematch/treematch/PriorityQueue.c PQ_insertElement(q, e); e 136 ompi/mca/topo/treematch/treematch/PriorityQueue.c void PQ_decreaseElementKey(PriorityQueue * const q, QueueElement * const e, double i) e 138 ompi/mca/topo/treematch/treematch/PriorityQueue.c if(e->isInQueue) e 140 ompi/mca/topo/treematch/treematch/PriorityQueue.c PQ_deleteElement(q, e); e 141 ompi/mca/topo/treematch/treematch/PriorityQueue.c e->key -= i; e 142 ompi/mca/topo/treematch/treematch/PriorityQueue.c PQ_insertElement(q, e); e 145 ompi/mca/topo/treematch/treematch/PriorityQueue.c void PQ_adjustElementKey(PriorityQueue * const q, QueueElement * const e, double i) e 147 ompi/mca/topo/treematch/treematch/PriorityQueue.c if(e->isInQueue) e 149 ompi/mca/topo/treematch/treematch/PriorityQueue.c PQ_deleteElement(q, e); e 150 ompi/mca/topo/treematch/treematch/PriorityQueue.c e->key = i; e 151 ompi/mca/topo/treematch/treematch/PriorityQueue.c PQ_insertElement(q, e); e 157 ompi/mca/topo/treematch/treematch/PriorityQueue.c QueueElement * e = q->elements[val]; e 158 ompi/mca/topo/treematch/treematch/PriorityQueue.c if(e != NULL) e 159 ompi/mca/topo/treematch/treematch/PriorityQueue.c PQ_increaseElementKey(q, e, i); e 164 ompi/mca/topo/treematch/treematch/PriorityQueue.c QueueElement * e = q->elements[val]; e 165 ompi/mca/topo/treematch/treematch/PriorityQueue.c if(e != NULL) e 166 ompi/mca/topo/treematch/treematch/PriorityQueue.c PQ_decreaseElementKey(q, e, i); e 171 ompi/mca/topo/treematch/treematch/PriorityQueue.c QueueElement * e = q->elements[val]; e 172 ompi/mca/topo/treematch/treematch/PriorityQueue.c if(e != NULL) e 173 ompi/mca/topo/treematch/treematch/PriorityQueue.c PQ_adjustElementKey(q, e, i); e 1651 ompi/mca/topo/treematch/treematch/tm_tree.c int i, j, e, l, nb_groups; e 1659 ompi/mca/topo/treematch/treematch/tm_tree.c e = 0; e 1662 ompi/mca/topo/treematch/treematch/tm_tree.c graph[e].i = i; e 1663 ompi/mca/topo/treematch/treematch/tm_tree.c graph[e].j = j; e 1664 ompi/mca/topo/treematch/treematch/tm_tree.c graph[e].val = mat[i][j]; e 1665 ompi/mca/topo/treematch/treematch/tm_tree.c e++; e 1673 ompi/mca/topo/treematch/treematch/tm_tree.c assert( e == (mat_order*mat_order-mat_order)/2); e 1675 ompi/mca/topo/treematch/treematch/tm_tree.c qsort(graph, e, sizeof(adjacency_t), adjacency_dsc); e 1685 ompi/mca/topo/treematch/treematch/tm_tree.c for( i = 0 ; (i < e) && (l < solution_size) ; i++ ) e 33 ompi/mpi/cxx/errhandler.h inline Errhandler(const Errhandler& e) : mpi_errhandler(e.mpi_errhandler) { } e 35 ompi/mpi/cxx/errhandler.h inline Errhandler& operator=(const Errhandler& e) { e 36 ompi/mpi/cxx/errhandler.h mpi_errhandler = e.mpi_errhandler; e 22 ompi/mpi/cxx/errhandler_inln.h inline PMPI::Errhandler::Errhandler(const PMPI::Errhandler& e) e 23 ompi/mpi/cxx/errhandler_inln.h : handler_fn(e.handler_fn), mpi_errhandler(e.mpi_errhandler) { } e 26 ompi/mpi/cxx/errhandler_inln.h PMPI::Errhandler::operator=(const PMPI::Errhandler& e) e 28 ompi/mpi/cxx/errhandler_inln.h handler_fn = e.handler_fn; e 29 ompi/mpi/cxx/errhandler_inln.h mpi_errhandler = e.mpi_errhandler; e 16 ompi/mpi/fortran/use-mpi-f08/bindings/mpi-f-interfaces-bind.h ! and the back-end OMPI implementation subroutine name (e.g., e 23 ompi/mpi/fortran/use-mpi-f08/bindings/mpi-f-interfaces-bind.h ! Most of the "wrapper" subroutines in the mpi_f08 module (i.e., all e 37 ompi/mpi/fortran/use-mpi-f08/bindings/mpi-f-interfaces-bind.h ! files (e.g., finalized_f08.F90) use the "mpi" module to get a e 44 ompi/mpi/fortran/use-mpi-f08/bindings/mpi-f-interfaces-bind.h ! the right types (e.g., convert MPI handles from comm to e 46 ompi/mpi/fortran/use-mpi-f08/bindings/mpi-f-interfaces-bind.h ! arrays* of handles (e.g., the sendtypes and recvtypes arrays e 54 ompi/mpi/fortran/use-mpi-f08/bindings/mpi-f-interfaces-bind.h ! will pass a pointer to sendtypes(0)%MPI_VAL (i.e., the first integer e 88 ompi/mpi/fortran/use-mpi-f08/bindings/mpi-f-interfaces-bind.h ! DIMENSION(MPI_STATUS_SIZE), which is what it *really* is) -- i.e., e 196 ompi/mpi/fortran/use-mpi-f08/bindings/mpi-f-interfaces-bind.h ! MPI_BUFFER_DETACH (i.e., it is different than the mpif.h / mpi e 11 ompi/mpi/fortran/use-mpi-tkr/mpi-f90-cptr-interfaces.h ! the TYPE(C_PTR) type, which not all Fortran compilers support (e.g., e 13 ompi/mpi/fortran/use-mpi-tkr/pmpi-f90-cptr-interfaces.h ! the TYPE(C_PTR) type, which not all Fortran compilers support (e.g., e 81 ompi/mpi/java/c/mpi_Datatype.c JNIEXPORT void JNICALL Java_mpi_Datatype_init(JNIEnv *e, jclass clazz) e 83 ompi/mpi/java/c/mpi_Datatype.c ompi_java.DatatypeHandle = (*e)->GetFieldID(e, clazz, "handle", "J"); e 84 ompi/mpi/java/c/mpi_Datatype.c ompi_java.DatatypeBaseType = (*e)->GetFieldID(e, clazz, "baseType", "I"); e 85 ompi/mpi/java/c/mpi_Datatype.c ompi_java.DatatypeBaseSize = (*e)->GetFieldID(e, clazz, "baseSize", "I"); e 89 ompi/mpi/java/c/mpi_Datatype.c JNIEnv *e, jobject jthis, jint type) e 31 ompi/mpi/java/c/mpi_Message.c JNIEXPORT void JNICALL Java_mpi_Message_init(JNIEnv *e, jclass c) e 33 ompi/mpi/java/c/mpi_Message.c ompi_java_setStaticLongField(e, c, "NULL", (jlong)MPI_MESSAGE_NULL); e 34 ompi/mpi/java/c/mpi_Message.c ompi_java_setStaticLongField(e, c, "NO_PROC", (jlong)MPI_MESSAGE_NO_PROC); e 35 ompi/mpi/java/c/mpi_Message.c ompi_java.MessageHandle = (*e)->GetFieldID(e, c, "handle", "J"); e 85 ompi/mpi/java/java/CartComm.java catch(MPIException e) e 87 ompi/mpi/java/java/CartComm.java throw new RuntimeException(e.getMessage()); e 121 ompi/mpi/java/java/Comm.java catch(MPIException e) e 123 ompi/mpi/java/java/Comm.java throw new RuntimeException(e.getMessage()); e 279 ompi/mpi/java/java/Datatype.java catch(MPIException e) e 281 ompi/mpi/java/java/Datatype.java throw new RuntimeException(e.getMessage()); e 86 ompi/mpi/java/java/GraphComm.java catch(MPIException e) e 88 ompi/mpi/java/java/GraphComm.java throw new RuntimeException(e.getMessage()); e 138 ompi/mpi/java/java/Info.java catch(MPIException e) e 140 ompi/mpi/java/java/Info.java throw new RuntimeException(e.getMessage()); e 78 ompi/mpi/java/java/Intercomm.java catch(MPIException e) e 80 ompi/mpi/java/java/Intercomm.java throw new RuntimeException(e.getMessage()); e 96 ompi/mpi/java/java/Intracomm.java catch(MPIException e) e 98 ompi/mpi/java/java/Intracomm.java throw new RuntimeException(e.getMessage()); e 13 ompi/mpiext/example/use-mpi-f08/mpiext_example_usempif08.h ! first, so there's no need to re-define anything that's in there (e.g., e 13 ompi/mpiext/example/use-mpi/mpiext_example_usempi.h ! first, so there's no need to re-define anything that's in there (e.g., e 16 ompi/mpiext/pcollreq/use-mpi-f08/mpiext_pcollreq_usempif08.h ! first, so there's no need to re-define anything that's in there (e.g., e 16 ompi/mpiext/pcollreq/use-mpi/mpiext_pcollreq_usempi.h ! first, so there's no need to re-define anything that's in there (e.g., e 66 opal/mca/base/mca_base_open.c static void parse_verbose(char *e, opal_output_stream_t *lds); e 196 opal/mca/base/mca_base_open.c static void parse_verbose(char *e, opal_output_stream_t *lds) e 202 opal/mca/base/mca_base_open.c if (NULL == e) { e 206 opal/mca/base/mca_base_open.c edup = strdup(e); e 49 opal/mca/btl/vader/btl_vader_fbox.h #define BUFFER_FREE(s,e,hbm,size) (((s + !hbm) > (e)) ? (s) - (e) : (size - (e))) e 2962 opal/mca/event/libevent2022/libevent/buffer.c struct evbuffer_cb_entry *e; e 2963 opal/mca/event/libevent2022/libevent/buffer.c if (! (e = mm_calloc(1, sizeof(struct evbuffer_cb_entry)))) e 2966 opal/mca/event/libevent2022/libevent/buffer.c e->cb.cb_func = cb; e 2967 opal/mca/event/libevent2022/libevent/buffer.c e->cbarg = cbarg; e 2968 opal/mca/event/libevent2022/libevent/buffer.c e->flags = EVBUFFER_CB_ENABLED; e 2969 opal/mca/event/libevent2022/libevent/buffer.c TAILQ_INSERT_HEAD(&buffer->callbacks, e, next); e 2971 opal/mca/event/libevent2022/libevent/buffer.c return e; e 4268 opal/mca/event/libevent2022/libevent/evdns.c int e = data->pending_error; e 4269 opal/mca/event/libevent2022/libevent/evdns.c if (!e) e 4270 opal/mca/event/libevent2022/libevent/evdns.c e = EVUTIL_EAI_AGAIN; e 4271 opal/mca/event/libevent2022/libevent/evdns.c data->user_cb(e, NULL, data->user_data); e 4479 opal/mca/event/libevent2022/libevent/evdns.c struct hosts_entry *e; e 4482 opal/mca/event/libevent2022/libevent/evdns.c e = TAILQ_NEXT(find_after, next); e 4484 opal/mca/event/libevent2022/libevent/evdns.c e = TAILQ_FIRST(&base->hostsdb); e 4486 opal/mca/event/libevent2022/libevent/evdns.c for (; e; e = TAILQ_NEXT(e, next)) { e 4487 opal/mca/event/libevent2022/libevent/evdns.c if (!evutil_ascii_strcasecmp(e->hostname, hostname)) e 4488 opal/mca/event/libevent2022/libevent/evdns.c return e; e 4499 opal/mca/event/libevent2022/libevent/evdns.c struct hosts_entry *e; e 4504 opal/mca/event/libevent2022/libevent/evdns.c for (e = find_hosts_entry(base, nodename, NULL); e; e 4505 opal/mca/event/libevent2022/libevent/evdns.c e = find_hosts_entry(base, nodename, e)) { e 4508 opal/mca/event/libevent2022/libevent/evdns.c if ((e->addr.sa.sa_family == AF_INET && f == PF_INET6) || e 4509 opal/mca/event/libevent2022/libevent/evdns.c (e->addr.sa.sa_family == AF_INET6 && f == PF_INET)) e 4511 opal/mca/event/libevent2022/libevent/evdns.c ai_new = evutil_new_addrinfo(&e->addr.sa, e->addrlen, hints); e 164 opal/mca/event/libevent2022/libevent/event.c hash_debug_entry(const struct event_debug_entry *e) e 170 opal/mca/event/libevent2022/libevent/event.c unsigned u = (unsigned) ((ev_uintptr_t) e->ptr); e 2569 opal/mca/event/libevent2022/libevent/event.c struct event *e; e 2577 opal/mca/event/libevent2022/libevent/event.c TAILQ_FOREACH_REVERSE(e, &ctl->events, e 2584 opal/mca/event/libevent2022/libevent/event.c is_same_common_timeout(&e->ev_timeout, &ev->ev_timeout)); e 2585 opal/mca/event/libevent2022/libevent/event.c if (evutil_timercmp(&ev->ev_timeout, &e->ev_timeout, >=)) { e 2586 opal/mca/event/libevent2022/libevent/event.c TAILQ_INSERT_AFTER(&ctl->events, e, ev, e 2853 opal/mca/event/libevent2022/libevent/event.c struct event *e; e 2856 opal/mca/event/libevent2022/libevent/event.c TAILQ_FOREACH(e, &base->eventqueue, ev_next) { e 2858 opal/mca/event/libevent2022/libevent/event.c (void*)e, EV_SOCK_ARG(e->ev_fd), e 2859 opal/mca/event/libevent2022/libevent/event.c (e->ev_events&EV_READ)?" Read":"", e 2860 opal/mca/event/libevent2022/libevent/event.c (e->ev_events&EV_WRITE)?" Write":"", e 2861 opal/mca/event/libevent2022/libevent/event.c (e->ev_events&EV_SIGNAL)?" Signal":"", e 2862 opal/mca/event/libevent2022/libevent/event.c (e->ev_events&EV_TIMEOUT)?" Timeout":"", e 2863 opal/mca/event/libevent2022/libevent/event.c (e->ev_events&EV_PERSIST)?" Persist":""); e 2870 opal/mca/event/libevent2022/libevent/event.c TAILQ_FOREACH(e, &base->eventqueue, ev_next) { e 2872 opal/mca/event/libevent2022/libevent/event.c (void*)e, EV_SOCK_ARG(e->ev_fd), e 2873 opal/mca/event/libevent2022/libevent/event.c (e->ev_res&EV_READ)?" Read active":"", e 2874 opal/mca/event/libevent2022/libevent/event.c (e->ev_res&EV_WRITE)?" Write active":"", e 2875 opal/mca/event/libevent2022/libevent/event.c (e->ev_res&EV_SIGNAL)?" Signal active":"", e 2876 opal/mca/event/libevent2022/libevent/event.c (e->ev_res&EV_TIMEOUT)?" Timeout active":""); e 89 opal/mca/event/libevent2022/libevent/evmap.c hashsocket(struct event_map_entry *e) e 94 opal/mca/event/libevent2022/libevent/evmap.c unsigned h = (unsigned) e->fd; e 204 opal/mca/event/libevent2022/libevent/evutil.c #define ERR(e) WSA##e e 206 opal/mca/event/libevent2022/libevent/evutil.c #define ERR(e) e e 482 opal/mca/event/libevent2022/libevent/evutil.c int e = evutil_socket_geterror(*fd_ptr); e 483 opal/mca/event/libevent2022/libevent/evutil.c if (EVUTIL_ERR_CONNECT_RETRIABLE(e)) e 485 opal/mca/event/libevent2022/libevent/evutil.c if (EVUTIL_ERR_CONNECT_REFUSED(e)) e 507 opal/mca/event/libevent2022/libevent/evutil.c int e; e 508 opal/mca/event/libevent2022/libevent/evutil.c ev_socklen_t elen = sizeof(e); e 510 opal/mca/event/libevent2022/libevent/evutil.c if (getsockopt(fd, SOL_SOCKET, SO_ERROR, (void*)&e, &elen) < 0) e 513 opal/mca/event/libevent2022/libevent/evutil.c if (e) { e 514 opal/mca/event/libevent2022/libevent/evutil.c if (EVUTIL_ERR_CONNECT_RETRIABLE(e)) e 516 opal/mca/event/libevent2022/libevent/evutil.c EVUTIL_SET_SOCKET_ERROR(e); e 353 opal/mca/event/libevent2022/libevent/ht-internal.h struct type *e, **pE; \ e 354 opal/mca/event/libevent2022/libevent/ht-internal.h for (pE = &new_table[b], e = *pE; e != NULL; e = *pE) { \ e 355 opal/mca/event/libevent2022/libevent/ht-internal.h b2 = _HT_ELT_HASH(e, field, hashfn) % new_len; \ e 357 opal/mca/event/libevent2022/libevent/ht-internal.h pE = &e->field.hte_next; \ e 359 opal/mca/event/libevent2022/libevent/ht-internal.h *pE = e->field.hte_next; \ e 360 opal/mca/event/libevent2022/libevent/ht-internal.h e->field.hte_next = new_table[b2]; \ e 361 opal/mca/event/libevent2022/libevent/ht-internal.h new_table[b2] = e; \ e 46 opal/mca/event/libevent2022/libevent/minheap-internal.h static inline void min_heap_elem_init(struct event* e); e 47 opal/mca/event/libevent2022/libevent/minheap-internal.h static inline int min_heap_elt_is_top(const struct event *e); e 53 opal/mca/event/libevent2022/libevent/minheap-internal.h static inline int min_heap_push(min_heap_t* s, struct event* e); e 55 opal/mca/event/libevent2022/libevent/minheap-internal.h static inline int min_heap_erase(min_heap_t* s, struct event* e); e 56 opal/mca/event/libevent2022/libevent/minheap-internal.h static inline void min_heap_shift_up_(min_heap_t* s, unsigned hole_index, struct event* e); e 57 opal/mca/event/libevent2022/libevent/minheap-internal.h static inline void min_heap_shift_down_(min_heap_t* s, unsigned hole_index, struct event* e); e 66 opal/mca/event/libevent2022/libevent/minheap-internal.h void min_heap_elem_init(struct event* e) { e->ev_timeout_pos.min_heap_idx = -1; } e 71 opal/mca/event/libevent2022/libevent/minheap-internal.h int min_heap_push(min_heap_t* s, struct event* e) e 75 opal/mca/event/libevent2022/libevent/minheap-internal.h min_heap_shift_up_(s, s->n++, e); e 83 opal/mca/event/libevent2022/libevent/minheap-internal.h struct event* e = *s->p; e 85 opal/mca/event/libevent2022/libevent/minheap-internal.h e->ev_timeout_pos.min_heap_idx = -1; e 86 opal/mca/event/libevent2022/libevent/minheap-internal.h return e; e 91 opal/mca/event/libevent2022/libevent/minheap-internal.h int min_heap_elt_is_top(const struct event *e) e 93 opal/mca/event/libevent2022/libevent/minheap-internal.h return e->ev_timeout_pos.min_heap_idx == 0; e 96 opal/mca/event/libevent2022/libevent/minheap-internal.h int min_heap_erase(min_heap_t* s, struct event* e) e 98 opal/mca/event/libevent2022/libevent/minheap-internal.h if (-1 != e->ev_timeout_pos.min_heap_idx) e 101 opal/mca/event/libevent2022/libevent/minheap-internal.h unsigned parent = (e->ev_timeout_pos.min_heap_idx - 1) / 2; e 107 opal/mca/event/libevent2022/libevent/minheap-internal.h if (e->ev_timeout_pos.min_heap_idx > 0 && min_heap_elem_greater(s->p[parent], last)) e 108 opal/mca/event/libevent2022/libevent/minheap-internal.h min_heap_shift_up_(s, e->ev_timeout_pos.min_heap_idx, last); e 110 opal/mca/event/libevent2022/libevent/minheap-internal.h min_heap_shift_down_(s, e->ev_timeout_pos.min_heap_idx, last); e 111 opal/mca/event/libevent2022/libevent/minheap-internal.h e->ev_timeout_pos.min_heap_idx = -1; e 133 opal/mca/event/libevent2022/libevent/minheap-internal.h void min_heap_shift_up_(min_heap_t* s, unsigned hole_index, struct event* e) e 136 opal/mca/event/libevent2022/libevent/minheap-internal.h while (hole_index && min_heap_elem_greater(s->p[parent], e)) e 142 opal/mca/event/libevent2022/libevent/minheap-internal.h (s->p[hole_index] = e)->ev_timeout_pos.min_heap_idx = hole_index; e 145 opal/mca/event/libevent2022/libevent/minheap-internal.h void min_heap_shift_down_(min_heap_t* s, unsigned hole_index, struct event* e) e 151 opal/mca/event/libevent2022/libevent/minheap-internal.h if (!(min_heap_elem_greater(e, s->p[min_child]))) e 157 opal/mca/event/libevent2022/libevent/minheap-internal.h (s->p[hole_index] = e)->ev_timeout_pos.min_heap_idx = hole_index; e 148 opal/mca/event/libevent2022/libevent/test/bench_httpclient.c int e = errno; e 149 opal/mca/event/libevent2022/libevent/test/bench_httpclient.c if (! EVUTIL_ERR_CONNECT_RETRIABLE(e)) { e 2199 opal/mca/event/libevent2022/libevent/test/regress.c dfd_cb(evutil_socket_t fd, short e, void *data) e 2201 opal/mca/event/libevent2022/libevent/test/regress.c *(int*)data = (int)e; e 58 opal/mca/event/libevent2022/libevent/test/regress_minheap.c struct event *e, *last_e; e 81 opal/mca/event/libevent2022/libevent/test/regress_minheap.c e = min_heap_pop(&heap); e 82 opal/mca/event/libevent2022/libevent/test/regress_minheap.c if (!e) e 85 opal/mca/event/libevent2022/libevent/test/regress_minheap.c &e->ev_timeout, <=)); e 93 opal/mca/event/libevent2022/libevent/test/test-changelist.c ev_int64_t s, e, diff; e 96 opal/mca/event/libevent2022/libevent/test/test-changelist.c e = filetime_to_100nsec(ftEnd); e 97 opal/mca/event/libevent2022/libevent/test/test-changelist.c diff = e - s; e 77 opal/mca/event/libevent2022/libevent/util-internal.h #define EVUTIL_ERR_RW_RETRIABLE(e) \ e 78 opal/mca/event/libevent2022/libevent/util-internal.h ((e) == EINTR || (e) == EAGAIN) e 80 opal/mca/event/libevent2022/libevent/util-internal.h #define EVUTIL_ERR_CONNECT_RETRIABLE(e) \ e 81 opal/mca/event/libevent2022/libevent/util-internal.h ((e) == EINTR || (e) == EINPROGRESS) e 83 opal/mca/event/libevent2022/libevent/util-internal.h #define EVUTIL_ERR_ACCEPT_RETRIABLE(e) \ e 84 opal/mca/event/libevent2022/libevent/util-internal.h ((e) == EINTR || (e) == EAGAIN || (e) == ECONNABORTED) e 87 opal/mca/event/libevent2022/libevent/util-internal.h #define EVUTIL_ERR_CONNECT_REFUSED(e) \ e 88 opal/mca/event/libevent2022/libevent/util-internal.h ((e) == ECONNREFUSED) e 92 opal/mca/event/libevent2022/libevent/util-internal.h #define EVUTIL_ERR_RW_RETRIABLE(e) \ e 93 opal/mca/event/libevent2022/libevent/util-internal.h ((e) == WSAEWOULDBLOCK || \ e 94 opal/mca/event/libevent2022/libevent/util-internal.h (e) == WSAEINTR) e 96 opal/mca/event/libevent2022/libevent/util-internal.h #define EVUTIL_ERR_CONNECT_RETRIABLE(e) \ e 97 opal/mca/event/libevent2022/libevent/util-internal.h ((e) == WSAEWOULDBLOCK || \ e 98 opal/mca/event/libevent2022/libevent/util-internal.h (e) == WSAEINTR || \ e 99 opal/mca/event/libevent2022/libevent/util-internal.h (e) == WSAEINPROGRESS || \ e 100 opal/mca/event/libevent2022/libevent/util-internal.h (e) == WSAEINVAL) e 102 opal/mca/event/libevent2022/libevent/util-internal.h #define EVUTIL_ERR_ACCEPT_RETRIABLE(e) \ e 103 opal/mca/event/libevent2022/libevent/util-internal.h EVUTIL_ERR_RW_RETRIABLE(e) e 105 opal/mca/event/libevent2022/libevent/util-internal.h #define EVUTIL_ERR_CONNECT_REFUSED(e) \ e 106 opal/mca/event/libevent2022/libevent/util-internal.h ((e) == WSAECONNREFUSED) e 58 opal/mca/hwloc/base/hwloc_base_maffinity.c int e; e 62 opal/mca/hwloc/base/hwloc_base_maffinity.c e = errno; e 68 opal/mca/hwloc/base/hwloc_base_maffinity.c if (0 != rc && ENOSYS == e && e 57 opal/mca/hwloc/base/hwloc_base_proc_mempolicy.c int e; e 61 opal/mca/hwloc/base/hwloc_base_proc_mempolicy.c e = errno; e 67 opal/mca/hwloc/base/hwloc_base_proc_mempolicy.c if (0 != rc && ENOSYS == e && e 1451 opal/mca/hwloc/base/hwloc_base_util.c char *t, *cptr, *e, *cp=NULL; e 1473 opal/mca/hwloc/base/hwloc_base_util.c if (NULL == (e = strchr(t, ':'))) { e 1478 opal/mca/hwloc/base/hwloc_base_util.c *e = '\0'; e 218 opal/mca/hwloc/hwloc201/hwloc/include/netloc/utarray.h #define utarray_next(a,e) (((e)==NULL) ? utarray_front(a) : ((((a)->i) > (utarray_eltidx(a,e)+1)) ? _utarray_eltptr(a,utarray_eltidx(a,e)+1) : NULL)) e 219 opal/mca/hwloc/hwloc201/hwloc/include/netloc/utarray.h #define utarray_prev(a,e) (((e)==NULL) ? utarray_back(a) : ((utarray_eltidx(a,e) > 0) ? _utarray_eltptr(a,utarray_eltidx(a,e)-1) : NULL)) e 221 opal/mca/hwloc/hwloc201/hwloc/include/netloc/utarray.h #define utarray_eltidx(a,e) (((char*)(e) >= (char*)((a)->d)) ? (((char*)(e) - (char*)((a)->d))/(size_t)(a)->icd.sz) : (unsigned int)-1) e 168 opal/mca/pmix/ext2x/ext2x.h #define OPAL_PMIX_OP_THREADSHIFT(e, fn, cb, cd) \ e 172 opal/mca/pmix/ext2x/ext2x.h _cd->handler = (e); \ e 181 opal/mca/pmix/ext2x/ext2x.h #define OPAL_PMIX_THREADSHIFT(e, i, eh, fn, cb, cd) \ e 185 opal/mca/pmix/ext2x/ext2x.h _cd->event_codes = (e); \ e 163 opal/mca/pmix/ext3x/ext3x.h #define OPAL_PMIX_OP_THREADSHIFT(e, fn, cb, cd) \ e 167 opal/mca/pmix/ext3x/ext3x.h _cd->handler = (e); \ e 176 opal/mca/pmix/ext3x/ext3x.h #define OPAL_PMIX_THREADSHIFT(e, i, eh, fn, cb, cd) \ e 180 opal/mca/pmix/ext3x/ext3x.h _cd->event_codes = (e); \ e 175 opal/mca/pmix/pmix4x/pmix/src/event/pmix_event.h #define PMIX_REPORT_EVENT(e, p, r, f) \ e 185 opal/mca/pmix/pmix4x/pmix/src/event/pmix_event.h if (cp->status == (e)) { \ e 193 opal/mca/pmix/pmix4x/pmix/src/event/pmix_event.h ch->status = (e); \ e 212 opal/mca/pmix/pmix4x/pmix/src/event/pmix_event.h if (PMIX_ERR_LOST_CONNECTION_TO_SERVER != (e) && \ e 213 opal/mca/pmix/pmix4x/pmix/src/event/pmix_event.h PMIX_ERR_UNREACH != (e)) { \ e 61 opal/mca/pmix/pmix4x/pmix/src/mca/base/pmix_mca_base_open.c static void parse_verbose(char *e, pmix_output_stream_t *lds); e 194 opal/mca/pmix/pmix4x/pmix/src/mca/base/pmix_mca_base_open.c static void parse_verbose(char *e, pmix_output_stream_t *lds) e 200 opal/mca/pmix/pmix4x/pmix/src/mca/base/pmix_mca_base_open.c if (NULL == e) { e 204 opal/mca/pmix/pmix4x/pmix/src/mca/base/pmix_mca_base_open.c edup = strdup(e); e 135 opal/mca/pmix/pmix4x/pmix/src/util/cmd_line.c static int make_opt(pmix_cmd_line_t *cmd, pmix_cmd_line_init_t *e); e 225 opal/mca/pmix/pmix4x/pmix/src/util/cmd_line.c pmix_cmd_line_init_t e; e 227 opal/mca/pmix/pmix4x/pmix/src/util/cmd_line.c e.ocl_mca_param_name = NULL; e 229 opal/mca/pmix/pmix4x/pmix/src/util/cmd_line.c e.ocl_cmd_short_name = short_name; e 230 opal/mca/pmix/pmix4x/pmix/src/util/cmd_line.c e.ocl_cmd_single_dash_name = sd_name; e 231 opal/mca/pmix/pmix4x/pmix/src/util/cmd_line.c e.ocl_cmd_long_name = long_name; e 233 opal/mca/pmix/pmix4x/pmix/src/util/cmd_line.c e.ocl_num_params = num_params; e 235 opal/mca/pmix/pmix4x/pmix/src/util/cmd_line.c e.ocl_variable_dest = NULL; e 236 opal/mca/pmix/pmix4x/pmix/src/util/cmd_line.c e.ocl_variable_type = PMIX_CMD_LINE_TYPE_NULL; e 238 opal/mca/pmix/pmix4x/pmix/src/util/cmd_line.c e.ocl_description = desc; e 240 opal/mca/pmix/pmix4x/pmix/src/util/cmd_line.c return make_opt(cmd, &e); e 979 opal/mca/pmix/pmix4x/pmix/src/util/cmd_line.c static int make_opt(pmix_cmd_line_t *cmd, pmix_cmd_line_init_t *e) e 987 opal/mca/pmix/pmix4x/pmix/src/util/cmd_line.c } else if ('\0' == e->ocl_cmd_short_name && e 988 opal/mca/pmix/pmix4x/pmix/src/util/cmd_line.c NULL == e->ocl_cmd_single_dash_name && e 989 opal/mca/pmix/pmix4x/pmix/src/util/cmd_line.c NULL == e->ocl_cmd_long_name) { e 991 opal/mca/pmix/pmix4x/pmix/src/util/cmd_line.c } else if (e->ocl_num_params < 0) { e 996 opal/mca/pmix/pmix4x/pmix/src/util/cmd_line.c if (NULL != e->ocl_cmd_single_dash_name && e 997 opal/mca/pmix/pmix4x/pmix/src/util/cmd_line.c NULL != find_option(cmd, e->ocl_cmd_single_dash_name)) { e 998 opal/mca/pmix/pmix4x/pmix/src/util/cmd_line.c pmix_output(0, "Duplicate cmd line entry %s", e->ocl_cmd_single_dash_name); e 1001 opal/mca/pmix/pmix4x/pmix/src/util/cmd_line.c if (NULL != e->ocl_cmd_long_name && e 1002 opal/mca/pmix/pmix4x/pmix/src/util/cmd_line.c NULL != find_option(cmd, e->ocl_cmd_long_name)) { e 1003 opal/mca/pmix/pmix4x/pmix/src/util/cmd_line.c pmix_output(0, "Duplicate cmd line entry %s", e->ocl_cmd_long_name); e 1013 opal/mca/pmix/pmix4x/pmix/src/util/cmd_line.c option->clo_short_name = e->ocl_cmd_short_name; e 1014 opal/mca/pmix/pmix4x/pmix/src/util/cmd_line.c if (NULL != e->ocl_cmd_single_dash_name) { e 1015 opal/mca/pmix/pmix4x/pmix/src/util/cmd_line.c option->clo_single_dash_name = strdup(e->ocl_cmd_single_dash_name); e 1017 opal/mca/pmix/pmix4x/pmix/src/util/cmd_line.c if (NULL != e->ocl_cmd_long_name) { e 1018 opal/mca/pmix/pmix4x/pmix/src/util/cmd_line.c option->clo_long_name = strdup(e->ocl_cmd_long_name); e 1020 opal/mca/pmix/pmix4x/pmix/src/util/cmd_line.c option->clo_num_params = e->ocl_num_params; e 1021 opal/mca/pmix/pmix4x/pmix/src/util/cmd_line.c if (NULL != e->ocl_description) { e 1022 opal/mca/pmix/pmix4x/pmix/src/util/cmd_line.c option->clo_description = strdup(e->ocl_description); e 1025 opal/mca/pmix/pmix4x/pmix/src/util/cmd_line.c option->clo_type = e->ocl_variable_type; e 1026 opal/mca/pmix/pmix4x/pmix/src/util/cmd_line.c option->clo_variable_dest = e->ocl_variable_dest; e 1027 opal/mca/pmix/pmix4x/pmix/src/util/cmd_line.c if (NULL != e->ocl_mca_param_name) { e 1028 opal/mca/pmix/pmix4x/pmix/src/util/cmd_line.c (void) pmix_mca_base_var_env_name (e->ocl_mca_param_name, e 1032 opal/mca/pmix/pmix4x/pmix/src/util/cmd_line.c option->clo_otype = e->ocl_otype; e 81 opal/mca/pmix/pmix4x/pmix/test/pmi2_client.c #define log_assert(e, msg) \ e 83 opal/mca/pmix/pmix4x/pmix/test/pmi2_client.c if (!(e)) { \ e 81 opal/mca/pmix/pmix4x/pmix/test/pmi_client.c #define log_assert(e, msg) \ e 83 opal/mca/pmix/pmix4x/pmix/test/pmi_client.c if (!(e)) { \ e 163 opal/mca/pmix/pmix4x/pmix4x.h #define OPAL_PMIX_OP_THREADSHIFT(e, fn, cb, cd) \ e 167 opal/mca/pmix/pmix4x/pmix4x.h _cd->handler = (e); \ e 176 opal/mca/pmix/pmix4x/pmix4x.h #define OPAL_PMIX_THREADSHIFT(e, i, eh, fn, cb, cd) \ e 180 opal/mca/pmix/pmix4x/pmix4x.h _cd->event_codes = (e); \ e 90 opal/mca/reachable/netlink/reachable_netlink_utils_common.c struct nlmsgerr *e = (struct nlmsgerr *)nlmsg_data(nlm_hdr); e 91 opal/mca/reachable/netlink/reachable_netlink_utils_common.c if (nlm_hdr->nlmsg_len >= (__u32)NLMSG_SIZE(sizeof(*e))) e 58 opal/util/bipartite_graph.c static void edge_constructor(opal_bp_graph_edge_t *e) e 60 opal/util/bipartite_graph.c OBJ_CONSTRUCT(&e->outbound_li, opal_list_item_t); e 61 opal/util/bipartite_graph.c OBJ_CONSTRUCT(&e->inbound_li, opal_list_item_t); e 64 opal/util/bipartite_graph.c static void edge_destructor(opal_bp_graph_edge_t *e) e 66 opal/util/bipartite_graph.c OBJ_DESTRUCT(&e->outbound_li); e 67 opal/util/bipartite_graph.c OBJ_DESTRUCT(&e->inbound_li); e 122 opal/util/bipartite_graph.c opal_bp_graph_edge_t *e; e 127 opal/util/bipartite_graph.c FOREACH_OUT_EDGE(g, source, e) { e 128 opal/util/bipartite_graph.c assert(e->source == source); e 129 opal/util/bipartite_graph.c if (e->target == target) { e 130 opal/util/bipartite_graph.c return e->capacity; e 140 opal/util/bipartite_graph.c opal_bp_graph_edge_t *e; e 145 opal/util/bipartite_graph.c FOREACH_OUT_EDGE(g, source, e) { e 146 opal/util/bipartite_graph.c assert(e->source == source); e 147 opal/util/bipartite_graph.c if (e->target == target) { e 148 opal/util/bipartite_graph.c e->capacity = cap; e 210 opal/util/bipartite_graph.c opal_bp_graph_edge_t *e, *next; e 216 opal/util/bipartite_graph.c LIST_FOREACH_SAFE_CONTAINED(e, next, &v->out_edges, e 218 opal/util/bipartite_graph.c opal_list_remove_item(&v->out_edges, &e->outbound_li); e 219 opal/util/bipartite_graph.c OBJ_RELEASE(e); e 225 opal/util/bipartite_graph.c LIST_FOREACH_SAFE_CONTAINED(e, next, &v->in_edges, e 227 opal/util/bipartite_graph.c opal_list_remove_item(&v->in_edges, &e->inbound_li); e 229 opal/util/bipartite_graph.c if (NULL != g->e_data_cleanup_fn && NULL != e->e_data) { e 230 opal/util/bipartite_graph.c g->e_data_cleanup_fn(e->e_data); e 232 opal/util/bipartite_graph.c OBJ_RELEASE(e); e 254 opal/util/bipartite_graph.c opal_bp_graph_edge_t *e; e 287 opal/util/bipartite_graph.c FOREACH_OUT_EDGE(g, i, e) { e 288 opal/util/bipartite_graph.c assert(i == e->source); e 289 opal/util/bipartite_graph.c err = opal_bp_graph_add_edge(gx, e->source, e->target, e 290 opal/util/bipartite_graph.c e->cost, e->capacity, NULL); e 332 opal/util/bipartite_graph.c opal_bp_graph_edge_t *e; e 349 opal/util/bipartite_graph.c FOREACH_OUT_EDGE(g, from, e) { e 350 opal/util/bipartite_graph.c assert(e->source == from); e 351 opal/util/bipartite_graph.c if (e->target == to) { e 357 opal/util/bipartite_graph.c e = OBJ_NEW(opal_bp_graph_edge_t); e 358 opal/util/bipartite_graph.c if (NULL == e) { e 363 opal/util/bipartite_graph.c e->source = from; e 364 opal/util/bipartite_graph.c e->target = to; e 365 opal/util/bipartite_graph.c e->cost = cost; e 366 opal/util/bipartite_graph.c e->capacity = capacity; e 367 opal/util/bipartite_graph.c e->e_data = e_data; e 370 opal/util/bipartite_graph.c opal_list_append(&v_from->out_edges, &e->outbound_li); e 372 opal/util/bipartite_graph.c OBJ_RETAIN(e); /* ref owned by in_edges list */ e 374 opal/util/bipartite_graph.c opal_list_append(&v_to->in_edges, &e->inbound_li); e 135 opal/util/cmd_line.c static int make_opt(opal_cmd_line_t *cmd, opal_cmd_line_init_t *e); e 225 opal/util/cmd_line.c opal_cmd_line_init_t e; e 227 opal/util/cmd_line.c e.ocl_mca_param_name = NULL; e 229 opal/util/cmd_line.c e.ocl_cmd_short_name = short_name; e 230 opal/util/cmd_line.c e.ocl_cmd_single_dash_name = sd_name; e 231 opal/util/cmd_line.c e.ocl_cmd_long_name = long_name; e 233 opal/util/cmd_line.c e.ocl_num_params = num_params; e 235 opal/util/cmd_line.c e.ocl_variable_dest = NULL; e 236 opal/util/cmd_line.c e.ocl_variable_type = OPAL_CMD_LINE_TYPE_NULL; e 238 opal/util/cmd_line.c e.ocl_description = desc; e 240 opal/util/cmd_line.c return make_opt(cmd, &e); e 984 opal/util/cmd_line.c static int make_opt(opal_cmd_line_t *cmd, opal_cmd_line_init_t *e) e 992 opal/util/cmd_line.c } else if ('\0' == e->ocl_cmd_short_name && e 993 opal/util/cmd_line.c NULL == e->ocl_cmd_single_dash_name && e 994 opal/util/cmd_line.c NULL == e->ocl_cmd_long_name) { e 996 opal/util/cmd_line.c } else if (e->ocl_num_params < 0) { e 1001 opal/util/cmd_line.c if (NULL != e->ocl_cmd_single_dash_name && e 1002 opal/util/cmd_line.c NULL != find_option(cmd, e->ocl_cmd_single_dash_name)) { e 1003 opal/util/cmd_line.c opal_output(0, "Duplicate cmd line entry %s", e->ocl_cmd_single_dash_name); e 1006 opal/util/cmd_line.c if (NULL != e->ocl_cmd_long_name && e 1007 opal/util/cmd_line.c NULL != find_option(cmd, e->ocl_cmd_long_name)) { e 1008 opal/util/cmd_line.c opal_output(0, "Duplicate cmd line entry %s", e->ocl_cmd_long_name); e 1018 opal/util/cmd_line.c option->clo_short_name = e->ocl_cmd_short_name; e 1019 opal/util/cmd_line.c if (NULL != e->ocl_cmd_single_dash_name) { e 1020 opal/util/cmd_line.c option->clo_single_dash_name = strdup(e->ocl_cmd_single_dash_name); e 1022 opal/util/cmd_line.c if (NULL != e->ocl_cmd_long_name) { e 1023 opal/util/cmd_line.c option->clo_long_name = strdup(e->ocl_cmd_long_name); e 1025 opal/util/cmd_line.c option->clo_num_params = e->ocl_num_params; e 1026 opal/util/cmd_line.c if (NULL != e->ocl_description) { e 1027 opal/util/cmd_line.c option->clo_description = strdup(e->ocl_description); e 1030 opal/util/cmd_line.c option->clo_type = e->ocl_variable_type; e 1031 opal/util/cmd_line.c option->clo_variable_dest = e->ocl_variable_dest; e 1032 opal/util/cmd_line.c if (NULL != e->ocl_mca_param_name) { e 1033 opal/util/cmd_line.c (void) mca_base_var_env_name (e->ocl_mca_param_name, e 1037 opal/util/cmd_line.c option->clo_otype = e->ocl_otype; e 27 opal/win32/opal_socket.c #define ERR(e) WSA##e e 29 opal/win32/opal_socket.c #define ERR(e) e e 2732 oshmem/mca/memheap/ptmalloc/malloc.c #define RTCHECK(e) __builtin_expect(e, 1) e 2734 oshmem/mca/memheap/ptmalloc/malloc.c #define RTCHECK(e) (e) e 2737 oshmem/mca/memheap/ptmalloc/malloc.c #define RTCHECK(e) (1)