HomeSort by: relevance | last modified time | path
    Searched refs:goto_queue (Results 1 - 2 of 2) sorted by relevancy

  /src/external/gpl3/gcc/dist/gcc/
tree-eh.cc 321 /* The GOTO_QUEUE is an array of GIMPLE_GOTO and GIMPLE_RETURN
385 struct goto_queue_node *goto_queue; member in struct:leh_tf_state
389 /* Pointer map to help in searching goto_queue when it is large. */
404 /* True if any entry in goto_queue is a GIMPLE_RETURN. */
429 if ( tf->goto_queue[i].stmt.g == stmt.g)
430 return tf->goto_queue[i].repl_stmt;
434 /* If we have a large number of entries in the goto_queue, create a
442 bool existed = tf->goto_queue_map->put (tf->goto_queue[i].stmt.g,
443 &tf->goto_queue[i]);
599 tf->goto_queue
    [all...]
  /src/external/gpl3/gcc.old/dist/gcc/
tree-eh.cc 321 /* The GOTO_QUEUE is an array of GIMPLE_GOTO and GIMPLE_RETURN
385 struct goto_queue_node *goto_queue; member in struct:leh_tf_state
389 /* Pointer map to help in searching goto_queue when it is large. */
404 /* True if any entry in goto_queue is a GIMPLE_RETURN. */
429 if ( tf->goto_queue[i].stmt.g == stmt.g)
430 return tf->goto_queue[i].repl_stmt;
434 /* If we have a large number of entries in the goto_queue, create a
442 bool existed = tf->goto_queue_map->put (tf->goto_queue[i].stmt.g,
443 &tf->goto_queue[i]);
599 tf->goto_queue
    [all...]

Completed in 23 milliseconds