| 25 |
|
|
| 26 |
BBS_user_priv BBS_priv; |
BBS_user_priv BBS_priv; |
| 27 |
|
|
| 28 |
int setpriv(BBS_user_priv *p_priv, int sid, int priv, int is_favor) |
inline static int search_priv(BBS_user_priv *p_priv, int sid, int *p_offset) |
| 29 |
{ |
{ |
| 30 |
int left = 0; |
int left = 0; |
| 31 |
int right = p_priv->s_count - 1; |
int right = p_priv->s_count - 1; |
| 32 |
int mid = 0; |
int mid = 0; |
| 33 |
|
|
|
if (sid == 0) |
|
|
{ |
|
|
p_priv->g_priv = priv; |
|
|
return 0; |
|
|
} |
|
|
|
|
| 34 |
while (left < right) |
while (left < right) |
| 35 |
{ |
{ |
| 36 |
mid = (left + right) / 2; |
mid = (left + right) / 2; |
| 45 |
} |
} |
| 46 |
} |
} |
| 47 |
|
|
| 48 |
if (left == right && sid == p_priv->s_priv_list[left].sid) // found |
*p_offset = left; |
| 49 |
|
|
| 50 |
|
return (left == right && sid == p_priv->s_priv_list[left].sid); |
| 51 |
|
} |
| 52 |
|
|
| 53 |
|
int setpriv(BBS_user_priv *p_priv, int sid, int priv, int is_favor) |
| 54 |
|
{ |
| 55 |
|
int offset; |
| 56 |
|
int i; |
| 57 |
|
|
| 58 |
|
if (sid == 0) |
| 59 |
|
{ |
| 60 |
|
p_priv->g_priv = priv; |
| 61 |
|
return 0; |
| 62 |
|
} |
| 63 |
|
|
| 64 |
|
if (search_priv(p_priv, sid, &offset)) //found |
| 65 |
{ |
{ |
| 66 |
p_priv->s_priv_list[left].s_priv = priv; |
p_priv->s_priv_list[offset].s_priv = priv; |
| 67 |
p_priv->s_priv_list[left].is_favor = is_favor; |
p_priv->s_priv_list[offset].is_favor = is_favor; |
| 68 |
return 0; |
return 0; |
| 69 |
} |
} |
| 70 |
|
|
| 75 |
} |
} |
| 76 |
|
|
| 77 |
// move items at [left, p_priv->s_count - 1] to [left + 1, p_priv->s_count] |
// move items at [left, p_priv->s_count - 1] to [left + 1, p_priv->s_count] |
| 78 |
for (right = p_priv->s_count - 1; right >= left; right--) |
for (i = p_priv->s_count - 1; i >= offset; i--) |
| 79 |
{ |
{ |
| 80 |
p_priv->s_priv_list[right + 1] = p_priv->s_priv_list[right]; |
p_priv->s_priv_list[i + 1] = p_priv->s_priv_list[i]; |
| 81 |
} |
} |
| 82 |
p_priv->s_count++; |
p_priv->s_count++; |
| 83 |
|
|
| 84 |
// insert new item at offset left |
// insert new item at offset left |
| 85 |
p_priv->s_priv_list[left].sid = sid; |
p_priv->s_priv_list[offset].sid = sid; |
| 86 |
p_priv->s_priv_list[left].s_priv = priv; |
p_priv->s_priv_list[offset].s_priv = priv; |
| 87 |
p_priv->s_priv_list[left].is_favor = is_favor; |
p_priv->s_priv_list[offset].is_favor = is_favor; |
| 88 |
|
|
| 89 |
return 0; |
return 0; |
| 90 |
} |
} |
| 91 |
|
|
| 92 |
int getpriv(BBS_user_priv *p_priv, int sid, int *p_is_favor) |
int getpriv(BBS_user_priv *p_priv, int sid, int *p_is_favor) |
| 93 |
{ |
{ |
| 94 |
int left = 0; |
int offset; |
|
int right = p_priv->s_count - 1; |
|
|
int mid = 0; |
|
|
|
|
|
while (left < right) |
|
|
{ |
|
|
mid = (left + right) / 2; |
|
|
|
|
|
if (sid <= p_priv->s_priv_list[mid].sid) |
|
|
{ |
|
|
right = mid; |
|
|
} |
|
|
else |
|
|
{ |
|
|
left = mid + 1; |
|
|
} |
|
|
} |
|
|
|
|
|
if (left == right && sid == p_priv->s_priv_list[left].sid) // found |
|
|
{ |
|
|
*p_is_favor = p_priv->s_priv_list[left].is_favor; |
|
|
return p_priv->s_priv_list[left].s_priv; |
|
|
} |
|
| 95 |
|
|
| 96 |
if (sid != 0) |
if (search_priv(p_priv, sid, &offset)) //found |
| 97 |
{ |
{ |
| 98 |
*p_is_favor = 0; |
*p_is_favor = p_priv->s_priv_list[offset].is_favor; |
| 99 |
|
return p_priv->s_priv_list[offset].s_priv; |
| 100 |
} |
} |
| 101 |
|
|
| 102 |
|
*p_is_favor = 0; |
| 103 |
return (sid >= 0 ? p_priv->g_priv : S_NONE); |
return (sid >= 0 ? p_priv->g_priv : S_NONE); |
| 104 |
} |
} |
| 105 |
|
|