Home | History | Annotate | Download | only in gmon

Lines Matching defs:top

134 	struct tostruct *top, *prevtop;
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.
225 		if (top->link == 0) {
227 			 * top is end of the chain and none of the chain
228 			 * had top->selfpc == selfpc.
236 			top = &p->tos[(size_t)toindex];
237 			top->selfpc = selfpc;
238 			top->count = 1;
239 			top->link = *frompcindex;
246 		prevtop = top;
247 		top = &p->tos[top->link];
248 		if (top->selfpc == selfpc) {
254 			top->count++;
256 			prevtop->link = top->link;
257 			top->link = *frompcindex;
296 	struct tostruct *top;
324 				top = &p->tos[(size_t)toindex];
325 				top->selfpc = selfpc;
326 				top->count = count;
327 				top->link = 0;
330 			top = &p->tos[(size_t)toindex];
331 			if (top->selfpc == selfpc) {
335 				top->count+= count;
340 			 * top points to what we are looking at,
344 				if (top->link == 0) {
346 					 * top is end of the chain and
348 					 * top->selfpc == selfpc.  so
357 					top = &p->tos[(size_t)toindex];
358 					top->selfpc = selfpc;
359 					top->count = count;
360 					top->link = *frompcindex;
367 				top = &p->tos[top->link];
368 				if (top->selfpc == selfpc) {
373 					top->count += count;