Home
last modified time | relevance | path

Searched refs:row (Results 1 - 25 of 283) sorted by relevance

12345678910>>...12

/kernel/linux/linux-5.10/tools/perf/scripts/python/
H A Devent_analyzing_sample.py137 for row in commq:
138 print("%16s %8d %s" % (row[0], row[1], num2sym(row[1])))
143 for row in symbolq:
144 print("%32s %8d %s" % (row[0], row[1], num2sym(row[1])))
149 for row in dsoq:
150 print("%40s %8d %s" % (row[
[all...]
/kernel/linux/linux-6.6/tools/perf/scripts/python/
H A Devent_analyzing_sample.py137 for row in commq:
138 print("%16s %8d %s" % (row[0], row[1], num2sym(row[1])))
143 for row in symbolq:
144 print("%32s %8d %s" % (row[0], row[1], num2sym(row[1])))
149 for row in dsoq:
150 print("%40s %8d %s" % (row[
[all...]
/kernel/linux/linux-6.6/tools/perf/ui/
H A Dbrowser.c171 int row = 0; in ui_browser__rb_tree_refresh() local
179 ui_browser__gotorc(browser, row, 0); in ui_browser__rb_tree_refresh()
180 browser->write(browser, nd, row); in ui_browser__rb_tree_refresh()
181 if (++row == browser->rows) in ui_browser__rb_tree_refresh()
186 return row; in ui_browser__rb_tree_refresh()
189 bool ui_browser__is_current_entry(struct ui_browser *browser, unsigned row) in ui_browser__is_current_entry() argument
191 return browser->top_idx + row == browser->index; in ui_browser__is_current_entry()
314 row = 0; in ui_browser__scrollbar_set() local
324 ui_browser__gotorc(browser, row++, col); in ui_browser__scrollbar_set()
334 int row; in __ui_browser__refresh() local
502 int row = 0; ui_browser__list_head_refresh() local
629 unsigned int row = 0, idx = browser->top_idx; ui_browser__argv_refresh() local
674 unsigned int row, end_row; __ui_browser__line_arrow_up() local
714 unsigned int row, end_row; __ui_browser__line_arrow_down() local
759 ui_browser__mark_fused(struct ui_browser *browser, unsigned int column, unsigned int row, int diff, bool arrow_down) ui_browser__mark_fused() argument
[all...]
/kernel/linux/linux-5.10/Documentation/sphinx/
H A DrstFlatTable.py20 * *row-span*: with the role ``rspan`` a cell can be extended through
23 * *auto span* rightmost cell of a table row over the missing cells on the
24 right side of that table-row. With Option ``:fill-cells:`` this behavior
188 for row in self.rows[:header_rows]:
189 thead += self.buildTableRowNode(row)
194 for row in self.rows[header_rows:]:
195 tbody += self.buildTableRowNode(row)
200 row = nodes.row()
213 row
[all...]
/kernel/linux/linux-6.6/Documentation/sphinx/
H A DrstFlatTable.py20 * *row-span*: with the role ``rspan`` a cell can be extended through
23 * *auto span* rightmost cell of a table row over the missing cells on the
24 right side of that table-row. With Option ``:fill-cells:`` this behavior
178 for row in self.rows[:header_rows]:
179 thead += self.buildTableRowNode(row)
184 for row in self.rows[header_rows:]:
185 tbody += self.buildTableRowNode(row)
190 row = nodes.row()
203 row
[all...]
/kernel/linux/linux-5.10/tools/perf/ui/
H A Dbrowser.c171 int row = 0; in ui_browser__rb_tree_refresh() local
179 ui_browser__gotorc(browser, row, 0); in ui_browser__rb_tree_refresh()
180 browser->write(browser, nd, row); in ui_browser__rb_tree_refresh()
181 if (++row == browser->rows) in ui_browser__rb_tree_refresh()
186 return row; in ui_browser__rb_tree_refresh()
189 bool ui_browser__is_current_entry(struct ui_browser *browser, unsigned row) in ui_browser__is_current_entry() argument
191 return browser->top_idx + row == browser->index; in ui_browser__is_current_entry()
314 row = 0; in ui_browser__scrollbar_set() local
324 ui_browser__gotorc(browser, row++, col); in ui_browser__scrollbar_set()
334 int row; in __ui_browser__refresh() local
502 int row = 0; ui_browser__list_head_refresh() local
629 unsigned int row = 0, idx = browser->top_idx; ui_browser__argv_refresh() local
674 unsigned int row, end_row; __ui_browser__line_arrow_up() local
714 unsigned int row, end_row; __ui_browser__line_arrow_down() local
759 ui_browser__mark_fused(struct ui_browser *browser, unsigned int column, unsigned int row, bool arrow_down) ui_browser__mark_fused() argument
[all...]
/kernel/linux/linux-6.6/tools/testing/selftests/bpf/progs/
H A Diters.c399 int sum, row, col; in iter_nested_iters() local
403 bpf_for(row, 0, ARRAY_SIZE(arr2d)) { in iter_nested_iters()
405 arr2d[row][col] = row * col; in iter_nested_iters()
411 bpf_for(row, 0, ARRAY_SIZE(arr2d)) { in iter_nested_iters()
412 arr2d_row_sums[row] = 0; in iter_nested_iters()
419 bpf_for(row, 0, ARRAY_SIZE(arr2d)) { in iter_nested_iters()
421 sum += arr2d[row][col]; in iter_nested_iters()
422 arr2d_row_sums[row] += arr2d[row][co in iter_nested_iters()
465 fill_inner_dimension(int row) fill_inner_dimension() argument
474 sum_inner_dimension(int row) sum_inner_dimension() argument
491 int sum, row, col; iter_subprog_iters() local
[all...]
/kernel/linux/linux-5.10/scripts/kconfig/
H A Dgconf.c74 static void set_node(GtkTreeIter * node, struct menu *menu, gchar ** row);
1036 /* Fill a row of strings */
1039 static gchar *row[COL_NUMBER]; in fill_row() local
1048 g_free(row[i]); in fill_row()
1049 bzero(row, sizeof(row)); in fill_row()
1051 row[COL_OPTION] = in fill_row()
1056 row[COL_COLOR] = g_strdup("DarkGray"); in fill_row()
1059 row[COL_COLOR] = g_strdup("DarkGray"); in fill_row()
1061 row[COL_COLO in fill_row()
1162 set_node(GtkTreeIter * node, struct menu *menu, gchar ** row) set_node() argument
1198 place_node(struct menu *menu, char **row) place_node() argument
[all...]
/kernel/linux/linux-6.6/scripts/kconfig/
H A Dgconf.c70 static void set_node(GtkTreeIter * node, struct menu *menu, gchar ** row);
1029 /* Fill a row of strings */
1032 static gchar *row[COL_NUMBER]; in fill_row() local
1041 g_free(row[i]); in fill_row()
1042 bzero(row, sizeof(row)); in fill_row()
1046 row[COL_OPTION] = in fill_row()
1054 row[COL_COLOR] = g_strdup("DarkGray"); in fill_row()
1057 row[COL_COLOR] = g_strdup("DarkGray"); in fill_row()
1059 row[COL_COLO in fill_row()
1159 set_node(GtkTreeIter * node, struct menu *menu, gchar ** row) set_node() argument
1195 place_node(struct menu *menu, char **row) place_node() argument
[all...]
/kernel/linux/linux-5.10/drivers/input/keyboard/
H A Dtwl4030_keypad.c42 * row lines connected to the gnd (see twl4030_col_xlate()).
74 #define KEYP_FULL_CODE_7_0 0x09 /* row 0 column status */
75 #define KEYP_FULL_CODE_15_8 0x0a /* ... row 1 ... */
153 * If all bits in a row are active for all columns then in twl4030_col_xlate()
154 * we have that row line connected to gnd. Mark this in twl4030_col_xlate()
167 int row; in twl4030_read_kp_matrix_state() local
171 for (row = 0; row < kp->n_rows; row++) in twl4030_read_kp_matrix_state()
172 state[row] in twl4030_read_kp_matrix_state()
198 int col, row; twl4030_kp_scan() local
[all...]
H A Dpmic8xxx-keypad.c80 * @num_rows - number of row of keypad
110 /* all keys pressed on that particular row? */ in pmic8xxx_col_state()
157 int rc, row; in pmic8xxx_kp_read_data() local
160 for (row = 0; row < read_rows; row++) { in pmic8xxx_kp_read_data()
164 dev_dbg(kp->dev, "%d = %d\n", row, val); in pmic8xxx_kp_read_data()
165 state[row] = pmic8xxx_col_state(kp, val); in pmic8xxx_kp_read_data()
222 int row, col, code; in __pmic8xxx_kp_scan_matrix() local
224 for (row in __pmic8xxx_kp_scan_matrix()
252 int row, found_first = -1; pmic8xxx_detect_ghost_keys() local
[all...]
/kernel/linux/linux-6.6/drivers/input/keyboard/
H A Dtwl4030_keypad.c42 * row lines connected to the gnd (see twl4030_col_xlate()).
74 #define KEYP_FULL_CODE_7_0 0x09 /* row 0 column status */
75 #define KEYP_FULL_CODE_15_8 0x0a /* ... row 1 ... */
153 * If all bits in a row are active for all columns then in twl4030_col_xlate()
154 * we have that row line connected to gnd. Mark this in twl4030_col_xlate()
167 int row; in twl4030_read_kp_matrix_state() local
171 for (row = 0; row < kp->n_rows; row++) in twl4030_read_kp_matrix_state()
172 state[row] in twl4030_read_kp_matrix_state()
198 int col, row; twl4030_kp_scan() local
[all...]
H A Dpmic8xxx-keypad.c80 * @num_rows: number of row of keypad
110 /* all keys pressed on that particular row? */ in pmic8xxx_col_state()
157 int rc, row; in pmic8xxx_kp_read_data() local
160 for (row = 0; row < read_rows; row++) { in pmic8xxx_kp_read_data()
164 dev_dbg(kp->dev, "%d = %d\n", row, val); in pmic8xxx_kp_read_data()
165 state[row] = pmic8xxx_col_state(kp, val); in pmic8xxx_kp_read_data()
222 int row, col, code; in __pmic8xxx_kp_scan_matrix() local
224 for (row in __pmic8xxx_kp_scan_matrix()
252 int row, found_first = -1; pmic8xxx_detect_ghost_keys() local
[all...]
H A Dmatrix_keypad.c80 int row) in row_asserted()
82 return gpio_get_value_cansleep(pdata->row_gpios[row]) ? in row_asserted()
123 int row, col, code; in matrix_keypad_scan() local
130 for (row = 0; row < pdata->num_row_gpios; row++) in matrix_keypad_scan()
131 gpio_direction_input(pdata->row_gpios[row]); in matrix_keypad_scan()
133 /* assert each column and read the row status out */ in matrix_keypad_scan()
138 for (row = 0; row < pdat in matrix_keypad_scan()
79 row_asserted(const struct matrix_keypad_platform_data *pdata, int row) row_asserted() argument
[all...]
/kernel/linux/linux-6.6/net/netfilter/ipvs/
H A Dip_vs_est.c146 static void ip_vs_tick_estimation(struct ip_vs_est_kt_data *kd, int row) in ip_vs_tick_estimation() argument
152 td = rcu_dereference(kd->ticks[row]); in ip_vs_tick_estimation()
160 td = rcu_dereference(kd->ticks[row]); in ip_vs_tick_estimation()
173 int row = kd->est_row; in ip_vs_estimation_kthread() local
215 if (kd->tick_len[row]) in ip_vs_estimation_kthread()
216 ip_vs_tick_estimation(kd, row); in ip_vs_estimation_kthread()
218 row++; in ip_vs_estimation_kthread()
219 if (row >= IPVS_EST_NTICKS) in ip_vs_estimation_kthread()
220 row = 0; in ip_vs_estimation_kthread()
221 WRITE_ONCE(kd->est_row, row); in ip_vs_estimation_kthread()
394 int ktid, row, crow, cid, ret; ip_vs_enqueue_estimator() local
526 int row = est->ktrow; ip_vs_stop_estimator() local
742 int id, row, cid, delay; ip_vs_est_calc_phase() local
[all...]
/kernel/linux/linux-6.6/arch/mips/loongson64/
H A Dnuma.c53 static int __init compute_node_distance(int row, int col) in compute_node_distance() argument
55 int package_row = row * loongson_sysconf.cores_per_node / in compute_node_distance()
60 if (col == row) in compute_node_distance()
70 int row, col; in init_topology_matrix() local
72 for (row = 0; row < MAX_NUMNODES; row++) in init_topology_matrix()
74 __node_distances[row][col] = -1; in init_topology_matrix()
76 for_each_online_node(row) { in init_topology_matrix()
78 __node_distances[row][co in init_topology_matrix()
[all...]
/kernel/linux/linux-5.10/drivers/edac/
H A Dedac_mc.c101 edac_dbg(4, "%s%i: %smapped as virtual row %d, chan %d\n", in edac_mc_dump_dimm()
232 int i, chn, row; in mci_release() local
241 for (row = 0; row < mci->nr_csrows; row++) { in mci_release()
242 csr = mci->csrows[row]; in mci_release()
262 unsigned int row, chn; in edac_mc_alloc_csrows() local
271 for (row = 0; row < tot_csrows; row in edac_mc_alloc_csrows()
306 unsigned int row, chn, idx; edac_mc_alloc_dimms() local
825 int row, i, j, n; edac_mc_find_csrow_by_page() local
966 edac_inc_csrow(struct edac_raw_error_desc *e, int row, int chan) edac_inc_csrow() argument
1026 int row = -1, chan = -1; edac_mc_handle_error() local
[all...]
H A Dppc4xx_edac.c209 * TODO: The row and channel parameters likely need to be dynamically
317 unsigned int row, rows; in ppc4xx_edac_generate_bank_message() local
328 for (rows = 0, row = 0; row < mci->nr_csrows; row++) { in ppc4xx_edac_generate_bank_message()
329 if (ppc4xx_edac_check_bank_error(status, row)) { in ppc4xx_edac_generate_bank_message()
331 (rows++ ? ", " : ""), row); in ppc4xx_edac_generate_bank_message()
718 int row; in ppc4xx_edac_handle_ce() local
723 for (row = 0; row < mc in ppc4xx_edac_handle_ce()
749 int row; ppc4xx_edac_handle_ue() local
896 int row, j; ppc4xx_edac_init_csrows() local
[all...]
H A Di82975x_edac.c138 * 6:4 row attr of odd rank, i.e. 1
140 * 2:0 row attr of even rank, i.e. 0
280 int row, chan; in i82975x_process_error_info() local
300 row = edac_mc_find_csrow_by_page(mci, page); in i82975x_process_error_info()
302 if (row == -1) { in i82975x_process_error_info()
310 chan = (mci->csrows[row]->nr_channels == 1) ? 0 : info->eap & 1; in i82975x_process_error_info()
313 (1 << mci->csrows[row]->channels[chan]->dimm->grain)); in i82975x_process_error_info()
318 row, -1, -1, in i82975x_process_error_info()
323 row, chan ? chan : 0, -1, in i82975x_process_error_info()
350 int row; in dual_channel_active() local
[all...]
/kernel/linux/linux-6.6/drivers/edac/
H A Dedac_mc.c99 edac_dbg(4, "%s%i: %smapped as virtual row %d, chan %d\n", in edac_mc_dump_dimm()
181 int i, chn, row; in mci_release() local
190 for (row = 0; row < mci->nr_csrows; row++) { in mci_release()
191 csr = mci->csrows[row]; in mci_release()
213 unsigned int row, chn; in edac_mc_alloc_csrows() local
222 for (row = 0; row < tot_csrows; row in edac_mc_alloc_csrows()
257 unsigned int row, chn, idx; edac_mc_alloc_dimms() local
756 int row, i, j, n; edac_mc_find_csrow_by_page() local
897 edac_inc_csrow(struct edac_raw_error_desc *e, int row, int chan) edac_inc_csrow() argument
957 int row = -1, chan = -1; edac_mc_handle_error() local
[all...]
H A Dppc4xx_edac.c196 * TODO: The row and channel parameters likely need to be dynamically
304 unsigned int row, rows; in ppc4xx_edac_generate_bank_message() local
315 for (rows = 0, row = 0; row < mci->nr_csrows; row++) { in ppc4xx_edac_generate_bank_message()
316 if (ppc4xx_edac_check_bank_error(status, row)) { in ppc4xx_edac_generate_bank_message()
318 (rows++ ? ", " : ""), row); in ppc4xx_edac_generate_bank_message()
705 int row; in ppc4xx_edac_handle_ce() local
710 for (row = 0; row < mc in ppc4xx_edac_handle_ce()
736 int row; ppc4xx_edac_handle_ue() local
883 int row, j; ppc4xx_edac_init_csrows() local
[all...]
H A Di82975x_edac.c138 * 6:4 row attr of odd rank, i.e. 1
140 * 2:0 row attr of even rank, i.e. 0
280 int row, chan; in i82975x_process_error_info() local
300 row = edac_mc_find_csrow_by_page(mci, page); in i82975x_process_error_info()
302 if (row == -1) { in i82975x_process_error_info()
310 chan = (mci->csrows[row]->nr_channels == 1) ? 0 : info->eap & 1; in i82975x_process_error_info()
313 (1 << mci->csrows[row]->channels[chan]->dimm->grain)); in i82975x_process_error_info()
318 row, -1, -1, in i82975x_process_error_info()
323 row, chan ? chan : 0, -1, in i82975x_process_error_info()
349 int row; in dual_channel_active() local
[all...]
/kernel/liteos_m/tools/
H A Dmem_analysis.py63 c = ws.cell(row=base_address + 1, column=1)
65 c = ws.cell(row=base_address + 1, column=2)
67 c = ws.cell(row=base_address + 1, column=3)
69 c = ws.cell(row=base_address + 1, column=4)
71 c = ws.cell(row=base_address + 1, column=5)
73 c = ws.cell(row=base_address + 1, column=6)
75 c = ws.cell(row=base_address + 1, column=7)
119 row = 1
123 c = ws.cell(row, 1)
125 c = ws.cell(row,
[all...]
/kernel/linux/linux-5.10/arch/mips/loongson64/
H A Dnuma.c70 static int __init compute_node_distance(int row, int col) in compute_node_distance() argument
72 int package_row = row * loongson_sysconf.cores_per_node / in compute_node_distance()
77 if (col == row) in compute_node_distance()
87 int row, col; in init_topology_matrix() local
89 for (row = 0; row < MAX_NUMNODES; row++) in init_topology_matrix()
91 __node_distances[row][col] = -1; in init_topology_matrix()
93 for_each_online_node(row) { in init_topology_matrix()
95 __node_distances[row][co in init_topology_matrix()
[all...]
/kernel/linux/linux-5.10/arch/mips/sgi-ip27/
H A Dip27-memory.c161 nasid_t row, col; in init_topology_matrix() local
163 for (row = 0; row < MAX_NUMNODES; row++) in init_topology_matrix()
165 __node_distances[row][col] = -1; in init_topology_matrix()
167 for_each_online_node(row) { in init_topology_matrix()
169 __node_distances[row][col] = in init_topology_matrix()
170 compute_node_distance(row, col); in init_topology_matrix()
182 nasid_t row, col; in dump_topology() local
190 for_each_online_node(row) { in dump_topology()
[all...]

Completed in 17 milliseconds

12345678910>>...12