Lines Matching defs:questions
67 static SWIsltsResult free_lquestions(LQUESTION ** questions, int num_questions);
76 static SWIsltsResult free_trees(RT_LTREE **trees, int num_letters, LQUESTION **questions, int num_questions, LM *lm);
182 LQUESTION ** questions;
188 pfprintf(PSTDOUT,"loading %d questions\n", num_questions);
191 *pquestions = questions = (LQUESTION**) lts_alloc(num_questions, sizeof(LQUESTION*));
192 if (questions == NULL) {
198 questions[i] = (LQUESTION*) lts_alloc(1, sizeof(LQUESTION));
199 if (questions[i] == NULL) {
208 PORT_FREAD_CHAR(&(questions[i]->type), sizeof(char), 1, fp);
209 PORT_FREAD_CHAR(&(questions[i]->num_list), sizeof(char), 1, fp);
211 questions[i]->list = (unsigned char*) lts_alloc(questions[i]->num_list, sizeof(unsigned char));
212 if (questions[i]->list == NULL) {
217 PORT_FREAD_CHAR(questions[i]->list, sizeof(char), (questions[i]->num_list), fp);
219 bitarray_populate_from_list( questions[i]->membership, (char*) questions[i]->list, questions[i]->num_list);
227 free_lquestions(questions, num_questions);
233 /* deallocate questions */
234 static SWIsltsResult free_lquestions(LQUESTION ** questions, int num_questions)
239 if (questions) {
241 if (questions[i]->list) {
242 FREE(questions[i]->list);
243 questions[i]->list = NULL;
245 FREE(questions[i]);
246 questions[i] = NULL;
248 FREE(questions);
519 pfprintf(PSTDOUT,"loading questions\n");
615 LQUESTION **questions, int num_questions, LM *lm)
624 if (questions) {
625 free_lquestions(questions, num_questions);
878 &(lts->questions), &(lts->num_questions),
924 lts->questions, lts->num_questions,
927 lts->questions = NULL;
1331 q1 = lts->questions[tree->values_or_question1[index]];
1335 q2 = lts->questions[q2_index];
