go.chromium.org/luci@v0.0.0-20240309015107-7cdc2e660f33/common/proto/protowalk/field_processor_cache.go

// Copyright 2022 The LUCI Authors.
//
// Licensed under the Apache License, Version 2.0 (the "License");
// you may not use this file except in compliance with the License.
// You may obtain a copy of the License at
//
//      http://www.apache.org/licenses/LICENSE-2.0
//
// Unless required by applicable law or agreed to in writing, software
// distributed under the License is distributed on an "AS IS" BASIS,
// WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
// See the License for the specific language governing permissions and
// limitations under the License.

package protowalk

import (
	"fmt"
	"reflect"
	"sync"

	"google.golang.org/protobuf/reflect/protoreflect"

	"go.chromium.org/luci/common/data/stringset"
)

// fieldProcessorSelectors maps from all the registered processors to an
// id, which can be used with registeredFieldProcessorsID to find the callback
// function and data type, and will be used internally in caches.
var (
	fieldProcessorSelectors   map[reflect.Type]FieldSelector
	fieldProcessorSelectorsMu sync.RWMutex
)

// fieldProcessorCacheKey is the key for the global field processor cache
type fieldProcessorCacheKey struct {
	message    protoreflect.FullName
	processorT reflect.Type
}

// fieldProcessorCacheValue is a single cache value for the global field
// processor cache.
type fieldProcessorCacheValue struct {
	// fieldNum is the field 'tag number' in the proto message for the
	// corresponding field. We store this instead of the FieldDescriptor because
	// it's only 4 bytes, rather than a 16+byte interface.
	fieldNum protoreflect.FieldNumber

	// All cacheable attributes
	ProcessAttr
	recurseAttr
}

// fieldProcessorCacheEntry corresponds to a single Message+FieldProcessor
// combination.
//
// Each value is the combined result of asking FieldProcessor.ShouldProcess on the
// field, plus any recursion attribute (if this field is a Message (single,
// repeated or map)) which recursively contains fields which need to be
// processed by this FieldProcessor.
//
// This is always kept ordered by field number, and is immutable.
type fieldProcessorCacheEntry []fieldProcessorCacheValue

// globalFieldProcessorCache maps (Message+FieldProcessor) combinations to
// a (possibly empty) slice which indicates which fields need to be processed
// and/or recursed by the FieldProcessor.
var globalFieldProcessorCache = map[fieldProcessorCacheKey]fieldProcessorCacheEntry{}
var globalFieldProcessorCacheMu sync.RWMutex

// resetGlobalFieldProcessorCache is only used in tests.
func resetGlobalFieldProcessorCache() {
	globalFieldProcessorCacheMu.Lock()
	defer globalFieldProcessorCacheMu.Unlock()
	for k := range globalFieldProcessorCache {
		delete(globalFieldProcessorCache, k)
	}
}

type cacheEntryBuilder struct {
	ret fieldProcessorCacheEntry
	tmp map[protoreflect.FieldNumber]fieldProcessorCacheValue
}

func newCacheEntryBuilder() *cacheEntryBuilder {
	return &cacheEntryBuilder{
		ret: make(fieldProcessorCacheEntry, 0),
		tmp: map[protoreflect.FieldNumber]fieldProcessorCacheValue{},
	}
}

// generateCacheEntry returns the fieldProcessorCacheEntry for this
// message/processor combination.
//
// This will calculate and return the cache entry.
//
// If msg has recursive fields, we may not be able to get the final cache values
// for those fields until we get up one level, so use tmpRet to keep the temporary
// cache values for them.
func generateCacheEntry(msg protoreflect.MessageDescriptor, processor *procBundle, visitedSubMsgs stringset.Set, tmp map[string]*cacheEntryBuilder) *cacheEntryBuilder {
	fields := msg.Fields()
	msgName := string(msg.FullName())
	for f := 0; f < fields.Len(); f++ {
		finalRet := true
		field := fields.Get(f)
		value := fieldProcessorCacheValue{
			fieldNum:    field.Number(),
			ProcessAttr: processor.sel(field),
		}

		if !value.ProcessAttr.Valid() {
			panic(fmt.Errorf("(%T).ShouldProcess returned invalid ProcessAttr value: %d",
				processor, value.ProcessAttr))
		}

		if field.IsMap() {
			if mapVal := field.MapValue(); mapVal.Kind() == protoreflect.MessageKind {
				if len(setCacheEntry(mapVal.Message(), processor, visitedSubMsgs, tmp)) > 0 {
					switch field.MapKey().Kind() {
					case protoreflect.BoolKind:
						value.recurseAttr = recurseMapBool
					case protoreflect.Int32Kind, protoreflect.Int64Kind:
						value.recurseAttr = recurseMapInt
					case protoreflect.Uint32Kind, protoreflect.Uint64Kind:
						value.recurseAttr = recurseMapUint
					case protoreflect.StringKind:
						value.recurseAttr = recurseMapString
					}
				}
			}
		} else if field.Kind() == protoreflect.MessageKind {
			fldName := string(field.FullName())
			subMsgName := string(field.Message().FullName())
			if visitedSubMsgs.Add(fldName) {
				if len(setCacheEntry(field.Message(), processor, visitedSubMsgs, tmp)) > 0 {
					if field.IsList() {
						value.recurseAttr = recurseRepeated
					} else {
						value.recurseAttr = recurseOne
					}
				}
			} else {
				// Found a recursive message, for example
				// message Outer {
				//	 message Inner {
				//	 	 string value = 1;
				//	   Inner next = 2;
				//	 }
				//   Inner inner = 1;
				// }
				// And we're processing .inner.next.
				// We should not call setCacheEntry for it again because it will
				// get us to an infinite loop.
				// And it will reuse the cache entry for .inner, so we really don't
				// need to call setCacheEntry.
				finalRet = false
				if field.IsList() {
					value.recurseAttr = recurseRepeated
				} else {
					value.recurseAttr = recurseOne
				}

				for _, v := range tmp[subMsgName].ret {
					if v.ProcessAttr != ProcessNever {
						finalRet = true
						break
					}
				}
			}
		}

		// We want an entry in the cache if we have to process the field:
		//   * directly (i.e. processor applies directly to field), OR
		//   * recursively (i.e. the field is a message kind, and that
		//     message contains a field (or another recursion) that we
		//     must follow).
		if value.ProcessAttr != ProcessNever || value.recurseAttr != recurseNone {
			if bdr, ok := tmp[msgName]; ok {
				bdr.tmp[value.fieldNum] = value
				if finalRet {
					bdr.ret = append(bdr.ret, value)
					delete(bdr.tmp, value.fieldNum)
				}
			}
		}
	}
	return tmp[msgName]
}

// setCacheEntry will ensure that globalFieldProcessorCache is populated for
// `msg` for the given `processor`.
//
// Returns the entry for this message/processor combination.
func setCacheEntry(msg protoreflect.MessageDescriptor, processor *procBundle, visitedSubMsgs stringset.Set, tmp map[string]*cacheEntryBuilder) (ret fieldProcessorCacheEntry) {
	key := fieldProcessorCacheKey{
		message:    msg.FullName(),
		processorT: processor.proc,
	}

	globalFieldProcessorCacheMu.RLock()
	ret, ok := globalFieldProcessorCache[key]
	globalFieldProcessorCacheMu.RUnlock()
	if ok {
		return
	}

	if _, ok := tmp[string(msg.FullName())]; !ok {
		tmp[string(msg.FullName())] = newCacheEntryBuilder()
	}
	ceb := generateCacheEntry(msg, processor, visitedSubMsgs, tmp)
	if len(ceb.tmp) > 0 {
		// We haven't got the final values for some fields.
		// Do not set cache for now.
		return ceb.ret
	}

	if len(ceb.ret) == 0 {
		// The message doesn't need to be processed by the processor.
		return ceb.ret
	}

	ret = ceb.ret
	globalFieldProcessorCacheMu.Lock()
	if ce, ok := globalFieldProcessorCache[key]; !ok {
		globalFieldProcessorCache[key] = ret
	} else {
		ret = ce
	}
	globalFieldProcessorCacheMu.Unlock()

	return
}