|
| 1 | +# -*- coding: utf-8 -*- |
| 2 | +# ***************************************************************************** |
| 3 | +# Copyright (c) 2016-2024, Intel Corporation |
| 4 | +# All rights reserved. |
| 5 | +# |
| 6 | +# Redistribution and use in source and binary forms, with or without |
| 7 | +# modification, are permitted provided that the following conditions are met: |
| 8 | +# - Redistributions of source code must retain the above copyright notice, |
| 9 | +# this list of conditions and the following disclaimer. |
| 10 | +# - Redistributions in binary form must reproduce the above copyright notice, |
| 11 | +# this list of conditions and the following disclaimer in the documentation |
| 12 | +# and/or other materials provided with the distribution. |
| 13 | +# |
| 14 | +# THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" |
| 15 | +# AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE |
| 16 | +# IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE |
| 17 | +# ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE |
| 18 | +# LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR |
| 19 | +# CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF |
| 20 | +# SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS |
| 21 | +# INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN |
| 22 | +# CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) |
| 23 | +# ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF |
| 24 | +# THE POSSIBILITY OF SUCH DAMAGE. |
| 25 | +# ***************************************************************************** |
| 26 | + |
| 27 | +from numbers import Number |
| 28 | + |
| 29 | +import dpctl.tensor as dpt |
| 30 | +import dpctl.utils as dpu |
| 31 | +from dpctl.tensor._ctors import _cast_fill_val |
| 32 | +from dpctl.tensor._tensor_impl import ( |
| 33 | + _copy_usm_ndarray_into_usm_ndarray, |
| 34 | + _full_usm_ndarray, |
| 35 | + _zeros_usm_ndarray, |
| 36 | +) |
| 37 | + |
| 38 | +import dpnp |
| 39 | + |
| 40 | + |
| 41 | +def dpnp_fill(arr, val): |
| 42 | + arr = dpnp.get_usm_ndarray(arr) |
| 43 | + exec_q = arr.sycl_queue |
| 44 | + |
| 45 | + # if val is an array, process it |
| 46 | + if dpnp.is_supported_array_type(val): |
| 47 | + val = dpnp.get_usm_ndarray(val) |
| 48 | + if val.shape != (): |
| 49 | + raise ValueError("`val` must be a scalar or 0D-array") |
| 50 | + if dpu.get_execution_queue((exec_q, val.sycl_queue)) is None: |
| 51 | + raise dpu.ExecutionPlacementError( |
| 52 | + "Input arrays have incompatible queues." |
| 53 | + ) |
| 54 | + a_val = dpt.astype(val, arr.dtype) |
| 55 | + a_val = dpt.broadcast_to(a_val, arr.shape) |
| 56 | + _manager = dpu.SequentialOrderManager[exec_q] |
| 57 | + dep_evs = _manager.submitted_events |
| 58 | + h_ev, c_ev = _copy_usm_ndarray_into_usm_ndarray( |
| 59 | + src=a_val, dst=arr, sycl_queue=exec_q, depends=dep_evs |
| 60 | + ) |
| 61 | + _manager.add_event_pair(h_ev, c_ev) |
| 62 | + return |
| 63 | + elif not isinstance(val, (Number, dpnp.bool)): |
| 64 | + raise TypeError( |
| 65 | + f"array cannot be filled with `val` of type {type(val)}" |
| 66 | + ) |
| 67 | + val = _cast_fill_val(val, arr.dtype) |
| 68 | + |
| 69 | + _manager = dpu.SequentialOrderManager[exec_q] |
| 70 | + dep_evs = _manager.submitted_events |
| 71 | + |
| 72 | + # can leverage efficient memset when val is 0 |
| 73 | + if arr.flags["FORC"] and val == 0: |
| 74 | + h_ev, zeros_ev = _zeros_usm_ndarray(arr, exec_q, depends=dep_evs) |
| 75 | + _manager.add_event_pair(h_ev, zeros_ev) |
| 76 | + else: |
| 77 | + h_ev, fill_ev = _full_usm_ndarray(val, arr, exec_q, depends=dep_evs) |
| 78 | + _manager.add_event_pair(h_ev, fill_ev) |
0 commit comments