HomeSort by: relevance | last modified time | path
    Searched defs:top (Results 1 - 25 of 212) sorted by relevancy

1 2 3 4 5 6 7 8 9

  /src/usr.bin/m4/
parser.y 46 top : expr { end_result = $1; } label
parser.y 46 top : expr { end_result = $1; } label
  /src/sys/external/bsd/compiler_rt/dist/lib/ubsan/
ubsan_diag_standalone.cc 23 uptr top = 0; local in function:__sanitizer_print_stack_trace
27 __sanitizer::GetThreadStackTopAndBottom(false, &top, &bottom);
32 stack.Unwind(kStackTraceMax, pc, bp, nullptr, top, bottom,
ubsan_diag_standalone.cc 23 uptr top = 0; local in function:__sanitizer_print_stack_trace
27 __sanitizer::GetThreadStackTopAndBottom(false, &top, &bottom);
32 stack.Unwind(kStackTraceMax, pc, bp, nullptr, top, bottom,
  /src/lib/libc/db/btree/
bt_conv.c 65 indx_t i, top; local in function:__bt_pgin
85 top = NEXTINDEX(h);
87 for (i = 0; i < top; i++) {
102 for (i = 0; i < top; i++) {
132 indx_t i, top; local in function:__bt_pgout
145 top = NEXTINDEX(h);
147 for (i = 0; i < top; i++) {
162 for (i = 0; i < top; i++) {
bt_conv.c 65 indx_t i, top; local in function:__bt_pgin
85 top = NEXTINDEX(h);
87 for (i = 0; i < top; i++) {
102 for (i = 0; i < top; i++) {
132 indx_t i, top; local in function:__bt_pgout
145 top = NEXTINDEX(h);
147 for (i = 0; i < top; i++) {
162 for (i = 0; i < top; i++) {
  /src/lib/libc/db/recno/
rec_search.c 74 indx_t top; local in function:__rec_search
87 for (idx = 0, top = NEXTINDEX(h);;) {
89 if (++idx == top || total + r->nrecs > recno)
rec_search.c 74 indx_t top; local in function:__rec_search
87 for (idx = 0, top = NEXTINDEX(h);;) {
89 if (++idx == top || total + r->nrecs > recno)
  /src/sys/arch/powerpc/fpu/
fpu_subr.c 139 u_int m0, m1, m2, m3, top, sup, nrm; local in function:fpu_norm
170 for (rsh = 1, top = m0 >> 1; top >= sup; rsh++) /* XXX slow */
171 top >>= 1;
177 m0 = top;
183 for (lsh = 1, top = m0 << 1; top < nrm; lsh++) /* XXX slow */
184 top <<= 1;
187 m0 = top | (m1 >> rsh);
fpu_subr.c 139 u_int m0, m1, m2, m3, top, sup, nrm; local in function:fpu_norm
170 for (rsh = 1, top = m0 >> 1; top >= sup; rsh++) /* XXX slow */
171 top >>= 1;
177 m0 = top;
183 for (lsh = 1, top = m0 << 1; top < nrm; lsh++) /* XXX slow */
184 top <<= 1;
187 m0 = top | (m1 >> rsh);
  /src/sys/arch/sparc/fpu/
fpu_subr.c 145 u_int m0, m1, m2, m3, top, sup, nrm; local in function:fpu_norm
176 for (rsh = 1, top = m0 >> 1; top >= sup; rsh++) /* XXX slow */
177 top >>= 1;
183 m0 = top;
189 for (lsh = 1, top = m0 << 1; top < nrm; lsh++) /* XXX slow */
190 top <<= 1;
193 m0 = top | (m1 >> rsh);
fpu_subr.c 145 u_int m0, m1, m2, m3, top, sup, nrm; local in function:fpu_norm
176 for (rsh = 1, top = m0 >> 1; top >= sup; rsh++) /* XXX slow */
177 top >>= 1;
183 m0 = top;
189 for (lsh = 1, top = m0 << 1; top < nrm; lsh++) /* XXX slow */
190 top <<= 1;
193 m0 = top | (m1 >> rsh);
  /src/sys/lib/libsa/
alloc.c 146 static char *top, *heapstart, *heaplimit; variable in typeref:typename:char *
150 heapstart = top = start;
160 static char *top = (char *)HEAP_START; variable in typeref:typename:char *
194 help = top;
199 top += ALIGN(sizeof(unsigned int)) + ALIGN(size);
201 if (top > (char *)HEAP_LIMIT)
alloc.c 146 static char *top, *heapstart, *heaplimit; variable in typeref:typename:char *
150 heapstart = top = start;
160 static char *top = (char *)HEAP_START; variable in typeref:typename:char *
194 help = top;
199 top += ALIGN(sizeof(unsigned int)) + ALIGN(size);
201 if (top > (char *)HEAP_LIMIT)
  /src/usr.bin/telnet/
ring.h 50 *top, /* highest address+1 in buffer */ member in struct:__anon5726843e0108
ring.h 50 *top, /* highest address+1 in buffer */ member in struct:__anon5726843e0108
  /src/games/dab/
box.h 54 top = 0, enumerator in enum:BOX::EDGE
box.h 54 top = 0, enumerator in enum:BOX::EDGE
  /src/sys/external/bsd/drm2/dist/drm/nouveau/nvkm/subdev/top/
nouveau_nvkm_subdev_top_base.c 32 nvkm_top_device_new(struct nvkm_top *top)
43 list_add_tail(&info->head, &top->device);
51 struct nvkm_top *top = device->top; local in function:nvkm_top_addr
54 if (top) {
55 list_for_each_entry(info, &top->device, head) {
67 struct nvkm_top *top = device->top; local in function:nvkm_top_reset
70 if (top) {
71 list_for_each_entry(info, &top->device, head)
83 struct nvkm_top *top = device->top; local in function:nvkm_top_intr_mask
99 struct nvkm_top *top = device->top; local in function:nvkm_top_intr
122 struct nvkm_top *top = device->top; local in function:nvkm_top_fault_id
136 struct nvkm_top *top = device->top; local in function:nvkm_top_fault
150 struct nvkm_top *top = device->top; local in function:nvkm_top_engine
168 struct nvkm_top *top = nvkm_top(subdev); local in function:nvkm_top_oneinit
175 struct nvkm_top *top = nvkm_top(subdev); local in function:nvkm_top_dtor
196 struct nvkm_top *top; local in function:nvkm_top_new_
    [all...]
nouveau_nvkm_subdev_top_base.c 32 nvkm_top_device_new(struct nvkm_top *top)
43 list_add_tail(&info->head, &top->device);
51 struct nvkm_top *top = device->top; local in function:nvkm_top_addr
54 if (top) {
55 list_for_each_entry(info, &top->device, head) {
67 struct nvkm_top *top = device->top; local in function:nvkm_top_reset
70 if (top) {
71 list_for_each_entry(info, &top->device, head)
83 struct nvkm_top *top = device->top; local in function:nvkm_top_intr_mask
99 struct nvkm_top *top = device->top; local in function:nvkm_top_intr
122 struct nvkm_top *top = device->top; local in function:nvkm_top_fault_id
136 struct nvkm_top *top = device->top; local in function:nvkm_top_fault
150 struct nvkm_top *top = device->top; local in function:nvkm_top_engine
168 struct nvkm_top *top = nvkm_top(subdev); local in function:nvkm_top_oneinit
175 struct nvkm_top *top = nvkm_top(subdev); local in function:nvkm_top_dtor
196 struct nvkm_top *top; local in function:nvkm_top_new_
    [all...]
  /src/usr.sbin/altq/altqstat/
qdisc_wfq.c 68 struct wfqinfo *qinfo, **top; local in function:wfq_stat_loop
88 if ((top = malloc(ntop * sizeof(struct wfqinfo *))) == NULL)
102 top[j] = NULL;
125 if (top[j] == NULL) {
126 top[j] = &qinfo[i];
129 if (top[j]->bps < qinfo[i].bps ||
130 (top[j]->bps == qinfo[i].bps &&
131 top[j]->stats.xmit_cnt.packets <
134 top[k] = top[k-1]
    [all...]
qdisc_wfq.c 68 struct wfqinfo *qinfo, **top; local in function:wfq_stat_loop
88 if ((top = malloc(ntop * sizeof(struct wfqinfo *))) == NULL)
102 top[j] = NULL;
125 if (top[j] == NULL) {
126 top[j] = &qinfo[i];
129 if (top[j]->bps < qinfo[i].bps ||
130 (top[j]->bps == qinfo[i].bps &&
131 top[j]->stats.xmit_cnt.packets <
134 top[k] = top[k-1]
    [all...]
  /src/common/lib/libc/gmon/
mcount.c 134 struct tostruct *top, *prevtop; local in function:_MCOUNT_DECL
204 top = &p->tos[(size_t)toindex];
205 top->selfpc = selfpc;
206 top->count = 1;
207 top->link = 0;
210 top = &p->tos[(size_t)toindex];
211 if (top->selfpc == selfpc) {
215 top->count++;
220 * top points to what we are looking at,
221 * prevtop points to previous top
296 struct tostruct *top; local in function:_gmonparam_merge
    [all...]
mcount.c 134 struct tostruct *top, *prevtop; local in function:_MCOUNT_DECL
204 top = &p->tos[(size_t)toindex];
205 top->selfpc = selfpc;
206 top->count = 1;
207 top->link = 0;
210 top = &p->tos[(size_t)toindex];
211 if (top->selfpc == selfpc) {
215 top->count++;
220 * top points to what we are looking at,
221 * prevtop points to previous top
296 struct tostruct *top; local in function:_gmonparam_merge
    [all...]
  /src/sys/arch/x68k/stand/common/
exec_sub.c 119 char *top = (void *) hdr; local in function:xk_elf
132 ph = (void *) (top + hdr->e_phoff);
136 sec->sec_image = top + ph->p_offset;
144 sec->sec_image = top + ph->p_offset;
165 sh = (void *) (top + hdr->e_shoff); /* section header */
167 shstrtab = top + shstr->sh_offset;
226 top + sym->sh_offset, sym->sh_size);
232 top + str->sh_offset, str->sh_size);
239 top + stab->sh_offset, stab->sh_size);

Completed in 66 milliseconds

1 2 3 4 5 6 7 8 9