dev/drm2/drm_bufs.c

679  * reallocates the buffer list of the same size order to accommodate the new
691 	int order;
704 	order = drm_order(request->size);
705 	size = 1 << order;
709 	page_order = order - PAGE_SHIFT > 0 ? order - PAGE_SHIFT : 0;
716 	DRM_DEBUG("order:      %d\n", order);
723 	if (order < DRM_MIN_ORDER || order > DRM_MAX_ORDER)
748 	entry = &dma->bufs[order];
752 		return -ENOMEM;	/* May only call once for each order */
778 		buf->order = order;
851 	int order;
876 	order = drm_order(request->size);
877 	size = 1 << order;
879 	DRM_DEBUG("count=%d, size=%d (%d), order=%d\n",
880 		  request->count, request->size, size, order);
882 	if (order < DRM_MIN_ORDER || order > DRM_MAX_ORDER)
887 	page_order = order - PAGE_SHIFT > 0 ? order - PAGE_SHIFT : 0;
899 	entry = &dma->bufs[order];
903 		return -ENOMEM;	/* May only call once for each order */
979 			buf->order = order;
1061 	int order;
1080 	order = drm_order(request->size);
1081 	size = 1 << order;
1085 	page_order = order - PAGE_SHIFT > 0 ? order - PAGE_SHIFT : 0;
1092 	DRM_DEBUG("order:      %d\n", order);
1099 	if (order < DRM_MIN_ORDER || order > DRM_MAX_ORDER)
1111 	entry = &dma->bufs[order];
1115 		return -ENOMEM;	/* May only call once for each order */
1141 		buf->order = order;
1217 	int order;
1236 	order = drm_order(request->size);
1237 	size = 1 << order;
1241 	page_order = order - PAGE_SHIFT > 0 ? order - PAGE_SHIFT : 0;
1248 	DRM_DEBUG("order:      %d\n", order);
1255 	if (order < DRM_MIN_ORDER || order > DRM_MAX_ORDER)
1267 	entry = &dma->bufs[order];
1271 		return -ENOMEM;	/* May only call once for each order */
1297 		buf->order = order;
1494  * Verifies that the size order is bounded between the admissible orders and
1504 	int order;
1515 	order = drm_order(request->size);
1516 	if (order < DRM_MIN_ORDER || order > DRM_MAX_ORDER)
1518 	entry = &dma->bufs[order];
1683  * Compute size order.  Returns the exponent of the smaller power of two which
1687  * \return order.
1693 	int order;
1696 	for (order = 0, tmp = size >> 1; tmp; tmp >>= 1, order++) ;
1699 		++order;
1701 	return order;