view src/acldef.h @ 5415:95882472f2da

(rotate_right, rotate_left): Simplify total_length calculation. Minimize pointer dereferencing. (balance_an_interval): Remove recursive rebalancing. Rebalance precisely when imbalanced. If a rotation is done, rebalance only the node which may have become unbalanced. Iterate until the current node is balanced. (balance_possible_root_interval): New function. (balance_intervals): Move the interation into rebalance_an_interval. (balance_intervals_internal): New subroutine of balance_intervals. (split_interval_right, split_interval_left): Speed up by not checking LEAF_INTERVAL_P. (split_interval_right, split_interval_left, find_interval, adjust_intervals_for_insertion, graft_intervals_into_buffer): Add dynamic rebalancing anywhere a node may become unbalanced. (graft_intervals_into_buffer, copy_intervals): No longer any need to do a full rebalance as the tree stays balanced.

#define	ACL$K_LENGTH	12
#define	ACL$C_LENGTH	12
#define	ACL$C_FILE	1
#define	ACL$C_DEVICE	2
#define	ACL$C_JOBCTL_QUEUE	3
#define	ACL$C_COMMON_EF_CLUSTER	4
#define	ACL$C_LOGICAL_NAME_TABLE	5
#define	ACL$C_PROCESS	6
#define	ACL$C_GROUP_GLOBAL_SECTION	7
#define	ACL$C_SYSTEM_GLOBAL_SECTION	8
#define	ACL$C_ADDACLENT	1
#define	ACL$C_DELACLENT	2
#define	ACL$C_MODACLENT	3
#define	ACL$C_FNDACLENT	4
#define	ACL$C_FNDACETYP	5
#define	ACL$C_DELETEACL	6
#define	ACL$C_READACL	7
#define	ACL$C_ACLLENGTH	8
#define	ACL$C_READACE	9
#define	ACL$C_RLOCK_ACL	10
#define	ACL$C_WLOCK_ACL	11
#define	ACL$C_UNLOCK_ACL	12
#define	ACL$S_ADDACLENT	255
#define	ACL$S_DELACLENT	255
#define	ACL$S_MODACLENT	255
#define	ACL$S_FNDACLENT	255
#define	ACL$S_FNDACETYP	255
#define	ACL$S_DELETEACL	255
#define	ACL$S_READACL	512
#define	ACL$S_ACLLENGTH	4
#define	ACL$S_READACE	255
#define	ACL$S_RLOCK_ACL	4
#define	ACL$S_WLOCK_ACL	4
#define	ACL$S_UNLOCK_ACL	4
#define	ACL$S_ACLDEF	16
#define	ACL$L_FLINK	0
#define	ACL$L_BLINK	4
#define	ACL$W_SIZE	8
#define	ACL$B_TYPE	10
#define	ACL$L_LIST	12