overlap
int overlap;
overlap = (VGLMouseXpos + VGLMouseAndMask->VXsize) - x;
overlap = (x + width) - VGLMouseXpos;
if (overlap <= 0)
overlap = (VGLMouseYpos + VGLMouseAndMask->VYsize) - y;
overlap = (y + hight) - VGLMouseYpos;
return overlap > 0;
if (overlap(base, end, ap->base, ap->base + ap->size)) {
if (!overlap(base, end, ap->base, ap->base + ap->size))
bool overlap;
overlap = hn_rndis_check_overlap(pktinfo_off, pktinfo_len,
if (__predict_false(overlap)) {
u8 overlap: 1;
u8 overlap : 1;
attrs->replay_esn.overlap = sa_entry->esn_state.overlap;
MLX5_SET(ipsec_obj, obj, esn_overlap, attrs->replay_esn.overlap);
MLX5_SET(ipsec_obj, obj, esn_overlap, attrs->replay_esn.overlap);
sa_entry->esn_state.overlap = 0;
sa_entry->esn_state.overlap = 1;
int overlap;
overlap = 0;
overlap |= OVERLAP_NONE;
overlap |= OVERLAP_SUBSET;
overlap |= OVERLAP_START;
overlap |= OVERLAP_END;
return (overlap);
int overlap;
overlap = OVERLAP_NONE;
overlap = wdat_compare_region(res1, newres);
if (overlap == OVERLAP_NONE)
if (overlap == OVERLAP_SUBSET)
if ((overlap & OVERLAP_START)) {
if ((overlap & OVERLAP_END)) {
if (overlap > OVERLAP_NONE)
goto overlap;
overlap:
LIST_FOREACH(overlap, &state->ls_pending, lf_link) {
if (!lf_blocks(lock, overlap))
error = lf_add_edge(lock, overlap);
struct lockf_entry *overlap;
LIST_FOREACH(overlap, &state->ls_pending, lf_link) {
if (!lf_blocks(lock, overlap))
error = lf_add_edge(overlap, lock);
struct lockf_entry *overlap, *lf;
overlap = LIST_FIRST(&state->ls_active);
ovcase = lf_findoverlap(&overlap, lock, SELF);
lf_print("", overlap);
LIST_REMOVE(overlap, lf_link);
lf_update_dependancies(state, overlap, TRUE,
lf_free_lock(overlap);
lf_split(state, overlap, lock, &granted);
lf = LIST_NEXT(overlap, lf_link);
LIST_REMOVE(overlap, lf_link);
lf_update_dependancies(state, overlap, TRUE,
lf_free_lock(overlap);
overlap = lf;
lf_set_end(state, overlap, lock->lf_start - 1,
overlap = LIST_NEXT(overlap, lf_link);
lf_set_start(state, overlap, lock->lf_end + 1,
struct lockf_entry *overlap;
overlap = LIST_FIRST(&state->ls_active);
if (overlap == NOLOCKF)
struct lockf_entry *overlap;
LIST_FOREACH(overlap, &state->ls_active, lf_link) {
if (overlap->lf_start > lock->lf_end)
if (!lf_blocks(lock, overlap))
return (overlap);
lf_findoverlap(struct lockf_entry **overlap, struct lockf_entry *lock, int type)
if ((*overlap) == NOLOCKF) {
while (*overlap) {
lf = *overlap;
*overlap = LIST_NEXT(lf, lf_link);
*overlap = LIST_NEXT(lf, lf_link);
struct lockf_entry *overlap;
LIST_FOREACH(overlap, &state->ls_active, lf_link) {
if (overlap->lf_start > lock->lf_end)
if (!lf_blocks(lock, overlap))
error = lf_add_edge(lock, overlap);
off_t overlap,Ss,lens;
overlap=(lastscan+lenf)-(scan-lenb);
for(i=0;i<overlap;i++) {
if(new[lastscan+lenf-overlap+i]==
old[lastpos+lenf-overlap+i]) s++;
lenf+=lens-overlap;
static char *overlap;
overlap[j] = 0;
overlap[j] = !dup;
overlap[j] = !dup;
if (!oflag || !overlap[n]) {
if (!oflag || !overlap[n]) {
if (!oflag || !overlap[n]) {
if (!oflag || !overlap[n]) {
if (!oflag || !overlap[n]) {
if (!oflag || !overlap[n]) {
q = reallocarray(overlap, newsz, 1);
overlap = q;
unsigned long overlap;
overlap = min(pch, svalue1) - max(pcl, svalue0);
if (overlap > 0) {
overlap * thetime / scale, overlap);
nl[j].time += overlap * thetime / scale;
struct mmio_rb_range *overlap;
overlap = RB_INSERT(mmio_rb_tree, rbt, new);
if (overlap != NULL) {
overlap->mr_base, overlap->mr_end,
new->mr_param.name, overlap->mr_param.name);