Skip to main content

Browse the archive

Staging
v0.5.1
https://github.com/python/cpython
09 December 2020, 11:06:31 UTC
Revision 6c004b40f9d51872d848981ef1a18bb08c2dfc42 authored by Miro Hrončok on 08 December 2017, 21:34:44 UTC, committed by larryhastings on 08 December 2017, 21:34:44 UTC 
bpo-30657: Fix CVE-2017-1000158 (#4758)
 
Fixes possible integer overflow in PyBytes_DecodeEscape.

Co-Authored-By: Jay Bosamiya <jaybosamiya@gmail.com>
1 parent 8b11e8d
Raw File
Tip revision: 6c004b40f9d51872d848981ef1a18bb08c2dfc42 authored by Miro Hrončok on 08 December 2017, 21:34:44 UTC
bpo-30657: Fix CVE-2017-1000158 (#4758)
Tip revision: 6c004b4
rotatingtree.h 
/* "Rotating trees" (Armin Rigo)
 *
 * Google "splay trees" for the general idea.
 *
 * It's a dict-like data structure that works best when accesses are not
 * random, but follow a strong pattern.  The one implemented here is for
 * access patterns where the same small set of keys is looked up over
 * and over again, and this set of keys evolves slowly over time.
 */

#include <stdlib.h>

#define EMPTY_ROTATING_TREE       ((rotating_node_t *)NULL)

typedef struct rotating_node_s rotating_node_t;
typedef int (*rotating_tree_enum_fn) (rotating_node_t *node, void *arg);

struct rotating_node_s {
	void *key;
	rotating_node_t *left;
	rotating_node_t *right;
};

void RotatingTree_Add(rotating_node_t **root, rotating_node_t *node);
rotating_node_t* RotatingTree_Get(rotating_node_t **root, void *key);
int RotatingTree_Enum(rotating_node_t *root, rotating_tree_enum_fn enumfn,
		      void *arg);
back to top