top 50 ompi/mca/osc/pt2pt/osc_pt2pt_frag.c count = (int)((uintptr_t) frag->top - (uintptr_t) frag->buffer); top 33 ompi/mca/osc/pt2pt/osc_pt2pt_frag.h char *top; top 87 ompi/mca/osc/pt2pt/osc_pt2pt_frag.h curr->top = (char*) (curr->header + 1); top 158 ompi/mca/osc/pt2pt/osc_pt2pt_frag.h *ptr = curr->top; top 161 ompi/mca/osc/pt2pt/osc_pt2pt_frag.h curr->top += request_len; top 7 ompi/mca/topo/treematch/treematch/IntConstantInitializedVector.c if(v->top == 0) top 10 ompi/mca/topo/treematch/treematch/IntConstantInitializedVector.c if(v->from[i] < v->top && v->to[v->from[i]] == i) top 21 ompi/mca/topo/treematch/treematch/IntConstantInitializedVector.c v->top = 0; top 42 ompi/mca/topo/treematch/treematch/IntConstantInitializedVector.c v->from[i] = v->top; top 43 ompi/mca/topo/treematch/treematch/IntConstantInitializedVector.c v->to[v->top] = i; top 44 ompi/mca/topo/treematch/treematch/IntConstantInitializedVector.c v->top++; top 6 ompi/mca/topo/treematch/treematch/IntConstantInitializedVector.h int init_value, size, top, *to, *from, *vec; top 63 orte/mca/filem/raw/filem_raw.h char *top; top 1033 orte/mca/filem/raw/filem_raw_module.c incoming->top = strdup(tmp); top 1142 orte/mca/filem/raw/filem_raw_module.c opal_argv_append_nosize(&sink->link_pts, sink->top); top 1293 orte/mca/filem/raw/filem_raw_module.c ptr->top = NULL; top 1311 orte/mca/filem/raw/filem_raw_module.c if (NULL != ptr->top) { top 1312 orte/mca/filem/raw/filem_raw_module.c free(ptr->top); top 441 orte/mca/rmaps/ppr/rmaps_ppr.c hwloc_obj_t obj, top; top 542 orte/mca/rmaps/ppr/rmaps_ppr.c top = find_split(node->topology->topo, obj); top 543 orte/mca/rmaps/ppr/rmaps_ppr.c hwloc_obj_type_snprintf(dang, 64, top, 1); top 552 orte/mca/rmaps/ppr/rmaps_ppr.c for (k=0; k < top->arity && limit < nprocs; k++) { top 569 orte/mca/rmaps/ppr/rmaps_ppr.c if (hwloc_bitmap_intersects(top->children[k]->cpuset, locale->cpuset)) { top 120 oshmem/mca/memheap/base/base.h static inline unsigned long long memheap_align(unsigned long top) top 122 oshmem/mca/memheap/base/base.h return ((top + MEMHEAP_BASE_MIN_SIZE - 1) & ~(MEMHEAP_BASE_MIN_SIZE - 1)); top 2316 oshmem/mca/memheap/ptmalloc/malloc.c mchunkptr top; top 2363 oshmem/mca/memheap/ptmalloc/malloc.c #define is_initialized(M) ((M)->top != 0) top 2945 oshmem/mca/memheap/ptmalloc/malloc.c if (p != m->dv && p != m->top) { top 2951 oshmem/mca/memheap/ptmalloc/malloc.c assert (next == m->top || cinuse(next)); top 3107 oshmem/mca/memheap/ptmalloc/malloc.c q != m->top && q->head != FENCEPOST_HEAD) { top 3144 oshmem/mca/memheap/ptmalloc/malloc.c if (m->top != 0) { /* check top chunk */ top 3145 oshmem/mca/memheap/ptmalloc/malloc.c do_check_top_chunk(m, m->top); top 3148 oshmem/mca/memheap/ptmalloc/malloc.c dl_assert(bin_find(m, m->top) == 0); top 3172 oshmem/mca/memheap/ptmalloc/malloc.c q != m->top && q->head != FENCEPOST_HEAD) { top 3214 oshmem/mca/memheap/ptmalloc/malloc.c q != m->top && q->head != FENCEPOST_HEAD) { top 3561 oshmem/mca/memheap/ptmalloc/malloc.c m->top = p; top 3591 oshmem/mca/memheap/ptmalloc/malloc.c m->top = m->dv = 0; top 3613 oshmem/mca/memheap/ptmalloc/malloc.c if (oldfirst == m->top) { top 3615 oshmem/mca/memheap/ptmalloc/malloc.c m->top = q; top 3643 oshmem/mca/memheap/ptmalloc/malloc.c char* old_top = (char*)m->top; top 3690 oshmem/mca/memheap/ptmalloc/malloc.c check_top_chunk(m, m->top); top 3729 oshmem/mca/memheap/ptmalloc/malloc.c msegmentptr ss = (m->top == 0)? 0 : segment_holding(m, (char*)m->top); top 3851 oshmem/mca/memheap/ptmalloc/malloc.c segment_holds(sp, m->top)) { /* append */ top 3853 oshmem/mca/memheap/ptmalloc/malloc.c init_top(m, m->top, m->topsize + tsize); top 3876 oshmem/mca/memheap/ptmalloc/malloc.c mchunkptr p = m->top; top 3877 oshmem/mca/memheap/ptmalloc/malloc.c mchunkptr r = m->top = chunk_plus_offset(p, nb); top 3880 oshmem/mca/memheap/ptmalloc/malloc.c check_top_chunk(m, m->top); top 3950 oshmem/mca/memheap/ptmalloc/malloc.c msegmentptr sp = segment_holding(m, (char*)m->top); top 3986 oshmem/mca/memheap/ptmalloc/malloc.c init_top(m, m->top, m->topsize - released); top 3987 oshmem/mca/memheap/ptmalloc/malloc.c check_top_chunk(m, m->top); top 4148 oshmem/mca/memheap/ptmalloc/malloc.c else if (next == m->top && oldsize + m->topsize > nb) { top 4155 oshmem/mca/memheap/ptmalloc/malloc.c m->top = newtop; top 4520 oshmem/mca/memheap/ptmalloc/malloc.c mchunkptr p = gm->top; top 4521 oshmem/mca/memheap/ptmalloc/malloc.c mchunkptr r = gm->top = chunk_plus_offset(p, nb); top 4525 oshmem/mca/memheap/ptmalloc/malloc.c check_top_chunk(gm, gm->top); top 4593 oshmem/mca/memheap/ptmalloc/malloc.c if (next == fm->top) { top 4595 oshmem/mca/memheap/ptmalloc/malloc.c fm->top = p; top 4791 oshmem/mca/memheap/ptmalloc/malloc.c check_top_chunk(m, m->top); top 4949 oshmem/mca/memheap/ptmalloc/malloc.c mchunkptr p = ms->top; top 4950 oshmem/mca/memheap/ptmalloc/malloc.c mchunkptr r = ms->top = chunk_plus_offset(p, nb); top 4954 oshmem/mca/memheap/ptmalloc/malloc.c check_top_chunk(ms, ms->top); top 5016 oshmem/mca/memheap/ptmalloc/malloc.c if (next == fm->top) { top 5018 oshmem/mca/memheap/ptmalloc/malloc.c fm->top = p; top 278 test/class/ompi_rb_tree.c void * top; /* the top of the memory range */ top 301 test/class/ompi_rb_tree.c ((opal_test_rb_key_t *) key2)->top) top 348 test/class/ompi_rb_tree.c ((opal_test_rb_value_t *) new_value)->key.top =