HomeSort by: relevance | last modified time | path
    Searched refs:vertices (Results 1 - 5 of 5) sorted by relevancy

  /src/usr.bin/nbperf/
graph2.c 88 if (ea->vertices[i] < eb->vertices[i])
90 if (ea->vertices[i] > eb->vertices[i])
142 v = graph->verts + e->vertices[i];
156 v = graph->verts + e->vertices[i];
199 e->vertices[j] = hashes[j] % graph->v;
200 if (j == 1 && e->vertices[0] == e->vertices[1]) {
203 e->vertices[1] ^= 1; /* toogle bit to differ *
    [all...]
nbperf-chm.c 60 * Each edge in the represents a key. The vertices are the reminder of
93 if (!state->visited[e->vertices[0]]) {
94 v0 = e->vertices[0];
95 v1 = e->vertices[1];
96 v2 = e->vertices[2];
97 } else if (!state->visited[e->vertices[1]]) {
98 v0 = e->vertices[1];
99 v1 = e->vertices[0];
100 v2 = e->vertices[2];
102 v0 = e->vertices[2]
    [all...]
nbperf-bdz.c 58 * Each edge in the represents a key. The vertices are the reminder of
65 * vertices, so that the sum of all vertices of the edge modulo 4 is
94 if (!state->visited[e->vertices[0]]) {
96 t = e->vertices[0];
97 } else if (!state->visited[e->vertices[1]]) {
99 t = e->vertices[1];
101 if (state->visited[e->vertices[2]])
104 t = e->vertices[2];
108 if (state->visited[e->vertices[0]] == 0
    [all...]
graph2.h 49 * and the vertices of the edge don't have to be copied.
71 uint32_t vertices[GRAPH_SIZE]; local
  /src/lib/libc/cdb/
cdbw.c 360 * and the vertices of the edge don't have to be copied.
371 uint32_t vertices[3]; member in struct:edge
384 struct vertex *vertices; member in struct:state
402 v = &state->vertices[e_->vertices[i]];
411 struct vertex *v_ = &state->vertices[v];
433 memset(state->vertices, 0, sizeof(*state->vertices) * state->entries);
446 e->vertices[j] = fast_remainder32(hashes[j],
451 if (e->vertices[0] == e->vertices[1]
    [all...]

Completed in 16 milliseconds