59   kmp_hier_layer_e *layers;  member
69       layers = (kmp_hier_layer_e *)__kmp_allocate(sizeof(kmp_hier_layer_e) *  in append()
76     layers[current_size] = layer;  in append()
89         if (layers[j] < layers[switch_index])  in sort()
93         kmp_hier_layer_e temp1 = layers[i];  in sort()
97         layers[i] = layers[switch_index];  in sort()
101         layers[switch_index] = temp1;  in sort()
112       __kmp_free(layers);  in deallocate()
116       layers = NULL;  in deallocate()
463  * layers.  Layer 0 is the lowest layer to layer num_layers - 1 which is the
517         // middle layers use the shared buffer inside the kmp_hier_top_unit_t  in next_recurse()
577       // private dispatch buffers in the hierarchy's middle layers  in next_recurse()
615   kmp_hier_top_unit_t<T> **layers;  member
619       if (layers[i] != NULL) {  in deallocate()
620         __kmp_free(layers[i]);  in deallocate()
622     if (layers != NULL) {  in deallocate()
623       __kmp_free(layers);  in deallocate()
624       layers = NULL;  in deallocate()
637     if (!valid || layers == NULL || info == NULL ||  in need_to_reallocate()
665           layers[i][j].active = 0;  in allocate_hier()
675     layers = (kmp_hier_top_unit_t<T> **)__kmp_allocate(  in allocate_hier()
692       layers[i] = (kmp_hier_top_unit_t<T> *)__kmp_allocate(  in allocate_hier()
695         layers[i][j].active = 0;  in allocate_hier()
696         layers[i][j].hier_pr.flags.use_hier = TRUE;  in allocate_hier()
891     return &(layers[level][index]);  in get_unit()
893   // Returns the number of layers in the hierarchy
912         layers[i][j].print();  in print()