|
|
|
/*
|
|
|
|
* Copyright (c) 2009-2021, Google LLC
|
|
|
|
* All rights reserved.
|
|
|
|
*
|
|
|
|
* Redistribution and use in source and binary forms, with or without
|
|
|
|
* modification, are permitted provided that the following conditions are met:
|
|
|
|
* * Redistributions of source code must retain the above copyright
|
|
|
|
* notice, this list of conditions and the following disclaimer.
|
|
|
|
* * Redistributions in binary form must reproduce the above copyright
|
|
|
|
* notice, this list of conditions and the following disclaimer in the
|
|
|
|
* documentation and/or other materials provided with the distribution.
|
|
|
|
* * Neither the name of Google LLC nor the
|
|
|
|
* names of its contributors may be used to endorse or promote products
|
|
|
|
* derived from this software without specific prior written permission.
|
|
|
|
*
|
|
|
|
* THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
|
|
|
|
* AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
|
|
|
|
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
|
|
|
|
* ARE DISCLAIMED. IN NO EVENT SHALL Google LLC BE LIABLE FOR ANY DIRECT,
|
|
|
|
* INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES
|
|
|
|
* (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;
|
|
|
|
* LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND
|
|
|
|
* ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
|
|
|
|
* (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS
|
|
|
|
* SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
|
|
|
|
*/
|
|
|
|
|
|
|
|
#ifndef UPB_COLLECTIONS_MAP_H_
|
|
|
|
#define UPB_COLLECTIONS_MAP_H_
|
|
|
|
|
|
|
|
#include "upb/base/descriptor_constants.h"
|
|
|
|
#include "upb/collections/message_value.h"
|
|
|
|
#include "upb/mem/arena.h"
|
|
|
|
|
|
|
|
// Must be last.
|
|
|
|
#include "upb/port/def.inc"
|
|
|
|
|
|
|
|
#ifdef __cplusplus
|
|
|
|
extern "C" {
|
|
|
|
#endif
|
|
|
|
|
|
|
|
// Creates a new map on the given arena with the given key/value size.
|
|
|
|
UPB_API upb_Map* upb_Map_New(upb_Arena* a, upb_CType key_type,
|
|
|
|
upb_CType value_type);
|
|
|
|
|
|
|
|
// Returns the number of entries in the map.
|
|
|
|
UPB_API size_t upb_Map_Size(const upb_Map* map);
|
|
|
|
|
|
|
|
// Stores a value for the given key into |*val| (or the zero value if the key is
|
|
|
|
// not present). Returns whether the key was present. The |val| pointer may be
|
|
|
|
// NULL, in which case the function tests whether the given key is present.
|
|
|
|
UPB_API bool upb_Map_Get(const upb_Map* map, upb_MessageValue key,
|
|
|
|
upb_MessageValue* val);
|
|
|
|
|
|
|
|
// Removes all entries in the map.
|
|
|
|
UPB_API void upb_Map_Clear(upb_Map* map);
|
|
|
|
|
|
|
|
typedef enum {
|
|
|
|
kUpb_MapInsertStatus_Inserted = 0,
|
|
|
|
kUpb_MapInsertStatus_Replaced = 1,
|
|
|
|
kUpb_MapInsertStatus_OutOfMemory = 2,
|
|
|
|
} upb_MapInsertStatus;
|
|
|
|
|
|
|
|
// Sets the given key to the given value, returning whether the key was inserted
|
|
|
|
// or replaced. If the key was inserted, then any existing iterators will be
|
|
|
|
// invalidated.
|
|
|
|
UPB_API upb_MapInsertStatus upb_Map_Insert(upb_Map* map, upb_MessageValue key,
|
|
|
|
upb_MessageValue val,
|
|
|
|
upb_Arena* arena);
|
|
|
|
|
|
|
|
// Sets the given key to the given value. Returns false if memory allocation
|
|
|
|
// failed. If the key is newly inserted, then any existing iterators will be
|
|
|
|
// invalidated.
|
|
|
|
UPB_API_INLINE bool upb_Map_Set(upb_Map* map, upb_MessageValue key,
|
|
|
|
upb_MessageValue val, upb_Arena* arena) {
|
|
|
|
return upb_Map_Insert(map, key, val, arena) !=
|
|
|
|
kUpb_MapInsertStatus_OutOfMemory;
|
|
|
|
}
|
|
|
|
|
|
|
|
// Deletes this key from the table. Returns true if the key was present.
|
|
|
|
// If present and |val| is non-NULL, stores the deleted value.
|
|
|
|
UPB_API bool upb_Map_Delete(upb_Map* map, upb_MessageValue key,
|
|
|
|
upb_MessageValue* val);
|
|
|
|
|
|
|
|
// (DEPRECATED and going away soon. Do not use.)
|
|
|
|
UPB_INLINE bool upb_Map_Delete2(upb_Map* map, upb_MessageValue key,
|
|
|
|
upb_MessageValue* val) {
|
|
|
|
return upb_Map_Delete(map, key, val);
|
|
|
|
}
|
|
|
|
|
|
|
|
// Map iteration:
|
|
|
|
//
|
|
|
|
// size_t iter = kUpb_Map_Begin;
|
|
|
|
// upb_MessageValue key, val;
|
|
|
|
// while (upb_Map_Next(map, &key, &val, &iter)) {
|
|
|
|
// ...
|
|
|
|
// }
|
|
|
|
|
|
|
|
#define kUpb_Map_Begin ((size_t)-1)
|
|
|
|
|
|
|
|
// Advances to the next entry. Returns false if no more entries are present.
|
|
|
|
// Otherwise returns true and populates both *key and *value.
|
|
|
|
UPB_API bool upb_Map_Next(const upb_Map* map, upb_MessageValue* key,
|
|
|
|
upb_MessageValue* val, size_t* iter);
|
|
|
|
|
Added a new dynamic tree shaking model to upb, with the intention of removing the old model once YouTube has migrated.
The `kUpb_DecodeOption_ExperimentalAllowUnlinked` flag to the decoder will enable the new behavior. When that flag is not passed, tree shaking with the old model will still be possible.
"Dynamic tree shaking" in upb is a feature that allows messages to be parsed even if the MiniTables have not been fully linked. Unlinked sub-message fields can be parsed by preserving their data in the unknown fields. If the application later discovers that the message field is actually needed, the MiniTable can be patched to properly link that field, and existing message instances can "promote" the data from the unknown fields to an actual message of the correct type.
Before this change, dynamic tree shaking stored unparsed message data in the unknown fields of the *parent*. In effect, we were treating the field as if it did not exist at all. This meant that parsing an unlinked field did not affect the hasbits or oneof cases of the parent, nor did it create a `upb_Array` or `upb_Map` for array/map fields. Only when a message was linked and promoted did any of these things occur.
While this model had some amount of conceptual simplicity, it caused significant problems with oneofs. When multiple fields inside a single oneof are parsed from the wire, order matters, because later oneof fields must overwrite earlier ones. Dynamic tree shaking can mean that some fields in a oneof are linked while others are not. It is essential that we preserve this ordering semantic even when dynamic tree shaking is being used, but it is difficult to do if the oneof's data can be split between linked fields (which have been reified into parsed field data) and unlinked fields (whose data lives in the unknown fields of the parent).
To solve this problem, this CL changes the representation for unlinked fields. Instead of being placed in the parent's unknown fields, we create an actual message instance for each unlinked message we parse, but we use a placeholder "empty message" MiniTable as the message's type. All of the message's data will therefore be placed into the "empty message's" unknown fields. But unlike before, this "empty message" is actually present according to the hasbits, oneof case, and `upb_Array`/`upb_Map` of the parent. This means that all of the oneof presence logic works as normal.
Since the MiniTable can be patched at any time, we need a bit in the message instance itself to signal whether a pointer to a sub-message is an "empty message" or not. When dynamic tree shaking is in use, all users must be capable of recognizing an empty message and acting accordingly (promoting, etc) even if the MiniTable itself says that the field is linked.
Because dynamic tree shaking imposes this extra requirement on users, we require that users pass an extra option to the decoder to allow parsing of unlinked sub-messages. Many existing users of upb (Ruby, PHP, Python, etc) will always have fully-linked MiniTables, so there is no reason for them to add extra logic to handle empty messages. By omitting the `kUpb_DecodeOption_ExperimentalAllowUnlinked` option, they will be relieved of the duty to check the tagged pointer that would indicate an empty, unlinked message.
For existing users of dynamic tree shaking, there are three main changes:
1. The APIs in message/promote.h have changed, and users will need to update to the new interfaces.
2. The model for maps has changed slightly. Before, we required that map entries always had their values linked; for dynamic tree shaking to apply to maps, we required that the *entry* was left unlinked, not the entry's value. In the new model, that is reversed: map entries must always be linked, but a map entry's value can be unlinked.
3. The presence model for unlinked fields has changed. Unlinked fields will now register as "present" from the perspective of hasbits, oneof cases, and array/map entries. Users must test the tagged pointer to know if a message is of the correct, linked type or whether it is a placeholder "empty" message. There is a new function `upb_Message_GetTaggedMessagePtr()`, as well as a new accessor `upb_MessageValue.tagged_msg_val` that can be used to read and test the tagged pointer directly.
PiperOrigin-RevId: 535288031
2 years ago
|
|
|
// Sets the value for the entry pointed to by iter.
|
|
|
|
// WARNING: this does not currently work for string values!
|
|
|
|
UPB_API void upb_Map_SetEntryValue(upb_Map* map, size_t iter,
|
|
|
|
upb_MessageValue val);
|
|
|
|
|
|
|
|
// DEPRECATED iterator, slated for removal.
|
|
|
|
|
|
|
|
/* Map iteration:
|
|
|
|
*
|
|
|
|
* size_t iter = kUpb_Map_Begin;
|
|
|
|
* while (upb_MapIterator_Next(map, &iter)) {
|
|
|
|
* upb_MessageValue key = upb_MapIterator_Key(map, iter);
|
|
|
|
* upb_MessageValue val = upb_MapIterator_Value(map, iter);
|
|
|
|
* }
|
|
|
|
*/
|
|
|
|
|
|
|
|
// Advances to the next entry. Returns false if no more entries are present.
|
|
|
|
bool upb_MapIterator_Next(const upb_Map* map, size_t* iter);
|
|
|
|
|
|
|
|
// Returns true if the iterator still points to a valid entry, or false if the
|
|
|
|
// iterator is past the last element. It is an error to call this function with
|
|
|
|
// kUpb_Map_Begin (you must call next() at least once first).
|
|
|
|
bool upb_MapIterator_Done(const upb_Map* map, size_t iter);
|
|
|
|
|
|
|
|
// Returns the key and value for this entry of the map.
|
|
|
|
upb_MessageValue upb_MapIterator_Key(const upb_Map* map, size_t iter);
|
|
|
|
upb_MessageValue upb_MapIterator_Value(const upb_Map* map, size_t iter);
|
|
|
|
|
|
|
|
#ifdef __cplusplus
|
|
|
|
} /* extern "C" */
|
|
|
|
#endif
|
|
|
|
|
|
|
|
#include "upb/port/undef.inc"
|
|
|
|
|
|
|
|
#endif /* UPB_COLLECTIONS_MAP_H_ */
|