Lines Matching +defs:label +defs:offset
8238 int offset;
10659 c_finish_goto_label (location_t loc, tree label)
10661 tree decl = lookup_label_for_goto (loc, label);
10833 "function returns address of label");
10874 determine whether or not a new case label duplicates an old case
10875 label. We need a tree, rather than simply a hash table, because
10880 warnings crossing decls when branching to a case label. */
10971 /* Process a case label at location LOC. */
10976 tree label = NULL_TREE;
10983 "case label is not an integer constant expression");
10991 "case label is not an integer constant expression");
10997 error_at (loc, "case label not within a switch statement");
10999 error_at (loc, "%<default%> label not within a switch statement");
11008 label = c_add_case_label (loc, c_switch_stack->cases,
11011 if (label == error_mark_node)
11012 label = NULL_TREE;
11013 return label;
11061 the statement controlled by the loop. BLAB is the break label. CLAB is
11062 the continue label. Everything is allowed to be NULL.
11096 continue label, if possible. */
11160 tree label = *label_p;
11171 if (!label)
11174 *label_p = label = create_artificial_label (loc);
11176 else if (TREE_CODE (label) == LABEL_DECL)
11178 else switch (TREE_INT_CST_LOW (label))
11209 return add_stmt (build1 (GOTO_EXPR, void_type_node, label));
14499 tree offset = TREE_PURPOSE (t);
14500 bool neg = wi::neg_p (wi::to_wide (offset));
14501 offset = fold_unary (ABS_EXPR, TREE_TYPE (offset), offset);
14504 decl, offset);