Lines Matching refs:p
45 #define POP_MSG(p) \ argument
46 "\tpopping off stack: %s (%s)\n", cons_text_c[(p)->stack_data[tos].type], \
47 get_src((p)->stack_data[tos].ident)
56 static void __kmp_expand_cons_stack(int gtid, struct cons_header *p) { in __kmp_expand_cons_stack() argument
66 d = p->stack_data; in __kmp_expand_cons_stack()
68 p->stack_size = (p->stack_size * 2) + 100; in __kmp_expand_cons_stack()
71 p->stack_data = (struct cons_data *)__kmp_allocate(sizeof(struct cons_data) * in __kmp_expand_cons_stack()
72 (p->stack_size + 1)); in __kmp_expand_cons_stack()
74 for (i = p->stack_top; i >= 0; --i) in __kmp_expand_cons_stack()
75 p->stack_data[i] = d[i]; in __kmp_expand_cons_stack()
134 struct cons_header *p; in __kmp_allocate_cons_stack() local
141 p = (struct cons_header *)__kmp_allocate(sizeof(struct cons_header)); in __kmp_allocate_cons_stack()
142 p->p_top = p->w_top = p->s_top = 0; in __kmp_allocate_cons_stack()
143 p->stack_data = (struct cons_data *)__kmp_allocate(sizeof(struct cons_data) * in __kmp_allocate_cons_stack()
145 p->stack_size = MIN_STACK; in __kmp_allocate_cons_stack()
146 p->stack_top = 0; in __kmp_allocate_cons_stack()
147 p->stack_data[0].type = ct_none; in __kmp_allocate_cons_stack()
148 p->stack_data[0].prev = 0; in __kmp_allocate_cons_stack()
149 p->stack_data[0].ident = NULL; in __kmp_allocate_cons_stack()
150 return p; in __kmp_allocate_cons_stack()
154 struct cons_header *p = (struct cons_header *)ptr; in __kmp_free_cons_stack() local
155 if (p != NULL) { in __kmp_free_cons_stack()
156 if (p->stack_data != NULL) { in __kmp_free_cons_stack()
157 __kmp_free(p->stack_data); in __kmp_free_cons_stack()
158 p->stack_data = NULL; in __kmp_free_cons_stack()
160 __kmp_free(p); in __kmp_free_cons_stack()
165 static void dump_cons_stack(int gtid, struct cons_header *p) { in dump_cons_stack() argument
167 int tos = p->stack_top; in dump_cons_stack()
177 p->p_top, p->w_top, p->s_top); in dump_cons_stack()
179 struct cons_data *c = &(p->stack_data[i]); in dump_cons_stack()
195 struct cons_header *p = __kmp_threads[gtid]->th.th_cons; in __kmp_push_parallel() local
200 if (p->stack_top >= p->stack_size) { in __kmp_push_parallel()
201 __kmp_expand_cons_stack(gtid, p); in __kmp_push_parallel()
203 tos = ++p->stack_top; in __kmp_push_parallel()
204 p->stack_data[tos].type = ct_parallel; in __kmp_push_parallel()
205 p->stack_data[tos].prev = p->p_top; in __kmp_push_parallel()
206 p->stack_data[tos].ident = ident; in __kmp_push_parallel()
207 p->stack_data[tos].name = NULL; in __kmp_push_parallel()
208 p->p_top = tos; in __kmp_push_parallel()
209 KE_DUMP(1000, dump_cons_stack(gtid, p)); in __kmp_push_parallel()
213 struct cons_header *p = __kmp_threads[gtid]->th.th_cons; in __kmp_check_workshare() local
218 if (p->stack_top >= p->stack_size) { in __kmp_check_workshare()
219 __kmp_expand_cons_stack(gtid, p); in __kmp_check_workshare()
221 if (p->w_top > p->p_top) { in __kmp_check_workshare()
224 &p->stack_data[p->w_top]); in __kmp_check_workshare()
226 if (p->s_top > p->p_top) { in __kmp_check_workshare()
229 &p->stack_data[p->s_top]); in __kmp_check_workshare()
235 struct cons_header *p = __kmp_threads[gtid]->th.th_cons; in __kmp_push_workshare() local
239 tos = ++p->stack_top; in __kmp_push_workshare()
240 p->stack_data[tos].type = ct; in __kmp_push_workshare()
241 p->stack_data[tos].prev = p->w_top; in __kmp_push_workshare()
242 p->stack_data[tos].ident = ident; in __kmp_push_workshare()
243 p->stack_data[tos].name = NULL; in __kmp_push_workshare()
244 p->w_top = tos; in __kmp_push_workshare()
245 KE_DUMP(1000, dump_cons_stack(gtid, p)); in __kmp_push_workshare()
255 struct cons_header *p = __kmp_threads[gtid]->th.th_cons; local
259 if (p->stack_top >= p->stack_size)
260 __kmp_expand_cons_stack(gtid, p);
263 if (p->w_top <= p->p_top) {
273 if (!IS_CONS_TYPE_ORDERED(p->stack_data[p->w_top].type)) {
275 &p->stack_data[p->w_top]);
278 if (p->s_top > p->p_top && p->s_top > p->w_top) {
280 int index = p->s_top;
283 stack_type = p->stack_data[index].type;
289 p->stack_data[index].ident != NULL &&
290 (p->stack_data[index].ident->flags & KMP_IDENT_KMPC))) {
293 &p->stack_data[index]);
306 int index = p->s_top;
309 while (index != 0 && p->stack_data[index].name != lck) {
310 index = p->stack_data[index].prev;
315 cons = p->stack_data[index];
321 if (p->w_top > p->p_top) {
324 &p->stack_data[p->w_top]);
326 if (ct == ct_reduce && p->s_top > p->p_top) {
329 &p->stack_data[p->s_top]);
342 struct cons_header *p = __kmp_threads[gtid]->th.th_cons; local
352 tos = ++p->stack_top;
353 p->stack_data[tos].type = ct;
354 p->stack_data[tos].prev = p->s_top;
355 p->stack_data[tos].ident = ident;
356 p->stack_data[tos].name = lck;
357 p->s_top = tos;
358 KE_DUMP(1000, dump_cons_stack(gtid, p));
365 struct cons_header *p = __kmp_threads[gtid]->th.th_cons; local
366 tos = p->stack_top;
368 if (tos == 0 || p->p_top == 0) {
371 if (tos != p->p_top || p->stack_data[tos].type != ct_parallel) {
373 &p->stack_data[tos]);
375 KE_TRACE(100, (POP_MSG(p)));
376 p->p_top = p->stack_data[tos].prev;
377 p->stack_data[tos].type = ct_none;
378 p->stack_data[tos].ident = NULL;
379 p->stack_top = tos - 1;
380 KE_DUMP(1000, dump_cons_stack(gtid, p));
386 struct cons_header *p = __kmp_threads[gtid]->th.th_cons; local
388 tos = p->stack_top;
390 if (tos == 0 || p->w_top == 0) {
394 if (tos != p->w_top ||
395 (p->stack_data[tos].type != ct &&
397 !(p->stack_data[tos].type == ct_pdo_ordered && ct == ct_pdo))) {
400 &p->stack_data[tos]);
402 KE_TRACE(100, (POP_MSG(p)));
403 p->w_top = p->stack_data[tos].prev;
404 p->stack_data[tos].type = ct_none;
405 p->stack_data[tos].ident = NULL;
406 p->stack_top = tos - 1;
407 KE_DUMP(1000, dump_cons_stack(gtid, p));
408 return p->stack_data[p->w_top].type;
413 struct cons_header *p = __kmp_threads[gtid]->th.th_cons; local
414 tos = p->stack_top;
416 if (tos == 0 || p->s_top == 0) {
419 if (tos != p->s_top || p->stack_data[tos].type != ct) {
422 &p->stack_data[tos]);
424 KE_TRACE(100, (POP_MSG(p)));
425 p->s_top = p->stack_data[tos].prev;
426 p->stack_data[tos].type = ct_none;
427 p->stack_data[tos].ident = NULL;
428 p->stack_top = tos - 1;
429 KE_DUMP(1000, dump_cons_stack(gtid, p));
435 struct cons_header *p = __kmp_threads[gtid]->th.th_cons; local
441 if (p->w_top > p->p_top) {
444 &p->stack_data[p->w_top]);
446 if (p->s_top > p->p_top) {
449 &p->stack_data[p->s_top]);