Lines Matching defs:table
76 struct soc_states_st *table,
85 if (table->num_states == 0) {
89 while (net_bw_of_new_state > calculate_net_bw_in_mbytes_sec(socbb, &table->state_array[index])) {
91 if (index >= (int) table->num_states)
95 for (i = table->num_states; i > index; i--) {
96 table->state_array[i] = table->state_array[i - 1];
101 table->state_array[index] = *entry;
102 table->state_array[index].dcfclk_mhz = (int)entry->dcfclk_mhz;
103 table->state_array[index].fabricclk_mhz = (int)entry->fabricclk_mhz;
104 table->state_array[index].dram_speed_mts = (int)entry->dram_speed_mts;
105 table->num_states++;
108 static void remove_entry_from_table_at_index(struct soc_states_st *table,
113 if (table->num_states == 0)
116 for (i = index; i < (int) table->num_states - 1; i++) {
117 table->state_array[i] = table->state_array[i + 1];
119 memset(&table->state_array[--table->num_states], 0, sizeof(struct soc_state_bounding_box_st));
228 // At this point, the table contains all "points of interest" based on
264 // Remove duplicate states, note duplicate states are always neighbouring since table is sorted.