Re-introduce the `llama` package (#5034)
* Re-introduce the llama package
This PR brings back the llama package, making it possible to call llama.cpp and
ggml APIs from Go directly via CGo. This has a few advantages:
- C APIs can be called directly from Go without needing to use the previous
"server" REST API
- On macOS and for CPU builds on Linux and Windows, Ollama can be built without
a go generate ./... step, making it easy to get up and running to hack on
parts of Ollama that don't require fast inference
- Faster build times for AVX,AVX2,CUDA and ROCM (a full build of all runners
takes <5 min on a fast CPU)
- No git submodule making it easier to clone and build from source
This is a big PR, but much of it is vendor code except for:
- llama.go CGo bindings
- example/: a simple example of running inference
- runner/: a subprocess server designed to replace the llm/ext_server package
- Makefile an as minimal as possible Makefile to build the runner package for
different targets (cpu, avx, avx2, cuda, rocm)
Co-authored-by: Jesse Gross <jesse@ollama.com>
Co-authored-by: Daniel Hiltgen <daniel@ollama.com>
* cache: Clear old KV cache entries when evicting a slot
When forking a cache entry, if no empty slots are available we
evict the least recently used one and copy over the KV entries
from the closest match. However, this copy does not overwrite
existing values but only adds new ones. Therefore, we need to
clear the old slot first.
This change fixes two issues:
- The KV cache fills up and runs out of space even though we think
we are managing it correctly
- Performance gets worse over time as we use new cache entries that
are not hot in the processor caches
* doc: explain golang objc linker warning (#6830)
* llama: gather transitive dependencies for rocm for dist packaging (#6848)
* Refine go server makefiles to be more DRY (#6924)
This breaks up the monolithic Makefile for the Go based runners into a
set of utility files as well as recursive Makefiles for the runners.
Files starting with the name "Makefile" are buildable, while files that
end with ".make" are utilities to include in other Makefiles. This
reduces the amount of nearly identical targets and helps set a pattern
for future community contributions for new GPU runner architectures.
When we are ready to switch over to the Go runners, these files should
move to the top of the repo, and we should add targets for the main CLI,
as well as a helper "install" (put all the built binaries on the local
system in a runnable state) and "dist" target (generate the various
tar/zip files for distribution) for local developer use.
* llama: don't create extraneous directories (#6988)
* llama: Exercise the new build in CI (#6989)
Wire up some basic sanity testing in CI for the Go runner. GPU runners are not covered yet.
* llama: Refine developer docs for Go server (#6842)
This enhances the documentation for development focusing on the new Go
server. After we complete the transition further doc refinements
can remove the "transition" discussion.
* runner.go: Allocate batches for all sequences during init
We should tell the model that we could have full batches for all
sequences. We already do this when we allocate the batches but it was
missed during initialization.
* llama.go: Don't return nil from Tokenize on zero length input
Potentially receiving nil in a non-error condition is surprising to
most callers - it's better to return an empty slice.
* runner.go: Remove stop tokens from cache
If the last token is EOG then we don't return this and it isn't
present in the cache (because it was never submitted to Decode).
This works well for extending the cache entry with a new sequence.
However, for multi-token stop sequences, we won't return any of the
tokens but all but the last one will be in the cache. This means
when the conversation continues the cache will contain tokens that
don't overlap with the new prompt.
This works (we will pick up the portion where there is overlap) but
it causes unnecessary cache thrashing because we will fork the original
cache entry as it is not a perfect match.
By trimming the cache to the tokens that we actually return this
issue can be avoided.
* runner.go: Simplify flushing of pending tokens
* runner.go: Update TODOs
* runner.go: Don't panic when processing sequences
If there is an error processing a sequence, we should return a
clean HTTP error back to Ollama rather than panicing. This will
make us more resilient to transient failures.
Panics can still occur during startup as there is no way to serve
requests if that fails.
Co-authored-by: jmorganca <jmorganca@gmail.com>
* runner.go: More accurately capture timings
Currently prompt processing time doesn't capture the that it takes
to tokenize the input, only decoding time. We should capture the
full process to more accurately reflect reality. This is especially
true once we start processing images where the initial processing
can take significant time. This is also more consistent with the
existing C++ runner.
* runner.go: Support for vision models
In addition to bringing feature parity with the C++ runner, this also
incorporates several improvements:
- Cache prompting works with images, avoiding the need to re-decode
embeddings for every message in a conversation
- Parallelism is supported, avoiding the need to restrict to one
sequence at a time. (Though for now Ollama will not schedule
them while we might need to fall back to the old runner.)
Co-authored-by: jmorganca <jmorganca@gmail.com>
* runner.go: Move Unicode checking code and add tests
* runner.go: Export external cache members
Runner and cache are in the same package so the change doesn't
affect anything but it is more internally consistent.
* runner.go: Image embedding cache
Generating embeddings from images can take significant time (on
my machine between 100ms and 8s depending on the model). Although
we already cache the result of decoding these images, the embeddings
need to be regenerated every time. This is not necessary if we get
the same image over and over again, for example, during a conversation.
This currently uses a very small cache with a very simple algorithm
but it is easy to improve as is warranted.
* llama: catch up on patches
Carry forward solar-pro and cli-unicode patches
* runner.go: Don't re-allocate memory for every batch
We can reuse memory allocated from batch to batch since batch
size is fixed. This both saves the cost of reallocation as well
keeps the cache lines hot.
This results in a roughly 1% performance improvement for token
generation with Nvidia GPUs on Linux.
* runner.go: Default to classic input cache policy
The input cache as part of the go runner implemented a cache
policy that aims to maximize hit rate in both single and multi-
user scenarios. When there is a cache hit, the response is
very fast.
However, performance is actually slower when there is an input
cache miss due to worse GPU VRAM locality. This means that
performance is generally better overall for multi-user scenarios
(better input cache hit rate, locality was relatively poor already).
But worse for single users (input cache hit rate is about the same,
locality is now worse).
This defaults the policy back to the old one to avoid a regression
but keeps the new one available through an environment variable
OLLAMA_MULTIUSER_CACHE. This is left undocumented as the goal is
to improve this in the future to get the best of both worlds
without user configuration.
For inputs that result in cache misses, on Nvidia/Linux this
change improves performance by 31% for prompt processing and
13% for token generation.
* runner.go: Increase size of response channel
Generally the CPU can easily keep up with handling reponses that
are generated but there's no reason not to let generation continue
and handle things in larger batches if needed.
* llama: Add CI to verify all vendored changes have patches (#7066)
Make sure we don't accidentally merge changes in the vendored code
that aren't also reflected in the patches.
* llama: adjust clip patch for mingw utf-16 (#7065)
* llama: adjust clip patch for mingw utf-16
* llama: ensure static linking of runtime libs
Avoid runtime dependencies on non-standard libraries
* runner.go: Enable llamafile (all platforms) and BLAS (Mac OS)
These are two features that are shown on llama.cpp's system info
that are currently different between the two runners. On my test
systems the performance difference is very small to negligible
but it is probably still good to equalize the features.
* llm: Don't add BOS/EOS for tokenize requests
This is consistent with what server.cpp currently does. It affects
things like token processing counts for embedding requests.
* runner.go: Don't cache prompts for embeddings
Our integration with server.cpp implicitly disables prompt caching
because it is not part of the JSON object being parsed, this makes
the Go runner behavior similarly.
Prompt caching has been seen to affect the results of text completions
on certain hardware. The results are not wrong either way but they
are non-deterministic. However, embeddings seem to be affected even
on hardware that does not show this behavior for completions. For
now, it is best to maintain consistency with the existing behavior.
* runner.go: Adjust debug log levels
Add system info printed at startup and quiet down noisier logging.
* llama: fix compiler flag differences (#7082)
Adjust the flags for the new Go server to more closely match the
generate flow
* llama: refine developer docs (#7121)
* llama: doc and example clean up (#7122)
* llama: doc and example clean up
* llama: Move new dockerfile into llama dir
Temporary home until we fully transition to the Go server
* llama: runner doc cleanup
* llama.go: Add description for Tokenize error case
---------
Co-authored-by: Jesse Gross <jesse@ollama.com>
Co-authored-by: Daniel Hiltgen <daniel@ollama.com>
Co-authored-by: Daniel Hiltgen <dhiltgen@users.noreply.github.com>
2024-10-08 15:53:54 +00:00
|
|
|
package llama
|
|
|
|
|
|
|
|
/*
|
|
|
|
#cgo CFLAGS: -O2 -std=c11 -DGGML_BUILD=1 -DNDEBUG -DLOG_DISABLE_LOGS -DGGML_USE_LLAMAFILE
|
|
|
|
#cgo CXXFLAGS: -O2 -std=c++11 -DGGML_BUILD=1 -DNDEBUG -DLOG_DISABLE_LOGS -DGGML_USE_LLAMAFILE
|
2024-10-16 19:49:46 +00:00
|
|
|
#cgo darwin,arm64 CFLAGS: -DGGML_USE_METAL -DGGML_USE_ACCELERATE -DGGML_METAL_EMBED_LIBRARY -DACCELERATE_NEW_LAPACK -DACCELERATE_LAPACK_ILP64 -DGGML_USE_BLAS
|
|
|
|
#cgo darwin,arm64 CXXFLAGS: -DGGML_USE_METAL -DGGML_USE_ACCELERATE -DGGML_METAL_EMBED_LIBRARY -DACCELERATE_NEW_LAPACK -DACCELERATE_LAPACK_ILP64 -DGGML_USE_BLAS
|
|
|
|
#cgo darwin,arm64 LDFLAGS: -framework Foundation -framework Metal -framework MetalKit -framework Accelerate
|
|
|
|
#cgo darwin,amd64 CFLAGS: -Wno-incompatible-pointer-types-discards-qualifiers
|
|
|
|
#cgo darwin,amd64 CXXFLAGS: -Wno-incompatible-pointer-types-discards-qualifiers
|
|
|
|
#cgo darwin,amd64 LDFLAGS: -framework Foundation
|
Re-introduce the `llama` package (#5034)
* Re-introduce the llama package
This PR brings back the llama package, making it possible to call llama.cpp and
ggml APIs from Go directly via CGo. This has a few advantages:
- C APIs can be called directly from Go without needing to use the previous
"server" REST API
- On macOS and for CPU builds on Linux and Windows, Ollama can be built without
a go generate ./... step, making it easy to get up and running to hack on
parts of Ollama that don't require fast inference
- Faster build times for AVX,AVX2,CUDA and ROCM (a full build of all runners
takes <5 min on a fast CPU)
- No git submodule making it easier to clone and build from source
This is a big PR, but much of it is vendor code except for:
- llama.go CGo bindings
- example/: a simple example of running inference
- runner/: a subprocess server designed to replace the llm/ext_server package
- Makefile an as minimal as possible Makefile to build the runner package for
different targets (cpu, avx, avx2, cuda, rocm)
Co-authored-by: Jesse Gross <jesse@ollama.com>
Co-authored-by: Daniel Hiltgen <daniel@ollama.com>
* cache: Clear old KV cache entries when evicting a slot
When forking a cache entry, if no empty slots are available we
evict the least recently used one and copy over the KV entries
from the closest match. However, this copy does not overwrite
existing values but only adds new ones. Therefore, we need to
clear the old slot first.
This change fixes two issues:
- The KV cache fills up and runs out of space even though we think
we are managing it correctly
- Performance gets worse over time as we use new cache entries that
are not hot in the processor caches
* doc: explain golang objc linker warning (#6830)
* llama: gather transitive dependencies for rocm for dist packaging (#6848)
* Refine go server makefiles to be more DRY (#6924)
This breaks up the monolithic Makefile for the Go based runners into a
set of utility files as well as recursive Makefiles for the runners.
Files starting with the name "Makefile" are buildable, while files that
end with ".make" are utilities to include in other Makefiles. This
reduces the amount of nearly identical targets and helps set a pattern
for future community contributions for new GPU runner architectures.
When we are ready to switch over to the Go runners, these files should
move to the top of the repo, and we should add targets for the main CLI,
as well as a helper "install" (put all the built binaries on the local
system in a runnable state) and "dist" target (generate the various
tar/zip files for distribution) for local developer use.
* llama: don't create extraneous directories (#6988)
* llama: Exercise the new build in CI (#6989)
Wire up some basic sanity testing in CI for the Go runner. GPU runners are not covered yet.
* llama: Refine developer docs for Go server (#6842)
This enhances the documentation for development focusing on the new Go
server. After we complete the transition further doc refinements
can remove the "transition" discussion.
* runner.go: Allocate batches for all sequences during init
We should tell the model that we could have full batches for all
sequences. We already do this when we allocate the batches but it was
missed during initialization.
* llama.go: Don't return nil from Tokenize on zero length input
Potentially receiving nil in a non-error condition is surprising to
most callers - it's better to return an empty slice.
* runner.go: Remove stop tokens from cache
If the last token is EOG then we don't return this and it isn't
present in the cache (because it was never submitted to Decode).
This works well for extending the cache entry with a new sequence.
However, for multi-token stop sequences, we won't return any of the
tokens but all but the last one will be in the cache. This means
when the conversation continues the cache will contain tokens that
don't overlap with the new prompt.
This works (we will pick up the portion where there is overlap) but
it causes unnecessary cache thrashing because we will fork the original
cache entry as it is not a perfect match.
By trimming the cache to the tokens that we actually return this
issue can be avoided.
* runner.go: Simplify flushing of pending tokens
* runner.go: Update TODOs
* runner.go: Don't panic when processing sequences
If there is an error processing a sequence, we should return a
clean HTTP error back to Ollama rather than panicing. This will
make us more resilient to transient failures.
Panics can still occur during startup as there is no way to serve
requests if that fails.
Co-authored-by: jmorganca <jmorganca@gmail.com>
* runner.go: More accurately capture timings
Currently prompt processing time doesn't capture the that it takes
to tokenize the input, only decoding time. We should capture the
full process to more accurately reflect reality. This is especially
true once we start processing images where the initial processing
can take significant time. This is also more consistent with the
existing C++ runner.
* runner.go: Support for vision models
In addition to bringing feature parity with the C++ runner, this also
incorporates several improvements:
- Cache prompting works with images, avoiding the need to re-decode
embeddings for every message in a conversation
- Parallelism is supported, avoiding the need to restrict to one
sequence at a time. (Though for now Ollama will not schedule
them while we might need to fall back to the old runner.)
Co-authored-by: jmorganca <jmorganca@gmail.com>
* runner.go: Move Unicode checking code and add tests
* runner.go: Export external cache members
Runner and cache are in the same package so the change doesn't
affect anything but it is more internally consistent.
* runner.go: Image embedding cache
Generating embeddings from images can take significant time (on
my machine between 100ms and 8s depending on the model). Although
we already cache the result of decoding these images, the embeddings
need to be regenerated every time. This is not necessary if we get
the same image over and over again, for example, during a conversation.
This currently uses a very small cache with a very simple algorithm
but it is easy to improve as is warranted.
* llama: catch up on patches
Carry forward solar-pro and cli-unicode patches
* runner.go: Don't re-allocate memory for every batch
We can reuse memory allocated from batch to batch since batch
size is fixed. This both saves the cost of reallocation as well
keeps the cache lines hot.
This results in a roughly 1% performance improvement for token
generation with Nvidia GPUs on Linux.
* runner.go: Default to classic input cache policy
The input cache as part of the go runner implemented a cache
policy that aims to maximize hit rate in both single and multi-
user scenarios. When there is a cache hit, the response is
very fast.
However, performance is actually slower when there is an input
cache miss due to worse GPU VRAM locality. This means that
performance is generally better overall for multi-user scenarios
(better input cache hit rate, locality was relatively poor already).
But worse for single users (input cache hit rate is about the same,
locality is now worse).
This defaults the policy back to the old one to avoid a regression
but keeps the new one available through an environment variable
OLLAMA_MULTIUSER_CACHE. This is left undocumented as the goal is
to improve this in the future to get the best of both worlds
without user configuration.
For inputs that result in cache misses, on Nvidia/Linux this
change improves performance by 31% for prompt processing and
13% for token generation.
* runner.go: Increase size of response channel
Generally the CPU can easily keep up with handling reponses that
are generated but there's no reason not to let generation continue
and handle things in larger batches if needed.
* llama: Add CI to verify all vendored changes have patches (#7066)
Make sure we don't accidentally merge changes in the vendored code
that aren't also reflected in the patches.
* llama: adjust clip patch for mingw utf-16 (#7065)
* llama: adjust clip patch for mingw utf-16
* llama: ensure static linking of runtime libs
Avoid runtime dependencies on non-standard libraries
* runner.go: Enable llamafile (all platforms) and BLAS (Mac OS)
These are two features that are shown on llama.cpp's system info
that are currently different between the two runners. On my test
systems the performance difference is very small to negligible
but it is probably still good to equalize the features.
* llm: Don't add BOS/EOS for tokenize requests
This is consistent with what server.cpp currently does. It affects
things like token processing counts for embedding requests.
* runner.go: Don't cache prompts for embeddings
Our integration with server.cpp implicitly disables prompt caching
because it is not part of the JSON object being parsed, this makes
the Go runner behavior similarly.
Prompt caching has been seen to affect the results of text completions
on certain hardware. The results are not wrong either way but they
are non-deterministic. However, embeddings seem to be affected even
on hardware that does not show this behavior for completions. For
now, it is best to maintain consistency with the existing behavior.
* runner.go: Adjust debug log levels
Add system info printed at startup and quiet down noisier logging.
* llama: fix compiler flag differences (#7082)
Adjust the flags for the new Go server to more closely match the
generate flow
* llama: refine developer docs (#7121)
* llama: doc and example clean up (#7122)
* llama: doc and example clean up
* llama: Move new dockerfile into llama dir
Temporary home until we fully transition to the Go server
* llama: runner doc cleanup
* llama.go: Add description for Tokenize error case
---------
Co-authored-by: Jesse Gross <jesse@ollama.com>
Co-authored-by: Daniel Hiltgen <daniel@ollama.com>
Co-authored-by: Daniel Hiltgen <dhiltgen@users.noreply.github.com>
2024-10-08 15:53:54 +00:00
|
|
|
#cgo darwin,amd64,avx2 CFLAGS: -DGGML_USE_ACCELERATE -DACCELERATE_NEW_LAPACK -DACCELERATE_LAPACK_ILP64
|
|
|
|
#cgo darwin,amd64,avx2 CXXFLAGS: -DGGML_USE_ACCELERATE -DACCELERATE_NEW_LAPACK -DACCELERATE_LAPACK_ILP64
|
|
|
|
#cgo darwin,amd64,avx2 LDFLAGS: -framework Accelerate
|
|
|
|
#cgo linux CFLAGS: -D_GNU_SOURCE
|
|
|
|
#cgo linux CXXFLAGS: -D_GNU_SOURCE
|
|
|
|
#cgo linux,arm64 LDFLAGS: -L${SRCDIR}/build/Linux/arm64
|
|
|
|
#cgo linux,amd64 LDFLAGS: -L${SRCDIR}/build/Linux/amd64
|
|
|
|
#cgo windows CFLAGS: -Wno-discarded-qualifiers
|
|
|
|
#cgo windows LDFLAGS: -lmsvcrt -static-libstdc++ -static-libgcc -static
|
|
|
|
#cgo windows,arm64 LDFLAGS: -L${SRCDIR}/build/Windows/arm64
|
|
|
|
#cgo windows,amd64 LDFLAGS: -L${SRCDIR}/build/Windows/amd64
|
|
|
|
#cgo avx CFLAGS: -mavx
|
|
|
|
#cgo avx CXXFLAGS: -mavx
|
|
|
|
#cgo avx2 CFLAGS: -mavx2 -mfma -mf16c
|
|
|
|
#cgo avx2 CXXFLAGS: -mavx2 -mfma -mf16c
|
|
|
|
#cgo cuda CFLAGS: -fPIE -DGGML_USE_CUDA -DGGML_CUDA_DMMV_X=32 -DGGML_CUDA_PEER_MAX_BATCH_SIZE=128 -DGGML_CUDA_MMV_Y=1
|
|
|
|
#cgo cuda CXXFLAGS: -fPIE -DGGML_USE_CUDA -DGGML_CUDA_DMMV_X=32 -DGGML_CUDA_PEER_MAX_BATCH_SIZE=128 -DGGML_CUDA_MMV_Y=1
|
|
|
|
#cgo rocm CFLAGS: -DGGML_USE_CUDA -DGGML_USE_HIPBLAS -DGGML_CUDA_DMMV_X=32 -DGGML_CUDA_PEER_MAX_BATCH_SIZE=128 -DGGML_CUDA_MMV_Y=1 -D__HIP_PLATFORM_AMD__=1 -D__HIP_ROCclr__=1
|
|
|
|
#cgo rocm CXXFLAGS: -DGGML_USE_CUDA -DGGML_USE_HIPBLAS -DGGML_CUDA_DMMV_X=32 -DGGML_CUDA_PEER_MAX_BATCH_SIZE=128 -DGGML_CUDA_MMV_Y=1 -D__HIP_PLATFORM_AMD__=1 -D__HIP_ROCclr__=1
|
|
|
|
#cgo rocm LDFLAGS: -L${SRCDIR} -lggml_rocm -lhipblas -lamdhip64 -lrocblas
|
|
|
|
#cgo cuda_v11 LDFLAGS: -lggml_cuda_v11 -L/usr/local/cuda-11/lib64
|
|
|
|
#cgo cuda_v12 LDFLAGS: -lggml_cuda_v12 -L/usr/local/cuda-12/lib64
|
|
|
|
#cgo windows,cuda LDFLAGS: -lcuda -lcudart -lcublas -lcublasLt
|
|
|
|
#cgo windows,rocm LDFLAGS: -lggml_rocm -lhipblas -lamdhip64 -lrocblas
|
|
|
|
#cgo linux,cuda LDFLAGS: -lcuda -lcudart -lcublas -lcublasLt -lpthread -ldl -lrt -lresolv
|
|
|
|
#cgo linux,rocm LDFLAGS: -L/opt/rocm/lib -lpthread -ldl -lrt -lresolv
|
|
|
|
|
|
|
|
#include <stdlib.h>
|
|
|
|
#include "llama.h"
|
|
|
|
#include "clip.h"
|
|
|
|
#include "llava.h"
|
|
|
|
#include "sampling_ext.h"
|
|
|
|
|
|
|
|
bool llamaProgressCallback(float progress, void *user_data);
|
|
|
|
*/
|
|
|
|
import "C"
|
|
|
|
|
|
|
|
import (
|
|
|
|
_ "embed"
|
|
|
|
"errors"
|
|
|
|
"fmt"
|
|
|
|
"runtime"
|
|
|
|
"runtime/cgo"
|
|
|
|
"strings"
|
|
|
|
"unsafe"
|
|
|
|
)
|
|
|
|
|
|
|
|
var CpuFeatures = ""
|
|
|
|
|
|
|
|
func BackendInit() {
|
|
|
|
C.llama_backend_init()
|
|
|
|
}
|
|
|
|
|
|
|
|
func PrintSystemInfo() string {
|
|
|
|
return C.GoString(C.llama_print_system_info())
|
|
|
|
}
|
|
|
|
|
|
|
|
type ContextParams struct {
|
|
|
|
c C.struct_llama_context_params
|
|
|
|
}
|
|
|
|
|
|
|
|
func NewContextParams(numCtx int, batchSize int, numSeqMax int, threads int, flashAttention bool) ContextParams {
|
|
|
|
params := C.llama_context_default_params()
|
|
|
|
params.n_ctx = C.uint(numCtx)
|
|
|
|
params.n_batch = C.uint(batchSize)
|
|
|
|
params.n_seq_max = C.uint(numSeqMax)
|
|
|
|
params.n_threads = C.int(threads)
|
|
|
|
params.n_threads_batch = params.n_threads
|
|
|
|
params.embeddings = C.bool(true)
|
|
|
|
params.flash_attn = C.bool(flashAttention)
|
|
|
|
return ContextParams{c: params}
|
|
|
|
}
|
|
|
|
|
|
|
|
type Context struct {
|
|
|
|
c *C.struct_llama_context
|
|
|
|
numThreads int
|
|
|
|
}
|
|
|
|
|
|
|
|
func (c *Context) KvCacheClear() {
|
|
|
|
C.llama_kv_cache_clear(c.c)
|
|
|
|
}
|
|
|
|
|
|
|
|
func (c *Context) Decode(batch *Batch) error {
|
|
|
|
// Positive return values does not mean a fatal error, but rather a warning.
|
|
|
|
// 0 - success
|
|
|
|
// 1 - could not find a KV slot for the batch (try reducing the size of the batch or increase the context)
|
|
|
|
// < 0 - error
|
|
|
|
code := int(C.llama_decode(c.c, batch.c))
|
|
|
|
|
|
|
|
if code < 0 {
|
|
|
|
return fmt.Errorf("llama_decode failed with code %d", code)
|
|
|
|
}
|
|
|
|
|
|
|
|
if code > 0 {
|
|
|
|
return fmt.Errorf("could not find a KV slot for the batch - try reducing the size of the batch or increase the context. code: %d", code)
|
|
|
|
}
|
|
|
|
|
|
|
|
return nil
|
|
|
|
}
|
|
|
|
|
|
|
|
func (c *Context) Model() *Model {
|
|
|
|
return &Model{c: C.llama_get_model(c.c)}
|
|
|
|
}
|
|
|
|
|
|
|
|
func (c *Context) GetLogitsIth(i int) []float32 {
|
|
|
|
return unsafe.Slice((*float32)(unsafe.Pointer(C.llama_get_logits_ith(c.c, C.int(i)))), c.Model().NumVocab())
|
|
|
|
}
|
|
|
|
|
|
|
|
func (c *Context) SampleTokenGreedy(logits []float32) int {
|
|
|
|
candidates := (*C.struct_llama_token_data)(C.malloc(C.size_t(len(logits)) * C.size_t(unsafe.Sizeof(C.struct_llama_token_data{}))))
|
|
|
|
defer C.free(unsafe.Pointer(candidates))
|
|
|
|
|
|
|
|
for i, logit := range logits {
|
|
|
|
ptr := (*C.struct_llama_token_data)(unsafe.Pointer(uintptr(unsafe.Pointer(candidates)) + uintptr(i)*unsafe.Sizeof(C.struct_llama_token_data{})))
|
|
|
|
ptr.id = C.int(i)
|
|
|
|
ptr.logit = C.float(logit)
|
|
|
|
ptr.p = 0.0
|
|
|
|
}
|
|
|
|
|
|
|
|
return int(C.llama_sample_token_greedy(c.c, &C.llama_token_data_array{
|
|
|
|
data: candidates,
|
|
|
|
size: C.size_t(len(logits)),
|
|
|
|
sorted: C.bool(false),
|
|
|
|
}))
|
|
|
|
}
|
|
|
|
|
|
|
|
func (c *Context) KvCacheSeqAdd(seqId int, p0 int, p1 int, delta int) {
|
|
|
|
C.llama_kv_cache_seq_add(c.c, C.int(seqId), C.int(p0), C.int(p1), C.int(delta))
|
|
|
|
}
|
|
|
|
|
|
|
|
func (c *Context) KvCacheSeqRm(seqId int, p0 int, p1 int) bool {
|
|
|
|
return bool(C.llama_kv_cache_seq_rm(c.c, C.int(seqId), C.int(p0), C.int(p1)))
|
|
|
|
}
|
|
|
|
|
|
|
|
func (c *Context) KvCacheSeqCp(srcSeqId int, dstSeqId int, p0 int, p1 int) {
|
|
|
|
C.llama_kv_cache_seq_cp(c.c, C.int(srcSeqId), C.int(dstSeqId), C.int(p0), C.int(p1))
|
|
|
|
}
|
|
|
|
|
|
|
|
// Get the embeddings for a sequence id
|
|
|
|
func (c *Context) GetEmbeddingsSeq(seqId int) []float32 {
|
|
|
|
embeddings := unsafe.Pointer(C.llama_get_embeddings_seq(c.c, C.int(seqId)))
|
|
|
|
if embeddings == nil {
|
|
|
|
return nil
|
|
|
|
}
|
|
|
|
|
|
|
|
return unsafe.Slice((*float32)(embeddings), c.Model().NEmbd())
|
|
|
|
}
|
|
|
|
|
|
|
|
func (c *Context) GetEmbeddingsIth(i int) []float32 {
|
|
|
|
return unsafe.Slice((*float32)(unsafe.Pointer(C.llama_get_embeddings_ith(c.c, C.int32_t(i)))), c.Model().NEmbd())
|
|
|
|
}
|
|
|
|
|
|
|
|
type ModelParams struct {
|
|
|
|
NumGpuLayers int
|
|
|
|
MainGpu int
|
|
|
|
UseMmap bool
|
|
|
|
UseMlock bool
|
|
|
|
TensorSplit []float32
|
|
|
|
Progress func(float32)
|
|
|
|
VocabOnly bool
|
|
|
|
}
|
|
|
|
|
|
|
|
//export llamaProgressCallback
|
|
|
|
func llamaProgressCallback(progress C.float, userData unsafe.Pointer) C.bool {
|
|
|
|
handle := *(*cgo.Handle)(userData)
|
|
|
|
callback := handle.Value().(func(float32))
|
|
|
|
callback(float32(progress))
|
|
|
|
return true
|
|
|
|
}
|
|
|
|
|
|
|
|
func LoadModelFromFile(modelPath string, params ModelParams) *Model {
|
|
|
|
cparams := C.llama_model_default_params()
|
|
|
|
cparams.n_gpu_layers = C.int(params.NumGpuLayers)
|
|
|
|
cparams.main_gpu = C.int32_t(params.MainGpu)
|
|
|
|
cparams.use_mmap = C.bool(params.UseMmap)
|
|
|
|
cparams.use_mlock = C.bool(params.UseMlock)
|
|
|
|
cparams.vocab_only = C.bool(params.VocabOnly)
|
|
|
|
|
|
|
|
if len(params.TensorSplit) > 0 {
|
|
|
|
tensorSplitData := ¶ms.TensorSplit[0]
|
|
|
|
|
|
|
|
var tensorSplitPin runtime.Pinner
|
|
|
|
tensorSplitPin.Pin(tensorSplitData)
|
|
|
|
defer tensorSplitPin.Unpin()
|
|
|
|
|
|
|
|
cparams.tensor_split = (*C.float)(unsafe.Pointer(tensorSplitData))
|
|
|
|
}
|
|
|
|
|
|
|
|
if params.Progress != nil {
|
|
|
|
handle := cgo.NewHandle(params.Progress)
|
|
|
|
defer handle.Delete()
|
|
|
|
|
|
|
|
var handlePin runtime.Pinner
|
|
|
|
handlePin.Pin(&handle)
|
|
|
|
defer handlePin.Unpin()
|
|
|
|
|
|
|
|
cparams.progress_callback = C.llama_progress_callback(C.llamaProgressCallback)
|
|
|
|
cparams.progress_callback_user_data = unsafe.Pointer(&handle)
|
|
|
|
}
|
|
|
|
|
|
|
|
return &Model{c: C.llama_load_model_from_file(C.CString(modelPath), cparams)}
|
|
|
|
}
|
|
|
|
|
|
|
|
func FreeModel(model *Model) {
|
|
|
|
C.llama_free_model(model.c)
|
|
|
|
}
|
|
|
|
|
|
|
|
func NewContextWithModel(model *Model, params ContextParams) *Context {
|
|
|
|
return &Context{
|
|
|
|
c: C.llama_new_context_with_model(model.c, params.c),
|
|
|
|
numThreads: int(params.c.n_threads),
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
func (m *Model) NumVocab() int {
|
|
|
|
return int(C.llama_n_vocab(m.c))
|
|
|
|
}
|
|
|
|
|
|
|
|
func (m *Model) TokenIsEog(token int) bool {
|
|
|
|
return bool(C.llama_token_is_eog(m.c, C.llama_token(token)))
|
|
|
|
}
|
|
|
|
|
|
|
|
func (m *Model) AddBOSToken() bool {
|
|
|
|
return bool(C.llama_add_bos_token(m.c))
|
|
|
|
}
|
|
|
|
|
|
|
|
func (m *Model) ApplyLoraFromFile(context *Context, loraPath string, scale float32, threads int) error {
|
|
|
|
cLoraPath := C.CString(loraPath)
|
|
|
|
defer C.free(unsafe.Pointer(cLoraPath))
|
|
|
|
|
|
|
|
loraAdapter := C.llama_lora_adapter_init(m.c, cLoraPath)
|
|
|
|
|
|
|
|
err := -1
|
|
|
|
if loraAdapter != nil {
|
|
|
|
err = int(C.llama_lora_adapter_set(context.c, loraAdapter, C.float(scale)))
|
|
|
|
}
|
|
|
|
if err != 0 {
|
|
|
|
return errors.New("error applying lora from file")
|
|
|
|
}
|
|
|
|
|
|
|
|
return nil
|
|
|
|
}
|
|
|
|
|
|
|
|
type Batch struct {
|
|
|
|
c C.struct_llama_batch
|
|
|
|
batchSize int
|
|
|
|
embedSize int
|
|
|
|
}
|
|
|
|
|
|
|
|
// Creates a new batch for either word tokens if embed is 0 or
|
|
|
|
// image embeddings if embed is specified. Batches cannot contain
|
|
|
|
// both types at the same time
|
|
|
|
func NewBatch(nTokens int, embed int, maxSeq int) *Batch {
|
|
|
|
return &Batch{
|
|
|
|
c: C.llama_batch_init(C.int(nTokens), C.int(embed), C.int(maxSeq)),
|
|
|
|
batchSize: nTokens,
|
|
|
|
embedSize: embed,
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
func (b *Batch) NumTokens() int {
|
|
|
|
return int(b.c.n_tokens)
|
|
|
|
}
|
|
|
|
|
|
|
|
func (b *Batch) IsEmbedding() bool {
|
|
|
|
return b.embedSize != 0
|
|
|
|
}
|
|
|
|
|
|
|
|
// Add adds either a token or an image embedding to the batch depending on the type
|
|
|
|
// when the batch was initialized. The other argument will be ignored. Adds to the
|
|
|
|
// batch with the given position for the given sequence ids, and optionally instructs
|
|
|
|
// to include logits.
|
|
|
|
func (b *Batch) Add(token int, embed []float32, pos int, seqIds []int, logits bool) {
|
|
|
|
if !b.IsEmbedding() {
|
|
|
|
unsafe.Slice(b.c.token, b.batchSize)[b.c.n_tokens] = C.llama_token(token)
|
|
|
|
} else {
|
|
|
|
copy(unsafe.Slice((*float32)(b.c.embd), b.batchSize*b.embedSize)[int(b.c.n_tokens)*b.embedSize:], embed)
|
|
|
|
}
|
|
|
|
unsafe.Slice(b.c.pos, b.batchSize)[b.c.n_tokens] = C.llama_pos(pos)
|
|
|
|
unsafe.Slice(b.c.n_seq_id, b.batchSize)[b.c.n_tokens] = C.int(len(seqIds))
|
|
|
|
|
|
|
|
for i, s := range seqIds {
|
|
|
|
unsafe.Slice((unsafe.Slice(b.c.seq_id, b.batchSize)[b.c.n_tokens]), C.int(len(seqIds)))[i] = C.int32_t(s)
|
|
|
|
}
|
|
|
|
|
|
|
|
if logits {
|
|
|
|
unsafe.Slice(b.c.logits, b.batchSize)[b.c.n_tokens] = 1
|
|
|
|
}
|
|
|
|
|
|
|
|
b.c.n_tokens += 1
|
|
|
|
}
|
|
|
|
|
|
|
|
func (b *Batch) Clear() {
|
|
|
|
b.c.n_tokens = 0
|
|
|
|
}
|
|
|
|
|
|
|
|
func (b *Batch) Free() {
|
|
|
|
b.batchSize = 0
|
|
|
|
C.llama_batch_free(b.c)
|
|
|
|
}
|
|
|
|
|
|
|
|
type Model struct {
|
|
|
|
c *C.struct_llama_model
|
|
|
|
}
|
|
|
|
|
|
|
|
func (m *Model) TokenToPiece(token int) string {
|
|
|
|
tokenLen := 12
|
|
|
|
buf := make([]byte, tokenLen)
|
|
|
|
tokenLen = int(C.llama_token_to_piece(
|
|
|
|
m.c,
|
|
|
|
C.int32_t(token),
|
|
|
|
(*C.char)(unsafe.Pointer(&buf[0])),
|
|
|
|
C.int32_t(tokenLen),
|
|
|
|
C.int32_t(0),
|
|
|
|
C.bool(true),
|
|
|
|
))
|
|
|
|
if tokenLen < 0 {
|
|
|
|
tokenLen = -tokenLen
|
|
|
|
|
|
|
|
buf = make([]byte, tokenLen)
|
|
|
|
C.llama_token_to_piece(
|
|
|
|
m.c,
|
|
|
|
C.int32_t(token),
|
|
|
|
(*C.char)(unsafe.Pointer(&buf[0])),
|
|
|
|
C.int32_t(tokenLen),
|
|
|
|
C.int32_t(0),
|
|
|
|
C.bool(true),
|
|
|
|
)
|
|
|
|
}
|
|
|
|
return strings.TrimRight(string(buf), "\x00")
|
|
|
|
}
|
|
|
|
|
|
|
|
func (m *Model) Tokenize(text string, addSpecial bool, parseSpecial bool) ([]int, error) {
|
|
|
|
maxTokens := len(text) + 2
|
|
|
|
cTokens := make([]C.llama_token, maxTokens)
|
|
|
|
cText := C.CString(text)
|
|
|
|
defer C.free(unsafe.Pointer(cText))
|
|
|
|
|
|
|
|
result := C.llama_tokenize(
|
|
|
|
m.c,
|
|
|
|
cText,
|
|
|
|
C.int32_t(len(text)),
|
|
|
|
&cTokens[0],
|
|
|
|
C.int32_t(maxTokens),
|
|
|
|
C.bool(addSpecial),
|
|
|
|
C.bool(parseSpecial),
|
|
|
|
)
|
|
|
|
|
|
|
|
// if the result is negative, reallocate and retry with the correct buffer size
|
|
|
|
if result < 0 {
|
|
|
|
maxTokens = int(-result)
|
|
|
|
cTokens = make([]C.llama_token, maxTokens)
|
|
|
|
result = C.llama_tokenize(
|
|
|
|
m.c,
|
|
|
|
cText,
|
|
|
|
C.int32_t(len(text)),
|
|
|
|
&cTokens[0],
|
|
|
|
C.int32_t(maxTokens),
|
|
|
|
C.bool(addSpecial),
|
|
|
|
C.bool(parseSpecial),
|
|
|
|
)
|
|
|
|
if result < 0 {
|
|
|
|
return nil, fmt.Errorf("tokenization failed, required %d tokens", -result)
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
tokens := make([]int, result)
|
|
|
|
for i := range result {
|
|
|
|
tokens[i] = int(cTokens[i])
|
|
|
|
}
|
|
|
|
|
|
|
|
return tokens, nil
|
|
|
|
}
|
|
|
|
|
|
|
|
func (m *Model) NEmbd() int {
|
|
|
|
return int(C.llama_n_embd(m.c))
|
|
|
|
}
|
|
|
|
|
|
|
|
func Quantize(infile, outfile string, ftype uint32) error {
|
|
|
|
cinfile := C.CString(infile)
|
|
|
|
defer C.free(unsafe.Pointer(cinfile))
|
|
|
|
|
|
|
|
coutfile := C.CString(outfile)
|
|
|
|
defer C.free(unsafe.Pointer(coutfile))
|
|
|
|
|
|
|
|
params := C.llama_model_quantize_default_params()
|
|
|
|
params.nthread = -1
|
|
|
|
params.ftype = ftype
|
|
|
|
|
|
|
|
if rc := C.llama_model_quantize(cinfile, coutfile, ¶ms); rc != 0 {
|
|
|
|
return fmt.Errorf("llama_model_quantize: %d", rc)
|
|
|
|
}
|
|
|
|
|
|
|
|
return nil
|
|
|
|
}
|
|
|
|
|
|
|
|
// llava
|
|
|
|
type ClipContext struct {
|
|
|
|
c *C.struct_clip_ctx
|
|
|
|
}
|
|
|
|
|
|
|
|
func NewClipContext(modelPath string) *ClipContext {
|
|
|
|
mp := C.CString(modelPath)
|
|
|
|
defer C.free(unsafe.Pointer(mp))
|
|
|
|
cc := C.clip_model_load(mp, 1)
|
|
|
|
return &ClipContext{c: cc}
|
|
|
|
}
|
|
|
|
|
|
|
|
func (c *ClipContext) Free() {
|
|
|
|
C.clip_free(c.c)
|
|
|
|
}
|
|
|
|
|
|
|
|
func NewLlavaImageEmbed(llamaContext *Context, clipContext *ClipContext, data []byte) [][]float32 {
|
|
|
|
c := C.llava_image_embed_make_with_bytes(clipContext.c, C.int(llamaContext.numThreads), (*C.uchar)(unsafe.Pointer(&data[0])), C.int(len(data)))
|
|
|
|
|
|
|
|
numTokens := int(c.n_image_pos)
|
|
|
|
numEmbed := llamaContext.Model().NEmbd()
|
|
|
|
|
|
|
|
s := unsafe.Slice((*float32)(c.embed), numEmbed*numTokens)
|
|
|
|
|
|
|
|
embed := make([][]float32, numTokens)
|
|
|
|
rows := make([]float32, len(s))
|
|
|
|
copy(rows, s)
|
|
|
|
|
|
|
|
for i := range embed {
|
|
|
|
embed[i] = rows[i*numEmbed : (i+1)*numEmbed]
|
|
|
|
}
|
|
|
|
|
|
|
|
C.llava_image_embed_free(c)
|
|
|
|
|
|
|
|
return embed
|
|
|
|
}
|
|
|
|
|
|
|
|
// sampling
|
|
|
|
// TODO: this is a temporary wrapper to allow calling C++ code from CGo
|
|
|
|
type SamplingContext struct {
|
|
|
|
c *C.struct_llama_sampling_context
|
|
|
|
}
|
|
|
|
|
|
|
|
type SamplingParams struct {
|
|
|
|
TopK int
|
|
|
|
TopP float32
|
|
|
|
MinP float32
|
|
|
|
TfsZ float32
|
|
|
|
TypicalP float32
|
|
|
|
Temp float32
|
|
|
|
RepeatLastN int
|
|
|
|
PenaltyRepeat float32
|
|
|
|
PenaltyFreq float32
|
|
|
|
PenaltyPresent float32
|
|
|
|
Mirostat int
|
|
|
|
MirostatTau float32
|
|
|
|
MirostatEta float32
|
|
|
|
PenalizeNl bool
|
|
|
|
Seed uint32
|
|
|
|
Grammar string
|
|
|
|
}
|
|
|
|
|
|
|
|
func NewSamplingContext(params SamplingParams) *SamplingContext {
|
|
|
|
var cparams C.struct_llama_sampling_cparams
|
|
|
|
cparams.top_k = C.int32_t(params.TopK)
|
|
|
|
cparams.top_p = C.float(params.TopP)
|
|
|
|
cparams.min_p = C.float(params.MinP)
|
|
|
|
cparams.tfs_z = C.float(params.TfsZ)
|
|
|
|
cparams.typical_p = C.float(params.TypicalP)
|
|
|
|
cparams.temp = C.float(params.Temp)
|
|
|
|
cparams.penalty_last_n = C.int32_t(params.RepeatLastN)
|
|
|
|
cparams.penalty_repeat = C.float(params.PenaltyRepeat)
|
|
|
|
cparams.penalty_freq = C.float(params.PenaltyFreq)
|
|
|
|
cparams.penalty_present = C.float(params.PenaltyFreq)
|
|
|
|
cparams.mirostat = C.int32_t(params.Mirostat)
|
|
|
|
cparams.mirostat_tau = C.float(params.MirostatTau)
|
|
|
|
cparams.mirostat_eta = C.float(params.MirostatEta)
|
|
|
|
cparams.penalize_nl = C.bool(params.PenalizeNl)
|
|
|
|
cparams.seed = C.uint32_t(params.Seed)
|
|
|
|
|
|
|
|
grammar := C.CString(params.Grammar)
|
|
|
|
defer C.free(unsafe.Pointer(grammar))
|
|
|
|
|
|
|
|
cparams.grammar = grammar
|
|
|
|
context := &SamplingContext{c: C.llama_sampling_cinit(&cparams)}
|
|
|
|
runtime.SetFinalizer(context, func(s *SamplingContext) { C.llama_sampling_cfree(s.c) })
|
|
|
|
|
|
|
|
return context
|
|
|
|
}
|
|
|
|
|
|
|
|
func (s *SamplingContext) Reset() {
|
|
|
|
C.llama_sampling_creset(s.c)
|
|
|
|
}
|
|
|
|
|
|
|
|
func (s *SamplingContext) Sample(ctxMain *Context, ctxConfig *Context, idx int) int {
|
|
|
|
// TODO (jmorganca): handle nil for all args
|
|
|
|
if ctxConfig == nil {
|
|
|
|
return int(C.llama_sampling_csample(s.c, ctxMain.c, nil, C.int(idx)))
|
|
|
|
}
|
|
|
|
|
|
|
|
return int(C.llama_sampling_csample(s.c, ctxMain.c, ctxConfig.c, C.int(idx)))
|
|
|
|
}
|
|
|
|
|
|
|
|
func (s *SamplingContext) Accept(ctxMain *Context, id int, applyGrammar bool) {
|
|
|
|
C.llama_sampling_caccept(s.c, ctxMain.c, C.llama_token(id), C.bool(applyGrammar))
|
|
|
|
}
|