| /src/sys/uvm/ |
| uvm_page_array.c | 141 const bool dense = (flags & UVM_PAGE_ARRAY_FILL_DENSE) != 0; local
162 maxpages, dense, tagmask);
168 maxpages, dense);
173 * if dense or looking for tagged entries (or
|
| uvm_page_array.c | 141 const bool dense = (flags & UVM_PAGE_ARRAY_FILL_DENSE) != 0; local
162 maxpages, dense, tagmask);
168 maxpages, dense);
173 * if dense or looking for tagged entries (or
|
| /src/external/gpl3/gcc/dist/gcc/ |
| sparseset.h | 33 index of I in the dense vector, and dense[sparse[I]] == I. The dense
49 The members of the set are stored cache-friendly in the dense vector.
81 over the members in the set is cache-friendly because only the dense
90 SPARSESET_ELT_TYPE *dense; /* Dense array. */ member in struct:sparseset_def
97 SPARSESET_ELT_TYPE elms[2]; /* Combined dense and sparse arrays. */
146 return idx < s->members && s->dense[idx] == e;
156 s->dense[idx] = e
[all...] |
| sparseset.h | 33 index of I in the dense vector, and dense[sparse[I]] == I. The dense
49 The members of the set are stored cache-friendly in the dense vector.
81 over the members in the set is cache-friendly because only the dense
90 SPARSESET_ELT_TYPE *dense; /* Dense array. */ member in struct:sparseset_def
97 SPARSESET_ELT_TYPE elms[2]; /* Combined dense and sparse arrays. */
146 return idx < s->members && s->dense[idx] == e;
156 s->dense[idx] = e
[all...] |
| /src/external/gpl3/gcc.old/dist/gcc/ |
| sparseset.h | 33 index of I in the dense vector, and dense[sparse[I]] == I. The dense
49 The members of the set are stored cache-friendly in the dense vector.
81 over the members in the set is cache-friendly because only the dense
90 SPARSESET_ELT_TYPE *dense; /* Dense array. */ member in struct:sparseset_def
97 SPARSESET_ELT_TYPE elms[2]; /* Combined dense and sparse arrays. */
146 return idx < s->members && s->dense[idx] == e;
156 s->dense[idx] = e
[all...] |
| sparseset.h | 33 index of I in the dense vector, and dense[sparse[I]] == I. The dense
49 The members of the set are stored cache-friendly in the dense vector.
81 over the members in the set is cache-friendly because only the dense
90 SPARSESET_ELT_TYPE *dense; /* Dense array. */ member in struct:sparseset_def
97 SPARSESET_ELT_TYPE elms[2]; /* Combined dense and sparse arrays. */
146 return idx < s->members && s->dense[idx] == e;
156 s->dense[idx] = e
[all...] |
| /src/external/gpl3/binutils/dist/gas/ |
| ecoff.c | 58 +-- Dense number table
164 The dense number table is used in the front ends, and disappears by
284 Dense numbers 0 0 0
1036 DNR dense [ PAGE_SIZE / sizeof (DNR) ];
4675 /* We don't use dense numbers at all. */
1034 DNR dense [ PAGE_SIZE \/ sizeof (DNR) ]; member in union:page
|
| ecoff.c | 58 +-- Dense number table
164 The dense number table is used in the front ends, and disappears by
284 Dense numbers 0 0 0
1036 DNR dense [ PAGE_SIZE / sizeof (DNR) ];
4675 /* We don't use dense numbers at all. */
1034 DNR dense [ PAGE_SIZE \/ sizeof (DNR) ]; member in union:page
|
| /src/external/gpl3/binutils.old/dist/gas/ |
| ecoff.c | 58 +-- Dense number table
164 The dense number table is used in the front ends, and disappears by
284 Dense numbers 0 0 0
1036 DNR dense [ PAGE_SIZE / sizeof (DNR) ];
4672 /* We don't use dense numbers at all. */
1034 DNR dense [ PAGE_SIZE \/ sizeof (DNR) ]; member in union:page
|
| ecoff.c | 58 +-- Dense number table
164 The dense number table is used in the front ends, and disappears by
284 Dense numbers 0 0 0
1036 DNR dense [ PAGE_SIZE / sizeof (DNR) ];
4672 /* We don't use dense numbers at all. */
1034 DNR dense [ PAGE_SIZE \/ sizeof (DNR) ]; member in union:page
|
