forked from vllm-project/vllm
-
Notifications
You must be signed in to change notification settings - Fork 0
Commit
This commit does not belong to any branch on this repository, and may belong to a fork outside of the repository.
Merge pull request vllm-project#5 from beagleski/eric/bs-attn-and-phi…
…3small [Model][Kernels] Support Phi3small architecture, blocksparse attnention prefilling kernel, CUDA+Triton paged attn kernels
- Loading branch information
Showing
261 changed files
with
13,746 additions
and
4,628 deletions.
There are no files selected for viewing
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Original file line number | Diff line number | Diff line change |
---|---|---|
@@ -0,0 +1,36 @@ | ||
import os | ||
import zipfile | ||
|
||
MAX_SIZE_MB = 150 | ||
|
||
|
||
def print_top_10_largest_files(zip_file): | ||
with zipfile.ZipFile(zip_file, 'r') as z: | ||
file_sizes = [(f, z.getinfo(f).file_size) for f in z.namelist()] | ||
file_sizes.sort(key=lambda x: x[1], reverse=True) | ||
for f, size in file_sizes[:10]: | ||
print(f"{f}: {size/(1024*1024)} MBs uncompressed.") | ||
|
||
|
||
def check_wheel_size(directory): | ||
for root, _, files in os.walk(directory): | ||
for f in files: | ||
if f.endswith(".whl"): | ||
wheel_path = os.path.join(root, f) | ||
wheel_size = os.path.getsize(wheel_path) | ||
wheel_size_mb = wheel_size / (1024 * 1024) | ||
if wheel_size_mb > MAX_SIZE_MB: | ||
print( | ||
f"Wheel {wheel_path} is too large ({wheel_size_mb} MB) " | ||
f"compare to the allowed size ({MAX_SIZE_MB} MB).") | ||
print_top_10_largest_files(wheel_path) | ||
return 1 | ||
else: | ||
print(f"Wheel {wheel_path} is within the allowed size " | ||
f"({wheel_size_mb} MB).") | ||
return 0 | ||
|
||
|
||
if __name__ == "__main__": | ||
import sys | ||
sys.exit(check_wheel_size(sys.argv[1])) |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Oops, something went wrong.