1729 lines
43 KiB
C
1729 lines
43 KiB
C
#define MODULE_LOG_PREFIX "cccam"
|
|
|
|
#include "globals.h"
|
|
|
|
#if defined(MODULE_CCCAM) && defined(MODULE_CCCSHARE)
|
|
|
|
#include "module-cccam.h"
|
|
#include "module-cccam-data.h"
|
|
#include "module-cccshare.h"
|
|
#include "oscam-chk.h"
|
|
#include "oscam-client.h"
|
|
#include "oscam-lock.h"
|
|
#include "oscam-string.h"
|
|
#include "oscam-time.h"
|
|
#include "oscam-work.h"
|
|
|
|
extern uint32_t cfg_sidtab_generation;
|
|
|
|
static uint32_t cc_share_id = 0x64;
|
|
static LLIST *reported_carddatas_list[CAID_KEY];
|
|
static CS_MUTEX_LOCK cc_shares_lock;
|
|
|
|
static int32_t card_added_count;
|
|
static int32_t card_removed_count;
|
|
static int32_t card_dup_count;
|
|
static pthread_t share_updater_thread;
|
|
static bool share_updater_thread_active;
|
|
static bool share_updater_refresh;
|
|
|
|
int32_t card_valid_for_client(struct s_client *cl, struct cc_card *card);
|
|
int32_t flt = 0;
|
|
|
|
LLIST *get_cardlist(uint16_t caid, LLIST **list)
|
|
{
|
|
caid = (caid >> 8) % CAID_KEY;
|
|
if(!list[caid])
|
|
{ list[caid] = ll_create("card_list"); }
|
|
return list[caid];
|
|
}
|
|
|
|
LLIST **get_and_lock_sharelist(void)
|
|
{
|
|
cs_readlock(__func__, &cc_shares_lock);
|
|
return reported_carddatas_list;
|
|
}
|
|
|
|
void unlock_sharelist(void)
|
|
{
|
|
cs_readunlock(__func__, &cc_shares_lock);
|
|
}
|
|
|
|
void add_good_sids(struct s_sidtab *ptr, struct cc_card *card)
|
|
{
|
|
int32_t l;
|
|
for(l = 0; l < ptr->num_srvid; l++)
|
|
{
|
|
struct cc_srvid *srvid;
|
|
if(!cs_malloc(&srvid, sizeof(struct cc_srvid)))
|
|
{ return; }
|
|
srvid->sid = ptr->srvid[l];
|
|
srvid->chid = 0;
|
|
srvid->ecmlen = 0; // 0=undefined, also not used with "O" CCcam
|
|
|
|
if(!ll_contains_data(card->goodsids, srvid, sizeof(struct cc_srvid)))
|
|
{ ll_append(card->goodsids, srvid); }
|
|
else { NULLFREE(srvid);}
|
|
}
|
|
}
|
|
|
|
void add_bad_sids(struct s_sidtab *ptr, struct cc_card *card)
|
|
{
|
|
int32_t l;
|
|
for(l = 0; l < ptr->num_srvid; l++)
|
|
{
|
|
struct cc_srvid_block *srvid;
|
|
if(!cs_malloc(&srvid, sizeof(struct cc_srvid_block)))
|
|
{ return; }
|
|
srvid->sid = ptr->srvid[l];
|
|
srvid->chid = 0;
|
|
srvid->ecmlen = 0; // 0=undefined, also not used with "O" CCcam
|
|
srvid->blocked_till = 0;
|
|
|
|
if(!ll_contains_data(card->badsids, srvid, sizeof(struct cc_srvid_block)))
|
|
{ ll_append(card->badsids, srvid); }
|
|
else { NULLFREE(srvid); }
|
|
}
|
|
}
|
|
|
|
void add_good_bad_sids_by_rdr(struct s_reader *rdr, struct cc_card *card)
|
|
{
|
|
struct s_sidtab *ptr;
|
|
int32_t n, i;
|
|
for(n = 0, ptr = cfg.sidtab; ptr; ptr = ptr->next, n++)
|
|
{
|
|
if(rdr->sidtabs.ok & ((SIDTABBITS)1 << n))
|
|
{
|
|
for(i = 0; i < ptr->num_caid; i++)
|
|
{
|
|
if(ptr->caid[i] == card->caid)
|
|
{ add_good_sids(ptr, card); }
|
|
}
|
|
}
|
|
else if(rdr->sidtabs.no & ((SIDTABBITS)1 << n))
|
|
{
|
|
for(i = 0; i < ptr->num_caid; i++)
|
|
{
|
|
if(ptr->caid[i] == card->caid)
|
|
{ add_bad_sids(ptr, card); }
|
|
}
|
|
}
|
|
}
|
|
}
|
|
|
|
int32_t can_use_ext(struct cc_card *card)
|
|
{
|
|
if(card->card_type == CT_REMOTECARD)
|
|
{ return card->is_ext; }
|
|
|
|
if(card->sidtab)
|
|
{ return (card->sidtab->num_srvid > 0); }
|
|
else
|
|
{ return ll_count(card->goodsids) || ll_count(card->badsids); }
|
|
return 0;
|
|
}
|
|
|
|
int32_t write_card(struct cc_data *cc, uint8_t *buf, struct cc_card *card, int32_t add_own, int32_t ext, int32_t au_allowed, struct s_client *cl)
|
|
{
|
|
memset(buf, 0, CC_MAXMSGSIZE);
|
|
buf[0] = card->id >> 24;
|
|
buf[1] = card->id >> 16;
|
|
buf[2] = card->id >> 8;
|
|
buf[3] = card->id & 0xff;
|
|
buf[4] = card->remote_id >> 24;
|
|
buf[5] = card->remote_id >> 16;
|
|
buf[6] = card->remote_id >> 8;
|
|
buf[7] = card->remote_id & 0xFF;
|
|
buf[8] = card->caid >> 8;
|
|
buf[9] = card->caid & 0xff;
|
|
buf[10] = card->hop;
|
|
buf[11] = card->reshare;
|
|
if(au_allowed)
|
|
{ memcpy(buf + 12, card->hexserial, 8); }
|
|
|
|
// with cccam 2.2.0 we have assigned and rejected sids:
|
|
int32_t ofs = ext ? 23 : 21;
|
|
|
|
// write providers:
|
|
LL_ITER it = ll_iter_create(card->providers);
|
|
struct cc_provider *prov;
|
|
while((prov = ll_iter_next(&it)))
|
|
{
|
|
uint32_t prid = prov->prov;
|
|
buf[ofs + 0] = prid >> 16;
|
|
buf[ofs + 1] = prid >> 8;
|
|
buf[ofs + 2] = prid & 0xFF;
|
|
if(au_allowed)
|
|
{ memcpy(buf + ofs + 3, prov->sa, 4); }
|
|
buf[20]++;
|
|
ofs += 7;
|
|
}
|
|
|
|
// write sids only if cccam 2.2.x:
|
|
if(ext)
|
|
{
|
|
if(card->sidtab)
|
|
{
|
|
// good sids:
|
|
struct s_sidtab *ptr = card->sidtab;
|
|
int32_t l;
|
|
for(l = 0; l < ptr->num_srvid; l++)
|
|
{
|
|
buf[ofs + 0] = ptr->srvid[l] >> 8;
|
|
buf[ofs + 1] = ptr->srvid[l] & 0xFF;
|
|
ofs += 2;
|
|
buf[21]++; // nassign
|
|
if(buf[21] >= 240)
|
|
{ break; }
|
|
}
|
|
|
|
// bad sids:
|
|
int32_t n;
|
|
for(n = 0, ptr = cfg.sidtab; ptr; ptr = ptr->next, n++)
|
|
{
|
|
if((cl->sidtabs.no & ((SIDTABBITS)1 << n)) || (card->sidtabno & ((SIDTABBITS)1 << n)))
|
|
{
|
|
int32_t m;
|
|
int32_t ok_caid = 0;
|
|
for(m = 0; m < ptr->num_caid; m++) // search bad sids for this caid:
|
|
{
|
|
if(ptr->caid[m] == card->caid)
|
|
{
|
|
ok_caid = 1;
|
|
break;
|
|
}
|
|
}
|
|
if(ok_caid)
|
|
{
|
|
for(l = 0; l < ptr->num_srvid; l++)
|
|
{
|
|
buf[ofs + 0] = ptr->srvid[l] >> 8;
|
|
buf[ofs + 1] = ptr->srvid[l] & 0xFF;
|
|
ofs += 2;
|
|
buf[22]++; // nreject
|
|
if(buf[22] >= 240)
|
|
{ break; }
|
|
}
|
|
}
|
|
}
|
|
if(buf[22] >= 240)
|
|
{ break; }
|
|
}
|
|
|
|
}
|
|
else
|
|
{
|
|
// assigned sids:
|
|
it = ll_iter_create(card->goodsids);
|
|
struct cc_srvid *srvid;
|
|
struct cc_srvid_block *srvidblock;
|
|
while((srvid = ll_iter_next(&it)))
|
|
{
|
|
buf[ofs + 0] = srvid->sid >> 8;
|
|
buf[ofs + 1] = srvid->sid & 0xFF;
|
|
ofs += 2;
|
|
buf[21]++; // nassign
|
|
if(buf[21] >= 200)
|
|
{ break; }
|
|
}
|
|
|
|
// reject sids:
|
|
it = ll_iter_create(card->badsids);
|
|
while((srvidblock = ll_iter_next(&it)))
|
|
{
|
|
if(srvidblock->blocked_till > 0)
|
|
{
|
|
continue;
|
|
}
|
|
buf[ofs + 0] = srvidblock->sid >> 8;
|
|
buf[ofs + 1] = srvidblock->sid & 0xFF;
|
|
ofs += 2;
|
|
buf[22]++; // nreject
|
|
if(buf[22] >= 200)
|
|
{ break; }
|
|
}
|
|
}
|
|
}
|
|
|
|
// write remote nodes
|
|
int32_t nremote_ofs = ofs;
|
|
ofs++;
|
|
it = ll_iter_create(card->remote_nodes);
|
|
uint8_t *remote_node;
|
|
while((remote_node = ll_iter_next(&it)))
|
|
{
|
|
memcpy(buf + ofs, remote_node, 8);
|
|
ofs += 8;
|
|
buf[nremote_ofs]++;
|
|
}
|
|
if(add_own)
|
|
{
|
|
memcpy(buf + ofs, cc->node_id, 8);
|
|
ofs += 8;
|
|
buf[nremote_ofs]++;
|
|
}
|
|
return ofs;
|
|
}
|
|
|
|
static int32_t is_client_au_allowed(struct cc_card *card, struct s_client *cl)
|
|
{
|
|
if(!card || !card->origin_reader)
|
|
{
|
|
return 0;
|
|
}
|
|
|
|
if(!cl || !cl->aureader_list || !ll_count(cl->aureader_list))
|
|
{
|
|
return 0;
|
|
}
|
|
|
|
struct s_reader *rdr = NULL;
|
|
LL_ITER itr = ll_iter_create(cl->aureader_list);
|
|
while((rdr = ll_iter_next(&itr)))
|
|
{
|
|
if(rdr == card->origin_reader)
|
|
{
|
|
return 1;
|
|
}
|
|
}
|
|
|
|
return 0;
|
|
}
|
|
|
|
static int32_t send_card_to_client(struct cc_card *card, struct s_client *cl)
|
|
{
|
|
uint8_t buf[CC_MAXMSGSIZE];
|
|
|
|
if(!card_valid_for_client(cl, card))
|
|
{ return 0; }
|
|
|
|
int8_t usr_reshare = cl->account->cccreshare;
|
|
if(usr_reshare == -1)
|
|
{ usr_reshare = cfg.cc_reshare; }
|
|
|
|
int8_t ignorereshare = cl->account->cccignorereshare;
|
|
if(ignorereshare == -1)
|
|
{ ignorereshare = cfg.cc_ignore_reshare; }
|
|
|
|
int8_t reader_reshare = card->origin_reader ? card->rdr_reshare : usr_reshare;
|
|
if(reader_reshare == -1)
|
|
{ reader_reshare = cfg.cc_reshare; }
|
|
|
|
int8_t reshare = (reader_reshare < usr_reshare) ? reader_reshare : usr_reshare;
|
|
int8_t new_reshare;
|
|
if(card->card_type == CT_CARD_BY_SERVICE_USER)
|
|
{
|
|
new_reshare = usr_reshare;
|
|
}
|
|
else if(ignorereshare)
|
|
{
|
|
new_reshare = reshare;
|
|
}
|
|
else
|
|
{
|
|
new_reshare = card->reshare;
|
|
if(card->card_type == CT_REMOTECARD)
|
|
{ new_reshare--; }
|
|
if(new_reshare > reshare)
|
|
{ new_reshare = reshare; }
|
|
}
|
|
if(new_reshare < 0)
|
|
{ return 0; }
|
|
|
|
if(!card->id)
|
|
{ card->id = cc_share_id++; }
|
|
|
|
struct cc_data *cc = cl->cc;
|
|
int32_t is_ext = cc->cccam220 && can_use_ext(card);
|
|
int32_t len = write_card(cc, buf, card, 1, is_ext, is_client_au_allowed(card, cl), cl);
|
|
//buf[10] = card->hop-1;
|
|
buf[11] = new_reshare;
|
|
|
|
struct s_clientmsg *clientmsg;
|
|
if(cs_malloc(&clientmsg, sizeof(struct s_clientmsg)))
|
|
{
|
|
memcpy(clientmsg->msg, buf, len);
|
|
clientmsg->len = len;
|
|
clientmsg->cmd = is_ext ? MSG_NEW_CARD_SIDINFO : MSG_NEW_CARD;
|
|
add_job(cl, ACTION_CLIENT_SEND_MSG, clientmsg, sizeof(struct s_clientmsg));
|
|
}
|
|
return 1;
|
|
}
|
|
|
|
int32_t hide_card_to_client(struct cc_card *card, struct s_client *cl)
|
|
{
|
|
if(!card || !card->id)
|
|
{ return 0; }
|
|
|
|
uint8_t buf[4];
|
|
buf[0] = card->id >> 24;
|
|
buf[1] = card->id >> 16;
|
|
buf[2] = card->id >> 8;
|
|
buf[3] = card->id & 0xFF;
|
|
|
|
struct s_clientmsg *clientmsg;
|
|
struct cc_data *cc = cl->cc;
|
|
if(cc && (cl->typ == 'c') && !cl->kill && (get_module(cl)->num == R_CCCAM)) //CCCam-Client!
|
|
{
|
|
if(card_valid_for_client(cl, card))
|
|
{
|
|
if(cs_malloc(&clientmsg, sizeof(struct s_clientmsg)))
|
|
{
|
|
memcpy(clientmsg->msg, buf, sizeof(buf));
|
|
clientmsg->len = sizeof(buf);
|
|
clientmsg->cmd = MSG_CARD_REMOVED;
|
|
add_job(cl, ACTION_CLIENT_SEND_MSG, clientmsg, sizeof(struct s_clientmsg));
|
|
return 1;
|
|
}
|
|
}
|
|
}
|
|
return 0;
|
|
}
|
|
|
|
int32_t unhide_card_to_client(struct cc_card *card, struct s_client *cl)
|
|
{
|
|
return send_card_to_client(card, cl);
|
|
}
|
|
|
|
int32_t hidecards_card_valid_for_client(struct s_client *cl, struct cc_card *card)
|
|
{
|
|
return card_valid_for_client(cl, card);
|
|
}
|
|
|
|
int32_t send_card_to_all_clients(struct cc_card *card)
|
|
{
|
|
int32_t count = 0;
|
|
struct s_client *cl;
|
|
cs_readlock(__func__, &clientlist_lock);
|
|
for(cl = first_client; cl; cl = cl->next)
|
|
{
|
|
if(cl->cc && cl->typ == 'c' && !cl->kill && get_module(cl)->num == R_CCCAM) // CCCam-Client!
|
|
{
|
|
count += send_card_to_client(card, cl);
|
|
}
|
|
}
|
|
cs_readunlock(__func__, &clientlist_lock);
|
|
return count;
|
|
}
|
|
|
|
void send_remove_card_to_clients(struct cc_card *card)
|
|
{
|
|
if(!card || !card->id)
|
|
{ return; }
|
|
|
|
uint8_t buf[4];
|
|
buf[0] = card->id >> 24;
|
|
buf[1] = card->id >> 16;
|
|
buf[2] = card->id >> 8;
|
|
buf[3] = card->id & 0xFF;
|
|
|
|
struct s_client *cl;
|
|
struct s_clientmsg *clientmsg;
|
|
cs_readlock(__func__, &clientlist_lock);
|
|
for(cl = first_client; cl; cl = cl->next)
|
|
{
|
|
struct cc_data *cc = cl->cc;
|
|
if(cc && cl->typ == 'c' && !cl->kill && get_module(cl)->num == R_CCCAM) // CCCam-Client!
|
|
{
|
|
if(card_valid_for_client(cl, card))
|
|
{
|
|
if(cs_malloc(&clientmsg, sizeof(struct s_clientmsg)))
|
|
{
|
|
memcpy(clientmsg->msg, buf, sizeof(buf));
|
|
clientmsg->len = sizeof(buf);
|
|
clientmsg->cmd = MSG_CARD_REMOVED;
|
|
add_job(cl, ACTION_CLIENT_SEND_MSG, clientmsg, sizeof(struct s_clientmsg));
|
|
}
|
|
}
|
|
}
|
|
}
|
|
cs_readunlock(__func__, &clientlist_lock);
|
|
}
|
|
|
|
|
|
/**
|
|
* if idents defined on an cccam reader, the cards caid+provider are checked.
|
|
* return 1 a) if no ident defined b) card is in identlist
|
|
* 0 if card is not in identlist
|
|
*
|
|
* a card is in the identlist, if the cards caid is matching and mininum a provider is matching
|
|
**/
|
|
int32_t chk_ident(FTAB *ftab, struct cc_card *card)
|
|
{
|
|
|
|
int32_t j, k;
|
|
int32_t res = 1;
|
|
|
|
if(ftab && ftab->filts)
|
|
{
|
|
for(j = 0; j < ftab->nfilts; j++)
|
|
{
|
|
if(ftab->filts[j].caid)
|
|
{
|
|
res = 0;
|
|
if(ftab->filts[j].caid == card->caid) // caid matches!
|
|
{
|
|
|
|
int32_t nprids = ftab->filts[j].nprids;
|
|
if(!nprids) // No Provider ->Ok
|
|
{ return 1; }
|
|
|
|
|
|
LL_ITER it = ll_iter_create(card->providers);
|
|
struct cc_provider *prov;
|
|
|
|
while((prov = ll_iter_next(&it)))
|
|
{
|
|
for(k = 0; k < nprids; k++)
|
|
{
|
|
uint32_t prid = ftab->filts[j].prids[k];
|
|
if(prid == prov->prov) // Provider matches
|
|
{
|
|
return 1;
|
|
}
|
|
}
|
|
}
|
|
}
|
|
}
|
|
}
|
|
}
|
|
return res;
|
|
}
|
|
|
|
int32_t cc_clear_reported_carddata(LLIST *reported_carddatas, LLIST *except, int32_t send_removed)
|
|
{
|
|
int32_t i = 0;
|
|
LL_ITER it = ll_iter_create(reported_carddatas);
|
|
struct cc_card *card;
|
|
while((card = ll_iter_next(&it)))
|
|
{
|
|
struct cc_card *card2 = NULL;
|
|
if(except)
|
|
{
|
|
LL_ITER it2 = ll_iter_create(except);
|
|
while((card2 = ll_iter_next(&it2)))
|
|
{
|
|
if(card == card2)
|
|
{ break; }
|
|
}
|
|
}
|
|
|
|
if(!card2 && ll_iter_remove(&it)) // check result of ll_iter_remove, because another thread could removed it
|
|
{
|
|
if(send_removed)
|
|
{
|
|
cs_log_dbg(D_TRACE, "s-card removed: id %8X remoteid %8X caid %4X hop %d reshare %d originid %8X cardtype %d",
|
|
card->id, card->remote_id, card->caid, card->hop, card->reshare, card->origin_id, card->card_type);
|
|
|
|
send_remove_card_to_clients(card);
|
|
}
|
|
cc_free_card(card);
|
|
i++;
|
|
}
|
|
}
|
|
return i;
|
|
}
|
|
|
|
int32_t cc_free_reported_carddata(LLIST *reported_carddatas, LLIST *except, int32_t send_removed)
|
|
{
|
|
int32_t i = 0;
|
|
if(reported_carddatas)
|
|
{
|
|
i = cc_clear_reported_carddata(reported_carddatas, except, send_removed);
|
|
ll_destroy(&reported_carddatas);
|
|
}
|
|
return i;
|
|
}
|
|
|
|
int32_t card_valid_for_client(struct s_client *cl, struct cc_card *card)
|
|
{
|
|
|
|
// Check group:
|
|
if(card->grp && !(card->grp & cl->grp))
|
|
{ return 0; }
|
|
|
|
// Check idents:
|
|
if(!chk_ident(&cl->ftab, card))
|
|
{ return 0; }
|
|
|
|
// Check caids:
|
|
if(!chk_ctab(card->caid, &cl->ctab))
|
|
{ return 0; }
|
|
|
|
// Check reshare
|
|
if(card->card_type == CT_REMOTECARD)
|
|
{
|
|
int8_t ignorereshare = cl->account->cccignorereshare;
|
|
if(ignorereshare == -1) { ignorereshare = cfg.cc_ignore_reshare; }
|
|
if(!ignorereshare && !card->reshare)
|
|
{ return 0; }
|
|
}
|
|
|
|
// Check account maxhops:
|
|
if(cl->account->cccmaxhops < card->hop)
|
|
{ return 0; }
|
|
|
|
// Check remote node id, if card is from there, ignore it!
|
|
LL_ITER it = ll_iter_create(card->remote_nodes);
|
|
uint8_t *node;
|
|
struct cc_data *cc = cl->cc;
|
|
while((node = ll_iter_next(&it)))
|
|
{
|
|
if(!memcmp(node, cc->peer_node_id, 8))
|
|
{
|
|
return 0;
|
|
}
|
|
}
|
|
|
|
// Check Services:
|
|
if(ll_count(card->providers))
|
|
{
|
|
it = ll_iter_create(card->providers);
|
|
struct cc_provider *prov;
|
|
int8_t found = 0;
|
|
while((prov = ll_iter_next(&it)))
|
|
{
|
|
uint32_t prid = prov->prov;
|
|
if(chk_srvid_by_caid_prov(cl, card->caid, prid))
|
|
{
|
|
found = 1;
|
|
break;
|
|
}
|
|
}
|
|
if(!found) { return 0; }
|
|
}
|
|
else
|
|
{
|
|
if(!chk_srvid_by_caid_prov(cl, card->caid, 0))
|
|
{ return 0; }
|
|
}
|
|
|
|
// Check Card created by Service:
|
|
if(card->sidtab)
|
|
{
|
|
struct s_sidtab *ptr;
|
|
int32_t j;
|
|
int32_t ok = !cl->sidtabs.ok && !cl->sidtabs.no; // default valid if no positive services and no negative services
|
|
if(!ok)
|
|
{
|
|
if(!cl->sidtabs.ok) // no positive services, so ok by default if no negative found
|
|
{ ok = 1; }
|
|
|
|
for(j = 0, ptr = cfg.sidtab; ptr; ptr = ptr->next, j++)
|
|
{
|
|
if(ptr == card->sidtab)
|
|
{
|
|
if(cl->sidtabs.no & ((SIDTABBITS)1 << j))
|
|
{ return 0; }
|
|
if(cl->sidtabs.ok & ((SIDTABBITS)1 << j))
|
|
{ ok = 1; }
|
|
break;
|
|
}
|
|
}
|
|
}
|
|
if(!ok)
|
|
{ return 0; }
|
|
}
|
|
|
|
return 1;
|
|
}
|
|
|
|
uint32_t get_reader_prid(struct s_reader *rdr, int32_t j)
|
|
{
|
|
return b2i(3, &rdr->prid[j][1]);
|
|
}
|
|
//uint32_t get_reader_prid(struct s_reader *rdr, int32_t j) {
|
|
// uint32_t prid;
|
|
// if (!is_cascading_reader(rdr)) { // Real cardreaders have 4-byte Providers
|
|
// prid = b2i(4, &rdr->prid[j][0]);
|
|
// //prid = (rdr->prid[j][0] << 24) | (rdr->prid[j][1] << 16)
|
|
// // | (rdr->prid[j][2] << 8) | (rdr->prid[j][3] & 0xFF);
|
|
// } else { // Cascading/Network-reader 3-bytes Providers
|
|
// prid = b2i(3, &rdr->prid[j][0]);
|
|
// //prid = (rdr->prid[j][0] << 16) | (rdr->prid[j][1] << 8)
|
|
// // | (rdr->prid[j][2] & 0xFF);
|
|
//
|
|
// }
|
|
// return prid;
|
|
//}
|
|
|
|
void copy_good_sids(LLIST *dst, LLIST *src)
|
|
{
|
|
LL_ITER it_src = ll_iter_create(src);
|
|
LL_ITER it_dst = ll_iter_create(dst);
|
|
struct cc_srvid *srvid_src;
|
|
struct cc_srvid *srvid_dst;
|
|
while((srvid_src = ll_iter_next(&it_src)))
|
|
{
|
|
ll_iter_reset(&it_dst);
|
|
while((srvid_dst = ll_iter_next(&it_dst)))
|
|
{
|
|
if(sid_eq(srvid_src, srvid_dst))
|
|
{ break; }
|
|
}
|
|
if(!srvid_dst)
|
|
{
|
|
if(!cs_malloc(&srvid_dst, sizeof(struct cc_srvid)))
|
|
{ break; }
|
|
memcpy(srvid_dst, srvid_src, sizeof(struct cc_srvid));
|
|
ll_iter_insert(&it_dst, srvid_dst);
|
|
}
|
|
}
|
|
}
|
|
|
|
void copy_bad_sids(LLIST *dst, LLIST *src)
|
|
{
|
|
LL_ITER it_src = ll_iter_create(src);
|
|
LL_ITER it_dst = ll_iter_create(dst);
|
|
struct cc_srvid_block *srvid_src;
|
|
struct cc_srvid_block *srvid_dst;
|
|
while((srvid_src = ll_iter_next(&it_src)))
|
|
{
|
|
ll_iter_reset(&it_dst);
|
|
while((srvid_dst = ll_iter_next(&it_dst)))
|
|
{
|
|
if(sid_eq_bb(srvid_src, srvid_dst))
|
|
{ break; }
|
|
}
|
|
if(!srvid_dst)
|
|
{
|
|
if(!cs_malloc(&srvid_dst, sizeof(struct cc_srvid_block)))
|
|
{ break; }
|
|
memcpy(srvid_dst, srvid_src, sizeof(struct cc_srvid_block));
|
|
ll_iter_insert(&it_dst, srvid_dst);
|
|
}
|
|
}
|
|
}
|
|
|
|
int32_t add_card_providers(struct cc_card *dest_card, struct cc_card *card, int32_t copy_remote_nodes)
|
|
{
|
|
int32_t modified = 0;
|
|
|
|
// 1. Copy nonexisting providers, ignore double:
|
|
struct cc_provider *prov_info;
|
|
LL_ITER it_src = ll_iter_create(card->providers);
|
|
LL_ITER it_dst = ll_iter_create(dest_card->providers);
|
|
|
|
struct cc_provider *provider;
|
|
while((provider = ll_iter_next(&it_src)))
|
|
{
|
|
ll_iter_reset(&it_dst);
|
|
while((prov_info = ll_iter_next(&it_dst)))
|
|
{
|
|
if(prov_info->prov == provider->prov)
|
|
{ break; }
|
|
}
|
|
if(!prov_info)
|
|
{
|
|
struct cc_provider *prov_new;
|
|
if(!cs_malloc(&prov_new, sizeof(struct cc_provider)))
|
|
{ break; }
|
|
memcpy(prov_new, provider, sizeof(struct cc_provider));
|
|
ll_iter_insert(&it_dst, prov_new);
|
|
modified = 1;
|
|
}
|
|
}
|
|
|
|
if(copy_remote_nodes)
|
|
{
|
|
// 2. Copy nonexisting remote_nodes, ignoring existing:
|
|
it_src = ll_iter_create(card->remote_nodes);
|
|
it_dst = ll_iter_create(dest_card->remote_nodes);
|
|
uint8_t *remote_node;
|
|
uint8_t *remote_node2;
|
|
while((remote_node = ll_iter_next(&it_src)))
|
|
{
|
|
ll_iter_reset(&it_dst);
|
|
while((remote_node2 = ll_iter_next(&it_dst)))
|
|
{
|
|
if(memcmp(remote_node, remote_node2, 8) == 0)
|
|
{ break; }
|
|
}
|
|
if(!remote_node2)
|
|
{
|
|
uint8_t *remote_node_new;
|
|
if(!cs_malloc(&remote_node_new, 8))
|
|
{ break; }
|
|
memcpy(remote_node_new, remote_node, 8);
|
|
ll_iter_insert(&it_dst, remote_node_new);
|
|
modified = 1;
|
|
}
|
|
}
|
|
}
|
|
return modified;
|
|
}
|
|
|
|
#define TIMEOUT_SECONDS 3600
|
|
|
|
void set_card_timeout(struct cc_card *card)
|
|
{
|
|
card->timeout = time(NULL) + TIMEOUT_SECONDS + ((rand() & 0xff) - 128) * 2;
|
|
}
|
|
|
|
struct cc_card *create_card(struct cc_card *card)
|
|
{
|
|
struct cc_card *card2;
|
|
if(!cs_malloc(&card2, sizeof(struct cc_card)))
|
|
{ return NULL; }
|
|
if(card)
|
|
{ memcpy(card2, card, sizeof(struct cc_card)); }
|
|
else
|
|
{ memset(card2, 0, sizeof(struct cc_card)); }
|
|
card2->providers = ll_create("providers");
|
|
card2->badsids = ll_create("badsids");
|
|
card2->goodsids = ll_create("goodsids");
|
|
card2->remote_nodes = ll_create("remote_nodes");
|
|
|
|
if(card)
|
|
{
|
|
copy_good_sids(card2->goodsids, card->goodsids);
|
|
copy_bad_sids(card2->badsids, card->badsids);
|
|
card2->id = 0;
|
|
}
|
|
else
|
|
{ set_card_timeout(card2); }
|
|
|
|
return card2;
|
|
}
|
|
|
|
struct cc_card *create_card2(struct s_reader *rdr, int32_t j, uint16_t caid, uint8_t reshare)
|
|
{
|
|
|
|
struct cc_card *card = create_card(NULL);
|
|
if(!card)
|
|
{ return NULL; }
|
|
card->remote_id = (rdr ? (rdr->cc_id << 16) : 0x7F7F8000) | j;
|
|
card->caid = caid;
|
|
card->reshare = reshare;
|
|
card->origin_reader = rdr;
|
|
if(rdr)
|
|
{
|
|
card->grp = rdr->grp;
|
|
card->rdr_reshare = rdr->cc_reshare > -1 ? rdr->cc_reshare : cfg.cc_reshare; //copy reshare because reader could go offline
|
|
card->sidtabno = rdr->sidtabs.no;
|
|
card->hop = rdr->cc_hop;
|
|
}
|
|
else { card->rdr_reshare = reshare; }
|
|
return card;
|
|
}
|
|
|
|
/**
|
|
* num_same_providers checks if card1 has exactly the same providers as card2
|
|
* returns same provider count
|
|
**/
|
|
int32_t num_same_providers(struct cc_card *card1, struct cc_card *card2)
|
|
{
|
|
|
|
int32_t found = 0;
|
|
|
|
LL_ITER it1 = ll_iter_create(card1->providers);
|
|
LL_ITER it2 = ll_iter_create(card2->providers);
|
|
|
|
struct cc_provider *prov1, *prov2;
|
|
|
|
while((prov1 = ll_iter_next(&it1)))
|
|
{
|
|
|
|
ll_iter_reset(&it2);
|
|
while((prov2 = ll_iter_next(&it2)))
|
|
{
|
|
if(prov1->prov == prov2->prov)
|
|
{
|
|
found++;
|
|
break;
|
|
}
|
|
|
|
}
|
|
}
|
|
return found;
|
|
}
|
|
|
|
/**
|
|
* equal_providers checks if card1 has exactly the same providers as card2
|
|
* returns 1=equal 0=different
|
|
**/
|
|
int32_t equal_providers(struct cc_card *card1, struct cc_card *card2)
|
|
{
|
|
|
|
if(ll_count(card1->providers) != ll_count(card2->providers))
|
|
{ return 0; }
|
|
if(ll_count(card1->providers) == 0)
|
|
{ return 1; }
|
|
|
|
LL_ITER it1 = ll_iter_create(card1->providers);
|
|
LL_ITER it2 = ll_iter_create(card2->providers);
|
|
|
|
struct cc_provider *prov1, *prov2;
|
|
|
|
while((prov1 = ll_iter_next(&it1)))
|
|
{
|
|
|
|
ll_iter_reset(&it2);
|
|
while((prov2 = ll_iter_next(&it2)))
|
|
{
|
|
if(prov1->prov == prov2->prov)
|
|
{
|
|
break;
|
|
}
|
|
|
|
}
|
|
if(!prov2) { break; }
|
|
}
|
|
return (prov1 == NULL);
|
|
}
|
|
|
|
int32_t is_au_card(struct cc_card *card)
|
|
{
|
|
if(card && card->origin_reader)
|
|
{ return !card->origin_reader->audisabled && cc_UA_valid(card->hexserial); }
|
|
return 0;
|
|
}
|
|
|
|
void merge_sids(struct cc_card *carddst, struct cc_card *cardsrc)
|
|
{
|
|
LL_ITER it;
|
|
struct cc_srvid *srvid;
|
|
struct cc_srvid_block *srvidb;
|
|
|
|
int32_t goodSidCountSrc = ll_count(cardsrc->goodsids);
|
|
int32_t goodSidCountDst = ll_count(carddst->goodsids);
|
|
|
|
if(goodSidCountDst == 0)
|
|
{
|
|
// remove sid blocks good+notbad from src
|
|
it = ll_iter_create(cardsrc->goodsids);
|
|
while((srvid = ll_iter_next(&it)))
|
|
{
|
|
if(!is_sid_blocked(cardsrc, srvid))
|
|
{ remove_sid_block(carddst, srvid); }
|
|
}
|
|
}
|
|
else
|
|
{
|
|
if(goodSidCountSrc == 0)
|
|
{
|
|
// del goods from dst
|
|
ll_clear(carddst->goodsids);
|
|
|
|
// del bads from dst
|
|
ll_clear(carddst->badsids);
|
|
|
|
// add bads from src
|
|
it = ll_iter_create(cardsrc->badsids);
|
|
while((srvidb = ll_iter_next(&it)))
|
|
{
|
|
{ add_sid_block(carddst, (struct cc_srvid*)srvidb, false); }
|
|
}
|
|
}
|
|
else
|
|
{
|
|
// add good sid good+notbad from src
|
|
it = ll_iter_create(cardsrc->goodsids);
|
|
while((srvid = ll_iter_next(&it)))
|
|
{
|
|
if(!is_sid_blocked(cardsrc, srvid))
|
|
{ add_good_sid(carddst, srvid); }
|
|
}
|
|
}
|
|
}
|
|
|
|
}
|
|
|
|
/**
|
|
* Adds a new card to a cardlist.
|
|
*/
|
|
int32_t add_card_to_serverlist(LLIST *cardlist, struct cc_card *card, int8_t free_card)
|
|
{
|
|
|
|
int32_t modified = 0;
|
|
if(!card)
|
|
{ return modified; }
|
|
|
|
LL_ITER it = ll_iter_create(cardlist);
|
|
struct cc_card *card2;
|
|
|
|
// Minimize all, transmit just CAID, merge providers:
|
|
if(cfg.cc_minimize_cards == MINIMIZE_CAID && !cfg.cc_forward_origin_card)
|
|
{
|
|
while((card2 = ll_iter_next(&it)))
|
|
{
|
|
// compare caid, hexserial, cardtype and sidtab (if any):
|
|
if(same_card2(card, card2, 0))
|
|
{
|
|
// Merge cards only if resulting providercount is smaller than CS_MAXPROV
|
|
int32_t nsame, ndiff, nnew;
|
|
|
|
nsame = num_same_providers(card, card2); // count same cards
|
|
ndiff = ll_count(card->providers) - nsame; // cound different cards, this cound will be added
|
|
nnew = ndiff + ll_count(card2->providers); // new card count after add. because its limited to CS_MAXPROV, dont add it
|
|
|
|
if(nnew <= CS_MAXPROV)
|
|
{ break; }
|
|
}
|
|
}
|
|
|
|
if(!card2) // Not found->add it:
|
|
{
|
|
if(free_card) // Use this card
|
|
{
|
|
free_card = 0;
|
|
ll_iter_insert(&it, card);
|
|
}
|
|
else
|
|
{
|
|
card2 = create_card(card); // Copy card
|
|
if(!card2)
|
|
{ return modified; }
|
|
card2->hop = 0;
|
|
ll_iter_insert(&it, card2);
|
|
add_card_providers(card2, card, 1); // copy providers to new card. Copy remote nodes to new card
|
|
}
|
|
modified = 1;
|
|
|
|
}
|
|
else // found, merge providers:
|
|
{
|
|
card_dup_count++;
|
|
card2->grp |= card->grp; // add group to the card
|
|
add_card_providers(card2, card, 0); // merge all providers
|
|
ll_clear_data(card2->remote_nodes); // clear remote nodes
|
|
merge_sids(card2, card);
|
|
}
|
|
}
|
|
|
|
// Removed duplicate cards, keeping card with lower hop:
|
|
else if(cfg.cc_minimize_cards == MINIMIZE_HOPS && !cfg.cc_forward_origin_card)
|
|
{
|
|
while((card2 = ll_iter_next(&it)))
|
|
{
|
|
// compare caid, hexserial, cardtype, sidtab (if any), providers:
|
|
if(same_card2(card, card2, 0) && equal_providers(card, card2))
|
|
{
|
|
break;
|
|
}
|
|
}
|
|
|
|
if(card2 && card2->hop > card->hop) // hop is smaller, drop old card
|
|
{
|
|
ll_iter_remove(&it);
|
|
cc_free_card(card2);
|
|
card2 = NULL;
|
|
card_dup_count++;
|
|
}
|
|
|
|
if(!card2) // Not found->add it:
|
|
{
|
|
if(free_card) // use this card
|
|
{
|
|
free_card = 0;
|
|
ll_iter_insert(&it, card);
|
|
}
|
|
else
|
|
{
|
|
card2 = create_card(card); // copy card
|
|
if(!card2)
|
|
{ return modified; }
|
|
ll_iter_insert(&it, card2);
|
|
add_card_providers(card2, card, 1); // copy providers to new card. Copy remote nodes to new card
|
|
}
|
|
modified = 1;
|
|
}
|
|
else // found, merge cards (providers are same!)
|
|
{
|
|
card_dup_count++;
|
|
card2->grp |= card->grp; //add group to the card
|
|
add_card_providers(card2, card, 0);
|
|
merge_sids(card2, card);
|
|
}
|
|
|
|
}
|
|
// like cccam:
|
|
else // just remove duplicate cards (same ids)
|
|
{
|
|
while((card2 = ll_iter_next(&it)))
|
|
{
|
|
// compare remote_id, first_node, caid, hexserial, cardtype, sidtab (if any), providers:
|
|
if(same_card(card, card2))
|
|
{ break; }
|
|
}
|
|
|
|
if(card2 && card2->hop > card->hop) // same card, if hop greater drop card
|
|
{
|
|
ll_iter_remove(&it);
|
|
cc_free_card(card2);
|
|
card2 = NULL;
|
|
card_dup_count++;
|
|
}
|
|
if(!card2) // Not found, add it:
|
|
{
|
|
if(free_card)
|
|
{
|
|
free_card = 0;
|
|
ll_iter_insert(&it, card);
|
|
}
|
|
else
|
|
{
|
|
card2 = create_card(card);
|
|
if(!card2)
|
|
{ return modified; }
|
|
ll_iter_insert(&it, card2);
|
|
add_card_providers(card2, card, 1);
|
|
}
|
|
modified = 1;
|
|
}
|
|
else // Found, everything is same (including providers)
|
|
{
|
|
card_dup_count++;
|
|
}
|
|
}
|
|
|
|
if(free_card)
|
|
{ cc_free_card(card); }
|
|
|
|
return modified;
|
|
}
|
|
|
|
/**
|
|
* returns true if timeout-time is reached
|
|
* only local cards needs to be renewed after 1h. "O" CCCam throws away cards older than 1,2h
|
|
**/
|
|
int32_t card_timed_out(struct cc_card *card)
|
|
{
|
|
//!=CT_REMOTECARD = LOCALCARD (or virtual cards by caid/ident/service)
|
|
//timeout is set in future, so if current time is bigger, timeout is reached
|
|
int32_t res = (card->card_type != CT_REMOTECARD) && (card->timeout < time(NULL)); //local card is older than 1h?
|
|
if(res)
|
|
{ cs_log_dbg(D_TRACE, "card %08X timed out! refresh forced", card->id ? card->id : card->origin_id); }
|
|
return res;
|
|
}
|
|
|
|
/**
|
|
* returns true if card1 is already reported.
|
|
* "reported" means, we already have this card1 in our sharelist.
|
|
* if the card1 is already reported, we throw it away, because we build a new sharelist
|
|
* so after finding all reported cards, we have a list of reported cards, which aren't used anymore
|
|
**/
|
|
int32_t find_reported_card(struct cc_card *card1)
|
|
{
|
|
LL_ITER it = ll_iter_create(get_cardlist(card1->caid, reported_carddatas_list));
|
|
struct cc_card *card2;
|
|
while((card2 = ll_iter_next(&it)))
|
|
{
|
|
if(same_card(card1, card2) && !card_timed_out(card2))
|
|
{
|
|
card1->id = card2->id; //Set old id !!
|
|
card1->timeout = card2->timeout;
|
|
cc_free_card(card2);
|
|
ll_iter_remove(&it);
|
|
return 1; //Old card and new card are equal!
|
|
}
|
|
}
|
|
return 0; //Card not found
|
|
}
|
|
|
|
/**
|
|
* Server:
|
|
* Adds a cccam-carddata buffer to the list of reported carddatas
|
|
*/
|
|
void cc_add_reported_carddata(LLIST *reported_carddatas, struct cc_card *card)
|
|
{
|
|
ll_append(reported_carddatas, card);
|
|
}
|
|
|
|
/**
|
|
* adds the card to the list of the new reported carddatas - this is the new sharelist
|
|
* if this card is not already reported, we send them to the clients
|
|
* if this card is already reported, find_reported_card throws the "origin" card away
|
|
* so the "old" sharelist is reduced
|
|
**/
|
|
void report_card(struct cc_card *card, LLIST *new_reported_carddatas, LLIST *new_cards)
|
|
{
|
|
if(!find_reported_card(card)) //Add new card:
|
|
{
|
|
|
|
cs_log_dbg(D_TRACE, "s-card added: id %8X remoteid %8X caid %4X hop %d reshare %d originid %8X cardtype %d",
|
|
card->id, card->remote_id, card->caid, card->hop, card->reshare, card->origin_id, card->card_type);
|
|
|
|
ll_append(new_cards, card);
|
|
|
|
card_added_count++;
|
|
}
|
|
cc_add_reported_carddata(new_reported_carddatas, card);
|
|
}
|
|
|
|
|
|
/**
|
|
* Server:
|
|
* Reports all caid/providers to the connected clients
|
|
* returns 1=ok, 0=error
|
|
* cfg.cc_reshare_services =0 CCCAM reader reshares only received cards + defined reader services
|
|
* =1 CCCAM reader reshares received cards + defined services
|
|
* =2 CCCAM reader reshares only defined reader-services as virtual cards
|
|
* =3 CCCAM reader reshares only defined user-services as virtual cards
|
|
* =4 CCCAM reader reshares only received cards
|
|
*/
|
|
void update_card_list(void)
|
|
{
|
|
int32_t i, j, k, l, card_count = 0;
|
|
|
|
LLIST *server_cards[CAID_KEY];
|
|
LLIST *new_reported_carddatas[CAID_KEY];
|
|
|
|
LL_ITER it, it2;
|
|
struct cc_card *card;
|
|
|
|
memset(server_cards, 0, sizeof(server_cards));
|
|
memset(new_reported_carddatas, 0, sizeof(new_reported_carddatas));
|
|
|
|
card_added_count = 0;
|
|
card_removed_count = 0;
|
|
card_dup_count = 0;
|
|
|
|
//User-Services:
|
|
if(cfg.cc_reshare_services == 3 && cfg.sidtab)
|
|
{
|
|
struct s_sidtab *ptr;
|
|
for(j = 0, ptr = cfg.sidtab; ptr; ptr = ptr->next, j++)
|
|
{
|
|
for(k = 0; k < ptr->num_caid; k++)
|
|
{
|
|
card = create_card2(NULL, (j << 8) | k, ptr->caid[k], cfg.cc_reshare);
|
|
if(!card)
|
|
{ return; }
|
|
card->card_type = CT_CARD_BY_SERVICE_USER;
|
|
card->sidtab = ptr;
|
|
for(l = 0; l < ptr->num_provid; l++)
|
|
{
|
|
struct cc_provider *prov;
|
|
if(!cs_malloc(&prov, sizeof(struct cc_provider)))
|
|
{ return; }
|
|
prov->prov = ptr->provid[l];
|
|
ll_append(card->providers, prov);
|
|
}
|
|
|
|
add_card_to_serverlist(get_cardlist(card->caid, server_cards), card, 1);
|
|
}
|
|
flt = 1;
|
|
}
|
|
}
|
|
else
|
|
{
|
|
struct s_reader *rdr;
|
|
int32_t r = 0;
|
|
|
|
cs_readlock(__func__, &readerlist_lock);
|
|
|
|
for(rdr = first_active_reader; rdr; rdr = rdr->next)
|
|
{
|
|
//Generate a uniq reader id:
|
|
if(!rdr->cc_id)
|
|
{
|
|
rdr->cc_id = ++r;
|
|
struct s_reader *rdr2;
|
|
for(rdr2 = first_active_reader; rdr2; rdr2 = rdr2->next)
|
|
{
|
|
if(rdr2 != rdr && rdr2->cc_id == rdr->cc_id)
|
|
{
|
|
rdr2 = first_active_reader;
|
|
rdr->cc_id = ++r;
|
|
}
|
|
}
|
|
}
|
|
|
|
flt = 0;
|
|
|
|
int8_t reshare = rdr->cc_reshare > -1 ? rdr->cc_reshare : cfg.cc_reshare;
|
|
|
|
//Reader-Services:
|
|
if((cfg.cc_reshare_services == 1 || cfg.cc_reshare_services == 2 || (!rdr->caid && rdr->typ != R_CCCAM && cfg.cc_reshare_services != 4)) &&
|
|
cfg.sidtab && (rdr->sidtabs.no || rdr->sidtabs.ok))
|
|
{
|
|
struct s_sidtab *ptr;
|
|
for(j = 0, ptr = cfg.sidtab; ptr; ptr = ptr->next, j++)
|
|
{
|
|
if(!(rdr->sidtabs.no & ((SIDTABBITS)1 << j)) && (rdr->sidtabs.ok & ((SIDTABBITS)1 << j)))
|
|
{
|
|
for(k = 0; k < ptr->num_caid; k++)
|
|
{
|
|
card = create_card2(rdr, (j << 8) | k, ptr->caid[k], reshare);
|
|
if(!card)
|
|
{
|
|
cs_readunlock(__func__, &readerlist_lock);
|
|
return;
|
|
}
|
|
card->card_type = CT_CARD_BY_SERVICE_READER;
|
|
card->sidtab = ptr;
|
|
for(l = 0; l < ptr->num_provid; l++)
|
|
{
|
|
struct cc_provider *prov;
|
|
if(!cs_malloc(&prov, sizeof(struct cc_provider)))
|
|
{
|
|
cs_readunlock(__func__, &readerlist_lock);
|
|
return;
|
|
}
|
|
prov->prov = ptr->provid[l];
|
|
ll_append(card->providers, prov);
|
|
}
|
|
|
|
if(chk_ident(&rdr->ftab, card) && chk_ctab(card->caid, &rdr->ctab))
|
|
{
|
|
if(!rdr->audisabled)
|
|
{ cc_UA_oscam2cccam(rdr->hexserial, card->hexserial, card->caid); }
|
|
|
|
add_card_to_serverlist(get_cardlist(card->caid, server_cards), card, 1);
|
|
flt = 1;
|
|
}
|
|
else
|
|
{ cc_free_card(card); }
|
|
}
|
|
}
|
|
}
|
|
}
|
|
|
|
//Filts by Hardware readers:
|
|
if((rdr->typ != R_CCCAM) && rdr->ftab.filts && !flt)
|
|
{
|
|
for(j = 0; j < rdr->ftab.nfilts; j++)
|
|
{
|
|
uint16_t caid = rdr->ftab.filts[j].caid;
|
|
if(caid)
|
|
{
|
|
card = create_card2(rdr, j, caid, reshare);
|
|
if(!card)
|
|
{
|
|
cs_readunlock(__func__, &readerlist_lock);
|
|
return;
|
|
}
|
|
card->card_type = CT_LOCALCARD;
|
|
|
|
//Setting UA: (Unique Address):
|
|
if(!rdr->audisabled)
|
|
{ cc_UA_oscam2cccam(rdr->hexserial, card->hexserial, caid); }
|
|
//cs_log("Ident CCcam card report caid: %04X readr %s subid: %06X", rdr->ftab.filts[j].caid, rdr->label, rdr->cc_id);
|
|
for(k = 0; k < rdr->ftab.filts[j].nprids; k++)
|
|
{
|
|
struct cc_provider *prov;
|
|
if(!cs_malloc(&prov, sizeof(struct cc_provider)))
|
|
{
|
|
cs_readunlock(__func__, &readerlist_lock);
|
|
return;
|
|
}
|
|
prov->prov = rdr->ftab.filts[j].prids[k];
|
|
|
|
//cs_log("Ident CCcam card report provider: %02X%02X%02X", buf[21 + (k*7)]<<16, buf[22 + (k*7)], buf[23 + (k*7)]);
|
|
if(!rdr->audisabled)
|
|
{
|
|
for(l = 0; l < rdr->nprov; l++)
|
|
{
|
|
uint32_t rprid = get_reader_prid(rdr, l);
|
|
if(rprid == prov->prov)
|
|
{ cc_SA_oscam2cccam(&rdr->sa[l][0], prov->sa); }
|
|
}
|
|
}
|
|
|
|
ll_append(card->providers, prov);
|
|
}
|
|
|
|
add_good_bad_sids_by_rdr(rdr, card);
|
|
add_card_to_serverlist(get_cardlist(caid, server_cards), card, 1);
|
|
flt = 1;
|
|
}
|
|
}
|
|
}
|
|
|
|
if((rdr->typ != R_CCCAM) && !rdr->caid && !flt)
|
|
{
|
|
for(j = 0; j < rdr->ctab.ctnum; j++)
|
|
{
|
|
CAIDTAB_DATA *d = &rdr->ctab.ctdata[j];
|
|
//cs_log("CAID map CCcam card report caid: %04X cmap: %04X", d->caid, d->cmap);
|
|
uint16_t lcaid = d->caid;
|
|
|
|
if(!lcaid || (lcaid == 0xFFFF))
|
|
{ lcaid = d->cmap; }
|
|
|
|
if(lcaid && (lcaid != 0xFFFF))
|
|
{
|
|
card = create_card2(rdr, j, lcaid, reshare);
|
|
if(!card)
|
|
{
|
|
cs_readunlock(__func__, &readerlist_lock);
|
|
return;
|
|
}
|
|
card->card_type = CT_CARD_BY_CAID1;
|
|
if(!rdr->audisabled)
|
|
{ cc_UA_oscam2cccam(rdr->hexserial, card->hexserial, lcaid); }
|
|
|
|
add_good_bad_sids_by_rdr(rdr, card);
|
|
add_card_to_serverlist(get_cardlist(lcaid, server_cards), card, 1);
|
|
flt = 1;
|
|
}
|
|
}
|
|
}
|
|
|
|
if((rdr->typ != R_CCCAM) && rdr->ctab.ctnum && !flt)
|
|
{
|
|
//cs_log("tcp_connected: %d card_status: %d ", rdr->tcp_connected, rdr->card_status);
|
|
int32_t c;
|
|
if(rdr->tcp_connected || rdr->card_status == CARD_INSERTED)
|
|
{
|
|
for(c = 0; c < rdr->ctab.ctnum; c++)
|
|
{
|
|
CAIDTAB_DATA *d = &rdr->ctab.ctdata[c];
|
|
uint16_t caid = d->caid;
|
|
if(!caid) { break; }
|
|
|
|
card = create_card2(rdr, c, caid, reshare);
|
|
if(!card)
|
|
{ break; }
|
|
card->card_type = CT_CARD_BY_CAID2;
|
|
|
|
if(!rdr->audisabled)
|
|
{ cc_UA_oscam2cccam(rdr->hexserial, card->hexserial, caid); }
|
|
for(j = 0; j < rdr->nprov; j++)
|
|
{
|
|
uint32_t prid = get_reader_prid(rdr, j);
|
|
struct cc_provider *prov;
|
|
if(!cs_malloc(&prov, sizeof(struct cc_provider)))
|
|
{
|
|
cs_readunlock(__func__, &readerlist_lock);
|
|
return;
|
|
}
|
|
prov->prov = prid;
|
|
//cs_log("Ident CCcam card report provider: %02X%02X%02X", buf[21 + (k*7)]<<16, buf[22 + (k*7)], buf[23 + (k*7)]);
|
|
if(!rdr->audisabled)
|
|
{
|
|
//Setting SA (Shared Addresses):
|
|
cc_SA_oscam2cccam(rdr->sa[j], prov->sa);
|
|
}
|
|
ll_append(card->providers, prov);
|
|
//cs_log("Main CCcam card report provider: %02X%02X%02X%02X", buf[21+(j*7)], buf[22+(j*7)], buf[23+(j*7)], buf[24+(j*7)]);
|
|
}
|
|
add_good_bad_sids_by_rdr(rdr, card);
|
|
add_card_to_serverlist(get_cardlist(caid, server_cards), card, 1);
|
|
flt = 1;
|
|
}
|
|
}
|
|
}
|
|
|
|
|
|
if((rdr->typ != R_CCCAM) && rdr->caid && !flt)
|
|
{
|
|
//cs_log("tcp_connected: %d card_status: %d ", rdr->tcp_connected, rdr->card_status);
|
|
if(rdr->tcp_connected || rdr->card_status == CARD_INSERTED)
|
|
{
|
|
uint16_t caid = rdr->caid;
|
|
card = create_card2(rdr, 1, caid, reshare);
|
|
if(!card)
|
|
{
|
|
cs_readunlock(__func__, &readerlist_lock);
|
|
return;
|
|
}
|
|
card->card_type = CT_CARD_BY_CAID3;
|
|
|
|
if(!rdr->audisabled)
|
|
{ cc_UA_oscam2cccam(rdr->hexserial, card->hexserial, caid); }
|
|
for(j = 0; j < rdr->nprov; j++)
|
|
{
|
|
uint32_t prid = get_reader_prid(rdr, j);
|
|
struct cc_provider *prov;
|
|
if(!cs_malloc(&prov, sizeof(struct cc_provider)))
|
|
{
|
|
cs_readunlock(__func__, &readerlist_lock);
|
|
return;
|
|
}
|
|
prov->prov = prid;
|
|
//cs_log("Ident CCcam card report provider: %02X%02X%02X", buf[21 + (k*7)]<<16, buf[22 + (k*7)], buf[23 + (k*7)]);
|
|
if(!rdr->audisabled)
|
|
{
|
|
//Setting SA (Shared Addresses):
|
|
cc_SA_oscam2cccam(rdr->sa[j], prov->sa);
|
|
}
|
|
ll_append(card->providers, prov);
|
|
//cs_log("Main CCcam card report provider: %02X%02X%02X%02X", buf[21+(j*7)], buf[22+(j*7)], buf[23+(j*7)], buf[24+(j*7)]);
|
|
}
|
|
add_good_bad_sids_by_rdr(rdr, card);
|
|
add_card_to_serverlist(get_cardlist(caid, server_cards), card, 1);
|
|
}
|
|
}
|
|
|
|
if(rdr->typ == R_CCCAM && rdr->tcp_connected &&
|
|
(cfg.cc_reshare_services < 2 || cfg.cc_reshare_services == 4) && rdr->card_status != CARD_FAILURE)
|
|
{
|
|
|
|
cs_log_dbg(D_TRACE, "asking reader %s for cards...", rdr->label);
|
|
|
|
struct s_client *rc = rdr->client;
|
|
struct cc_data *rcc = rc ? rc->cc : NULL;
|
|
|
|
int32_t count = 0;
|
|
if(rcc && rcc->cards && !rc->kill)
|
|
{
|
|
cs_readlock(__func__, &rcc->cards_busy);
|
|
|
|
it = ll_iter_create(rcc->cards);
|
|
while((card = ll_iter_next(&it)))
|
|
{
|
|
if(chk_ctab(card->caid, &rdr->ctab))
|
|
{
|
|
int32_t dont_ignore = ll_count(card->providers) ? 0 : 1;
|
|
|
|
it2 = ll_iter_create(card->providers);
|
|
struct cc_provider *prov;
|
|
while((prov = ll_iter_next(&it2)))
|
|
{
|
|
uint32_t prid = prov->prov;
|
|
if(chk_srvid_by_caid_prov(rc, card->caid, prid))
|
|
{
|
|
dont_ignore = 1;
|
|
break;
|
|
}
|
|
}
|
|
|
|
if(dont_ignore) //Filtered by service
|
|
{
|
|
add_card_to_serverlist(get_cardlist(card->caid, server_cards), card, 0);
|
|
count++;
|
|
}
|
|
}
|
|
}
|
|
cs_readunlock(__func__, &rcc->cards_busy);
|
|
}
|
|
else
|
|
{ cs_log_dbg(D_TRACE, "reader %s not active!", rdr->label); }
|
|
cs_log_dbg(D_TRACE, "got %d cards from %s", count, rdr->label);
|
|
}
|
|
}
|
|
cs_readunlock(__func__, &readerlist_lock);
|
|
}
|
|
|
|
LLIST *new_cards = ll_create("new_cards"); //List of new (added) cards
|
|
|
|
cs_writelock(__func__, &cc_shares_lock);
|
|
|
|
//report reshare cards:
|
|
//cs_log_dbg(D_TRACE, "%s reporting %d cards", getprefix(), ll_count(server_cards));
|
|
for(i = 0; i < CAID_KEY; i++)
|
|
{
|
|
if(server_cards[i])
|
|
{
|
|
it = ll_iter_create(server_cards[i]);
|
|
|
|
//we compare every card of our new list (server_cards) with the last list.
|
|
while((card = ll_iter_next(&it)))
|
|
{
|
|
//cs_log_dbg(D_TRACE, "%s card %d caid %04X hop %d", getprefix(), card->id, card->caid, card->hop);
|
|
|
|
if(!new_reported_carddatas[i])
|
|
{ new_reported_carddatas[i] = ll_create("new_cardlist"); }
|
|
report_card(card, new_reported_carddatas[i], new_cards);
|
|
ll_iter_remove(&it);
|
|
}
|
|
cc_free_cardlist(server_cards[i], 1);
|
|
}
|
|
|
|
//remove unsed, remaining cards:
|
|
card_removed_count += cc_free_reported_carddata(reported_carddatas_list[i], new_reported_carddatas[i], 1);
|
|
reported_carddatas_list[i] = new_reported_carddatas[i];
|
|
card_count += ll_count(reported_carddatas_list[i]);
|
|
//cs_log_dbg(D_TRACE, "CARDS FOR INDEX %d=%d", i, ll_count(reported_carddatas[i]));
|
|
}
|
|
|
|
//now send new cards. Always remove first, then add new:
|
|
it = ll_iter_create(new_cards);
|
|
while((card = ll_iter_next(&it)))
|
|
{
|
|
send_card_to_all_clients(card);
|
|
}
|
|
ll_destroy(&new_cards);
|
|
|
|
|
|
cs_writeunlock(__func__, &cc_shares_lock);
|
|
|
|
cs_log_dbg(D_TRACE, "reported/updated +%d/-%d/dup %d of %d cards to sharelist",
|
|
card_added_count, card_removed_count, card_dup_count, card_count);
|
|
}
|
|
|
|
int32_t cc_srv_report_cards(struct s_client *cl)
|
|
{
|
|
|
|
struct cc_card *card;
|
|
int32_t i, count = 0;
|
|
LL_ITER it;
|
|
cs_readlock(__func__, &cc_shares_lock);
|
|
for(i = 0; i < CAID_KEY; i++)
|
|
{
|
|
if(reported_carddatas_list[i])
|
|
{
|
|
it = ll_iter_create(reported_carddatas_list[i]);
|
|
while(cl->cc && !cl->kill && (card = ll_iter_next(&it)))
|
|
{
|
|
count += send_card_to_client(card, cl);
|
|
}
|
|
}
|
|
}
|
|
cs_readunlock(__func__, &cc_shares_lock);
|
|
cs_log_dbg(D_TRACE, "reported %d cards for %s", count, username(cl));
|
|
|
|
return cl->cc && !cl->kill;
|
|
}
|
|
|
|
void refresh_shares(void)
|
|
{
|
|
update_card_list();
|
|
}
|
|
|
|
#define DEFAULT_INTERVAL 30
|
|
|
|
void share_updater(void)
|
|
{
|
|
int32_t i = DEFAULT_INTERVAL + cfg.waitforcards_extra_delay / 1000;
|
|
uint32_t last_check = 0;
|
|
uint32_t last_check_rdroptions = 0;
|
|
uint32_t cur_check_rdroptions = 0;
|
|
uint32_t last_card_check = 0;
|
|
uint32_t last_sidtab_generation = 0;
|
|
uint32_t card_count = 0;
|
|
while(share_updater_thread_active)
|
|
{
|
|
const uint32_t sleep_step = 500;
|
|
uint32_t sleep_time;
|
|
uint32_t slept;
|
|
if(i > 0 && card_count < 100) //fast refresh only if we have less cards
|
|
{
|
|
cs_log_dbg(D_TRACE, "share-updater mode=initfast t=1s i=%d", i);
|
|
sleep_time = 1000;
|
|
i--;
|
|
}
|
|
else if(i > 0)
|
|
{
|
|
cs_log_dbg(D_TRACE, "share-updater mode=initslow t=6s i=%d", i);
|
|
sleep_time = 6000; //1s later than garbage collector because this list uses much space
|
|
i -= 6;
|
|
}
|
|
else
|
|
{
|
|
if(cfg.cc_update_interval <= 10)
|
|
{ cfg.cc_update_interval = DEFAULT_UPDATEINTERVAL; }
|
|
cs_log_dbg(D_TRACE, "share-updater mode=interval t=%ds", cfg.cc_update_interval);
|
|
sleep_time = cfg.cc_update_interval * 1000;
|
|
}
|
|
for(slept = 0; slept < sleep_time; slept += sleep_step)
|
|
{
|
|
if(!share_updater_thread_active || share_updater_refresh)
|
|
{
|
|
share_updater_refresh = 0;
|
|
break;
|
|
}
|
|
cs_sleepms(sleep_step);
|
|
}
|
|
if(!share_updater_thread_active)
|
|
{ break; }
|
|
|
|
cs_log_dbg(D_TRACE, "share-updater check");
|
|
|
|
uint32_t cur_check = 0;
|
|
uint32_t cur_card_check = 0;
|
|
int8_t rdroptionchange = 0;
|
|
card_count = 0;
|
|
struct s_reader *rdr;
|
|
struct cc_data *cc;
|
|
|
|
cs_readlock(__func__, &readerlist_lock);
|
|
|
|
for(rdr = first_active_reader; rdr; rdr = rdr->next)
|
|
{
|
|
struct s_client *cl = rdr->client;
|
|
if(cl && (cc = cl->cc)) //check cccam-cardlist:
|
|
{
|
|
cur_card_check += cc->card_added_count;
|
|
cur_card_check += cc->card_removed_count;
|
|
card_count += ll_count(cc->cards);
|
|
}
|
|
cur_check = crc32(cur_check, (uint8_t *)&rdr->tcp_connected, sizeof(rdr->tcp_connected));
|
|
cur_check = crc32(cur_check, (uint8_t *)&rdr->card_status, sizeof(rdr->card_status));
|
|
|
|
//Check hexserial/UA changes only on lokal readers:
|
|
if(!is_network_reader(rdr))
|
|
{
|
|
cur_check = crc32(cur_check, (uint8_t *)&rdr->hexserial, 8); //check hexserial
|
|
cur_check = crc32(cur_check, (uint8_t *)&rdr->prid, rdr->nprov * sizeof(rdr->prid[0])); //check providers
|
|
cur_check = crc32(cur_check, (uint8_t *)&rdr->sa, rdr->nprov * sizeof(rdr->sa[0])); //check provider-SA
|
|
}
|
|
|
|
if(rdr->changes_since_shareupdate)
|
|
{
|
|
rdr->changes_since_shareupdate = 0;
|
|
rdroptionchange = 1;
|
|
}
|
|
}
|
|
if(rdroptionchange)
|
|
{
|
|
cur_check_rdroptions = 0;
|
|
for(rdr = first_active_reader; rdr; rdr = rdr->next)
|
|
{
|
|
cur_check_rdroptions = crc32(cur_check_rdroptions, (uint8_t *)&rdr->ftab, sizeof(FTAB)); //check reader
|
|
cur_check_rdroptions = crc32(cur_check_rdroptions, (uint8_t *)&rdr->ctab, sizeof(CAIDTAB)); //check caidtab
|
|
cur_check_rdroptions = crc32(cur_check_rdroptions, (uint8_t *)&rdr->fchid, sizeof(FTAB)); //check chids
|
|
cur_check_rdroptions = crc32(cur_check_rdroptions, (uint8_t *)&rdr->sidtabs.ok, sizeof(rdr->sidtabs.ok)); //check assigned ok services
|
|
cur_check_rdroptions = crc32(cur_check_rdroptions, (uint8_t *)&rdr->sidtabs.no, sizeof(rdr->sidtabs.no)); //check assigned no services
|
|
}
|
|
}
|
|
|
|
cs_readunlock(__func__, &readerlist_lock);
|
|
|
|
//update cardlist if reader config has changed, also set interval to 1s / 30times
|
|
if(cur_check != last_check || last_sidtab_generation != cfg_sidtab_generation || last_check_rdroptions != cur_check_rdroptions)
|
|
{
|
|
last_sidtab_generation = cfg_sidtab_generation;
|
|
i = DEFAULT_INTERVAL;
|
|
cs_log_dbg(D_TRACE, "share-update [1] %u %u", cur_check, last_check);
|
|
refresh_shares();
|
|
last_check = cur_check;
|
|
last_card_check = cur_card_check;
|
|
}
|
|
//update cardlist if cccam cards has changed:
|
|
else if(cur_card_check != last_card_check)
|
|
{
|
|
cs_log_dbg(D_TRACE, "share-update [2] %u %u", cur_card_check, last_card_check);
|
|
refresh_shares();
|
|
last_card_check = cur_card_check;
|
|
}
|
|
last_check_rdroptions = cur_check_rdroptions;
|
|
}
|
|
for(i = 0; i < CAID_KEY; i++)
|
|
{ cc_free_reported_carddata(reported_carddatas_list[i], NULL, 0); }
|
|
}
|
|
|
|
void cccam_init_share(void)
|
|
{
|
|
memset(reported_carddatas_list, 0, sizeof(reported_carddatas_list));
|
|
cs_lock_create(__func__, &cc_shares_lock, "cc_shares_lock", 200000);
|
|
|
|
share_updater_thread = 0;
|
|
share_updater_thread_active = 1;
|
|
share_updater_refresh = 0;
|
|
|
|
pthread_t temp;
|
|
int32_t ret = start_thread("share updater", (void *)&share_updater, NULL, &temp, 1, 1);
|
|
if(!ret)
|
|
{
|
|
share_updater_thread = temp;
|
|
}
|
|
}
|
|
|
|
void cccam_done_share(void)
|
|
{
|
|
if(share_updater_thread)
|
|
{
|
|
share_updater_thread_active = 0;
|
|
share_updater_thread = 0;
|
|
}
|
|
}
|
|
|
|
void cccam_refresh_share(void)
|
|
{
|
|
share_updater_refresh = 1;
|
|
}
|
|
#endif
|