43   "\tpopping off stack: %s (%s)\n", cons_text_c[(p)->stack_data[tos].type],    \
44       get_src((p)->stack_data[tos].ident)
63   d = p->stack_data;  in __kmp_expand_cons_stack()
68   p->stack_data = (struct cons_data *)__kmp_allocate(sizeof(struct cons_data) *  in __kmp_expand_cons_stack()
72     p->stack_data[i] = d[i];  in __kmp_expand_cons_stack()
140   p->stack_data = (struct cons_data *)__kmp_allocate(sizeof(struct cons_data) *  in __kmp_allocate_cons_stack()
144   p->stack_data[0].type = ct_none;  in __kmp_allocate_cons_stack()
145   p->stack_data[0].prev = 0;  in __kmp_allocate_cons_stack()
146   p->stack_data[0].ident = NULL;  in __kmp_allocate_cons_stack()
153     if (p->stack_data != NULL) {  in __kmp_free_cons_stack()
154       __kmp_free(p->stack_data);  in __kmp_free_cons_stack()
155       p->stack_data = NULL;  in __kmp_free_cons_stack()
176     struct cons_data *c = &(p->stack_data[i]);  in dump_cons_stack()
201   p->stack_data[tos].type = ct_parallel;  in __kmp_push_parallel()
202   p->stack_data[tos].prev = p->p_top;  in __kmp_push_parallel()
203   p->stack_data[tos].ident = ident;  in __kmp_push_parallel()
204   p->stack_data[tos].name = NULL;  in __kmp_push_parallel()
219       !(IS_CONS_TYPE_TASKQ(p->stack_data[p->w_top].type) &&  in __kmp_check_workshare()
223                            &p->stack_data[p->w_top]);  in __kmp_check_workshare()
228                            &p->stack_data[p->s_top]);  in __kmp_check_workshare()
239   p->stack_data[tos].type = ct;  in __kmp_push_workshare()
240   p->stack_data[tos].prev = p->w_top;  in __kmp_push_workshare()
241   p->stack_data[tos].ident = ident;  in __kmp_push_workshare()
242   p->stack_data[tos].name = NULL;  in __kmp_push_workshare()
273       if (!IS_CONS_TYPE_ORDERED(p->stack_data[p->w_top].type)) {
274         if (p->stack_data[p->w_top].type == ct_taskq) {
276                                  &p->stack_data[p->w_top]);
279                                  &p->stack_data[p->w_top]);
288       stack_type = p->stack_data[index].type;
296            p->stack_data[index].ident != NULL &&
297            (p->stack_data[index].ident->flags & KMP_IDENT_KMPC))) {
300                                &p->stack_data[index]);
316       while (index != 0 && p->stack_data[index].name != lck) {
317         index = p->stack_data[index].prev;
322         cons = p->stack_data[index];
331                              &p->stack_data[p->w_top]);
336                              &p->stack_data[p->s_top]);
360   p->stack_data[tos].type = ct;
361   p->stack_data[tos].prev = p->s_top;
362   p->stack_data[tos].ident = ident;
363   p->stack_data[tos].name = lck;
378   if (tos != p->p_top || p->stack_data[tos].type != ct_parallel) {
380                            &p->stack_data[tos]);
383   p->p_top = p->stack_data[tos].prev;
384   p->stack_data[tos].type = ct_none;
385   p->stack_data[tos].ident = NULL;
402       (p->stack_data[tos].type != ct &&
404        !(p->stack_data[tos].type == ct_pdo_ordered && ct == ct_pdo) &&
405        !(p->stack_data[tos].type == ct_task_ordered && ct == ct_task))) {
408                            &p->stack_data[tos]);
411   p->w_top = p->stack_data[tos].prev;
412   p->stack_data[tos].type = ct_none;
413   p->stack_data[tos].ident = NULL;
416   return p->stack_data[p->w_top].type;
427   if (tos != p->s_top || p->stack_data[tos].type != ct) {
430                            &p->stack_data[tos]);
436   p->s_top = p->stack_data[tos].prev;
437   p->stack_data[tos].type = ct_none;
438   p->stack_data[tos].ident = NULL;
455                            &p->stack_data[p->w_top]);
460                            &p->stack_data[p->s_top]);