Lines Matching +defs:in +defs:tree

8  * Redistribution and use in source and binary forms, with or without
15  * Redistributions in binary form must reproduce the above copyright notice,
16  * this list of conditions and the following disclaimer in the documentation
59  *  in queries per second. */
63  *  in queries per second.
162 /** find or create element in domainlimit tree */
202 		log_err("duplicate element in domainlimit tree");
210 /** insert rate limit configuration into lookup tree */
242 /** find or create element in wait limit netblock tree */
244 wait_limit_netblock_findcreate(struct rbtree_type* tree, char* str)
257 	d = (struct wait_limit_netblock_info*)addr_tree_find(tree, &addr,
267 	if(!addr_tree_insert(tree, &d->node, &addr, addrlen, net)) {
268 		log_err("duplicate element in domainlimit tree");
276 /** insert wait limit information into lookup tree */
302 wait_limit_netblock_default(struct rbtree_type* tree, char* str, int limit)
305 	d = wait_limit_netblock_findcreate(tree, str);
477  *  set use_port to a non-0 number to use the port in
493 		struct sockaddr_in* in = (struct sockaddr_in*)addr;
494 		h = hashlittle(&in->sin_family, sizeof(in->sin_family), h);
496 			h = hashlittle(&in->sin_port, sizeof(in->sin_port), h);
498 		h = hashlittle(&in->sin_addr, INET_SIZE, h);
964 /** find data item in array, for write access, caller unlocks */
977 /** find data item in array for ip addresses */
990 /** create rate data item for name, number 1 in now */
1195 	/* ignore domain_limits because walk through tree is big */
1278 		rbtree_type* tree;
1286 			tree = &infra->wait_limits_cookie_netblock;
1287 		else	tree = &infra->wait_limits_netblock;
1288 		w = (struct wait_limit_netblock_info*)addr_tree_lookup(tree,