| /external/bison/src/ |
| D | muscle-tab.c | 255 aver (result->value == result->storage); in muscle_find()
297 aver (*++(Value) == ']'); \
298 aver (*++(Value) == '['); \
307 default: aver (false); break; \
331 aver (false); in string_decode()
347 aver (value); in location_decode()
348 aver (*value == '['); in location_decode()
349 aver (*++value == '['); in location_decode()
355 aver (false); in location_decode()
360 aver (*++value == ']'); in location_decode()
[all …]
|
| D | state.c | 62 aver (j < shifts->num); in transitions_to()
136 aver (nstates < STATE_NUMBER_MAXIMUM); in state_new()
163 aver (nstates < STATE_NUMBER_MAXIMUM); in state_new_isocore()
205 aver (!s->transitions); in state_transitions_set()
217 aver (!s->reductions); in state_reductions_set()
241 aver (!s->errs); in state_errs_set()
|
| D | AnnotationList.c | 64 aver (0 <= ci && ci < self->inadequacyNode->contributionCount); in AnnotationList__isContributionAlways()
182 aver (i == 0 || reds->rules[i-1] < reds->rules[i]); in AnnotationList__compute_conflicted_tokens()
270 aver (s->items[self_item] > 1); in AnnotationList__computePredecessorAnnotations()
316 aver (predecessor_item != (*predecessor)->nitems); in AnnotationList__computePredecessorAnnotations()
487 aver (item_i < s->nitems); in AnnotationList__compute_from_inadequacies()
504 aver (!Sbitset__isEmpty (annotation_node->contributions[ci], in AnnotationList__compute_from_inadequacies()
544 aver (AnnotationList__insertInto ( in AnnotationList__compute_from_inadequacies()
551 aver (!bitset_test (shift_tokens, conflicted_token) in AnnotationList__compute_from_inadequacies()
610 aver (rulei != BITSET_BINDEX_MAX); in AnnotationList__debug()
|
| D | lalr.c | 91 aver (ngotos != GOTO_NUMBER_MAXIMUM); in set_goto_map()
145 aver (low <= high); in map_goto()
340 aver (sp->num == 0 || !TRANSITION_IS_DISABLED (sp, 0)); in state_lookahead_tokens_count()
465 aver (nsyms == nvars + ntokens); in lalr_update_state_numbers()
478 aver (old_to_new[to_state[i]] != nstates_old); in lalr_update_state_numbers()
487 aver (ngotos == goto_map[nonterminal]); in lalr_update_state_numbers()
|
| D | Sbitset.c | 29 aver (nbits); in Sbitset__new()
39 aver (nbits); in Sbitset__new_on_obstack()
|
| D | InadequacyList.c | 35 aver (*node_count != 0); in InadequacyList__new_conflict()
69 aver (0 <= i && i < self->contributionCount); in InadequacyList__getContributionToken()
|
| D | reader.c | 128 aver (merge_function != NULL && merger_find == merger); in record_merge_function_type()
575 aver (itemno < ITEM_NUMBER_MAX); in packgram()
577 aver (ruleno < RULE_NUMBER_MAX); in packgram()
583 aver (itemno == nritems); in packgram()
700 aver (node != NULL); in check_and_convert_grammar()
721 aver (nsyms <= SYMBOL_NUMBER_MAXIMUM && nsyms == ntokens + nvars); in check_and_convert_grammar()
|
| D | tables.c | 203 aver (0 < conflict_list_free); in conflict_row()
210 aver (0 < conflict_list_free); in conflict_row()
686 aver (t != 0); in pack_vector()
693 aver (j < table_size); in pack_vector()
726 aver (BASE_MINIMUM <= j && j <= BASE_MAXIMUM); in pack_vector()
|
| D | ielr.c | 427 aver (lhs != accept->number); in ielr_item_has_lookahead()
452 aver (predecessor_item != (*predecessor)->nitems); in ielr_item_has_lookahead()
628 aver (t->items[t_item] != 0); in ielr_compute_lookaheads()
652 aver (s_item != s->state->nitems); in ielr_compute_lookaheads()
828 aver (annotation_lists); in ielr_compute_state()
1063 aver (i < node->state->nitems); in ielr_split_states()
1105 aver (false); in ielr()
|
| D | output.c | 251 aver (i == nritems); in prepare_rules()
358 aver (number != USER_NUMBER_HAS_STRING_ALIAS); in token_definitions_output()
579 aver (i <= ARRAY_CARDINALITY (argv)); in output_skeleton()
610 aver (feof (in)); in output_skeleton()
|
| D | scan-skel.l | 199 default: aver (false); break;
240 default: aver (false); break;
|
| D | location.c | 222 aver (delim); in boundary_set_from_string()
226 aver (delim); in boundary_set_from_string()
|
| D | reduce.c | 443 aver (i < ntokens); in reduce_token_unused_in_grammar()
450 aver (ntokens <= i && i < nsyms + nuseless_nonterminals); in reduce_nonterminal_useless_in_grammar()
|
| D | system.h | 150 # define aver assert macro
|
| D | nullable.c | 105 aver (item_number_as_rule_number (rules_ruleno->rhs[0]) in nullable_compute()
|
| D | symlist.c | 214 aver (l->content_type == SYMLIST_SYMBOL); in symbol_list_n_type_name_get()
|
| D | LR0.c | 286 aver (!final_state); in save_reductions()
|
| D | symtab.c | 502 aver (this->number != NUMBER_UNDEFINED); in symbol_pack()
673 aver (!symbols_sorted); in symbol_from_uniqstr()
|
| D | scan-skel.c | 2319 default: aver (false); break; in at_directive_perform()
2360 default: aver (false); break; in at_directive_perform()
|
| D | print.c | 339 aver (0 == strcmp (default_reductions, "most") in print_reductions()
|
| D | scan-code.l | 120 aver (sc_context == SC_SYMBOL_ACTION
|
| D | scan-code.c | 1007 aver (sc_context == SC_SYMBOL_ACTION
|
| /external/llvm/test/CodeGen/Mips/msa/ |
| D | 3r-a.ll | 1000 %2 = tail call <16 x i8> @llvm.mips.aver.s.b(<16 x i8> %0, <16 x i8> %1)
1005 declare <16 x i8> @llvm.mips.aver.s.b(<16 x i8>, <16 x i8>) nounwind
1025 %2 = tail call <8 x i16> @llvm.mips.aver.s.h(<8 x i16> %0, <8 x i16> %1)
1030 declare <8 x i16> @llvm.mips.aver.s.h(<8 x i16>, <8 x i16>) nounwind
1050 %2 = tail call <4 x i32> @llvm.mips.aver.s.w(<4 x i32> %0, <4 x i32> %1)
1055 declare <4 x i32> @llvm.mips.aver.s.w(<4 x i32>, <4 x i32>) nounwind
1075 %2 = tail call <2 x i64> @llvm.mips.aver.s.d(<2 x i64> %0, <2 x i64> %1)
1080 declare <2 x i64> @llvm.mips.aver.s.d(<2 x i64>, <2 x i64>) nounwind
1100 %2 = tail call <16 x i8> @llvm.mips.aver.u.b(<16 x i8> %0, <16 x i8> %1)
1105 declare <16 x i8> @llvm.mips.aver.u.b(<16 x i8>, <16 x i8>) nounwind
[all …]
|
| /external/llvm/lib/Target/Mips/ |
| D | MipsScheduleP5600.td | 260 // aver?_[us].[bhwd]
|
| /external/avahi/po/ |
| D | it.po | 678 " -t --terminate Termina dopo aver riversato un elenco più\n"
680 " -c --cache Termina dopo aver riversato tutte le voci dalla "
|