Home
last modified time | relevance | path

Searched refs:path_length (Results 1 - 18 of 18) sorted by relevance

/kernel/linux/linux-5.10/drivers/thunderbolt/
H A Dpath.c157 path->path_length = num_hops; in tb_path_discover()
330 path->path_length = num_hops; in tb_path_alloc()
350 for (i = 0; i < path->path_length; i++) { in tb_path_free()
368 for (i = first_hop; i < path->path_length; i++) { in __tb_path_deallocate_nfc()
432 for (i = first_hop; i < path->path_length; i++) { in __tb_path_deactivate_hops()
453 tb_route(path->hops[path->path_length - 1].out_port->sw), in tb_path_deactivate()
454 path->hops[path->path_length - 1].out_port->port); in tb_path_deactivate()
481 tb_route(path->hops[path->path_length - 1].out_port->sw), in tb_path_activate()
482 path->hops[path->path_length - 1].out_port->port); in tb_path_activate()
485 for (i = path->path_length in tb_path_activate()
[all...]
H A Dtest.c782 KUNIT_ASSERT_EQ(test, path->path_length, (int)ARRAY_SIZE(test_data)); in tb_test_path_not_bonded_lane0()
844 KUNIT_ASSERT_EQ(test, path->path_length, (int)ARRAY_SIZE(test_data)); in tb_test_path_not_bonded_lane1()
924 KUNIT_ASSERT_EQ(test, path->path_length, (int)ARRAY_SIZE(test_data)); in tb_test_path_not_bonded_lane1_chain()
1004 KUNIT_ASSERT_EQ(test, path->path_length, (int)ARRAY_SIZE(test_data)); in tb_test_path_not_bonded_lane1_chain_reverse()
1096 KUNIT_ASSERT_EQ(test, path->path_length, (int)ARRAY_SIZE(test_data)); in tb_test_path_mixed_chain()
1188 KUNIT_ASSERT_EQ(test, path->path_length, (int)ARRAY_SIZE(test_data)); in tb_test_path_mixed_chain_reverse()
1236 KUNIT_ASSERT_EQ(test, tunnel1->paths[0]->path_length, 2); in tb_test_tunnel_pcie()
1239 KUNIT_ASSERT_EQ(test, tunnel1->paths[1]->path_length, 2); in tb_test_tunnel_pcie()
1251 KUNIT_ASSERT_EQ(test, tunnel2->paths[0]->path_length, 2); in tb_test_tunnel_pcie()
1254 KUNIT_ASSERT_EQ(test, tunnel2->paths[1]->path_length, in tb_test_tunnel_pcie()
[all...]
H A Dtunnel.c127 if (path->path_length > 1) in tb_pci_init_path()
516 last = paths[TB_DP_VIDEO_PATH_OUT]->path_length - 1; in tb_dp_activate()
616 for (i = 0; i < path->path_length; i++) in tb_dp_init_aux_path()
822 for (i = 0; i < path->path_length; i++) in tb_dma_init_path()
1019 if (path->path_length > 1) in tb_usb3_init_path()
H A Dtb.h306 * @path_length: How many hops the path uses
327 int path_length; member
/kernel/linux/linux-6.6/drivers/thunderbolt/
H A Dpath.c159 path->path_length = num_hops; in tb_path_discover()
342 path->path_length = num_hops; in tb_path_alloc()
363 for (i = 0; i < path->path_length; i++) { in tb_path_free()
382 for (i = first_hop; i < path->path_length; i++) { in __tb_path_deallocate_nfc()
453 for (i = first_hop; i < path->path_length; i++) { in __tb_path_deactivate_hops()
474 tb_route(path->hops[path->path_length - 1].out_port->sw), in tb_path_deactivate()
475 path->hops[path->path_length - 1].out_port->port); in tb_path_deactivate()
503 tb_route(path->hops[path->path_length - 1].out_port->sw), in tb_path_activate()
504 path->hops[path->path_length - 1].out_port->port); in tb_path_activate()
507 for (i = path->path_length in tb_path_activate()
[all...]
H A Dtest.c909 KUNIT_ASSERT_EQ(test, path->path_length, ARRAY_SIZE(test_data)); in tb_test_path_not_bonded_lane0()
971 KUNIT_ASSERT_EQ(test, path->path_length, ARRAY_SIZE(test_data)); in tb_test_path_not_bonded_lane1()
1051 KUNIT_ASSERT_EQ(test, path->path_length, ARRAY_SIZE(test_data)); in tb_test_path_not_bonded_lane1_chain()
1131 KUNIT_ASSERT_EQ(test, path->path_length, ARRAY_SIZE(test_data)); in tb_test_path_not_bonded_lane1_chain_reverse()
1223 KUNIT_ASSERT_EQ(test, path->path_length, ARRAY_SIZE(test_data)); in tb_test_path_mixed_chain()
1315 KUNIT_ASSERT_EQ(test, path->path_length, ARRAY_SIZE(test_data)); in tb_test_path_mixed_chain_reverse()
1363 KUNIT_ASSERT_EQ(test, tunnel1->paths[0]->path_length, 2); in tb_test_tunnel_pcie()
1366 KUNIT_ASSERT_EQ(test, tunnel1->paths[1]->path_length, 2); in tb_test_tunnel_pcie()
1378 KUNIT_ASSERT_EQ(test, tunnel2->paths[0]->path_length, 2); in tb_test_tunnel_pcie()
1381 KUNIT_ASSERT_EQ(test, tunnel2->paths[1]->path_length, in tb_test_tunnel_pcie()
[all...]
H A Dtunnel.c821 last = paths[TB_DP_VIDEO_PATH_OUT]->path_length - 1; in tb_dp_activate()
1514 for (i = 1; i < path->path_length; i++) { in tb_dma_init_rx_path()
1688 else if (tb_port_is_nhi(path->hops[path->path_length - 1].out_port)) in tb_tunnel_match_dma()
1699 (tx_path->hops[tx_path->path_length - 1].next_hop_index != transmit_path)) in tb_tunnel_match_dma()
1710 (rx_path->hops[rx_path->path_length - 1].next_hop_index != receive_ring)) in tb_tunnel_match_dma()
H A Dtb.h404 * @path_length: How many hops the path uses
425 int path_length; member
1112 (hop) <= &(path)->hops[(path)->path_length - 1]; (hop)++)
/kernel/linux/linux-5.10/fs/reiserfs/
H A Dstree.c218 int position, path_offset = chk_path->path_length; in get_lkey()
265 int position, path_offset = chk_path->path_length; in get_rkey()
330 RFALSE(!key || chk_path->path_length < FIRST_PATH_ELEMENT_OFFSET in key_in_buffer()
331 || chk_path->path_length > MAX_HEIGHT, in key_in_buffer()
333 key, chk_path->path_length); in key_in_buffer()
349 RFALSE(p->path_length != ILLEGAL_PATH_ELEMENT_OFFSET, in reiserfs_check_path()
362 int path_offset = search_path->path_length; in pathrelse_and_restore()
373 search_path->path_length = ILLEGAL_PATH_ELEMENT_OFFSET; in pathrelse_and_restore()
379 int path_offset = search_path->path_length; in pathrelse()
387 search_path->path_length in pathrelse()
[all...]
H A Dreiserfs.h2134 int path_length; /* Length of the array above. */ member
2144 struct treepath var = {.path_length = ILLEGAL_PATH_ELEMENT_OFFSET, .reada = 0,}
2155 #define PATH_PLAST_BUFFER(path) (PATH_OFFSET_PBUFFER((path), (path)->path_length))
2162 #define PATH_LAST_POSITION(path) (PATH_OFFSET_POSITION((path), (path)->path_length))
2171 PATH_OFFSET_PBUFFER(path, path->path_length - (h))
2177 PATH_OFFSET_POSITION(path, path->path_length - (h))
2182 #define PATH_H_PATH_OFFSET(path, n_h) ((path)->path_length - (n_h))
H A Dfix_node.c1154 RFALSE(s_path_to_neighbor_father.path_length < in get_far_parent()
1157 s_path_to_neighbor_father.path_length--; in get_far_parent()
2375 for (i = tb->tb_path->path_length; in wait_tb_buffers_until_unlocked()
2391 path_length - i); in wait_tb_buffers_until_unlocked()
H A Dprints.c660 tb->tb_path->path_length in store_print_tb()
/kernel/linux/linux-6.6/fs/reiserfs/
H A Dstree.c218 int position, path_offset = chk_path->path_length; in get_lkey()
265 int position, path_offset = chk_path->path_length; in get_rkey()
330 RFALSE(!key || chk_path->path_length < FIRST_PATH_ELEMENT_OFFSET in key_in_buffer()
331 || chk_path->path_length > MAX_HEIGHT, in key_in_buffer()
333 key, chk_path->path_length); in key_in_buffer()
349 RFALSE(p->path_length != ILLEGAL_PATH_ELEMENT_OFFSET, in reiserfs_check_path()
362 int path_offset = search_path->path_length; in pathrelse_and_restore()
373 search_path->path_length = ILLEGAL_PATH_ELEMENT_OFFSET; in pathrelse_and_restore()
379 int path_offset = search_path->path_length; in pathrelse()
387 search_path->path_length in pathrelse()
[all...]
H A Dreiserfs.h2131 int path_length; /* Length of the array above. */ member
2141 struct treepath var = {.path_length = ILLEGAL_PATH_ELEMENT_OFFSET, .reada = 0,}
2152 #define PATH_PLAST_BUFFER(path) (PATH_OFFSET_PBUFFER((path), (path)->path_length))
2159 #define PATH_LAST_POSITION(path) (PATH_OFFSET_POSITION((path), (path)->path_length))
2168 PATH_OFFSET_PBUFFER(path, path->path_length - (h))
2174 PATH_OFFSET_POSITION(path, path->path_length - (h))
2179 #define PATH_H_PATH_OFFSET(path, n_h) ((path)->path_length - (n_h))
H A Dfix_node.c1154 RFALSE(s_path_to_neighbor_father.path_length < in get_far_parent()
1157 s_path_to_neighbor_father.path_length--; in get_far_parent()
2376 for (i = tb->tb_path->path_length; in wait_tb_buffers_until_unlocked()
2392 path_length - i); in wait_tb_buffers_until_unlocked()
H A Dprints.c660 tb->tb_path->path_length in store_print_tb()
/kernel/linux/linux-5.10/include/acpi/
H A Dactbl2.h1851 u16 path_length; member
/kernel/linux/linux-6.6/include/acpi/
H A Dactbl2.h2961 u16 path_length; member

Completed in 47 milliseconds