Lines Matching full:abort
236 if (c->abort.num < MAXABORTS) { in chat_UpdateSet()
240 for (i = 0; i < c->abort.num; i++) in chat_UpdateSet()
241 if (len > c->abort.string[i].len) { in chat_UpdateSet()
244 for (last = c->abort.num; last > i; last--) { in chat_UpdateSet()
245 c->abort.string[last].data = c->abort.string[last-1].data; in chat_UpdateSet()
246 c->abort.string[last].len = c->abort.string[last-1].len; in chat_UpdateSet()
250 c->abort.string[i].len = len; in chat_UpdateSet()
251 if ((c->abort.string[i].data = (char *)malloc(len+1)) != NULL) { in chat_UpdateSet()
252 memcpy(c->abort.string[i].data, c->exp+2, len+1); in chat_UpdateSet()
253 c->abort.num++; in chat_UpdateSet()
256 log_Printf(LogERROR, "chat_UpdateSet: too many abort strings\n"); in chat_UpdateSet()
263 } else if (c->nargptr == NULL && !strcmp(c->exp+2, "ABORT")) in chat_UpdateSet()
285 log_Printf(LogWARN, "chat_UpdateSet: ABORT: Argument expected\n"); in chat_UpdateSet()
407 if (c->abort.num) { in chat_Read()
408 abegin = c->bufend - c->abort.string[0].len + 1; in chat_Read()
409 aend = c->bufend - c->abort.string[c->abort.num-1].len + in + 1; in chat_Read()
471 for (n = c->abort.num - 1; n >= 0; n--) { in chat_Read()
472 if (begin + c->abort.string[n].len > c->bufend) in chat_Read()
474 if (!strncmp(begin, c->abort.string[n].data, in chat_Read()
475 c->abort.string[n].len)) { in chat_Read()
476 if (memchr(begin + c->abort.string[n].len - 1, '\n', in chat_Read()
477 c->bufend - begin - c->abort.string[n].len + 1) == NULL) { in chat_Read()
480 c->bufend = begin + c->abort.string[n].len; in chat_Read()
484 c->bufstart = begin + c->abort.string[n].len; in chat_Read()
590 c->abort.num = 0; in chat_Setup()
603 while (c->abort.num) in chat_Finish()
604 free(c->abort.string[--c->abort.num].data); in chat_Finish()
605 c->abort.num = 0; in chat_Finish()