Searched refs:orders (Results 1 – 7 of 7) sorted by relevance
250 pt = &pool->caching[caching].orders[order]; in ttm_pool_alloc_order_caching_match()279 pt_pool = &pool->caching[pool_caching].orders[order]; in ttm_pool_alloc_caching_mismatch()280 pt_tt = &pool->caching[tt_caching].orders[order]; in ttm_pool_alloc_caching_mismatch()313 pt_pool = &pool->caching[caching].orders[order]; in ttm_pool_alloc_order_mismatch()314 pt_tt = &pool->caching[caching].orders[0]; in ttm_pool_alloc_order_mismatch()354 pt = &pool->caching[caching].orders[order]; in ttm_pool_free_dma_alloc()385 pt = &pool->caching[caching].orders[order]; in ttm_pool_free_no_dma_alloc()405 pt = &pool->caching[caching].orders[order]; in ttm_pool_fini_basic()
179 pt = pool->caching[i].orders[j]; in ttm_device_init_pools()
52 static const unsigned int orders[] = {8, 4, 0}; variable53 #define NUM_ORDERS ARRAY_SIZE(orders)310 if (size < (PAGE_SIZE << orders[i])) in alloc_largest_available()312 if (max_order < orders[i]) in alloc_largest_available()315 page = alloc_pages(order_flags[i], orders[i]); in alloc_largest_available()331 unsigned int max_order = orders[0]; in system_heap_allocate()
343 return &pool->caching[caching].orders[order]; in ttm_pool_select_type()349 return &pool->caching[caching].orders[order]; in ttm_pool_select_type()357 return &pool->caching[caching].orders[order]; in ttm_pool_select_type()1084 if (pt != &pool->caching[i].orders[j]) in ttm_pool_init()1122 if (pt != &pool->caching[i].orders[j]) in ttm_pool_fini()1268 ttm_pool_debugfs_orders(pool->caching[i].orders, m); in ttm_pool_debugfs()
271 static const char * const orders[] = { in v4l2_fwnode_endpoint_parse_csi2_bus() local275 if (array[i] >= ARRAY_SIZE(orders)) { in v4l2_fwnode_endpoint_parse_csi2_bus()285 orders[array[i]]); in v4l2_fwnode_endpoint_parse_csi2_bus()
26 Note however that some operations are three orders of magnitude
260 #define QM_MK_SQC_W13(priority, orders, alg_type) \ argument262 ((orders) << QM_SQ_ORDERS_SHIFT) | \
Completed in 24 milliseconds