vec 24 ompi/mca/topo/treematch/treematch/IntConstantInitializedVector.c v->vec = malloc(sizeof(int)*size); vec 31 ompi/mca/topo/treematch/treematch/IntConstantInitializedVector.c free(v->vec); vec 46 ompi/mca/topo/treematch/treematch/IntConstantInitializedVector.c v->vec[i] = val; vec 57 ompi/mca/topo/treematch/treematch/IntConstantInitializedVector.c return v->vec[i]; vec 6 ompi/mca/topo/treematch/treematch/IntConstantInitializedVector.h int init_value, size, top, *to, *from, *vec; vec 81 ompi/mpi/java/c/mpi_Op.c static jobject setBooleanArray(JNIEnv *env, void *vec, int len) vec 86 ompi/mpi/java/c/mpi_Op.c (*env)->SetBooleanArrayRegion(env, obj, 0, len, vec); vec 91 ompi/mpi/java/c/mpi_Op.c static void getBooleanArray(JNIEnv *env, jobject obj, void *vec, int len) vec 93 ompi/mpi/java/c/mpi_Op.c (*env)->GetBooleanArrayRegion(env, obj, 0, len, vec); vec 622 opal/mca/event/libevent2022/libevent/buffer.c struct evbuffer_iovec *vec, int n_vecs) vec 636 opal/mca/event/libevent2022/libevent/buffer.c vec[0].iov_base = CHAIN_SPACE_PTR(chain); vec 637 opal/mca/event/libevent2022/libevent/buffer.c vec[0].iov_len = (size_t) CHAIN_SPACE_LEN(chain); vec 638 opal/mca/event/libevent2022/libevent/buffer.c EVUTIL_ASSERT(size<0 || (size_t)vec[0].iov_len >= (size_t)size); vec 643 opal/mca/event/libevent2022/libevent/buffer.c n = _evbuffer_read_setup_vecs(buf, size, vec, n_vecs, vec 671 opal/mca/event/libevent2022/libevent/buffer.c struct evbuffer_iovec *vec, int n_vecs) vec 686 opal/mca/event/libevent2022/libevent/buffer.c (buf->last && vec[0].iov_base == (void*)CHAIN_SPACE_PTR(buf->last))) { vec 689 opal/mca/event/libevent2022/libevent/buffer.c if ((size_t)vec[0].iov_len > (size_t)CHAIN_SPACE_LEN(buf->last)) vec 691 opal/mca/event/libevent2022/libevent/buffer.c buf->last->off += vec[0].iov_len; vec 692 opal/mca/event/libevent2022/libevent/buffer.c added = vec[0].iov_len; vec 712 opal/mca/event/libevent2022/libevent/buffer.c if (vec[i].iov_base != (void*)CHAIN_SPACE_PTR(chain) || vec 713 opal/mca/event/libevent2022/libevent/buffer.c (size_t)vec[i].iov_len > CHAIN_SPACE_LEN(chain)) vec 720 opal/mca/event/libevent2022/libevent/buffer.c (*chainp)->off += vec[i].iov_len; vec 721 opal/mca/event/libevent2022/libevent/buffer.c added += vec[i].iov_len; vec 722 opal/mca/event/libevent2022/libevent/buffer.c if (vec[i].iov_len) { vec 2610 opal/mca/event/libevent2022/libevent/buffer.c struct evbuffer_iovec *vec, int n_vec) vec 2624 opal/mca/event/libevent2022/libevent/buffer.c vec[0].iov_base = chain->buffer + chain->misalign vec 2626 opal/mca/event/libevent2022/libevent/buffer.c vec[0].iov_len = len_so_far; vec 2646 opal/mca/event/libevent2022/libevent/buffer.c vec[idx].iov_base = chain->buffer + chain->misalign; vec 2647 opal/mca/event/libevent2022/libevent/buffer.c vec[idx].iov_len = chain->off; vec 281 opal/mca/event/libevent2022/libevent/include/event2/buffer.h struct evbuffer_iovec *vec, int n_vec); vec 305 opal/mca/event/libevent2022/libevent/include/event2/buffer.h struct evbuffer_iovec *vec, int n_vecs); vec 74 opal/util/bipartite_graph.c static void dump_vec(const char *name, int *vec, int n) vec 77 opal/util/bipartite_graph.c static void dump_vec(const char *name, int *vec, int n) vec 82 opal/util/bipartite_graph.c fprintf(stderr, "[%d]=%2d, ", i, vec[i]); vec 87 opal/util/bipartite_graph.c static void dump_vec64(const char *name, int64_t *vec, int n) vec 90 opal/util/bipartite_graph.c static void dump_vec64(const char *name, int64_t *vec, int n) vec 95 opal/util/bipartite_graph.c fprintf(stderr, "[%d]=%2" PRIi64 ", ", i, vec[i]);