HomeSort by relevance Sort by last modified time
    Searched refs:parent_ids (Results 1 - 3 of 3) sorted by null

  /external/chromium_org/ppapi/shared_impl/
var_value_conversions.cc 68 bool CreateValueFromVarHelper(const std::set<int64_t>& parent_ids,
102 if (ContainsKey(parent_ids, var.value.as_id)) {
112 if (ContainsKey(parent_ids, var.value.as_id)) {
227 std::set<int64_t> parent_ids; local
231 if (!CreateValueFromVarHelper(parent_ids, var, &root_value, &state))
237 parent_ids.erase(top.var.value.as_id);
240 parent_ids.insert(top.var.value.as_id);
262 if (!CreateValueFromVarHelper(parent_ids, iter->second.get(),
270 parent_ids.insert(top.var.value.as_id);
285 if (!CreateValueFromVarHelper(parent_ids, iter->get(), &child_value
    [all...]
  /external/chromium_org/content/renderer/pepper/
v8_var_converter.cc 89 ParentVarSet* parent_ids) {
93 if (parent_ids->count(var.value.as_id) != 0)
286 ParentVarSet parent_ids; local
300 parent_ids.erase(current_var.value.as_id);
308 &visited_ids, &parent_ids)) {
319 parent_ids.insert(current_var.value.as_id);
332 &visited_ids, &parent_ids)) {
345 parent_ids.insert(current_var.value.as_id);
362 &visited_ids, &parent_ids)) {
  /external/chromium_org/ppapi/proxy/
raw_var_data.cc 79 // |parent_ids| which contains all of the nodes on the path from the start node
81 // in the list of |parent_ids| it means we have a cycle and we return NULL.
84 // stack and erase it from |parent_ids|.
91 base::hash_set<int64_t> parent_ids; local
104 parent_ids.erase(current_var.value.as_id);
109 parent_ids.insert(current_var.value.as_id);
127 // If a child of this node is already in parent_ids, we have a cycle so
129 if (CanHaveChildren(child) && parent_ids.count(child.value.as_id) != 0)
148 if (CanHaveChildren(child) && parent_ids.count(child.value.as_id) != 0)

Completed in 2733 milliseconds