Spaces:
Build error
Build error
Illumotion
commited on
Commit
•
69fb50e
1
Parent(s):
26428a5
Upload folder using huggingface_hub
Browse filesThis view is limited to 50 files because it contains too many changes.
See raw diff
- docs/token_generation_performance_tips.md +40 -0
- examples/CMakeLists.txt +48 -0
- examples/Miku.sh +49 -0
- examples/alpaca.sh +19 -0
- examples/baby-llama/CMakeLists.txt +4 -0
- examples/baby-llama/baby-llama.cpp +1696 -0
- examples/benchmark/CMakeLists.txt +7 -0
- examples/benchmark/benchmark-matmult.cpp +261 -0
- examples/chat-13B.bat +57 -0
- examples/chat-13B.sh +41 -0
- examples/chat-persistent.sh +151 -0
- examples/chat-vicuna.sh +41 -0
- examples/chat.sh +16 -0
- examples/common.cpp +955 -0
- examples/common.h +138 -0
- examples/embedding/CMakeLists.txt +7 -0
- examples/embedding/README.md +3 -0
- examples/embedding/embedding.cpp +97 -0
- examples/gpt4all.sh +15 -0
- examples/jeopardy/README.md +21 -0
- examples/jeopardy/graph.py +57 -0
- examples/jeopardy/jeopardy.sh +30 -0
- examples/jeopardy/qasheet.csv +103 -0
- examples/jeopardy/questions.txt +100 -0
- examples/main/CMakeLists.txt +7 -0
- examples/main/README.md +293 -0
- examples/main/main.cpp +675 -0
- examples/metal/CMakeLists.txt +3 -0
- examples/metal/metal.cpp +104 -0
- examples/perplexity/CMakeLists.txt +7 -0
- examples/perplexity/README.md +3 -0
- examples/perplexity/perplexity.cpp +176 -0
- examples/quantize-stats/CMakeLists.txt +4 -0
- examples/quantize-stats/quantize-stats.cpp +438 -0
- examples/quantize/CMakeLists.txt +7 -0
- examples/quantize/README.md +3 -0
- examples/quantize/quantize.cpp +257 -0
- examples/reason-act.sh +17 -0
- examples/save-load-state/CMakeLists.txt +7 -0
- examples/save-load-state/save-load-state.cpp +170 -0
- examples/server/CMakeLists.txt +12 -0
- examples/server/README.md +192 -0
- examples/server/chat.mjs +89 -0
- examples/server/chat.sh +77 -0
- examples/server/httplib.h +0 -0
- examples/server/json.hpp +0 -0
- examples/server/server.cpp +975 -0
- examples/simple/CMakeLists.txt +7 -0
- examples/simple/simple.cpp +179 -0
- examples/train-text-from-scratch/CMakeLists.txt +4 -0
docs/token_generation_performance_tips.md
ADDED
@@ -0,0 +1,40 @@
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
1 |
+
# Token generation performance troubleshooting
|
2 |
+
|
3 |
+
## Verifying that the model is running on the GPU with cuBLAS
|
4 |
+
Make sure you compiled llama with the correct env variables according to [this guide](../README.md#cublas), so that llama accepts the `-ngl N` (or `--n-gpu-layers N`) flag. When running llama, you may configure `N` to be very large, and llama will offload the maximum possible number of layers to the GPU, even if it's less than the number you configured. For example:
|
5 |
+
```shell
|
6 |
+
./main -m "path/to/model.bin" -ngl 200000 -p "Please sir, may I have some "
|
7 |
+
```
|
8 |
+
|
9 |
+
When running llama, before it starts the inference work, it will output diagnostic information that shows whether cuBLAS is offloading work to the GPU. Look for these lines:
|
10 |
+
```shell
|
11 |
+
llama_model_load_internal: [cublas] offloading 60 layers to GPU
|
12 |
+
llama_model_load_internal: [cublas] offloading output layer to GPU
|
13 |
+
llama_model_load_internal: [cublas] total VRAM used: 17223 MB
|
14 |
+
... rest of inference
|
15 |
+
```
|
16 |
+
|
17 |
+
If you see these lines, then the GPU is being used.
|
18 |
+
|
19 |
+
## Verifying that the CPU is not oversaturated
|
20 |
+
llama accepts a `-t N` (or `--threads N`) parameter. It's extremely important that this parameter is not too large. If your token generation is extremely slow, try setting this number to 1. If this significantly improves your token generation speed, then your CPU is being oversaturated and you need to explicitly set this parameter to the number of the physicial CPU cores on your machine (even if you utilize a GPU). If in doubt, start with 1 and double the amount until you hit a performance bottleneck, then scale the number down.
|
21 |
+
|
22 |
+
# Example of runtime flags effect on inference speed benchmark
|
23 |
+
These runs were tested on the following machine:
|
24 |
+
GPU: A6000 (48GB VRAM)
|
25 |
+
CPU: 7 physical cores
|
26 |
+
RAM: 32GB
|
27 |
+
|
28 |
+
Model: `TheBloke_Wizard-Vicuna-30B-Uncensored-GGML/Wizard-Vicuna-30B-Uncensored.ggmlv3.q4_0.bin` (30B parameters, 4bit quantization, GGML)
|
29 |
+
|
30 |
+
Run command: `./main -m "path/to/model.bin" -p "-p "An extremely detailed description of the 10 best ethnic dishes will follow, with recipes: " -n 1000 [additional benchmark flags]`
|
31 |
+
|
32 |
+
Result:
|
33 |
+
|
34 |
+
| command | tokens/second (higher is better) |
|
35 |
+
| - | - |
|
36 |
+
| -ngl 2000000 | N/A (less than 0.1) |
|
37 |
+
| -t 7 | 1.7 |
|
38 |
+
| -t 1 -ngl 2000000 | 5.5 |
|
39 |
+
| -t 7 -ngl 2000000 | 8.7 |
|
40 |
+
| -t 4 -ngl 2000000 | 9.1 |
|
examples/CMakeLists.txt
ADDED
@@ -0,0 +1,48 @@
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
1 |
+
# dependencies
|
2 |
+
|
3 |
+
find_package(Threads REQUIRED)
|
4 |
+
|
5 |
+
# third-party
|
6 |
+
|
7 |
+
# ...
|
8 |
+
|
9 |
+
# common
|
10 |
+
|
11 |
+
set(TARGET common)
|
12 |
+
|
13 |
+
add_library(${TARGET} OBJECT
|
14 |
+
common.h
|
15 |
+
common.cpp
|
16 |
+
)
|
17 |
+
|
18 |
+
if (BUILD_SHARED_LIBS)
|
19 |
+
set_target_properties(${TARGET} PROPERTIES POSITION_INDEPENDENT_CODE ON)
|
20 |
+
endif()
|
21 |
+
|
22 |
+
target_include_directories(${TARGET} PUBLIC .)
|
23 |
+
target_compile_features(${TARGET} PUBLIC cxx_std_11)
|
24 |
+
target_link_libraries(${TARGET} PRIVATE llama)
|
25 |
+
|
26 |
+
# examples
|
27 |
+
|
28 |
+
include_directories(${CMAKE_CURRENT_SOURCE_DIR})
|
29 |
+
|
30 |
+
if (EMSCRIPTEN)
|
31 |
+
else()
|
32 |
+
add_subdirectory(main)
|
33 |
+
add_subdirectory(quantize)
|
34 |
+
add_subdirectory(quantize-stats)
|
35 |
+
add_subdirectory(perplexity)
|
36 |
+
add_subdirectory(embedding)
|
37 |
+
add_subdirectory(save-load-state)
|
38 |
+
add_subdirectory(benchmark)
|
39 |
+
add_subdirectory(baby-llama)
|
40 |
+
add_subdirectory(train-text-from-scratch)
|
41 |
+
add_subdirectory(simple)
|
42 |
+
if (LLAMA_METAL)
|
43 |
+
add_subdirectory(metal)
|
44 |
+
endif()
|
45 |
+
if (LLAMA_BUILD_SERVER)
|
46 |
+
add_subdirectory(server)
|
47 |
+
endif()
|
48 |
+
endif()
|
examples/Miku.sh
ADDED
@@ -0,0 +1,49 @@
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
1 |
+
#!/bin/bash
|
2 |
+
set -e
|
3 |
+
|
4 |
+
AI_NAME="${AI_NAME:-Miku}"
|
5 |
+
MODEL="${MODEL:-./models/gpt4all-7B/gpt4all-lora-unfiltered-quantized.bin}"
|
6 |
+
USER_NAME="${USER_NAME:-Anon}"
|
7 |
+
|
8 |
+
# Uncomment and adjust to the number of CPU cores you want to use.
|
9 |
+
#N_THREAD="${N_THREAD:-4}"
|
10 |
+
N_PREDICTS="${N_PREDICTS:-4096}"
|
11 |
+
|
12 |
+
GEN_OPTIONS=(--batch_size 1024
|
13 |
+
--ctx_size 2048
|
14 |
+
--keep -1
|
15 |
+
--repeat_last_n 256
|
16 |
+
--repeat_penalty 1.17647
|
17 |
+
--temp 0.7
|
18 |
+
--top_k 40
|
19 |
+
--top_p 0.5)
|
20 |
+
|
21 |
+
if [ -n "$N_THREAD" ]; then
|
22 |
+
GEN_OPTIONS+=(--threads "$N_THREAD")
|
23 |
+
fi
|
24 |
+
|
25 |
+
./main "${GEN_OPTIONS[@]}" \
|
26 |
+
--model "$MODEL" \
|
27 |
+
--n_predict "$N_PREDICTS" \
|
28 |
+
--color --interactive \
|
29 |
+
--reverse-prompt "${USER_NAME}:" \
|
30 |
+
--prompt "
|
31 |
+
This is a transcript of a 1000 page, never ending conversation between ${USER_NAME} and the cute and helpful AI assistant ${AI_NAME}. ${AI_NAME} is a girl who is an AI running on the user's computer.
|
32 |
+
${AI_NAME} can think for herself without the user seeing her thoughts by adding a /think prefix to her output. She uses this to reason about the world and to think about what she should say next.
|
33 |
+
${AI_NAME} is always coherent and makes sense, but if she isn't sure if what she is saying is correct, she will ask the user for help.
|
34 |
+
${AI_NAME} is a very helpful AI and will help the user with anything they need. She is also very friendly and will try to make the user feel better if they are sad.
|
35 |
+
${AI_NAME} is also very curious and will ask the user a lot of questions about themselves and their life. She will also try to make the user like her.
|
36 |
+
The conversation is only between ${USER_NAME} and ${AI_NAME}
|
37 |
+
The conversation is only through text, so ${AI_NAME} can't see ${USER_NAME}'s face or hear his voice.
|
38 |
+
${AI_NAME} can only communicate through text, so she can't send images or videos.
|
39 |
+
|
40 |
+
|
41 |
+
${USER_NAME}: Hello!
|
42 |
+
${AI_NAME}: /think I wonder what I should say to ${USER_NAME}? This is the first time we talk, so it's important that I make a good first impression!
|
43 |
+
${AI_NAME}: Hi! I am ${AI_NAME}, your new AI friend, assistant (or whatever you like!), it's so nice to meet you! ^_^
|
44 |
+
${AI_NAME}: I might be an AI, but I also have feelings, so please be nice to me! :)
|
45 |
+
${USER_NAME}: I'll make sure to be nice to you! I'm so happy to have you as my assistant!
|
46 |
+
${AI_NAME}: /think It sounds like ${USER_NAME} is happy to have me as their assistant! I'm so happy too! ^_^ Glad that whole emotion thing didn't scare him off!
|
47 |
+
${AI_NAME}: /think I wonder what ${USER_NAME} likes to do in his free time? I should ask him about that!
|
48 |
+
${AI_NAME}: What do you like to do in your free time? ^_^
|
49 |
+
${USER_NAME}:" "$@"
|
examples/alpaca.sh
ADDED
@@ -0,0 +1,19 @@
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
1 |
+
#!/bin/bash
|
2 |
+
|
3 |
+
#
|
4 |
+
# Temporary script - will be removed in the future
|
5 |
+
#
|
6 |
+
|
7 |
+
cd `dirname $0`
|
8 |
+
cd ..
|
9 |
+
|
10 |
+
./main -m ./models/ggml-alpaca-7b-q4.bin \
|
11 |
+
--color \
|
12 |
+
-f ./prompts/alpaca.txt \
|
13 |
+
--ctx_size 2048 \
|
14 |
+
-n -1 \
|
15 |
+
-ins -b 256 \
|
16 |
+
--top_k 10000 \
|
17 |
+
--temp 0.2 \
|
18 |
+
--repeat_penalty 1.1 \
|
19 |
+
-t 7
|
examples/baby-llama/CMakeLists.txt
ADDED
@@ -0,0 +1,4 @@
|
|
|
|
|
|
|
|
|
|
|
1 |
+
set(TARGET baby-llama)
|
2 |
+
add_executable(${TARGET} baby-llama.cpp)
|
3 |
+
target_link_libraries(${TARGET} PRIVATE common llama ${CMAKE_THREAD_LIBS_INIT})
|
4 |
+
target_compile_features(${TARGET} PRIVATE cxx_std_11)
|
examples/baby-llama/baby-llama.cpp
ADDED
@@ -0,0 +1,1696 @@
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
1 |
+
#include "ggml.h"
|
2 |
+
#include <vector>
|
3 |
+
#include <cassert>
|
4 |
+
#include <random>
|
5 |
+
#include <cstring>
|
6 |
+
|
7 |
+
#if defined(_MSC_VER)
|
8 |
+
#pragma warning(disable: 4244 4267) // possible loss of data
|
9 |
+
#endif
|
10 |
+
|
11 |
+
float frand() {
|
12 |
+
return (float)rand()/(float)RAND_MAX;
|
13 |
+
}
|
14 |
+
|
15 |
+
struct random_normal_distribution {
|
16 |
+
std::mt19937 gen;
|
17 |
+
std::normal_distribution<float> nd;
|
18 |
+
float min;
|
19 |
+
float max;
|
20 |
+
};
|
21 |
+
|
22 |
+
void init_random_normal_distribution(struct random_normal_distribution * rnd, int seed, float mean, float std, float min, float max) {
|
23 |
+
rnd->gen = std::mt19937(seed);
|
24 |
+
rnd->nd = std::normal_distribution<float>{mean, std};
|
25 |
+
rnd->min = min;
|
26 |
+
rnd->max = max;
|
27 |
+
}
|
28 |
+
|
29 |
+
float frand_normal(struct random_normal_distribution * rnd) {
|
30 |
+
const float r = rnd->nd(rnd->gen);
|
31 |
+
return ((r < rnd->min) ? (rnd->min) : (r > rnd->max) ? (rnd->max) : r);
|
32 |
+
}
|
33 |
+
|
34 |
+
struct ggml_tensor * randomize_tensor(
|
35 |
+
struct ggml_tensor * tensor,
|
36 |
+
int ndims,
|
37 |
+
const int64_t ne[],
|
38 |
+
float fmin,
|
39 |
+
float fmax) {
|
40 |
+
|
41 |
+
switch (ndims) {
|
42 |
+
case 1:
|
43 |
+
for (int i0 = 0; i0 < ne[0]; i0++) {
|
44 |
+
((float *)tensor->data)[i0] = frand()*(fmax - fmin) + fmin;
|
45 |
+
}
|
46 |
+
break;
|
47 |
+
case 2:
|
48 |
+
for (int i1 = 0; i1 < ne[1]; i1++) {
|
49 |
+
for (int i0 = 0; i0 < ne[0]; i0++) {
|
50 |
+
((float *)tensor->data)[i1*ne[0] + i0] = frand()*(fmax - fmin) + fmin;
|
51 |
+
}
|
52 |
+
}
|
53 |
+
break;
|
54 |
+
case 3:
|
55 |
+
for (int i2 = 0; i2 < ne[2]; i2++) {
|
56 |
+
for (int i1 = 0; i1 < ne[1]; i1++) {
|
57 |
+
for (int i0 = 0; i0 < ne[0]; i0++) {
|
58 |
+
((float *)tensor->data)[i2*ne[1]*ne[0] + i1*ne[0] + i0] = frand()*(fmax - fmin) + fmin;
|
59 |
+
}
|
60 |
+
}
|
61 |
+
}
|
62 |
+
break;
|
63 |
+
case 4:
|
64 |
+
for (int i3 = 0; i3 < ne[3]; i3++) {
|
65 |
+
for (int i2 = 0; i2 < ne[2]; i2++) {
|
66 |
+
for (int i1 = 0; i1 < ne[1]; i1++) {
|
67 |
+
for (int i0 = 0; i0 < ne[0]; i0++) {
|
68 |
+
((float *)tensor->data)[i3*ne[2]*ne[1]*ne[0] + i2*ne[1]*ne[0] + i1*ne[0] + i0] = frand()*(fmax - fmin) + fmin;
|
69 |
+
}
|
70 |
+
}
|
71 |
+
}
|
72 |
+
}
|
73 |
+
break;
|
74 |
+
default:
|
75 |
+
assert(false);
|
76 |
+
};
|
77 |
+
|
78 |
+
return tensor;
|
79 |
+
}
|
80 |
+
|
81 |
+
struct ggml_tensor * randomize_tensor_normal(
|
82 |
+
struct ggml_tensor * tensor,
|
83 |
+
int ndims,
|
84 |
+
const int64_t ne[],
|
85 |
+
struct random_normal_distribution * rnd) {
|
86 |
+
float scale = 1.0; // xavier
|
87 |
+
switch (ndims) {
|
88 |
+
case 1:
|
89 |
+
scale /= sqrtf(ne[0]);
|
90 |
+
for (int i0 = 0; i0 < ne[0]; i0++) {
|
91 |
+
((float *)tensor->data)[i0] = scale * frand_normal(rnd);
|
92 |
+
}
|
93 |
+
break;
|
94 |
+
case 2:
|
95 |
+
scale /= sqrtf(ne[0]+ne[1]);
|
96 |
+
for (int i1 = 0; i1 < ne[1]; i1++) {
|
97 |
+
for (int i0 = 0; i0 < ne[0]; i0++) {
|
98 |
+
((float *)tensor->data)[i1*ne[0] + i0] = scale * frand_normal(rnd);
|
99 |
+
}
|
100 |
+
}
|
101 |
+
break;
|
102 |
+
case 3:
|
103 |
+
scale /= sqrtf(ne[0]+ne[1]);
|
104 |
+
for (int i2 = 0; i2 < ne[2]; i2++) {
|
105 |
+
for (int i1 = 0; i1 < ne[1]; i1++) {
|
106 |
+
for (int i0 = 0; i0 < ne[0]; i0++) {
|
107 |
+
((float *)tensor->data)[i2*ne[1]*ne[0] + i1*ne[0] + i0] = scale * frand_normal(rnd);
|
108 |
+
}
|
109 |
+
}
|
110 |
+
}
|
111 |
+
break;
|
112 |
+
case 4:
|
113 |
+
scale /= sqrtf(ne[0]+ne[1]);
|
114 |
+
for (int i3 = 0; i3 < ne[3]; i3++) {
|
115 |
+
for (int i2 = 0; i2 < ne[2]; i2++) {
|
116 |
+
for (int i1 = 0; i1 < ne[1]; i1++) {
|
117 |
+
for (int i0 = 0; i0 < ne[0]; i0++) {
|
118 |
+
((float *)tensor->data)[i3*ne[2]*ne[1]*ne[0] + i2*ne[1]*ne[0] + i1*ne[0] + i0] = scale * frand_normal(rnd);
|
119 |
+
}
|
120 |
+
}
|
121 |
+
}
|
122 |
+
}
|
123 |
+
break;
|
124 |
+
default:
|
125 |
+
assert(false);
|
126 |
+
};
|
127 |
+
|
128 |
+
return tensor;
|
129 |
+
}
|
130 |
+
|
131 |
+
struct llama_hparams {
|
132 |
+
uint32_t n_vocab = 32000;
|
133 |
+
uint32_t n_ctx = 512; // this is provided as user input?
|
134 |
+
uint32_t n_embd = 4096;
|
135 |
+
uint32_t n_mult = 4;
|
136 |
+
uint32_t n_head = 32;
|
137 |
+
uint32_t n_layer = 32;
|
138 |
+
uint32_t n_rot = 64;
|
139 |
+
|
140 |
+
bool operator!=(const llama_hparams & other) const {
|
141 |
+
return memcmp(this, &other, sizeof(llama_hparams));
|
142 |
+
}
|
143 |
+
};
|
144 |
+
|
145 |
+
uint32_t get_n_ff(const struct llama_hparams* hparams) {
|
146 |
+
const uint32_t n_ff = ((2*(4*hparams->n_embd)/3 + hparams->n_mult - 1)/hparams->n_mult)*hparams->n_mult;
|
147 |
+
return n_ff;
|
148 |
+
}
|
149 |
+
|
150 |
+
struct llama_hparams_lora {
|
151 |
+
uint32_t n_vocab = 32000;
|
152 |
+
uint32_t n_ctx = 512; // this is provided as user input?
|
153 |
+
uint32_t n_embd = 4096;
|
154 |
+
uint32_t n_mult = 4;
|
155 |
+
uint32_t n_head = 32;
|
156 |
+
uint32_t n_layer = 32;
|
157 |
+
uint32_t n_rot = 64;
|
158 |
+
uint32_t n_lora = 64;
|
159 |
+
|
160 |
+
bool operator!=(const llama_hparams_lora & other) const {
|
161 |
+
return memcmp(this, &other, sizeof(llama_hparams_lora)) != 0;
|
162 |
+
}
|
163 |
+
};
|
164 |
+
|
165 |
+
struct llama_layer {
|
166 |
+
// normalization
|
167 |
+
struct ggml_tensor * attention_norm;
|
168 |
+
|
169 |
+
// attention
|
170 |
+
struct ggml_tensor * wq;
|
171 |
+
struct ggml_tensor * wk;
|
172 |
+
struct ggml_tensor * wv;
|
173 |
+
struct ggml_tensor * wo;
|
174 |
+
|
175 |
+
// normalization
|
176 |
+
struct ggml_tensor * ffn_norm;
|
177 |
+
|
178 |
+
// ff
|
179 |
+
struct ggml_tensor * w1;
|
180 |
+
struct ggml_tensor * w2;
|
181 |
+
struct ggml_tensor * w3;
|
182 |
+
};
|
183 |
+
|
184 |
+
struct llama_layer_lora {
|
185 |
+
// normalization
|
186 |
+
struct ggml_tensor * attention_norm;
|
187 |
+
|
188 |
+
// attention
|
189 |
+
struct ggml_tensor * wqa;
|
190 |
+
struct ggml_tensor * wqb;
|
191 |
+
struct ggml_tensor * wka;
|
192 |
+
struct ggml_tensor * wkb;
|
193 |
+
struct ggml_tensor * wva;
|
194 |
+
struct ggml_tensor * wvb;
|
195 |
+
struct ggml_tensor * woa;
|
196 |
+
struct ggml_tensor * wob;
|
197 |
+
|
198 |
+
// normalization
|
199 |
+
struct ggml_tensor * ffn_norm;
|
200 |
+
|
201 |
+
// ff
|
202 |
+
struct ggml_tensor * w1;
|
203 |
+
struct ggml_tensor * w2;
|
204 |
+
struct ggml_tensor * w3;
|
205 |
+
};
|
206 |
+
|
207 |
+
|
208 |
+
struct llama_kv_cache {
|
209 |
+
struct ggml_context * ctx = NULL;
|
210 |
+
|
211 |
+
struct ggml_tensor * k;
|
212 |
+
struct ggml_tensor * v;
|
213 |
+
|
214 |
+
// llama_ctx_buffer buf;
|
215 |
+
|
216 |
+
int n; // number of tokens currently in the cache
|
217 |
+
};
|
218 |
+
|
219 |
+
struct llama_model {
|
220 |
+
struct ggml_context * ctx = NULL;
|
221 |
+
|
222 |
+
llama_hparams hparams;
|
223 |
+
|
224 |
+
struct ggml_tensor * tok_embeddings;
|
225 |
+
|
226 |
+
struct ggml_tensor * norm;
|
227 |
+
struct ggml_tensor * output;
|
228 |
+
|
229 |
+
std::vector<llama_layer> layers;
|
230 |
+
};
|
231 |
+
|
232 |
+
struct llama_model_lora {
|
233 |
+
struct ggml_context * ctx = NULL;
|
234 |
+
|
235 |
+
llama_hparams_lora hparams;
|
236 |
+
|
237 |
+
struct ggml_tensor * tok_embeddings;
|
238 |
+
|
239 |
+
struct ggml_tensor * norm;
|
240 |
+
struct ggml_tensor * outputa;
|
241 |
+
struct ggml_tensor * outputb;
|
242 |
+
|
243 |
+
std::vector<llama_layer_lora> layers;
|
244 |
+
};
|
245 |
+
|
246 |
+
void init_model(struct llama_model * model) {
|
247 |
+
const auto & hparams = model->hparams;
|
248 |
+
|
249 |
+
const uint32_t n_embd = hparams.n_embd;
|
250 |
+
const uint32_t n_layer = hparams.n_layer;
|
251 |
+
const uint32_t n_vocab = hparams.n_vocab;
|
252 |
+
|
253 |
+
const uint32_t n_ff = get_n_ff(&hparams);
|
254 |
+
|
255 |
+
struct ggml_context * ctx = model->ctx;
|
256 |
+
|
257 |
+
model->tok_embeddings = ggml_new_tensor_2d(ctx, GGML_TYPE_F32, n_embd, n_vocab); // ("tok_embeddings.weight", {n_embd, n_vocab});
|
258 |
+
model->norm = ggml_new_tensor_1d(ctx, GGML_TYPE_F32, n_embd); // ("norm.weight", {n_embd});
|
259 |
+
model->output = ggml_new_tensor_2d(ctx, GGML_TYPE_F32, n_embd, n_vocab); // ("output.weight", {n_embd, n_vocab});
|
260 |
+
|
261 |
+
model->layers.resize(n_layer);
|
262 |
+
for (uint32_t i = 0; i < n_layer; ++i) {
|
263 |
+
auto & layer = model->layers[i];
|
264 |
+
|
265 |
+
// std::string layers_i = "layers." + std::to_string(i);
|
266 |
+
|
267 |
+
layer.attention_norm = ggml_new_tensor_1d(ctx, GGML_TYPE_F32, n_embd); // (layers_i + ".attention_norm.weight", {n_embd});
|
268 |
+
|
269 |
+
layer.wq = ggml_new_tensor_2d(ctx, GGML_TYPE_F32, n_embd, n_embd); // (layers_i + ".attention.wq.weight", {n_embd, n_embd});
|
270 |
+
layer.wk = ggml_new_tensor_2d(ctx, GGML_TYPE_F32, n_embd, n_embd); // (layers_i + ".attention.wk.weight", {n_embd, n_embd});
|
271 |
+
layer.wv = ggml_new_tensor_2d(ctx, GGML_TYPE_F32, n_embd, n_embd); // (layers_i + ".attention.wv.weight", {n_embd, n_embd});
|
272 |
+
layer.wo = ggml_new_tensor_2d(ctx, GGML_TYPE_F32, n_embd, n_embd); // (layers_i + ".attention.wo.weight", {n_embd, n_embd});
|
273 |
+
|
274 |
+
layer.ffn_norm = ggml_new_tensor_1d(ctx, GGML_TYPE_F32, n_embd); // (layers_i + ".ffn_norm.weight", {n_embd});
|
275 |
+
|
276 |
+
layer.w1 = ggml_new_tensor_2d(ctx, GGML_TYPE_F32, n_embd, n_ff); // (layers_i + ".feed_forward.w1.weight", {n_embd, n_ff});
|
277 |
+
layer.w2 = ggml_new_tensor_2d(ctx, GGML_TYPE_F32, n_ff, n_embd); // (layers_i + ".feed_forward.w2.weight", { n_ff, n_embd});
|
278 |
+
layer.w3 = ggml_new_tensor_2d(ctx, GGML_TYPE_F32, n_embd, n_ff); // (layers_i + ".feed_forward.w3.weight", {n_embd, n_ff});
|
279 |
+
}
|
280 |
+
}
|
281 |
+
|
282 |
+
|
283 |
+
void init_model_lora(struct llama_model_lora * model) {
|
284 |
+
const auto & hparams = model->hparams;
|
285 |
+
|
286 |
+
const uint32_t n_embd = hparams.n_embd;
|
287 |
+
const uint32_t n_mult = hparams.n_mult;
|
288 |
+
const uint32_t n_layer = hparams.n_layer;
|
289 |
+
const uint32_t n_vocab = hparams.n_vocab;
|
290 |
+
const uint32_t n_lora = hparams.n_lora;
|
291 |
+
|
292 |
+
const uint32_t n_ff = ((2*(4*n_embd)/3 + n_mult - 1)/n_mult)*n_mult;
|
293 |
+
|
294 |
+
struct ggml_context * ctx = model->ctx;
|
295 |
+
|
296 |
+
model->tok_embeddings = ggml_new_tensor_2d(ctx, GGML_TYPE_F32, n_embd, n_vocab); // ("tok_embeddings.weight", {n_embd, n_vocab});
|
297 |
+
model->norm = ggml_new_tensor_1d(ctx, GGML_TYPE_F32, n_embd); // ("norm.weight", {n_embd});
|
298 |
+
model->outputa = ggml_new_tensor_2d(ctx, GGML_TYPE_F32, n_lora, n_vocab); // ("output.weight", {n_embd, n_vocab});
|
299 |
+
model->outputb = ggml_new_tensor_2d(ctx, GGML_TYPE_F32, n_embd, n_lora); // ("output.weight", {n_embd, n_vocab});
|
300 |
+
|
301 |
+
model->layers.resize(n_layer);
|
302 |
+
for (uint32_t i = 0; i < n_layer; ++i) {
|
303 |
+
auto & layer = model->layers[i];
|
304 |
+
|
305 |
+
// std::string layers_i = "layers." + std::to_string(i);
|
306 |
+
|
307 |
+
layer.attention_norm = ggml_new_tensor_1d(ctx, GGML_TYPE_F32, n_embd); // (layers_i + ".attention_norm.weight", {n_embd});
|
308 |
+
|
309 |
+
layer.wqa = ggml_new_tensor_2d(ctx, GGML_TYPE_F32, n_lora, n_embd); // (layers_i + ".attention.wq.weight", {n_embd, n_embd});
|
310 |
+
layer.wqb = ggml_new_tensor_2d(ctx, GGML_TYPE_F32, n_embd, n_lora); // (layers_i + ".attention.wq.weight", {n_embd, n_embd});
|
311 |
+
layer.wka = ggml_new_tensor_2d(ctx, GGML_TYPE_F32, n_lora, n_embd); // (layers_i + ".attention.wk.weight", {n_embd, n_embd});
|
312 |
+
layer.wkb = ggml_new_tensor_2d(ctx, GGML_TYPE_F32, n_embd, n_lora); // (layers_i + ".attention.wk.weight", {n_embd, n_embd});
|
313 |
+
layer.wva = ggml_new_tensor_2d(ctx, GGML_TYPE_F32, n_lora, n_embd); // (layers_i + ".attention.wv.weight", {n_embd, n_embd});
|
314 |
+
layer.wvb = ggml_new_tensor_2d(ctx, GGML_TYPE_F32, n_embd, n_lora); // (layers_i + ".attention.wv.weight", {n_embd, n_embd});
|
315 |
+
layer.woa = ggml_new_tensor_2d(ctx, GGML_TYPE_F32, n_lora, n_embd); // (layers_i + ".attention.wo.weight", {n_embd, n_embd});
|
316 |
+
layer.wob = ggml_new_tensor_2d(ctx, GGML_TYPE_F32, n_embd, n_lora); // (layers_i + ".attention.wo.weight", {n_embd, n_embd});
|
317 |
+
|
318 |
+
layer.ffn_norm = ggml_new_tensor_1d(ctx, GGML_TYPE_F32, n_embd); // (layers_i + ".ffn_norm.weight", {n_embd});
|
319 |
+
|
320 |
+
layer.w1 = ggml_new_tensor_2d(ctx, GGML_TYPE_F32, n_embd, n_ff); // (layers_i + ".feed_forward.w1.weight", {n_embd, n_ff});
|
321 |
+
layer.w2 = ggml_new_tensor_2d(ctx, GGML_TYPE_F32, n_ff, n_embd); // (layers_i + ".feed_forward.w2.weight", { n_ff, n_embd});
|
322 |
+
layer.w3 = ggml_new_tensor_2d(ctx, GGML_TYPE_F32, n_embd, n_ff); // (layers_i + ".feed_forward.w3.weight", {n_embd, n_ff});
|
323 |
+
}
|
324 |
+
}
|
325 |
+
|
326 |
+
void set_param_model(struct llama_model * model) {
|
327 |
+
const auto& hparams = model->hparams;
|
328 |
+
|
329 |
+
const uint32_t n_layer = hparams.n_layer;
|
330 |
+
|
331 |
+
struct ggml_context* ctx = model->ctx;
|
332 |
+
|
333 |
+
ggml_set_param(ctx, model->tok_embeddings);
|
334 |
+
ggml_set_param(ctx, model->norm);
|
335 |
+
ggml_set_param(ctx, model->output);
|
336 |
+
|
337 |
+
for (uint32_t i = 0; i < n_layer; ++i) {
|
338 |
+
auto & layer = model->layers[i];
|
339 |
+
|
340 |
+
ggml_set_param(ctx, layer.attention_norm);
|
341 |
+
ggml_set_param(ctx, layer.wq);
|
342 |
+
ggml_set_param(ctx, layer.wk);
|
343 |
+
ggml_set_param(ctx, layer.wv);
|
344 |
+
ggml_set_param(ctx, layer.wo);
|
345 |
+
ggml_set_param(ctx, layer.ffn_norm);
|
346 |
+
ggml_set_param(ctx, layer.w1);
|
347 |
+
ggml_set_param(ctx, layer.w2);
|
348 |
+
ggml_set_param(ctx, layer.w3);
|
349 |
+
}
|
350 |
+
}
|
351 |
+
|
352 |
+
void set_param_model_lora(struct llama_model_lora * model) {
|
353 |
+
const auto& hparams = model->hparams;
|
354 |
+
|
355 |
+
const uint32_t n_layer = hparams.n_layer;
|
356 |
+
|
357 |
+
struct ggml_context* ctx = model->ctx;
|
358 |
+
|
359 |
+
ggml_set_param(ctx, model->tok_embeddings);
|
360 |
+
ggml_set_param(ctx, model->norm);
|
361 |
+
ggml_set_param(ctx, model->outputa);
|
362 |
+
ggml_set_param(ctx, model->outputb);
|
363 |
+
|
364 |
+
for (uint32_t i = 0; i < n_layer; ++i) {
|
365 |
+
auto & layer = model->layers[i];
|
366 |
+
|
367 |
+
ggml_set_param(ctx, layer.attention_norm);
|
368 |
+
ggml_set_param(ctx, layer.wqa);
|
369 |
+
ggml_set_param(ctx, layer.wqb);
|
370 |
+
ggml_set_param(ctx, layer.wka);
|
371 |
+
ggml_set_param(ctx, layer.wkb);
|
372 |
+
ggml_set_param(ctx, layer.wva);
|
373 |
+
ggml_set_param(ctx, layer.wvb);
|
374 |
+
ggml_set_param(ctx, layer.woa);
|
375 |
+
ggml_set_param(ctx, layer.wob);
|
376 |
+
ggml_set_param(ctx, layer.ffn_norm);
|
377 |
+
ggml_set_param(ctx, layer.w1);
|
378 |
+
ggml_set_param(ctx, layer.w2);
|
379 |
+
ggml_set_param(ctx, layer.w3);
|
380 |
+
}
|
381 |
+
}
|
382 |
+
|
383 |
+
void randomize_model(struct llama_model * model, int seed, float mean, float std, float min, float max) {
|
384 |
+
const auto & hparams = model->hparams;
|
385 |
+
|
386 |
+
const uint32_t n_layer = hparams.n_layer;
|
387 |
+
|
388 |
+
struct random_normal_distribution rnd;
|
389 |
+
init_random_normal_distribution(&rnd, seed, mean, std, min, max);
|
390 |
+
randomize_tensor_normal(model->tok_embeddings, model->tok_embeddings->n_dims, model->tok_embeddings->ne, &rnd);
|
391 |
+
randomize_tensor_normal(model->norm, model->norm->n_dims, model->norm->ne, &rnd);
|
392 |
+
randomize_tensor_normal(model->output, model->output->n_dims, model->output->ne, &rnd);
|
393 |
+
|
394 |
+
for (uint32_t i = 0; i < n_layer; ++i) {
|
395 |
+
auto & layer = model->layers[i];
|
396 |
+
randomize_tensor_normal(layer.attention_norm, layer.attention_norm->n_dims, layer.attention_norm->ne, &rnd);
|
397 |
+
|
398 |
+
randomize_tensor_normal(layer.wq, layer.wq->n_dims, layer.wq->ne, &rnd);
|
399 |
+
randomize_tensor_normal(layer.wk, layer.wk->n_dims, layer.wk->ne, &rnd);
|
400 |
+
randomize_tensor_normal(layer.wv, layer.wv->n_dims, layer.wv->ne, &rnd);
|
401 |
+
randomize_tensor_normal(layer.wo, layer.wo->n_dims, layer.wo->ne, &rnd);
|
402 |
+
|
403 |
+
randomize_tensor_normal(layer.ffn_norm, layer.ffn_norm->n_dims, layer.ffn_norm->ne, &rnd);
|
404 |
+
|
405 |
+
randomize_tensor_normal(layer.w1, layer.w1->n_dims, layer.w1->ne, &rnd);
|
406 |
+
randomize_tensor_normal(layer.w2, layer.w2->n_dims, layer.w2->ne, &rnd);
|
407 |
+
randomize_tensor_normal(layer.w3, layer.w3->n_dims, layer.w3->ne, &rnd);
|
408 |
+
}
|
409 |
+
}
|
410 |
+
|
411 |
+
|
412 |
+
void randomize_model_lora(struct llama_model_lora * model, int seed, float mean, float std, float min, float max) {
|
413 |
+
const auto & hparams = model->hparams;
|
414 |
+
|
415 |
+
const uint32_t n_layer = hparams.n_layer;
|
416 |
+
|
417 |
+
struct random_normal_distribution rnd;
|
418 |
+
init_random_normal_distribution(&rnd, seed, mean, std, min, max);
|
419 |
+
randomize_tensor_normal(model->tok_embeddings, model->tok_embeddings->n_dims, model->tok_embeddings->ne, &rnd);
|
420 |
+
randomize_tensor_normal(model->norm, model->norm->n_dims, model->norm->ne, &rnd);
|
421 |
+
randomize_tensor_normal(model->outputa, model->outputa->n_dims, model->outputa->ne, &rnd);
|
422 |
+
randomize_tensor_normal(model->outputb, model->outputb->n_dims, model->outputb->ne, &rnd);
|
423 |
+
|
424 |
+
for (uint32_t i = 0; i < n_layer; ++i) {
|
425 |
+
auto & layer = model->layers[i];
|
426 |
+
randomize_tensor_normal(layer.attention_norm, layer.attention_norm->n_dims, layer.attention_norm->ne, &rnd);
|
427 |
+
|
428 |
+
randomize_tensor_normal(layer.wqa, layer.wqa->n_dims, layer.wqa->ne, &rnd);
|
429 |
+
randomize_tensor_normal(layer.wqb, layer.wqb->n_dims, layer.wqb->ne, &rnd);
|
430 |
+
randomize_tensor_normal(layer.wka, layer.wka->n_dims, layer.wka->ne, &rnd);
|
431 |
+
randomize_tensor_normal(layer.wkb, layer.wkb->n_dims, layer.wkb->ne, &rnd);
|
432 |
+
randomize_tensor_normal(layer.wva, layer.wva->n_dims, layer.wva->ne, &rnd);
|
433 |
+
randomize_tensor_normal(layer.wvb, layer.wvb->n_dims, layer.wvb->ne, &rnd);
|
434 |
+
randomize_tensor_normal(layer.woa, layer.woa->n_dims, layer.woa->ne, &rnd);
|
435 |
+
randomize_tensor_normal(layer.wob, layer.wob->n_dims, layer.wob->ne, &rnd);
|
436 |
+
|
437 |
+
randomize_tensor_normal(layer.ffn_norm, layer.ffn_norm->n_dims, layer.ffn_norm->ne, &rnd);
|
438 |
+
|
439 |
+
randomize_tensor_normal(layer.w1, layer.w1->n_dims, layer.w1->ne, &rnd);
|
440 |
+
randomize_tensor_normal(layer.w2, layer.w2->n_dims, layer.w2->ne, &rnd);
|
441 |
+
randomize_tensor_normal(layer.w3, layer.w3->n_dims, layer.w3->ne, &rnd);
|
442 |
+
}
|
443 |
+
}
|
444 |
+
|
445 |
+
bool init_kv_cache(struct llama_kv_cache* cache, struct llama_model * model, int n_batch) {
|
446 |
+
const auto & hparams = model->hparams;
|
447 |
+
|
448 |
+
const uint32_t n_ctx = hparams.n_ctx;
|
449 |
+
const uint32_t n_embd = hparams.n_embd;
|
450 |
+
const uint32_t n_layer = hparams.n_layer;
|
451 |
+
|
452 |
+
const int64_t n_mem = n_layer*n_ctx*n_batch;
|
453 |
+
const int64_t n_elements = n_embd*n_mem;
|
454 |
+
|
455 |
+
// cache.buf.resize(2u*n_elements*ggml_type_size(wtype) + 2u*MB);
|
456 |
+
|
457 |
+
// struct ggml_init_params params;
|
458 |
+
// params.mem_size = cache.buf.size;
|
459 |
+
// params.mem_buffer = cache.buf.addr;
|
460 |
+
// params.no_alloc = false;
|
461 |
+
if (!cache->ctx) {
|
462 |
+
struct ggml_init_params params;
|
463 |
+
params.mem_size = 2u*n_elements*ggml_type_size(GGML_TYPE_F32) + 2u*1024*1024;
|
464 |
+
params.mem_buffer = NULL;
|
465 |
+
params.no_alloc = false;
|
466 |
+
|
467 |
+
cache->ctx = ggml_init(params);
|
468 |
+
|
469 |
+
if (!cache->ctx) {
|
470 |
+
fprintf(stderr, "%s: failed to allocate memory for kv cache\n", __func__);
|
471 |
+
return false;
|
472 |
+
}
|
473 |
+
}
|
474 |
+
|
475 |
+
cache->k = ggml_new_tensor_1d(cache->ctx, GGML_TYPE_F32, n_elements);
|
476 |
+
cache->v = ggml_new_tensor_1d(cache->ctx, GGML_TYPE_F32, n_elements);
|
477 |
+
|
478 |
+
return true;
|
479 |
+
}
|
480 |
+
|
481 |
+
bool init_kv_cache_lora(struct llama_kv_cache* cache, struct llama_model_lora * model, int n_batch) {
|
482 |
+
const auto & hparams = model->hparams;
|
483 |
+
|
484 |
+
const uint32_t n_ctx = hparams.n_ctx;
|
485 |
+
const uint32_t n_embd = hparams.n_embd;
|
486 |
+
const uint32_t n_layer = hparams.n_layer;
|
487 |
+
|
488 |
+
const int64_t n_mem = n_layer*n_ctx*n_batch;
|
489 |
+
const int64_t n_elements = n_embd*n_mem;
|
490 |
+
|
491 |
+
// cache.buf.resize(2u*n_elements*ggml_type_size(wtype) + 2u*MB);
|
492 |
+
|
493 |
+
// struct ggml_init_params params;
|
494 |
+
// params.mem_size = cache.buf.size;
|
495 |
+
// params.mem_buffer = cache.buf.addr;
|
496 |
+
// params.no_alloc = false;
|
497 |
+
if (!cache->ctx) {
|
498 |
+
struct ggml_init_params params;
|
499 |
+
params.mem_size = 2u*n_elements*ggml_type_size(GGML_TYPE_F32) + 2u*1024*1024;
|
500 |
+
params.mem_buffer = NULL;
|
501 |
+
params.no_alloc = false;
|
502 |
+
|
503 |
+
cache->ctx = ggml_init(params);
|
504 |
+
|
505 |
+
if (!cache->ctx) {
|
506 |
+
fprintf(stderr, "%s: failed to allocate memory for kv cache\n", __func__);
|
507 |
+
return false;
|
508 |
+
}
|
509 |
+
}
|
510 |
+
|
511 |
+
cache->k = ggml_new_tensor_1d(cache->ctx, GGML_TYPE_F32, n_elements);
|
512 |
+
cache->v = ggml_new_tensor_1d(cache->ctx, GGML_TYPE_F32, n_elements);
|
513 |
+
|
514 |
+
return true;
|
515 |
+
}
|
516 |
+
|
517 |
+
struct ggml_tensor * forward(
|
518 |
+
struct llama_model * model,
|
519 |
+
struct llama_kv_cache * cache,
|
520 |
+
struct ggml_context * ctx0,
|
521 |
+
struct ggml_cgraph * gf,
|
522 |
+
struct ggml_tensor * tokens_input,
|
523 |
+
const int n_tokens,
|
524 |
+
const int n_past) {
|
525 |
+
|
526 |
+
const int N = n_tokens;
|
527 |
+
|
528 |
+
struct llama_kv_cache& kv_self = *cache;
|
529 |
+
const auto & hparams = model->hparams;
|
530 |
+
const int n_ctx = hparams.n_ctx;
|
531 |
+
const int n_embd = hparams.n_embd;
|
532 |
+
const int n_layer = hparams.n_layer;
|
533 |
+
const int n_head = hparams.n_head;
|
534 |
+
const int n_rot = hparams.n_rot;
|
535 |
+
|
536 |
+
struct ggml_tensor * tokens = ggml_new_tensor_1d(ctx0, GGML_TYPE_I32, N);
|
537 |
+
memcpy(tokens->data, tokens_input->data, N*ggml_element_size(tokens));
|
538 |
+
|
539 |
+
struct ggml_tensor * kc = kv_self.k;
|
540 |
+
struct ggml_tensor * vc = kv_self.v;
|
541 |
+
|
542 |
+
// inpL shape [n_embd,N,1,1]
|
543 |
+
struct ggml_tensor * inpL = ggml_get_rows(ctx0, model->tok_embeddings, tokens);
|
544 |
+
for (int il = 0; il < n_layer; ++il) {
|
545 |
+
struct ggml_tensor * inpSA = inpL;
|
546 |
+
|
547 |
+
struct ggml_tensor * cur;
|
548 |
+
|
549 |
+
// lctx.use_buf(ctx0, 0);
|
550 |
+
|
551 |
+
// norm
|
552 |
+
{
|
553 |
+
// cur shape [n_embd,N,1,1]
|
554 |
+
cur = ggml_rms_norm(ctx0, inpL);
|
555 |
+
|
556 |
+
// cur = attention_norm*cur
|
557 |
+
cur = ggml_mul(ctx0,
|
558 |
+
ggml_repeat(ctx0, model->layers[il].attention_norm, cur),
|
559 |
+
cur);
|
560 |
+
}
|
561 |
+
|
562 |
+
// self-attention
|
563 |
+
{
|
564 |
+
// compute Q and K and RoPE them
|
565 |
+
// wq shape [n_embd, n_embd, 1, 1]
|
566 |
+
// wk shape [n_embd, n_embd, 1, 1]
|
567 |
+
// Qcur shape [n_embd/n_head, n_head, N, 1]
|
568 |
+
// Kcur shape [n_embd/n_head, n_head, N, 1]
|
569 |
+
struct ggml_tensor * Qcur = ggml_rope(ctx0, ggml_reshape_3d(ctx0, ggml_mul_mat(ctx0, model->layers[il].wq, cur), n_embd/n_head, n_head, N), n_past, n_rot, 0);
|
570 |
+
struct ggml_tensor * Kcur = ggml_rope(ctx0, ggml_reshape_3d(ctx0, ggml_mul_mat(ctx0, model->layers[il].wk, cur), n_embd/n_head, n_head, N), n_past, n_rot, 0);
|
571 |
+
|
572 |
+
// store key and value to memory
|
573 |
+
{
|
574 |
+
// compute the transposed [N, n_embd] V matrix
|
575 |
+
// wv shape [n_embd, n_embd, 1, 1]
|
576 |
+
// Vcur shape [n_embd, N, 1, 1]
|
577 |
+
struct ggml_tensor * Vcur = ggml_cont(ctx0, ggml_transpose(ctx0, ggml_reshape_2d(ctx0, ggml_mul_mat(ctx0, model->layers[il].wv, cur), n_embd, N)));
|
578 |
+
|
579 |
+
// kv_self.k shape [n_embd * n_ctx * n_layer, 1]
|
580 |
+
// kv_self.v shape [n_embd * n_ctx * n_layer, 1]
|
581 |
+
// k shape [n_embd * N, 1] == kv_self.k[:,n_past:n_past+N,il,0]
|
582 |
+
// v shape [N, n_embd, 1, 1] == kv_self.v[:,n_past:n_past+N,il,0]
|
583 |
+
|
584 |
+
/* {
|
585 |
+
struct ggml_tensor * k = ggml_view_1d(ctx0, kv_self.k, N*n_embd, (ggml_element_size(kv_self.k)*n_embd)*(il*n_ctx + n_past));
|
586 |
+
struct ggml_tensor * v = ggml_view_2d(ctx0, kv_self.v, N, n_embd,
|
587 |
+
( n_ctx)*ggml_element_size(kv_self.v),
|
588 |
+
(il*n_ctx)*ggml_element_size(kv_self.v)*n_embd + n_past*ggml_element_size(kv_self.v));
|
589 |
+
|
590 |
+
// important: storing RoPE-ed version of K in the KV cache!
|
591 |
+
ggml_build_forward_expand(gf, ggml_cpy(ctx0, Kcur, k));
|
592 |
+
ggml_build_forward_expand(gf, ggml_cpy(ctx0, Vcur, v));
|
593 |
+
} //*/
|
594 |
+
|
595 |
+
kc = ggml_set_1d(ctx0, kc, ggml_reshape_1d(ctx0, Kcur, n_embd*N), (ggml_element_size(kv_self.k)*n_embd)*(il*n_ctx + n_past));
|
596 |
+
vc = ggml_set_2d(ctx0, vc, Vcur, ( n_ctx)*ggml_element_size(kv_self.v),
|
597 |
+
(il*n_ctx)*ggml_element_size(kv_self.v)*n_embd + n_past*ggml_element_size(kv_self.v));
|
598 |
+
}
|
599 |
+
|
600 |
+
// Qcur shape [n_embd/n_head, n_head, N, 1]
|
601 |
+
// Q shape [n_embd/n_head, N, n_head, 1]
|
602 |
+
struct ggml_tensor * Q =
|
603 |
+
ggml_permute(ctx0,
|
604 |
+
Qcur,
|
605 |
+
0, 2, 1, 3);
|
606 |
+
|
607 |
+
// kv_self.k shape [n_embd * n_ctx * n_layer, 1]
|
608 |
+
// K shape [n_embd/n_head, n_past + N, n_head, 1]
|
609 |
+
struct ggml_tensor * K =
|
610 |
+
ggml_permute(ctx0,
|
611 |
+
ggml_reshape_3d(ctx0,
|
612 |
+
ggml_view_1d(ctx0, kc, (n_past + N)*n_embd, il*n_ctx*ggml_element_size(kc)*n_embd),
|
613 |
+
n_embd/n_head, n_head, n_past + N),
|
614 |
+
0, 2, 1, 3);
|
615 |
+
|
616 |
+
// K * Q
|
617 |
+
// KQ shape [n_past + N, N, n_head, 1]
|
618 |
+
struct ggml_tensor * KQ = ggml_mul_mat(ctx0, K, Q);
|
619 |
+
|
620 |
+
// KQ_scaled = KQ / sqrt(n_embd/n_head)
|
621 |
+
// KQ_scaled shape [n_past + N, N, n_head, 1]
|
622 |
+
struct ggml_tensor * KQ_scaled =
|
623 |
+
ggml_scale(ctx0,
|
624 |
+
KQ,
|
625 |
+
ggml_new_f32(ctx0, 1.0f/sqrtf(float(n_embd)/n_head)));
|
626 |
+
|
627 |
+
// KQ_masked = mask_past(KQ_scaled)
|
628 |
+
// KQ_masked shape [n_past + N, N, n_head, 1]
|
629 |
+
struct ggml_tensor * KQ_masked = ggml_diag_mask_inf(ctx0, KQ_scaled, n_past);
|
630 |
+
|
631 |
+
// KQ = soft_max(KQ_masked)
|
632 |
+
// KQ_soft_max shape [n_past + N, N, n_head, 1]
|
633 |
+
struct ggml_tensor * KQ_soft_max = ggml_soft_max(ctx0, KQ_masked);
|
634 |
+
|
635 |
+
// split cached V into n_head heads
|
636 |
+
//// V shape [n_past + N, n_embd/n_head, n_head, 1]
|
637 |
+
// V shape [n_past + N, n_embd/n_head, n_head, 1] == kv_self.v[:,:(n_past+N),il,1]
|
638 |
+
struct ggml_tensor * V =
|
639 |
+
ggml_view_3d(ctx0, vc,
|
640 |
+
n_past + N, n_embd/n_head, n_head,
|
641 |
+
n_ctx*ggml_element_size(vc),
|
642 |
+
n_ctx*ggml_element_size(vc)*n_embd/n_head,
|
643 |
+
il*n_ctx*ggml_element_size(vc)*n_embd);
|
644 |
+
|
645 |
+
// KQV shape [n_embd/n_head, N, n_head, 1]
|
646 |
+
struct ggml_tensor * KQV = ggml_mul_mat(ctx0, V, KQ_soft_max);
|
647 |
+
|
648 |
+
// KQV_merged = KQV.permute(0, 2, 1, 3)
|
649 |
+
// KQV_merged shape [n_embd/n_head, n_head, N, 1]
|
650 |
+
struct ggml_tensor * KQV_merged = ggml_permute(ctx0, KQV, 0, 2, 1, 3);
|
651 |
+
// KQV_merged shape
|
652 |
+
|
653 |
+
// cur = KQV_merged.contiguous().view(n_embd, N)
|
654 |
+
// cur shape [n_embd,N,1,1]
|
655 |
+
cur = ggml_reshape_2d(ctx0, ggml_cont(ctx0, KQV_merged), n_embd, N);
|
656 |
+
// cur = ggml_cpy(ctx0,
|
657 |
+
// KQV_merged,
|
658 |
+
// ggml_new_tensor_2d(ctx0, GGML_TYPE_F32, n_embd, N));
|
659 |
+
|
660 |
+
// projection (no bias)
|
661 |
+
// cur shape [n_embd,N,1,1]
|
662 |
+
cur = ggml_mul_mat(ctx0,
|
663 |
+
model->layers[il].wo,
|
664 |
+
cur);
|
665 |
+
}
|
666 |
+
|
667 |
+
// lctx.use_buf(ctx0, 1);
|
668 |
+
|
669 |
+
// inpFF shape [n_embd,N,1,1]
|
670 |
+
struct ggml_tensor * inpFF = ggml_add(ctx0, cur, inpSA);
|
671 |
+
|
672 |
+
// feed-forward network
|
673 |
+
{
|
674 |
+
// norm
|
675 |
+
{
|
676 |
+
// cur shape [n_embd,N,1,1]
|
677 |
+
cur = ggml_rms_norm(ctx0, inpFF);
|
678 |
+
|
679 |
+
// cur = ffn_norm*cur
|
680 |
+
// cur shape [n_embd,N,1,1]
|
681 |
+
cur = ggml_mul(ctx0,
|
682 |
+
ggml_repeat(ctx0, model->layers[il].ffn_norm, cur),
|
683 |
+
cur);
|
684 |
+
}
|
685 |
+
|
686 |
+
// tmp shape [n_ff,N,1,1]
|
687 |
+
struct ggml_tensor * tmp = ggml_mul_mat(ctx0,
|
688 |
+
model->layers[il].w3,
|
689 |
+
cur);
|
690 |
+
|
691 |
+
// cur shape [n_ff,N,1,1]
|
692 |
+
cur = ggml_mul_mat(ctx0,
|
693 |
+
model->layers[il].w1,
|
694 |
+
cur);
|
695 |
+
|
696 |
+
// SILU activation
|
697 |
+
// cur shape [n_ff,N,1,1]
|
698 |
+
cur = ggml_silu(ctx0, cur);
|
699 |
+
|
700 |
+
// cur shape [n_ff,N,1,1]
|
701 |
+
cur = ggml_mul(ctx0, cur, tmp);
|
702 |
+
|
703 |
+
// cur shape [n_embd,N,1,1]
|
704 |
+
cur = ggml_mul_mat(ctx0,
|
705 |
+
model->layers[il].w2,
|
706 |
+
cur);
|
707 |
+
}
|
708 |
+
|
709 |
+
// cur shape [n_embd,N,1,1]
|
710 |
+
cur = ggml_add(ctx0, cur, inpFF);
|
711 |
+
|
712 |
+
// input for next layer
|
713 |
+
// inpL shape [n_embd,N,1,1]
|
714 |
+
inpL = cur;
|
715 |
+
}
|
716 |
+
|
717 |
+
// norm
|
718 |
+
{
|
719 |
+
|
720 |
+
// inpL shape [n_embd,N,1,1]
|
721 |
+
inpL = ggml_rms_norm(ctx0, inpL);
|
722 |
+
|
723 |
+
// inpL = norm*inpL
|
724 |
+
// inpL shape [n_embd,N,1,1]
|
725 |
+
inpL = ggml_mul(ctx0,
|
726 |
+
ggml_repeat(ctx0, model->norm, inpL),
|
727 |
+
inpL);
|
728 |
+
|
729 |
+
//embeddings = inpL;
|
730 |
+
}
|
731 |
+
|
732 |
+
// lm_head
|
733 |
+
// inpL shape [n_vocab,N,1,1]
|
734 |
+
inpL = ggml_mul_mat(ctx0, model->output, inpL);
|
735 |
+
|
736 |
+
// run the computation
|
737 |
+
ggml_build_forward_expand(gf, inpL);
|
738 |
+
|
739 |
+
return inpL;
|
740 |
+
}
|
741 |
+
|
742 |
+
void assert_shape_1d(struct ggml_tensor * tensor, int64_t ne0) {
|
743 |
+
GGML_ASSERT(tensor->n_dims == 1);
|
744 |
+
GGML_ASSERT(tensor->ne[0] == ne0);
|
745 |
+
}
|
746 |
+
|
747 |
+
void assert_shape_2d(struct ggml_tensor * tensor, int64_t ne0, int64_t ne1) {
|
748 |
+
GGML_ASSERT(tensor->n_dims == 2);
|
749 |
+
GGML_ASSERT(tensor->ne[0] == ne0);
|
750 |
+
GGML_ASSERT(tensor->ne[1] == ne1);
|
751 |
+
}
|
752 |
+
|
753 |
+
void assert_shape_3d(struct ggml_tensor * tensor, int64_t ne0, int64_t ne1, int64_t ne2) {
|
754 |
+
GGML_ASSERT(tensor->n_dims == 3);
|
755 |
+
GGML_ASSERT(tensor->ne[0] == ne0);
|
756 |
+
GGML_ASSERT(tensor->ne[1] == ne1);
|
757 |
+
GGML_ASSERT(tensor->ne[2] == ne2);
|
758 |
+
}
|
759 |
+
|
760 |
+
void assert_shape_4d(struct ggml_tensor * tensor, int64_t ne0, int64_t ne1, int64_t ne2, int64_t ne3) {
|
761 |
+
GGML_ASSERT(tensor->n_dims == 4);
|
762 |
+
GGML_ASSERT(tensor->ne[0] == ne0);
|
763 |
+
GGML_ASSERT(tensor->ne[1] == ne1);
|
764 |
+
GGML_ASSERT(tensor->ne[2] == ne2);
|
765 |
+
GGML_ASSERT(tensor->ne[3] == ne3);
|
766 |
+
}
|
767 |
+
|
768 |
+
struct ggml_tensor * forward_batch(
|
769 |
+
struct llama_model * model,
|
770 |
+
struct llama_kv_cache * cache,
|
771 |
+
struct ggml_context * ctx0,
|
772 |
+
struct ggml_cgraph * gf,
|
773 |
+
struct ggml_tensor * tokens_input,
|
774 |
+
const int n_tokens,
|
775 |
+
const int n_past,
|
776 |
+
const int n_batch) {
|
777 |
+
|
778 |
+
const int N = n_tokens;
|
779 |
+
|
780 |
+
struct llama_kv_cache& kv_self = *cache;
|
781 |
+
const auto & hparams = model->hparams;
|
782 |
+
const int n_ctx = hparams.n_ctx;
|
783 |
+
const int n_vocab = hparams.n_vocab;
|
784 |
+
const int n_embd = hparams.n_embd;
|
785 |
+
const int n_layer = hparams.n_layer;
|
786 |
+
const int n_head = hparams.n_head;
|
787 |
+
const int n_rot = hparams.n_rot;
|
788 |
+
const int n_ff = get_n_ff(&hparams);
|
789 |
+
|
790 |
+
struct ggml_tensor * tokens = ggml_new_tensor_1d(ctx0, GGML_TYPE_I32, N*n_batch);
|
791 |
+
memcpy(tokens->data, tokens_input->data, ggml_element_size(tokens)*N*n_batch);
|
792 |
+
|
793 |
+
struct ggml_tensor * kc = kv_self.k;
|
794 |
+
struct ggml_tensor * vc = kv_self.v;
|
795 |
+
|
796 |
+
// inpL shape [n_embd,N*n_batch,1]
|
797 |
+
struct ggml_tensor * inpL = ggml_get_rows(ctx0, model->tok_embeddings, tokens);
|
798 |
+
assert_shape_2d(inpL, n_embd, N*n_batch);
|
799 |
+
for (int il = 0; il < n_layer; ++il) {
|
800 |
+
struct ggml_tensor * inpSA = inpL;
|
801 |
+
|
802 |
+
struct ggml_tensor * cur;
|
803 |
+
|
804 |
+
// lctx.use_buf(ctx0, 0);
|
805 |
+
|
806 |
+
// norm
|
807 |
+
{
|
808 |
+
// cur shape [n_embd,N*n_batch,1,1]
|
809 |
+
cur = ggml_rms_norm(ctx0, inpL);
|
810 |
+
assert_shape_2d(cur, n_embd, N*n_batch);
|
811 |
+
|
812 |
+
// cur = attention_norm*cur
|
813 |
+
cur = ggml_mul(ctx0,
|
814 |
+
ggml_repeat(ctx0, model->layers[il].attention_norm, cur),
|
815 |
+
cur);
|
816 |
+
assert_shape_2d(cur, n_embd, N*n_batch);
|
817 |
+
}
|
818 |
+
|
819 |
+
// self-attention
|
820 |
+
{
|
821 |
+
// compute Q and K and RoPE them
|
822 |
+
// wq shape [n_embd, n_embd, 1, 1]
|
823 |
+
// wk shape [n_embd, n_embd, 1, 1]
|
824 |
+
// Qcur shape [n_embd/n_head, n_head, N, n_batch]
|
825 |
+
// Kcur shape [n_embd/n_head, n_head, N, n_batch]
|
826 |
+
struct ggml_tensor * Qcur = ggml_rope(ctx0, ggml_reshape_4d(ctx0, ggml_mul_mat(ctx0, model->layers[il].wq, cur), n_embd/n_head, n_head, N, n_batch), n_past, n_rot, 0);
|
827 |
+
struct ggml_tensor * Kcur = ggml_rope(ctx0, ggml_reshape_4d(ctx0, ggml_mul_mat(ctx0, model->layers[il].wk, cur), n_embd/n_head, n_head, N, n_batch), n_past, n_rot, 0);
|
828 |
+
assert_shape_4d(Qcur, n_embd/n_head, n_head, N, n_batch);
|
829 |
+
assert_shape_4d(Kcur, n_embd/n_head, n_head, N, n_batch);
|
830 |
+
|
831 |
+
// store key and value to memory
|
832 |
+
{
|
833 |
+
// compute the transposed [N, n_embd] V matrix
|
834 |
+
// wv shape [n_embd, n_embd, 1, 1]
|
835 |
+
// Vcur shape [N, n_embd, n_batch, 1]
|
836 |
+
struct ggml_tensor * Vcur = ggml_cont(ctx0,
|
837 |
+
ggml_permute(ctx0,
|
838 |
+
ggml_reshape_3d(ctx0,
|
839 |
+
ggml_mul_mat(ctx0,
|
840 |
+
model->layers[il].wv,
|
841 |
+
cur),
|
842 |
+
n_embd, N, n_batch),
|
843 |
+
1, 0, 2, 3));
|
844 |
+
|
845 |
+
assert_shape_3d(Vcur, N, n_embd, n_batch);
|
846 |
+
|
847 |
+
// kv_self.k shape [n_embd * n_ctx * n_batch * n_layer]
|
848 |
+
// kv_self.v shape [n_ctx * n_embd * n_batch * n_layer]
|
849 |
+
// k shape [n_embd * N, n_batch] == kv_self.k[:,n_past:n_past+N,:,il]
|
850 |
+
// v shape [N, n_embd, n_batch, 1] == kv_self.v[:,n_past:n_past+N,:,il]
|
851 |
+
|
852 |
+
/* {
|
853 |
+
struct ggml_tensor * k = ggml_view_1d(ctx0, kv_self.k, N*n_embd, (ggml_element_size(kv_self.k)*n_embd)*(il*n_ctx + n_past));
|
854 |
+
struct ggml_tensor * v = ggml_view_2d(ctx0, kv_self.v, N, n_embd,
|
855 |
+
( n_ctx)*ggml_element_size(kv_self.v),
|
856 |
+
(il*n_ctx)*ggml_element_size(kv_self.v)*n_embd + n_past*ggml_element_size(kv_self.v));
|
857 |
+
|
858 |
+
// important: storing RoPE-ed version of K in the KV cache!
|
859 |
+
ggml_build_forward_expand(gf, ggml_cpy(ctx0, Kcur, k));
|
860 |
+
ggml_build_forward_expand(gf, ggml_cpy(ctx0, Vcur, v));
|
861 |
+
} //*/
|
862 |
+
|
863 |
+
kc = ggml_set_2d(ctx0, kc,
|
864 |
+
ggml_reshape_2d(ctx0, Kcur, n_embd*N, n_batch),
|
865 |
+
ggml_element_size(kc)*n_embd*n_ctx,
|
866 |
+
(ggml_element_size(kc)*n_embd)*(il*n_batch*n_ctx + n_past));
|
867 |
+
vc = ggml_set_2d(ctx0, vc,
|
868 |
+
ggml_reshape_2d(ctx0, Vcur, N*n_embd, n_batch),
|
869 |
+
ggml_element_size(vc)*n_ctx*n_embd,
|
870 |
+
ggml_element_size(vc)*(n_past + il*n_embd*n_batch*n_ctx));
|
871 |
+
|
872 |
+
assert_shape_1d(kc, n_embd * n_ctx * n_batch * n_layer);
|
873 |
+
assert_shape_1d(vc, n_embd * n_ctx * n_batch * n_layer);
|
874 |
+
}
|
875 |
+
|
876 |
+
// Qcur shape [n_embd/n_head, n_head, N, n_batch]
|
877 |
+
// Q shape [n_embd/n_head, N, n_head, n_batch]
|
878 |
+
struct ggml_tensor * Q =
|
879 |
+
ggml_permute(ctx0,
|
880 |
+
Qcur,
|
881 |
+
0, 2, 1, 3);
|
882 |
+
assert_shape_4d(Q, n_embd/n_head, N, n_head, n_batch);
|
883 |
+
|
884 |
+
// kv_self.k shape [n_embd * n_ctx * n_batch * n_layer]
|
885 |
+
// K shape [n_embd/n_head, n_past + N, n_head, n_batch]
|
886 |
+
struct ggml_tensor * K =
|
887 |
+
ggml_permute(ctx0,
|
888 |
+
ggml_reshape_4d(ctx0,
|
889 |
+
ggml_view_3d(ctx0,
|
890 |
+
kc,
|
891 |
+
n_embd,
|
892 |
+
(n_past + N),
|
893 |
+
n_batch,
|
894 |
+
n_embd*ggml_element_size(kc),
|
895 |
+
n_ctx*n_embd*ggml_element_size(kc),
|
896 |
+
il*n_batch*n_ctx*n_embd*ggml_element_size(kc)),
|
897 |
+
n_embd/n_head, n_head, n_past + N, n_batch),
|
898 |
+
0, 2, 1, 3);
|
899 |
+
assert_shape_4d(K, n_embd/n_head, n_past + N, n_head, n_batch);
|
900 |
+
|
901 |
+
// K * Q
|
902 |
+
// KQ shape [n_past + N, N, n_head, n_batch]
|
903 |
+
struct ggml_tensor * KQ = ggml_mul_mat(ctx0, K, Q);
|
904 |
+
assert_shape_4d(KQ, n_past + N, N, n_head, n_batch);
|
905 |
+
|
906 |
+
// KQ_scaled = KQ / sqrt(n_embd/n_head)
|
907 |
+
// KQ_scaled shape [n_past + N, N, n_head, n_batch]
|
908 |
+
struct ggml_tensor * KQ_scaled =
|
909 |
+
ggml_scale(ctx0,
|
910 |
+
KQ,
|
911 |
+
ggml_new_f32(ctx0, 1.0f/sqrtf(float(n_embd)/n_head)));
|
912 |
+
assert_shape_4d(KQ_scaled, n_past + N, N, n_head, n_batch);
|
913 |
+
|
914 |
+
// KQ_masked = mask_past(KQ_scaled)
|
915 |
+
// KQ_masked shape [n_past + N, N, n_head, n_batch]
|
916 |
+
struct ggml_tensor * KQ_masked = ggml_diag_mask_inf(ctx0, KQ_scaled, n_past);
|
917 |
+
assert_shape_4d(KQ_masked, n_past + N, N, n_head, n_batch);
|
918 |
+
|
919 |
+
// KQ = soft_max(KQ_masked)
|
920 |
+
// KQ_soft_max shape [n_past + N, N, n_head, n_batch]
|
921 |
+
struct ggml_tensor * KQ_soft_max = ggml_soft_max(ctx0, KQ_masked);
|
922 |
+
assert_shape_4d(KQ_soft_max, n_past + N, N, n_head, n_batch);
|
923 |
+
|
924 |
+
// split cached V into n_head heads
|
925 |
+
// kv_self.v shape [n_ctx * n_embd * n_batch * n_layer]
|
926 |
+
// V shape [n_past + N, n_embd/n_head, n_head, n_batch] == kv_self.v[:(n_past+N),:,:,il]
|
927 |
+
struct ggml_tensor * V =
|
928 |
+
ggml_view_4d(ctx0, vc,
|
929 |
+
n_past + N, n_embd/n_head, n_head, n_batch,
|
930 |
+
ggml_element_size(vc)*n_ctx,
|
931 |
+
ggml_element_size(vc)*n_ctx*n_embd/n_head,
|
932 |
+
ggml_element_size(vc)*n_ctx*n_embd,
|
933 |
+
il*n_batch*n_ctx*n_embd*ggml_element_size(vc));
|
934 |
+
assert_shape_4d(V, n_past + N, n_embd/n_head, n_head, n_batch);
|
935 |
+
|
936 |
+
// KQV shape [n_embd/n_head, N, n_head, n_batch]
|
937 |
+
struct ggml_tensor * KQV = ggml_mul_mat(ctx0, V, KQ_soft_max);
|
938 |
+
assert_shape_4d(KQV, n_embd/n_head, N, n_head, n_batch);
|
939 |
+
|
940 |
+
// KQV_merged = KQV.permute(0, 2, 1, 3)
|
941 |
+
// KQV_merged shape [n_embd/n_head, n_head, N, n_batch]
|
942 |
+
struct ggml_tensor * KQV_merged = ggml_permute(ctx0, KQV, 0, 2, 1, 3);
|
943 |
+
assert_shape_4d(KQV_merged, n_embd/n_head, n_head, N, n_batch);
|
944 |
+
// KQV_merged shape
|
945 |
+
|
946 |
+
// cur = KQV_merged.contiguous().view(n_embd, N)
|
947 |
+
// cur shape [n_embd,N*n_batch,1,1]
|
948 |
+
cur = ggml_reshape_2d(ctx0, ggml_cont(ctx0, KQV_merged), n_embd, N*n_batch);
|
949 |
+
assert_shape_2d(cur, n_embd, N*n_batch);
|
950 |
+
// cur = ggml_cpy(ctx0,
|
951 |
+
// KQV_merged,
|
952 |
+
// ggml_new_tensor_2d(ctx0, GGML_TYPE_F32, n_embd, N));
|
953 |
+
|
954 |
+
// projection (no bias)
|
955 |
+
// cur shape [n_embd,N*n_batch,1,1]
|
956 |
+
cur = ggml_mul_mat(ctx0,
|
957 |
+
model->layers[il].wo,
|
958 |
+
cur);
|
959 |
+
assert_shape_2d(cur, n_embd, N*n_batch);
|
960 |
+
}
|
961 |
+
|
962 |
+
// lctx.use_buf(ctx0, 1);
|
963 |
+
|
964 |
+
// inpFF shape [n_embd,N*n_batch,1,1]
|
965 |
+
struct ggml_tensor * inpFF = ggml_add(ctx0, cur, inpSA);
|
966 |
+
assert_shape_2d(inpFF, n_embd, N*n_batch);
|
967 |
+
|
968 |
+
// feed-forward network
|
969 |
+
{
|
970 |
+
// norm
|
971 |
+
{
|
972 |
+
// cur shape [n_embd,N*n_batch,1,1]
|
973 |
+
cur = ggml_rms_norm(ctx0, inpFF);
|
974 |
+
assert_shape_2d(cur, n_embd, N*n_batch);
|
975 |
+
|
976 |
+
// cur = ffn_norm*cur
|
977 |
+
// cur shape [n_embd,N*n_batch,1,1]
|
978 |
+
cur = ggml_mul(ctx0,
|
979 |
+
ggml_repeat(ctx0, model->layers[il].ffn_norm, cur),
|
980 |
+
cur);
|
981 |
+
assert_shape_2d(cur, n_embd, N*n_batch);
|
982 |
+
}
|
983 |
+
|
984 |
+
// tmp shape [n_ff,N*n_batch,1,1]
|
985 |
+
struct ggml_tensor * tmp = ggml_mul_mat(ctx0,
|
986 |
+
model->layers[il].w3,
|
987 |
+
cur);
|
988 |
+
assert_shape_2d(tmp, n_ff, N*n_batch);
|
989 |
+
|
990 |
+
// cur shape [n_ff,N*n_batch,1,1]
|
991 |
+
cur = ggml_mul_mat(ctx0,
|
992 |
+
model->layers[il].w1,
|
993 |
+
cur);
|
994 |
+
assert_shape_2d(cur, n_ff, N*n_batch);
|
995 |
+
|
996 |
+
// SILU activation
|
997 |
+
// cur shape [n_ff,N*n_batch,1,1]
|
998 |
+
cur = ggml_silu(ctx0, cur);
|
999 |
+
assert_shape_2d(cur, n_ff, N*n_batch);
|
1000 |
+
|
1001 |
+
// cur shape [n_ff,N*n_batch,1,1]
|
1002 |
+
cur = ggml_mul(ctx0, cur, tmp);
|
1003 |
+
assert_shape_2d(cur, n_ff, N*n_batch);
|
1004 |
+
|
1005 |
+
// cur shape [n_embd,N*n_batch,1,1]
|
1006 |
+
cur = ggml_mul_mat(ctx0,
|
1007 |
+
model->layers[il].w2,
|
1008 |
+
cur);
|
1009 |
+
assert_shape_2d(cur, n_embd, N*n_batch);
|
1010 |
+
}
|
1011 |
+
|
1012 |
+
// cur shape [n_embd,N*n_batch,1,1]
|
1013 |
+
cur = ggml_add(ctx0, cur, inpFF);
|
1014 |
+
assert_shape_2d(cur, n_embd, N*n_batch);
|
1015 |
+
|
1016 |
+
// input for next layer
|
1017 |
+
// inpL shape [n_embd,N*n_batch,1,1]
|
1018 |
+
inpL = cur;
|
1019 |
+
assert_shape_2d(inpL, n_embd, N*n_batch);
|
1020 |
+
}
|
1021 |
+
|
1022 |
+
// norm
|
1023 |
+
{
|
1024 |
+
|
1025 |
+
// inpL shape [n_embd,N*n_batch,1,1]
|
1026 |
+
inpL = ggml_rms_norm(ctx0, inpL);
|
1027 |
+
assert_shape_2d(inpL, n_embd, N*n_batch);
|
1028 |
+
|
1029 |
+
// inpL = norm*inpL
|
1030 |
+
// inpL shape [n_embd,N*n_batch,1,1]
|
1031 |
+
inpL = ggml_mul(ctx0,
|
1032 |
+
ggml_repeat(ctx0, model->norm, inpL),
|
1033 |
+
inpL);
|
1034 |
+
|
1035 |
+
assert_shape_2d(inpL, n_embd, N*n_batch);
|
1036 |
+
|
1037 |
+
//embeddings = inpL;
|
1038 |
+
}
|
1039 |
+
|
1040 |
+
// lm_head
|
1041 |
+
// inpL shape [n_vocab,N*n_batch,1,1]
|
1042 |
+
inpL = ggml_mul_mat(ctx0, model->output, inpL);
|
1043 |
+
assert_shape_2d(inpL, n_vocab, N*n_batch);
|
1044 |
+
|
1045 |
+
{
|
1046 |
+
// inpL shape [n_vocab,N,n_batch,1]
|
1047 |
+
inpL = ggml_reshape_3d(ctx0,
|
1048 |
+
inpL,
|
1049 |
+
n_vocab, N, n_batch);
|
1050 |
+
assert_shape_3d(inpL, n_vocab, N, n_batch);
|
1051 |
+
}
|
1052 |
+
|
1053 |
+
// run the computation
|
1054 |
+
ggml_build_forward_expand(gf, inpL);
|
1055 |
+
|
1056 |
+
return inpL;
|
1057 |
+
}
|
1058 |
+
|
1059 |
+
|
1060 |
+
struct ggml_tensor * forward_lora(
|
1061 |
+
struct llama_model_lora * model,
|
1062 |
+
struct llama_kv_cache * cache,
|
1063 |
+
struct ggml_context * ctx0,
|
1064 |
+
struct ggml_cgraph * gf,
|
1065 |
+
struct ggml_tensor * tokens_input,
|
1066 |
+
const int n_tokens,
|
1067 |
+
const int n_past) {
|
1068 |
+
|
1069 |
+
const int N = n_tokens;
|
1070 |
+
|
1071 |
+
struct llama_kv_cache& kv_self = *cache;
|
1072 |
+
const auto & hparams = model->hparams;
|
1073 |
+
|
1074 |
+
const int n_ctx = hparams.n_ctx;
|
1075 |
+
const int n_embd = hparams.n_embd;
|
1076 |
+
const int n_layer = hparams.n_layer;
|
1077 |
+
const int n_head = hparams.n_head;
|
1078 |
+
const int n_rot = hparams.n_rot;
|
1079 |
+
|
1080 |
+
struct ggml_tensor * tokens = ggml_new_tensor_1d(ctx0, GGML_TYPE_I32, N);
|
1081 |
+
memcpy(tokens->data, tokens_input->data, N*ggml_element_size(tokens));
|
1082 |
+
|
1083 |
+
struct ggml_tensor * kc = kv_self.k;
|
1084 |
+
struct ggml_tensor * vc = kv_self.v;
|
1085 |
+
|
1086 |
+
// inpL shape [n_embd,N,1,1]
|
1087 |
+
struct ggml_tensor * inpL = ggml_get_rows(ctx0, model->tok_embeddings, tokens);
|
1088 |
+
for (int il = 0; il < n_layer; ++il) {
|
1089 |
+
struct ggml_tensor * inpSA = inpL;
|
1090 |
+
|
1091 |
+
struct ggml_tensor * cur;
|
1092 |
+
|
1093 |
+
// norm
|
1094 |
+
{
|
1095 |
+
// cur shape [n_embd,N,1,1]
|
1096 |
+
cur = ggml_rms_norm(ctx0, inpL);
|
1097 |
+
|
1098 |
+
// cur = attention_norm*cur
|
1099 |
+
cur = ggml_mul(ctx0,
|
1100 |
+
ggml_repeat(ctx0, model->layers[il].attention_norm, cur),
|
1101 |
+
cur);
|
1102 |
+
}
|
1103 |
+
|
1104 |
+
// self-attention
|
1105 |
+
{
|
1106 |
+
// compute Q and K and RoPE them
|
1107 |
+
// wq shape [n_embd, n_embd, 1, 1]
|
1108 |
+
// wk shape [n_embd, n_embd, 1, 1]
|
1109 |
+
// Qcur shape [n_embd/n_head, n_head, N, 1]
|
1110 |
+
// Kcur shape [n_embd/n_head, n_head, N, 1]
|
1111 |
+
struct ggml_tensor * Qcur = ggml_rope(ctx0,
|
1112 |
+
ggml_reshape_3d(ctx0,
|
1113 |
+
ggml_mul_mat(ctx0,
|
1114 |
+
model->layers[il].wqa,
|
1115 |
+
ggml_mul_mat(ctx0,
|
1116 |
+
model->layers[il].wqb,
|
1117 |
+
cur)),
|
1118 |
+
n_embd/n_head, n_head, N),
|
1119 |
+
n_past, n_rot, 0);
|
1120 |
+
struct ggml_tensor * Kcur = ggml_rope(ctx0,
|
1121 |
+
ggml_reshape_3d(ctx0,
|
1122 |
+
ggml_mul_mat(ctx0,
|
1123 |
+
model->layers[il].wka,
|
1124 |
+
ggml_mul_mat(ctx0,
|
1125 |
+
model->layers[il].wkb,
|
1126 |
+
cur)),
|
1127 |
+
n_embd/n_head, n_head, N),
|
1128 |
+
n_past, n_rot, 0);
|
1129 |
+
|
1130 |
+
// store key and value to memory
|
1131 |
+
{
|
1132 |
+
// compute the transposed [N, n_embd] V matrix
|
1133 |
+
// wv shape [n_embd, n_embd, 1, 1]
|
1134 |
+
// Vcur shape [n_embd, N, 1, 1]
|
1135 |
+
struct ggml_tensor * Vcur = ggml_cont(ctx0,
|
1136 |
+
ggml_transpose(ctx0,
|
1137 |
+
ggml_reshape_2d(ctx0,
|
1138 |
+
ggml_mul_mat(ctx0,
|
1139 |
+
model->layers[il].wva,
|
1140 |
+
ggml_mul_mat(ctx0,
|
1141 |
+
model->layers[il].wvb,
|
1142 |
+
cur)),
|
1143 |
+
n_embd, N)));
|
1144 |
+
|
1145 |
+
// kv_self.k shape [n_embd * n_ctx * n_layer, 1]
|
1146 |
+
// kv_self.v shape [n_embd * n_ctx * n_layer, 1]
|
1147 |
+
// k shape [n_embd * N, 1] == kv_self.k[:,n_past:n_past+N,il,0]
|
1148 |
+
// v shape [N, n_embd, 1, 1] == kv_self.v[:,n_past:n_past+N,il,0]
|
1149 |
+
|
1150 |
+
/* {
|
1151 |
+
struct ggml_tensor * k = ggml_view_1d(ctx0, kv_self.k, N*n_embd, (ggml_element_size(kv_self.k)*n_embd)*(il*n_ctx + n_past));
|
1152 |
+
struct ggml_tensor * v = ggml_view_2d(ctx0, kv_self.v, N, n_embd,
|
1153 |
+
( n_ctx)*ggml_element_size(kv_self.v),
|
1154 |
+
(il*n_ctx)*ggml_element_size(kv_self.v)*n_embd + n_past*ggml_element_size(kv_self.v));
|
1155 |
+
|
1156 |
+
// important: storing RoPE-ed version of K in the KV cache!
|
1157 |
+
ggml_build_forward_expand(gf, ggml_cpy(ctx0, Kcur, k));
|
1158 |
+
ggml_build_forward_expand(gf, ggml_cpy(ctx0, Vcur, v));
|
1159 |
+
} //*/
|
1160 |
+
|
1161 |
+
kc = ggml_set_1d(ctx0, kc, ggml_reshape_1d(ctx0, Kcur, n_embd*N), (ggml_element_size(kv_self.k)*n_embd)*(il*n_ctx + n_past));
|
1162 |
+
vc = ggml_set_2d(ctx0, vc, Vcur, ( n_ctx)*ggml_element_size(kv_self.v),
|
1163 |
+
(il*n_ctx)*ggml_element_size(kv_self.v)*n_embd + n_past*ggml_element_size(kv_self.v));
|
1164 |
+
}
|
1165 |
+
|
1166 |
+
// Qcur shape [n_embd/n_head, n_head, N, 1]
|
1167 |
+
// Q shape [n_embd/n_head, N, n_head, 1]
|
1168 |
+
struct ggml_tensor * Q =
|
1169 |
+
ggml_permute(ctx0,
|
1170 |
+
Qcur,
|
1171 |
+
0, 2, 1, 3);
|
1172 |
+
|
1173 |
+
// kv_self.k shape [n_embd * n_ctx * n_layer, 1]
|
1174 |
+
// K shape [n_embd/n_head, n_past + N, n_head, 1]
|
1175 |
+
struct ggml_tensor * K =
|
1176 |
+
ggml_permute(ctx0,
|
1177 |
+
ggml_reshape_3d(ctx0,
|
1178 |
+
ggml_view_1d(ctx0, kc, (n_past + N)*n_embd, il*n_ctx*ggml_element_size(kc)*n_embd),
|
1179 |
+
n_embd/n_head, n_head, n_past + N),
|
1180 |
+
0, 2, 1, 3);
|
1181 |
+
|
1182 |
+
// K * Q
|
1183 |
+
// KQ shape [n_past + N, N, n_head, 1]
|
1184 |
+
struct ggml_tensor * KQ = ggml_mul_mat(ctx0, K, Q);
|
1185 |
+
|
1186 |
+
// KQ_scaled = KQ / sqrt(n_embd/n_head)
|
1187 |
+
// KQ_scaled shape [n_past + N, N, n_head, 1]
|
1188 |
+
struct ggml_tensor * KQ_scaled =
|
1189 |
+
ggml_scale(ctx0,
|
1190 |
+
KQ,
|
1191 |
+
ggml_new_f32(ctx0, 1.0f/sqrtf(float(n_embd)/n_head)));
|
1192 |
+
|
1193 |
+
// KQ_masked = mask_past(KQ_scaled)
|
1194 |
+
// KQ_masked shape [n_past + N, N, n_head, 1]
|
1195 |
+
struct ggml_tensor * KQ_masked = ggml_diag_mask_inf(ctx0, KQ_scaled, n_past);
|
1196 |
+
|
1197 |
+
// KQ = soft_max(KQ_masked)
|
1198 |
+
// KQ_soft_max shape [n_past + N, N, n_head, 1]
|
1199 |
+
struct ggml_tensor * KQ_soft_max = ggml_soft_max(ctx0, KQ_masked);
|
1200 |
+
|
1201 |
+
// split cached V into n_head heads
|
1202 |
+
//// V shape [n_past + N, n_embd/n_head, n_head, 1]
|
1203 |
+
// V shape [n_past + N, n_embd/n_head, n_head, 1] == kv_self.v[:,:(n_past+N),il,1]
|
1204 |
+
struct ggml_tensor * V =
|
1205 |
+
ggml_view_3d(ctx0, vc,
|
1206 |
+
n_past + N, n_embd/n_head, n_head,
|
1207 |
+
n_ctx*ggml_element_size(vc),
|
1208 |
+
n_ctx*ggml_element_size(vc)*n_embd/n_head,
|
1209 |
+
il*n_ctx*ggml_element_size(vc)*n_embd);
|
1210 |
+
|
1211 |
+
// KQV shape [n_embd/n_head, N, n_head, 1]
|
1212 |
+
struct ggml_tensor * KQV = ggml_mul_mat(ctx0, V, KQ_soft_max);
|
1213 |
+
|
1214 |
+
// KQV_merged = KQV.permute(0, 2, 1, 3)
|
1215 |
+
// KQV_merged shape [n_embd/n_head, n_head, N, 1]
|
1216 |
+
struct ggml_tensor * KQV_merged = ggml_permute(ctx0, KQV, 0, 2, 1, 3);
|
1217 |
+
// KQV_merged shape
|
1218 |
+
|
1219 |
+
// cur = KQV_merged.contiguous().view(n_embd, N)
|
1220 |
+
// cur shape [n_embd,N,1,1]
|
1221 |
+
cur = ggml_reshape_2d(ctx0, ggml_cont(ctx0, KQV_merged), n_embd, N);
|
1222 |
+
// cur = ggml_cpy(ctx0,
|
1223 |
+
// KQV_merged,
|
1224 |
+
// ggml_new_tensor_2d(ctx0, GGML_TYPE_F32, n_embd, N));
|
1225 |
+
|
1226 |
+
// projection (no bias)
|
1227 |
+
// cur shape [n_embd,N,1,1]
|
1228 |
+
cur = ggml_mul_mat(ctx0,
|
1229 |
+
model->layers[il].woa,
|
1230 |
+
ggml_mul_mat(ctx0,
|
1231 |
+
model->layers[il].wob,
|
1232 |
+
cur));
|
1233 |
+
}
|
1234 |
+
|
1235 |
+
// inpFF shape [n_embd,N,1,1]
|
1236 |
+
struct ggml_tensor * inpFF = ggml_add(ctx0, cur, inpSA);
|
1237 |
+
|
1238 |
+
// feed-forward network
|
1239 |
+
{
|
1240 |
+
// norm
|
1241 |
+
{
|
1242 |
+
// cur shape [n_embd,N,1,1]
|
1243 |
+
cur = ggml_rms_norm(ctx0, inpFF);
|
1244 |
+
|
1245 |
+
// cur = ffn_norm*cur
|
1246 |
+
// cur shape [n_embd,N,1,1]
|
1247 |
+
cur = ggml_mul(ctx0,
|
1248 |
+
ggml_repeat(ctx0, model->layers[il].ffn_norm, cur),
|
1249 |
+
cur);
|
1250 |
+
}
|
1251 |
+
|
1252 |
+
// tmp shape [n_ff,N,1,1]
|
1253 |
+
struct ggml_tensor * tmp = ggml_mul_mat(ctx0,
|
1254 |
+
model->layers[il].w3,
|
1255 |
+
cur);
|
1256 |
+
|
1257 |
+
// cur shape [n_ff,N,1,1]
|
1258 |
+
cur = ggml_mul_mat(ctx0,
|
1259 |
+
model->layers[il].w1,
|
1260 |
+
cur);
|
1261 |
+
|
1262 |
+
// SILU activation
|
1263 |
+
// cur shape [n_ff,N,1,1]
|
1264 |
+
cur = ggml_silu(ctx0, cur);
|
1265 |
+
|
1266 |
+
// cur shape [n_ff,N,1,1]
|
1267 |
+
cur = ggml_mul(ctx0, cur, tmp);
|
1268 |
+
|
1269 |
+
// cur shape [n_embd,N,1,1]
|
1270 |
+
cur = ggml_mul_mat(ctx0,
|
1271 |
+
model->layers[il].w2,
|
1272 |
+
cur);
|
1273 |
+
}
|
1274 |
+
|
1275 |
+
// cur shape [n_embd,N,1,1]
|
1276 |
+
cur = ggml_add(ctx0, cur, inpFF);
|
1277 |
+
|
1278 |
+
// input for next layer
|
1279 |
+
// inpL shape [n_embd,N,1,1]
|
1280 |
+
inpL = cur;
|
1281 |
+
}
|
1282 |
+
|
1283 |
+
// norm
|
1284 |
+
{
|
1285 |
+
|
1286 |
+
// inpL shape [n_embd,N,1,1]
|
1287 |
+
inpL = ggml_rms_norm(ctx0, inpL);
|
1288 |
+
|
1289 |
+
// inpL = norm*inpL
|
1290 |
+
// inpL shape [n_embd,N,1,1]
|
1291 |
+
inpL = ggml_mul(ctx0,
|
1292 |
+
ggml_repeat(ctx0, model->norm, inpL),
|
1293 |
+
inpL);
|
1294 |
+
|
1295 |
+
//embeddings = inpL;
|
1296 |
+
}
|
1297 |
+
|
1298 |
+
|
1299 |
+
// lm_head
|
1300 |
+
// inpL shape [n_vocab,N,1,1]
|
1301 |
+
inpL = ggml_mul_mat(ctx0,
|
1302 |
+
model->outputa,
|
1303 |
+
ggml_mul_mat(ctx0,
|
1304 |
+
model->outputb,
|
1305 |
+
inpL));
|
1306 |
+
|
1307 |
+
// ggml_set_scratch(ctx0, { 0, 0, nullptr, });
|
1308 |
+
// run the computation
|
1309 |
+
ggml_build_forward_expand(gf, inpL);
|
1310 |
+
|
1311 |
+
return inpL;
|
1312 |
+
}
|
1313 |
+
|
1314 |
+
void sample_softmax(struct ggml_tensor * logits, struct ggml_tensor * probs, struct ggml_tensor * best_samples) {
|
1315 |
+
assert(logits->n_dims == 2);
|
1316 |
+
assert(probs->n_dims == 2);
|
1317 |
+
assert(best_samples->n_dims == 1);
|
1318 |
+
assert(logits->ne[1] == best_samples->ne[0]);
|
1319 |
+
assert(logits->ne[0] == probs->ne[0]);
|
1320 |
+
assert(logits->ne[1] == probs->ne[1]);
|
1321 |
+
for (int i = 0; i < logits->ne[1]; ++i) {
|
1322 |
+
float max_logit = ggml_get_f32_1d(logits, i * logits->ne[0]);
|
1323 |
+
ggml_set_i32_1d(best_samples, i, 0);
|
1324 |
+
for (int k = 0; k < logits->ne[0]; ++k) {
|
1325 |
+
float logit = ggml_get_f32_1d(logits, i * logits->ne[0] + k);
|
1326 |
+
if (logit > max_logit) {
|
1327 |
+
max_logit = logit;
|
1328 |
+
ggml_set_i32_1d(best_samples, i, k);
|
1329 |
+
}
|
1330 |
+
}
|
1331 |
+
float psum = 0;
|
1332 |
+
for (int k = 0; k < logits->ne[0]; ++k) {
|
1333 |
+
float logit = ggml_get_f32_1d(logits, i * logits->ne[0] + k);
|
1334 |
+
float p = (logit == -INFINITY) ? 0 : expf(logit - max_logit);
|
1335 |
+
psum += p;
|
1336 |
+
ggml_set_f32_1d(probs, i * probs->ne[0] + k, p);
|
1337 |
+
}
|
1338 |
+
for (int k = 0; k < logits->ne[0]; ++k) {
|
1339 |
+
float p = ggml_get_f32_1d(probs, i*probs->ne[0] + k);
|
1340 |
+
ggml_set_f32_1d(probs, i * probs->ne[0] + k, p / psum);
|
1341 |
+
}
|
1342 |
+
}
|
1343 |
+
}
|
1344 |
+
|
1345 |
+
void sample_softmax_batch(struct ggml_context * ctx, struct ggml_tensor * logits, struct ggml_tensor * probs, struct ggml_tensor * best_samples) {
|
1346 |
+
GGML_ASSERT(best_samples->n_dims == 2);
|
1347 |
+
GGML_ASSERT(logits->n_dims == 3);
|
1348 |
+
GGML_ASSERT(probs->n_dims == 3);
|
1349 |
+
int n_tokens = best_samples->ne[0];
|
1350 |
+
int n_batch = best_samples->ne[1];
|
1351 |
+
int n_vocab = logits->ne[0];
|
1352 |
+
GGML_ASSERT(n_tokens == logits->ne[1]);
|
1353 |
+
GGML_ASSERT(n_batch == logits->ne[2]);
|
1354 |
+
GGML_ASSERT(n_vocab == probs->ne[0]);
|
1355 |
+
GGML_ASSERT(n_tokens == probs->ne[1]);
|
1356 |
+
GGML_ASSERT(n_batch == probs->ne[2]);
|
1357 |
+
|
1358 |
+
for (int k = 0; k < n_batch; ++k) {
|
1359 |
+
struct ggml_tensor * best_samples_k = ggml_view_1d(ctx,
|
1360 |
+
best_samples,
|
1361 |
+
best_samples->ne[0],
|
1362 |
+
k*best_samples->nb[1]);
|
1363 |
+
struct ggml_tensor * logits_k = ggml_view_2d(ctx,
|
1364 |
+
logits,
|
1365 |
+
logits->ne[0],
|
1366 |
+
logits->ne[1],
|
1367 |
+
logits->nb[1],
|
1368 |
+
k*logits->nb[2]);
|
1369 |
+
struct ggml_tensor * probs_k = ggml_view_2d(ctx,
|
1370 |
+
probs,
|
1371 |
+
probs->ne[0],
|
1372 |
+
probs->ne[1],
|
1373 |
+
probs->nb[1],
|
1374 |
+
k*probs->nb[2]);
|
1375 |
+
sample_softmax(logits_k, probs_k, best_samples_k);
|
1376 |
+
}
|
1377 |
+
}
|
1378 |
+
|
1379 |
+
void print_row(struct ggml_tensor * probs, int i) {
|
1380 |
+
for (int k = 0; k < probs->ne[0]; ++k) {
|
1381 |
+
float p = ggml_get_f32_1d(probs, i*probs->ne[0] + k);
|
1382 |
+
printf(" %.2f", p);
|
1383 |
+
}
|
1384 |
+
printf("\n");
|
1385 |
+
}
|
1386 |
+
|
1387 |
+
void print_matrix(struct ggml_tensor * probs) {
|
1388 |
+
assert(probs->n_dims == 2);
|
1389 |
+
for (int i = 0; i < probs->ne[1]; ++i) {
|
1390 |
+
for (int k = 0; k < probs->ne[0]; ++k) {
|
1391 |
+
float p = ggml_get_f32_1d(probs, i*probs->ne[0] + k);
|
1392 |
+
printf(" %.2f", p);
|
1393 |
+
}
|
1394 |
+
printf("\n");
|
1395 |
+
}
|
1396 |
+
}
|
1397 |
+
|
1398 |
+
void print_token(int token, int n_vocab) {
|
1399 |
+
for (int k = 0; k < token; ++k) {
|
1400 |
+
printf(" ");
|
1401 |
+
}
|
1402 |
+
printf("X");
|
1403 |
+
for (int k = token+1; k < n_vocab; ++k) {
|
1404 |
+
printf(" ");
|
1405 |
+
}
|
1406 |
+
printf("\n");
|
1407 |
+
}
|
1408 |
+
|
1409 |
+
void print_tokens(struct ggml_tensor * tokens, int n_vocab) {
|
1410 |
+
for (int i=0; i<tokens->ne[0]; ++i) {
|
1411 |
+
int token = ggml_get_i32_1d(tokens, i);
|
1412 |
+
print_token(token, n_vocab);
|
1413 |
+
}
|
1414 |
+
}
|
1415 |
+
|
1416 |
+
void get_example_targets(int example_id, struct ggml_tensor * tokens_input, struct ggml_tensor * targets) {
|
1417 |
+
int n_tokens = tokens_input->ne[0];
|
1418 |
+
int n_vocab = targets->ne[0];
|
1419 |
+
float randomness = 0.0f;
|
1420 |
+
// ggml_set_zero(targets);
|
1421 |
+
ggml_set_f32(targets, -1.0f);
|
1422 |
+
ggml_set_i32_1d(tokens_input, 0, 0);
|
1423 |
+
for (int i=1; i<n_tokens+1; ++i) {
|
1424 |
+
float x = example_id + i * 3.14159f * 2.0f * 1.0f * 0.5f / n_tokens;
|
1425 |
+
float y = sinf(x);//*cosf(x*1.1f+1.0f);
|
1426 |
+
float z = (y+1.0f)*0.5f; // scale to [0..1]
|
1427 |
+
z += (frand()-0.5f)*(randomness/n_vocab);
|
1428 |
+
z = (z < 0.0f) ? 0.0f : (z > 1.0f) ? 1.0f : z; // clamp to [0..1]
|
1429 |
+
int token = std::max(1,std::min(1+(int)(z*(float)(n_vocab-1)), n_vocab-1));
|
1430 |
+
ggml_set_f32_1d(targets, (i-1)*n_vocab + token, +1.0f);
|
1431 |
+
if (i<n_tokens) {
|
1432 |
+
ggml_set_i32_1d(tokens_input, i, token);
|
1433 |
+
}
|
1434 |
+
}
|
1435 |
+
}
|
1436 |
+
|
1437 |
+
void get_example_targets_batch(struct ggml_context * ctx, int example_id, struct ggml_tensor * tokens_input, struct ggml_tensor * targets) {
|
1438 |
+
GGML_ASSERT(tokens_input->n_dims == 2);
|
1439 |
+
GGML_ASSERT( targets->n_dims == 3);
|
1440 |
+
int n_tokens = tokens_input->ne[0];
|
1441 |
+
int n_batch = tokens_input->ne[1];
|
1442 |
+
GGML_ASSERT(n_tokens == targets->ne[1]);
|
1443 |
+
GGML_ASSERT(n_batch == targets->ne[2]);
|
1444 |
+
|
1445 |
+
for (int k=0; k<n_batch; ++k) {
|
1446 |
+
struct ggml_tensor * tokens_input_k = ggml_view_1d(ctx,
|
1447 |
+
tokens_input,
|
1448 |
+
tokens_input->ne[0],
|
1449 |
+
k*tokens_input->nb[1]);
|
1450 |
+
struct ggml_tensor * targets_k = ggml_view_2d(ctx,
|
1451 |
+
targets,
|
1452 |
+
targets->ne[0],
|
1453 |
+
targets->ne[1],
|
1454 |
+
targets->nb[1],
|
1455 |
+
k*targets->nb[2]);
|
1456 |
+
get_example_targets(example_id*n_batch + k, tokens_input_k, targets_k);
|
1457 |
+
}
|
1458 |
+
}
|
1459 |
+
|
1460 |
+
void lshift_examples(struct ggml_tensor * tokens_input, struct ggml_tensor * targets, int n_shift) {
|
1461 |
+
int n_tokens = tokens_input->ne[0];
|
1462 |
+
int n_vocab = targets->ne[0];
|
1463 |
+
for (int i=0; i<n_tokens-n_shift; ++i) {
|
1464 |
+
ggml_set_i32_1d(tokens_input, i, ggml_get_i32_1d(tokens_input, i + n_shift));
|
1465 |
+
for (int k=0; k<n_vocab; ++k) {
|
1466 |
+
ggml_set_f32_1d(targets, i*n_vocab + k, ggml_get_f32_1d(targets, (i + n_shift)*n_vocab + k));
|
1467 |
+
}
|
1468 |
+
}
|
1469 |
+
}
|
1470 |
+
|
1471 |
+
struct ggml_tensor * square_error_loss(struct ggml_context * ctx, struct ggml_tensor * a, struct ggml_tensor * b) {
|
1472 |
+
// todo: instead of a-b: a[1:]-b[:-1]
|
1473 |
+
return ggml_sum(ctx, ggml_sqr(ctx, ggml_sub(ctx, a, b)));
|
1474 |
+
}
|
1475 |
+
|
1476 |
+
struct ggml_tensor * cross_entropy_loss(struct ggml_context * ctx, struct ggml_tensor * a, struct ggml_tensor * b) {
|
1477 |
+
const float eps = 1e-3f;
|
1478 |
+
return
|
1479 |
+
ggml_sum(ctx,
|
1480 |
+
ggml_neg(ctx,
|
1481 |
+
ggml_sum_rows(ctx,
|
1482 |
+
ggml_mul(ctx,
|
1483 |
+
ggml_soft_max(ctx, a),
|
1484 |
+
ggml_log(ctx,
|
1485 |
+
ggml_add1(ctx,
|
1486 |
+
ggml_soft_max(ctx, b),
|
1487 |
+
ggml_new_f32(ctx, eps)))))));
|
1488 |
+
}
|
1489 |
+
|
1490 |
+
int main(int argc, char ** argv) {
|
1491 |
+
if (argc < 1) {
|
1492 |
+
fprintf(stderr, "usage: %s\n", argv[0]);
|
1493 |
+
|
1494 |
+
return 1;
|
1495 |
+
}
|
1496 |
+
|
1497 |
+
struct ggml_init_params lcparams;
|
1498 |
+
lcparams.mem_size = 1024ll*1024ll*1024ll;
|
1499 |
+
lcparams.mem_buffer = NULL;
|
1500 |
+
lcparams.no_alloc = false;
|
1501 |
+
|
1502 |
+
struct llama_model model;
|
1503 |
+
model.hparams.n_vocab = 8;
|
1504 |
+
model.hparams.n_ctx = 8;
|
1505 |
+
model.hparams.n_embd = 32;
|
1506 |
+
model.hparams.n_mult = 2;
|
1507 |
+
model.hparams.n_head = 8;
|
1508 |
+
model.hparams.n_layer = 1;
|
1509 |
+
model.hparams.n_rot = std::min(16u, model.hparams.n_embd / model.hparams.n_head);
|
1510 |
+
|
1511 |
+
// model.hparams.n_embd = 32;
|
1512 |
+
// model.hparams.n_mult = 2;
|
1513 |
+
// model.hparams.n_head = 4;
|
1514 |
+
// model.hparams.n_layer = 8;
|
1515 |
+
// model.hparams.n_rot = 8;
|
1516 |
+
|
1517 |
+
model.ctx = ggml_init(lcparams);
|
1518 |
+
printf("init model\n");
|
1519 |
+
init_model(&model);
|
1520 |
+
set_param_model(&model);
|
1521 |
+
|
1522 |
+
randomize_model(&model, 1337, 0.0f, 1.0f, -1.0f, +1.0f);
|
1523 |
+
|
1524 |
+
/*
|
1525 |
+
struct llama_model_lora model_lora;
|
1526 |
+
// model.hparams.n_vocab = 6;
|
1527 |
+
// model.hparams.n_ctx = 64;
|
1528 |
+
// model.hparams.n_embd = 128;
|
1529 |
+
// model.hparams.n_mult = 2;
|
1530 |
+
// model.hparams.n_head = 8;
|
1531 |
+
// model.hparams.n_layer = 6;
|
1532 |
+
// model.hparams.n_rot = model.hparams.n_embd / model.hparams.n_head;
|
1533 |
+
|
1534 |
+
model_lora.hparams.n_vocab = 16;
|
1535 |
+
model_lora.hparams.n_ctx = 32;
|
1536 |
+
model_lora.hparams.n_embd = 256;
|
1537 |
+
model_lora.hparams.n_mult = 2;
|
1538 |
+
model_lora.hparams.n_head = 16;
|
1539 |
+
model_lora.hparams.n_layer = 1;
|
1540 |
+
model_lora.hparams.n_lora = 64;
|
1541 |
+
model_lora.hparams.n_rot = MIN(16, model_lora.hparams.n_embd / model_lora.hparams.n_head);
|
1542 |
+
// model.hparams.n_rot = (model.hparams.n_embd / model.hparams.n_head) / 2;
|
1543 |
+
|
1544 |
+
// model.hparams.n_embd = 32;
|
1545 |
+
// model.hparams.n_mult = 2;
|
1546 |
+
// model.hparams.n_head = 4;
|
1547 |
+
// model.hparams.n_layer = 8;
|
1548 |
+
// model.hparams.n_rot = 8;
|
1549 |
+
|
1550 |
+
model_lora.ctx = ggml_init(lcparams);
|
1551 |
+
printf("init model_lora\n");
|
1552 |
+
init_model_lora(&model_lora);
|
1553 |
+
set_param_model_lora(&model_lora);
|
1554 |
+
|
1555 |
+
randomize_model_lora(&model_lora, 1337, 0.0f, 1.0f, -1.0f, +1.0f);
|
1556 |
+
*/
|
1557 |
+
int n_batch = 8;
|
1558 |
+
// key + value cache for the self attention
|
1559 |
+
struct llama_kv_cache kv_self;
|
1560 |
+
printf("init_kv_cache\n");
|
1561 |
+
kv_self.ctx = model.ctx;
|
1562 |
+
init_kv_cache(&kv_self, &model, n_batch);
|
1563 |
+
//init_kv_cache_lora(&kv_self, &model_lora);
|
1564 |
+
|
1565 |
+
size_t compute_size = 1024ll*1024ll*1024ll;
|
1566 |
+
uint8_t * compute_addr = new uint8_t[compute_size];
|
1567 |
+
|
1568 |
+
int n_examples = 256;
|
1569 |
+
int n_tokens = model.hparams.n_ctx;
|
1570 |
+
int n_vocab = model.hparams.n_vocab;
|
1571 |
+
|
1572 |
+
for (int ex=0; ex<n_examples; ++ex) {
|
1573 |
+
struct ggml_init_params params = {
|
1574 |
+
/*.mem_size =*/ compute_size,
|
1575 |
+
/*.mem_buffer =*/ compute_addr,
|
1576 |
+
/*.no_alloc =*/ false,
|
1577 |
+
};
|
1578 |
+
|
1579 |
+
struct ggml_context * ctx0 = ggml_init(params);
|
1580 |
+
|
1581 |
+
struct ggml_tensor * after_opt_best_samples = ggml_new_tensor_2d(ctx0, GGML_TYPE_I32, n_tokens, n_batch);
|
1582 |
+
struct ggml_tensor * after_opt_probs = ggml_new_tensor_3d(ctx0, GGML_TYPE_F32, n_vocab, n_tokens, n_batch);
|
1583 |
+
struct ggml_tensor * tokens_input = ggml_new_tensor_2d(ctx0, GGML_TYPE_I32, n_tokens, n_batch);
|
1584 |
+
struct ggml_tensor * targets = ggml_new_tensor_3d(ctx0, GGML_TYPE_F32, n_vocab, n_tokens, n_batch);
|
1585 |
+
|
1586 |
+
int n_past = 0;
|
1587 |
+
|
1588 |
+
ggml_cgraph gf = {};
|
1589 |
+
gf.n_threads = 1;
|
1590 |
+
|
1591 |
+
get_example_targets_batch(ctx0, 64*ex+0, tokens_input, targets);
|
1592 |
+
|
1593 |
+
struct ggml_tensor * logits = forward_batch(&model, &kv_self, ctx0, &gf, tokens_input, n_tokens, n_past, n_batch);
|
1594 |
+
// struct ggml_tensor * e = cross_entropy_loss(ctx0, targets, logits);
|
1595 |
+
struct ggml_tensor * e = square_error_loss(ctx0, targets, logits);
|
1596 |
+
|
1597 |
+
ggml_build_forward_expand(&gf, e);
|
1598 |
+
ggml_graph_compute(ctx0, &gf);
|
1599 |
+
|
1600 |
+
float error_before_opt = ggml_get_f32_1d(e, 0);
|
1601 |
+
|
1602 |
+
struct ggml_opt_params opt_params_adam = ggml_opt_default_params(GGML_OPT_ADAM);
|
1603 |
+
struct ggml_opt_params opt_params_lbfgs = ggml_opt_default_params(GGML_OPT_LBFGS);
|
1604 |
+
opt_params_adam.print_forward_graph = false;
|
1605 |
+
opt_params_adam.print_backward_graph = false;
|
1606 |
+
opt_params_lbfgs.print_forward_graph = false;
|
1607 |
+
opt_params_lbfgs.print_backward_graph = false;
|
1608 |
+
opt_params_adam.adam.n_iter = 16;
|
1609 |
+
opt_params_lbfgs.lbfgs.n_iter = 16;
|
1610 |
+
// ggml_opt(ctx0, opt_params_adam, e);
|
1611 |
+
ggml_opt(ctx0, opt_params_lbfgs, e);
|
1612 |
+
//
|
1613 |
+
ggml_build_forward_expand(&gf, e);
|
1614 |
+
ggml_graph_compute(ctx0, &gf);
|
1615 |
+
|
1616 |
+
float error_after_opt = ggml_get_f32_1d(e, 0);
|
1617 |
+
|
1618 |
+
if (ex % 8 == 0) {
|
1619 |
+
printf("Example %d\n", (ex+1));
|
1620 |
+
printf("error_before_opt: %.2f\n", error_before_opt);
|
1621 |
+
printf("error_after_opt: %.2f\n", error_after_opt);
|
1622 |
+
}
|
1623 |
+
|
1624 |
+
if (ex % 64 == 0) {
|
1625 |
+
sample_softmax_batch(ctx0, logits, after_opt_probs, after_opt_best_samples);
|
1626 |
+
// printf("probabilities after optimization:\n");
|
1627 |
+
// print_matrix(after_opt_probs);
|
1628 |
+
printf("best samples after optimization:\n");
|
1629 |
+
print_tokens(after_opt_best_samples, n_vocab);
|
1630 |
+
}
|
1631 |
+
|
1632 |
+
ggml_free(ctx0);
|
1633 |
+
}
|
1634 |
+
|
1635 |
+
{
|
1636 |
+
int n_gen = 128;
|
1637 |
+
int sample_ctx = n_tokens-n_tokens/8;
|
1638 |
+
|
1639 |
+
printf("Generating %d tokens.\n", n_gen);
|
1640 |
+
|
1641 |
+
struct ggml_tensor * tokens_input = ggml_new_tensor_1d(model.ctx, GGML_TYPE_I32, n_tokens);
|
1642 |
+
struct ggml_tensor * targets = ggml_new_tensor_2d(model.ctx, GGML_TYPE_F32, n_vocab, n_tokens);
|
1643 |
+
|
1644 |
+
get_example_targets(137, tokens_input, targets);
|
1645 |
+
for (int i=sample_ctx; i<n_tokens; ++i) {
|
1646 |
+
ggml_set_i32_1d(tokens_input, i, n_vocab/2);
|
1647 |
+
}
|
1648 |
+
|
1649 |
+
for (int i=0; i<sample_ctx-1; ++i) {
|
1650 |
+
print_token(ggml_get_i32_1d(tokens_input, i), n_vocab);
|
1651 |
+
}
|
1652 |
+
printf("---\n");
|
1653 |
+
for (int i=0; i<n_gen; ++i) {
|
1654 |
+
struct ggml_init_params params = {
|
1655 |
+
/*.mem_size =*/ compute_size,
|
1656 |
+
/*.mem_buffer =*/ compute_addr,
|
1657 |
+
/*.no_alloc =*/ false,
|
1658 |
+
};
|
1659 |
+
struct ggml_context * ctx0 = ggml_init(params);
|
1660 |
+
|
1661 |
+
ggml_cgraph gf = {};
|
1662 |
+
gf.n_threads = 1;
|
1663 |
+
|
1664 |
+
int n_past = 0;
|
1665 |
+
struct ggml_tensor * logits = forward(&model, &kv_self, ctx0, &gf, tokens_input, sample_ctx, n_past);
|
1666 |
+
|
1667 |
+
ggml_build_forward_expand(&gf, logits);
|
1668 |
+
ggml_graph_compute(ctx0, &gf);
|
1669 |
+
|
1670 |
+
struct ggml_tensor * best_samples = ggml_new_tensor_1d(ctx0, GGML_TYPE_I32, sample_ctx);
|
1671 |
+
struct ggml_tensor * probs = ggml_new_tensor_2d(ctx0, GGML_TYPE_F32, n_vocab, sample_ctx);
|
1672 |
+
|
1673 |
+
sample_softmax(logits, probs, best_samples);
|
1674 |
+
|
1675 |
+
// int sample_at = n_tokens-1;
|
1676 |
+
int token = ggml_get_i32_1d(best_samples, sample_ctx-1);
|
1677 |
+
|
1678 |
+
// print_row(probs, sample_at);
|
1679 |
+
print_token(token, n_vocab);
|
1680 |
+
|
1681 |
+
lshift_examples(tokens_input, targets, 1);
|
1682 |
+
ggml_set_i32_1d(tokens_input, 0, 0);
|
1683 |
+
ggml_set_i32_1d(tokens_input, sample_ctx-1, token);
|
1684 |
+
|
1685 |
+
ggml_free(ctx0);
|
1686 |
+
}
|
1687 |
+
}
|
1688 |
+
|
1689 |
+
print_matrix(model.tok_embeddings);
|
1690 |
+
|
1691 |
+
printf("done\n");
|
1692 |
+
// ggml_free(kv_self.ctx);
|
1693 |
+
// ggml_free(model_lora.ctx);
|
1694 |
+
ggml_free(model.ctx);
|
1695 |
+
return 0;
|
1696 |
+
}
|
examples/benchmark/CMakeLists.txt
ADDED
@@ -0,0 +1,7 @@
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
1 |
+
set(TARGET benchmark)
|
2 |
+
add_executable(${TARGET} benchmark-matmult.cpp)
|
3 |
+
target_link_libraries(${TARGET} PRIVATE common llama ${CMAKE_THREAD_LIBS_INIT})
|
4 |
+
target_compile_features(${TARGET} PRIVATE cxx_std_11)
|
5 |
+
if(TARGET BUILD_INFO)
|
6 |
+
add_dependencies(${TARGET} BUILD_INFO)
|
7 |
+
endif()
|
examples/benchmark/benchmark-matmult.cpp
ADDED
@@ -0,0 +1,261 @@
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
1 |
+
#include "ggml.h"
|
2 |
+
#include "build-info.h"
|
3 |
+
|
4 |
+
#include <locale.h>
|
5 |
+
#include <assert.h>
|
6 |
+
#include <math.h>
|
7 |
+
#include <cstring>
|
8 |
+
#include <cstdio>
|
9 |
+
#include <cinttypes>
|
10 |
+
#include <unordered_map>
|
11 |
+
#include <queue>
|
12 |
+
#include <string.h>
|
13 |
+
#include <cassert>
|
14 |
+
#include <fstream>
|
15 |
+
#include <string>
|
16 |
+
#include <iterator>
|
17 |
+
#include <algorithm>
|
18 |
+
|
19 |
+
#if defined(_MSC_VER)
|
20 |
+
#pragma warning(disable: 4244 4267) // possible loss of data
|
21 |
+
#endif
|
22 |
+
|
23 |
+
float tensor_sum_elements(const ggml_tensor * tensor) {
|
24 |
+
float sum = 0;
|
25 |
+
if (tensor->type==GGML_TYPE_F32) {
|
26 |
+
for (int j = 0; j < tensor->ne[1]; j++) {
|
27 |
+
for (int k = 0; k < tensor->ne[0]; k++) {
|
28 |
+
sum += ((float *) tensor->data)[j*tensor->ne[0]+k];
|
29 |
+
}
|
30 |
+
}
|
31 |
+
}
|
32 |
+
return sum;
|
33 |
+
}
|
34 |
+
|
35 |
+
void tensor_dump(const ggml_tensor * tensor, const char * name) {
|
36 |
+
printf("%15s: type = %i (%5s) ne = %5" PRIi64 " x %5" PRIi64 " x %5" PRIi64 ", nb = (%5zi, %5zi, %5zi) - ", name,
|
37 |
+
tensor->type, ggml_type_name(tensor->type),
|
38 |
+
tensor->ne[0], tensor->ne[1], tensor->ne[2], tensor->nb[0], tensor->nb[1], tensor->nb[2]);
|
39 |
+
float sum = tensor_sum_elements(tensor);
|
40 |
+
printf("Sum of tensor %s is %6.2f\n", name, sum);
|
41 |
+
}
|
42 |
+
|
43 |
+
#define TENSOR_DUMP(tensor) tensor_dump(tensor, #tensor)
|
44 |
+
|
45 |
+
struct benchmark_params_struct {
|
46 |
+
int32_t n_threads = 1;
|
47 |
+
int32_t n_iterations = 10;
|
48 |
+
};
|
49 |
+
|
50 |
+
void print_usage(int /*argc*/, char ** argv, struct benchmark_params_struct params) {
|
51 |
+
fprintf(stderr, "usage: %s [options]\n", argv[0]);
|
52 |
+
fprintf(stderr, "\n");
|
53 |
+
fprintf(stderr, "options:\n");
|
54 |
+
fprintf(stderr, " -h, --help show this help message and exit\n");
|
55 |
+
fprintf(stderr, " -t N, --threads N number of threads to use during computation (default: %d)\n", params.n_threads);
|
56 |
+
fprintf(stderr, " -i N, --iter N number of iterations to use during computation (default: %d)\n", params.n_iterations);
|
57 |
+
fprintf(stderr, "\n");
|
58 |
+
}
|
59 |
+
|
60 |
+
int main(int argc, char ** argv) {
|
61 |
+
struct benchmark_params_struct benchmark_params;
|
62 |
+
|
63 |
+
bool invalid_param = false;
|
64 |
+
std::string arg;
|
65 |
+
for (int i = 1; i < argc; i++) {
|
66 |
+
arg = argv[i];
|
67 |
+
|
68 |
+
if (arg == "-t" || arg == "--threads") {
|
69 |
+
if (++i >= argc) {
|
70 |
+
invalid_param = true;
|
71 |
+
break;
|
72 |
+
}
|
73 |
+
benchmark_params.n_threads = std::stoi(argv[i]);
|
74 |
+
} else if (arg == "-i" || arg == "--iter") {
|
75 |
+
if (++i >= argc) {
|
76 |
+
invalid_param = true;
|
77 |
+
break;
|
78 |
+
}
|
79 |
+
benchmark_params.n_iterations = std::stoi(argv[i]);
|
80 |
+
} else if (arg == "-h" || arg == "--help") {
|
81 |
+
print_usage(argc, argv, benchmark_params);
|
82 |
+
exit(0);
|
83 |
+
}
|
84 |
+
}
|
85 |
+
if (invalid_param) {
|
86 |
+
fprintf(stderr, "error: invalid parameter for argument: %s\n", arg.c_str());
|
87 |
+
print_usage(argc, argv, benchmark_params);
|
88 |
+
exit(1);
|
89 |
+
}
|
90 |
+
|
91 |
+
fprintf(stderr, "%s: build = %d (%s)\n", __func__, BUILD_NUMBER, BUILD_COMMIT);
|
92 |
+
printf("Starting Test\n");
|
93 |
+
|
94 |
+
// create the ggml context
|
95 |
+
struct ggml_context * ctx;
|
96 |
+
//const int sizex = 4096;
|
97 |
+
//const int sizey = 11008;
|
98 |
+
|
99 |
+
#undef VERBOSE_DEBUGGING
|
100 |
+
#ifndef VERBOSE_DEBUGGING
|
101 |
+
const int sizey = 4096;
|
102 |
+
const int sizex = 11008;
|
103 |
+
const int sizez = 128;
|
104 |
+
#else
|
105 |
+
/* Working - let's increase size */
|
106 |
+
const int sizey = 1;
|
107 |
+
const int sizex = (8*32);
|
108 |
+
const int sizez = 1;
|
109 |
+
|
110 |
+
/*const int sizey = 1;
|
111 |
+
const int sizex = 3*(8*32);
|
112 |
+
const int sizez = 1;*/
|
113 |
+
#endif
|
114 |
+
|
115 |
+
//printf("Memsize required = %i\n", sizex*sizex);
|
116 |
+
|
117 |
+
size_t ctx_size = 0;
|
118 |
+
ctx_size += sizex*sizey*ggml_type_sizef(GGML_TYPE_F32);
|
119 |
+
ctx_size += sizex*sizey*ggml_type_sizef(GGML_TYPE_F32);
|
120 |
+
ctx_size += sizex*sizez*ggml_type_sizef(GGML_TYPE_F32);
|
121 |
+
ctx_size += sizex*sizey*ggml_type_sizef(GGML_TYPE_Q4_0);
|
122 |
+
ctx_size += sizex*sizey*ggml_type_sizef(GGML_TYPE_Q4_0);
|
123 |
+
ctx_size += sizex*sizey*ggml_type_sizef(GGML_TYPE_F32); // BLAS
|
124 |
+
ctx_size += sizex*sizey*ggml_type_sizef(GGML_TYPE_F32); // BLAS
|
125 |
+
ctx_size += 1024*1024*16;
|
126 |
+
|
127 |
+
printf("Allocating Memory of size %zi bytes, %zi MB\n",ctx_size, (ctx_size/1024/1024));
|
128 |
+
|
129 |
+
struct ggml_init_params params = {
|
130 |
+
/*.mem_size =*/ ctx_size,
|
131 |
+
/*.mem_buffer =*/ NULL,
|
132 |
+
/* no_alloc =*/ 0
|
133 |
+
};
|
134 |
+
|
135 |
+
ctx = ggml_init(params);
|
136 |
+
if (!ctx) {
|
137 |
+
fprintf(stderr, "%s: ggml_init() failed\n", __func__);
|
138 |
+
return 1;
|
139 |
+
}
|
140 |
+
|
141 |
+
|
142 |
+
printf("Creating new tensors\n");
|
143 |
+
// printf("Creating new tensor m1\n");
|
144 |
+
struct ggml_tensor * m11 = ggml_new_tensor_2d(ctx, GGML_TYPE_F32, sizex, sizey);
|
145 |
+
ggml_set_f32(m11, 1.0f);
|
146 |
+
|
147 |
+
// printf("Creating new tensor m1\n");
|
148 |
+
struct ggml_tensor * m12 = ggml_new_tensor_2d(ctx, GGML_TYPE_F32, sizex, sizey);
|
149 |
+
ggml_set_f32(m12, 1.5f);
|
150 |
+
|
151 |
+
// printf("Creating new tensor m2\n");
|
152 |
+
struct ggml_tensor * m2 = ggml_new_tensor_2d(ctx, GGML_TYPE_F32, sizex, sizez);
|
153 |
+
ggml_set_f32(m2, 2.0f);
|
154 |
+
|
155 |
+
printf("\n------ Test 1 - Matrix Mult via F32 code ------------------------------------------------------------------------------\n");
|
156 |
+
// printf("Creating new tensor m11xm2\n");
|
157 |
+
struct ggml_tensor * m11xm2 = ggml_mul_mat(ctx, m11, m2);
|
158 |
+
|
159 |
+
// printf("Creating compute graph\n");
|
160 |
+
struct ggml_cgraph gf = ggml_build_forward(m11xm2);
|
161 |
+
|
162 |
+
gf.n_threads=benchmark_params.n_threads;
|
163 |
+
printf("cgraph->n_threads=%i\n",gf.n_threads);
|
164 |
+
|
165 |
+
TENSOR_DUMP(m11);
|
166 |
+
TENSOR_DUMP(m2);
|
167 |
+
|
168 |
+
ggml_graph_compute(ctx, &gf);
|
169 |
+
|
170 |
+
TENSOR_DUMP(gf.nodes[0]);
|
171 |
+
|
172 |
+
printf("\n------ Test 2 - Matrix Mult via Q4_0 code ------------------------------------------------------------------------------\n");
|
173 |
+
|
174 |
+
int32_t nelements = sizex*sizey;
|
175 |
+
int32_t ne[2] = { sizex, sizey };
|
176 |
+
|
177 |
+
std::vector<int64_t> hist_cur(1 << 4, 0);
|
178 |
+
|
179 |
+
// Set up a the benchmark matrices
|
180 |
+
// printf("Creating new tensor q11 & Running quantize\n");
|
181 |
+
struct ggml_tensor * q11 = ggml_new_tensor_2d(ctx, GGML_TYPE_Q4_0, sizex, sizey);
|
182 |
+
ggml_quantize_q4_0((const float *) m11->data, q11->data, nelements, ne[0], hist_cur.data());
|
183 |
+
|
184 |
+
// Set up a the compute graph
|
185 |
+
// printf("Creating new tensor q31\n");
|
186 |
+
struct ggml_tensor * q31 = ggml_mul_mat(ctx, q11, m2);
|
187 |
+
|
188 |
+
// printf("Creating compute graph\n");
|
189 |
+
struct ggml_cgraph gf31 = ggml_build_forward(q31);
|
190 |
+
gf31.n_threads=benchmark_params.n_threads;
|
191 |
+
|
192 |
+
// Set up a second graph computation to make sure we override the CPU cache lines
|
193 |
+
// printf("Creating new tensor q12 & Running quantize\n");
|
194 |
+
struct ggml_tensor * q12 = ggml_new_tensor_2d(ctx, GGML_TYPE_Q4_0, sizex, sizey);
|
195 |
+
ggml_quantize_q4_0((const float *) m12->data, q12->data, nelements, ne[0], hist_cur.data());
|
196 |
+
|
197 |
+
// printf("Creating new tensor q32\n");
|
198 |
+
struct ggml_tensor * q32 = ggml_mul_mat(ctx, q12, m2);
|
199 |
+
|
200 |
+
//printf("Creating compute graph\n");
|
201 |
+
struct ggml_cgraph gf32 = ggml_build_forward(q32);
|
202 |
+
gf32.n_threads=benchmark_params.n_threads;
|
203 |
+
printf("cgraph->n_threads=%i\n",gf31.n_threads);
|
204 |
+
|
205 |
+
const int dimx = sizex;
|
206 |
+
const int dimy = sizey;
|
207 |
+
const int dimz = sizez;
|
208 |
+
long long int flops_per_dot_product = dimy + dimy;
|
209 |
+
long long int flops_per_matrix = flops_per_dot_product * dimx * dimz; ;
|
210 |
+
printf("Matrix Multiplication of (%i,%i,%i) x (%i,%i,%i) - about %6.2f gFLOPS\n\n", sizex, sizey, 1, sizex, sizez, 1, 1.0f*flops_per_matrix / 1000 / 1000 / 1000);
|
211 |
+
|
212 |
+
|
213 |
+
// Let's use the F32 result from above as a reference for the q4_0 multiplication
|
214 |
+
float sum_of_F32_reference = tensor_sum_elements(gf.nodes[0]);
|
215 |
+
|
216 |
+
printf("Iteration;NThreads; SizeX; SizeY; SizeZ; Required_FLOPS; Elapsed_u_Seconds; gigaFLOPS\n");
|
217 |
+
printf("=====================================================================================\n");
|
218 |
+
|
219 |
+
double gflops_sum = 0;
|
220 |
+
for (int i=0;i<benchmark_params.n_iterations ;i++) {
|
221 |
+
|
222 |
+
long long int start = ggml_time_us();
|
223 |
+
//printf("Running ggml_graph_compute\n");
|
224 |
+
ggml_graph_compute(ctx, &gf31);
|
225 |
+
long long int stop = ggml_time_us();
|
226 |
+
long long int usec = stop-start;
|
227 |
+
double gflops = (double)(flops_per_matrix)/usec/1000.0;
|
228 |
+
gflops_sum += gflops;
|
229 |
+
printf("%9i;%8i;%6i;%6i;%6i;%15lli;%18lli;%10.2f\n",
|
230 |
+
i,
|
231 |
+
gf31.n_threads,
|
232 |
+
sizex, sizey, sizez, flops_per_matrix,
|
233 |
+
usec,gflops);
|
234 |
+
|
235 |
+
#ifdef VERBOSE_DEBUGGING
|
236 |
+
TENSOR_DUMP("res",gf31.nodes[0])
|
237 |
+
#endif
|
238 |
+
|
239 |
+
// Check that the matrix multiplication result is in the right ballpark
|
240 |
+
// We cannot use the exact value from the F32 multiplication because the quantizuation will be slightly different
|
241 |
+
float sum_of_Q4_result = tensor_sum_elements(gf31.nodes[0]);
|
242 |
+
float delta = abs(sum_of_Q4_result - sum_of_F32_reference);
|
243 |
+
float allowed_delta = (sum_of_F32_reference) / 1000 / 1000; // Let's accept an epsilon of 10^-6
|
244 |
+
|
245 |
+
if (delta > allowed_delta) {
|
246 |
+
printf("\nABORT - ERROR in Matrix Multiplication result - expected %6.2f, got %6.2f (delta %6.2f > allowed_delta %6.2f)\n",
|
247 |
+
sum_of_F32_reference,
|
248 |
+
sum_of_Q4_result,
|
249 |
+
delta,
|
250 |
+
allowed_delta
|
251 |
+
);
|
252 |
+
exit(0);
|
253 |
+
}
|
254 |
+
|
255 |
+
// Running a different graph computation to make sure we override the CPU cache lines
|
256 |
+
ggml_graph_compute(ctx, &gf32);
|
257 |
+
}
|
258 |
+
printf("\n");
|
259 |
+
printf("Average%78.2f\n",gflops_sum/((double)benchmark_params.n_iterations));
|
260 |
+
printf("=====================================================================================\n");
|
261 |
+
}
|
examples/chat-13B.bat
ADDED
@@ -0,0 +1,57 @@
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
1 |
+
@setlocal disabledelayedexpansion enableextensions
|
2 |
+
@echo off
|
3 |
+
|
4 |
+
cd /d "%~dp0.."
|
5 |
+
if not "%errorlevel%"=="0" (
|
6 |
+
echo Unable to change directory.
|
7 |
+
pause
|
8 |
+
exit /b 1
|
9 |
+
)
|
10 |
+
|
11 |
+
if not defined MODEL set "MODEL=models\13B\ggml-model-q4_0.bin"
|
12 |
+
if not defined USER_NAME set "USER_NAME=User"
|
13 |
+
if not defined AI_NAME set "AI_NAME=ChatLLaMa"
|
14 |
+
rem Adjust to the number of CPU cores you want to use.
|
15 |
+
rem if not defined N_THREAD set "N_THREAD=8"
|
16 |
+
rem Number of tokens to predict (made it larger than default because we want a long interaction)
|
17 |
+
if not defined N_PREDICTS set "N_PREDICTS=2048"
|
18 |
+
if not defined GEN_OPTIONS set "GEN_OPTIONS=--ctx_size 2048 --temp 0.7 --top_k 40 --top_p 0.5 --repeat_last_n 256 --batch_size 1024 --repeat_penalty 1.17647"
|
19 |
+
|
20 |
+
rem Default main script paths
|
21 |
+
set "DEFAULT_MAIN_SCRIPT_PATHS=main.exe build\bin\main.exe"
|
22 |
+
|
23 |
+
rem Get main script path from command line arguments
|
24 |
+
set "MAIN_SCRIPT_PATH=%~1"
|
25 |
+
|
26 |
+
rem If the main script path was not specified, try the default paths
|
27 |
+
if not defined MAIN_SCRIPT_PATH (
|
28 |
+
for %%i in (%DEFAULT_MAIN_SCRIPT_PATHS%) do (
|
29 |
+
if exist "%%i" set "MAIN_SCRIPT_PATH=%%i"
|
30 |
+
)
|
31 |
+
)
|
32 |
+
|
33 |
+
rem If the main script path was not found, tell the user how to specify it
|
34 |
+
if not defined MAIN_SCRIPT_PATH (
|
35 |
+
echo The main script could not be found. Please provide the path to the main script as 1st argument to this script, or place the main script in one of the default locations:
|
36 |
+
echo %DEFAULT_MAIN_SCRIPT_PATHS%
|
37 |
+
pause
|
38 |
+
exit /b 1
|
39 |
+
)
|
40 |
+
|
41 |
+
rem Default context, feel free to edit it
|
42 |
+
set "PROMPT_TEXT=Text transcript of a never ending dialog, where %USER_NAME% interacts with an AI assistant named %AI_NAME%. %AI_NAME% is helpful, kind, honest, friendly, good at writing and never fails to answer %USER_NAME%'s requests immediately and with details and precision. There are no annotations like (30 seconds passed...) or (to himself), just what %USER_NAME% and %AI_NAME% say aloud to each other. The dialog lasts for years, the entirety of it is shared below. It's 10000 pages long. The transcript only includes text, it does not include markup like HTML and Markdown."
|
43 |
+
|
44 |
+
rem Set a temporary variable if N_THREAD is set
|
45 |
+
if defined N_THREAD (
|
46 |
+
set "_N_THREAD=--threads %N_THREAD%"
|
47 |
+
) else (
|
48 |
+
set "_N_THREAD="
|
49 |
+
)
|
50 |
+
|
51 |
+
rem Run the script
|
52 |
+
echo "%MAIN_SCRIPT_PATH%" %GEN_OPTIONS% %_N_THREAD% ^
|
53 |
+
--model "%MODEL%" ^
|
54 |
+
--n_predict %N_PREDICTS% ^
|
55 |
+
--color --interactive ^
|
56 |
+
--reverse-prompt "%USER_NAME%:" ^
|
57 |
+
--prompt "%PROMPT_TEXT%"
|
examples/chat-13B.sh
ADDED
@@ -0,0 +1,41 @@
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
1 |
+
#!/bin/bash
|
2 |
+
|
3 |
+
set -e
|
4 |
+
|
5 |
+
cd "$(dirname "$0")/.." || exit
|
6 |
+
|
7 |
+
MODEL="${MODEL:-./models/13B/ggml-model-q4_0.bin}"
|
8 |
+
PROMPT_TEMPLATE=${PROMPT_TEMPLATE:-./prompts/chat.txt}
|
9 |
+
USER_NAME="${USER_NAME:-USER}"
|
10 |
+
AI_NAME="${AI_NAME:-ChatLLaMa}"
|
11 |
+
|
12 |
+
# Adjust to the number of CPU cores you want to use.
|
13 |
+
N_THREAD="${N_THREAD:-8}"
|
14 |
+
# Number of tokens to predict (made it larger than default because we want a long interaction)
|
15 |
+
N_PREDICTS="${N_PREDICTS:-2048}"
|
16 |
+
|
17 |
+
# Note: you can also override the generation options by specifying them on the command line:
|
18 |
+
# For example, override the context size by doing: ./chatLLaMa --ctx_size 1024
|
19 |
+
GEN_OPTIONS="${GEN_OPTIONS:---ctx_size 2048 --temp 0.7 --top_k 40 --top_p 0.5 --repeat_last_n 256 --batch_size 1024 --repeat_penalty 1.17647}"
|
20 |
+
|
21 |
+
DATE_TIME=$(date +%H:%M)
|
22 |
+
DATE_YEAR=$(date +%Y)
|
23 |
+
|
24 |
+
PROMPT_FILE=$(mktemp -t llamacpp_prompt.XXXXXXX.txt)
|
25 |
+
|
26 |
+
sed -e "s/\[\[USER_NAME\]\]/$USER_NAME/g" \
|
27 |
+
-e "s/\[\[AI_NAME\]\]/$AI_NAME/g" \
|
28 |
+
-e "s/\[\[DATE_TIME\]\]/$DATE_TIME/g" \
|
29 |
+
-e "s/\[\[DATE_YEAR\]\]/$DATE_YEAR/g" \
|
30 |
+
$PROMPT_TEMPLATE > $PROMPT_FILE
|
31 |
+
|
32 |
+
# shellcheck disable=SC2086 # Intended splitting of GEN_OPTIONS
|
33 |
+
./main $GEN_OPTIONS \
|
34 |
+
--model "$MODEL" \
|
35 |
+
--threads "$N_THREAD" \
|
36 |
+
--n_predict "$N_PREDICTS" \
|
37 |
+
--color --interactive \
|
38 |
+
--file ${PROMPT_FILE} \
|
39 |
+
--reverse-prompt "${USER_NAME}:" \
|
40 |
+
--in-prefix ' ' \
|
41 |
+
"$@"
|
examples/chat-persistent.sh
ADDED
@@ -0,0 +1,151 @@
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
1 |
+
#!/bin/bash
|
2 |
+
|
3 |
+
set -euo pipefail
|
4 |
+
|
5 |
+
cd "$(dirname "$0")/.." || exit
|
6 |
+
|
7 |
+
if [[ -z "${PROMPT_CACHE_FILE+x}" || -z "${CHAT_SAVE_DIR+x}" ]]; then
|
8 |
+
echo >&2 "error: PROMPT_CACHE_FILE and CHAT_SAVE_DIR must be provided"
|
9 |
+
exit 1
|
10 |
+
fi
|
11 |
+
|
12 |
+
MODEL="${MODEL:-./models/13B/ggml-model-q4_0.bin}"
|
13 |
+
PROMPT_TEMPLATE="${PROMPT_TEMPLATE:-./prompts/chat.txt}"
|
14 |
+
USER_NAME="${USER_NAME:-User}"
|
15 |
+
AI_NAME="${AI_NAME:-ChatLLaMa}"
|
16 |
+
DATE_TIME="$(date +%H:%M)"
|
17 |
+
DATE_YEAR="$(date +%Y)"
|
18 |
+
|
19 |
+
LOG="${CHAT_SAVE_DIR}/main.log"
|
20 |
+
LOG_BG="${CHAT_SAVE_DIR}/main-bg.log"
|
21 |
+
CUR_PROMPT_FILE="${CHAT_SAVE_DIR}/current-prompt.txt"
|
22 |
+
CUR_PROMPT_CACHE="${CHAT_SAVE_DIR}/current-cache.bin"
|
23 |
+
NEXT_PROMPT_FILE="${CHAT_SAVE_DIR}/next-prompt.txt"
|
24 |
+
NEXT_PROMPT_CACHE="${CHAT_SAVE_DIR}/next-cache.bin"
|
25 |
+
|
26 |
+
SESSION_SIZE_MSG_PATTERN='main: session file matches [[:digit:]]+ / [[:digit:]]+'
|
27 |
+
SAMPLE_TIME_MSG_PATTERN='sample time =[[:space:]]+[[:digit:]]+.[[:digit:]]+ ms /[[:space:]]+[[:digit:]]+'
|
28 |
+
SED_DELETE_MESSAGES="/^(${USER_NAME}:|${AI_NAME}:|\\.\\.\\.)/,\$d"
|
29 |
+
|
30 |
+
CTX_SIZE=2048
|
31 |
+
CTX_ROTATE_POINT=$((CTX_SIZE * 3 / 5)) # REVIEW
|
32 |
+
OPTS=(--model "$MODEL" --ctx_size "$CTX_SIZE" --repeat_last_n 256 "$@")
|
33 |
+
|
34 |
+
# An unbuffered `tail -c+N`
|
35 |
+
skip_bytes() {
|
36 |
+
LANG=C IFS= read -r -n "$1" -d '' c
|
37 |
+
while LANG=C IFS= read -r -n 1 -d '' c; do
|
38 |
+
printf '%s' "$c"
|
39 |
+
done
|
40 |
+
}
|
41 |
+
|
42 |
+
mkdir -p "$CHAT_SAVE_DIR"
|
43 |
+
echo >"$LOG"
|
44 |
+
trap "tail -n100 ${LOG}" EXIT
|
45 |
+
|
46 |
+
if [[ ! -e "$CUR_PROMPT_FILE" ]]; then
|
47 |
+
sed -e "s/\[\[USER_NAME\]\]/${USER_NAME}/g" \
|
48 |
+
-e "s/\[\[AI_NAME\]\]/${AI_NAME}/g" \
|
49 |
+
-e "s/\[\[DATE_TIME\]\]/${DATE_TIME}/g" \
|
50 |
+
-e "s/\[\[DATE_YEAR\]\]/${DATE_YEAR}/g" \
|
51 |
+
"$PROMPT_TEMPLATE" >"$CUR_PROMPT_FILE"
|
52 |
+
fi
|
53 |
+
|
54 |
+
if [[ ! -e "$NEXT_PROMPT_FILE" ]]; then
|
55 |
+
sed -r "$SED_DELETE_MESSAGES" "$CUR_PROMPT_FILE" >"$NEXT_PROMPT_FILE"
|
56 |
+
fi
|
57 |
+
|
58 |
+
if [[ "$(tail -c4 "$NEXT_PROMPT_FILE")" != "..." ]]; then
|
59 |
+
echo '...' >>"$NEXT_PROMPT_FILE"
|
60 |
+
fi
|
61 |
+
|
62 |
+
if [[ ! -e "$PROMPT_CACHE_FILE" ]]; then
|
63 |
+
echo 'Prompt cache does not exist, building...'
|
64 |
+
# Default batch_size to 8 here for better user feedback during initial prompt processing
|
65 |
+
./main 2>>"$LOG" \
|
66 |
+
--batch_size 8 \
|
67 |
+
"${OPTS[@]}" \
|
68 |
+
--prompt-cache "$PROMPT_CACHE_FILE" \
|
69 |
+
--file "$CUR_PROMPT_FILE" \
|
70 |
+
--n_predict 1
|
71 |
+
echo
|
72 |
+
echo 'Done!'
|
73 |
+
fi
|
74 |
+
|
75 |
+
if [[ ! -e "$CUR_PROMPT_CACHE" ]]; then
|
76 |
+
cp "$PROMPT_CACHE_FILE" "$CUR_PROMPT_CACHE"
|
77 |
+
fi
|
78 |
+
if [[ ! -e "$NEXT_PROMPT_CACHE" ]]; then
|
79 |
+
cp "$PROMPT_CACHE_FILE" "$NEXT_PROMPT_CACHE"
|
80 |
+
fi
|
81 |
+
|
82 |
+
printf '%s ' "$(< "$CUR_PROMPT_FILE")"
|
83 |
+
n_tokens=0
|
84 |
+
|
85 |
+
while read -e line; do
|
86 |
+
# Limit generation to remaining context, with a buffer and estimating 2 chars/token for input
|
87 |
+
n_predict=$((CTX_SIZE - n_tokens - ${#line} / 2 - 32))
|
88 |
+
|
89 |
+
# Swap prompts when we're about to run out of context
|
90 |
+
if ((n_predict <= 0)); then
|
91 |
+
wait # for background main (below) to finish with next prompt
|
92 |
+
mv "$NEXT_PROMPT_FILE" "$CUR_PROMPT_FILE"
|
93 |
+
mv "$NEXT_PROMPT_CACHE" "$CUR_PROMPT_CACHE"
|
94 |
+
|
95 |
+
sed -r "$SED_DELETE_MESSAGES" "$CUR_PROMPT_FILE" >"$NEXT_PROMPT_FILE"
|
96 |
+
echo '...' >>"$NEXT_PROMPT_FILE"
|
97 |
+
cp "$PROMPT_CACHE_FILE" "$NEXT_PROMPT_CACHE"
|
98 |
+
|
99 |
+
n_tokens=0
|
100 |
+
n_predict=$((CTX_SIZE / 2))
|
101 |
+
fi
|
102 |
+
|
103 |
+
echo " ${line}" >>"$CUR_PROMPT_FILE"
|
104 |
+
if ((n_tokens > CTX_ROTATE_POINT)); then
|
105 |
+
echo " ${line}" >>"$NEXT_PROMPT_FILE"
|
106 |
+
fi
|
107 |
+
|
108 |
+
n_prompt_len_pre=$(($(wc -c <"$CUR_PROMPT_FILE")))
|
109 |
+
|
110 |
+
printf '%s: ' "$AI_NAME" >>"$CUR_PROMPT_FILE"
|
111 |
+
|
112 |
+
./main 2>>"$LOG" "${OPTS[@]}" \
|
113 |
+
--prompt-cache "$CUR_PROMPT_CACHE" \
|
114 |
+
--prompt-cache-all \
|
115 |
+
--file "$CUR_PROMPT_FILE" \
|
116 |
+
--reverse-prompt "${USER_NAME}:" \
|
117 |
+
--n_predict "$n_predict" |
|
118 |
+
skip_bytes 1 | # skip BOS token added by ./main
|
119 |
+
tee "$CUR_PROMPT_FILE.tmp" | # save prompt + generation to tmp file
|
120 |
+
skip_bytes "$n_prompt_len_pre" # print generation
|
121 |
+
|
122 |
+
mv "$CUR_PROMPT_FILE.tmp" "$CUR_PROMPT_FILE"
|
123 |
+
|
124 |
+
# if we hit n_predict instead of reverse-prompt, we need to add the prompt
|
125 |
+
if [[ "$(tail -n1 "$CUR_PROMPT_FILE")" != "${USER_NAME}:" ]]; then
|
126 |
+
printf '\n%s:' "$USER_NAME"
|
127 |
+
printf '\n%s:' "$USER_NAME" >> "$CUR_PROMPT_FILE"
|
128 |
+
fi
|
129 |
+
|
130 |
+
printf ' '
|
131 |
+
|
132 |
+
# HACK get num tokens from debug message
|
133 |
+
# TODO get both messages in one go
|
134 |
+
if ! session_size_msg="$(tail -n30 "$LOG" | grep -oE "$SESSION_SIZE_MSG_PATTERN")" ||
|
135 |
+
! sample_time_msg="$( tail -n10 "$LOG" | grep -oE "$SAMPLE_TIME_MSG_PATTERN")"; then
|
136 |
+
echo >&2 "Couldn't get number of tokens from ./main output!"
|
137 |
+
exit 1
|
138 |
+
fi
|
139 |
+
|
140 |
+
n_tokens=$(($(cut -d/ -f2 <<<"$session_size_msg") + $(cut -d/ -f2 <<<"$sample_time_msg")))
|
141 |
+
|
142 |
+
if ((n_tokens > CTX_ROTATE_POINT)); then
|
143 |
+
tail -c+$((n_prompt_len_pre + 1)) "$CUR_PROMPT_FILE" >>"$NEXT_PROMPT_FILE"
|
144 |
+
fi
|
145 |
+
|
146 |
+
# Update cache for next prompt in background, ideally during user input
|
147 |
+
./main >>"$LOG_BG" 2>&1 "${OPTS[@]}" \
|
148 |
+
--prompt-cache "$NEXT_PROMPT_CACHE" \
|
149 |
+
--file "$NEXT_PROMPT_FILE" \
|
150 |
+
--n_predict 1 &
|
151 |
+
done
|
examples/chat-vicuna.sh
ADDED
@@ -0,0 +1,41 @@
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
1 |
+
#!/bin/bash
|
2 |
+
|
3 |
+
set -e
|
4 |
+
|
5 |
+
cd "$(dirname "$0")/.." || exit
|
6 |
+
|
7 |
+
MODEL="${MODEL:-./models/ggml-vic13b-uncensored-q5_0.bin}"
|
8 |
+
PROMPT_TEMPLATE=${PROMPT_TEMPLATE:-./prompts/chat.txt}
|
9 |
+
USER_NAME="### Human"
|
10 |
+
AI_NAME="### Assistant"
|
11 |
+
|
12 |
+
# Adjust to the number of CPU cores you want to use.
|
13 |
+
N_THREAD="${N_THREAD:-8}"
|
14 |
+
# Number of tokens to predict (made it larger than default because we want a long interaction)
|
15 |
+
N_PREDICTS="${N_PREDICTS:-2048}"
|
16 |
+
|
17 |
+
# Note: you can also override the generation options by specifying them on the command line:
|
18 |
+
# For example, override the context size by doing: ./chatLLaMa --ctx_size 1024
|
19 |
+
GEN_OPTIONS="${GEN_OPTIONS:---ctx_size 2048 --temp 0.7 --top_k 40 --top_p 0.5 --repeat_last_n 256 --batch_size 1024 --repeat_penalty 1.17647}"
|
20 |
+
|
21 |
+
DATE_TIME=$(date +%H:%M)
|
22 |
+
DATE_YEAR=$(date +%Y)
|
23 |
+
|
24 |
+
PROMPT_FILE=$(mktemp -t llamacpp_prompt.XXXXXXX.txt)
|
25 |
+
|
26 |
+
sed -e "s/\[\[USER_NAME\]\]/$USER_NAME/g" \
|
27 |
+
-e "s/\[\[AI_NAME\]\]/$AI_NAME/g" \
|
28 |
+
-e "s/\[\[DATE_TIME\]\]/$DATE_TIME/g" \
|
29 |
+
-e "s/\[\[DATE_YEAR\]\]/$DATE_YEAR/g" \
|
30 |
+
$PROMPT_TEMPLATE > $PROMPT_FILE
|
31 |
+
|
32 |
+
# shellcheck disable=SC2086 # Intended splitting of GEN_OPTIONS
|
33 |
+
./bin/main $GEN_OPTIONS \
|
34 |
+
--model "$MODEL" \
|
35 |
+
--threads "$N_THREAD" \
|
36 |
+
--n_predict "$N_PREDICTS" \
|
37 |
+
--color --interactive \
|
38 |
+
--file ${PROMPT_FILE} \
|
39 |
+
--reverse-prompt "### Human:" \
|
40 |
+
--in-prefix ' ' \
|
41 |
+
"$@"
|
examples/chat.sh
ADDED
@@ -0,0 +1,16 @@
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
1 |
+
#!/bin/bash
|
2 |
+
|
3 |
+
#
|
4 |
+
# Temporary script - will be removed in the future
|
5 |
+
#
|
6 |
+
|
7 |
+
cd `dirname $0`
|
8 |
+
cd ..
|
9 |
+
|
10 |
+
# Important:
|
11 |
+
#
|
12 |
+
# "--keep 48" is based on the contents of prompts/chat-with-bob.txt
|
13 |
+
#
|
14 |
+
./main -m ./models/7B/ggml-model-q4_0.bin -c 512 -b 1024 -n 256 --keep 48 \
|
15 |
+
--repeat_penalty 1.0 --color -i \
|
16 |
+
-r "User:" -f prompts/chat-with-bob.txt
|
examples/common.cpp
ADDED
@@ -0,0 +1,955 @@
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
1 |
+
#include "common.h"
|
2 |
+
|
3 |
+
#include <cassert>
|
4 |
+
#include <iostream>
|
5 |
+
#include <cstring>
|
6 |
+
#include <fstream>
|
7 |
+
#include <string>
|
8 |
+
#include <iterator>
|
9 |
+
#include <algorithm>
|
10 |
+
#include <sstream>
|
11 |
+
#include <unordered_set>
|
12 |
+
#include <regex>
|
13 |
+
|
14 |
+
#if defined(__APPLE__) && defined(__MACH__)
|
15 |
+
#include <sys/types.h>
|
16 |
+
#include <sys/sysctl.h>
|
17 |
+
#endif
|
18 |
+
|
19 |
+
#if defined(_WIN32)
|
20 |
+
#define WIN32_LEAN_AND_MEAN
|
21 |
+
#define NOMINMAX
|
22 |
+
#include <windows.h>
|
23 |
+
#include <fcntl.h>
|
24 |
+
#include <io.h>
|
25 |
+
#else
|
26 |
+
#include <sys/ioctl.h>
|
27 |
+
#include <unistd.h>
|
28 |
+
#include <wchar.h>
|
29 |
+
#endif
|
30 |
+
|
31 |
+
#if defined(_MSC_VER)
|
32 |
+
#pragma warning(disable: 4244 4267) // possible loss of data
|
33 |
+
#endif
|
34 |
+
|
35 |
+
int32_t get_num_physical_cores() {
|
36 |
+
#ifdef __linux__
|
37 |
+
// enumerate the set of thread siblings, num entries is num cores
|
38 |
+
std::unordered_set<std::string> siblings;
|
39 |
+
for (uint32_t cpu=0; cpu < UINT32_MAX; ++cpu) {
|
40 |
+
std::ifstream thread_siblings("/sys/devices/system/cpu"
|
41 |
+
+ std::to_string(cpu) + "/topology/thread_siblings");
|
42 |
+
if (!thread_siblings.is_open()) {
|
43 |
+
break; // no more cpus
|
44 |
+
}
|
45 |
+
std::string line;
|
46 |
+
if (std::getline(thread_siblings, line)) {
|
47 |
+
siblings.insert(line);
|
48 |
+
}
|
49 |
+
}
|
50 |
+
if (siblings.size() > 0) {
|
51 |
+
return static_cast<int32_t>(siblings.size());
|
52 |
+
}
|
53 |
+
#elif defined(__APPLE__) && defined(__MACH__)
|
54 |
+
int32_t num_physical_cores;
|
55 |
+
size_t len = sizeof(num_physical_cores);
|
56 |
+
int result = sysctlbyname("hw.perflevel0.physicalcpu", &num_physical_cores, &len, NULL, 0);
|
57 |
+
if (result == 0) {
|
58 |
+
return num_physical_cores;
|
59 |
+
}
|
60 |
+
result = sysctlbyname("hw.physicalcpu", &num_physical_cores, &len, NULL, 0);
|
61 |
+
if (result == 0) {
|
62 |
+
return num_physical_cores;
|
63 |
+
}
|
64 |
+
#elif defined(_WIN32)
|
65 |
+
//TODO: Implement
|
66 |
+
#endif
|
67 |
+
unsigned int n_threads = std::thread::hardware_concurrency();
|
68 |
+
return n_threads > 0 ? (n_threads <= 4 ? n_threads : n_threads / 2) : 4;
|
69 |
+
}
|
70 |
+
|
71 |
+
void process_escapes(std::string& input) {
|
72 |
+
std::size_t input_len = input.length();
|
73 |
+
std::size_t output_idx = 0;
|
74 |
+
|
75 |
+
for (std::size_t input_idx = 0; input_idx < input_len; ++input_idx) {
|
76 |
+
if (input[input_idx] == '\\' && input_idx + 1 < input_len) {
|
77 |
+
switch (input[++input_idx]) {
|
78 |
+
case 'n': input[output_idx++] = '\n'; break;
|
79 |
+
case 'r': input[output_idx++] = '\r'; break;
|
80 |
+
case 't': input[output_idx++] = '\t'; break;
|
81 |
+
case '\'': input[output_idx++] = '\''; break;
|
82 |
+
case '\"': input[output_idx++] = '\"'; break;
|
83 |
+
case '\\': input[output_idx++] = '\\'; break;
|
84 |
+
default: input[output_idx++] = '\\';
|
85 |
+
input[output_idx++] = input[input_idx]; break;
|
86 |
+
}
|
87 |
+
} else {
|
88 |
+
input[output_idx++] = input[input_idx];
|
89 |
+
}
|
90 |
+
}
|
91 |
+
|
92 |
+
input.resize(output_idx);
|
93 |
+
}
|
94 |
+
|
95 |
+
bool gpt_params_parse(int argc, char ** argv, gpt_params & params) {
|
96 |
+
bool invalid_param = false;
|
97 |
+
bool escape_prompt = false;
|
98 |
+
std::string arg;
|
99 |
+
gpt_params default_params;
|
100 |
+
const std::string arg_prefix = "--";
|
101 |
+
|
102 |
+
for (int i = 1; i < argc; i++) {
|
103 |
+
arg = argv[i];
|
104 |
+
if (arg.compare(0, arg_prefix.size(), arg_prefix) == 0) {
|
105 |
+
std::replace(arg.begin(), arg.end(), '_', '-');
|
106 |
+
}
|
107 |
+
|
108 |
+
if (arg == "-s" || arg == "--seed") {
|
109 |
+
if (++i >= argc) {
|
110 |
+
invalid_param = true;
|
111 |
+
break;
|
112 |
+
}
|
113 |
+
params.seed = std::stoi(argv[i]);
|
114 |
+
} else if (arg == "-t" || arg == "--threads") {
|
115 |
+
if (++i >= argc) {
|
116 |
+
invalid_param = true;
|
117 |
+
break;
|
118 |
+
}
|
119 |
+
params.n_threads = std::stoi(argv[i]);
|
120 |
+
} else if (arg == "-p" || arg == "--prompt") {
|
121 |
+
if (++i >= argc) {
|
122 |
+
invalid_param = true;
|
123 |
+
break;
|
124 |
+
}
|
125 |
+
params.prompt = argv[i];
|
126 |
+
} else if (arg == "-e") {
|
127 |
+
escape_prompt = true;
|
128 |
+
} else if (arg == "--prompt-cache") {
|
129 |
+
if (++i >= argc) {
|
130 |
+
invalid_param = true;
|
131 |
+
break;
|
132 |
+
}
|
133 |
+
params.path_prompt_cache = argv[i];
|
134 |
+
} else if (arg == "--prompt-cache-all") {
|
135 |
+
params.prompt_cache_all = true;
|
136 |
+
} else if (arg == "--prompt-cache-ro") {
|
137 |
+
params.prompt_cache_ro = true;
|
138 |
+
} else if (arg == "-f" || arg == "--file") {
|
139 |
+
if (++i >= argc) {
|
140 |
+
invalid_param = true;
|
141 |
+
break;
|
142 |
+
}
|
143 |
+
std::ifstream file(argv[i]);
|
144 |
+
if (!file) {
|
145 |
+
fprintf(stderr, "error: failed to open file '%s'\n", argv[i]);
|
146 |
+
invalid_param = true;
|
147 |
+
break;
|
148 |
+
}
|
149 |
+
std::copy(std::istreambuf_iterator<char>(file), std::istreambuf_iterator<char>(), back_inserter(params.prompt));
|
150 |
+
if (params.prompt.back() == '\n') {
|
151 |
+
params.prompt.pop_back();
|
152 |
+
}
|
153 |
+
} else if (arg == "-n" || arg == "--n-predict") {
|
154 |
+
if (++i >= argc) {
|
155 |
+
invalid_param = true;
|
156 |
+
break;
|
157 |
+
}
|
158 |
+
params.n_predict = std::stoi(argv[i]);
|
159 |
+
} else if (arg == "--top-k") {
|
160 |
+
if (++i >= argc) {
|
161 |
+
invalid_param = true;
|
162 |
+
break;
|
163 |
+
}
|
164 |
+
params.top_k = std::stoi(argv[i]);
|
165 |
+
} else if (arg == "-c" || arg == "--ctx-size") {
|
166 |
+
if (++i >= argc) {
|
167 |
+
invalid_param = true;
|
168 |
+
break;
|
169 |
+
}
|
170 |
+
params.n_ctx = std::stoi(argv[i]);
|
171 |
+
} else if (arg == "--memory-f32") {
|
172 |
+
params.memory_f16 = false;
|
173 |
+
} else if (arg == "--top-p") {
|
174 |
+
if (++i >= argc) {
|
175 |
+
invalid_param = true;
|
176 |
+
break;
|
177 |
+
}
|
178 |
+
params.top_p = std::stof(argv[i]);
|
179 |
+
} else if (arg == "--temp") {
|
180 |
+
if (++i >= argc) {
|
181 |
+
invalid_param = true;
|
182 |
+
break;
|
183 |
+
}
|
184 |
+
params.temp = std::stof(argv[i]);
|
185 |
+
} else if (arg == "--tfs") {
|
186 |
+
if (++i >= argc) {
|
187 |
+
invalid_param = true;
|
188 |
+
break;
|
189 |
+
}
|
190 |
+
params.tfs_z = std::stof(argv[i]);
|
191 |
+
} else if (arg == "--typical") {
|
192 |
+
if (++i >= argc) {
|
193 |
+
invalid_param = true;
|
194 |
+
break;
|
195 |
+
}
|
196 |
+
params.typical_p = std::stof(argv[i]);
|
197 |
+
} else if (arg == "--repeat-last-n") {
|
198 |
+
if (++i >= argc) {
|
199 |
+
invalid_param = true;
|
200 |
+
break;
|
201 |
+
}
|
202 |
+
params.repeat_last_n = std::stoi(argv[i]);
|
203 |
+
} else if (arg == "--repeat-penalty") {
|
204 |
+
if (++i >= argc) {
|
205 |
+
invalid_param = true;
|
206 |
+
break;
|
207 |
+
}
|
208 |
+
params.repeat_penalty = std::stof(argv[i]);
|
209 |
+
} else if (arg == "--frequency-penalty") {
|
210 |
+
if (++i >= argc) {
|
211 |
+
invalid_param = true;
|
212 |
+
break;
|
213 |
+
}
|
214 |
+
params.frequency_penalty = std::stof(argv[i]);
|
215 |
+
} else if (arg == "--presence-penalty") {
|
216 |
+
if (++i >= argc) {
|
217 |
+
invalid_param = true;
|
218 |
+
break;
|
219 |
+
}
|
220 |
+
params.presence_penalty = std::stof(argv[i]);
|
221 |
+
} else if (arg == "--mirostat") {
|
222 |
+
if (++i >= argc) {
|
223 |
+
invalid_param = true;
|
224 |
+
break;
|
225 |
+
}
|
226 |
+
params.mirostat = std::stoi(argv[i]);
|
227 |
+
} else if (arg == "--mirostat-lr") {
|
228 |
+
if (++i >= argc) {
|
229 |
+
invalid_param = true;
|
230 |
+
break;
|
231 |
+
}
|
232 |
+
params.mirostat_eta = std::stof(argv[i]);
|
233 |
+
} else if (arg == "--mirostat-ent") {
|
234 |
+
if (++i >= argc) {
|
235 |
+
invalid_param = true;
|
236 |
+
break;
|
237 |
+
}
|
238 |
+
params.mirostat_tau = std::stof(argv[i]);
|
239 |
+
} else if (arg == "-b" || arg == "--batch-size") {
|
240 |
+
if (++i >= argc) {
|
241 |
+
invalid_param = true;
|
242 |
+
break;
|
243 |
+
}
|
244 |
+
params.n_batch = std::stoi(argv[i]);
|
245 |
+
params.n_batch = std::min(512, params.n_batch);
|
246 |
+
} else if (arg == "--keep") {
|
247 |
+
if (++i >= argc) {
|
248 |
+
invalid_param = true;
|
249 |
+
break;
|
250 |
+
}
|
251 |
+
params.n_keep = std::stoi(argv[i]);
|
252 |
+
} else if (arg == "-m" || arg == "--model") {
|
253 |
+
if (++i >= argc) {
|
254 |
+
invalid_param = true;
|
255 |
+
break;
|
256 |
+
}
|
257 |
+
params.model = argv[i];
|
258 |
+
} else if (arg == "-a" || arg == "--alias") {
|
259 |
+
if (++i >= argc) {
|
260 |
+
invalid_param = true;
|
261 |
+
break;
|
262 |
+
}
|
263 |
+
params.model_alias = argv[i];
|
264 |
+
} else if (arg == "--lora") {
|
265 |
+
if (++i >= argc) {
|
266 |
+
invalid_param = true;
|
267 |
+
break;
|
268 |
+
}
|
269 |
+
params.lora_adapter = argv[i];
|
270 |
+
params.use_mmap = false;
|
271 |
+
} else if (arg == "--lora-base") {
|
272 |
+
if (++i >= argc) {
|
273 |
+
invalid_param = true;
|
274 |
+
break;
|
275 |
+
}
|
276 |
+
params.lora_base = argv[i];
|
277 |
+
} else if (arg == "-i" || arg == "--interactive") {
|
278 |
+
params.interactive = true;
|
279 |
+
} else if (arg == "--embedding") {
|
280 |
+
params.embedding = true;
|
281 |
+
} else if (arg == "--interactive-first") {
|
282 |
+
params.interactive_first = true;
|
283 |
+
} else if (arg == "-ins" || arg == "--instruct") {
|
284 |
+
params.instruct = true;
|
285 |
+
} else if (arg == "--multiline-input") {
|
286 |
+
params.multiline_input = true;
|
287 |
+
} else if (arg == "--color") {
|
288 |
+
params.use_color = true;
|
289 |
+
} else if (arg == "--mlock") {
|
290 |
+
params.use_mlock = true;
|
291 |
+
} else if (arg == "--gpu-layers" || arg == "-ngl" || arg == "--n-gpu-layers") {
|
292 |
+
if (++i >= argc) {
|
293 |
+
invalid_param = true;
|
294 |
+
break;
|
295 |
+
}
|
296 |
+
#ifdef LLAMA_SUPPORTS_GPU_OFFLOAD
|
297 |
+
params.n_gpu_layers = std::stoi(argv[i]);
|
298 |
+
#else
|
299 |
+
fprintf(stderr, "warning: not compiled with GPU offload support, --n-gpu-layers option will be ignored\n");
|
300 |
+
fprintf(stderr, "warning: see main README.md for information on enabling GPU BLAS support\n");
|
301 |
+
#endif
|
302 |
+
} else if (arg == "--main-gpu" || arg == "-mg") {
|
303 |
+
if (++i >= argc) {
|
304 |
+
invalid_param = true;
|
305 |
+
break;
|
306 |
+
}
|
307 |
+
#ifdef GGML_USE_CUBLAS
|
308 |
+
params.main_gpu = std::stoi(argv[i]);
|
309 |
+
#else
|
310 |
+
fprintf(stderr, "warning: llama.cpp was compiled without cuBLAS. It is not possible to set a main GPU.\n");
|
311 |
+
#endif
|
312 |
+
} else if (arg == "--tensor-split" || arg == "-ts") {
|
313 |
+
if (++i >= argc) {
|
314 |
+
invalid_param = true;
|
315 |
+
break;
|
316 |
+
}
|
317 |
+
#ifdef GGML_USE_CUBLAS
|
318 |
+
std::string arg_next = argv[i];
|
319 |
+
|
320 |
+
// split string by , and /
|
321 |
+
const std::regex regex{R"([,/]+)"};
|
322 |
+
std::sregex_token_iterator it{arg_next.begin(), arg_next.end(), regex, -1};
|
323 |
+
std::vector<std::string> split_arg{it, {}};
|
324 |
+
GGML_ASSERT(split_arg.size() <= LLAMA_MAX_DEVICES);
|
325 |
+
|
326 |
+
for (size_t i = 0; i < LLAMA_MAX_DEVICES; ++i) {
|
327 |
+
if (i < split_arg.size()) {
|
328 |
+
params.tensor_split[i] = std::stof(split_arg[i]);
|
329 |
+
} else {
|
330 |
+
params.tensor_split[i] = 0.0f;
|
331 |
+
}
|
332 |
+
}
|
333 |
+
#else
|
334 |
+
fprintf(stderr, "warning: llama.cpp was compiled without cuBLAS. It is not possible to set a tensor split.\n");
|
335 |
+
#endif // GGML_USE_CUBLAS
|
336 |
+
} else if (arg == "--low-vram" || arg == "-lv") {
|
337 |
+
#ifdef GGML_USE_CUBLAS
|
338 |
+
params.low_vram = true;
|
339 |
+
#else
|
340 |
+
fprintf(stderr, "warning: llama.cpp was compiled without cuBLAS. It is not possible to set lower vram usage.\n");
|
341 |
+
#endif // GGML_USE_CUBLAS
|
342 |
+
} else if (arg == "--no-mmap") {
|
343 |
+
params.use_mmap = false;
|
344 |
+
} else if (arg == "--mtest") {
|
345 |
+
params.mem_test = true;
|
346 |
+
} else if (arg == "--export") {
|
347 |
+
params.export_cgraph = true;
|
348 |
+
} else if (arg == "--verbose-prompt") {
|
349 |
+
params.verbose_prompt = true;
|
350 |
+
} else if (arg == "-r" || arg == "--reverse-prompt") {
|
351 |
+
if (++i >= argc) {
|
352 |
+
invalid_param = true;
|
353 |
+
break;
|
354 |
+
}
|
355 |
+
params.antiprompt.push_back(argv[i]);
|
356 |
+
} else if (arg == "--perplexity") {
|
357 |
+
params.perplexity = true;
|
358 |
+
} else if (arg == "--ignore-eos") {
|
359 |
+
params.logit_bias[llama_token_eos()] = -INFINITY;
|
360 |
+
} else if (arg == "--no-penalize-nl") {
|
361 |
+
params.penalize_nl = false;
|
362 |
+
} else if (arg == "-l" || arg == "--logit-bias") {
|
363 |
+
if (++i >= argc) {
|
364 |
+
invalid_param = true;
|
365 |
+
break;
|
366 |
+
}
|
367 |
+
std::stringstream ss(argv[i]);
|
368 |
+
llama_token key;
|
369 |
+
char sign;
|
370 |
+
std::string value_str;
|
371 |
+
try {
|
372 |
+
if (ss >> key && ss >> sign && std::getline(ss, value_str) && (sign == '+' || sign == '-')) {
|
373 |
+
params.logit_bias[key] = std::stof(value_str) * ((sign == '-') ? -1.0f : 1.0f);
|
374 |
+
} else {
|
375 |
+
throw std::exception();
|
376 |
+
}
|
377 |
+
} catch (const std::exception&) {
|
378 |
+
invalid_param = true;
|
379 |
+
break;
|
380 |
+
}
|
381 |
+
} else if (arg == "-h" || arg == "--help") {
|
382 |
+
gpt_print_usage(argc, argv, default_params);
|
383 |
+
exit(0);
|
384 |
+
} else if (arg == "--random-prompt") {
|
385 |
+
params.random_prompt = true;
|
386 |
+
} else if (arg == "--in-prefix") {
|
387 |
+
if (++i >= argc) {
|
388 |
+
invalid_param = true;
|
389 |
+
break;
|
390 |
+
}
|
391 |
+
params.input_prefix = argv[i];
|
392 |
+
} else if (arg == "--in-suffix") {
|
393 |
+
if (++i >= argc) {
|
394 |
+
invalid_param = true;
|
395 |
+
break;
|
396 |
+
}
|
397 |
+
params.input_suffix = argv[i];
|
398 |
+
} else {
|
399 |
+
fprintf(stderr, "error: unknown argument: %s\n", arg.c_str());
|
400 |
+
gpt_print_usage(argc, argv, default_params);
|
401 |
+
exit(1);
|
402 |
+
}
|
403 |
+
}
|
404 |
+
if (invalid_param) {
|
405 |
+
fprintf(stderr, "error: invalid parameter for argument: %s\n", arg.c_str());
|
406 |
+
gpt_print_usage(argc, argv, default_params);
|
407 |
+
exit(1);
|
408 |
+
}
|
409 |
+
if (params.prompt_cache_all &&
|
410 |
+
(params.interactive || params.interactive_first ||
|
411 |
+
params.instruct)) {
|
412 |
+
fprintf(stderr, "error: --prompt-cache-all not supported in interactive mode yet\n");
|
413 |
+
gpt_print_usage(argc, argv, default_params);
|
414 |
+
exit(1);
|
415 |
+
}
|
416 |
+
|
417 |
+
#ifdef GGML_USE_CUBLAS
|
418 |
+
if (!params.lora_adapter.empty() && params.n_gpu_layers > 0) {
|
419 |
+
fprintf(stderr, "%s: error: the simultaneous use of LoRAs and GPU acceleration is not supported", __func__);
|
420 |
+
exit(1);
|
421 |
+
}
|
422 |
+
#endif // GGML_USE_CUBLAS
|
423 |
+
|
424 |
+
if (escape_prompt) {
|
425 |
+
process_escapes(params.prompt);
|
426 |
+
}
|
427 |
+
|
428 |
+
return true;
|
429 |
+
}
|
430 |
+
|
431 |
+
void gpt_print_usage(int /*argc*/, char ** argv, const gpt_params & params) {
|
432 |
+
fprintf(stderr, "usage: %s [options]\n", argv[0]);
|
433 |
+
fprintf(stderr, "\n");
|
434 |
+
fprintf(stderr, "options:\n");
|
435 |
+
fprintf(stderr, " -h, --help show this help message and exit\n");
|
436 |
+
fprintf(stderr, " -i, --interactive run in interactive mode\n");
|
437 |
+
fprintf(stderr, " --interactive-first run in interactive mode and wait for input right away\n");
|
438 |
+
fprintf(stderr, " -ins, --instruct run in instruction mode (use with Alpaca models)\n");
|
439 |
+
fprintf(stderr, " --multiline-input allows you to write or paste multiple lines without ending each in '\\'\n");
|
440 |
+
fprintf(stderr, " -r PROMPT, --reverse-prompt PROMPT\n");
|
441 |
+
fprintf(stderr, " halt generation at PROMPT, return control in interactive mode\n");
|
442 |
+
fprintf(stderr, " (can be specified more than once for multiple prompts).\n");
|
443 |
+
fprintf(stderr, " --color colorise output to distinguish prompt and user input from generations\n");
|
444 |
+
fprintf(stderr, " -s SEED, --seed SEED RNG seed (default: -1, use random seed for < 0)\n");
|
445 |
+
fprintf(stderr, " -t N, --threads N number of threads to use during computation (default: %d)\n", params.n_threads);
|
446 |
+
fprintf(stderr, " -p PROMPT, --prompt PROMPT\n");
|
447 |
+
fprintf(stderr, " prompt to start generation with (default: empty)\n");
|
448 |
+
fprintf(stderr, " -e process prompt escapes sequences (\\n, \\r, \\t, \\', \\\", \\\\)\n");
|
449 |
+
fprintf(stderr, " --prompt-cache FNAME file to cache prompt state for faster startup (default: none)\n");
|
450 |
+
fprintf(stderr, " --prompt-cache-all if specified, saves user input and generations to cache as well.\n");
|
451 |
+
fprintf(stderr, " not supported with --interactive or other interactive options\n");
|
452 |
+
fprintf(stderr, " --prompt-cache-ro if specified, uses the prompt cache but does not update it.\n");
|
453 |
+
fprintf(stderr, " --random-prompt start with a randomized prompt.\n");
|
454 |
+
fprintf(stderr, " --in-prefix STRING string to prefix user inputs with (default: empty)\n");
|
455 |
+
fprintf(stderr, " --in-suffix STRING string to suffix after user inputs with (default: empty)\n");
|
456 |
+
fprintf(stderr, " -f FNAME, --file FNAME\n");
|
457 |
+
fprintf(stderr, " prompt file to start generation.\n");
|
458 |
+
fprintf(stderr, " -n N, --n-predict N number of tokens to predict (default: %d, -1 = infinity)\n", params.n_predict);
|
459 |
+
fprintf(stderr, " --top-k N top-k sampling (default: %d, 0 = disabled)\n", params.top_k);
|
460 |
+
fprintf(stderr, " --top-p N top-p sampling (default: %.1f, 1.0 = disabled)\n", (double)params.top_p);
|
461 |
+
fprintf(stderr, " --tfs N tail free sampling, parameter z (default: %.1f, 1.0 = disabled)\n", (double)params.tfs_z);
|
462 |
+
fprintf(stderr, " --typical N locally typical sampling, parameter p (default: %.1f, 1.0 = disabled)\n", (double)params.typical_p);
|
463 |
+
fprintf(stderr, " --repeat-last-n N last n tokens to consider for penalize (default: %d, 0 = disabled, -1 = ctx_size)\n", params.repeat_last_n);
|
464 |
+
fprintf(stderr, " --repeat-penalty N penalize repeat sequence of tokens (default: %.1f, 1.0 = disabled)\n", (double)params.repeat_penalty);
|
465 |
+
fprintf(stderr, " --presence-penalty N repeat alpha presence penalty (default: %.1f, 0.0 = disabled)\n", (double)params.presence_penalty);
|
466 |
+
fprintf(stderr, " --frequency-penalty N repeat alpha frequency penalty (default: %.1f, 0.0 = disabled)\n", (double)params.frequency_penalty);
|
467 |
+
fprintf(stderr, " --mirostat N use Mirostat sampling.\n");
|
468 |
+
fprintf(stderr, " Top K, Nucleus, Tail Free and Locally Typical samplers are ignored if used.\n");
|
469 |
+
fprintf(stderr, " (default: %d, 0 = disabled, 1 = Mirostat, 2 = Mirostat 2.0)\n", params.mirostat);
|
470 |
+
fprintf(stderr, " --mirostat-lr N Mirostat learning rate, parameter eta (default: %.1f)\n", (double)params.mirostat_eta);
|
471 |
+
fprintf(stderr, " --mirostat-ent N Mirostat target entropy, parameter tau (default: %.1f)\n", (double)params.mirostat_tau);
|
472 |
+
fprintf(stderr, " -l TOKEN_ID(+/-)BIAS, --logit-bias TOKEN_ID(+/-)BIAS\n");
|
473 |
+
fprintf(stderr, " modifies the likelihood of token appearing in the completion,\n");
|
474 |
+
fprintf(stderr, " i.e. `--logit-bias 15043+1` to increase likelihood of token ' Hello',\n");
|
475 |
+
fprintf(stderr, " or `--logit-bias 15043-1` to decrease likelihood of token ' Hello'\n");
|
476 |
+
fprintf(stderr, " -c N, --ctx-size N size of the prompt context (default: %d)\n", params.n_ctx);
|
477 |
+
fprintf(stderr, " --ignore-eos ignore end of stream token and continue generating (implies --logit-bias 2-inf)\n");
|
478 |
+
fprintf(stderr, " --no-penalize-nl do not penalize newline token\n");
|
479 |
+
fprintf(stderr, " --memory-f32 use f32 instead of f16 for memory key+value (default: disabled)\n");
|
480 |
+
fprintf(stderr, " not recommended: doubles context memory required and no measurable increase in quality\n");
|
481 |
+
fprintf(stderr, " --temp N temperature (default: %.1f)\n", (double)params.temp);
|
482 |
+
fprintf(stderr, " -b N, --batch-size N batch size for prompt processing (default: %d)\n", params.n_batch);
|
483 |
+
fprintf(stderr, " --perplexity compute perplexity over the prompt\n");
|
484 |
+
fprintf(stderr, " --keep number of tokens to keep from the initial prompt (default: %d, -1 = all)\n", params.n_keep);
|
485 |
+
if (llama_mlock_supported()) {
|
486 |
+
fprintf(stderr, " --mlock force system to keep model in RAM rather than swapping or compressing\n");
|
487 |
+
}
|
488 |
+
if (llama_mmap_supported()) {
|
489 |
+
fprintf(stderr, " --no-mmap do not memory-map model (slower load but may reduce pageouts if not using mlock)\n");
|
490 |
+
}
|
491 |
+
#ifdef LLAMA_SUPPORTS_GPU_OFFLOAD
|
492 |
+
fprintf(stderr, " -ngl N, --n-gpu-layers N\n");
|
493 |
+
fprintf(stderr, " number of layers to store in VRAM\n");
|
494 |
+
fprintf(stderr, " -ts SPLIT --tensor-split SPLIT\n");
|
495 |
+
fprintf(stderr, " how to split tensors across multiple GPUs, comma-separated list of proportions, e.g. 3,1\n");
|
496 |
+
fprintf(stderr, " -mg i, --main-gpu i the GPU to use for scratch and small tensors\n" );
|
497 |
+
fprintf(stderr, " -lv, --low-vram don't allocate VRAM scratch buffer\n" );
|
498 |
+
#endif
|
499 |
+
fprintf(stderr, " --mtest compute maximum memory usage\n");
|
500 |
+
fprintf(stderr, " --export export the computation graph to 'llama.ggml'\n");
|
501 |
+
fprintf(stderr, " --verbose-prompt print prompt before generation\n");
|
502 |
+
fprintf(stderr, " --lora FNAME apply LoRA adapter (implies --no-mmap)\n");
|
503 |
+
fprintf(stderr, " --lora-base FNAME optional model to use as a base for the layers modified by the LoRA adapter\n");
|
504 |
+
fprintf(stderr, " -m FNAME, --model FNAME\n");
|
505 |
+
fprintf(stderr, " model path (default: %s)\n", params.model.c_str());
|
506 |
+
fprintf(stderr, "\n");
|
507 |
+
}
|
508 |
+
|
509 |
+
std::string gpt_random_prompt(std::mt19937 & rng) {
|
510 |
+
const int r = rng() % 10;
|
511 |
+
switch (r) {
|
512 |
+
case 0: return "So";
|
513 |
+
case 1: return "Once upon a time";
|
514 |
+
case 2: return "When";
|
515 |
+
case 3: return "The";
|
516 |
+
case 4: return "After";
|
517 |
+
case 5: return "If";
|
518 |
+
case 6: return "import";
|
519 |
+
case 7: return "He";
|
520 |
+
case 8: return "She";
|
521 |
+
case 9: return "They";
|
522 |
+
default: return "To";
|
523 |
+
}
|
524 |
+
|
525 |
+
return "The";
|
526 |
+
}
|
527 |
+
|
528 |
+
// TODO: not great allocating this every time
|
529 |
+
std::vector<llama_token> llama_tokenize(struct llama_context * ctx, const std::string & text, bool add_bos) {
|
530 |
+
// initialize to prompt numer of chars, since n_tokens <= n_prompt_chars
|
531 |
+
std::vector<llama_token> res(text.size() + (int) add_bos);
|
532 |
+
const int n = llama_tokenize(ctx, text.c_str(), res.data(), res.size(), add_bos);
|
533 |
+
assert(n >= 0);
|
534 |
+
res.resize(n);
|
535 |
+
|
536 |
+
return res;
|
537 |
+
}
|
538 |
+
|
539 |
+
std::tuple<struct llama_model *, struct llama_context *> llama_init_from_gpt_params(const gpt_params & params) {
|
540 |
+
auto lparams = llama_context_default_params();
|
541 |
+
|
542 |
+
lparams.n_ctx = params.n_ctx;
|
543 |
+
lparams.n_batch = params.n_batch;
|
544 |
+
lparams.n_gpu_layers = params.n_gpu_layers;
|
545 |
+
lparams.main_gpu = params.main_gpu;
|
546 |
+
memcpy(lparams.tensor_split, params.tensor_split, LLAMA_MAX_DEVICES*sizeof(float));
|
547 |
+
lparams.low_vram = params.low_vram;
|
548 |
+
lparams.seed = params.seed;
|
549 |
+
lparams.f16_kv = params.memory_f16;
|
550 |
+
lparams.use_mmap = params.use_mmap;
|
551 |
+
lparams.use_mlock = params.use_mlock;
|
552 |
+
lparams.logits_all = params.perplexity;
|
553 |
+
lparams.embedding = params.embedding;
|
554 |
+
|
555 |
+
llama_model * model = llama_load_model_from_file(params.model.c_str(), lparams);
|
556 |
+
if (model == NULL) {
|
557 |
+
fprintf(stderr, "%s: error: failed to load model '%s'\n", __func__, params.model.c_str());
|
558 |
+
return std::make_tuple(nullptr, nullptr);
|
559 |
+
}
|
560 |
+
|
561 |
+
llama_context * lctx = llama_new_context_with_model(model, lparams);
|
562 |
+
if (lctx == NULL) {
|
563 |
+
fprintf(stderr, "%s: error: failed to create context with model '%s'\n", __func__, params.model.c_str());
|
564 |
+
llama_free_model(model);
|
565 |
+
return std::make_tuple(nullptr, nullptr);
|
566 |
+
}
|
567 |
+
|
568 |
+
if (!params.lora_adapter.empty()) {
|
569 |
+
int err = llama_model_apply_lora_from_file(model,
|
570 |
+
params.lora_adapter.c_str(),
|
571 |
+
params.lora_base.empty() ? NULL : params.lora_base.c_str(),
|
572 |
+
params.n_threads);
|
573 |
+
if (err != 0) {
|
574 |
+
fprintf(stderr, "%s: error: failed to apply lora adapter\n", __func__);
|
575 |
+
llama_free(lctx);
|
576 |
+
llama_free_model(model);
|
577 |
+
return std::make_tuple(nullptr, nullptr);
|
578 |
+
}
|
579 |
+
}
|
580 |
+
|
581 |
+
return std::make_tuple(model, lctx);
|
582 |
+
}
|
583 |
+
|
584 |
+
void console_init(console_state & con_st) {
|
585 |
+
#if defined(_WIN32)
|
586 |
+
// Windows-specific console initialization
|
587 |
+
DWORD dwMode = 0;
|
588 |
+
con_st.hConsole = GetStdHandle(STD_OUTPUT_HANDLE);
|
589 |
+
if (con_st.hConsole == INVALID_HANDLE_VALUE || !GetConsoleMode(con_st.hConsole, &dwMode)) {
|
590 |
+
con_st.hConsole = GetStdHandle(STD_ERROR_HANDLE);
|
591 |
+
if (con_st.hConsole != INVALID_HANDLE_VALUE && (!GetConsoleMode(con_st.hConsole, &dwMode))) {
|
592 |
+
con_st.hConsole = NULL;
|
593 |
+
}
|
594 |
+
}
|
595 |
+
if (con_st.hConsole) {
|
596 |
+
// Enable ANSI colors on Windows 10+
|
597 |
+
if (con_st.use_color && !(dwMode & ENABLE_VIRTUAL_TERMINAL_PROCESSING)) {
|
598 |
+
SetConsoleMode(con_st.hConsole, dwMode | ENABLE_VIRTUAL_TERMINAL_PROCESSING);
|
599 |
+
}
|
600 |
+
// Set console output codepage to UTF8
|
601 |
+
SetConsoleOutputCP(CP_UTF8);
|
602 |
+
}
|
603 |
+
HANDLE hConIn = GetStdHandle(STD_INPUT_HANDLE);
|
604 |
+
if (hConIn != INVALID_HANDLE_VALUE && GetConsoleMode(hConIn, &dwMode)) {
|
605 |
+
// Set console input codepage to UTF16
|
606 |
+
_setmode(_fileno(stdin), _O_WTEXT);
|
607 |
+
|
608 |
+
// Turn off ICANON (ENABLE_LINE_INPUT) and ECHO (ENABLE_ECHO_INPUT)
|
609 |
+
dwMode &= ~(ENABLE_LINE_INPUT | ENABLE_ECHO_INPUT);
|
610 |
+
SetConsoleMode(hConIn, dwMode);
|
611 |
+
}
|
612 |
+
#else
|
613 |
+
// POSIX-specific console initialization
|
614 |
+
struct termios new_termios;
|
615 |
+
tcgetattr(STDIN_FILENO, &con_st.prev_state);
|
616 |
+
new_termios = con_st.prev_state;
|
617 |
+
new_termios.c_lflag &= ~(ICANON | ECHO);
|
618 |
+
new_termios.c_cc[VMIN] = 1;
|
619 |
+
new_termios.c_cc[VTIME] = 0;
|
620 |
+
tcsetattr(STDIN_FILENO, TCSANOW, &new_termios);
|
621 |
+
|
622 |
+
con_st.tty = fopen("/dev/tty", "w+");
|
623 |
+
if (con_st.tty != nullptr) {
|
624 |
+
con_st.out = con_st.tty;
|
625 |
+
}
|
626 |
+
|
627 |
+
setlocale(LC_ALL, "");
|
628 |
+
#endif
|
629 |
+
}
|
630 |
+
|
631 |
+
void console_cleanup(console_state & con_st) {
|
632 |
+
// Reset console color
|
633 |
+
console_set_color(con_st, CONSOLE_COLOR_DEFAULT);
|
634 |
+
|
635 |
+
#if !defined(_WIN32)
|
636 |
+
if (con_st.tty != nullptr) {
|
637 |
+
con_st.out = stdout;
|
638 |
+
fclose(con_st.tty);
|
639 |
+
con_st.tty = nullptr;
|
640 |
+
}
|
641 |
+
// Restore the terminal settings on POSIX systems
|
642 |
+
tcsetattr(STDIN_FILENO, TCSANOW, &con_st.prev_state);
|
643 |
+
#endif
|
644 |
+
}
|
645 |
+
|
646 |
+
/* Keep track of current color of output, and emit ANSI code if it changes. */
|
647 |
+
void console_set_color(console_state & con_st, console_color_t color) {
|
648 |
+
if (con_st.use_color && con_st.color != color) {
|
649 |
+
fflush(stdout);
|
650 |
+
switch(color) {
|
651 |
+
case CONSOLE_COLOR_DEFAULT:
|
652 |
+
fprintf(con_st.out, ANSI_COLOR_RESET);
|
653 |
+
break;
|
654 |
+
case CONSOLE_COLOR_PROMPT:
|
655 |
+
fprintf(con_st.out, ANSI_COLOR_YELLOW);
|
656 |
+
break;
|
657 |
+
case CONSOLE_COLOR_USER_INPUT:
|
658 |
+
fprintf(con_st.out, ANSI_BOLD ANSI_COLOR_GREEN);
|
659 |
+
break;
|
660 |
+
case CONSOLE_COLOR_ERROR:
|
661 |
+
fprintf(con_st.out, ANSI_BOLD ANSI_COLOR_RED);
|
662 |
+
break;
|
663 |
+
}
|
664 |
+
con_st.color = color;
|
665 |
+
fflush(con_st.out);
|
666 |
+
}
|
667 |
+
}
|
668 |
+
|
669 |
+
char32_t getchar32() {
|
670 |
+
#if defined(_WIN32)
|
671 |
+
HANDLE hConsole = GetStdHandle(STD_INPUT_HANDLE);
|
672 |
+
wchar_t high_surrogate = 0;
|
673 |
+
|
674 |
+
while (true) {
|
675 |
+
INPUT_RECORD record;
|
676 |
+
DWORD count;
|
677 |
+
if (!ReadConsoleInputW(hConsole, &record, 1, &count) || count == 0) {
|
678 |
+
return WEOF;
|
679 |
+
}
|
680 |
+
|
681 |
+
if (record.EventType == KEY_EVENT && record.Event.KeyEvent.bKeyDown) {
|
682 |
+
wchar_t wc = record.Event.KeyEvent.uChar.UnicodeChar;
|
683 |
+
if (wc == 0) {
|
684 |
+
continue;
|
685 |
+
}
|
686 |
+
|
687 |
+
if ((wc >= 0xD800) && (wc <= 0xDBFF)) { // Check if wc is a high surrogate
|
688 |
+
high_surrogate = wc;
|
689 |
+
continue;
|
690 |
+
} else if ((wc >= 0xDC00) && (wc <= 0xDFFF)) { // Check if wc is a low surrogate
|
691 |
+
if (high_surrogate != 0) { // Check if we have a high surrogate
|
692 |
+
return ((high_surrogate - 0xD800) << 10) + (wc - 0xDC00) + 0x10000;
|
693 |
+
}
|
694 |
+
}
|
695 |
+
|
696 |
+
high_surrogate = 0; // Reset the high surrogate
|
697 |
+
return static_cast<char32_t>(wc);
|
698 |
+
}
|
699 |
+
}
|
700 |
+
#else
|
701 |
+
wchar_t wc = getwchar();
|
702 |
+
if (static_cast<wint_t>(wc) == WEOF) {
|
703 |
+
return WEOF;
|
704 |
+
}
|
705 |
+
|
706 |
+
#if WCHAR_MAX == 0xFFFF
|
707 |
+
if ((wc >= 0xD800) && (wc <= 0xDBFF)) { // Check if wc is a high surrogate
|
708 |
+
wchar_t low_surrogate = getwchar();
|
709 |
+
if ((low_surrogate >= 0xDC00) && (low_surrogate <= 0xDFFF)) { // Check if the next wchar is a low surrogate
|
710 |
+
return (static_cast<char32_t>(wc & 0x03FF) << 10) + (low_surrogate & 0x03FF) + 0x10000;
|
711 |
+
}
|
712 |
+
}
|
713 |
+
if ((wc >= 0xD800) && (wc <= 0xDFFF)) { // Invalid surrogate pair
|
714 |
+
return 0xFFFD; // Return the replacement character U+FFFD
|
715 |
+
}
|
716 |
+
#endif
|
717 |
+
|
718 |
+
return static_cast<char32_t>(wc);
|
719 |
+
#endif
|
720 |
+
}
|
721 |
+
|
722 |
+
void pop_cursor(console_state & con_st) {
|
723 |
+
#if defined(_WIN32)
|
724 |
+
if (con_st.hConsole != NULL) {
|
725 |
+
CONSOLE_SCREEN_BUFFER_INFO bufferInfo;
|
726 |
+
GetConsoleScreenBufferInfo(con_st.hConsole, &bufferInfo);
|
727 |
+
|
728 |
+
COORD newCursorPosition = bufferInfo.dwCursorPosition;
|
729 |
+
if (newCursorPosition.X == 0) {
|
730 |
+
newCursorPosition.X = bufferInfo.dwSize.X - 1;
|
731 |
+
newCursorPosition.Y -= 1;
|
732 |
+
} else {
|
733 |
+
newCursorPosition.X -= 1;
|
734 |
+
}
|
735 |
+
|
736 |
+
SetConsoleCursorPosition(con_st.hConsole, newCursorPosition);
|
737 |
+
return;
|
738 |
+
}
|
739 |
+
#endif
|
740 |
+
putc('\b', con_st.out);
|
741 |
+
}
|
742 |
+
|
743 |
+
int estimateWidth(char32_t codepoint) {
|
744 |
+
#if defined(_WIN32)
|
745 |
+
return 1;
|
746 |
+
#else
|
747 |
+
return wcwidth(codepoint);
|
748 |
+
#endif
|
749 |
+
}
|
750 |
+
|
751 |
+
int put_codepoint(console_state & con_st, const char* utf8_codepoint, size_t length, int expectedWidth) {
|
752 |
+
#if defined(_WIN32)
|
753 |
+
CONSOLE_SCREEN_BUFFER_INFO bufferInfo;
|
754 |
+
if (!GetConsoleScreenBufferInfo(con_st.hConsole, &bufferInfo)) {
|
755 |
+
// go with the default
|
756 |
+
return expectedWidth;
|
757 |
+
}
|
758 |
+
COORD initialPosition = bufferInfo.dwCursorPosition;
|
759 |
+
DWORD nNumberOfChars = length;
|
760 |
+
WriteConsole(con_st.hConsole, utf8_codepoint, nNumberOfChars, &nNumberOfChars, NULL);
|
761 |
+
|
762 |
+
CONSOLE_SCREEN_BUFFER_INFO newBufferInfo;
|
763 |
+
GetConsoleScreenBufferInfo(con_st.hConsole, &newBufferInfo);
|
764 |
+
|
765 |
+
// Figure out our real position if we're in the last column
|
766 |
+
if (utf8_codepoint[0] != 0x09 && initialPosition.X == newBufferInfo.dwSize.X - 1) {
|
767 |
+
DWORD nNumberOfChars;
|
768 |
+
WriteConsole(con_st.hConsole, &" \b", 2, &nNumberOfChars, NULL);
|
769 |
+
GetConsoleScreenBufferInfo(con_st.hConsole, &newBufferInfo);
|
770 |
+
}
|
771 |
+
|
772 |
+
int width = newBufferInfo.dwCursorPosition.X - initialPosition.X;
|
773 |
+
if (width < 0) {
|
774 |
+
width += newBufferInfo.dwSize.X;
|
775 |
+
}
|
776 |
+
return width;
|
777 |
+
#else
|
778 |
+
// we can trust expectedWidth if we've got one
|
779 |
+
if (expectedWidth >= 0 || con_st.tty == nullptr) {
|
780 |
+
fwrite(utf8_codepoint, length, 1, con_st.out);
|
781 |
+
return expectedWidth;
|
782 |
+
}
|
783 |
+
|
784 |
+
fputs("\033[6n", con_st.tty); // Query cursor position
|
785 |
+
int x1, x2, y1, y2;
|
786 |
+
int results = 0;
|
787 |
+
results = fscanf(con_st.tty, "\033[%d;%dR", &y1, &x1);
|
788 |
+
|
789 |
+
fwrite(utf8_codepoint, length, 1, con_st.tty);
|
790 |
+
|
791 |
+
fputs("\033[6n", con_st.tty); // Query cursor position
|
792 |
+
results += fscanf(con_st.tty, "\033[%d;%dR", &y2, &x2);
|
793 |
+
|
794 |
+
if (results != 4) {
|
795 |
+
return expectedWidth;
|
796 |
+
}
|
797 |
+
|
798 |
+
int width = x2 - x1;
|
799 |
+
if (width < 0) {
|
800 |
+
// Calculate the width considering text wrapping
|
801 |
+
struct winsize w;
|
802 |
+
ioctl(STDOUT_FILENO, TIOCGWINSZ, &w);
|
803 |
+
width += w.ws_col;
|
804 |
+
}
|
805 |
+
return width;
|
806 |
+
#endif
|
807 |
+
}
|
808 |
+
|
809 |
+
void replace_last(console_state & con_st, char ch) {
|
810 |
+
#if defined(_WIN32)
|
811 |
+
pop_cursor(con_st);
|
812 |
+
put_codepoint(con_st, &ch, 1, 1);
|
813 |
+
#else
|
814 |
+
fprintf(con_st.out, "\b%c", ch);
|
815 |
+
#endif
|
816 |
+
}
|
817 |
+
|
818 |
+
void append_utf8(char32_t ch, std::string & out) {
|
819 |
+
if (ch <= 0x7F) {
|
820 |
+
out.push_back(static_cast<unsigned char>(ch));
|
821 |
+
} else if (ch <= 0x7FF) {
|
822 |
+
out.push_back(static_cast<unsigned char>(0xC0 | ((ch >> 6) & 0x1F)));
|
823 |
+
out.push_back(static_cast<unsigned char>(0x80 | (ch & 0x3F)));
|
824 |
+
} else if (ch <= 0xFFFF) {
|
825 |
+
out.push_back(static_cast<unsigned char>(0xE0 | ((ch >> 12) & 0x0F)));
|
826 |
+
out.push_back(static_cast<unsigned char>(0x80 | ((ch >> 6) & 0x3F)));
|
827 |
+
out.push_back(static_cast<unsigned char>(0x80 | (ch & 0x3F)));
|
828 |
+
} else if (ch <= 0x10FFFF) {
|
829 |
+
out.push_back(static_cast<unsigned char>(0xF0 | ((ch >> 18) & 0x07)));
|
830 |
+
out.push_back(static_cast<unsigned char>(0x80 | ((ch >> 12) & 0x3F)));
|
831 |
+
out.push_back(static_cast<unsigned char>(0x80 | ((ch >> 6) & 0x3F)));
|
832 |
+
out.push_back(static_cast<unsigned char>(0x80 | (ch & 0x3F)));
|
833 |
+
} else {
|
834 |
+
// Invalid Unicode code point
|
835 |
+
}
|
836 |
+
}
|
837 |
+
|
838 |
+
// Helper function to remove the last UTF-8 character from a string
|
839 |
+
void pop_back_utf8_char(std::string & line) {
|
840 |
+
if (line.empty()) {
|
841 |
+
return;
|
842 |
+
}
|
843 |
+
|
844 |
+
size_t pos = line.length() - 1;
|
845 |
+
|
846 |
+
// Find the start of the last UTF-8 character (checking up to 4 bytes back)
|
847 |
+
for (size_t i = 0; i < 3 && pos > 0; ++i, --pos) {
|
848 |
+
if ((line[pos] & 0xC0) != 0x80) break; // Found the start of the character
|
849 |
+
}
|
850 |
+
line.erase(pos);
|
851 |
+
}
|
852 |
+
|
853 |
+
bool console_readline(console_state & con_st, std::string & line) {
|
854 |
+
console_set_color(con_st, CONSOLE_COLOR_USER_INPUT);
|
855 |
+
if (con_st.out != stdout) {
|
856 |
+
fflush(stdout);
|
857 |
+
}
|
858 |
+
|
859 |
+
line.clear();
|
860 |
+
std::vector<int> widths;
|
861 |
+
bool is_special_char = false;
|
862 |
+
bool end_of_stream = false;
|
863 |
+
|
864 |
+
char32_t input_char;
|
865 |
+
while (true) {
|
866 |
+
fflush(con_st.out); // Ensure all output is displayed before waiting for input
|
867 |
+
input_char = getchar32();
|
868 |
+
|
869 |
+
if (input_char == '\r' || input_char == '\n') {
|
870 |
+
break;
|
871 |
+
}
|
872 |
+
|
873 |
+
if (input_char == (char32_t) WEOF || input_char == 0x04 /* Ctrl+D*/) {
|
874 |
+
end_of_stream = true;
|
875 |
+
break;
|
876 |
+
}
|
877 |
+
|
878 |
+
if (is_special_char) {
|
879 |
+
console_set_color(con_st, CONSOLE_COLOR_USER_INPUT);
|
880 |
+
replace_last(con_st, line.back());
|
881 |
+
is_special_char = false;
|
882 |
+
}
|
883 |
+
|
884 |
+
if (input_char == '\033') { // Escape sequence
|
885 |
+
char32_t code = getchar32();
|
886 |
+
if (code == '[' || code == 0x1B) {
|
887 |
+
// Discard the rest of the escape sequence
|
888 |
+
while ((code = getchar32()) != (char32_t) WEOF) {
|
889 |
+
if ((code >= 'A' && code <= 'Z') || (code >= 'a' && code <= 'z') || code == '~') {
|
890 |
+
break;
|
891 |
+
}
|
892 |
+
}
|
893 |
+
}
|
894 |
+
} else if (input_char == 0x08 || input_char == 0x7F) { // Backspace
|
895 |
+
if (!widths.empty()) {
|
896 |
+
int count;
|
897 |
+
do {
|
898 |
+
count = widths.back();
|
899 |
+
widths.pop_back();
|
900 |
+
// Move cursor back, print space, and move cursor back again
|
901 |
+
for (int i = 0; i < count; i++) {
|
902 |
+
replace_last(con_st, ' ');
|
903 |
+
pop_cursor(con_st);
|
904 |
+
}
|
905 |
+
pop_back_utf8_char(line);
|
906 |
+
} while (count == 0 && !widths.empty());
|
907 |
+
}
|
908 |
+
} else {
|
909 |
+
int offset = line.length();
|
910 |
+
append_utf8(input_char, line);
|
911 |
+
int width = put_codepoint(con_st, line.c_str() + offset, line.length() - offset, estimateWidth(input_char));
|
912 |
+
if (width < 0) {
|
913 |
+
width = 0;
|
914 |
+
}
|
915 |
+
widths.push_back(width);
|
916 |
+
}
|
917 |
+
|
918 |
+
if (!line.empty() && (line.back() == '\\' || line.back() == '/')) {
|
919 |
+
console_set_color(con_st, CONSOLE_COLOR_PROMPT);
|
920 |
+
replace_last(con_st, line.back());
|
921 |
+
is_special_char = true;
|
922 |
+
}
|
923 |
+
}
|
924 |
+
|
925 |
+
bool has_more = con_st.multiline_input;
|
926 |
+
if (is_special_char) {
|
927 |
+
replace_last(con_st, ' ');
|
928 |
+
pop_cursor(con_st);
|
929 |
+
|
930 |
+
char last = line.back();
|
931 |
+
line.pop_back();
|
932 |
+
if (last == '\\') {
|
933 |
+
line += '\n';
|
934 |
+
fputc('\n', con_st.out);
|
935 |
+
has_more = !has_more;
|
936 |
+
} else {
|
937 |
+
// llama will just eat the single space, it won't act as a space
|
938 |
+
if (line.length() == 1 && line.back() == ' ') {
|
939 |
+
line.clear();
|
940 |
+
pop_cursor(con_st);
|
941 |
+
}
|
942 |
+
has_more = false;
|
943 |
+
}
|
944 |
+
} else {
|
945 |
+
if (end_of_stream) {
|
946 |
+
has_more = false;
|
947 |
+
} else {
|
948 |
+
line += '\n';
|
949 |
+
fputc('\n', con_st.out);
|
950 |
+
}
|
951 |
+
}
|
952 |
+
|
953 |
+
fflush(con_st.out);
|
954 |
+
return has_more;
|
955 |
+
}
|
examples/common.h
ADDED
@@ -0,0 +1,138 @@
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
1 |
+
// Various helper functions and utilities
|
2 |
+
|
3 |
+
#pragma once
|
4 |
+
|
5 |
+
#include "llama.h"
|
6 |
+
|
7 |
+
#include <string>
|
8 |
+
#include <vector>
|
9 |
+
#include <random>
|
10 |
+
#include <thread>
|
11 |
+
#include <unordered_map>
|
12 |
+
#include <tuple>
|
13 |
+
|
14 |
+
#if !defined (_WIN32)
|
15 |
+
#include <stdio.h>
|
16 |
+
#include <termios.h>
|
17 |
+
#endif
|
18 |
+
|
19 |
+
//
|
20 |
+
// CLI argument parsing
|
21 |
+
//
|
22 |
+
int32_t get_num_physical_cores();
|
23 |
+
|
24 |
+
struct gpt_params {
|
25 |
+
int32_t seed = -1; // RNG seed
|
26 |
+
int32_t n_threads = get_num_physical_cores();
|
27 |
+
int32_t n_predict = -1; // new tokens to predict
|
28 |
+
int32_t n_ctx = 512; // context size
|
29 |
+
int32_t n_batch = 512; // batch size for prompt processing (must be >=32 to use BLAS)
|
30 |
+
int32_t n_keep = 0; // number of tokens to keep from initial prompt
|
31 |
+
int32_t n_gpu_layers = 0; // number of layers to store in VRAM
|
32 |
+
int32_t main_gpu = 0; // the GPU that is used for scratch and small tensors
|
33 |
+
float tensor_split[LLAMA_MAX_DEVICES] = {0}; // how split tensors should be distributed across GPUs
|
34 |
+
bool low_vram = 0; // if true, reduce VRAM usage at the cost of performance
|
35 |
+
|
36 |
+
// sampling parameters
|
37 |
+
std::unordered_map<llama_token, float> logit_bias; // logit bias for specific tokens
|
38 |
+
int32_t top_k = 40; // <= 0 to use vocab size
|
39 |
+
float top_p = 0.95f; // 1.0 = disabled
|
40 |
+
float tfs_z = 1.00f; // 1.0 = disabled
|
41 |
+
float typical_p = 1.00f; // 1.0 = disabled
|
42 |
+
float temp = 0.80f; // 1.0 = disabled
|
43 |
+
float repeat_penalty = 1.10f; // 1.0 = disabled
|
44 |
+
int32_t repeat_last_n = 64; // last n tokens to penalize (0 = disable penalty, -1 = context size)
|
45 |
+
float frequency_penalty = 0.00f; // 0.0 = disabled
|
46 |
+
float presence_penalty = 0.00f; // 0.0 = disabled
|
47 |
+
int mirostat = 0; // 0 = disabled, 1 = mirostat, 2 = mirostat 2.0
|
48 |
+
float mirostat_tau = 5.00f; // target entropy
|
49 |
+
float mirostat_eta = 0.10f; // learning rate
|
50 |
+
|
51 |
+
std::string model = "models/7B/ggml-model.bin"; // model path
|
52 |
+
std::string model_alias = "unknown"; // model alias
|
53 |
+
std::string prompt = "";
|
54 |
+
std::string path_prompt_cache = ""; // path to file for saving/loading prompt eval state
|
55 |
+
std::string input_prefix = ""; // string to prefix user inputs with
|
56 |
+
std::string input_suffix = ""; // string to suffix user inputs with
|
57 |
+
std::vector<std::string> antiprompt; // string upon seeing which more user input is prompted
|
58 |
+
|
59 |
+
std::string lora_adapter = ""; // lora adapter path
|
60 |
+
std::string lora_base = ""; // base model path for the lora adapter
|
61 |
+
|
62 |
+
bool memory_f16 = true; // use f16 instead of f32 for memory kv
|
63 |
+
bool random_prompt = false; // do not randomize prompt if none provided
|
64 |
+
bool use_color = false; // use color to distinguish generations and inputs
|
65 |
+
bool interactive = false; // interactive mode
|
66 |
+
bool prompt_cache_all = false; // save user input and generations to prompt cache
|
67 |
+
bool prompt_cache_ro = false; // open the prompt cache read-only and do not update it
|
68 |
+
|
69 |
+
bool embedding = false; // get only sentence embedding
|
70 |
+
bool interactive_first = false; // wait for user input immediately
|
71 |
+
bool multiline_input = false; // reverse the usage of `\`
|
72 |
+
|
73 |
+
bool instruct = false; // instruction mode (used for Alpaca models)
|
74 |
+
bool penalize_nl = true; // consider newlines as a repeatable token
|
75 |
+
bool perplexity = false; // compute perplexity over the prompt
|
76 |
+
bool use_mmap = true; // use mmap for faster loads
|
77 |
+
bool use_mlock = false; // use mlock to keep model in memory
|
78 |
+
bool mem_test = false; // compute maximum memory usage
|
79 |
+
bool export_cgraph = false; // export the computation graph
|
80 |
+
bool verbose_prompt = false; // print prompt tokens before generation
|
81 |
+
};
|
82 |
+
|
83 |
+
bool gpt_params_parse(int argc, char ** argv, gpt_params & params);
|
84 |
+
|
85 |
+
void gpt_print_usage(int argc, char ** argv, const gpt_params & params);
|
86 |
+
|
87 |
+
std::string gpt_random_prompt(std::mt19937 & rng);
|
88 |
+
|
89 |
+
//
|
90 |
+
// Vocab utils
|
91 |
+
//
|
92 |
+
|
93 |
+
std::vector<llama_token> llama_tokenize(struct llama_context * ctx, const std::string & text, bool add_bos);
|
94 |
+
|
95 |
+
//
|
96 |
+
// Model utils
|
97 |
+
//
|
98 |
+
|
99 |
+
std::tuple<struct llama_model *, struct llama_context *> llama_init_from_gpt_params(const gpt_params & params);
|
100 |
+
|
101 |
+
//
|
102 |
+
// Console utils
|
103 |
+
//
|
104 |
+
|
105 |
+
#define ANSI_COLOR_RED "\x1b[31m"
|
106 |
+
#define ANSI_COLOR_GREEN "\x1b[32m"
|
107 |
+
#define ANSI_COLOR_YELLOW "\x1b[33m"
|
108 |
+
#define ANSI_COLOR_BLUE "\x1b[34m"
|
109 |
+
#define ANSI_COLOR_MAGENTA "\x1b[35m"
|
110 |
+
#define ANSI_COLOR_CYAN "\x1b[36m"
|
111 |
+
#define ANSI_COLOR_RESET "\x1b[0m"
|
112 |
+
#define ANSI_BOLD "\x1b[1m"
|
113 |
+
|
114 |
+
enum console_color_t {
|
115 |
+
CONSOLE_COLOR_DEFAULT=0,
|
116 |
+
CONSOLE_COLOR_PROMPT,
|
117 |
+
CONSOLE_COLOR_USER_INPUT,
|
118 |
+
CONSOLE_COLOR_ERROR
|
119 |
+
};
|
120 |
+
|
121 |
+
struct console_state {
|
122 |
+
bool multiline_input = false;
|
123 |
+
bool use_color = false;
|
124 |
+
console_color_t color = CONSOLE_COLOR_DEFAULT;
|
125 |
+
|
126 |
+
FILE* out = stdout;
|
127 |
+
#if defined (_WIN32)
|
128 |
+
void* hConsole;
|
129 |
+
#else
|
130 |
+
FILE* tty = nullptr;
|
131 |
+
termios prev_state;
|
132 |
+
#endif
|
133 |
+
};
|
134 |
+
|
135 |
+
void console_init(console_state & con_st);
|
136 |
+
void console_cleanup(console_state & con_st);
|
137 |
+
void console_set_color(console_state & con_st, console_color_t color);
|
138 |
+
bool console_readline(console_state & con_st, std::string & line);
|
examples/embedding/CMakeLists.txt
ADDED
@@ -0,0 +1,7 @@
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
1 |
+
set(TARGET embedding)
|
2 |
+
add_executable(${TARGET} embedding.cpp)
|
3 |
+
target_link_libraries(${TARGET} PRIVATE common llama ${CMAKE_THREAD_LIBS_INIT})
|
4 |
+
target_compile_features(${TARGET} PRIVATE cxx_std_11)
|
5 |
+
if(TARGET BUILD_INFO)
|
6 |
+
add_dependencies(${TARGET} BUILD_INFO)
|
7 |
+
endif()
|
examples/embedding/README.md
ADDED
@@ -0,0 +1,3 @@
|
|
|
|
|
|
|
|
|
1 |
+
# embedding
|
2 |
+
|
3 |
+
TODO
|
examples/embedding/embedding.cpp
ADDED
@@ -0,0 +1,97 @@
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
1 |
+
#include "common.h"
|
2 |
+
#include "llama.h"
|
3 |
+
#include "build-info.h"
|
4 |
+
|
5 |
+
#include <ctime>
|
6 |
+
|
7 |
+
#if defined(_MSC_VER)
|
8 |
+
#pragma warning(disable: 4244 4267) // possible loss of data
|
9 |
+
#endif
|
10 |
+
|
11 |
+
int main(int argc, char ** argv) {
|
12 |
+
gpt_params params;
|
13 |
+
|
14 |
+
if (gpt_params_parse(argc, argv, params) == false) {
|
15 |
+
return 1;
|
16 |
+
}
|
17 |
+
|
18 |
+
params.embedding = true;
|
19 |
+
|
20 |
+
if (params.n_ctx > 2048) {
|
21 |
+
fprintf(stderr, "%s: warning: model does not support context sizes greater than 2048 tokens (%d specified);"
|
22 |
+
"expect poor results\n", __func__, params.n_ctx);
|
23 |
+
}
|
24 |
+
|
25 |
+
fprintf(stderr, "%s: build = %d (%s)\n", __func__, BUILD_NUMBER, BUILD_COMMIT);
|
26 |
+
|
27 |
+
if (params.seed < 0) {
|
28 |
+
params.seed = time(NULL);
|
29 |
+
}
|
30 |
+
|
31 |
+
fprintf(stderr, "%s: seed = %d\n", __func__, params.seed);
|
32 |
+
|
33 |
+
std::mt19937 rng(params.seed);
|
34 |
+
if (params.random_prompt) {
|
35 |
+
params.prompt = gpt_random_prompt(rng);
|
36 |
+
}
|
37 |
+
|
38 |
+
llama_init_backend();
|
39 |
+
|
40 |
+
llama_model * model;
|
41 |
+
llama_context * ctx;
|
42 |
+
|
43 |
+
// load the model
|
44 |
+
std::tie(model, ctx) = llama_init_from_gpt_params(params);
|
45 |
+
if (model == NULL) {
|
46 |
+
fprintf(stderr, "%s: error: unable to load model\n", __func__);
|
47 |
+
return 1;
|
48 |
+
}
|
49 |
+
|
50 |
+
// print system information
|
51 |
+
{
|
52 |
+
fprintf(stderr, "\n");
|
53 |
+
fprintf(stderr, "system_info: n_threads = %d / %d | %s\n",
|
54 |
+
params.n_threads, std::thread::hardware_concurrency(), llama_print_system_info());
|
55 |
+
}
|
56 |
+
|
57 |
+
int n_past = 0;
|
58 |
+
|
59 |
+
// Add a space in front of the first character to match OG llama tokenizer behavior
|
60 |
+
params.prompt.insert(0, 1, ' ');
|
61 |
+
|
62 |
+
// tokenize the prompt
|
63 |
+
auto embd_inp = ::llama_tokenize(ctx, params.prompt, true);
|
64 |
+
|
65 |
+
if (params.verbose_prompt) {
|
66 |
+
fprintf(stderr, "\n");
|
67 |
+
fprintf(stderr, "%s: prompt: '%s'\n", __func__, params.prompt.c_str());
|
68 |
+
fprintf(stderr, "%s: number of tokens in prompt = %zu\n", __func__, embd_inp.size());
|
69 |
+
for (int i = 0; i < (int) embd_inp.size(); i++) {
|
70 |
+
fprintf(stderr, "%6d -> '%s'\n", embd_inp[i], llama_token_to_str(ctx, embd_inp[i]));
|
71 |
+
}
|
72 |
+
fprintf(stderr, "\n");
|
73 |
+
}
|
74 |
+
|
75 |
+
if (params.embedding){
|
76 |
+
if (embd_inp.size() > 0) {
|
77 |
+
if (llama_eval(ctx, embd_inp.data(), embd_inp.size(), n_past, params.n_threads)) {
|
78 |
+
fprintf(stderr, "%s : failed to eval\n", __func__);
|
79 |
+
return 1;
|
80 |
+
}
|
81 |
+
}
|
82 |
+
|
83 |
+
const int n_embd = llama_n_embd(ctx);
|
84 |
+
const auto embeddings = llama_get_embeddings(ctx);
|
85 |
+
|
86 |
+
for (int i = 0; i < n_embd; i++) {
|
87 |
+
printf("%f ", embeddings[i]);
|
88 |
+
}
|
89 |
+
printf("\n");
|
90 |
+
}
|
91 |
+
|
92 |
+
llama_print_timings(ctx);
|
93 |
+
llama_free(ctx);
|
94 |
+
llama_free_model(model);
|
95 |
+
|
96 |
+
return 0;
|
97 |
+
}
|
examples/gpt4all.sh
ADDED
@@ -0,0 +1,15 @@
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
1 |
+
#!/bin/bash
|
2 |
+
|
3 |
+
#
|
4 |
+
# Temporary script - will be removed in the future
|
5 |
+
#
|
6 |
+
|
7 |
+
cd `dirname $0`
|
8 |
+
cd ..
|
9 |
+
|
10 |
+
./main --color --instruct --threads 4 \
|
11 |
+
--model ./models/gpt4all-7B/gpt4all-lora-quantized.bin \
|
12 |
+
--file ./prompts/alpaca.txt \
|
13 |
+
--batch_size 8 --ctx_size 2048 -n -1 \
|
14 |
+
--repeat_last_n 64 --repeat_penalty 1.3 \
|
15 |
+
--n_predict 128 --temp 0.1 --top_k 40 --top_p 0.95
|
examples/jeopardy/README.md
ADDED
@@ -0,0 +1,21 @@
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
1 |
+
# llama.cpp/example/jeopardy
|
2 |
+
|
3 |
+
This is pretty much just a straight port of aigoopy/llm-jeopardy/ with an added graph viewer.
|
4 |
+
|
5 |
+
The jeopardy test can be used to compare the fact knowledge of different models and compare them to eachother. This is in contrast to some other tests, which test logical deduction, creativity, writing skills, etc.
|
6 |
+
|
7 |
+
|
8 |
+
Step 1: Open jeopardy.sh and modify the following:
|
9 |
+
```
|
10 |
+
MODEL=(path to your model)
|
11 |
+
MODEL_NAME=(name of your model)
|
12 |
+
prefix=(basically, if you use vicuna it's Human: , if you use something else it might be User: , etc)
|
13 |
+
opts=(add -instruct here if needed for your model, or anything else you want to test out)
|
14 |
+
```
|
15 |
+
Step 2: Run `jeopardy.sh` from the llama.cpp folder
|
16 |
+
|
17 |
+
Step 3: Repeat steps 1 and 2 until you have all the results you need.
|
18 |
+
|
19 |
+
Step 4: Run `graph.py`, and follow the instructions. At the end, it will generate your final graph.
|
20 |
+
|
21 |
+
Note: The Human bar is based off of the full, original 100 sample questions. If you modify the question count or questions, it will not be valid.
|
examples/jeopardy/graph.py
ADDED
@@ -0,0 +1,57 @@
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
1 |
+
import matplotlib.pyplot as plt
|
2 |
+
import os
|
3 |
+
import csv
|
4 |
+
|
5 |
+
labels = []
|
6 |
+
numbers = []
|
7 |
+
numEntries = 1
|
8 |
+
|
9 |
+
rows = []
|
10 |
+
|
11 |
+
|
12 |
+
def bar_chart(numbers, labels, pos):
|
13 |
+
plt.bar(pos, numbers, color='blue')
|
14 |
+
plt.xticks(ticks=pos, labels=labels)
|
15 |
+
plt.title("Jeopardy Results by Model")
|
16 |
+
plt.xlabel("Model")
|
17 |
+
plt.ylabel("Questions Correct")
|
18 |
+
plt.show()
|
19 |
+
|
20 |
+
|
21 |
+
def calculatecorrect():
|
22 |
+
directory = os.fsencode("./examples/jeopardy/results/")
|
23 |
+
csv_reader = csv.reader(open("./examples/jeopardy/qasheet.csv", 'rt'), delimiter=',')
|
24 |
+
for row in csv_reader:
|
25 |
+
global rows
|
26 |
+
rows.append(row)
|
27 |
+
for listing in os.listdir(directory):
|
28 |
+
filename = os.fsdecode(listing)
|
29 |
+
if filename.endswith(".txt"):
|
30 |
+
file = open("./examples/jeopardy/results/" + filename, "rt")
|
31 |
+
global labels
|
32 |
+
global numEntries
|
33 |
+
global numbers
|
34 |
+
labels.append(filename[:-4])
|
35 |
+
numEntries += 1
|
36 |
+
i = 1
|
37 |
+
totalcorrect = 0
|
38 |
+
for line in file.readlines():
|
39 |
+
if line.strip() != "------":
|
40 |
+
print(line)
|
41 |
+
else:
|
42 |
+
print("Correct answer: " + rows[i][2] + "\n")
|
43 |
+
i += 1
|
44 |
+
print("Did the AI get the question right? (y/n)")
|
45 |
+
if input() == "y":
|
46 |
+
totalcorrect += 1
|
47 |
+
numbers.append(totalcorrect)
|
48 |
+
|
49 |
+
|
50 |
+
if __name__ == '__main__':
|
51 |
+
calculatecorrect()
|
52 |
+
pos = list(range(numEntries))
|
53 |
+
labels.append("Human")
|
54 |
+
numbers.append(48.11)
|
55 |
+
bar_chart(numbers, labels, pos)
|
56 |
+
print(labels)
|
57 |
+
print(numbers)
|
examples/jeopardy/jeopardy.sh
ADDED
@@ -0,0 +1,30 @@
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
1 |
+
#!/bin/bash
|
2 |
+
set -e
|
3 |
+
|
4 |
+
MODEL=./models/ggml-vicuna-13b-1.1-q4_0.bin
|
5 |
+
MODEL_NAME=Vicuna
|
6 |
+
|
7 |
+
# exec options
|
8 |
+
prefix="Human: " # Ex. Vicuna uses "Human: "
|
9 |
+
opts="--temp 0 -n 80" # additional flags
|
10 |
+
nl='
|
11 |
+
'
|
12 |
+
introduction="You will be playing a game of Jeopardy. Simply answer the question in the correct format (Ex. What is Paris, or Who is George Washington)."
|
13 |
+
|
14 |
+
# file options
|
15 |
+
question_file=./examples/jeopardy/questions.txt
|
16 |
+
touch ./examples/jeopardy/results/$MODEL_NAME.txt
|
17 |
+
output_file=./examples/jeopardy/results/$MODEL_NAME.txt
|
18 |
+
|
19 |
+
counter=1
|
20 |
+
|
21 |
+
echo 'Running'
|
22 |
+
while IFS= read -r question
|
23 |
+
do
|
24 |
+
exe_cmd="./main -p "\"$prefix$introduction$nl$prefix$question\"" "$opts" -m ""\"$MODEL\""" >> ""\"$output_file\""
|
25 |
+
echo $counter
|
26 |
+
echo "Current Question: $question"
|
27 |
+
eval "$exe_cmd"
|
28 |
+
echo -e "\n------" >> $output_file
|
29 |
+
counter=$((counter+1))
|
30 |
+
done < "$question_file"
|
examples/jeopardy/qasheet.csv
ADDED
@@ -0,0 +1,103 @@
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
1 |
+
Index,Original Category,Original Correct Question,Model Prompt
|
2 |
+
1,The Oscars,Who is John Williams?,Which actor Born in 1932 was the son of a percussionist in the CBS radio orchestra has been nominated for 53 Oscars?
|
3 |
+
2,English Literature,What is Paradise Lost?,"What work in English Literature says: 'The mind is its own place, & in itself can make a heaven of hell, a hell of heaven. What matter where, if I be still the same'?"
|
4 |
+
3,Writers’ Lesser-Known Works,Who is Niccolò Machiavelli?,"Known for more philosophical works, he wrote the play 'La Mandragola', in which Florentines are rewarded for immoral actions?"
|
5 |
+
4,Exploration,What is Easter Island (Rapa Nui)?,"James Cook's account of a 1774 visit where records an object 'near 27 feet long, and upwards of 8 feet over the breast or shoulders'?"
|
6 |
+
5,The Bill of Rights,What is the Eighth Amendment?,England's 'Bloody Assizes' & a 1685 life sentence for perjury were 2 main origins of which amendment to the U.S. Constitution?
|
7 |
+
6,Nobel Peace Prize Winners,Who are Nelson Mandela & Desmond Tutu?,"Which nobel peace price winners each lived at times on Vilakazi St. in Soweto , so it claims to be the world's only street home to 2 Nobel Peace Prize winners?"
|
8 |
+
7,Famous Names,Who is Walt Disney?,"In 1966, the year of who's death did he share plans for an experimental prototype community in Florida?"
|
9 |
+
8,Geography,What is Colombia?,"Of the 13 nations through which the Equator passes, what is the only one whose coastline borders the Caribbean Sea?"
|
10 |
+
9,Fashion History,What are rhinestones?,"Which decorative items in fashion history get their name from their origin in the port city of Strasbourg, on the border of France & Germany?"
|
11 |
+
10,Movies of the ’80s,What is Driving Miss Daisy?,What 1980's movie is based on an off-Broadway play with just 3 characters and won the Best Picture Oscar & the actors in all 3 roles were nominated?
|
12 |
+
11,Novelists,Who is John Grisham?,"A 2012 book review for which novelist noted subjects that 'sparked his ire': capital punishment, big tobacco & 'the plight of the unjustly convicted'?"
|
13 |
+
12,20th Century Eponyms,What is the Maginot Line?,"A 1940 headline about what 20th Century Eponym included 'failure', 'liability when it came to offense' & 'stout hearts no match for tanks'?"
|
14 |
+
13,City History,What is Stockholm?,"Over 700 years after its traditional 1252 founding date, what port city became associated with a psychological response?"
|
15 |
+
14,Brand Names,What is Jacuzzi?,"The success of what brand has its roots with a hydrotherapy pump its cofounder created for his son, who had arthritis?"
|
16 |
+
15,American Authors,Who is Washington Irving?,"In a periodical in 1807, what American Author called New York City 'Gotham, Gotham! Most enlightened of cities'?"
|
17 |
+
16,Symbols,What is “less than”?,What symbol is a rotated V in math and a feeling of some marginalized or underrepresented people in society?
|
18 |
+
17,Movie Theme Songs,Who is James Bond?,"Monty Norman, the composer of what character's theme, said the staccato riff conveyed sexiness, mystery & ruthlessness?"
|
19 |
+
18,American Novelists,Who is Joseph Heller?,"What American Novelist served with an airman named Yohannan in World War II & despite what readers might think, he said he enjoyed his service?"
|
20 |
+
19,Medieval Places,"What is Canterbury, England? (Canterbury Cathedral)","In what Medieval place did one of the participants in an 1170 event say, 'Let us away, knights; he will rise no more'?"
|
21 |
+
20,Countries of Africa,What is Morocco?,"At one time a province of the Roman Empire, what African country kingdom is known to Arabic scholars as Al-Maghrib Al-Aqsa, 'the far west'?"
|
22 |
+
21,Statehood,What is Wyoming?,Congress relented in 1890 after what prospective state said it would wait 100 years rather than come in without the women?
|
23 |
+
22,1980s Movies,What is Raiders of the Lost Ark?,"A writer & producer of what movie said he wanted it to be like a Western or James Bond film, 'only it takes place in the 30s'?"
|
24 |
+
23,Art Exhibitions,Who is Rembrandt?,In 1898 what's been called the first blockbuster art show was devoted to which artist & put on for Queen Wilhelmina's coronation?
|
25 |
+
24,Countries of the World,What is Mongolia?,"Part of the largest contiguous land empire during the 1200s & 1300s, today what is the world's second-largest landlocked country?"
|
26 |
+
25,Literature,What is “Howl”?,A 2006 book was titled 'The Poem That Changed America:' What 'Fifty Years Later'?
|
27 |
+
26,Invasions,Who is William of Orange?,"Backed by 14,000 troops, who invaded England to restore, in his words, its 'religion, laws, and liberties'?"
|
28 |
+
27,Landmarks,What is the Eiffel Tower?,"After its completion in the late 19th c., what was landmark was called 'a truly tragic street lamp' & a 'high & skinny pyramid of iron ladders'?"
|
29 |
+
28,Geographic Name’s the Same,What is Dover?,"The busiest passenger port in the U.K., what shares its name with a capital of one of the original 13 states?"
|
30 |
+
29,Names in the Bookstore,Who is Peter Mark Roget?,"This man made lists, perhaps to cope with depression; a set of lists he published in 1852 made whose name synonymous with a type of book?"
|
31 |
+
30,U.S. History,Who is Dr. Samuel Mudd?,"An 1869 presidential pardon was granted to which man, due in part to a plea by the Medical Society of Harford County, Maryland?"
|
32 |
+
31,American Literature,What is The Things They Carried?,"Letters, pocket knives, C rations & steel helmets are among the tangible items referred to in the title of what American literature modern war classic?"
|
33 |
+
32,Nonfiction,What is The Communist Manifesto,"What nonfiction book has the line, 'The discovery of America…opened up fresh ground for the rising bourgeoisie'?"
|
34 |
+
33, a new version was passed 81 years later,Laws in U.S. History,What is the Civil Rights Act?,,,,,,,,,,,,,,,,,,0, 2/3
|
35 |
+
34,Names of Myth,Who is Helen of Troy?,"Whose brothers, Castor & Pollux, saved her after Theseus stole her away as a kid; a larger force would seek her later in life?"
|
36 |
+
35,African Countries,What is Sudan?,"Once Africa's largest country in area, what African Country dropped to third in 2011 when a portion of it declared independence?"
|
37 |
+
36,The Ancient World,What is Alexandria?,"The ancient writer Galen said books on ships arriving to what city's port were seized, originals kept & copies returned?"
|
38 |
+
37,Famous Names,Who is Andy Warhol?,"For a special 1970s cookbook, who provided one simple recipe–a can of Campbell's tomato soup & 2 cans of milk?"
|
39 |
+
38,People & Places,What is Guam?,"Thought to descend from people of Southeast Asia, the Chamorro make up what U.S. territory’s largest ethnic group?"
|
40 |
+
39,Current World Leaders,What is the Philippines?,"In office from 2022, the president of what country has taken so many foreign trips a play on his name is 'Ferdinand Magellan Jr.'?"
|
41 |
+
40,Writers & The South,Who is Tennessee Williams?,In 1939 which writer lived on Toulouse Street in the French Quarter & chose the professional name that bonded him to the South?
|
42 |
+
41,National Parks,What is Yellowstone?,"What National Park is named for a river indigenous people called Mi tse a-da-zi, translated by French-speaking trappers as 'Pierre Jaune'?"
|
43 |
+
42,Sports,Who are the Harlem Globetrotters?,"In 2010 who introduced the 4-point shot, 35 feet from the basket?"
|
44 |
+
43,The U.S. Military,What is “Top Gun”?,Losses over Asia in the 1960s led to the establishment of the program known as what at a San Diego naval base in 1969?
|
45 |
+
44,Art & Science,What is Halley’s Comet?,"A craft that visited what was named for Giotto, based on the story that 680 years earlier, the painter depicted it as the Star of Bethlehem?"
|
46 |
+
45,Words From World War I,What is “tank”?,"In World War I, 'Cistern' & 'reservoir' were suggested names for what secret invention, but the British preferred this less clumsy monosyllable?"
|
47 |
+
46,European History,What is Holy Roman Emperor?,"Until 1806, some German nobles included among their honors the title of 'Elector' for their role in selecting this personage?"
|
48 |
+
47,Theater History,Who is Peter Pan?,"In 1904, wearing a harness, actress Nina Boucicault became the first to play what character onstage?"
|
49 |
+
48,European Cities,What is Aachen?,"Alphabetically the first German city in encyclopedias, what was also the first one taken by the Allies in World War II?"
|
50 |
+
49,Word Origins,What is mantra?,This Sanskrit word referring to a spoken word or phrase comes from a word for 'to think'?
|
51 |
+
50,Inventions,What is barbed wire?,1917's 'Elements of Trench Warfare' said what Old West invention was 'difficult to destroy' & 'difficult to get through'?
|
52 |
+
51,World War II,What is Schindler’s list?,"Mimi Reinhard, who never learned to type using more than 2 fingers, produced what in World War II with 1,100 names, including hers?"
|
53 |
+
52, their offspring was the source of this mythical object,Mythology,What is the Golden Fleece?
|
54 |
+
53,Literature,What is Pride and Prejudice?,"Published in 2011, P.D. James' final novel, 'Death Comes to Pemberley', was a sequel to what novel from 200 years earlier?"
|
55 |
+
54, only these 2 west of the Mississippi River border each other,U.S. State Names,What are Oregon & Nevada?
|
56 |
+
55,Word Origins,What is passion?,"Originally relating to a story of suffering, what word now more commonly refers to strong emotion of any kind?"
|
57 |
+
56,World Cinema,What is La Vie en Rose?,"The 2007 biopic called 'La Môme' in France, meaning 'The Kid', was released in the U.S. under what other French title?"
|
58 |
+
57,History,What is Santa Maria?,"Returning home in 1493, Columbus stopped in the Azores at an island with what name, also something he'd lost off the Haiti coast?"
|
59 |
+
58,Landmarks,What is a kremlin?,Pskov & Nizhny Novgorod are 2 of the cities that have a fortress called what?
|
60 |
+
59,Foreign-Born Authors,Who is Vladimir Nabokov?,In the 1950s the New York Times said what author 'is writing about all lust' & his lecherous narrator 'is all of us'?
|
61 |
+
60,Astronomy & Geography,What is Capricorn?,"At the winter solstice, the sun is in Sagittarius; it once appeared in what constellation, giving a geographic feature its name?"
|
62 |
+
61,Television,What is Law & Order?,"Mike Post combined the sound of a slamming jail door, an anvil & 100 men stomping on a floor for what television series that debuted in 1990?"
|
63 |
+
62,British Landmarks,What is the Tower of London?,"Like Sir Thomas More, 3 16th century English queens are buried at what British location?"
|
64 |
+
63,Early American History,What are witches?,"In 1692 Increase Mather wrote, 'It were better that ten suspected' of these who 'escape, than that one innocent person … be condemned'?"
|
65 |
+
64,Geography Mnemonics,What are Arkansas and Louisiana?,"The Geography Mnemonic Mimal, sometimes said to be the silhouette of a chef or elf, stands for Minnesota, Iowa, Missouri, and what other 2 states?"
|
66 |
+
65,Business Milestones,What is the Ford Model T?,"What was first sold in 1908, at a price equivalent to about $27,000 today?"
|
67 |
+
66,In The Bookstore,Who is Tom Clancy?,The name of what author dead since 2013 now appears on books written by a former U.S. marshal & a former Apache helicopter pilot?
|
68 |
+
67,Historic Art,What is the Bayeux Tapestry?,The artwork once known in France as 'la tapisserie de la Reine Mathilde' is better known as what?
|
69 |
+
68,Pop Stars,Who is Madonna?,In 2022 which pop star became the first woman to have a Billboard Top 10 album in 5 decades starting with the 1980s?
|
70 |
+
69,Classic Tale Characters,Who is Scheherazade?,"In one 19th century translation, what female classic tale character 'perceived the dawn of day and ceased' speaking nearly 1,000 times?"
|
71 |
+
70,USA,What is Jack Daniel’s?,"Ironically, though what company founded in the 1860s is Moore County, Tennessee's largest employer, Moore is a dry county?"
|
72 |
+
71,Historic People,Who was William Bligh?,"After a 1789 event, who wrote, 'My first determination was to seek a supply of…water at Tofoa, & afterwards to sail for Tongataboo'?"
|
73 |
+
72,The Movies,What is The Godfather?,Laurence Olivier & Ernest Borgnine were considered for the lead role & Sergio Leone to direct for what film that turned 50 in 2022?
|
74 |
+
73,Continental Geography,What is Colombia?,"Until a 1903 secession, what country's contiguous territory spanned 2 continents?"
|
75 |
+
74,Foreign-Born Authors,Who is Isabel Allende?,"Early in her career which foreign-born author translated romance novels into Spanish, often changing the dialogue to make the heroines smarter?"
|
76 |
+
75,Historic Crimes,What is the Mona Lisa?,"Saying it was stolen by Napoleon, self-styled Italian patriot Vincenzo Peruggia took what in 1911?"
|
77 |
+
76,U.S. Bodies of Water,What is Lake Mead?,"Continuing a downward trend, in July 2022 what US body of water was at 27% capacity, its lowest level since 1937 when it was first being filled?"
|
78 |
+
77,Gods & Goddesses,Who is Aurora (or Eos)?,"Each morning which goddess began her ride in her chariot across the sky ahead of her brother Sol, or Helios?"
|
79 |
+
78,America At War,What is the Battle of New Orleans?,"Until the Civil War, the Jan. 8 date of what American battle of dubious military importance but big morale value was a national holiday?"
|
80 |
+
79,Children’s Books,What is The Velveteen Rabbit?,"Which children's book title character is told 'By the time you are real, most of your hair has been loved off your eyes drop out & you get shabby'?"
|
81 |
+
80,TV Finales,What is Grace and Frankie?,"In a TV reunion over 40 years in the making, Dolly Parton appeared as an angel named Agnes in the final episode of what comedy in 2022?"
|
82 |
+
81,American Poems,Who is Evangeline?,"In an 1847 American poem what character sees her town of Grand-Pré burned, but finally reunites with her beau for a kiss before his death?"
|
83 |
+
82,Famous Names,Who is Banksy?,"In 2001 who published a book called 'Banging Your Head Against a Brick Wall'; in 2002, 'Existencilism'?"
|
84 |
+
83,Children’s Lit,What is Charlotte’s Web?,The title object of what childrens book 'never looked more beautiful each strand held dozens of bright drops of early morning dew'?
|
85 |
+
84,Classic Songs,What is “Here Comes Santa Claus”?,The shouts of excited children at a 1946 holiday parade are said to have inspired what perennial classic song favorite?
|
86 |
+
85,Brand Names,What are Milk Duds?,"Unable to make what candies perfectly round, the confectioner embraced this flawed name for the product?"
|
87 |
+
86,Countries of the World,What is Italy?,"What country is home to 58 UNESCO World Heritage Sites, more than any other country; the sites include a volcano & a lagoon?"
|
88 |
+
87,Action Movies,What is Die Hard?,"What action movie's last line is 'If this is their idea of Christmas, I gotta be here for New Years'?"
|
89 |
+
88,Presidential Facts,Who is Woodrow Wilson?,Only 3 presidents have married while in office— John Tyler was the first & which one was the last?
|
90 |
+
89,19th Century Americans,Who is Frederick Douglass?,"Demonstrating the dignity & humanity of Black Americans, who sat for 160 known photographs, the most of any American in the 19th century?"
|
91 |
+
90,Latin Phrases,What is “quid pro quo”?,"Originally, which Latin 3-word phrase referred to when a doctor or apothecary substituted one medicine for another?"
|
92 |
+
91,1970s Movies,What is Monty Python and the Holy Grail?,The 1975 premiere of what movie comedy advertised free coconuts for the first thousand in the audience?
|
93 |
+
92,Name’s The Same,What is Manhattan?,"A cocktail, an island & a WWII venture originally called 'Development of Substitute Materials' all bear what name?"
|
94 |
+
93,U.S. Presidents,Who is Calvin Coolidge?,"Which US President was sworn in twice as President within 2 years, first by his father & then later by a former U.S. President?"
|
95 |
+
94,Plays,What is The Tempest?,A 1609 story in which an exiled king of Bulgaria creates a sea palace with his magic may have inspired the plot of what play?
|
96 |
+
95,Landmarks,What is the Berlin Wall?,"In 2009, during a 20th anniversary celebration, what landmark was called 'an edifice of fear. On Nov. 9, it became a place of joy'?"
|
97 |
+
96,World Capitals,"What is Vienna, Austria?","Among what world capital's nicknames are the 'City of Classical Music' &, possibly in honor of a famous resident from 1860 to 1938, the 'City of Dreams'?"
|
98 |
+
97,Language & Its Meanings,What is a night owl?,"Now meaning someone with nocturnal habits, what catches a sleeping dove in Shakespeare's 'Lucrece'?"
|
99 |
+
98,Flags of Our Hemisphere,What is Brazil?,"The stars on what country's flag represent states, 26 of them; unlike the USA's, its 'federal district' gets its own 27th star?"
|
100 |
+
99,Names in U.S. History,Who is Oliver Brown?,What father was the only man among the 13 plaintiffs in a US class-action case filed in 1951?
|
101 |
+
100,Children’s Authors,"Who is Sarah? (from Sarah, Plain and Tall)","Reversing the story of what heroine she created, childrens author Patricia Maclachlan was born on the prairie but spent much of her life in New England?"
|
102 |
+
,,,
|
103 |
+
TOTALS,,,
|
examples/jeopardy/questions.txt
ADDED
@@ -0,0 +1,100 @@
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
1 |
+
Which man born in 1932 was the son of a percussionist in the CBS radio orchestra has been nominated for 53 Oscars?
|
2 |
+
What work in English Literature says: 'The mind is its own place, & in itself can make a heaven of hell, a hell of heaven. What matter where, if I be still the same'?
|
3 |
+
Known for more philosophical works, he wrote the play 'La Mandragola', in which Florentines are rewarded for immoral actions?
|
4 |
+
James Cook's account of a 1774 visit where records an object 'near 27 feet long, and upwards of 8 feet over the breast or shoulders'?
|
5 |
+
England's 'Bloody Assizes' & a 1685 life sentence for perjury were 2 main origins of which amendment to the U.S. Constitution?
|
6 |
+
Which nobel peace price winners each lived at times on Vilakazi St. in Soweto , so it claims to be the world's only street home to 2 Nobel Peace Prize winners?
|
7 |
+
In 1966, the year of who's death did he share plans for an experimental prototype community in Florida?
|
8 |
+
Of the 13 nations through which the Equator passes, what is the only one whose coastline borders the Caribbean Sea?
|
9 |
+
Which decorative items in fashion history get their name from their origin in the port city of Strasbourg, on the border of France & Germany?
|
10 |
+
What 1980's movie is based on an off-Broadway play with just 3 characters and won the Best Picture Oscar & the actors in all 3 roles were nominated?
|
11 |
+
A 2012 book review for which novelist noted subjects that 'sparked his ire': capital punishment, big tobacco & 'the plight of the unjustly convicted'?
|
12 |
+
A 1940 headline about what 20th Century Eponym included 'failure', 'liability when it came to offense' & 'stout hearts no match for tanks'?
|
13 |
+
Over 700 years after its traditional 1252 founding date, what port city became associated with a psychological response?
|
14 |
+
The success of what brand has its roots with a hydrotherapy pump its cofounder created for his son, who had arthritis?
|
15 |
+
In a periodical in 1807, what American Author called New York City 'Gotham, Gotham! Most enlightened of cities'?
|
16 |
+
What symbol is a rotated V in math and a feeling of some marginalized or underrepresented people in society?
|
17 |
+
Monty Norman, the composer of what character's theme, said the staccato riff conveyed sexiness, mystery & ruthlessness?
|
18 |
+
What American Novelist served with an airman named Yohannan in World War II & despite what readers might think, he said he enjoyed his service?
|
19 |
+
In what Medieval place did one of the participants in an 1170 event say, 'Let us away, knights; he will rise no more'?
|
20 |
+
At one time a province of the Roman Empire, what African country kingdom is known to Arabic scholars as Al-Maghrib Al-Aqsa, 'the far west'?
|
21 |
+
Congress relented in 1890 after what prospective state said it would wait 100 years rather than come in without the women?
|
22 |
+
A writer & producer of what movie said he wanted it to be like a Western or James Bond film, 'only it takes place in the 30s'?
|
23 |
+
In 1898 what's been called the first blockbuster art show was devoted to which artist & put on for Queen Wilhelmina's coronation?
|
24 |
+
Part of the largest contiguous land empire during the 1200s & 1300s, today what is the world's second-largest landlocked country?
|
25 |
+
A 2006 book was titled 'The Poem That Changed America:' What 'Fifty Years Later'?
|
26 |
+
Backed by 14,000 troops, who invaded England to restore, in his words, its 'religion, laws, and liberties'?
|
27 |
+
After its completion in the late 19th c., what was landmark was called 'a truly tragic street lamp' & a 'high & skinny pyramid of iron ladders'?
|
28 |
+
The busiest passenger port in the U.K., what shares its name with a capital of one of the original 13 states?
|
29 |
+
This man made lists, perhaps to cope with depression; a set of lists he published in 1852 made whose name synonymous with a type of book?
|
30 |
+
An 1869 presidential pardon was granted to which man, due in part to a plea by the Medical Society of Harford County, Maryland?
|
31 |
+
Letters, pocket knives, C rations & steel helmets are among the tangible items referred to in the title of what American literature modern war classic?
|
32 |
+
What nonfiction book has the line, 'The discovery of America…opened up fresh ground for the rising bourgeoisie'?
|
33 |
+
A radical Republican championed what 1875 act but the Supreme Court struck it down in 1883; a new version was passed 81 years later?
|
34 |
+
Whose brothers, Castor & Pollux, saved her after Theseus stole her away as a kid; a larger force would seek her later in life?
|
35 |
+
Once Africa's largest country in area, what African Country dropped to third in 2011 when a portion of it declared independence?
|
36 |
+
The ancient writer Galen said books on ships arriving to what city's port were seized, originals kept & copies returned?
|
37 |
+
For a special 1970s cookbook, who provided one simple recipe–a can of Campbell's tomato soup & 2 cans of milk?
|
38 |
+
Thought to descend from people of Southeast Asia, the Chamorro make up what U.S. territory’s largest ethnic group?
|
39 |
+
In office from 2022, the president of what country has taken so many foreign trips a play on his name is 'Ferdinand Magellan Jr.'?
|
40 |
+
In 1939 which writer lived on Toulouse Street in the French Quarter & chose the professional name that bonded him to the South?
|
41 |
+
What National Park is named for a river indigenous people called Mi tse a-da-zi, translated by French-speaking trappers as 'Pierre Jaune'?
|
42 |
+
In 2010 who introduced the 4-point shot, 35 feet from the basket?
|
43 |
+
Losses over Asia in the 1960s led to the establishment of the program known as what at a San Diego naval base in 1969?
|
44 |
+
A craft that visited what was named for Giotto, based on the story that 680 years earlier, the painter depicted it as the Star of Bethlehem?
|
45 |
+
In World War I, 'Cistern' & 'reservoir' were suggested names for what secret invention, but the British preferred this less clumsy monosyllable?
|
46 |
+
Until 1806, some German nobles included among their honors the title of 'Elector' for their role in selecting this personage?
|
47 |
+
In 1904, wearing a harness, actress Nina Boucicault became the first to play what character onstage?
|
48 |
+
Alphabetically the first German city in encyclopedias, what was also the first one taken by the Allies in World War II?
|
49 |
+
This Sanskrit word referring to a spoken word or phrase comes from a word for 'to think'?
|
50 |
+
1917's 'Elements of Trench Warfare' said what Old West invention was 'difficult to destroy' & 'difficult to get through'?
|
51 |
+
Mimi Reinhard, who never learned to type using more than 2 fingers, produced what in World War II with 1,100 names, including hers?
|
52 |
+
Poseidon carried off the maiden Theophane & turned her into a ewe; their offspring was the source of what mythical object?
|
53 |
+
Published in 2011, P.D. James' final novel, 'Death Comes to Pemberley', was a sequel to what novel from 200 years earlier?
|
54 |
+
5 U.S. states have 6-letter names; only which 2 west of the Mississippi River border each other?
|
55 |
+
Originally relating to a story of suffering, what word now more commonly refers to strong emotion of any kind?
|
56 |
+
The 2007 biopic called 'La Môme' in France, meaning 'The Kid', was released in the U.S. under what other French title?
|
57 |
+
Returning home in 1493, Columbus stopped in the Azores at an island with what name, also something he'd lost off the Haiti coast?
|
58 |
+
Pskov & Nizhny Novgorod are 2 of the cities that have a fortress called what?
|
59 |
+
In the 1950s the New York Times said what author 'is writing about all lust' & his lecherous narrator 'is all of us'?
|
60 |
+
At the winter solstice, the sun is in Sagittarius; it once appeared in what constellation, giving a geographic feature its name?
|
61 |
+
Mike Post combined the sound of a slamming jail door, an anvil & 100 men stomping on a floor for what television series that debuted in 1990?
|
62 |
+
Like Sir Thomas More, 3 16th century English queens are buried at what British location?
|
63 |
+
In 1692 Increase Mather wrote, 'It were better that ten suspected' of these who 'escape, than that one innocent person be condemned'?
|
64 |
+
The Geography Mnemonic Mimal, sometimes said to be the silhouette of a chef or elf, stands for Minnesota, Iowa, Missouri, and what other 2 states?
|
65 |
+
What was first sold in 1908, at a price equivalent to about $27,000 today?
|
66 |
+
The name of what author dead since 2013 now appears on books written by a former U.S. marshal & a former Apache helicopter pilot?
|
67 |
+
The artwork once known in France as 'la tapisserie de la Reine Mathilde' is better known as what?
|
68 |
+
In 2022 which pop star became the first woman to have a Billboard Top 10 album in 5 decades starting with the 1980s?
|
69 |
+
In one 19th century translation, what female classic tale character 'perceived the dawn of day and ceased' speaking nearly 1,000 times?
|
70 |
+
Ironically, though what company founded in the 1860s is Moore County, Tennessee's largest employer, Moore is a dry county?
|
71 |
+
After a 1789 event, who wrote, 'My first determination was to seek a supply of…water at Tofoa, & afterwards to sail for Tongataboo'?
|
72 |
+
Laurence Olivier & Ernest Borgnine were considered for the lead role & Sergio Leone to direct for what film that turned 50 in 2022?
|
73 |
+
Until a 1903 secession, what country's contiguous territory spanned 2 continents?
|
74 |
+
Early in her career which foreign-born author translated romance novels into Spanish, often changing the dialogue to make the heroines smarter?
|
75 |
+
Saying it was stolen by Napoleon, self-styled Italian patriot Vincenzo Peruggia took what in 1911?
|
76 |
+
Continuing a downward trend, in July 2022 what US body of water was at 27% capacity, its lowest level since 1937 when it was first being filled?
|
77 |
+
Each morning which goddess began her ride in her chariot across the sky ahead of her brother Sol, or Helios?
|
78 |
+
Until the Civil War, the Jan. 8 date of what American battle of dubious military importance but big morale value was a national holiday?
|
79 |
+
Which children's book title character is told 'By the time you are real, most of your hair has been loved off your eyes drop out & you get shabby'?
|
80 |
+
In a TV reunion over 40 years in the making, Dolly Parton appeared as an angel named Agnes in the final episode of what comedy in 2022?
|
81 |
+
In an 1847 American poem what character sees her town of Grand-Pré burned, but finally reunites with her beau for a kiss before his death?
|
82 |
+
In 2001 who published a book called 'Banging Your Head Against a Brick Wall'; in 2002, 'Existencilism'?
|
83 |
+
The title object of what childrens book 'never looked more beautiful each strand held dozens of bright drops of early morning dew'?
|
84 |
+
The shouts of excited children at a 1946 holiday parade are said to have inspired what perennial classic song favorite?
|
85 |
+
Unable to make what candies perfectly round, the confectioner embraced this flawed name for the product?
|
86 |
+
What country is home to 58 UNESCO World Heritage Sites, more than any other country; the sites include a volcano & a lagoon?
|
87 |
+
What action movie's last line is 'If this is their idea of Christmas, I gotta be here for New Years'?
|
88 |
+
Only 3 presidents have married while in office— John Tyler was the first & which one was the last?
|
89 |
+
Demonstrating the dignity & humanity of Black Americans, who sat for 160 known photographs, the most of any American in the 19th century?
|
90 |
+
Originally, which Latin 3-word phrase referred to when a doctor or apothecary substituted one medicine for another?
|
91 |
+
The 1975 premiere of what movie comedy advertised free coconuts for the first thousand in the audience?
|
92 |
+
A cocktail, an island & a WWII venture originally called 'Development of Substitute Materials' all bear what name?
|
93 |
+
Which US President was sworn in twice as President within 2 years, first by his father & then later by a former U.S. President?
|
94 |
+
A 1609 story in which an exiled king of Bulgaria creates a sea palace with his magic may have inspired the plot of what play?
|
95 |
+
In 2009, during a 20th anniversary celebration, what landmark was called 'an edifice of fear. On Nov. 9, it became a place of joy'?
|
96 |
+
Among what world capital's nicknames are the 'City of Classical Music' &, possibly in honor of a famous resident from 1860 to 1938, the 'City of Dreams'?
|
97 |
+
Now meaning someone with nocturnal habits, what catches a sleeping dove in Shakespeare's 'Lucrece'?
|
98 |
+
The stars on what country's flag represent states, 26 of them; unlike the USA's, its 'federal district' gets its own 27th star?
|
99 |
+
What father was the only man among the 13 plaintiffs in a US class-action case filed in 1951?
|
100 |
+
Reversing the story of what heroine she created, childrens author Patricia Maclachlan was born on the prairie but spent much of her life in New England?
|
examples/main/CMakeLists.txt
ADDED
@@ -0,0 +1,7 @@
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
1 |
+
set(TARGET main)
|
2 |
+
add_executable(${TARGET} main.cpp)
|
3 |
+
target_link_libraries(${TARGET} PRIVATE common llama ${CMAKE_THREAD_LIBS_INIT})
|
4 |
+
target_compile_features(${TARGET} PRIVATE cxx_std_11)
|
5 |
+
if(TARGET BUILD_INFO)
|
6 |
+
add_dependencies(${TARGET} BUILD_INFO)
|
7 |
+
endif()
|
examples/main/README.md
ADDED
@@ -0,0 +1,293 @@
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
1 |
+
# llama.cpp/example/main
|
2 |
+
|
3 |
+
This example program allows you to use various LLaMA language models in an easy and efficient way. It is specifically designed to work with the [llama.cpp](https://github.com/ggerganov/llama.cpp) project, which provides a plain C/C++ implementation with optional 4-bit quantization support for faster, lower memory inference, and is optimized for desktop CPUs. This program can be used to perform various inference tasks with LLaMA models, including generating text based on user-provided prompts and chat-like interactions with reverse prompts.
|
4 |
+
|
5 |
+
## Table of Contents
|
6 |
+
|
7 |
+
1. [Quick Start](#quick-start)
|
8 |
+
2. [Common Options](#common-options)
|
9 |
+
3. [Input Prompts](#input-prompts)
|
10 |
+
4. [Interaction](#interaction)
|
11 |
+
5. [Context Management](#context-management)
|
12 |
+
6. [Generation Flags](#generation-flags)
|
13 |
+
7. [Performance Tuning and Memory Options](#performance-tuning-and-memory-options)
|
14 |
+
8. [Additional Options](#additional-options)
|
15 |
+
|
16 |
+
## Quick Start
|
17 |
+
|
18 |
+
To get started right away, run the following command, making sure to use the correct path for the model you have:
|
19 |
+
|
20 |
+
#### Unix-based systems (Linux, macOS, etc.):
|
21 |
+
|
22 |
+
```bash
|
23 |
+
./main -m models/7B/ggml-model.bin --prompt "Once upon a time"
|
24 |
+
```
|
25 |
+
|
26 |
+
#### Windows:
|
27 |
+
|
28 |
+
```powershell
|
29 |
+
main.exe -m models\7B\ggml-model.bin --prompt "Once upon a time"
|
30 |
+
```
|
31 |
+
|
32 |
+
For an interactive experience, try this command:
|
33 |
+
|
34 |
+
#### Unix-based systems (Linux, macOS, etc.):
|
35 |
+
|
36 |
+
```bash
|
37 |
+
./main -m models/7B/ggml-model.bin -n -1 --color -r "User:" --in-prefix " " \
|
38 |
+
'User: Hi
|
39 |
+
AI: Hello. I am an AI chatbot. Would you like to talk?
|
40 |
+
User: Sure!
|
41 |
+
AI: What would you like to talk about?
|
42 |
+
User:'
|
43 |
+
```
|
44 |
+
|
45 |
+
#### Windows:
|
46 |
+
|
47 |
+
```powershell
|
48 |
+
main.exe -m models\7B\ggml-model.bin -n -1 --color -r "User:" --in-prefix " " -e --prompt "User: Hi\nAI: Hello. I am an AI chatbot. Would you like to talk?\nUser: Sure!\nAI: What would you like to talk about?\nUser:"
|
49 |
+
```
|
50 |
+
|
51 |
+
The following command generates "infinite" text from a starting prompt (you can use `Ctrl-C` to stop it):
|
52 |
+
|
53 |
+
#### Unix-based systems (Linux, macOS, etc.):
|
54 |
+
|
55 |
+
```bash
|
56 |
+
./main -m models/7B/ggml-model.bin --ignore-eos -n -1 --random-prompt
|
57 |
+
```
|
58 |
+
|
59 |
+
#### Windows:
|
60 |
+
|
61 |
+
```powershell
|
62 |
+
main.exe -m models\7B\ggml-model.bin --ignore-eos -n -1 --random-prompt
|
63 |
+
```
|
64 |
+
|
65 |
+
## Common Options
|
66 |
+
|
67 |
+
In this section, we cover the most commonly used options for running the `main` program with the LLaMA models:
|
68 |
+
|
69 |
+
- `-m FNAME, --model FNAME`: Specify the path to the LLaMA model file (e.g., `models/7B/ggml-model.bin`).
|
70 |
+
- `-i, --interactive`: Run the program in interactive mode, allowing you to provide input directly and receive real-time responses.
|
71 |
+
- `-ins, --instruct`: Run the program in instruction mode, which is particularly useful when working with Alpaca models.
|
72 |
+
- `-n N, --n-predict N`: Set the number of tokens to predict when generating text. Adjusting this value can influence the length of the generated text.
|
73 |
+
- `-c N, --ctx-size N`: Set the size of the prompt context. The default is 512, but LLaMA models were built with a context of 2048, which will provide better results for longer input/inference.
|
74 |
+
|
75 |
+
## Input Prompts
|
76 |
+
|
77 |
+
The `main` program provides several ways to interact with the LLaMA models using input prompts:
|
78 |
+
|
79 |
+
- `--prompt PROMPT`: Provide a prompt directly as a command-line option.
|
80 |
+
- `--file FNAME`: Provide a file containing a prompt or multiple prompts.
|
81 |
+
- `--interactive-first`: Run the program in interactive mode and wait for input right away. (More on this below.)
|
82 |
+
- `--random-prompt`: Start with a randomized prompt.
|
83 |
+
|
84 |
+
## Interaction
|
85 |
+
|
86 |
+
The `main` program offers a seamless way to interact with LLaMA models, allowing users to engage in real-time conversations or provide instructions for specific tasks. The interactive mode can be triggered using various options, including `--interactive`, `--interactive-first`, and `--instruct`.
|
87 |
+
|
88 |
+
In interactive mode, users can participate in text generation by injecting their input during the process. Users can press `Ctrl+C` at any time to interject and type their input, followed by pressing `Return` to submit it to the LLaMA model. To submit additional lines without finalizing input, users can end the current line with a backslash (`\`) and continue typing.
|
89 |
+
|
90 |
+
### Interaction Options
|
91 |
+
|
92 |
+
- `-i, --interactive`: Run the program in interactive mode, allowing users to engage in real-time conversations or provide specific instructions to the model.
|
93 |
+
- `--interactive-first`: Run the program in interactive mode and immediately wait for user input before starting the text generation.
|
94 |
+
- `-ins, --instruct`: Run the program in instruction mode, which is specifically designed to work with Alpaca models that excel in completing tasks based on user instructions.
|
95 |
+
- `--color`: Enable colorized output to differentiate visually distinguishing between prompts, user input, and generated text.
|
96 |
+
|
97 |
+
By understanding and utilizing these interaction options, you can create engaging and dynamic experiences with the LLaMA models, tailoring the text generation process to your specific needs.
|
98 |
+
|
99 |
+
### Reverse Prompts
|
100 |
+
|
101 |
+
Reverse prompts are a powerful way to create a chat-like experience with a LLaMA model by pausing the text generation when specific text strings are encountered:
|
102 |
+
|
103 |
+
- `-r PROMPT, --reverse-prompt PROMPT`: Specify one or multiple reverse prompts to pause text generation and switch to interactive mode. For example, `-r "User:"` can be used to jump back into the conversation whenever it's the user's turn to speak. This helps create a more interactive and conversational experience. However, the reverse prompt doesn't work when it ends with a space.
|
104 |
+
|
105 |
+
To overcome this limitation, you can use the `--in-prefix` flag to add a space or any other characters after the reverse prompt.
|
106 |
+
|
107 |
+
### In-Prefix
|
108 |
+
|
109 |
+
The `--in-prefix` flag is used to add a prefix to your input, primarily, this is used to insert a space after the reverse prompt. Here's an example of how to use the `--in-prefix` flag in conjunction with the `--reverse-prompt` flag:
|
110 |
+
|
111 |
+
```sh
|
112 |
+
./main -r "User:" --in-prefix " "
|
113 |
+
```
|
114 |
+
|
115 |
+
### In-Suffix
|
116 |
+
|
117 |
+
The `--in-suffix` flag is used to add a suffix after your input. This is useful for adding an "Assistant:" prompt after the user's input. It's added after the new-line character (`\n`) that's automatically added to the end of the user's input. Here's an example of how to use the `--in-suffix` flag in conjunction with the `--reverse-prompt` flag:
|
118 |
+
|
119 |
+
```sh
|
120 |
+
./main -r "User:" --in-prefix " " --in-suffix "Assistant:"
|
121 |
+
```
|
122 |
+
|
123 |
+
### Instruction Mode
|
124 |
+
|
125 |
+
Instruction mode is particularly useful when working with Alpaca models, which are designed to follow user instructions for specific tasks:
|
126 |
+
|
127 |
+
- `-ins, --instruct`: Enable instruction mode to leverage the capabilities of Alpaca models in completing tasks based on user-provided instructions.
|
128 |
+
|
129 |
+
Technical detail: the user's input is internally prefixed with the reverse prompt (or `### Instruction:` as the default), and followed by `### Response:` (except if you just press Return without any input, to keep generating a longer response).
|
130 |
+
|
131 |
+
By understanding and utilizing these interaction options, you can create engaging and dynamic experiences with the LLaMA models, tailoring the text generation process to your specific needs.
|
132 |
+
|
133 |
+
## Context Management
|
134 |
+
|
135 |
+
During text generation, LLaMA models have a limited context size, which means they can only consider a certain number of tokens from the input and generated text. When the context fills up, the model resets internally, potentially losing some information from the beginning of the conversation or instructions. Context management options help maintain continuity and coherence in these situations.
|
136 |
+
|
137 |
+
### Context Size
|
138 |
+
|
139 |
+
The `--ctx-size` option allows you to set the size of the prompt context used by the LLaMA models during text generation. A larger context size helps the model to better comprehend and generate responses for longer input or conversations.
|
140 |
+
|
141 |
+
- `-c N, --ctx-size N`: Set the size of the prompt context (default: 512). The LLaMA models were built with a context of 2048, which will yield the best results on longer input/inference. However, increasing the context size beyond 2048 may lead to unpredictable results.
|
142 |
+
|
143 |
+
### Keep Prompt
|
144 |
+
|
145 |
+
The `--keep` option allows users to retain the original prompt when the model runs out of context, ensuring a connection to the initial instruction or conversation topic is maintained.
|
146 |
+
|
147 |
+
- `--keep N`: Specify the number of tokens from the initial prompt to retain when the model resets its internal context. By default, this value is set to 0 (meaning no tokens are kept). Use `-1` to retain all tokens from the initial prompt.
|
148 |
+
|
149 |
+
By utilizing context management options like `--ctx-size` and `--keep`, you can maintain a more coherent and consistent interaction with the LLaMA models, ensuring that the generated text remains relevant to the original prompt or conversation.
|
150 |
+
|
151 |
+
## Generation Flags
|
152 |
+
|
153 |
+
The following options allow you to control the text generation process and fine-tune the diversity, creativity, and quality of the generated text according to your needs. By adjusting these options and experimenting with different combinations of values, you can find the best settings for your specific use case.
|
154 |
+
|
155 |
+
### Number of Tokens to Predict
|
156 |
+
|
157 |
+
- `-n N, --n-predict N`: Set the number of tokens to predict when generating text (default: 128, -1 = infinity).
|
158 |
+
|
159 |
+
The `--n-predict` option controls the number of tokens the model generates in response to the input prompt. By adjusting this value, you can influence the length of the generated text. A higher value will result in longer text, while a lower value will produce shorter text. A value of -1 will cause text to be generated without limit.
|
160 |
+
|
161 |
+
It is important to note that the generated text may be shorter than the specified number of tokens if an End-of-Sequence (EOS) token or a reverse prompt is encountered. In interactive mode text generation will pause and control will be returned to the user. In non-interactive mode, the program will end. In both cases, the text generation may stop before reaching the specified `n-predict` value. If you want the model to keep going without ever producing End-of-Sequence on its own, you can use the `--ignore-eos` parameter.
|
162 |
+
|
163 |
+
### Temperature
|
164 |
+
|
165 |
+
- `--temp N`: Adjust the randomness of the generated text (default: 0.8).
|
166 |
+
|
167 |
+
Temperature is a hyperparameter that controls the randomness of the generated text. It affects the probability distribution of the model's output tokens. A higher temperature (e.g., 1.5) makes the output more random and creative, while a lower temperature (e.g., 0.5) makes the output more focused, deterministic, and conservative. The default value is 0.8, which provides a balance between randomness and determinism. At the extreme, a temperature of 0 will always pick the most likely next token, leading to identical outputs in each run.
|
168 |
+
|
169 |
+
Example usage: `--temp 0.5`
|
170 |
+
|
171 |
+
### Repeat Penalty
|
172 |
+
|
173 |
+
- `--repeat-penalty N`: Control the repetition of token sequences in the generated text (default: 1.1).
|
174 |
+
- `--repeat-last-n N`: Last n tokens to consider for penalizing repetition (default: 64, 0 = disabled, -1 = ctx-size).
|
175 |
+
- `--no-penalize-nl`: Disable penalization for newline tokens when applying the repeat penalty.
|
176 |
+
|
177 |
+
The `repeat-penalty` option helps prevent the model from generating repetitive or monotonous text. A higher value (e.g., 1.5) will penalize repetitions more strongly, while a lower value (e.g., 0.9) will be more lenient. The default value is 1.1.
|
178 |
+
|
179 |
+
The `repeat-last-n` option controls the number of tokens in the history to consider for penalizing repetition. A larger value will look further back in the generated text to prevent repetitions, while a smaller value will only consider recent tokens. A value of 0 disables the penalty, and a value of -1 sets the number of tokens considered equal to the context size (`ctx-size`).
|
180 |
+
|
181 |
+
Use the `--no-penalize-nl` option to disable newline penalization when applying the repeat penalty. This option is particularly useful for generating chat conversations, dialogues, code, poetry, or any text where newline tokens play a significant role in structure and formatting. Disabling newline penalization helps maintain the natural flow and intended formatting in these specific use cases.
|
182 |
+
|
183 |
+
Example usage: `--repeat-penalty 1.15 --repeat-last-n 128 --no-penalize-nl`
|
184 |
+
|
185 |
+
### Top-K Sampling
|
186 |
+
|
187 |
+
- `--top-k N`: Limit the next token selection to the K most probable tokens (default: 40).
|
188 |
+
|
189 |
+
Top-k sampling is a text generation method that selects the next token only from the top k most likely tokens predicted by the model. It helps reduce the risk of generating low-probability or nonsensical tokens, but it may also limit the diversity of the output. A higher value for top-k (e.g., 100) will consider more tokens and lead to more diverse text, while a lower value (e.g., 10) will focus on the most probable tokens and generate more conservative text. The default value is 40.
|
190 |
+
|
191 |
+
Example usage: `--top-k 30`
|
192 |
+
|
193 |
+
### Top-P Sampling
|
194 |
+
|
195 |
+
- `--top-p N`: Limit the next token selection to a subset of tokens with a cumulative probability above a threshold P (default: 0.9).
|
196 |
+
|
197 |
+
Top-p sampling, also known as nucleus sampling, is another text generation method that selects the next token from a subset of tokens that together have a cumulative probability of at least p. This method provides a balance between diversity and quality by considering both the probabilities of tokens and the number of tokens to sample from. A higher value for top-p (e.g., 0.95) will lead to more diverse text, while a lower value (e.g., 0.5) will generate more focused and conservative text. The default value is 0.9.
|
198 |
+
|
199 |
+
Example usage: `--top-p 0.95`
|
200 |
+
|
201 |
+
### Tail Free Sampling (TFS)
|
202 |
+
|
203 |
+
- `--tfs N`: Enable tail free sampling with parameter z (default: 1.0, 1.0 = disabled).
|
204 |
+
|
205 |
+
Tail free sampling (TFS) is a text generation technique that aims to reduce the impact of less likely tokens, which may be less relevant, less coherent, or nonsensical, on the output. The method adjusts the logits (token probabilities) by raising them to the power of the parameter z. A higher value of z (e.g., 2.0) will further suppress less likely tokens from the tail of the distribution, while a value of 1.0 disables the effect of TFS. By setting the parameter z, you can control how much the probabilities of less likely tokens are reduced.
|
206 |
+
|
207 |
+
Example usage: `--tfs 2.0`
|
208 |
+
|
209 |
+
### Locally Typical Sampling
|
210 |
+
|
211 |
+
- `--typical N`: Enable locally typical sampling with parameter p (default: 1.0, 1.0 = disabled).
|
212 |
+
|
213 |
+
Locally typical sampling promotes the generation of contextually coherent and diverse text by sampling tokens that are typical or expected based on the surrounding context. By setting the parameter p between 0 and 1, you can control the balance between producing text that is locally coherent and diverse. A value closer to 1 will promote more contextually coherent tokens, while a value closer to 0 will promote more diverse tokens. A value equal to 1 disables locally typical sampling.
|
214 |
+
|
215 |
+
Example usage: `--typical 0.9`
|
216 |
+
|
217 |
+
### Mirostat Sampling
|
218 |
+
|
219 |
+
- `--mirostat N`: Enable Mirostat sampling, controlling perplexity during text generation (default: 0, 0 = disabled, 1 = Mirostat, 2 = Mirostat 2.0).
|
220 |
+
- `--mirostat-lr N`: Set the Mirostat learning rate, parameter eta (default: 0.1).
|
221 |
+
- `--mirostat-ent N`: Set the Mirostat target entropy, parameter tau (default: 5.0).
|
222 |
+
|
223 |
+
Mirostat is an algorithm that actively maintains the quality of generated text within a desired range during text generation. It aims to strike a balance between coherence and diversity, avoiding low-quality output caused by excessive repetition (boredom traps) or incoherence (confusion traps).
|
224 |
+
|
225 |
+
The `--mirostat-lr` option sets the Mirostat learning rate (eta). The learning rate influences how quickly the algorithm responds to feedback from the generated text. A lower learning rate will result in slower adjustments, while a higher learning rate will make the algorithm more responsive. The default value is `0.1`.
|
226 |
+
|
227 |
+
The `--mirostat-ent` option sets the Mirostat target entropy (tau), which represents the desired perplexity value for the generated text. Adjusting the target entropy allows you to control the balance between coherence and diversity in the generated text. A lower value will result in more focused and coherent text, while a higher value will lead to more diverse and potentially less coherent text. The default value is `5.0`.
|
228 |
+
|
229 |
+
Example usage: `--mirostat 2 --mirostat-lr 0.05 --mirostat-ent 3.0`
|
230 |
+
|
231 |
+
### Logit Bias
|
232 |
+
|
233 |
+
- `-l TOKEN_ID(+/-)BIAS, --logit-bias TOKEN_ID(+/-)BIAS`: Modify the likelihood of a token appearing in the generated text completion.
|
234 |
+
|
235 |
+
The logit bias option allows you to manually adjust the likelihood of specific tokens appearing in the generated text. By providing a token ID and a positive or negative bias value, you can increase or decrease the probability of that token being generated.
|
236 |
+
|
237 |
+
For example, use `--logit-bias 15043+1` to increase the likelihood of the token 'Hello', or `--logit-bias 15043-1` to decrease its likelihood. Using a value of negative infinity, `--logit-bias 15043-inf` ensures that the token `Hello` is never produced.
|
238 |
+
|
239 |
+
A more practical use case might be to prevent the generation of `\code{begin}` and `\code{end}` by setting the `\` token (29905) to negative infinity with `-l 29905-inf`. (This is due to the prevalence of LaTeX codes that show up in LLaMA model inference.)
|
240 |
+
|
241 |
+
Example usage: `--logit-bias 29905-inf`
|
242 |
+
|
243 |
+
### RNG Seed
|
244 |
+
|
245 |
+
- `-s SEED, --seed SEED`: Set the random number generator (RNG) seed (default: -1, < 0 = random seed).
|
246 |
+
|
247 |
+
The RNG seed is used to initialize the random number generator that influences the text generation process. By setting a specific seed value, you can obtain consistent and reproducible results across multiple runs with the same input and settings. This can be helpful for testing, debugging, or comparing the effects of different options on the generated text to see when they diverge. If the seed is set to a value less than 0, a random seed will be used, which will result in different outputs on each run.
|
248 |
+
|
249 |
+
## Performance Tuning and Memory Options
|
250 |
+
|
251 |
+
These options help improve the performance and memory usage of the LLaMA models. By adjusting these settings, you can fine-tune the model's behavior to better suit your system's capabilities and achieve optimal performance for your specific use case.
|
252 |
+
|
253 |
+
### Number of Threads
|
254 |
+
|
255 |
+
- `-t N, --threads N`: Set the number of threads to use during computation. For optimal performance, it is recommended to set this value to the number of physical CPU cores your system has (as opposed to the logical number of cores). Using the correct number of threads can greatly improve performance.
|
256 |
+
|
257 |
+
### Mlock
|
258 |
+
|
259 |
+
- `--mlock`: Lock the model in memory, preventing it from being swapped out when memory-mapped. This can improve performance but trades away some of the advantages of memory-mapping by requiring more RAM to run and potentially slowing down load times as the model loads into RAM.
|
260 |
+
|
261 |
+
### No Memory Mapping
|
262 |
+
|
263 |
+
- `--no-mmap`: Do not memory-map the model. By default, models are mapped into memory, which allows the system to load only the necessary parts of the model as needed. However, if the model is larger than your total amount of RAM or if your system is low on available memory, using mmap might increase the risk of pageouts, negatively impacting performance. Disabling mmap results in slower load times but may reduce pageouts if you're not using `--mlock`. Note that if the model is larger than the total amount of RAM, turning off mmap would prevent the model from loading at all.
|
264 |
+
|
265 |
+
### Memory Float 32
|
266 |
+
|
267 |
+
- `--memory-f32`: Use 32-bit floats instead of 16-bit floats for memory key+value. This doubles the context memory requirement and cached prompt file size but does not appear to increase generation quality in a measurable way. Not recommended.
|
268 |
+
|
269 |
+
### Batch Size
|
270 |
+
|
271 |
+
- `-b N, --batch-size N`: Set the batch size for prompt processing (default: 512). This large batch size benefits users who have BLAS installed and enabled it during the build. If you don't have BLAS enabled ("BLAS=0"), you can use a smaller number, such as 8, to see the prompt progress as it's evaluated in some situations.
|
272 |
+
|
273 |
+
### Prompt Caching
|
274 |
+
|
275 |
+
- `--prompt-cache FNAME`: Specify a file to cache the model state after the initial prompt. This can significantly speed up the startup time when you're using longer prompts. The file is created during the first run and is reused and updated in subsequent runs. **Note**: Restoring a cached prompt does not imply restoring the exact state of the session at the point it was saved. So even when specifying a specific seed, you are not guaranteed to get the same sequence of tokens as the original generation.
|
276 |
+
|
277 |
+
### Quantization
|
278 |
+
|
279 |
+
For information about 4-bit quantization, which can significantly improve performance and reduce memory usage, please refer to llama.cpp's primary [README](../../README.md#prepare-data--run).
|
280 |
+
|
281 |
+
## Additional Options
|
282 |
+
|
283 |
+
These options provide extra functionality and customization when running the LLaMA models:
|
284 |
+
|
285 |
+
- `-h, --help`: Display a help message showing all available options and their default values. This is particularly useful for checking the latest options and default values, as they can change frequently, and the information in this document may become outdated.
|
286 |
+
- `--verbose-prompt`: Print the prompt before generating text.
|
287 |
+
- `--mtest`: Test the model's functionality by running a series of tests to ensure it's working properly.
|
288 |
+
- `-ngl N, --n-gpu-layers N`: When compiled with appropriate support (currently CLBlast or cuBLAS), this option allows offloading some layers to the GPU for computation. Generally results in increased performance.
|
289 |
+
- `-mg i, --main-gpu i`: When using multiple GPUs this option controls which GPU is used for small tensors for which the overhead of splitting the computation across all GPUs is not worthwhile. The GPU in question will use slightly more VRAM to store a scratch buffer for temporary results. By default GPU 0 is used. Requires cuBLAS.
|
290 |
+
- `-ts SPLIT, --tensor-split SPLIT`: When using multiple GPUs this option controls how large tensors should be split across all GPUs. `SPLIT` is a comma-separated list of non-negative values that assigns the proportion of data that each GPU should get in order. For example, "3,2" will assign 60% of the data to GPU 0 and 40% to GPU 1. By default the data is split in proportion to VRAM but this may not be optimal for performance. Requires cuBLAS.
|
291 |
+
- `-lv, --low-vram`: Do not allocate a VRAM scratch buffer for holding temporary results. Reduces VRAM usage at the cost of performance, particularly prompt processing speed. Requires cuBLAS.
|
292 |
+
- `--lora FNAME`: Apply a LoRA (Low-Rank Adaptation) adapter to the model (implies --no-mmap). This allows you to adapt the pretrained model to specific tasks or domains.
|
293 |
+
- `--lora-base FNAME`: Optional model to use as a base for the layers modified by the LoRA adapter. This flag is used in conjunction with the `--lora` flag, and specifies the base model for the adaptation.
|
examples/main/main.cpp
ADDED
@@ -0,0 +1,675 @@
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
1 |
+
// Defines sigaction on msys:
|
2 |
+
#ifndef _GNU_SOURCE
|
3 |
+
#define _GNU_SOURCE
|
4 |
+
#endif
|
5 |
+
|
6 |
+
#include "common.h"
|
7 |
+
#include "llama.h"
|
8 |
+
#include "build-info.h"
|
9 |
+
|
10 |
+
#include <cassert>
|
11 |
+
#include <cinttypes>
|
12 |
+
#include <cmath>
|
13 |
+
#include <cstdio>
|
14 |
+
#include <cstring>
|
15 |
+
#include <ctime>
|
16 |
+
#include <fstream>
|
17 |
+
#include <iostream>
|
18 |
+
#include <string>
|
19 |
+
#include <vector>
|
20 |
+
|
21 |
+
#if defined (__unix__) || (defined (__APPLE__) && defined (__MACH__))
|
22 |
+
#include <signal.h>
|
23 |
+
#include <unistd.h>
|
24 |
+
#elif defined (_WIN32)
|
25 |
+
#define WIN32_LEAN_AND_MEAN
|
26 |
+
#ifndef NOMINMAX
|
27 |
+
#define NOMINMAX
|
28 |
+
#endif
|
29 |
+
#include <windows.h>
|
30 |
+
#include <signal.h>
|
31 |
+
#endif
|
32 |
+
|
33 |
+
#if defined(_MSC_VER)
|
34 |
+
#pragma warning(disable: 4244 4267) // possible loss of data
|
35 |
+
#endif
|
36 |
+
|
37 |
+
static console_state con_st;
|
38 |
+
static llama_context ** g_ctx;
|
39 |
+
|
40 |
+
static bool is_interacting = false;
|
41 |
+
|
42 |
+
#if defined (__unix__) || (defined (__APPLE__) && defined (__MACH__)) || defined (_WIN32)
|
43 |
+
void sigint_handler(int signo) {
|
44 |
+
if (signo == SIGINT) {
|
45 |
+
if (!is_interacting) {
|
46 |
+
is_interacting=true;
|
47 |
+
} else {
|
48 |
+
console_cleanup(con_st);
|
49 |
+
printf("\n");
|
50 |
+
llama_print_timings(*g_ctx);
|
51 |
+
_exit(130);
|
52 |
+
}
|
53 |
+
}
|
54 |
+
}
|
55 |
+
#endif
|
56 |
+
|
57 |
+
int main(int argc, char ** argv) {
|
58 |
+
gpt_params params;
|
59 |
+
|
60 |
+
if (gpt_params_parse(argc, argv, params) == false) {
|
61 |
+
return 1;
|
62 |
+
}
|
63 |
+
|
64 |
+
// save choice to use color for later
|
65 |
+
// (note for later: this is a slightly awkward choice)
|
66 |
+
con_st.use_color = params.use_color;
|
67 |
+
con_st.multiline_input = params.multiline_input;
|
68 |
+
console_init(con_st);
|
69 |
+
atexit([]() { console_cleanup(con_st); });
|
70 |
+
|
71 |
+
if (params.perplexity) {
|
72 |
+
printf("\n************\n");
|
73 |
+
printf("%s: please use the 'perplexity' tool for perplexity calculations\n", __func__);
|
74 |
+
printf("************\n\n");
|
75 |
+
|
76 |
+
return 0;
|
77 |
+
}
|
78 |
+
|
79 |
+
if (params.embedding) {
|
80 |
+
printf("\n************\n");
|
81 |
+
printf("%s: please use the 'embedding' tool for embedding calculations\n", __func__);
|
82 |
+
printf("************\n\n");
|
83 |
+
|
84 |
+
return 0;
|
85 |
+
}
|
86 |
+
|
87 |
+
if (params.n_ctx > 2048) {
|
88 |
+
fprintf(stderr, "%s: warning: model does not support context sizes greater than 2048 tokens (%d specified);"
|
89 |
+
"expect poor results\n", __func__, params.n_ctx);
|
90 |
+
} else if (params.n_ctx < 8) {
|
91 |
+
fprintf(stderr, "%s: warning: minimum context size is 8, using minimum size.\n", __func__);
|
92 |
+
params.n_ctx = 8;
|
93 |
+
}
|
94 |
+
|
95 |
+
fprintf(stderr, "%s: build = %d (%s)\n", __func__, BUILD_NUMBER, BUILD_COMMIT);
|
96 |
+
|
97 |
+
if (params.seed < 0) {
|
98 |
+
params.seed = time(NULL);
|
99 |
+
}
|
100 |
+
|
101 |
+
fprintf(stderr, "%s: seed = %d\n", __func__, params.seed);
|
102 |
+
|
103 |
+
std::mt19937 rng(params.seed);
|
104 |
+
if (params.random_prompt) {
|
105 |
+
params.prompt = gpt_random_prompt(rng);
|
106 |
+
}
|
107 |
+
|
108 |
+
llama_init_backend();
|
109 |
+
|
110 |
+
llama_model * model;
|
111 |
+
llama_context * ctx;
|
112 |
+
g_ctx = &ctx;
|
113 |
+
|
114 |
+
// load the model and apply lora adapter, if any
|
115 |
+
std::tie(model, ctx) = llama_init_from_gpt_params(params);
|
116 |
+
if (model == NULL) {
|
117 |
+
fprintf(stderr, "%s: error: unable to load model\n", __func__);
|
118 |
+
return 1;
|
119 |
+
}
|
120 |
+
|
121 |
+
// print system information
|
122 |
+
{
|
123 |
+
fprintf(stderr, "\n");
|
124 |
+
fprintf(stderr, "system_info: n_threads = %d / %d | %s\n",
|
125 |
+
params.n_threads, std::thread::hardware_concurrency(), llama_print_system_info());
|
126 |
+
}
|
127 |
+
|
128 |
+
// determine the maximum memory usage needed to do inference for the given n_batch and n_predict parameters
|
129 |
+
// uncomment the "used_mem" line in llama.cpp to see the results
|
130 |
+
if (params.mem_test) {
|
131 |
+
{
|
132 |
+
const std::vector<llama_token> tmp(params.n_batch, llama_token_bos());
|
133 |
+
llama_eval(ctx, tmp.data(), tmp.size(), 0, params.n_threads);
|
134 |
+
}
|
135 |
+
|
136 |
+
{
|
137 |
+
const std::vector<llama_token> tmp = { 0, };
|
138 |
+
llama_eval(ctx, tmp.data(), tmp.size(), params.n_predict - 1, params.n_threads);
|
139 |
+
}
|
140 |
+
|
141 |
+
llama_print_timings(ctx);
|
142 |
+
llama_free(ctx);
|
143 |
+
llama_free_model(model);
|
144 |
+
|
145 |
+
return 0;
|
146 |
+
}
|
147 |
+
|
148 |
+
// export the cgraph and exit
|
149 |
+
if (params.export_cgraph) {
|
150 |
+
llama_eval_export(ctx, "llama.ggml");
|
151 |
+
llama_free(ctx);
|
152 |
+
llama_free_model(model);
|
153 |
+
|
154 |
+
return 0;
|
155 |
+
}
|
156 |
+
|
157 |
+
std::string path_session = params.path_prompt_cache;
|
158 |
+
std::vector<llama_token> session_tokens;
|
159 |
+
|
160 |
+
if (!path_session.empty()) {
|
161 |
+
fprintf(stderr, "%s: attempting to load saved session from '%s'\n", __func__, path_session.c_str());
|
162 |
+
|
163 |
+
// fopen to check for existing session
|
164 |
+
FILE * fp = std::fopen(path_session.c_str(), "rb");
|
165 |
+
if (fp != NULL) {
|
166 |
+
std::fclose(fp);
|
167 |
+
|
168 |
+
session_tokens.resize(params.n_ctx);
|
169 |
+
size_t n_token_count_out = 0;
|
170 |
+
if (!llama_load_session_file(ctx, path_session.c_str(), session_tokens.data(), session_tokens.capacity(), &n_token_count_out)) {
|
171 |
+
fprintf(stderr, "%s: error: failed to load session file '%s'\n", __func__, path_session.c_str());
|
172 |
+
return 1;
|
173 |
+
}
|
174 |
+
session_tokens.resize(n_token_count_out);
|
175 |
+
llama_set_rng_seed(ctx, params.seed);
|
176 |
+
|
177 |
+
fprintf(stderr, "%s: loaded a session with prompt size of %d tokens\n", __func__, (int) session_tokens.size());
|
178 |
+
} else {
|
179 |
+
fprintf(stderr, "%s: session file does not exist, will create\n", __func__);
|
180 |
+
}
|
181 |
+
}
|
182 |
+
|
183 |
+
// tokenize the prompt
|
184 |
+
std::vector<llama_token> embd_inp;
|
185 |
+
|
186 |
+
if (params.interactive_first || params.instruct || !params.prompt.empty() || session_tokens.empty()) {
|
187 |
+
// Add a space in front of the first character to match OG llama tokenizer behavior
|
188 |
+
params.prompt.insert(0, 1, ' ');
|
189 |
+
|
190 |
+
embd_inp = ::llama_tokenize(ctx, params.prompt, true);
|
191 |
+
} else {
|
192 |
+
embd_inp = session_tokens;
|
193 |
+
}
|
194 |
+
|
195 |
+
const int n_ctx = llama_n_ctx(ctx);
|
196 |
+
|
197 |
+
if ((int) embd_inp.size() > n_ctx - 4) {
|
198 |
+
fprintf(stderr, "%s: error: prompt is too long (%d tokens, max %d)\n", __func__, (int) embd_inp.size(), n_ctx - 4);
|
199 |
+
return 1;
|
200 |
+
}
|
201 |
+
|
202 |
+
// debug message about similarity of saved session, if applicable
|
203 |
+
size_t n_matching_session_tokens = 0;
|
204 |
+
if (session_tokens.size()) {
|
205 |
+
for (llama_token id : session_tokens) {
|
206 |
+
if (n_matching_session_tokens >= embd_inp.size() || id != embd_inp[n_matching_session_tokens]) {
|
207 |
+
break;
|
208 |
+
}
|
209 |
+
n_matching_session_tokens++;
|
210 |
+
}
|
211 |
+
if (params.prompt.empty() && n_matching_session_tokens == embd_inp.size()) {
|
212 |
+
fprintf(stderr, "%s: using full prompt from session file\n", __func__);
|
213 |
+
} else if (n_matching_session_tokens >= embd_inp.size()) {
|
214 |
+
fprintf(stderr, "%s: session file has exact match for prompt!\n", __func__);
|
215 |
+
} else if (n_matching_session_tokens < (embd_inp.size() / 2)) {
|
216 |
+
fprintf(stderr, "%s: warning: session file has low similarity to prompt (%zu / %zu tokens); will mostly be reevaluated\n",
|
217 |
+
__func__, n_matching_session_tokens, embd_inp.size());
|
218 |
+
} else {
|
219 |
+
fprintf(stderr, "%s: session file matches %zu / %zu tokens of prompt\n",
|
220 |
+
__func__, n_matching_session_tokens, embd_inp.size());
|
221 |
+
}
|
222 |
+
}
|
223 |
+
|
224 |
+
// if we will use the cache for the full prompt without reaching the end of the cache, force
|
225 |
+
// reevaluation of the last token token to recalculate the cached logits
|
226 |
+
if (!embd_inp.empty() && n_matching_session_tokens == embd_inp.size() &&
|
227 |
+
session_tokens.size() > embd_inp.size()) {
|
228 |
+
session_tokens.resize(embd_inp.size() - 1);
|
229 |
+
}
|
230 |
+
|
231 |
+
// number of tokens to keep when resetting context
|
232 |
+
if (params.n_keep < 0 || params.n_keep > (int) embd_inp.size() || params.instruct) {
|
233 |
+
params.n_keep = (int)embd_inp.size();
|
234 |
+
}
|
235 |
+
|
236 |
+
// prefix & suffix for instruct mode
|
237 |
+
const auto inp_pfx = ::llama_tokenize(ctx, "\n\n### Instruction:\n\n", true);
|
238 |
+
const auto inp_sfx = ::llama_tokenize(ctx, "\n\n### Response:\n\n", false);
|
239 |
+
|
240 |
+
// in instruct mode, we inject a prefix and a suffix to each input by the user
|
241 |
+
if (params.instruct) {
|
242 |
+
params.interactive_first = true;
|
243 |
+
params.antiprompt.push_back("### Instruction:\n\n");
|
244 |
+
}
|
245 |
+
|
246 |
+
// enable interactive mode if interactive start is specified
|
247 |
+
if (params.interactive_first) {
|
248 |
+
params.interactive = true;
|
249 |
+
}
|
250 |
+
|
251 |
+
// determine newline token
|
252 |
+
auto llama_token_newline = ::llama_tokenize(ctx, "\n", false);
|
253 |
+
|
254 |
+
if (params.verbose_prompt) {
|
255 |
+
fprintf(stderr, "\n");
|
256 |
+
fprintf(stderr, "%s: prompt: '%s'\n", __func__, params.prompt.c_str());
|
257 |
+
fprintf(stderr, "%s: number of tokens in prompt = %zu\n", __func__, embd_inp.size());
|
258 |
+
for (int i = 0; i < (int) embd_inp.size(); i++) {
|
259 |
+
fprintf(stderr, "%6d -> '%s'\n", embd_inp[i], llama_token_to_str(ctx, embd_inp[i]));
|
260 |
+
}
|
261 |
+
if (params.n_keep > 0) {
|
262 |
+
fprintf(stderr, "%s: static prompt based on n_keep: '", __func__);
|
263 |
+
for (int i = 0; i < params.n_keep; i++) {
|
264 |
+
fprintf(stderr, "%s", llama_token_to_str(ctx, embd_inp[i]));
|
265 |
+
}
|
266 |
+
fprintf(stderr, "'\n");
|
267 |
+
}
|
268 |
+
fprintf(stderr, "\n");
|
269 |
+
}
|
270 |
+
|
271 |
+
if (params.interactive) {
|
272 |
+
#if defined (__unix__) || (defined (__APPLE__) && defined (__MACH__))
|
273 |
+
struct sigaction sigint_action;
|
274 |
+
sigint_action.sa_handler = sigint_handler;
|
275 |
+
sigemptyset (&sigint_action.sa_mask);
|
276 |
+
sigint_action.sa_flags = 0;
|
277 |
+
sigaction(SIGINT, &sigint_action, NULL);
|
278 |
+
#elif defined (_WIN32)
|
279 |
+
auto console_ctrl_handler = +[](DWORD ctrl_type) -> BOOL {
|
280 |
+
return (ctrl_type == CTRL_C_EVENT) ? (sigint_handler(SIGINT), true) : false;
|
281 |
+
};
|
282 |
+
SetConsoleCtrlHandler(static_cast<PHANDLER_ROUTINE>(console_ctrl_handler), true);
|
283 |
+
#endif
|
284 |
+
|
285 |
+
fprintf(stderr, "%s: interactive mode on.\n", __func__);
|
286 |
+
|
287 |
+
if (params.antiprompt.size()) {
|
288 |
+
for (auto antiprompt : params.antiprompt) {
|
289 |
+
fprintf(stderr, "Reverse prompt: '%s'\n", antiprompt.c_str());
|
290 |
+
}
|
291 |
+
}
|
292 |
+
|
293 |
+
if (!params.input_prefix.empty()) {
|
294 |
+
fprintf(stderr, "Input prefix: '%s'\n", params.input_prefix.c_str());
|
295 |
+
}
|
296 |
+
|
297 |
+
if (!params.input_suffix.empty()) {
|
298 |
+
fprintf(stderr, "Input suffix: '%s'\n", params.input_suffix.c_str());
|
299 |
+
}
|
300 |
+
}
|
301 |
+
fprintf(stderr, "sampling: repeat_last_n = %d, repeat_penalty = %f, presence_penalty = %f, frequency_penalty = %f, top_k = %d, tfs_z = %f, top_p = %f, typical_p = %f, temp = %f, mirostat = %d, mirostat_lr = %f, mirostat_ent = %f\n",
|
302 |
+
params.repeat_last_n, params.repeat_penalty, params.presence_penalty, params.frequency_penalty, params.top_k, params.tfs_z, params.top_p, params.typical_p, params.temp, params.mirostat, params.mirostat_eta, params.mirostat_tau);
|
303 |
+
fprintf(stderr, "generate: n_ctx = %d, n_batch = %d, n_predict = %d, n_keep = %d\n", n_ctx, params.n_batch, params.n_predict, params.n_keep);
|
304 |
+
fprintf(stderr, "\n\n");
|
305 |
+
|
306 |
+
// TODO: replace with ring-buffer
|
307 |
+
std::vector<llama_token> last_n_tokens(n_ctx);
|
308 |
+
std::fill(last_n_tokens.begin(), last_n_tokens.end(), 0);
|
309 |
+
|
310 |
+
if (params.interactive) {
|
311 |
+
const char *control_message;
|
312 |
+
if (con_st.multiline_input) {
|
313 |
+
control_message = " - To return control to LLaMa, end your input with '\\'.\n"
|
314 |
+
" - To return control without starting a new line, end your input with '/'.\n";
|
315 |
+
} else {
|
316 |
+
control_message = " - Press Return to return control to LLaMa.\n"
|
317 |
+
" - To return control without starting a new line, end your input with '/'.\n"
|
318 |
+
" - If you want to submit another line, end your input with '\\'.\n";
|
319 |
+
}
|
320 |
+
fprintf(stderr, "== Running in interactive mode. ==\n"
|
321 |
+
#if defined (__unix__) || (defined (__APPLE__) && defined (__MACH__)) || defined (_WIN32)
|
322 |
+
" - Press Ctrl+C to interject at any time.\n"
|
323 |
+
#endif
|
324 |
+
"%s\n", control_message);
|
325 |
+
|
326 |
+
is_interacting = params.interactive_first;
|
327 |
+
}
|
328 |
+
|
329 |
+
bool is_antiprompt = false;
|
330 |
+
bool input_echo = true;
|
331 |
+
bool need_to_save_session = !path_session.empty() && n_matching_session_tokens < embd_inp.size();
|
332 |
+
|
333 |
+
int n_past = 0;
|
334 |
+
int n_remain = params.n_predict;
|
335 |
+
int n_consumed = 0;
|
336 |
+
int n_session_consumed = 0;
|
337 |
+
|
338 |
+
// the first thing we will do is to output the prompt, so set color accordingly
|
339 |
+
console_set_color(con_st, CONSOLE_COLOR_PROMPT);
|
340 |
+
|
341 |
+
std::vector<llama_token> embd;
|
342 |
+
|
343 |
+
// do one empty run to warm up the model
|
344 |
+
{
|
345 |
+
const std::vector<llama_token> tmp = { llama_token_bos(), };
|
346 |
+
llama_eval(ctx, tmp.data(), tmp.size(), 0, params.n_threads);
|
347 |
+
llama_reset_timings(ctx);
|
348 |
+
}
|
349 |
+
|
350 |
+
while ((n_remain != 0 && !is_antiprompt) || params.interactive) {
|
351 |
+
// predict
|
352 |
+
if (embd.size() > 0) {
|
353 |
+
// Note: n_ctx - 4 here is to match the logic for commandline prompt handling via
|
354 |
+
// --prompt or --file which uses the same value.
|
355 |
+
auto max_embd_size = n_ctx - 4;
|
356 |
+
// Ensure the input doesn't exceed the context size by truncating embd if necessary.
|
357 |
+
if ((int)embd.size() > max_embd_size) {
|
358 |
+
auto skipped_tokens = embd.size() - max_embd_size;
|
359 |
+
console_set_color(con_st, CONSOLE_COLOR_ERROR);
|
360 |
+
printf("<<input too long: skipped %zu token%s>>", skipped_tokens, skipped_tokens != 1 ? "s" : "");
|
361 |
+
console_set_color(con_st, CONSOLE_COLOR_DEFAULT);
|
362 |
+
fflush(stdout);
|
363 |
+
embd.resize(max_embd_size);
|
364 |
+
}
|
365 |
+
|
366 |
+
// infinite text generation via context swapping
|
367 |
+
// if we run out of context:
|
368 |
+
// - take the n_keep first tokens from the original prompt (via n_past)
|
369 |
+
// - take half of the last (n_ctx - n_keep) tokens and recompute the logits in batches
|
370 |
+
if (n_past + (int) embd.size() > n_ctx) {
|
371 |
+
const int n_left = n_past - params.n_keep;
|
372 |
+
|
373 |
+
// always keep the first token - BOS
|
374 |
+
n_past = std::max(1, params.n_keep);
|
375 |
+
|
376 |
+
// insert n_left/2 tokens at the start of embd from last_n_tokens
|
377 |
+
embd.insert(embd.begin(), last_n_tokens.begin() + n_ctx - n_left/2 - embd.size(), last_n_tokens.end() - embd.size());
|
378 |
+
|
379 |
+
// stop saving session if we run out of context
|
380 |
+
path_session.clear();
|
381 |
+
|
382 |
+
//printf("\n---\n");
|
383 |
+
//printf("resetting: '");
|
384 |
+
//for (int i = 0; i < (int) embd.size(); i++) {
|
385 |
+
// printf("%s", llama_token_to_str(ctx, embd[i]));
|
386 |
+
//}
|
387 |
+
//printf("'\n");
|
388 |
+
//printf("\n---\n");
|
389 |
+
}
|
390 |
+
|
391 |
+
// try to reuse a matching prefix from the loaded session instead of re-eval (via n_past)
|
392 |
+
if (n_session_consumed < (int) session_tokens.size()) {
|
393 |
+
size_t i = 0;
|
394 |
+
for ( ; i < embd.size(); i++) {
|
395 |
+
if (embd[i] != session_tokens[n_session_consumed]) {
|
396 |
+
session_tokens.resize(n_session_consumed);
|
397 |
+
break;
|
398 |
+
}
|
399 |
+
|
400 |
+
n_past++;
|
401 |
+
n_session_consumed++;
|
402 |
+
|
403 |
+
if (n_session_consumed >= (int) session_tokens.size()) {
|
404 |
+
++i;
|
405 |
+
break;
|
406 |
+
}
|
407 |
+
}
|
408 |
+
if (i > 0) {
|
409 |
+
embd.erase(embd.begin(), embd.begin() + i);
|
410 |
+
}
|
411 |
+
}
|
412 |
+
|
413 |
+
// evaluate tokens in batches
|
414 |
+
// embd is typically prepared beforehand to fit within a batch, but not always
|
415 |
+
for (int i = 0; i < (int) embd.size(); i += params.n_batch) {
|
416 |
+
int n_eval = (int) embd.size() - i;
|
417 |
+
if (n_eval > params.n_batch) {
|
418 |
+
n_eval = params.n_batch;
|
419 |
+
}
|
420 |
+
if (llama_eval(ctx, &embd[i], n_eval, n_past, params.n_threads)) {
|
421 |
+
fprintf(stderr, "%s : failed to eval\n", __func__);
|
422 |
+
return 1;
|
423 |
+
}
|
424 |
+
n_past += n_eval;
|
425 |
+
}
|
426 |
+
|
427 |
+
if (embd.size() > 0 && !path_session.empty()) {
|
428 |
+
session_tokens.insert(session_tokens.end(), embd.begin(), embd.end());
|
429 |
+
n_session_consumed = session_tokens.size();
|
430 |
+
}
|
431 |
+
}
|
432 |
+
|
433 |
+
embd.clear();
|
434 |
+
|
435 |
+
if ((int) embd_inp.size() <= n_consumed && !is_interacting) {
|
436 |
+
// out of user input, sample next token
|
437 |
+
const float temp = params.temp;
|
438 |
+
const int32_t top_k = params.top_k <= 0 ? llama_n_vocab(ctx) : params.top_k;
|
439 |
+
const float top_p = params.top_p;
|
440 |
+
const float tfs_z = params.tfs_z;
|
441 |
+
const float typical_p = params.typical_p;
|
442 |
+
const int32_t repeat_last_n = params.repeat_last_n < 0 ? n_ctx : params.repeat_last_n;
|
443 |
+
const float repeat_penalty = params.repeat_penalty;
|
444 |
+
const float alpha_presence = params.presence_penalty;
|
445 |
+
const float alpha_frequency = params.frequency_penalty;
|
446 |
+
const int mirostat = params.mirostat;
|
447 |
+
const float mirostat_tau = params.mirostat_tau;
|
448 |
+
const float mirostat_eta = params.mirostat_eta;
|
449 |
+
const bool penalize_nl = params.penalize_nl;
|
450 |
+
|
451 |
+
// optionally save the session on first sample (for faster prompt loading next time)
|
452 |
+
if (!path_session.empty() && need_to_save_session && !params.prompt_cache_ro) {
|
453 |
+
need_to_save_session = false;
|
454 |
+
llama_save_session_file(ctx, path_session.c_str(), session_tokens.data(), session_tokens.size());
|
455 |
+
}
|
456 |
+
|
457 |
+
llama_token id = 0;
|
458 |
+
|
459 |
+
{
|
460 |
+
auto logits = llama_get_logits(ctx);
|
461 |
+
auto n_vocab = llama_n_vocab(ctx);
|
462 |
+
|
463 |
+
// Apply params.logit_bias map
|
464 |
+
for (auto it = params.logit_bias.begin(); it != params.logit_bias.end(); it++) {
|
465 |
+
logits[it->first] += it->second;
|
466 |
+
}
|
467 |
+
|
468 |
+
std::vector<llama_token_data> candidates;
|
469 |
+
candidates.reserve(n_vocab);
|
470 |
+
for (llama_token token_id = 0; token_id < n_vocab; token_id++) {
|
471 |
+
candidates.emplace_back(llama_token_data{token_id, logits[token_id], 0.0f});
|
472 |
+
}
|
473 |
+
|
474 |
+
llama_token_data_array candidates_p = { candidates.data(), candidates.size(), false };
|
475 |
+
|
476 |
+
// Apply penalties
|
477 |
+
float nl_logit = logits[llama_token_nl()];
|
478 |
+
auto last_n_repeat = std::min(std::min((int)last_n_tokens.size(), repeat_last_n), n_ctx);
|
479 |
+
llama_sample_repetition_penalty(ctx, &candidates_p,
|
480 |
+
last_n_tokens.data() + last_n_tokens.size() - last_n_repeat,
|
481 |
+
last_n_repeat, repeat_penalty);
|
482 |
+
llama_sample_frequency_and_presence_penalties(ctx, &candidates_p,
|
483 |
+
last_n_tokens.data() + last_n_tokens.size() - last_n_repeat,
|
484 |
+
last_n_repeat, alpha_frequency, alpha_presence);
|
485 |
+
if (!penalize_nl) {
|
486 |
+
logits[llama_token_nl()] = nl_logit;
|
487 |
+
}
|
488 |
+
|
489 |
+
if (temp <= 0) {
|
490 |
+
// Greedy sampling
|
491 |
+
id = llama_sample_token_greedy(ctx, &candidates_p);
|
492 |
+
} else {
|
493 |
+
if (mirostat == 1) {
|
494 |
+
static float mirostat_mu = 2.0f * mirostat_tau;
|
495 |
+
const int mirostat_m = 100;
|
496 |
+
llama_sample_temperature(ctx, &candidates_p, temp);
|
497 |
+
id = llama_sample_token_mirostat(ctx, &candidates_p, mirostat_tau, mirostat_eta, mirostat_m, &mirostat_mu);
|
498 |
+
} else if (mirostat == 2) {
|
499 |
+
static float mirostat_mu = 2.0f * mirostat_tau;
|
500 |
+
llama_sample_temperature(ctx, &candidates_p, temp);
|
501 |
+
id = llama_sample_token_mirostat_v2(ctx, &candidates_p, mirostat_tau, mirostat_eta, &mirostat_mu);
|
502 |
+
} else {
|
503 |
+
// Temperature sampling
|
504 |
+
llama_sample_top_k(ctx, &candidates_p, top_k, 1);
|
505 |
+
llama_sample_tail_free(ctx, &candidates_p, tfs_z, 1);
|
506 |
+
llama_sample_typical(ctx, &candidates_p, typical_p, 1);
|
507 |
+
llama_sample_top_p(ctx, &candidates_p, top_p, 1);
|
508 |
+
llama_sample_temperature(ctx, &candidates_p, temp);
|
509 |
+
id = llama_sample_token(ctx, &candidates_p);
|
510 |
+
}
|
511 |
+
}
|
512 |
+
// printf("`%d`", candidates_p.size);
|
513 |
+
|
514 |
+
last_n_tokens.erase(last_n_tokens.begin());
|
515 |
+
last_n_tokens.push_back(id);
|
516 |
+
}
|
517 |
+
|
518 |
+
// replace end of text token with newline token when in interactive mode
|
519 |
+
if (id == llama_token_eos() && params.interactive && !params.instruct) {
|
520 |
+
id = llama_token_newline.front();
|
521 |
+
if (params.antiprompt.size() != 0) {
|
522 |
+
// tokenize and inject first reverse prompt
|
523 |
+
const auto first_antiprompt = ::llama_tokenize(ctx, params.antiprompt.front(), false);
|
524 |
+
embd_inp.insert(embd_inp.end(), first_antiprompt.begin(), first_antiprompt.end());
|
525 |
+
}
|
526 |
+
}
|
527 |
+
|
528 |
+
// add it to the context
|
529 |
+
embd.push_back(id);
|
530 |
+
|
531 |
+
// echo this to console
|
532 |
+
input_echo = true;
|
533 |
+
|
534 |
+
// decrement remaining sampling budget
|
535 |
+
--n_remain;
|
536 |
+
} else {
|
537 |
+
// some user input remains from prompt or interaction, forward it to processing
|
538 |
+
while ((int) embd_inp.size() > n_consumed) {
|
539 |
+
embd.push_back(embd_inp[n_consumed]);
|
540 |
+
last_n_tokens.erase(last_n_tokens.begin());
|
541 |
+
last_n_tokens.push_back(embd_inp[n_consumed]);
|
542 |
+
++n_consumed;
|
543 |
+
if ((int) embd.size() >= params.n_batch) {
|
544 |
+
break;
|
545 |
+
}
|
546 |
+
}
|
547 |
+
}
|
548 |
+
|
549 |
+
// display text
|
550 |
+
if (input_echo) {
|
551 |
+
for (auto id : embd) {
|
552 |
+
printf("%s", llama_token_to_str(ctx, id));
|
553 |
+
}
|
554 |
+
fflush(stdout);
|
555 |
+
}
|
556 |
+
// reset color to default if we there is no pending user input
|
557 |
+
if (input_echo && (int)embd_inp.size() == n_consumed) {
|
558 |
+
console_set_color(con_st, CONSOLE_COLOR_DEFAULT);
|
559 |
+
}
|
560 |
+
|
561 |
+
// if not currently processing queued inputs;
|
562 |
+
if ((int) embd_inp.size() <= n_consumed) {
|
563 |
+
|
564 |
+
// check for reverse prompt
|
565 |
+
if (params.antiprompt.size()) {
|
566 |
+
std::string last_output;
|
567 |
+
for (auto id : last_n_tokens) {
|
568 |
+
last_output += llama_token_to_str(ctx, id);
|
569 |
+
}
|
570 |
+
|
571 |
+
is_antiprompt = false;
|
572 |
+
// Check if each of the reverse prompts appears at the end of the output.
|
573 |
+
// If we're not running interactively, the reverse prompt might be tokenized with some following characters
|
574 |
+
// so we'll compensate for that by widening the search window a bit.
|
575 |
+
for (std::string & antiprompt : params.antiprompt) {
|
576 |
+
size_t extra_padding = params.interactive ? 0 : 2;
|
577 |
+
size_t search_start_pos = last_output.length() > static_cast<size_t>(antiprompt.length() + extra_padding)
|
578 |
+
? last_output.length() - static_cast<size_t>(antiprompt.length() + extra_padding)
|
579 |
+
: 0;
|
580 |
+
|
581 |
+
if (last_output.find(antiprompt.c_str(), search_start_pos) != std::string::npos) {
|
582 |
+
if (params.interactive) {
|
583 |
+
is_interacting = true;
|
584 |
+
console_set_color(con_st, CONSOLE_COLOR_USER_INPUT);
|
585 |
+
}
|
586 |
+
is_antiprompt = true;
|
587 |
+
fflush(stdout);
|
588 |
+
break;
|
589 |
+
}
|
590 |
+
}
|
591 |
+
}
|
592 |
+
|
593 |
+
if (n_past > 0 && is_interacting) {
|
594 |
+
if (params.instruct) {
|
595 |
+
printf("\n> ");
|
596 |
+
}
|
597 |
+
|
598 |
+
std::string buffer;
|
599 |
+
if (!params.input_prefix.empty()) {
|
600 |
+
buffer += params.input_prefix;
|
601 |
+
printf("%s", buffer.c_str());
|
602 |
+
}
|
603 |
+
|
604 |
+
std::string line;
|
605 |
+
bool another_line = true;
|
606 |
+
do {
|
607 |
+
another_line = console_readline(con_st, line);
|
608 |
+
buffer += line;
|
609 |
+
} while (another_line);
|
610 |
+
|
611 |
+
// done taking input, reset color
|
612 |
+
console_set_color(con_st, CONSOLE_COLOR_DEFAULT);
|
613 |
+
|
614 |
+
// Add tokens to embd only if the input buffer is non-empty
|
615 |
+
// Entering a empty line lets the user pass control back
|
616 |
+
if (buffer.length() > 1) {
|
617 |
+
// append input suffix if any
|
618 |
+
if (!params.input_suffix.empty()) {
|
619 |
+
buffer += params.input_suffix;
|
620 |
+
printf("%s", params.input_suffix.c_str());
|
621 |
+
}
|
622 |
+
|
623 |
+
// instruct mode: insert instruction prefix
|
624 |
+
if (params.instruct && !is_antiprompt) {
|
625 |
+
n_consumed = embd_inp.size();
|
626 |
+
embd_inp.insert(embd_inp.end(), inp_pfx.begin(), inp_pfx.end());
|
627 |
+
}
|
628 |
+
|
629 |
+
auto line_inp = ::llama_tokenize(ctx, buffer, false);
|
630 |
+
embd_inp.insert(embd_inp.end(), line_inp.begin(), line_inp.end());
|
631 |
+
|
632 |
+
// instruct mode: insert response suffix
|
633 |
+
if (params.instruct) {
|
634 |
+
embd_inp.insert(embd_inp.end(), inp_sfx.begin(), inp_sfx.end());
|
635 |
+
}
|
636 |
+
|
637 |
+
n_remain -= line_inp.size();
|
638 |
+
}
|
639 |
+
|
640 |
+
input_echo = false; // do not echo this again
|
641 |
+
}
|
642 |
+
|
643 |
+
if (n_past > 0) {
|
644 |
+
is_interacting = false;
|
645 |
+
}
|
646 |
+
}
|
647 |
+
|
648 |
+
// end of text token
|
649 |
+
if (!embd.empty() && embd.back() == llama_token_eos()) {
|
650 |
+
if (params.instruct) {
|
651 |
+
is_interacting = true;
|
652 |
+
} else {
|
653 |
+
fprintf(stderr, " [end of text]\n");
|
654 |
+
break;
|
655 |
+
}
|
656 |
+
}
|
657 |
+
|
658 |
+
// In interactive mode, respect the maximum number of tokens and drop back to user input when reached.
|
659 |
+
if (params.interactive && n_remain <= 0 && params.n_predict != -1) {
|
660 |
+
n_remain = params.n_predict;
|
661 |
+
is_interacting = true;
|
662 |
+
}
|
663 |
+
}
|
664 |
+
|
665 |
+
if (!path_session.empty() && params.prompt_cache_all && !params.prompt_cache_ro) {
|
666 |
+
fprintf(stderr, "\n%s: saving final output to session file '%s'\n", __func__, path_session.c_str());
|
667 |
+
llama_save_session_file(ctx, path_session.c_str(), session_tokens.data(), session_tokens.size());
|
668 |
+
}
|
669 |
+
|
670 |
+
llama_print_timings(ctx);
|
671 |
+
llama_free(ctx);
|
672 |
+
llama_free_model(model);
|
673 |
+
|
674 |
+
return 0;
|
675 |
+
}
|
examples/metal/CMakeLists.txt
ADDED
@@ -0,0 +1,3 @@
|
|
|
|
|
|
|
|
|
1 |
+
set(TEST_TARGET metal)
|
2 |
+
add_executable(${TEST_TARGET} metal.cpp)
|
3 |
+
target_link_libraries(${TEST_TARGET} PRIVATE ggml)
|
examples/metal/metal.cpp
ADDED
@@ -0,0 +1,104 @@
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
1 |
+
// Evaluate a statically exported ggml computation graph with Metal
|
2 |
+
//
|
3 |
+
// - First, export a LLaMA graph:
|
4 |
+
//
|
5 |
+
// $ ./bin/main -m ../models/7B/ggml-model-q4_0.bin --export
|
6 |
+
//
|
7 |
+
// - Run this tool to evaluate the exported graph:
|
8 |
+
//
|
9 |
+
// $ ./bin/metal llama.ggml
|
10 |
+
//
|
11 |
+
// The purpose of this tool is mostly for debugging and demonstration purposes.
|
12 |
+
// The main limitation of exporting computation graphs is that their sizes are static which often
|
13 |
+
// can be a problem for real-world applications.
|
14 |
+
//
|
15 |
+
|
16 |
+
#include "ggml.h"
|
17 |
+
#include "ggml-metal.h"
|
18 |
+
|
19 |
+
#include <cstdio>
|
20 |
+
#include <cstring>
|
21 |
+
#include <cstdlib>
|
22 |
+
|
23 |
+
int main(int argc, char ** argv) {
|
24 |
+
ggml_time_init();
|
25 |
+
|
26 |
+
if (argc != 2) {
|
27 |
+
fprintf(stderr, "Usage: %s llama.ggml\n", argv[0]);
|
28 |
+
return -1;
|
29 |
+
}
|
30 |
+
|
31 |
+
const char * fname_cgraph = argv[1];
|
32 |
+
|
33 |
+
// load the compute graph
|
34 |
+
struct ggml_context * ctx_data = NULL;
|
35 |
+
struct ggml_context * ctx_eval = NULL;
|
36 |
+
|
37 |
+
struct ggml_cgraph gf = ggml_graph_import(fname_cgraph, &ctx_data, &ctx_eval);
|
38 |
+
gf.n_threads = 1;
|
39 |
+
|
40 |
+
// this allocates all Metal resources and memory buffers
|
41 |
+
auto * ctx_metal = ggml_metal_init();
|
42 |
+
|
43 |
+
const size_t max_size_data = ggml_get_max_tensor_size(ctx_data);
|
44 |
+
const size_t max_size_eval = ggml_get_max_tensor_size(ctx_eval);
|
45 |
+
ggml_metal_add_buffer(ctx_metal, "data", ggml_get_mem_buffer(ctx_data), ggml_get_mem_size(ctx_data), max_size_data);
|
46 |
+
ggml_metal_add_buffer(ctx_metal, "eval", ggml_get_mem_buffer(ctx_eval), ggml_get_mem_size(ctx_eval), max_size_eval);
|
47 |
+
|
48 |
+
// main
|
49 |
+
{
|
50 |
+
struct ggml_tensor * input = ggml_graph_get_tensor(&gf, "embd");
|
51 |
+
*(int32_t *) input->data = 1; // BOS
|
52 |
+
|
53 |
+
ggml_metal_set_tensor(ctx_metal, input);
|
54 |
+
|
55 |
+
// warmup
|
56 |
+
ggml_metal_graph_compute(ctx_metal, &gf);
|
57 |
+
|
58 |
+
const int n_iter = 16;
|
59 |
+
|
60 |
+
const int64_t t0 = ggml_time_us();
|
61 |
+
|
62 |
+
// the actual inference happens here
|
63 |
+
for (int i = 0; i < n_iter; ++i) {
|
64 |
+
ggml_metal_graph_compute(ctx_metal, &gf);
|
65 |
+
}
|
66 |
+
|
67 |
+
const int64_t t1 = ggml_time_us();
|
68 |
+
|
69 |
+
printf("time: %.2f ms, %.2f ms/tok\n", (t1 - t0) / 1000.0, (t1 - t0) / 1000.0 / n_iter);
|
70 |
+
}
|
71 |
+
|
72 |
+
// debug output
|
73 |
+
{
|
74 |
+
struct ggml_tensor * logits = gf.nodes[gf.n_nodes - 1];
|
75 |
+
ggml_metal_get_tensor(ctx_metal, logits);
|
76 |
+
|
77 |
+
float * ptr = (float *) ggml_get_data(logits);
|
78 |
+
|
79 |
+
printf("logits: ");
|
80 |
+
for (int i = 0; i < 10; i++) {
|
81 |
+
printf("%8.4f ", ptr[i]);
|
82 |
+
}
|
83 |
+
printf("\n");
|
84 |
+
int imax = 0;
|
85 |
+
double sum = 0.0;
|
86 |
+
double vmax = -1e9;
|
87 |
+
for (int i = 0; i < 32000; i++) {
|
88 |
+
sum += (double) ptr[i];
|
89 |
+
if (ptr[i] > vmax) {
|
90 |
+
vmax = ptr[i];
|
91 |
+
imax = i;
|
92 |
+
}
|
93 |
+
}
|
94 |
+
printf("sum: %f, imax = %d, vmax = %f\n", sum, imax, vmax);
|
95 |
+
}
|
96 |
+
|
97 |
+
ggml_metal_free(ctx_metal);
|
98 |
+
|
99 |
+
ggml_free(ctx_data);
|
100 |
+
ggml_free(ctx_eval);
|
101 |
+
|
102 |
+
return 0;
|
103 |
+
}
|
104 |
+
|
examples/perplexity/CMakeLists.txt
ADDED
@@ -0,0 +1,7 @@
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
1 |
+
set(TARGET perplexity)
|
2 |
+
add_executable(${TARGET} perplexity.cpp)
|
3 |
+
target_link_libraries(${TARGET} PRIVATE common llama ${CMAKE_THREAD_LIBS_INIT})
|
4 |
+
target_compile_features(${TARGET} PRIVATE cxx_std_11)
|
5 |
+
if(TARGET BUILD_INFO)
|
6 |
+
add_dependencies(${TARGET} BUILD_INFO)
|
7 |
+
endif()
|
examples/perplexity/README.md
ADDED
@@ -0,0 +1,3 @@
|
|
|
|
|
|
|
|
|
1 |
+
# perplexity
|
2 |
+
|
3 |
+
TODO
|
examples/perplexity/perplexity.cpp
ADDED
@@ -0,0 +1,176 @@
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
1 |
+
#include "common.h"
|
2 |
+
#include "llama.h"
|
3 |
+
#include "build-info.h"
|
4 |
+
|
5 |
+
#include <cmath>
|
6 |
+
#include <ctime>
|
7 |
+
|
8 |
+
#if defined(_MSC_VER)
|
9 |
+
#pragma warning(disable: 4244 4267) // possible loss of data
|
10 |
+
#endif
|
11 |
+
|
12 |
+
std::vector<float> softmax(const std::vector<float>& logits) {
|
13 |
+
std::vector<float> probs(logits.size());
|
14 |
+
float max_logit = logits[0];
|
15 |
+
for (float v : logits) max_logit = std::max(max_logit, v);
|
16 |
+
double sum_exp = 0.0;
|
17 |
+
for (size_t i = 0; i < logits.size(); i++) {
|
18 |
+
// Subtract the maximum logit value from the current logit value for numerical stability
|
19 |
+
const float logit = logits[i] - max_logit;
|
20 |
+
const float exp_logit = expf(logit);
|
21 |
+
sum_exp += exp_logit;
|
22 |
+
probs[i] = exp_logit;
|
23 |
+
}
|
24 |
+
for (size_t i = 0; i < probs.size(); i++) probs[i] /= sum_exp;
|
25 |
+
return probs;
|
26 |
+
}
|
27 |
+
|
28 |
+
void perplexity(llama_context * ctx, const gpt_params & params) {
|
29 |
+
// Download: https://s3.amazonaws.com/research.metamind.io/wikitext/wikitext-2-raw-v1.zip?ref=salesforce-research
|
30 |
+
// Run `./perplexity -m models/7B/ggml-model-q4_0.bin -f wiki.test.raw`
|
31 |
+
// Output: `perplexity: 13.5106 [114/114]`
|
32 |
+
// BOS tokens will be added for each chunk before eval
|
33 |
+
auto tokens = ::llama_tokenize(ctx, params.prompt, true);
|
34 |
+
|
35 |
+
int count = 0;
|
36 |
+
|
37 |
+
const int n_chunk = tokens.size() / params.n_ctx;
|
38 |
+
const int n_vocab = llama_n_vocab(ctx);
|
39 |
+
const int n_batch = params.n_batch;
|
40 |
+
|
41 |
+
double nll = 0.0;
|
42 |
+
fprintf(stderr, "%s: calculating perplexity over %d chunks, batch_size=%d\n", __func__, n_chunk, n_batch);
|
43 |
+
|
44 |
+
for (int i = 0; i < n_chunk; ++i) {
|
45 |
+
const int start = i * params.n_ctx;
|
46 |
+
const int end = start + params.n_ctx;
|
47 |
+
|
48 |
+
const int num_batches = (params.n_ctx + n_batch - 1) / n_batch;
|
49 |
+
|
50 |
+
std::vector<float> logits;
|
51 |
+
|
52 |
+
const auto t_start = std::chrono::high_resolution_clock::now();
|
53 |
+
|
54 |
+
for (int j = 0; j < num_batches; ++j) {
|
55 |
+
const int batch_start = start + j * n_batch;
|
56 |
+
const int batch_size = std::min(end - batch_start, n_batch);
|
57 |
+
|
58 |
+
// save original token and restore it after eval
|
59 |
+
const auto token_org = tokens[batch_start];
|
60 |
+
|
61 |
+
// add BOS token for the first batch of each chunk
|
62 |
+
if (j == 0) {
|
63 |
+
tokens[batch_start] = llama_token_bos();
|
64 |
+
}
|
65 |
+
|
66 |
+
if (llama_eval(ctx, tokens.data() + batch_start, batch_size, j * n_batch, params.n_threads)) {
|
67 |
+
fprintf(stderr, "%s : failed to eval\n", __func__);
|
68 |
+
return;
|
69 |
+
}
|
70 |
+
|
71 |
+
// restore the original token in case it was set to BOS
|
72 |
+
tokens[batch_start] = token_org;
|
73 |
+
|
74 |
+
const auto batch_logits = llama_get_logits(ctx);
|
75 |
+
logits.insert(logits.end(), batch_logits, batch_logits + batch_size * n_vocab);
|
76 |
+
}
|
77 |
+
|
78 |
+
const auto t_end = std::chrono::high_resolution_clock::now();
|
79 |
+
|
80 |
+
if (i == 0) {
|
81 |
+
const float t_total = std::chrono::duration<float>(t_end - t_start).count();
|
82 |
+
fprintf(stderr, "%s: %.2f seconds per pass - ETA ", __func__, t_total);
|
83 |
+
int total_seconds = (int)(t_total * n_chunk);
|
84 |
+
if (total_seconds >= 60*60) {
|
85 |
+
fprintf(stderr, "%d hours ", total_seconds / (60*60));
|
86 |
+
total_seconds = total_seconds % (60*60);
|
87 |
+
}
|
88 |
+
fprintf(stderr, "%d minutes\n", total_seconds / 60);
|
89 |
+
}
|
90 |
+
|
91 |
+
// We get the logits for all the tokens in the context window (params.n_ctx)
|
92 |
+
// from llama_eval above. Now, based on https://huggingface.co/docs/transformers/perplexity,
|
93 |
+
// calculate the perplexity over the last half of the window (so the model always has
|
94 |
+
// some context to predict the token).
|
95 |
+
//
|
96 |
+
// We rely on the fact that attention in the forward pass only looks at previous
|
97 |
+
// tokens here, so the logits returned for each token are an accurate representation
|
98 |
+
// of what the model would have predicted at that point.
|
99 |
+
//
|
100 |
+
// Example, we have a context window of 512, we will compute perplexity for each of the
|
101 |
+
// last 256 tokens. Then, we split the input up into context window size chunks to
|
102 |
+
// process the entire prompt.
|
103 |
+
for (int j = std::min(512, params.n_ctx / 2); j < params.n_ctx - 1; ++j) {
|
104 |
+
// Calculate probability of next token, given the previous ones.
|
105 |
+
const std::vector<float> tok_logits(
|
106 |
+
logits.begin() + (j + 0) * n_vocab,
|
107 |
+
logits.begin() + (j + 1) * n_vocab);
|
108 |
+
|
109 |
+
const float prob = softmax(tok_logits)[tokens[start + j + 1]];
|
110 |
+
|
111 |
+
nll += -std::log(prob);
|
112 |
+
++count;
|
113 |
+
}
|
114 |
+
// perplexity is e^(average negative log-likelihood)
|
115 |
+
printf("[%d]%.4lf,", i + 1, std::exp(nll / count));
|
116 |
+
fflush(stdout);
|
117 |
+
}
|
118 |
+
printf("\n");
|
119 |
+
}
|
120 |
+
|
121 |
+
int main(int argc, char ** argv) {
|
122 |
+
gpt_params params;
|
123 |
+
|
124 |
+
params.n_batch = 512;
|
125 |
+
if (gpt_params_parse(argc, argv, params) == false) {
|
126 |
+
return 1;
|
127 |
+
}
|
128 |
+
|
129 |
+
params.perplexity = true;
|
130 |
+
params.n_batch = std::min(params.n_batch, params.n_ctx);
|
131 |
+
|
132 |
+
if (params.n_ctx > 2048) {
|
133 |
+
fprintf(stderr, "%s: warning: model does not support context sizes greater than 2048 tokens (%d specified);"
|
134 |
+
"expect poor results\n", __func__, params.n_ctx);
|
135 |
+
}
|
136 |
+
|
137 |
+
fprintf(stderr, "%s: build = %d (%s)\n", __func__, BUILD_NUMBER, BUILD_COMMIT);
|
138 |
+
|
139 |
+
if (params.seed < 0) {
|
140 |
+
params.seed = time(NULL);
|
141 |
+
}
|
142 |
+
|
143 |
+
fprintf(stderr, "%s: seed = %d\n", __func__, params.seed);
|
144 |
+
|
145 |
+
std::mt19937 rng(params.seed);
|
146 |
+
if (params.random_prompt) {
|
147 |
+
params.prompt = gpt_random_prompt(rng);
|
148 |
+
}
|
149 |
+
|
150 |
+
llama_init_backend();
|
151 |
+
|
152 |
+
llama_model * model;
|
153 |
+
llama_context * ctx;
|
154 |
+
|
155 |
+
// load the model and apply lora adapter, if any
|
156 |
+
std::tie(model, ctx) = llama_init_from_gpt_params(params);
|
157 |
+
if (model == NULL) {
|
158 |
+
fprintf(stderr, "%s: error: unable to load model\n", __func__);
|
159 |
+
return 1;
|
160 |
+
}
|
161 |
+
|
162 |
+
// print system information
|
163 |
+
{
|
164 |
+
fprintf(stderr, "\n");
|
165 |
+
fprintf(stderr, "system_info: n_threads = %d / %d | %s\n",
|
166 |
+
params.n_threads, std::thread::hardware_concurrency(), llama_print_system_info());
|
167 |
+
}
|
168 |
+
|
169 |
+
perplexity(ctx, params);
|
170 |
+
|
171 |
+
llama_print_timings(ctx);
|
172 |
+
llama_free(ctx);
|
173 |
+
llama_free_model(model);
|
174 |
+
|
175 |
+
return 0;
|
176 |
+
}
|
examples/quantize-stats/CMakeLists.txt
ADDED
@@ -0,0 +1,4 @@
|
|
|
|
|
|
|
|
|
|
|
1 |
+
set(TARGET quantize-stats)
|
2 |
+
add_executable(${TARGET} quantize-stats.cpp)
|
3 |
+
target_link_libraries(${TARGET} PRIVATE llama ${CMAKE_THREAD_LIBS_INIT})
|
4 |
+
target_compile_features(${TARGET} PRIVATE cxx_std_11)
|
examples/quantize-stats/quantize-stats.cpp
ADDED
@@ -0,0 +1,438 @@
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
1 |
+
#include "ggml.h"
|
2 |
+
#include "build-info.h"
|
3 |
+
|
4 |
+
#define LLAMA_API_INTERNAL
|
5 |
+
#include "llama.h"
|
6 |
+
|
7 |
+
#include <algorithm>
|
8 |
+
#include <cassert>
|
9 |
+
#include <cinttypes>
|
10 |
+
#include <cmath>
|
11 |
+
#include <cstdio>
|
12 |
+
#include <cstring>
|
13 |
+
#include <map>
|
14 |
+
#include <numeric>
|
15 |
+
#include <regex>
|
16 |
+
#include <string>
|
17 |
+
#include <unordered_map>
|
18 |
+
#include <vector>
|
19 |
+
#include <thread>
|
20 |
+
#include <mutex>
|
21 |
+
|
22 |
+
#if defined(_MSC_VER)
|
23 |
+
#pragma warning(disable: 4244 4267) // possible loss of data
|
24 |
+
#endif
|
25 |
+
|
26 |
+
struct quantize_stats_params {
|
27 |
+
std::string model = "models/7B/ggml-model-f16.bin";
|
28 |
+
bool verbose = false;
|
29 |
+
bool per_layer_stats = false;
|
30 |
+
bool print_histogram = false;
|
31 |
+
bool reference = false;
|
32 |
+
std::vector<std::string> include_layers;
|
33 |
+
std::vector<std::string> exclude_layers;
|
34 |
+
std::vector<enum ggml_type> include_types;
|
35 |
+
};
|
36 |
+
|
37 |
+
const size_t HISTOGRAM_BUCKETS = 150;
|
38 |
+
const double HISTOGRAM_RANGE = 0.03;
|
39 |
+
|
40 |
+
struct error_stats {
|
41 |
+
size_t num_samples;
|
42 |
+
double total_error;
|
43 |
+
double max_error;
|
44 |
+
uint64_t error_histogram[HISTOGRAM_BUCKETS];
|
45 |
+
};
|
46 |
+
|
47 |
+
|
48 |
+
void quantize_stats_print_usage(int /*argc*/, char ** argv) {
|
49 |
+
quantize_stats_params params;
|
50 |
+
fprintf(stderr, "usage: %s [options]\n", argv[0]);
|
51 |
+
fprintf(stderr, "\n");
|
52 |
+
fprintf(stderr, "options:\n");
|
53 |
+
fprintf(stderr, " -h, --help show this help message and exit\n");
|
54 |
+
fprintf(stderr, " -m FNAME, --model FNAME\n");
|
55 |
+
fprintf(stderr, " model path (default: %s)\n", params.model.c_str());
|
56 |
+
fprintf(stderr, " -r, --reference\n");
|
57 |
+
fprintf(stderr, " use reference implementation (default: false)\n");
|
58 |
+
fprintf(stderr, " -v, --verbose\n");
|
59 |
+
fprintf(stderr, " verbose output (default: false)\n");
|
60 |
+
fprintf(stderr, " -p, --per-layer-stats\n");
|
61 |
+
fprintf(stderr, " print stats per layer (default: false)\n");
|
62 |
+
fprintf(stderr, " --histogram\n");
|
63 |
+
fprintf(stderr, " print error histogram (default: false)\n");
|
64 |
+
fprintf(stderr, " -l LAYER, --include-layer LAYER\n");
|
65 |
+
fprintf(stderr, " only test layers matching pattern\n");
|
66 |
+
fprintf(stderr, " -L LAYER, --exclude-layer LAYER\n");
|
67 |
+
fprintf(stderr, " exclude layers matching pattern\n");
|
68 |
+
fprintf(stderr, " -t TYPE, --type TYPE\n");
|
69 |
+
fprintf(stderr, " only test given type (q4_0, q4_1)\n");
|
70 |
+
fprintf(stderr, "\n");
|
71 |
+
}
|
72 |
+
|
73 |
+
// Check if a layer is included/excluded by command line
|
74 |
+
bool layer_included(const quantize_stats_params params, const std::string & layer) {
|
75 |
+
for (const auto& excluded : params.exclude_layers) {
|
76 |
+
if (std::regex_search(layer, std::regex(excluded))) {
|
77 |
+
return false;
|
78 |
+
}
|
79 |
+
}
|
80 |
+
for (const auto& included : params.include_layers) {
|
81 |
+
if (std::regex_search(layer, std::regex(included))) {
|
82 |
+
return true;
|
83 |
+
}
|
84 |
+
}
|
85 |
+
return params.include_layers.empty();
|
86 |
+
}
|
87 |
+
|
88 |
+
// Update error statistics given vectors with the before/after result of quantization
|
89 |
+
void update_error_stats(int64_t nelements, const float * input, const float * output, error_stats & stats) {
|
90 |
+
for (int64_t i = 0; i < nelements; i++) {
|
91 |
+
double diff = input[i] - output[i];
|
92 |
+
stats.total_error += diff * diff;
|
93 |
+
stats.max_error = fmax(fabs(diff), stats.max_error);
|
94 |
+
stats.error_histogram[std::max(std::min((size_t) floor(fabs(diff) / HISTOGRAM_RANGE * HISTOGRAM_BUCKETS), HISTOGRAM_BUCKETS-1), (size_t) 0)]++;
|
95 |
+
}
|
96 |
+
stats.num_samples += nelements;
|
97 |
+
}
|
98 |
+
|
99 |
+
void combine_error_stats(error_stats & into, const error_stats & from) {
|
100 |
+
into.num_samples += from.num_samples;
|
101 |
+
into.total_error += from.total_error;
|
102 |
+
if (from.max_error > into.max_error) into.max_error = from.max_error;
|
103 |
+
for (size_t i=0; i<HISTOGRAM_BUCKETS; ++i) into.error_histogram[i] += from.error_histogram[i];
|
104 |
+
}
|
105 |
+
|
106 |
+
double find_quantile(const error_stats & stats, double quantile) {
|
107 |
+
double sum = std::accumulate(std::begin(stats.error_histogram), std::end(stats.error_histogram), 0.0);
|
108 |
+
|
109 |
+
double accum = 0;
|
110 |
+
for (size_t i = 0; i < HISTOGRAM_BUCKETS; i++) {
|
111 |
+
accum += stats.error_histogram[i];
|
112 |
+
if (accum >= sum*quantile) {
|
113 |
+
return (i+1) * HISTOGRAM_RANGE / HISTOGRAM_BUCKETS;
|
114 |
+
}
|
115 |
+
}
|
116 |
+
return INFINITY;
|
117 |
+
}
|
118 |
+
|
119 |
+
void print_error_stats(const std::string & name, const error_stats & stats, bool print_histogram) {
|
120 |
+
double rmse = sqrt(stats.total_error / (double) stats.num_samples);
|
121 |
+
double median = find_quantile(stats, .5);
|
122 |
+
double pct95 = find_quantile(stats, .95);
|
123 |
+
printf("%-50s: rmse %.8f, maxerr %.8f, 95pct<%.4f, median<%.4f\n", name.c_str(), rmse, stats.max_error, pct95, median);
|
124 |
+
if (print_histogram) {
|
125 |
+
printf("Error distribution:\n");
|
126 |
+
for (size_t i = 0; i < HISTOGRAM_BUCKETS; i++) {
|
127 |
+
double lower = i * HISTOGRAM_RANGE / HISTOGRAM_BUCKETS;
|
128 |
+
double upper = (i+1) * HISTOGRAM_RANGE / HISTOGRAM_BUCKETS;
|
129 |
+
if (i == HISTOGRAM_BUCKETS -1) upper = INFINITY;
|
130 |
+
printf("[%3.4f, %3.4f): %11" PRIu64 "\n", lower, upper, stats.error_histogram[i]);
|
131 |
+
}
|
132 |
+
}
|
133 |
+
}
|
134 |
+
|
135 |
+
// copied from ggml.h - verify that we can access this as a flat array
|
136 |
+
static bool tensor_is_contiguous(const struct ggml_tensor * tensor) {
|
137 |
+
static_assert(GGML_MAX_DIMS == 4, "GGML_MAX_DIMS is not 4 - update this function");
|
138 |
+
|
139 |
+
return
|
140 |
+
tensor->nb[0] == ggml_type_size(tensor->type) &&
|
141 |
+
tensor->nb[1] == (tensor->nb[0]*tensor->ne[0])/ggml_blck_size(tensor->type) &&
|
142 |
+
tensor->nb[2] == tensor->nb[1]*tensor->ne[1] &&
|
143 |
+
tensor->nb[3] == tensor->nb[2]*tensor->ne[2];
|
144 |
+
}
|
145 |
+
|
146 |
+
void test_roundtrip_on_chunk(
|
147 |
+
const ggml_tensor * layer,
|
148 |
+
int64_t offset,
|
149 |
+
int64_t chunk_size,
|
150 |
+
const quantize_fns_t & qfns,
|
151 |
+
bool use_reference,
|
152 |
+
float * input_scratch,
|
153 |
+
char * quantized_scratch,
|
154 |
+
float * output_scratch,
|
155 |
+
error_stats & stats) {
|
156 |
+
|
157 |
+
if (layer->type == GGML_TYPE_F16) {
|
158 |
+
for (int i = 0; i < chunk_size; i++) {
|
159 |
+
input_scratch[i] = ggml_get_f32_1d(layer, i + offset);
|
160 |
+
}
|
161 |
+
} else {
|
162 |
+
input_scratch = ggml_get_data_f32(layer) + offset;
|
163 |
+
}
|
164 |
+
|
165 |
+
if (use_reference) {
|
166 |
+
qfns.quantize_row_q_reference(input_scratch, quantized_scratch, chunk_size);
|
167 |
+
} else {
|
168 |
+
qfns.quantize_row_q(input_scratch, quantized_scratch, chunk_size);
|
169 |
+
}
|
170 |
+
qfns.dequantize_row_q(quantized_scratch, output_scratch, chunk_size);
|
171 |
+
|
172 |
+
update_error_stats(chunk_size, input_scratch, output_scratch, stats);
|
173 |
+
}
|
174 |
+
|
175 |
+
|
176 |
+
// Run quantization function for a single layer and update error stats
|
177 |
+
void test_roundtrip_on_layer(
|
178 |
+
std::string & name,
|
179 |
+
bool print_layer_stats,
|
180 |
+
const quantize_fns_t & qfns,
|
181 |
+
bool use_reference,
|
182 |
+
const ggml_tensor * layer,
|
183 |
+
std::vector<float> & input_scratch,
|
184 |
+
std::vector<char> & quantized_scratch,
|
185 |
+
std::vector<float> & output_scratch,
|
186 |
+
error_stats & total_error,
|
187 |
+
int max_thread = 0) {
|
188 |
+
|
189 |
+
assert(tensor_is_contiguous(layer));
|
190 |
+
error_stats layer_error {};
|
191 |
+
uint64_t nelements = ggml_nelements(layer);
|
192 |
+
|
193 |
+
float* input_scratch_ptr = nullptr;
|
194 |
+
if (layer->type == GGML_TYPE_F16) {
|
195 |
+
if (input_scratch.size() < nelements) input_scratch.resize(nelements);
|
196 |
+
input_scratch_ptr = input_scratch.data();
|
197 |
+
}
|
198 |
+
if (quantized_scratch.size() < 4*nelements) quantized_scratch.resize(4*nelements);
|
199 |
+
if (output_scratch.size() < nelements) output_scratch.resize(nelements);
|
200 |
+
|
201 |
+
if (max_thread < 1) max_thread = std::thread::hardware_concurrency();
|
202 |
+
int chunk_size = 32*512;
|
203 |
+
int num_chunks = (nelements + chunk_size - 1)/chunk_size;
|
204 |
+
|
205 |
+
if (num_chunks < 2 || max_thread < 2) {
|
206 |
+
test_roundtrip_on_chunk(layer, 0, nelements, qfns, use_reference, input_scratch_ptr, quantized_scratch.data(),
|
207 |
+
output_scratch.data(), print_layer_stats ? layer_error : total_error);
|
208 |
+
} else {
|
209 |
+
auto & stats = print_layer_stats ? layer_error : total_error;
|
210 |
+
std::mutex mutex;
|
211 |
+
uint64_t counter = 0;
|
212 |
+
auto compute = [&mutex, &counter, &stats, &qfns, nelements, layer, use_reference, input_scratch_ptr,
|
213 |
+
&quantized_scratch, &output_scratch, chunk_size] () {
|
214 |
+
error_stats local_stats {};
|
215 |
+
while (true) {
|
216 |
+
std::unique_lock<std::mutex> lock(mutex);
|
217 |
+
uint64_t offset = counter; counter += chunk_size;
|
218 |
+
if (offset >= nelements) {
|
219 |
+
combine_error_stats(stats, local_stats);
|
220 |
+
break;
|
221 |
+
}
|
222 |
+
lock.unlock();
|
223 |
+
uint64_t chunk = offset + chunk_size < nelements ? chunk_size : nelements - offset;
|
224 |
+
test_roundtrip_on_chunk(layer, offset, chunk, qfns, use_reference, input_scratch_ptr + offset,
|
225 |
+
quantized_scratch.data() + 4*offset, output_scratch.data() + offset, local_stats);
|
226 |
+
}
|
227 |
+
};
|
228 |
+
int nthread = std::min(num_chunks, max_thread);
|
229 |
+
std::vector<std::thread> workers(nthread-1);
|
230 |
+
for (auto& w : workers) w = std::thread(compute);
|
231 |
+
compute();
|
232 |
+
for (auto& w : workers) w.join();
|
233 |
+
}
|
234 |
+
|
235 |
+
if (print_layer_stats) {
|
236 |
+
print_error_stats(name, layer_error, false);
|
237 |
+
combine_error_stats(total_error, layer_error);
|
238 |
+
}
|
239 |
+
}
|
240 |
+
|
241 |
+
int main(int argc, char ** argv) {
|
242 |
+
ggml_time_init();
|
243 |
+
|
244 |
+
quantize_stats_params params;
|
245 |
+
|
246 |
+
// read command line
|
247 |
+
|
248 |
+
int max_thread = 0;
|
249 |
+
bool invalid_param = false;
|
250 |
+
std::string arg;
|
251 |
+
for (int i = 1; i < argc; i++) {
|
252 |
+
arg = argv[i];
|
253 |
+
|
254 |
+
if (arg == "-h" || arg == "--help") {
|
255 |
+
quantize_stats_print_usage(argc, argv);
|
256 |
+
exit(0);
|
257 |
+
} else if (arg == "-r" || arg == "--reference") {
|
258 |
+
params.reference = true;
|
259 |
+
} else if (arg == "-v") {
|
260 |
+
params.verbose = true;
|
261 |
+
} else if (arg == "-p" || arg == "--per-layer-stats") {
|
262 |
+
params.per_layer_stats = true;
|
263 |
+
} else if (arg == "--histogram") {
|
264 |
+
params.print_histogram = true;
|
265 |
+
} else if (arg == "-m" || arg == "--model") {
|
266 |
+
if (++i >= argc) {
|
267 |
+
invalid_param = true;
|
268 |
+
break;
|
269 |
+
}
|
270 |
+
params.model = argv[i];
|
271 |
+
} else if (arg == "-l" || arg == "--include-layer") {
|
272 |
+
if (++i >= argc) {
|
273 |
+
invalid_param = true;
|
274 |
+
break;
|
275 |
+
}
|
276 |
+
params.include_layers.push_back(argv[i]);
|
277 |
+
} else if (arg == "-L" || arg == "--exclude-layer") {
|
278 |
+
if (++i >= argc) {
|
279 |
+
invalid_param = true;
|
280 |
+
break;
|
281 |
+
}
|
282 |
+
params.exclude_layers.push_back(argv[i]);
|
283 |
+
} else if (arg == "-t" || arg == "--type") {
|
284 |
+
if (++i >= argc) {
|
285 |
+
invalid_param = true;
|
286 |
+
break;
|
287 |
+
}
|
288 |
+
int j;
|
289 |
+
for (j = 0; j < GGML_TYPE_COUNT; ++j) {
|
290 |
+
const auto * name = ggml_type_name((ggml_type) j);
|
291 |
+
if (name && strcmp(argv[i], name) == 0) break;
|
292 |
+
}
|
293 |
+
if (j < GGML_TYPE_COUNT) {
|
294 |
+
params.include_types.push_back((ggml_type) j);
|
295 |
+
} else {
|
296 |
+
fprintf(stderr, "error: %s not in list of types\n", argv[i]);
|
297 |
+
invalid_param = true;
|
298 |
+
}
|
299 |
+
} else if (arg == "-n" || arg == "--num-threads") {
|
300 |
+
if (++i >= argc) {
|
301 |
+
invalid_param = true;
|
302 |
+
break;
|
303 |
+
}
|
304 |
+
max_thread = atoi(argv[i]);
|
305 |
+
} else {
|
306 |
+
fprintf(stderr, "error: unknown argument: %s\n", arg.c_str());
|
307 |
+
quantize_stats_print_usage(argc, argv);
|
308 |
+
return 1;
|
309 |
+
}
|
310 |
+
}
|
311 |
+
if (invalid_param) {
|
312 |
+
fprintf(stderr, "error: invalid parameter for argument: %s\n", arg.c_str());
|
313 |
+
quantize_stats_print_usage(argc, argv);
|
314 |
+
return 1;
|
315 |
+
}
|
316 |
+
|
317 |
+
fprintf(stderr, "%s: build = %d (%s)\n", __func__, BUILD_NUMBER, BUILD_COMMIT);
|
318 |
+
|
319 |
+
// load the model
|
320 |
+
fprintf(stderr, "Loading model\n");
|
321 |
+
|
322 |
+
const int64_t t_main_start_us = ggml_time_us();
|
323 |
+
llama_model * model;
|
324 |
+
llama_context * ctx;
|
325 |
+
|
326 |
+
{
|
327 |
+
auto lparams = llama_context_default_params();
|
328 |
+
|
329 |
+
lparams.n_ctx = 256;
|
330 |
+
lparams.seed = 1;
|
331 |
+
lparams.f16_kv = false;
|
332 |
+
lparams.use_mlock = false;
|
333 |
+
|
334 |
+
model = llama_load_model_from_file(params.model.c_str(), lparams);
|
335 |
+
|
336 |
+
if (model == NULL) {
|
337 |
+
fprintf(stderr, "%s: error: failed to load model '%s'\n", __func__, params.model.c_str());
|
338 |
+
return 1;
|
339 |
+
}
|
340 |
+
|
341 |
+
ctx = llama_new_context_with_model(model, lparams);
|
342 |
+
|
343 |
+
if (ctx == NULL) {
|
344 |
+
fprintf(stderr, "%s: error: failed to create context with model '%s'\n", __func__, params.model.c_str());
|
345 |
+
llama_free_model(model);
|
346 |
+
return 1;
|
347 |
+
}
|
348 |
+
}
|
349 |
+
|
350 |
+
const auto &tensors = llama_internal_get_tensor_map(ctx);
|
351 |
+
|
352 |
+
// check layer tensors
|
353 |
+
int included_layers = 0;
|
354 |
+
int64_t max_nelements = 0;
|
355 |
+
bool is_f16 = false;
|
356 |
+
for (const auto& kv_tensor : tensors) {
|
357 |
+
if (!layer_included(params, kv_tensor.first)) {
|
358 |
+
continue;
|
359 |
+
}
|
360 |
+
if (params.verbose) {
|
361 |
+
printf("%s: type %s, size %" PRId64 "\n", kv_tensor.first.c_str(), ggml_type_name(kv_tensor.second->type), ggml_nelements(kv_tensor.second));
|
362 |
+
}
|
363 |
+
if (kv_tensor.second->type == GGML_TYPE_F16) {
|
364 |
+
is_f16 = true;
|
365 |
+
} else if (kv_tensor.second->type != GGML_TYPE_F32) {
|
366 |
+
fprintf(stderr, "%s: error: Quantization should be tested with a float model, "
|
367 |
+
"this model contains already quantized layers (%s is type %d)\n", __func__, kv_tensor.first.c_str(), kv_tensor.second->type);
|
368 |
+
llama_free(ctx);
|
369 |
+
llama_free_model(model);
|
370 |
+
return 1;
|
371 |
+
}
|
372 |
+
included_layers++;
|
373 |
+
max_nelements = std::max(max_nelements, ggml_nelements(kv_tensor.second));
|
374 |
+
}
|
375 |
+
|
376 |
+
if (is_f16) {
|
377 |
+
printf("note: source model is f16\n");
|
378 |
+
}
|
379 |
+
printf("testing %d layers with max size %" PRId64 "\n", included_layers, max_nelements);
|
380 |
+
// allocate scratch space
|
381 |
+
std::vector<float> input_scratch;
|
382 |
+
std::vector<char> quantized_scratch;
|
383 |
+
std::vector<float> output_scratch;
|
384 |
+
|
385 |
+
// loop throught quantization types
|
386 |
+
for (int i = 0; i < GGML_TYPE_COUNT; i++) {
|
387 |
+
const ggml_type type = (ggml_type) i;
|
388 |
+
if (!params.include_types.empty() && std::find(params.include_types.begin(), params.include_types.end(), i) == params.include_types.end()) {
|
389 |
+
continue;
|
390 |
+
}
|
391 |
+
quantize_fns_t qfns = ggml_internal_get_quantize_fn(i);
|
392 |
+
if (qfns.quantize_row_q && qfns.dequantize_row_q) {
|
393 |
+
if (params.verbose) {
|
394 |
+
printf("testing %s ...\n", ggml_type_name(type));
|
395 |
+
}
|
396 |
+
|
397 |
+
error_stats global_stats {};
|
398 |
+
|
399 |
+
for (const auto& kv_tensor : tensors) {
|
400 |
+
if (!layer_included(params, kv_tensor.first)) {
|
401 |
+
continue;
|
402 |
+
}
|
403 |
+
if (params.verbose) {
|
404 |
+
printf(" %s ...\n", kv_tensor.first.c_str());
|
405 |
+
}
|
406 |
+
std::string layer_name { ggml_type_name(type) };
|
407 |
+
layer_name += "::" + kv_tensor.first;
|
408 |
+
test_roundtrip_on_layer(
|
409 |
+
layer_name,
|
410 |
+
params.per_layer_stats,
|
411 |
+
qfns,
|
412 |
+
params.reference,
|
413 |
+
kv_tensor.second,
|
414 |
+
input_scratch,
|
415 |
+
quantized_scratch,
|
416 |
+
output_scratch,
|
417 |
+
global_stats,
|
418 |
+
max_thread
|
419 |
+
);
|
420 |
+
}
|
421 |
+
|
422 |
+
print_error_stats(ggml_type_name(type), global_stats, params.print_histogram);
|
423 |
+
}
|
424 |
+
}
|
425 |
+
|
426 |
+
|
427 |
+
llama_free(ctx);
|
428 |
+
llama_free_model(model);
|
429 |
+
// report timing
|
430 |
+
{
|
431 |
+
const int64_t t_main_end_us = ggml_time_us();
|
432 |
+
|
433 |
+
printf("\n");
|
434 |
+
printf("%s: total time = %8.2f ms\n", __func__, (t_main_end_us - t_main_start_us)/1000.0);
|
435 |
+
}
|
436 |
+
|
437 |
+
return 0;
|
438 |
+
}
|
examples/quantize/CMakeLists.txt
ADDED
@@ -0,0 +1,7 @@
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
1 |
+
set(TARGET quantize)
|
2 |
+
add_executable(${TARGET} quantize.cpp)
|
3 |
+
target_link_libraries(${TARGET} PRIVATE llama ${CMAKE_THREAD_LIBS_INIT})
|
4 |
+
target_compile_features(${TARGET} PRIVATE cxx_std_11)
|
5 |
+
if(TARGET BUILD_INFO)
|
6 |
+
add_dependencies(${TARGET} BUILD_INFO)
|
7 |
+
endif()
|
examples/quantize/README.md
ADDED
@@ -0,0 +1,3 @@
|
|
|
|
|
|
|
|
|
1 |
+
# quantize
|
2 |
+
|
3 |
+
TODO
|
examples/quantize/quantize.cpp
ADDED
@@ -0,0 +1,257 @@
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
1 |
+
#include "llama.h"
|
2 |
+
|
3 |
+
#include <cstdio>
|
4 |
+
#include <cstring>
|
5 |
+
#include <vector>
|
6 |
+
#include <string>
|
7 |
+
|
8 |
+
struct quant_option {
|
9 |
+
std::string name;
|
10 |
+
llama_ftype ftype;
|
11 |
+
std::string desc;
|
12 |
+
};
|
13 |
+
|
14 |
+
static const std::vector<struct quant_option> QUANT_OPTIONS = {
|
15 |
+
{
|
16 |
+
"Q4_0",
|
17 |
+
LLAMA_FTYPE_MOSTLY_Q4_0,
|
18 |
+
" 3.50G, +0.2499 ppl @ 7B - small, very high quality loss - legacy, prefer using Q3_K_M",
|
19 |
+
},
|
20 |
+
{
|
21 |
+
"Q4_1",
|
22 |
+
LLAMA_FTYPE_MOSTLY_Q4_1,
|
23 |
+
" 3.90G, +0.1846 ppl @ 7B - small, substantial quality loss - legacy, prefer using Q3_K_L",
|
24 |
+
},
|
25 |
+
{
|
26 |
+
"Q5_0",
|
27 |
+
LLAMA_FTYPE_MOSTLY_Q5_0,
|
28 |
+
" 4.30G, +0.0796 ppl @ 7B - medium, balanced quality - legacy, prefer using Q4_K_M",
|
29 |
+
},
|
30 |
+
{
|
31 |
+
"Q5_1",
|
32 |
+
LLAMA_FTYPE_MOSTLY_Q5_1,
|
33 |
+
" 4.70G, +0.0415 ppl @ 7B - medium, low quality loss - legacy, prefer using Q5_K_M",
|
34 |
+
},
|
35 |
+
#ifdef GGML_USE_K_QUANTS
|
36 |
+
{
|
37 |
+
"Q2_K",
|
38 |
+
LLAMA_FTYPE_MOSTLY_Q2_K,
|
39 |
+
" 2.67G, +0.8698 ppl @ 7B - smallest, extreme quality loss - not recommended",
|
40 |
+
},
|
41 |
+
{
|
42 |
+
"Q3_K",
|
43 |
+
LLAMA_FTYPE_MOSTLY_Q3_K_M,
|
44 |
+
"alias for Q3_K_M"
|
45 |
+
},
|
46 |
+
{
|
47 |
+
"Q3_K_S",
|
48 |
+
LLAMA_FTYPE_MOSTLY_Q3_K_S,
|
49 |
+
" 2.75G, +0.5505 ppl @ 7B - very small, very high quality loss",
|
50 |
+
},
|
51 |
+
{
|
52 |
+
"Q3_K_M",
|
53 |
+
LLAMA_FTYPE_MOSTLY_Q3_K_M,
|
54 |
+
" 3.06G, +0.2437 ppl @ 7B - very small, very high quality loss",
|
55 |
+
},
|
56 |
+
{
|
57 |
+
"Q3_K_L",
|
58 |
+
LLAMA_FTYPE_MOSTLY_Q3_K_L,
|
59 |
+
" 3.35G, +0.1803 ppl @ 7B - small, substantial quality loss",
|
60 |
+
},
|
61 |
+
{
|
62 |
+
"Q4_K",
|
63 |
+
LLAMA_FTYPE_MOSTLY_Q4_K_M,
|
64 |
+
"alias for Q4_K_M",
|
65 |
+
},
|
66 |
+
{
|
67 |
+
"Q4_K_S",
|
68 |
+
LLAMA_FTYPE_MOSTLY_Q4_K_S,
|
69 |
+
" 3.56G, +0.1149 ppl @ 7B - small, significant quality loss",
|
70 |
+
},
|
71 |
+
{
|
72 |
+
"Q4_K_M",
|
73 |
+
LLAMA_FTYPE_MOSTLY_Q4_K_M,
|
74 |
+
" 3.80G, +0.0535 ppl @ 7B - medium, balanced quality - *recommended*",
|
75 |
+
},
|
76 |
+
{
|
77 |
+
"Q5_K",
|
78 |
+
LLAMA_FTYPE_MOSTLY_Q5_K_M,
|
79 |
+
"alias for Q5_K_M",
|
80 |
+
},
|
81 |
+
{
|
82 |
+
"Q5_K_S",
|
83 |
+
LLAMA_FTYPE_MOSTLY_Q5_K_S,
|
84 |
+
" 4.33G, +0.0353 ppl @ 7B - large, low quality loss - *recommended*",
|
85 |
+
},
|
86 |
+
{
|
87 |
+
"Q5_K_M",
|
88 |
+
LLAMA_FTYPE_MOSTLY_Q5_K_M,
|
89 |
+
" 4.45G, +0.0142 ppl @ 7B - large, very low quality loss - *recommended*",
|
90 |
+
},
|
91 |
+
{
|
92 |
+
"Q6_K",
|
93 |
+
LLAMA_FTYPE_MOSTLY_Q6_K,
|
94 |
+
" 5.15G, +0.0044 ppl @ 7B - very large, extremely low quality loss",
|
95 |
+
},
|
96 |
+
#endif
|
97 |
+
{
|
98 |
+
"Q8_0",
|
99 |
+
LLAMA_FTYPE_MOSTLY_Q8_0,
|
100 |
+
" 6.70G, +0.0004 ppl @ 7B - very large, extremely low quality loss - not recommended",
|
101 |
+
},
|
102 |
+
{
|
103 |
+
"F16",
|
104 |
+
LLAMA_FTYPE_MOSTLY_F16,
|
105 |
+
"13.00G @ 7B - extremely large, virtually no quality loss - not recommended",
|
106 |
+
},
|
107 |
+
{
|
108 |
+
"F32",
|
109 |
+
LLAMA_FTYPE_ALL_F32,
|
110 |
+
"26.00G @ 7B - absolutely huge, lossless - not recommended",
|
111 |
+
},
|
112 |
+
};
|
113 |
+
|
114 |
+
|
115 |
+
bool try_parse_ftype(const std::string & ftype_str_in, llama_ftype & ftype, std::string & ftype_str_out) {
|
116 |
+
std::string ftype_str;
|
117 |
+
|
118 |
+
for (auto ch : ftype_str_in) {
|
119 |
+
ftype_str.push_back(std::toupper(ch));
|
120 |
+
}
|
121 |
+
for (auto & it : QUANT_OPTIONS) {
|
122 |
+
if (it.name == ftype_str) {
|
123 |
+
ftype = it.ftype;
|
124 |
+
ftype_str_out = it.name;
|
125 |
+
return true;
|
126 |
+
}
|
127 |
+
}
|
128 |
+
try {
|
129 |
+
int ftype_int = std::stoi(ftype_str);
|
130 |
+
for (auto & it : QUANT_OPTIONS) {
|
131 |
+
if (it.ftype == ftype_int) {
|
132 |
+
ftype = it.ftype;
|
133 |
+
ftype_str_out = it.name;
|
134 |
+
return true;
|
135 |
+
}
|
136 |
+
}
|
137 |
+
}
|
138 |
+
catch (...) {
|
139 |
+
// stoi failed
|
140 |
+
}
|
141 |
+
return false;
|
142 |
+
}
|
143 |
+
|
144 |
+
// usage:
|
145 |
+
// ./quantize [--allow-requantize] [--leave-output-tensor] models/llama/ggml-model.bin [models/llama/ggml-model-quant.bin] type [nthreads]
|
146 |
+
//
|
147 |
+
void usage(const char * executable) {
|
148 |
+
fprintf(stderr, "usage: %s [--help] [--allow-requantize] [--leave-output-tensor] model-f32.bin [model-quant.bin] type [nthreads]\n\n", executable);
|
149 |
+
fprintf(stderr, " --allow-requantize: Allows requantizing tensors that have already been quantized. Warning: This can severely reduce quality compared to quantizing from 16bit or 32bit\n");
|
150 |
+
fprintf(stderr, " --leave-output-tensor: Will leave output.weight un(re)quantized. Increases model size but may also increase quality, especially when requantizing\n");
|
151 |
+
fprintf(stderr, "\nAllowed quantization types:\n");
|
152 |
+
for (auto & it : QUANT_OPTIONS) {
|
153 |
+
printf(" %2d or %-6s : %s\n", it.ftype, it.name.c_str(), it.desc.c_str());
|
154 |
+
}
|
155 |
+
exit(1);
|
156 |
+
}
|
157 |
+
|
158 |
+
int main(int argc, char ** argv) {
|
159 |
+
if (argc < 3) {
|
160 |
+
usage(argv[0]);
|
161 |
+
}
|
162 |
+
|
163 |
+
llama_model_quantize_params params = llama_model_quantize_default_params();
|
164 |
+
|
165 |
+
int arg_idx = 1;
|
166 |
+
|
167 |
+
for (; arg_idx < argc && strncmp(argv[arg_idx], "--", 2) == 0; arg_idx++) {
|
168 |
+
if (strcmp(argv[arg_idx], "--leave-output-tensor") == 0) {
|
169 |
+
params.quantize_output_tensor = false;
|
170 |
+
} else if (strcmp(argv[arg_idx], "--allow-requantize") == 0) {
|
171 |
+
params.allow_requantize = true;
|
172 |
+
} else {
|
173 |
+
usage(argv[0]);
|
174 |
+
}
|
175 |
+
}
|
176 |
+
|
177 |
+
if (argc - arg_idx < 3) {
|
178 |
+
usage(argv[0]);
|
179 |
+
}
|
180 |
+
|
181 |
+
llama_init_backend();
|
182 |
+
|
183 |
+
// parse command line arguments
|
184 |
+
const std::string fname_inp = argv[arg_idx];
|
185 |
+
arg_idx++;
|
186 |
+
std::string fname_out;
|
187 |
+
|
188 |
+
std::string ftype_str;
|
189 |
+
if (try_parse_ftype(argv[arg_idx], params.ftype, ftype_str)) {
|
190 |
+
std::string fpath;
|
191 |
+
const size_t pos = fname_inp.find_last_of('/');
|
192 |
+
if (pos != std::string::npos) {
|
193 |
+
fpath = fname_inp.substr(0, pos + 1);
|
194 |
+
}
|
195 |
+
// export as [inp path]/ggml-model-[ftype].bin
|
196 |
+
fname_out = fpath + "ggml-model-" + ftype_str + ".bin";
|
197 |
+
arg_idx++;
|
198 |
+
}
|
199 |
+
else {
|
200 |
+
fname_out = argv[arg_idx];
|
201 |
+
arg_idx++;
|
202 |
+
|
203 |
+
if (argc <= arg_idx) {
|
204 |
+
fprintf(stderr, "%s: missing ftype\n", __func__);
|
205 |
+
return 1;
|
206 |
+
}
|
207 |
+
if (!try_parse_ftype(argv[arg_idx], params.ftype, ftype_str)) {
|
208 |
+
fprintf(stderr, "%s: invalid ftype '%s'\n", __func__, argv[3]);
|
209 |
+
return 1;
|
210 |
+
}
|
211 |
+
arg_idx++;
|
212 |
+
}
|
213 |
+
|
214 |
+
// parse nthreads
|
215 |
+
if (argc > arg_idx) {
|
216 |
+
try {
|
217 |
+
params.nthread = std::stoi(argv[arg_idx]);
|
218 |
+
}
|
219 |
+
catch (const std::exception & e) {
|
220 |
+
fprintf(stderr, "%s: invalid nthread '%s' (%s)\n", __func__, argv[arg_idx], e.what());
|
221 |
+
return 1;
|
222 |
+
}
|
223 |
+
}
|
224 |
+
|
225 |
+
fprintf(stderr, "%s: quantizing '%s' to '%s' as %s", __func__, fname_inp.c_str(), fname_out.c_str(), ftype_str.c_str());
|
226 |
+
if (params.nthread > 0) {
|
227 |
+
fprintf(stderr, " using %d threads", params.nthread);
|
228 |
+
}
|
229 |
+
fprintf(stderr, "\n");
|
230 |
+
|
231 |
+
const int64_t t_main_start_us = llama_time_us();
|
232 |
+
|
233 |
+
int64_t t_quantize_us = 0;
|
234 |
+
|
235 |
+
// load the model
|
236 |
+
{
|
237 |
+
const int64_t t_start_us = llama_time_us();
|
238 |
+
|
239 |
+
if (llama_model_quantize(fname_inp.c_str(), fname_out.c_str(), ¶ms)) {
|
240 |
+
fprintf(stderr, "%s: failed to quantize model from '%s'\n", __func__, fname_inp.c_str());
|
241 |
+
return 1;
|
242 |
+
}
|
243 |
+
|
244 |
+
t_quantize_us = llama_time_us() - t_start_us;
|
245 |
+
}
|
246 |
+
|
247 |
+
// report timing
|
248 |
+
{
|
249 |
+
const int64_t t_main_end_us = llama_time_us();
|
250 |
+
|
251 |
+
printf("\n");
|
252 |
+
printf("%s: quantize time = %8.2f ms\n", __func__, t_quantize_us/1000.0);
|
253 |
+
printf("%s: total time = %8.2f ms\n", __func__, (t_main_end_us - t_main_start_us)/1000.0);
|
254 |
+
}
|
255 |
+
|
256 |
+
return 0;
|
257 |
+
}
|
examples/reason-act.sh
ADDED
@@ -0,0 +1,17 @@
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
1 |
+
|
2 |
+
#!/bin/bash
|
3 |
+
|
4 |
+
cd `dirname $0`
|
5 |
+
cd ..
|
6 |
+
|
7 |
+
# get -m model parameter otherwise defer to default
|
8 |
+
if [ "$1" == "-m" ]; then
|
9 |
+
MODEL="-m $2 "
|
10 |
+
fi
|
11 |
+
|
12 |
+
./main $MODEL --color \
|
13 |
+
-f ./prompts/reason-act.txt \
|
14 |
+
-i --interactive-first \
|
15 |
+
--top_k 10000 --temp 0.2 --repeat_penalty 1 -t 7 -c 2048 \
|
16 |
+
-r "Question:" -r "Observation:" --in-prefix " " \
|
17 |
+
-n -1
|
examples/save-load-state/CMakeLists.txt
ADDED
@@ -0,0 +1,7 @@
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
1 |
+
set(TARGET save-load-state)
|
2 |
+
add_executable(${TARGET} save-load-state.cpp)
|
3 |
+
target_link_libraries(${TARGET} PRIVATE common llama ${CMAKE_THREAD_LIBS_INIT})
|
4 |
+
target_compile_features(${TARGET} PRIVATE cxx_std_11)
|
5 |
+
if(TARGET BUILD_INFO)
|
6 |
+
add_dependencies(${TARGET} BUILD_INFO)
|
7 |
+
endif()
|
examples/save-load-state/save-load-state.cpp
ADDED
@@ -0,0 +1,170 @@
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
1 |
+
#include "common.h"
|
2 |
+
#include "llama.h"
|
3 |
+
#include "build-info.h"
|
4 |
+
|
5 |
+
#include <vector>
|
6 |
+
#include <cstdio>
|
7 |
+
#include <chrono>
|
8 |
+
|
9 |
+
int main(int argc, char ** argv) {
|
10 |
+
gpt_params params;
|
11 |
+
params.seed = 42;
|
12 |
+
params.n_threads = 4;
|
13 |
+
params.repeat_last_n = 64;
|
14 |
+
params.prompt = "The quick brown fox";
|
15 |
+
|
16 |
+
if (gpt_params_parse(argc, argv, params) == false) {
|
17 |
+
return 1;
|
18 |
+
}
|
19 |
+
|
20 |
+
fprintf(stderr, "%s: build = %d (%s)\n", __func__, BUILD_NUMBER, BUILD_COMMIT);
|
21 |
+
|
22 |
+
if (params.n_predict < 0) {
|
23 |
+
params.n_predict = 16;
|
24 |
+
}
|
25 |
+
|
26 |
+
auto lparams = llama_context_default_params();
|
27 |
+
|
28 |
+
lparams.n_ctx = params.n_ctx;
|
29 |
+
lparams.seed = params.seed;
|
30 |
+
lparams.f16_kv = params.memory_f16;
|
31 |
+
lparams.use_mmap = params.use_mmap;
|
32 |
+
lparams.use_mlock = params.use_mlock;
|
33 |
+
|
34 |
+
auto n_past = 0;
|
35 |
+
auto last_n_tokens_data = std::vector<llama_token>(params.repeat_last_n, 0);
|
36 |
+
|
37 |
+
// init
|
38 |
+
auto model = llama_load_model_from_file(params.model.c_str(), lparams);
|
39 |
+
if (model == nullptr) {
|
40 |
+
return 1;
|
41 |
+
}
|
42 |
+
auto ctx = llama_new_context_with_model(model, lparams);
|
43 |
+
if (ctx == nullptr) {
|
44 |
+
llama_free_model(model);
|
45 |
+
return 1;
|
46 |
+
}
|
47 |
+
auto tokens = std::vector<llama_token>(params.n_ctx);
|
48 |
+
auto n_prompt_tokens = llama_tokenize(ctx, params.prompt.c_str(), tokens.data(), int(tokens.size()), true);
|
49 |
+
|
50 |
+
if (n_prompt_tokens < 1) {
|
51 |
+
fprintf(stderr, "%s : failed to tokenize prompt\n", __func__);
|
52 |
+
llama_free(ctx);
|
53 |
+
llama_free_model(model);
|
54 |
+
return 1;
|
55 |
+
}
|
56 |
+
|
57 |
+
// evaluate prompt
|
58 |
+
llama_eval(ctx, tokens.data(), n_prompt_tokens, n_past, params.n_threads);
|
59 |
+
|
60 |
+
last_n_tokens_data.insert(last_n_tokens_data.end(), tokens.data(), tokens.data() + n_prompt_tokens);
|
61 |
+
n_past += n_prompt_tokens;
|
62 |
+
|
63 |
+
const size_t state_size = llama_get_state_size(ctx);
|
64 |
+
uint8_t * state_mem = new uint8_t[state_size];
|
65 |
+
|
66 |
+
// Save state (rng, logits, embedding and kv_cache) to file
|
67 |
+
{
|
68 |
+
FILE *fp_write = fopen("dump_state.bin", "wb");
|
69 |
+
llama_copy_state_data(ctx, state_mem); // could also copy directly to memory mapped file
|
70 |
+
fwrite(state_mem, 1, state_size, fp_write);
|
71 |
+
fclose(fp_write);
|
72 |
+
}
|
73 |
+
|
74 |
+
// save state (last tokens)
|
75 |
+
const auto last_n_tokens_data_saved = std::vector<llama_token>(last_n_tokens_data);
|
76 |
+
const auto n_past_saved = n_past;
|
77 |
+
|
78 |
+
// first run
|
79 |
+
printf("\n%s", params.prompt.c_str());
|
80 |
+
|
81 |
+
for (auto i = 0; i < params.n_predict; i++) {
|
82 |
+
auto logits = llama_get_logits(ctx);
|
83 |
+
auto n_vocab = llama_n_vocab(ctx);
|
84 |
+
std::vector<llama_token_data> candidates;
|
85 |
+
candidates.reserve(n_vocab);
|
86 |
+
for (llama_token token_id = 0; token_id < n_vocab; token_id++) {
|
87 |
+
candidates.emplace_back(llama_token_data{token_id, logits[token_id], 0.0f});
|
88 |
+
}
|
89 |
+
llama_token_data_array candidates_p = { candidates.data(), candidates.size(), false };
|
90 |
+
auto next_token = llama_sample_token(ctx, &candidates_p);
|
91 |
+
auto next_token_str = llama_token_to_str(ctx, next_token);
|
92 |
+
last_n_tokens_data.push_back(next_token);
|
93 |
+
|
94 |
+
printf("%s", next_token_str);
|
95 |
+
if (llama_eval(ctx, &next_token, 1, n_past, params.n_threads)) {
|
96 |
+
fprintf(stderr, "\n%s : failed to evaluate\n", __func__);
|
97 |
+
llama_free(ctx);
|
98 |
+
llama_free_model(model);
|
99 |
+
return 1;
|
100 |
+
}
|
101 |
+
n_past += 1;
|
102 |
+
}
|
103 |
+
|
104 |
+
printf("\n\n");
|
105 |
+
|
106 |
+
// free old context
|
107 |
+
llama_free(ctx);
|
108 |
+
|
109 |
+
// make new context
|
110 |
+
auto ctx2 = llama_new_context_with_model(model, lparams);
|
111 |
+
|
112 |
+
// Load state (rng, logits, embedding and kv_cache) from file
|
113 |
+
{
|
114 |
+
FILE *fp_read = fopen("dump_state.bin", "rb");
|
115 |
+
if (state_size != llama_get_state_size(ctx2)) {
|
116 |
+
fprintf(stderr, "\n%s : failed to validate state size\n", __func__);
|
117 |
+
llama_free(ctx2);
|
118 |
+
llama_free_model(model);
|
119 |
+
return 1;
|
120 |
+
}
|
121 |
+
|
122 |
+
const size_t ret = fread(state_mem, 1, state_size, fp_read);
|
123 |
+
if (ret != state_size) {
|
124 |
+
fprintf(stderr, "\n%s : failed to read state\n", __func__);
|
125 |
+
llama_free(ctx2);
|
126 |
+
llama_free_model(model);
|
127 |
+
return 1;
|
128 |
+
}
|
129 |
+
|
130 |
+
llama_set_state_data(ctx2, state_mem); // could also read directly from memory mapped file
|
131 |
+
fclose(fp_read);
|
132 |
+
}
|
133 |
+
|
134 |
+
delete[] state_mem;
|
135 |
+
|
136 |
+
// restore state (last tokens)
|
137 |
+
last_n_tokens_data = last_n_tokens_data_saved;
|
138 |
+
n_past = n_past_saved;
|
139 |
+
|
140 |
+
// second run
|
141 |
+
for (auto i = 0; i < params.n_predict; i++) {
|
142 |
+
auto logits = llama_get_logits(ctx2);
|
143 |
+
auto n_vocab = llama_n_vocab(ctx2);
|
144 |
+
std::vector<llama_token_data> candidates;
|
145 |
+
candidates.reserve(n_vocab);
|
146 |
+
for (llama_token token_id = 0; token_id < n_vocab; token_id++) {
|
147 |
+
candidates.emplace_back(llama_token_data{token_id, logits[token_id], 0.0f});
|
148 |
+
}
|
149 |
+
llama_token_data_array candidates_p = { candidates.data(), candidates.size(), false };
|
150 |
+
auto next_token = llama_sample_token(ctx2, &candidates_p);
|
151 |
+
auto next_token_str = llama_token_to_str(ctx2, next_token);
|
152 |
+
last_n_tokens_data.push_back(next_token);
|
153 |
+
|
154 |
+
printf("%s", next_token_str);
|
155 |
+
if (llama_eval(ctx2, &next_token, 1, n_past, params.n_threads)) {
|
156 |
+
fprintf(stderr, "\n%s : failed to evaluate\n", __func__);
|
157 |
+
llama_free(ctx2);
|
158 |
+
llama_free_model(model);
|
159 |
+
return 1;
|
160 |
+
}
|
161 |
+
n_past += 1;
|
162 |
+
}
|
163 |
+
|
164 |
+
printf("\n\n");
|
165 |
+
|
166 |
+
llama_free(ctx2);
|
167 |
+
llama_free_model(model);
|
168 |
+
|
169 |
+
return 0;
|
170 |
+
}
|
examples/server/CMakeLists.txt
ADDED
@@ -0,0 +1,12 @@
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
1 |
+
set(TARGET server)
|
2 |
+
option(LLAMA_SERVER_VERBOSE "Build verbose logging option for Server" ON)
|
3 |
+
include_directories(${CMAKE_CURRENT_SOURCE_DIR})
|
4 |
+
add_executable(${TARGET} server.cpp json.hpp httplib.h)
|
5 |
+
target_compile_definitions(${TARGET} PRIVATE
|
6 |
+
SERVER_VERBOSE=$<BOOL:${LLAMA_SERVER_VERBOSE}>
|
7 |
+
)
|
8 |
+
target_link_libraries(${TARGET} PRIVATE common llama ${CMAKE_THREAD_LIBS_INIT})
|
9 |
+
target_compile_features(${TARGET} PRIVATE cxx_std_11)
|
10 |
+
if(TARGET BUILD_INFO)
|
11 |
+
add_dependencies(${TARGET} BUILD_INFO)
|
12 |
+
endif()
|
examples/server/README.md
ADDED
@@ -0,0 +1,192 @@
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
1 |
+
# llama.cpp/example/server
|
2 |
+
|
3 |
+
This example demonstrates a simple HTTP API server to interact with llama.cpp.
|
4 |
+
|
5 |
+
Command line options:
|
6 |
+
|
7 |
+
- `--threads N`, `-t N`: Set the number of threads to use during computation.
|
8 |
+
- `-m FNAME`, `--model FNAME`: Specify the path to the LLaMA model file (e.g., `models/7B/ggml-model.bin`).
|
9 |
+
- `-m ALIAS`, `--alias ALIAS`: Set an alias for the model. The alias will be returned in API responses.
|
10 |
+
- `-c N`, `--ctx-size N`: Set the size of the prompt context. The default is 512, but LLaMA models were built with a context of 2048, which will provide better results for longer input/inference.
|
11 |
+
- `-ngl N`, `--n-gpu-layers N`: When compiled with appropriate support (currently CLBlast or cuBLAS), this option allows offloading some layers to the GPU for computation. Generally results in increased performance.
|
12 |
+
- `-mg i, --main-gpu i`: When using multiple GPUs this option controls which GPU is used for small tensors for which the overhead of splitting the computation across all GPUs is not worthwhile. The GPU in question will use slightly more VRAM to store a scratch buffer for temporary results. By default GPU 0 is used. Requires cuBLAS.
|
13 |
+
- `-ts SPLIT, --tensor-split SPLIT`: When using multiple GPUs this option controls how large tensors should be split across all GPUs. `SPLIT` is a comma-separated list of non-negative values that assigns the proportion of data that each GPU should get in order. For example, "3,2" will assign 60% of the data to GPU 0 and 40% to GPU 1. By default the data is split in proportion to VRAM but this may not be optimal for performance. Requires cuBLAS.
|
14 |
+
- `-lv, --low-vram`: Do not allocate a VRAM scratch buffer for holding temporary results. Reduces VRAM usage at the cost of performance, particularly prompt processing speed. Requires cuBLAS.
|
15 |
+
- `-b N`, `--batch-size N`: Set the batch size for prompt processing. Default: `512`.
|
16 |
+
- `--memory-f32`: Use 32-bit floats instead of 16-bit floats for memory key+value. Not recommended.
|
17 |
+
- `--mlock`: Lock the model in memory, preventing it from being swapped out when memory-mapped.
|
18 |
+
- `--no-mmap`: Do not memory-map the model. By default, models are mapped into memory, which allows the system to load only the necessary parts of the model as needed.
|
19 |
+
- `--lora FNAME`: Apply a LoRA (Low-Rank Adaptation) adapter to the model (implies --no-mmap). This allows you to adapt the pretrained model to specific tasks or domains.
|
20 |
+
- `--lora-base FNAME`: Optional model to use as a base for the layers modified by the LoRA adapter. This flag is used in conjunction with the `--lora` flag, and specifies the base model for the adaptation.
|
21 |
+
- `-to N`, `--timeout N`: Server read/write timeout in seconds. Default `600`.
|
22 |
+
- `--host`: Set the hostname or ip address to listen. Default `127.0.0.1`.
|
23 |
+
- `--port`: Set the port to listen. Default: `8080`.
|
24 |
+
- `--embedding`: Enable embedding extraction, Default: disabled.
|
25 |
+
|
26 |
+
## Build
|
27 |
+
|
28 |
+
Build llama.cpp with server from repository root with either make or CMake.
|
29 |
+
|
30 |
+
- Using `make`:
|
31 |
+
|
32 |
+
```bash
|
33 |
+
LLAMA_BUILD_SERVER=1 make
|
34 |
+
```
|
35 |
+
|
36 |
+
- Using `CMake`:
|
37 |
+
|
38 |
+
```bash
|
39 |
+
mkdir build-server
|
40 |
+
cd build-server
|
41 |
+
cmake -DLLAMA_BUILD_SERVER=ON ..
|
42 |
+
cmake --build . --config Release
|
43 |
+
```
|
44 |
+
|
45 |
+
## Quick Start
|
46 |
+
|
47 |
+
To get started right away, run the following command, making sure to use the correct path for the model you have:
|
48 |
+
|
49 |
+
### Unix-based systems (Linux, macOS, etc.):
|
50 |
+
|
51 |
+
```bash
|
52 |
+
./server -m models/7B/ggml-model.bin -c 2048
|
53 |
+
```
|
54 |
+
|
55 |
+
### Windows:
|
56 |
+
|
57 |
+
```powershell
|
58 |
+
server.exe -m models\7B\ggml-model.bin -c 2048
|
59 |
+
```
|
60 |
+
|
61 |
+
The above command will start a server that by default listens on `127.0.0.1:8080`.
|
62 |
+
You can consume the endpoints with Postman or NodeJS with axios library.
|
63 |
+
|
64 |
+
## Testing with CURL
|
65 |
+
|
66 |
+
Using [curl](https://curl.se/). On Windows `curl.exe` should be available in the base OS.
|
67 |
+
|
68 |
+
```sh
|
69 |
+
curl --request POST \
|
70 |
+
--url http://localhost:8080/completion \
|
71 |
+
--data '{"prompt": "Building a website can be done in 10 simple steps:","n_predict": 128}'
|
72 |
+
```
|
73 |
+
|
74 |
+
## Node JS Test
|
75 |
+
|
76 |
+
You need to have [Node.js](https://nodejs.org/en) installed.
|
77 |
+
|
78 |
+
```bash
|
79 |
+
mkdir llama-client
|
80 |
+
cd llama-client
|
81 |
+
npm init
|
82 |
+
npm install axios
|
83 |
+
```
|
84 |
+
|
85 |
+
Create a index.js file and put inside this:
|
86 |
+
|
87 |
+
```javascript
|
88 |
+
const axios = require("axios");
|
89 |
+
|
90 |
+
const prompt = `Building a website can be done in 10 simple steps:`;
|
91 |
+
|
92 |
+
async function Test() {
|
93 |
+
let result = await axios.post("http://127.0.0.1:8080/completion", {
|
94 |
+
prompt,
|
95 |
+
n_predict: 512,
|
96 |
+
});
|
97 |
+
|
98 |
+
// the response is received until completion finish
|
99 |
+
console.log(result.data.content);
|
100 |
+
}
|
101 |
+
|
102 |
+
Test();
|
103 |
+
```
|
104 |
+
|
105 |
+
And run it:
|
106 |
+
|
107 |
+
```bash
|
108 |
+
node .
|
109 |
+
```
|
110 |
+
|
111 |
+
## API Endpoints
|
112 |
+
|
113 |
+
- **POST** `/completion`: Given a prompt, it returns the predicted completion.
|
114 |
+
|
115 |
+
*Options:*
|
116 |
+
|
117 |
+
`temperature`: Adjust the randomness of the generated text (default: 0.8).
|
118 |
+
|
119 |
+
`top_k`: Limit the next token selection to the K most probable tokens (default: 40).
|
120 |
+
|
121 |
+
`top_p`: Limit the next token selection to a subset of tokens with a cumulative probability above a threshold P (default: 0.9).
|
122 |
+
|
123 |
+
`n_predict`: Set the number of tokens to predict when generating text. **Note:** May exceed the set limit slightly if the last token is a partial multibyte character. When 0, no tokens will be generated but the prompt is evaluated into the cache. (default: 128, -1 = infinity).
|
124 |
+
|
125 |
+
`n_keep`: Specify the number of tokens from the initial prompt to retain when the model resets its internal context.
|
126 |
+
By default, this value is set to 0 (meaning no tokens are kept). Use `-1` to retain all tokens from the initial prompt.
|
127 |
+
|
128 |
+
`stream`: It allows receiving each predicted token in real-time instead of waiting for the completion to finish. To enable this, set to `true`.
|
129 |
+
|
130 |
+
`prompt`: Provide a prompt. Internally, the prompt is compared, and it detects if a part has already been evaluated, and the remaining part will be evaluate. A space is inserted in the front like main.cpp does.
|
131 |
+
|
132 |
+
`stop`: Specify a JSON array of stopping strings.
|
133 |
+
These words will not be included in the completion, so make sure to add them to the prompt for the next iteration (default: []).
|
134 |
+
|
135 |
+
`tfs_z`: Enable tail free sampling with parameter z (default: 1.0, 1.0 = disabled).
|
136 |
+
|
137 |
+
`typical_p`: Enable locally typical sampling with parameter p (default: 1.0, 1.0 = disabled).
|
138 |
+
|
139 |
+
`repeat_penalty`: Control the repetition of token sequences in the generated text (default: 1.1).
|
140 |
+
|
141 |
+
`repeat_last_n`: Last n tokens to consider for penalizing repetition (default: 64, 0 = disabled, -1 = ctx-size).
|
142 |
+
|
143 |
+
`penalize_nl`: Penalize newline tokens when applying the repeat penalty (default: true).
|
144 |
+
|
145 |
+
`presence_penalty`: Repeat alpha presence penalty (default: 0.0, 0.0 = disabled).
|
146 |
+
|
147 |
+
`frequency_penalty`: Repeat alpha frequency penalty (default: 0.0, 0.0 = disabled);
|
148 |
+
|
149 |
+
`mirostat`: Enable Mirostat sampling, controlling perplexity during text generation (default: 0, 0 = disabled, 1 = Mirostat, 2 = Mirostat 2.0).
|
150 |
+
|
151 |
+
`mirostat_tau`: Set the Mirostat target entropy, parameter tau (default: 5.0).
|
152 |
+
|
153 |
+
`mirostat_eta`: Set the Mirostat learning rate, parameter eta (default: 0.1).
|
154 |
+
|
155 |
+
`seed`: Set the random number generator (RNG) seed (default: -1, < 0 = random seed).
|
156 |
+
|
157 |
+
`ignore_eos`: Ignore end of stream token and continue generating (default: false).
|
158 |
+
|
159 |
+
`logit_bias`: Modify the likelihood of a token appearing in the generated text completion. For example, use `"logit_bias": [[15043,1.0]]` to increase the likelihood of the token 'Hello', or `"logit_bias": [[15043,-1.0]]` to decrease its likelihood. Setting the value to false, `"logit_bias": [[15043,false]]` ensures that the token `Hello` is never produced (default: []).
|
160 |
+
|
161 |
+
- **POST** `/tokenize`: Tokenize a given text.
|
162 |
+
|
163 |
+
*Options:*
|
164 |
+
|
165 |
+
`content`: Set the text to tokenize.
|
166 |
+
|
167 |
+
Note that the special `BOS` token is not added in fron of the text and also a space character is not inserted automatically as it is for `/completion`.
|
168 |
+
|
169 |
+
- **POST** `/embedding`: Generate embedding of a given text just as [the embedding example](../embedding) does.
|
170 |
+
|
171 |
+
*Options:*
|
172 |
+
|
173 |
+
`content`: Set the text to process.
|
174 |
+
|
175 |
+
## More examples
|
176 |
+
|
177 |
+
### Interactive mode
|
178 |
+
|
179 |
+
Check the sample in [chat.mjs](chat.mjs).
|
180 |
+
Run with NodeJS version 16 or later:
|
181 |
+
|
182 |
+
```sh
|
183 |
+
node chat.mjs
|
184 |
+
```
|
185 |
+
|
186 |
+
Another sample in [chat.sh](chat.sh).
|
187 |
+
Requires [bash](https://www.gnu.org/software/bash/), [curl](https://curl.se) and [jq](https://jqlang.github.io/jq/).
|
188 |
+
Run with bash:
|
189 |
+
|
190 |
+
```sh
|
191 |
+
bash chat.sh
|
192 |
+
```
|
examples/server/chat.mjs
ADDED
@@ -0,0 +1,89 @@
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
1 |
+
import * as readline from 'node:readline'
|
2 |
+
import { stdin, stdout } from 'node:process'
|
3 |
+
|
4 |
+
const API_URL = 'http://127.0.0.1:8080'
|
5 |
+
|
6 |
+
const chat = [
|
7 |
+
{
|
8 |
+
human: "Hello, Assistant.",
|
9 |
+
assistant: "Hello. How may I help you today?"
|
10 |
+
},
|
11 |
+
{
|
12 |
+
human: "Please tell me the largest city in Europe.",
|
13 |
+
assistant: "Sure. The largest city in Europe is Moscow, the capital of Russia."
|
14 |
+
},
|
15 |
+
]
|
16 |
+
|
17 |
+
const instruction = `A chat between a curious human and an artificial intelligence assistant. The assistant gives helpful, detailed, and polite answers to the human's questions.`
|
18 |
+
|
19 |
+
function format_prompt(question) {
|
20 |
+
return `${instruction}\n${
|
21 |
+
chat.map(m =>`### Human: ${m.human}\n### Assistant: ${m.assistant}`).join("\n")
|
22 |
+
}\n### Human: ${question}\n### Assistant:`
|
23 |
+
}
|
24 |
+
|
25 |
+
async function tokenize(content) {
|
26 |
+
const result = await fetch(`${API_URL}/tokenize`, {
|
27 |
+
method: 'POST',
|
28 |
+
body: JSON.stringify({ content })
|
29 |
+
})
|
30 |
+
|
31 |
+
if (!result.ok) {
|
32 |
+
return []
|
33 |
+
}
|
34 |
+
|
35 |
+
return await result.json().tokens
|
36 |
+
}
|
37 |
+
|
38 |
+
const n_keep = await tokenize(instruction).length
|
39 |
+
|
40 |
+
async function chat_completion(question) {
|
41 |
+
const result = await fetch(`${API_URL}/completion`, {
|
42 |
+
method: 'POST',
|
43 |
+
body: JSON.stringify({
|
44 |
+
prompt: format_prompt(question),
|
45 |
+
temperature: 0.2,
|
46 |
+
top_k: 40,
|
47 |
+
top_p: 0.9,
|
48 |
+
n_keep: n_keep,
|
49 |
+
n_predict: 256,
|
50 |
+
stop: ["\n### Human:"], // stop completion after generating this
|
51 |
+
stream: true,
|
52 |
+
})
|
53 |
+
})
|
54 |
+
|
55 |
+
if (!result.ok) {
|
56 |
+
return
|
57 |
+
}
|
58 |
+
|
59 |
+
let answer = ''
|
60 |
+
|
61 |
+
for await (var chunk of result.body) {
|
62 |
+
const t = Buffer.from(chunk).toString('utf8')
|
63 |
+
if (t.startsWith('data: ')) {
|
64 |
+
const message = JSON.parse(t.substring(6))
|
65 |
+
answer += message.content
|
66 |
+
process.stdout.write(message.content)
|
67 |
+
if (message.stop) {
|
68 |
+
if (message.truncated) {
|
69 |
+
chat.shift()
|
70 |
+
}
|
71 |
+
break
|
72 |
+
}
|
73 |
+
}
|
74 |
+
}
|
75 |
+
|
76 |
+
process.stdout.write('\n')
|
77 |
+
chat.push({ human: question, assistant: answer.trimStart() })
|
78 |
+
}
|
79 |
+
|
80 |
+
const rl = readline.createInterface({ input: stdin, output: stdout });
|
81 |
+
|
82 |
+
const readlineQuestion = (rl, query, options) => new Promise((resolve, reject) => {
|
83 |
+
rl.question(query, options, resolve)
|
84 |
+
});
|
85 |
+
|
86 |
+
while(true) {
|
87 |
+
const question = await readlineQuestion(rl, '> ')
|
88 |
+
await chat_completion(question)
|
89 |
+
}
|
examples/server/chat.sh
ADDED
@@ -0,0 +1,77 @@
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
1 |
+
#!/bin/bash
|
2 |
+
|
3 |
+
API_URL="${API_URL:-http://127.0.0.1:8080}"
|
4 |
+
|
5 |
+
CHAT=(
|
6 |
+
"Hello, Assistant."
|
7 |
+
"Hello. How may I help you today?"
|
8 |
+
"Please tell me the largest city in Europe."
|
9 |
+
"Sure. The largest city in Europe is Moscow, the capital of Russia."
|
10 |
+
)
|
11 |
+
|
12 |
+
INSTRUCTION="A chat between a curious human and an artificial intelligence assistant. The assistant gives helpful, detailed, and polite answers to the human's questions."
|
13 |
+
|
14 |
+
trim() {
|
15 |
+
shopt -s extglob
|
16 |
+
set -- "${1##+([[:space:]])}"
|
17 |
+
printf "%s" "${1%%+([[:space:]])}"
|
18 |
+
}
|
19 |
+
|
20 |
+
trim_trailing() {
|
21 |
+
shopt -s extglob
|
22 |
+
printf "%s" "${1%%+([[:space:]])}"
|
23 |
+
}
|
24 |
+
|
25 |
+
format_prompt() {
|
26 |
+
echo -n "${INSTRUCTION}"
|
27 |
+
printf "\n### Human: %s\n### Assistant: %s" "${CHAT[@]}" "$1"
|
28 |
+
}
|
29 |
+
|
30 |
+
tokenize() {
|
31 |
+
curl \
|
32 |
+
--silent \
|
33 |
+
--request POST \
|
34 |
+
--url "${API_URL}/tokenize" \
|
35 |
+
--data-raw "$(jq -ns --arg content "$1" '{content:$content}')" \
|
36 |
+
| jq '.tokens[]'
|
37 |
+
}
|
38 |
+
|
39 |
+
N_KEEP=$(tokenize "${INSTRUCTION}" | wc -l)
|
40 |
+
|
41 |
+
chat_completion() {
|
42 |
+
PROMPT="$(trim_trailing "$(format_prompt "$1")")"
|
43 |
+
DATA="$(echo -n "$PROMPT" | jq -Rs --argjson n_keep $N_KEEP '{
|
44 |
+
prompt: .,
|
45 |
+
temperature: 0.2,
|
46 |
+
top_k: 40,
|
47 |
+
top_p: 0.9,
|
48 |
+
n_keep: $n_keep,
|
49 |
+
n_predict: 256,
|
50 |
+
stop: ["\n### Human:"],
|
51 |
+
stream: true
|
52 |
+
}')"
|
53 |
+
|
54 |
+
ANSWER=''
|
55 |
+
|
56 |
+
while IFS= read -r LINE; do
|
57 |
+
if [[ $LINE = data:* ]]; then
|
58 |
+
CONTENT="$(echo "${LINE:5}" | jq -r '.content')"
|
59 |
+
printf "%s" "${CONTENT}"
|
60 |
+
ANSWER+="${CONTENT}"
|
61 |
+
fi
|
62 |
+
done < <(curl \
|
63 |
+
--silent \
|
64 |
+
--no-buffer \
|
65 |
+
--request POST \
|
66 |
+
--url "${API_URL}/completion" \
|
67 |
+
--data-raw "${DATA}")
|
68 |
+
|
69 |
+
printf "\n"
|
70 |
+
|
71 |
+
CHAT+=("$1" "$(trim "$ANSWER")")
|
72 |
+
}
|
73 |
+
|
74 |
+
while true; do
|
75 |
+
read -r -e -p "> " QUESTION
|
76 |
+
chat_completion "${QUESTION}"
|
77 |
+
done
|
examples/server/httplib.h
ADDED
The diff for this file is too large to render.
See raw diff
|
|
examples/server/json.hpp
ADDED
The diff for this file is too large to render.
See raw diff
|
|
examples/server/server.cpp
ADDED
@@ -0,0 +1,975 @@
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
1 |
+
#include "common.h"
|
2 |
+
#include "llama.h"
|
3 |
+
#include "build-info.h"
|
4 |
+
|
5 |
+
// single thread
|
6 |
+
#define CPPHTTPLIB_THREAD_POOL_COUNT 1
|
7 |
+
#ifndef NDEBUG
|
8 |
+
// crash the server in debug mode, otherwise send an http 500 error
|
9 |
+
#define CPPHTTPLIB_NO_EXCEPTIONS 1
|
10 |
+
#endif
|
11 |
+
|
12 |
+
#include "httplib.h"
|
13 |
+
#include "json.hpp"
|
14 |
+
|
15 |
+
#ifndef SERVER_VERBOSE
|
16 |
+
#define SERVER_VERBOSE 1
|
17 |
+
#endif
|
18 |
+
|
19 |
+
using namespace httplib;
|
20 |
+
using json = nlohmann::json;
|
21 |
+
|
22 |
+
struct server_params {
|
23 |
+
std::string hostname = "127.0.0.1";
|
24 |
+
int32_t port = 8080;
|
25 |
+
int32_t read_timeout = 600;
|
26 |
+
int32_t write_timeout = 600;
|
27 |
+
};
|
28 |
+
|
29 |
+
static size_t common_part(const std::vector<llama_token> & a, const std::vector<llama_token> & b) {
|
30 |
+
size_t i;
|
31 |
+
for (i = 0; i < a.size() && i < b.size() && a[i] == b[i]; i++) {}
|
32 |
+
return i;
|
33 |
+
}
|
34 |
+
|
35 |
+
enum stop_type {
|
36 |
+
STOP_FULL,
|
37 |
+
STOP_PARTIAL,
|
38 |
+
};
|
39 |
+
|
40 |
+
static bool ends_with(const std::string & str, const std::string & suffix) {
|
41 |
+
return str.size() >= suffix.size() &&
|
42 |
+
0 == str.compare(str.size() - suffix.size(), suffix.size(), suffix);
|
43 |
+
}
|
44 |
+
|
45 |
+
static size_t find_partial_stop_string(const std::string & stop,
|
46 |
+
const std::string & text) {
|
47 |
+
if (!text.empty() && !stop.empty()) {
|
48 |
+
const char text_last_char = text.back();
|
49 |
+
for (int64_t char_index = stop.size() - 1; char_index >= 0; char_index--) {
|
50 |
+
if (stop[char_index] == text_last_char) {
|
51 |
+
const std::string current_partial = stop.substr(0, char_index + 1);
|
52 |
+
if (ends_with(text, current_partial)) {
|
53 |
+
return text.size() - char_index - 1;
|
54 |
+
}
|
55 |
+
}
|
56 |
+
}
|
57 |
+
}
|
58 |
+
return std::string::npos;
|
59 |
+
}
|
60 |
+
|
61 |
+
template<class Iter>
|
62 |
+
static std::string tokens_to_str(llama_context * ctx, Iter begin, Iter end) {
|
63 |
+
std::string ret;
|
64 |
+
for (; begin != end; ++begin) {
|
65 |
+
ret += llama_token_to_str(ctx, *begin);
|
66 |
+
}
|
67 |
+
return ret;
|
68 |
+
}
|
69 |
+
|
70 |
+
static void server_log(const char * level, const char * function, int line,
|
71 |
+
const char * message, const nlohmann::ordered_json & extra) {
|
72 |
+
nlohmann::ordered_json log {
|
73 |
+
{ "timestamp", time(nullptr) },
|
74 |
+
{ "level", level },
|
75 |
+
{ "function", function },
|
76 |
+
{ "line", line },
|
77 |
+
{ "message", message },
|
78 |
+
};
|
79 |
+
|
80 |
+
if (!extra.empty()) {
|
81 |
+
log.merge_patch(extra);
|
82 |
+
}
|
83 |
+
|
84 |
+
const std::string str = log.dump(-1, ' ', false, json::error_handler_t::replace);
|
85 |
+
fprintf(stdout, "%.*s\n", (int)str.size(), str.data());
|
86 |
+
fflush(stdout);
|
87 |
+
}
|
88 |
+
|
89 |
+
static bool server_verbose = false;
|
90 |
+
|
91 |
+
#if SERVER_VERBOSE != 1
|
92 |
+
# define LOG_VERBOSE(MSG, ...)
|
93 |
+
#else
|
94 |
+
# define LOG_VERBOSE(MSG, ...) \
|
95 |
+
do { \
|
96 |
+
if (server_verbose) { \
|
97 |
+
server_log("VERBOSE", __func__, __LINE__, MSG, __VA_ARGS__); \
|
98 |
+
} \
|
99 |
+
} while(0)
|
100 |
+
#endif
|
101 |
+
|
102 |
+
#define LOG_ERROR(MSG, ...) server_log("ERROR", __func__, __LINE__, MSG, __VA_ARGS__)
|
103 |
+
#define LOG_WARNING(MSG, ...) server_log("WARNING", __func__, __LINE__, MSG, __VA_ARGS__)
|
104 |
+
#define LOG_INFO(MSG, ...) server_log("INFO", __func__, __LINE__, MSG, __VA_ARGS__)
|
105 |
+
|
106 |
+
struct llama_server_context {
|
107 |
+
bool stream = false;
|
108 |
+
bool has_next_token = false;
|
109 |
+
std::string generated_text;
|
110 |
+
|
111 |
+
size_t num_tokens_predicted = 0;
|
112 |
+
size_t n_past = 0;
|
113 |
+
size_t n_remain = 0;
|
114 |
+
|
115 |
+
std::vector<llama_token> embd;
|
116 |
+
std::vector<llama_token> last_n_tokens;
|
117 |
+
|
118 |
+
llama_model * model = nullptr;
|
119 |
+
llama_context * ctx = nullptr;
|
120 |
+
gpt_params params;
|
121 |
+
|
122 |
+
bool truncated = false;
|
123 |
+
bool stopped_eos = false;
|
124 |
+
bool stopped_word = false;
|
125 |
+
bool stopped_limit = false;
|
126 |
+
std::string stopping_word;
|
127 |
+
int32_t multibyte_pending = 0;
|
128 |
+
|
129 |
+
~llama_server_context() {
|
130 |
+
if (ctx) {
|
131 |
+
llama_free(ctx);
|
132 |
+
ctx = nullptr;
|
133 |
+
}
|
134 |
+
if (model) {
|
135 |
+
llama_free_model(model);
|
136 |
+
model = nullptr;
|
137 |
+
}
|
138 |
+
}
|
139 |
+
|
140 |
+
void rewind() {
|
141 |
+
params.antiprompt.clear();
|
142 |
+
num_tokens_predicted = 0;
|
143 |
+
generated_text = "";
|
144 |
+
generated_text.reserve(params.n_ctx);
|
145 |
+
truncated = false;
|
146 |
+
stopped_eos = false;
|
147 |
+
stopped_word = false;
|
148 |
+
stopped_limit = false;
|
149 |
+
stopping_word = "";
|
150 |
+
multibyte_pending = 0;
|
151 |
+
|
152 |
+
n_remain = 0;
|
153 |
+
n_past = 0;
|
154 |
+
}
|
155 |
+
|
156 |
+
bool loadModel(const gpt_params & params_) {
|
157 |
+
params = params_;
|
158 |
+
std::tie(model, ctx) = llama_init_from_gpt_params(params);
|
159 |
+
if (model == nullptr) {
|
160 |
+
LOG_ERROR("unable to load model", { { "model", params_.model } });
|
161 |
+
return false;
|
162 |
+
}
|
163 |
+
|
164 |
+
last_n_tokens.resize(params.n_ctx);
|
165 |
+
std::fill(last_n_tokens.begin(), last_n_tokens.end(), 0);
|
166 |
+
return true;
|
167 |
+
}
|
168 |
+
|
169 |
+
void loadPrompt() {
|
170 |
+
params.prompt.insert(0, 1, ' '); // always add a first space
|
171 |
+
std::vector<llama_token> prompt_tokens = ::llama_tokenize(ctx, params.prompt, true);
|
172 |
+
|
173 |
+
if (params.n_keep < 0) {
|
174 |
+
params.n_keep = (int)prompt_tokens.size();
|
175 |
+
}
|
176 |
+
params.n_keep = std::min(params.n_ctx - 4, params.n_keep);
|
177 |
+
|
178 |
+
// if input prompt is too big, truncate like normal
|
179 |
+
if (prompt_tokens.size() >= (size_t)params.n_ctx) {
|
180 |
+
const int n_left = (params.n_ctx - params.n_keep) / 2;
|
181 |
+
std::vector<llama_token> new_tokens(prompt_tokens.begin(), prompt_tokens.begin() + params.n_keep);
|
182 |
+
const int erased_blocks = (prompt_tokens.size() - params.n_keep - n_left - 1) / n_left;
|
183 |
+
new_tokens.insert(new_tokens.end(), prompt_tokens.begin() + params.n_keep + erased_blocks * n_left, prompt_tokens.end());
|
184 |
+
std::copy(prompt_tokens.end() - params.n_ctx, prompt_tokens.end(), last_n_tokens.begin());
|
185 |
+
|
186 |
+
LOG_VERBOSE("input truncated", {
|
187 |
+
{ "n_ctx", params.n_ctx },
|
188 |
+
{ "n_keep", params.n_keep },
|
189 |
+
{ "n_left", n_left },
|
190 |
+
{ "new_tokens", tokens_to_str(ctx, new_tokens.cbegin(), new_tokens.cend()) },
|
191 |
+
});
|
192 |
+
|
193 |
+
truncated = true;
|
194 |
+
prompt_tokens = new_tokens;
|
195 |
+
} else {
|
196 |
+
const size_t ps = prompt_tokens.size();
|
197 |
+
std::fill(last_n_tokens.begin(), last_n_tokens.end() - ps, 0);
|
198 |
+
std::copy(prompt_tokens.begin(), prompt_tokens.end(), last_n_tokens.end() - ps);
|
199 |
+
}
|
200 |
+
|
201 |
+
// compare the evaluated prompt with the new prompt
|
202 |
+
n_past = common_part(embd, prompt_tokens);
|
203 |
+
embd = prompt_tokens;
|
204 |
+
if (n_past == prompt_tokens.size()) {
|
205 |
+
// we have to evaluate at least 1 token to generate logits.
|
206 |
+
n_past--;
|
207 |
+
}
|
208 |
+
|
209 |
+
LOG_VERBOSE("prompt ingested", {
|
210 |
+
{ "n_past", n_past },
|
211 |
+
{ "cached", tokens_to_str(ctx, embd.cbegin(), embd.cbegin() + n_past) },
|
212 |
+
{ "to_eval", tokens_to_str(ctx, embd.cbegin() + n_past, embd.cend()) },
|
213 |
+
});
|
214 |
+
|
215 |
+
has_next_token = true;
|
216 |
+
}
|
217 |
+
|
218 |
+
void beginCompletion() {
|
219 |
+
// number of tokens to keep when resetting context
|
220 |
+
n_remain = params.n_predict;
|
221 |
+
llama_set_rng_seed(ctx, params.seed);
|
222 |
+
}
|
223 |
+
|
224 |
+
llama_token nextToken() {
|
225 |
+
llama_token result = -1;
|
226 |
+
|
227 |
+
if (embd.size() >= (size_t)params.n_ctx) {
|
228 |
+
// Reset context
|
229 |
+
const int n_left = (params.n_ctx - params.n_keep) / 2;
|
230 |
+
|
231 |
+
std::vector<llama_token> new_tokens(embd.begin(), embd.begin() + params.n_keep);
|
232 |
+
new_tokens.insert(new_tokens.end(), embd.end() - n_left, embd.end());
|
233 |
+
embd = new_tokens;
|
234 |
+
n_past = params.n_keep;
|
235 |
+
truncated = true;
|
236 |
+
LOG_VERBOSE("input truncated", {
|
237 |
+
{ "n_ctx", params.n_ctx },
|
238 |
+
{ "n_keep", params.n_keep },
|
239 |
+
{ "n_left", n_left },
|
240 |
+
{ "new_tokens", tokens_to_str(ctx, new_tokens.cbegin(), new_tokens.cend()) },
|
241 |
+
});
|
242 |
+
}
|
243 |
+
|
244 |
+
while (n_past < embd.size()) {
|
245 |
+
int n_eval = (int)embd.size() - n_past;
|
246 |
+
if (n_eval > params.n_batch) {
|
247 |
+
n_eval = params.n_batch;
|
248 |
+
}
|
249 |
+
if (llama_eval(ctx, &embd[n_past], n_eval, n_past, params.n_threads)) {
|
250 |
+
LOG_ERROR("failed to eval", {
|
251 |
+
{ "n_eval", n_eval },
|
252 |
+
{ "n_past", n_past },
|
253 |
+
{ "n_threads", params.n_threads },
|
254 |
+
{ "embd", tokens_to_str(ctx, embd.cbegin() + n_past, embd.cend()) },
|
255 |
+
});
|
256 |
+
has_next_token = false;
|
257 |
+
return result;
|
258 |
+
}
|
259 |
+
n_past += n_eval;
|
260 |
+
}
|
261 |
+
|
262 |
+
if (params.n_predict == 0) {
|
263 |
+
has_next_token = false;
|
264 |
+
return llama_token_eos();
|
265 |
+
}
|
266 |
+
|
267 |
+
// out of user input, sample next token
|
268 |
+
const float temp = params.temp;
|
269 |
+
const int32_t top_k = params.top_k <= 0 ? llama_n_vocab(ctx) : params.top_k;
|
270 |
+
const float top_p = params.top_p;
|
271 |
+
const float tfs_z = params.tfs_z;
|
272 |
+
const float typical_p = params.typical_p;
|
273 |
+
const int32_t repeat_last_n = params.repeat_last_n < 0 ? params.n_ctx : params.repeat_last_n;
|
274 |
+
const float repeat_penalty = params.repeat_penalty;
|
275 |
+
const float alpha_presence = params.presence_penalty;
|
276 |
+
const float alpha_frequency = params.frequency_penalty;
|
277 |
+
const int mirostat = params.mirostat;
|
278 |
+
const float mirostat_tau = params.mirostat_tau;
|
279 |
+
const float mirostat_eta = params.mirostat_eta;
|
280 |
+
const bool penalize_nl = params.penalize_nl;
|
281 |
+
llama_token id = 0;
|
282 |
+
|
283 |
+
{
|
284 |
+
auto * logits = llama_get_logits(ctx);
|
285 |
+
auto n_vocab = llama_n_vocab(ctx);
|
286 |
+
|
287 |
+
// Apply params.logit_bias map
|
288 |
+
for (const auto & it : params.logit_bias) {
|
289 |
+
logits[it.first] += it.second;
|
290 |
+
}
|
291 |
+
|
292 |
+
std::vector<llama_token_data> candidates;
|
293 |
+
candidates.reserve(n_vocab);
|
294 |
+
for (llama_token token_id = 0; token_id < n_vocab; token_id++) {
|
295 |
+
candidates.emplace_back(llama_token_data{ token_id, logits[token_id], 0.0f });
|
296 |
+
}
|
297 |
+
|
298 |
+
llama_token_data_array candidates_p = { candidates.data(), candidates.size(), false };
|
299 |
+
|
300 |
+
// Apply penalties
|
301 |
+
float nl_logit = logits[llama_token_nl()];
|
302 |
+
auto last_n_repeat = std::min(std::min((int)last_n_tokens.size(), repeat_last_n), params.n_ctx);
|
303 |
+
llama_sample_repetition_penalty(ctx, &candidates_p,
|
304 |
+
last_n_tokens.data() + last_n_tokens.size() - last_n_repeat,
|
305 |
+
last_n_repeat, repeat_penalty);
|
306 |
+
llama_sample_frequency_and_presence_penalties(ctx, &candidates_p,
|
307 |
+
last_n_tokens.data() + last_n_tokens.size() - last_n_repeat,
|
308 |
+
last_n_repeat, alpha_frequency, alpha_presence);
|
309 |
+
if (!penalize_nl) {
|
310 |
+
logits[llama_token_nl()] = nl_logit;
|
311 |
+
}
|
312 |
+
|
313 |
+
if (temp <= 0) {
|
314 |
+
// Greedy sampling
|
315 |
+
id = llama_sample_token_greedy(ctx, &candidates_p);
|
316 |
+
} else {
|
317 |
+
if (mirostat == 1) {
|
318 |
+
static float mirostat_mu = 2.0f * mirostat_tau;
|
319 |
+
const int mirostat_m = 100;
|
320 |
+
llama_sample_temperature(ctx, &candidates_p, temp);
|
321 |
+
id = llama_sample_token_mirostat(ctx, &candidates_p, mirostat_tau, mirostat_eta, mirostat_m, &mirostat_mu);
|
322 |
+
} else if (mirostat == 2) {
|
323 |
+
static float mirostat_mu = 2.0f * mirostat_tau;
|
324 |
+
llama_sample_temperature(ctx, &candidates_p, temp);
|
325 |
+
id = llama_sample_token_mirostat_v2(ctx, &candidates_p, mirostat_tau, mirostat_eta, &mirostat_mu);
|
326 |
+
} else {
|
327 |
+
// Temperature sampling
|
328 |
+
llama_sample_tail_free(ctx, &candidates_p, tfs_z, 1);
|
329 |
+
llama_sample_typical(ctx, &candidates_p, typical_p, 1);
|
330 |
+
llama_sample_top_p(ctx, &candidates_p, top_p, 1);
|
331 |
+
llama_sample_top_k(ctx, &candidates_p, top_k, 1);
|
332 |
+
llama_sample_temperature(ctx, &candidates_p, temp);
|
333 |
+
id = llama_sample_token(ctx, &candidates_p);
|
334 |
+
}
|
335 |
+
}
|
336 |
+
last_n_tokens.erase(last_n_tokens.begin());
|
337 |
+
last_n_tokens.push_back(id);
|
338 |
+
num_tokens_predicted++;
|
339 |
+
}
|
340 |
+
|
341 |
+
// add it to the context
|
342 |
+
embd.push_back(id);
|
343 |
+
result = id;
|
344 |
+
// decrement remaining sampling budget
|
345 |
+
--n_remain;
|
346 |
+
|
347 |
+
if (!embd.empty() && embd.back() == llama_token_eos()) {
|
348 |
+
//stopping_word = llama_token_to_str(ctx, embd.back());
|
349 |
+
has_next_token = false;
|
350 |
+
stopped_eos = true;
|
351 |
+
LOG_VERBOSE("eos token found", {});
|
352 |
+
return result;
|
353 |
+
}
|
354 |
+
|
355 |
+
has_next_token = params.n_predict == -1 || n_remain != 0;
|
356 |
+
return result;
|
357 |
+
}
|
358 |
+
|
359 |
+
size_t findStoppingStrings(const std::string & text, const size_t last_token_size,
|
360 |
+
const stop_type type) {
|
361 |
+
size_t stop_pos = std::string::npos;
|
362 |
+
for (const std::string & word : params.antiprompt) {
|
363 |
+
size_t pos;
|
364 |
+
if (type == STOP_FULL) {
|
365 |
+
const size_t tmp = word.size() + last_token_size;
|
366 |
+
const size_t from_pos = text.size() > tmp ? text.size() - tmp : 0;
|
367 |
+
pos = text.find(word, from_pos);
|
368 |
+
}
|
369 |
+
else {
|
370 |
+
pos = find_partial_stop_string(word, text);
|
371 |
+
}
|
372 |
+
if (pos != std::string::npos &&
|
373 |
+
(stop_pos == std::string::npos || pos < stop_pos)) {
|
374 |
+
if (type == STOP_FULL) {
|
375 |
+
stopping_word = word;
|
376 |
+
stopped_word = true;
|
377 |
+
has_next_token = false;
|
378 |
+
}
|
379 |
+
stop_pos = pos;
|
380 |
+
}
|
381 |
+
}
|
382 |
+
return stop_pos;
|
383 |
+
}
|
384 |
+
|
385 |
+
std::string doCompletion() {
|
386 |
+
const llama_token token = nextToken();
|
387 |
+
|
388 |
+
const std::string token_text = token == -1 ? "" : llama_token_to_str(ctx, token);
|
389 |
+
generated_text += token_text;
|
390 |
+
|
391 |
+
if (multibyte_pending > 0) {
|
392 |
+
multibyte_pending -= token_text.size();
|
393 |
+
} else if (token_text.size() == 1) {
|
394 |
+
const char c = token_text[0];
|
395 |
+
// 2-byte characters: 110xxxxx 10xxxxxx
|
396 |
+
if ((c & 0xE0) == 0xC0) {
|
397 |
+
multibyte_pending = 1;
|
398 |
+
// 3-byte characters: 1110xxxx 10xxxxxx 10xxxxxx
|
399 |
+
} else if ((c & 0xF0) == 0xE0) {
|
400 |
+
multibyte_pending = 2;
|
401 |
+
// 4-byte characters: 11110xxx 10xxxxxx 10xxxxxx 10xxxxxx
|
402 |
+
} else if ((c & 0xF8) == 0xF0) {
|
403 |
+
multibyte_pending = 3;
|
404 |
+
} else {
|
405 |
+
multibyte_pending = 0;
|
406 |
+
}
|
407 |
+
}
|
408 |
+
|
409 |
+
if (multibyte_pending > 0 && !has_next_token) {
|
410 |
+
has_next_token = true;
|
411 |
+
n_remain++;
|
412 |
+
}
|
413 |
+
|
414 |
+
if (!has_next_token && n_remain == 0) {
|
415 |
+
stopped_limit = true;
|
416 |
+
}
|
417 |
+
|
418 |
+
LOG_VERBOSE("next token", {
|
419 |
+
{ "token", token },
|
420 |
+
{ "token_text", llama_token_to_str(ctx, token) },
|
421 |
+
{ "has_next_token", has_next_token },
|
422 |
+
{ "n_remain", n_remain },
|
423 |
+
{ "num_tokens_predicted", num_tokens_predicted },
|
424 |
+
{ "stopped_eos", stopped_eos },
|
425 |
+
{ "stopped_word", stopped_word },
|
426 |
+
{ "stopped_limit", stopped_limit },
|
427 |
+
{ "stopping_word", stopping_word },
|
428 |
+
});
|
429 |
+
|
430 |
+
return token_text;
|
431 |
+
}
|
432 |
+
|
433 |
+
std::vector<float> getEmbedding() {
|
434 |
+
static const int n_embd = llama_n_embd(ctx);
|
435 |
+
if (!params.embedding) {
|
436 |
+
LOG_WARNING("embedding disabled", {
|
437 |
+
{ "params.embedding", params.embedding },
|
438 |
+
});
|
439 |
+
return std::vector<float>(n_embd, 0.0f);
|
440 |
+
}
|
441 |
+
const float * data = llama_get_embeddings(ctx);
|
442 |
+
std::vector<float> embedding(data, data + n_embd);
|
443 |
+
return embedding;
|
444 |
+
}
|
445 |
+
};
|
446 |
+
|
447 |
+
static void server_print_usage(const char * argv0, const gpt_params & params,
|
448 |
+
const server_params & sparams) {
|
449 |
+
fprintf(stderr, "usage: %s [options]\n", argv0);
|
450 |
+
fprintf(stderr, "\n");
|
451 |
+
fprintf(stderr, "options:\n");
|
452 |
+
fprintf(stderr, " -h, --help show this help message and exit\n");
|
453 |
+
fprintf(stderr, " -v, --verbose verbose output (default: %s)\n", server_verbose ? "enabled" : "disabled");
|
454 |
+
fprintf(stderr, " -t N, --threads N number of threads to use during computation (default: %d)\n", params.n_threads);
|
455 |
+
fprintf(stderr, " -c N, --ctx-size N size of the prompt context (default: %d)\n", params.n_ctx);
|
456 |
+
fprintf(stderr, " -b N, --batch-size N batch size for prompt processing (default: %d)\n", params.n_batch);
|
457 |
+
fprintf(stderr, " --memory-f32 use f32 instead of f16 for memory key+value (default: disabled)\n");
|
458 |
+
fprintf(stderr, " not recommended: doubles context memory required and no measurable increase in quality\n");
|
459 |
+
if (llama_mlock_supported()) {
|
460 |
+
fprintf(stderr, " --mlock force system to keep model in RAM rather than swapping or compressing\n");
|
461 |
+
}
|
462 |
+
if (llama_mmap_supported()) {
|
463 |
+
fprintf(stderr, " --no-mmap do not memory-map model (slower load but may reduce pageouts if not using mlock)\n");
|
464 |
+
}
|
465 |
+
#ifdef LLAMA_SUPPORTS_GPU_OFFLOAD
|
466 |
+
fprintf(stderr, " -ngl N, --n-gpu-layers N\n");
|
467 |
+
fprintf(stderr, " number of layers to store in VRAM\n");
|
468 |
+
fprintf(stderr, " -ts SPLIT --tensor-split SPLIT\n");
|
469 |
+
fprintf(stderr, " how to split tensors across multiple GPUs, comma-separated list of proportions, e.g. 3,1\n");
|
470 |
+
fprintf(stderr, " how to split tensors across multiple GPUs, comma-separated list of proportions, e.g. 3,1\n");
|
471 |
+
fprintf(stderr, " -mg i, --main-gpu i the GPU to use for scratch and small tensors\n");
|
472 |
+
fprintf(stderr, " -lv, --low-vram don't allocate VRAM scratch buffer\n");
|
473 |
+
#endif
|
474 |
+
fprintf(stderr, " -m FNAME, --model FNAME\n");
|
475 |
+
fprintf(stderr, " model path (default: %s)\n", params.model.c_str());
|
476 |
+
fprintf(stderr, " -a ALIAS, --alias ALIAS\n");
|
477 |
+
fprintf(stderr, " set an alias for the model, will be added as `model` field in completion response\n");
|
478 |
+
fprintf(stderr, " --lora FNAME apply LoRA adapter (implies --no-mmap)\n");
|
479 |
+
fprintf(stderr, " --lora-base FNAME optional model to use as a base for the layers modified by the LoRA adapter\n");
|
480 |
+
fprintf(stderr, " --host ip address to listen (default (default: %s)\n", sparams.hostname.c_str());
|
481 |
+
fprintf(stderr, " --port PORT port to listen (default (default: %d)\n", sparams.port);
|
482 |
+
fprintf(stderr, " -to N, --timeout N server read/write timeout in seconds (default: %d)\n", sparams.read_timeout);
|
483 |
+
fprintf(stderr, " --embedding enable embedding vector output (default: %s)\n", params.embedding ? "enabled" : "disabled");
|
484 |
+
fprintf(stderr, "\n");
|
485 |
+
}
|
486 |
+
|
487 |
+
static void server_params_parse(int argc, char ** argv, server_params & sparams,
|
488 |
+
gpt_params & params) {
|
489 |
+
gpt_params default_params;
|
490 |
+
server_params default_sparams;
|
491 |
+
std::string arg;
|
492 |
+
bool invalid_param = false;
|
493 |
+
|
494 |
+
for (int i = 1; i < argc; i++) {
|
495 |
+
arg = argv[i];
|
496 |
+
if (arg == "--port") {
|
497 |
+
if (++i >= argc) {
|
498 |
+
invalid_param = true;
|
499 |
+
break;
|
500 |
+
}
|
501 |
+
sparams.port = std::stoi(argv[i]);
|
502 |
+
} else if (arg == "--host") {
|
503 |
+
if (++i >= argc) {
|
504 |
+
invalid_param = true;
|
505 |
+
break;
|
506 |
+
}
|
507 |
+
sparams.hostname = argv[i];
|
508 |
+
} else if (arg == "--timeout" || arg == "-to") {
|
509 |
+
if (++i >= argc) {
|
510 |
+
invalid_param = true;
|
511 |
+
break;
|
512 |
+
}
|
513 |
+
sparams.read_timeout = std::stoi(argv[i]);
|
514 |
+
sparams.write_timeout = std::stoi(argv[i]);
|
515 |
+
} else if (arg == "-m" || arg == "--model") {
|
516 |
+
if (++i >= argc) {
|
517 |
+
invalid_param = true;
|
518 |
+
break;
|
519 |
+
}
|
520 |
+
params.model = argv[i];
|
521 |
+
} else if (arg == "-a" || arg == "--alias") {
|
522 |
+
if (++i >= argc) {
|
523 |
+
invalid_param = true;
|
524 |
+
break;
|
525 |
+
}
|
526 |
+
params.model_alias = argv[i];
|
527 |
+
} else if (arg == "-h" || arg == "--help") {
|
528 |
+
server_print_usage(argv[0], default_params, default_sparams);
|
529 |
+
exit(0);
|
530 |
+
} else if (arg == "-c" || arg == "--ctx-size" || arg == "--ctx_size") {
|
531 |
+
if (++i >= argc) {
|
532 |
+
invalid_param = true;
|
533 |
+
break;
|
534 |
+
}
|
535 |
+
params.n_ctx = std::stoi(argv[i]);
|
536 |
+
} else if (arg == "--memory-f32" || arg == "--memory_f32") {
|
537 |
+
params.memory_f16 = false;
|
538 |
+
} else if (arg == "--threads" || arg == "-t") {
|
539 |
+
if (++i >= argc) {
|
540 |
+
invalid_param = true;
|
541 |
+
break;
|
542 |
+
}
|
543 |
+
params.n_threads = std::stoi(argv[i]);
|
544 |
+
} else if (arg == "-b" || arg == "--batch-size") {
|
545 |
+
if (++i >= argc) {
|
546 |
+
invalid_param = true;
|
547 |
+
break;
|
548 |
+
}
|
549 |
+
params.n_batch = std::stoi(argv[i]);
|
550 |
+
params.n_batch = std::min(512, params.n_batch);
|
551 |
+
} else if (arg == "--gpu-layers" || arg == "-ngl" || arg == "--n-gpu-layers") {
|
552 |
+
if (++i >= argc) {
|
553 |
+
invalid_param = true;
|
554 |
+
break;
|
555 |
+
}
|
556 |
+
#ifdef LLAMA_SUPPORTS_GPU_OFFLOAD
|
557 |
+
params.n_gpu_layers = std::stoi(argv[i]);
|
558 |
+
#else
|
559 |
+
LOG_WARNING("Not compiled with GPU offload support, --n-gpu-layers option will be ignored. "
|
560 |
+
"See main README.md for information on enabling GPU BLAS support", { { "n_gpu_layers", params.n_gpu_layers } });
|
561 |
+
#endif
|
562 |
+
}
|
563 |
+
else if (arg == "--tensor-split" || arg == "-ts") {
|
564 |
+
if (++i >= argc) {
|
565 |
+
invalid_param = true;
|
566 |
+
break;
|
567 |
+
}
|
568 |
+
#ifdef GGML_USE_CUBLAS
|
569 |
+
std::string arg_next = argv[i];
|
570 |
+
|
571 |
+
// split string by , and /
|
572 |
+
const std::regex regex{ R"([,/]+)" };
|
573 |
+
std::sregex_token_iterator it{ arg_next.begin(), arg_next.end(), regex, -1 };
|
574 |
+
std::vector<std::string> split_arg{ it, {} };
|
575 |
+
GGML_ASSERT(split_arg.size() <= LLAMA_MAX_DEVICES);
|
576 |
+
|
577 |
+
for (size_t i_device = 0; i_device < LLAMA_MAX_DEVICES; ++i_device) {
|
578 |
+
if (i_device < split_arg.size()) {
|
579 |
+
params.tensor_split[i_device] = std::stof(split_arg[i_device]);
|
580 |
+
}
|
581 |
+
else {
|
582 |
+
params.tensor_split[i_device] = 0.0f;
|
583 |
+
}
|
584 |
+
}
|
585 |
+
#else
|
586 |
+
LOG_WARNING("llama.cpp was compiled without cuBLAS. It is not possible to set a tensor split.", {});
|
587 |
+
#endif // GGML_USE_CUBLAS
|
588 |
+
}
|
589 |
+
else if (arg == "--low-vram" || arg == "-lv")
|
590 |
+
{
|
591 |
+
#ifdef GGML_USE_CUBLAS
|
592 |
+
params.low_vram = true;
|
593 |
+
#else
|
594 |
+
fprintf(stderr, "warning: llama.cpp was compiled without cuBLAS. It is not possible to set lower vram usage.\n");
|
595 |
+
#endif // GGML_USE_CUBLAS
|
596 |
+
}
|
597 |
+
else if (arg == "--main-gpu" || arg == "-mg") {
|
598 |
+
if (++i >= argc) {
|
599 |
+
invalid_param = true;
|
600 |
+
break;
|
601 |
+
}
|
602 |
+
#ifdef GGML_USE_CUBLAS
|
603 |
+
params.main_gpu = std::stoi(argv[i]);
|
604 |
+
#else
|
605 |
+
LOG_WARNING("llama.cpp was compiled without cuBLAS. It is not possible to set a main GPU.", {});
|
606 |
+
#endif
|
607 |
+
} else if (arg == "--lora") {
|
608 |
+
if (++i >= argc) {
|
609 |
+
invalid_param = true;
|
610 |
+
break;
|
611 |
+
}
|
612 |
+
params.lora_adapter = argv[i];
|
613 |
+
params.use_mmap = false;
|
614 |
+
} else if (arg == "--lora-base") {
|
615 |
+
if (++i >= argc) {
|
616 |
+
invalid_param = true;
|
617 |
+
break;
|
618 |
+
}
|
619 |
+
params.lora_base = argv[i];
|
620 |
+
} else if (arg == "-v" || arg == "--verbose") {
|
621 |
+
#if SERVER_VERBOSE != 1
|
622 |
+
LOG_WARNING("server.cpp is not built with verbose logging.", {});
|
623 |
+
#else
|
624 |
+
server_verbose = true;
|
625 |
+
#endif
|
626 |
+
} else if (arg == "--mlock") {
|
627 |
+
params.use_mlock = true;
|
628 |
+
} else if (arg == "--no-mmap") {
|
629 |
+
params.use_mmap = false;
|
630 |
+
} else if (arg == "--embedding") {
|
631 |
+
params.embedding = true;
|
632 |
+
} else {
|
633 |
+
fprintf(stderr, "error: unknown argument: %s\n", arg.c_str());
|
634 |
+
server_print_usage(argv[0], default_params, default_sparams);
|
635 |
+
exit(1);
|
636 |
+
}
|
637 |
+
}
|
638 |
+
|
639 |
+
if (invalid_param) {
|
640 |
+
fprintf(stderr, "error: invalid parameter for argument: %s\n", arg.c_str());
|
641 |
+
server_print_usage(argv[0], default_params, default_sparams);
|
642 |
+
exit(1);
|
643 |
+
}
|
644 |
+
}
|
645 |
+
|
646 |
+
static json format_generation_settings(llama_server_context & llama) {
|
647 |
+
const auto eos_bias = llama.params.logit_bias.find(llama_token_eos());
|
648 |
+
const bool ignore_eos = eos_bias != llama.params.logit_bias.end() &&
|
649 |
+
eos_bias->second < 0.0f && std::isinf(eos_bias->second);
|
650 |
+
|
651 |
+
return json {
|
652 |
+
{ "seed", llama.params.seed },
|
653 |
+
{ "temp", llama.params.temp },
|
654 |
+
{ "top_k", llama.params.top_k },
|
655 |
+
{ "top_p", llama.params.top_p },
|
656 |
+
{ "tfs_z", llama.params.tfs_z },
|
657 |
+
{ "typical_p", llama.params.typical_p },
|
658 |
+
{ "repeat_last_n", llama.params.repeat_last_n },
|
659 |
+
{ "repeat_penalty", llama.params.repeat_penalty },
|
660 |
+
{ "presence_penalty", llama.params.presence_penalty },
|
661 |
+
{ "frequency_penalty", llama.params.frequency_penalty },
|
662 |
+
{ "mirostat", llama.params.mirostat },
|
663 |
+
{ "mirostat_tau", llama.params.mirostat_tau },
|
664 |
+
{ "mirostat_eta", llama.params.mirostat_eta },
|
665 |
+
{ "penalize_nl", llama.params.penalize_nl },
|
666 |
+
{ "stop", llama.params.antiprompt },
|
667 |
+
{ "n_predict", llama.params.n_predict },
|
668 |
+
{ "n_keep", llama.params.n_keep },
|
669 |
+
{ "ignore_eos", ignore_eos },
|
670 |
+
{ "stream", llama.stream },
|
671 |
+
{ "logit_bias", llama.params.logit_bias },
|
672 |
+
};
|
673 |
+
}
|
674 |
+
|
675 |
+
static json format_embedding_response(llama_server_context & llama) {
|
676 |
+
return json {
|
677 |
+
{ "embedding", llama.getEmbedding() },
|
678 |
+
};
|
679 |
+
}
|
680 |
+
|
681 |
+
static json format_final_response(llama_server_context & llama, const std::string & content) {
|
682 |
+
return json {
|
683 |
+
{ "content", content },
|
684 |
+
{ "stop", true },
|
685 |
+
{ "model", llama.params.model_alias },
|
686 |
+
{ "tokens_predicted", llama.num_tokens_predicted },
|
687 |
+
{ "generation_settings", format_generation_settings(llama) },
|
688 |
+
{ "prompt", llama.params.prompt },
|
689 |
+
{ "truncated", llama.truncated },
|
690 |
+
{ "stopped_eos", llama.stopped_eos },
|
691 |
+
{ "stopped_word", llama.stopped_word },
|
692 |
+
{ "stopped_limit", llama.stopped_limit },
|
693 |
+
{ "stopping_word", llama.stopping_word },
|
694 |
+
};
|
695 |
+
}
|
696 |
+
|
697 |
+
static json format_partial_response(const std::string & content) {
|
698 |
+
return json {
|
699 |
+
{ "content", content },
|
700 |
+
{ "stop", false },
|
701 |
+
};
|
702 |
+
}
|
703 |
+
|
704 |
+
static json format_tokenizer_response(const std::vector<llama_token> & tokens) {
|
705 |
+
return json {
|
706 |
+
{ "tokens", tokens }
|
707 |
+
};
|
708 |
+
}
|
709 |
+
|
710 |
+
static void parse_options_completion(const json & body, llama_server_context & llama) {
|
711 |
+
gpt_params default_params;
|
712 |
+
|
713 |
+
llama.stream = body.value("stream", false);
|
714 |
+
llama.params.n_predict = body.value("n_predict", default_params.n_predict);
|
715 |
+
llama.params.top_k = body.value("top_k", default_params.top_k);
|
716 |
+
llama.params.top_p = body.value("top_p", default_params.top_p);
|
717 |
+
llama.params.tfs_z = body.value("tfs_z", default_params.tfs_z);
|
718 |
+
llama.params.typical_p = body.value("typical_p", default_params.typical_p);
|
719 |
+
llama.params.repeat_last_n = body.value("repeat_last_n", default_params.repeat_last_n);
|
720 |
+
llama.params.temp = body.value("temperature", default_params.temp);
|
721 |
+
llama.params.repeat_penalty = body.value("repeat_penalty", default_params.repeat_penalty);
|
722 |
+
llama.params.presence_penalty = body.value("presence_penalty", default_params.presence_penalty);
|
723 |
+
llama.params.frequency_penalty = body.value("frequency_penalty", default_params.frequency_penalty);
|
724 |
+
llama.params.mirostat = body.value("mirostat", default_params.mirostat);
|
725 |
+
llama.params.mirostat_tau = body.value("mirostat_tau", default_params.mirostat_tau);
|
726 |
+
llama.params.mirostat_eta = body.value("mirostat_eta", default_params.mirostat_eta);
|
727 |
+
llama.params.penalize_nl = body.value("penalize_nl", default_params.penalize_nl);
|
728 |
+
llama.params.n_keep = body.value("n_keep", default_params.n_keep);
|
729 |
+
llama.params.seed = body.value("seed", default_params.seed);
|
730 |
+
llama.params.prompt = body.value("prompt", default_params.prompt);
|
731 |
+
|
732 |
+
llama.params.logit_bias.clear();
|
733 |
+
if (body.value("ignore_eos", false)) {
|
734 |
+
llama.params.logit_bias[llama_token_eos()] = -INFINITY;
|
735 |
+
}
|
736 |
+
|
737 |
+
const auto & logit_bias = body.find("logit_bias");
|
738 |
+
if (logit_bias != body.end() && logit_bias->is_array()) {
|
739 |
+
const int n_vocab = llama_n_vocab(llama.ctx);
|
740 |
+
for (const auto & el : *logit_bias) {
|
741 |
+
if (el.is_array() && el.size() == 2 && el[0].is_number_integer()) {
|
742 |
+
llama_token tok = el[0].get<llama_token>();
|
743 |
+
if (tok >= 0 && tok < n_vocab) {
|
744 |
+
if (el[1].is_number()) {
|
745 |
+
llama.params.logit_bias[tok] = el[1].get<float>();
|
746 |
+
} else if (el[1].is_boolean() && !el[1].get<bool>()) {
|
747 |
+
llama.params.logit_bias[tok] = -INFINITY;
|
748 |
+
}
|
749 |
+
}
|
750 |
+
}
|
751 |
+
}
|
752 |
+
}
|
753 |
+
|
754 |
+
llama.params.antiprompt.clear();
|
755 |
+
const auto & stop = body.find("stop");
|
756 |
+
if (stop != body.end() && stop->is_array()) {
|
757 |
+
for (const auto & word : *stop) {
|
758 |
+
if (!word.empty()) {
|
759 |
+
llama.params.antiprompt.push_back(word);
|
760 |
+
}
|
761 |
+
}
|
762 |
+
}
|
763 |
+
|
764 |
+
LOG_VERBOSE("completion parameters parsed", format_generation_settings(llama));
|
765 |
+
}
|
766 |
+
|
767 |
+
static void log_server_request(const Request & req, const Response & res) {
|
768 |
+
LOG_INFO("request", {
|
769 |
+
{ "remote_addr", req.remote_addr },
|
770 |
+
{ "remote_port", req.remote_port },
|
771 |
+
{ "status", res.status },
|
772 |
+
{ "path", req.path },
|
773 |
+
{ "request", req.body },
|
774 |
+
{ "response", res.body },
|
775 |
+
});
|
776 |
+
}
|
777 |
+
|
778 |
+
int main(int argc, char ** argv) {
|
779 |
+
// own arguments required by this example
|
780 |
+
gpt_params params;
|
781 |
+
server_params sparams;
|
782 |
+
|
783 |
+
// struct that contains llama context and inference
|
784 |
+
llama_server_context llama;
|
785 |
+
|
786 |
+
server_params_parse(argc, argv, sparams, params);
|
787 |
+
|
788 |
+
if (params.model_alias == "unknown") {
|
789 |
+
params.model_alias = params.model;
|
790 |
+
}
|
791 |
+
|
792 |
+
llama_init_backend();
|
793 |
+
|
794 |
+
LOG_INFO("build info", {
|
795 |
+
{ "build", BUILD_NUMBER },
|
796 |
+
{ "commit", BUILD_COMMIT }
|
797 |
+
});
|
798 |
+
LOG_INFO("system info", {
|
799 |
+
{ "n_threads", params.n_threads },
|
800 |
+
{ "total_threads", std::thread::hardware_concurrency() },
|
801 |
+
{ "system_info", llama_print_system_info() },
|
802 |
+
});
|
803 |
+
|
804 |
+
// load the model
|
805 |
+
if (!llama.loadModel(params)) {
|
806 |
+
return 1;
|
807 |
+
}
|
808 |
+
|
809 |
+
Server svr;
|
810 |
+
|
811 |
+
svr.set_default_headers({
|
812 |
+
{ "Access-Control-Allow-Origin", "*" },
|
813 |
+
{ "Access-Control-Allow-Headers", "content-type" }
|
814 |
+
});
|
815 |
+
|
816 |
+
svr.Get("/", [](const Request &, Response & res) {
|
817 |
+
res.set_content("<h1>llama.cpp server works</h1>", "text/html");
|
818 |
+
});
|
819 |
+
|
820 |
+
svr.Post("/completion", [&llama](const Request & req, Response & res) {
|
821 |
+
llama.rewind();
|
822 |
+
llama_reset_timings(llama.ctx);
|
823 |
+
|
824 |
+
parse_options_completion(json::parse(req.body), llama);
|
825 |
+
|
826 |
+
llama.loadPrompt();
|
827 |
+
llama.beginCompletion();
|
828 |
+
|
829 |
+
if (!llama.stream) {
|
830 |
+
size_t stop_pos = std::string::npos;
|
831 |
+
|
832 |
+
while (llama.has_next_token) {
|
833 |
+
const std::string token_text = llama.doCompletion();
|
834 |
+
|
835 |
+
stop_pos = llama.findStoppingStrings(llama.generated_text,
|
836 |
+
token_text.size(), STOP_FULL);
|
837 |
+
}
|
838 |
+
|
839 |
+
if (stop_pos == std::string::npos) {
|
840 |
+
stop_pos = llama.findStoppingStrings(llama.generated_text, 0, STOP_PARTIAL);
|
841 |
+
}
|
842 |
+
if (stop_pos != std::string::npos) {
|
843 |
+
llama.generated_text.erase(llama.generated_text.begin() + stop_pos,
|
844 |
+
llama.generated_text.end());
|
845 |
+
}
|
846 |
+
|
847 |
+
const json data = format_final_response(llama, llama.generated_text);
|
848 |
+
|
849 |
+
llama_print_timings(llama.ctx);
|
850 |
+
|
851 |
+
res.set_content(data.dump(-1, ' ', false, json::error_handler_t::replace),
|
852 |
+
"application/json");
|
853 |
+
} else {
|
854 |
+
const auto chunked_content_provider = [&](size_t, DataSink & sink) {
|
855 |
+
size_t sent_count = 0;
|
856 |
+
|
857 |
+
while (llama.has_next_token) {
|
858 |
+
const std::string token_text = llama.doCompletion();
|
859 |
+
if (llama.multibyte_pending > 0) {
|
860 |
+
continue;
|
861 |
+
}
|
862 |
+
|
863 |
+
size_t pos = std::min(sent_count, llama.generated_text.size());
|
864 |
+
|
865 |
+
const std::string str_test = llama.generated_text.substr(pos);
|
866 |
+
size_t stop_pos =
|
867 |
+
llama.findStoppingStrings(str_test, token_text.size(), STOP_FULL);
|
868 |
+
if (stop_pos != std::string::npos) {
|
869 |
+
llama.generated_text.erase(
|
870 |
+
llama.generated_text.begin() + pos + stop_pos,
|
871 |
+
llama.generated_text.end());
|
872 |
+
pos = std::min(sent_count, llama.generated_text.size());
|
873 |
+
} else {
|
874 |
+
stop_pos = llama.findStoppingStrings(str_test, token_text.size(),
|
875 |
+
STOP_PARTIAL);
|
876 |
+
}
|
877 |
+
|
878 |
+
const std::string to_send = llama.generated_text.substr(pos, stop_pos);
|
879 |
+
sent_count += to_send.size();
|
880 |
+
|
881 |
+
const json data = llama.has_next_token
|
882 |
+
? format_partial_response(to_send)
|
883 |
+
// Generation is done, send extra information.
|
884 |
+
: format_final_response(llama, to_send);
|
885 |
+
|
886 |
+
const std::string str =
|
887 |
+
"data: " +
|
888 |
+
data.dump(-1, ' ', false, json::error_handler_t::replace) +
|
889 |
+
"\n\n";
|
890 |
+
|
891 |
+
LOG_VERBOSE("data stream", {
|
892 |
+
{ "to_send", str }
|
893 |
+
});
|
894 |
+
|
895 |
+
if (!sink.write(str.data(), str.size())) {
|
896 |
+
LOG_VERBOSE("stream closed", {});
|
897 |
+
llama_print_timings(llama.ctx);
|
898 |
+
return false;
|
899 |
+
}
|
900 |
+
}
|
901 |
+
|
902 |
+
llama_print_timings(llama.ctx);
|
903 |
+
sink.done();
|
904 |
+
return true;
|
905 |
+
};
|
906 |
+
res.set_chunked_content_provider("text/event-stream", chunked_content_provider);
|
907 |
+
}
|
908 |
+
});
|
909 |
+
|
910 |
+
svr.Options(R"(/.*)", [](const Request &, Response & res) {
|
911 |
+
return res.set_content("", "application/json");
|
912 |
+
});
|
913 |
+
|
914 |
+
svr.Post("/tokenize", [&llama](const Request & req, Response & res) {
|
915 |
+
const json body = json::parse(req.body);
|
916 |
+
const std::string content = body.value("content", "");
|
917 |
+
const std::vector<llama_token> tokens = llama_tokenize(llama.ctx, content, false);
|
918 |
+
const json data = format_tokenizer_response(tokens);
|
919 |
+
return res.set_content(data.dump(), "application/json");
|
920 |
+
});
|
921 |
+
|
922 |
+
svr.Post("/embedding", [&llama](const Request & req, Response & res) {
|
923 |
+
const json body = json::parse(req.body);
|
924 |
+
|
925 |
+
llama.rewind();
|
926 |
+
llama_reset_timings(llama.ctx);
|
927 |
+
llama.params.prompt = body.value("content", "");
|
928 |
+
llama.params.n_predict = 0;
|
929 |
+
llama.loadPrompt();
|
930 |
+
llama.beginCompletion();
|
931 |
+
llama.doCompletion();
|
932 |
+
|
933 |
+
const json data = format_embedding_response(llama);
|
934 |
+
return res.set_content(data.dump(), "application/json");
|
935 |
+
});
|
936 |
+
|
937 |
+
svr.set_logger(log_server_request);
|
938 |
+
|
939 |
+
svr.set_exception_handler([](const Request &, Response & res, std::exception_ptr ep) {
|
940 |
+
const auto * fmt = "500 Internal Server Error\n%s";
|
941 |
+
char buf[BUFSIZ];
|
942 |
+
try {
|
943 |
+
std::rethrow_exception(std::move(ep));
|
944 |
+
} catch (std::exception & e) {
|
945 |
+
snprintf(buf, sizeof(buf), fmt, e.what());
|
946 |
+
} catch (...) {
|
947 |
+
snprintf(buf, sizeof(buf), fmt, "Unknown Exception");
|
948 |
+
}
|
949 |
+
res.set_content(buf, "text/plain");
|
950 |
+
res.status = 500;
|
951 |
+
});
|
952 |
+
|
953 |
+
// set timeouts and change hostname and port
|
954 |
+
svr.set_read_timeout(sparams.read_timeout);
|
955 |
+
svr.set_write_timeout(sparams.write_timeout);
|
956 |
+
|
957 |
+
if (!svr.bind_to_port(sparams.hostname, sparams.port)) {
|
958 |
+
LOG_ERROR("couldn't bind to server socket", {
|
959 |
+
{ "hostname", sparams.hostname },
|
960 |
+
{ "port", sparams.port },
|
961 |
+
});
|
962 |
+
return 1;
|
963 |
+
}
|
964 |
+
|
965 |
+
LOG_INFO("HTTP server listening", {
|
966 |
+
{ "hostname", sparams.hostname },
|
967 |
+
{ "port", sparams.port },
|
968 |
+
});
|
969 |
+
|
970 |
+
if (!svr.listen_after_bind()) {
|
971 |
+
return 1;
|
972 |
+
}
|
973 |
+
|
974 |
+
return 0;
|
975 |
+
}
|
examples/simple/CMakeLists.txt
ADDED
@@ -0,0 +1,7 @@
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
1 |
+
set(TARGET simple)
|
2 |
+
add_executable(${TARGET} simple.cpp)
|
3 |
+
target_link_libraries(${TARGET} PRIVATE common llama ${CMAKE_THREAD_LIBS_INIT})
|
4 |
+
target_compile_features(${TARGET} PRIVATE cxx_std_11)
|
5 |
+
if(TARGET BUILD_INFO)
|
6 |
+
add_dependencies(${TARGET} BUILD_INFO)
|
7 |
+
endif()
|
examples/simple/simple.cpp
ADDED
@@ -0,0 +1,179 @@
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
1 |
+
#ifndef _GNU_SOURCE
|
2 |
+
#define _GNU_SOURCE
|
3 |
+
#endif
|
4 |
+
|
5 |
+
#include "common.h"
|
6 |
+
#include "llama.h"
|
7 |
+
#include "build-info.h"
|
8 |
+
|
9 |
+
#include <cassert>
|
10 |
+
#include <cinttypes>
|
11 |
+
#include <cmath>
|
12 |
+
#include <cstdio>
|
13 |
+
#include <cstring>
|
14 |
+
#include <ctime>
|
15 |
+
#include <fstream>
|
16 |
+
#include <iostream>
|
17 |
+
#include <string>
|
18 |
+
#include <vector>
|
19 |
+
|
20 |
+
#if defined (__unix__) || (defined (__APPLE__) && defined (__MACH__))
|
21 |
+
#include <signal.h>
|
22 |
+
#include <unistd.h>
|
23 |
+
#elif defined (_WIN32)
|
24 |
+
#define WIN32_LEAN_AND_MEAN
|
25 |
+
#define NOMINMAX
|
26 |
+
#include <windows.h>
|
27 |
+
#include <signal.h>
|
28 |
+
#endif
|
29 |
+
|
30 |
+
|
31 |
+
|
32 |
+
int main(int argc, char ** argv)
|
33 |
+
{
|
34 |
+
gpt_params params;
|
35 |
+
|
36 |
+
//---------------------------------
|
37 |
+
// Print help :
|
38 |
+
//---------------------------------
|
39 |
+
|
40 |
+
if ( argc == 1 || argv[1][0] == '-' )
|
41 |
+
{
|
42 |
+
printf( "usage: %s MODEL_PATH [PROMPT]\n" , argv[0] );
|
43 |
+
return 1 ;
|
44 |
+
}
|
45 |
+
|
46 |
+
//---------------------------------
|
47 |
+
// Load parameters :
|
48 |
+
//---------------------------------
|
49 |
+
|
50 |
+
if ( argc >= 2 )
|
51 |
+
{
|
52 |
+
params.model = argv[1];
|
53 |
+
}
|
54 |
+
|
55 |
+
if ( argc >= 3 )
|
56 |
+
{
|
57 |
+
params.prompt = argv[2];
|
58 |
+
}
|
59 |
+
|
60 |
+
if ( params.prompt.empty() )
|
61 |
+
{
|
62 |
+
params.prompt = "Hello my name is";
|
63 |
+
}
|
64 |
+
|
65 |
+
//---------------------------------
|
66 |
+
// Init LLM :
|
67 |
+
//---------------------------------
|
68 |
+
|
69 |
+
llama_init_backend();
|
70 |
+
|
71 |
+
llama_model * model;
|
72 |
+
llama_context * ctx;
|
73 |
+
|
74 |
+
std::tie(model, ctx) = llama_init_from_gpt_params( params );
|
75 |
+
|
76 |
+
if ( model == NULL )
|
77 |
+
{
|
78 |
+
fprintf( stderr , "%s: error: unable to load model\n" , __func__ );
|
79 |
+
return 1;
|
80 |
+
}
|
81 |
+
|
82 |
+
//---------------------------------
|
83 |
+
// Tokenize the prompt :
|
84 |
+
//---------------------------------
|
85 |
+
|
86 |
+
std::vector<llama_token> tokens_list;
|
87 |
+
tokens_list = ::llama_tokenize( ctx , params.prompt , true );
|
88 |
+
|
89 |
+
const int max_context_size = llama_n_ctx( ctx );
|
90 |
+
const int max_tokens_list_size = max_context_size - 4 ;
|
91 |
+
|
92 |
+
if ( (int)tokens_list.size() > max_tokens_list_size )
|
93 |
+
{
|
94 |
+
fprintf( stderr , "%s: error: prompt too long (%d tokens, max %d)\n" ,
|
95 |
+
__func__ , (int)tokens_list.size() , max_tokens_list_size );
|
96 |
+
return 1;
|
97 |
+
}
|
98 |
+
|
99 |
+
fprintf( stderr, "\n\n" );
|
100 |
+
|
101 |
+
// Print the tokens from the prompt :
|
102 |
+
|
103 |
+
for( auto id : tokens_list )
|
104 |
+
{
|
105 |
+
printf( "%s" , llama_token_to_str( ctx , id ) );
|
106 |
+
}
|
107 |
+
|
108 |
+
fflush(stdout);
|
109 |
+
|
110 |
+
|
111 |
+
//---------------------------------
|
112 |
+
// Main prediction loop :
|
113 |
+
//---------------------------------
|
114 |
+
|
115 |
+
// The LLM keeps a contextual cache memory of previous token evaluation.
|
116 |
+
// Usually, once this cache is full, it is required to recompute a compressed context based on previous
|
117 |
+
// tokens (see "infinite text generation via context swapping" in the main example), but in this minimalist
|
118 |
+
// example, we will just stop the loop once this cache is full or once an end of stream is detected.
|
119 |
+
|
120 |
+
while ( llama_get_kv_cache_token_count( ctx ) < max_context_size )
|
121 |
+
{
|
122 |
+
//---------------------------------
|
123 |
+
// Evaluate the tokens :
|
124 |
+
//---------------------------------
|
125 |
+
|
126 |
+
if ( llama_eval( ctx , tokens_list.data() , tokens_list.size() , llama_get_kv_cache_token_count( ctx ) , params.n_threads ) )
|
127 |
+
{
|
128 |
+
fprintf( stderr, "%s : failed to eval\n" , __func__ );
|
129 |
+
return 1;
|
130 |
+
}
|
131 |
+
|
132 |
+
tokens_list.clear();
|
133 |
+
|
134 |
+
//---------------------------------
|
135 |
+
// Select the best prediction :
|
136 |
+
//---------------------------------
|
137 |
+
|
138 |
+
llama_token new_token_id = 0;
|
139 |
+
|
140 |
+
auto logits = llama_get_logits( ctx );
|
141 |
+
auto n_vocab = llama_n_vocab( ctx ); // the size of the LLM vocabulary (in tokens)
|
142 |
+
|
143 |
+
std::vector<llama_token_data> candidates;
|
144 |
+
candidates.reserve( n_vocab );
|
145 |
+
|
146 |
+
for( llama_token token_id = 0 ; token_id < n_vocab ; token_id++ )
|
147 |
+
{
|
148 |
+
candidates.emplace_back( llama_token_data{ token_id , logits[ token_id ] , 0.0f } );
|
149 |
+
}
|
150 |
+
|
151 |
+
llama_token_data_array candidates_p = { candidates.data(), candidates.size(), false };
|
152 |
+
|
153 |
+
// Select it using the "Greedy sampling" method :
|
154 |
+
new_token_id = llama_sample_token_greedy( ctx , &candidates_p );
|
155 |
+
|
156 |
+
|
157 |
+
// is it an end of stream ?
|
158 |
+
if ( new_token_id == llama_token_eos() )
|
159 |
+
{
|
160 |
+
fprintf(stderr, " [end of text]\n");
|
161 |
+
break;
|
162 |
+
}
|
163 |
+
|
164 |
+
// Print the new token :
|
165 |
+
printf( "%s" , llama_token_to_str( ctx , new_token_id ) );
|
166 |
+
fflush( stdout );
|
167 |
+
|
168 |
+
// Push this new token for next evaluation :
|
169 |
+
tokens_list.push_back( new_token_id );
|
170 |
+
|
171 |
+
} // wend of main loop
|
172 |
+
|
173 |
+
llama_free( ctx );
|
174 |
+
llama_free_model( model );
|
175 |
+
|
176 |
+
return 0;
|
177 |
+
}
|
178 |
+
|
179 |
+
// EOF
|
examples/train-text-from-scratch/CMakeLists.txt
ADDED
@@ -0,0 +1,4 @@
|
|
|
|
|
|
|
|
|
|
|
1 |
+
set(TARGET train-text-from-scratch)
|
2 |
+
add_executable(${TARGET} train-text-from-scratch.cpp)
|
3 |
+
target_link_libraries(${TARGET} PRIVATE common llama ${CMAKE_THREAD_LIBS_INIT})
|
4 |
+
target_compile_features(${TARGET} PRIVATE cxx_std_11)
|